论文信息 - Extended LL(k) grammars and parsers

Extended LL(k) grammars and parsers

A class of context-free grammars, called "Extended LL(k)" or ELL(k), is defined. This class has been shown to include LL(k) grammars as proper subset, and there are some grammars which are ELL(k) grammars but not LALR(k) grammars.An algorithm to construct persers for ELL(k) grammars is proposed in this paper.Before this paper had been completed, PL/O language was taken as a sample. A parser was constructed for it by ELL(k) technique.

Yen-Jen Oyang | Ching-Chi Hsu | Ching-Chi Hsu | Yen-Jen Oyang

[1] Alfred V. Aho,et al. The care and feeding of LR(k) grammars , 1971, STOC.

[2] Alfred V. Aho,et al. The theory of parsing, translation, and compiling. 2: Compiling , 1973 .

[3] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..

[4] Franklin L. DeRemer,et al. Simple LR(k) grammars , 1971, Commun. ACM.

[5] Daniel J. Rosenkrantz,et al. Properties of deterministic top down grammars , 1969, STOC.

[6] Notes on top-down languages , 1969 .

[7] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .