论文信息 - Tranformations to Produce Certain Covering Grammars

Tranformations to Produce Certain Covering Grammars

Two grammatical transformations are presented for producing a context-free grammar which left-to-right covers the original grammar. The first transformation can be used to transform grammars in an extensive subclass of the non-right-recursive grammars into covering grammars which are in Greibach normal form. The second transformation converts a subclass of LR(0) grammars into covering grammars which are strict deterministic. This transformation is further extended to produce a covering strict deterministic grammar for all LR(0) grammars.

Esko Ukkonen

[1] Anton Nijholt,et al. On the covering of left recursive grammars , 1977, POPL.

[2] Esko Ukkonen,et al. A Characterization of LL(k) Languages , 1976, ICALP.

[3] Matthew M. Geller,et al. On LR(k) Grammars and Languages , 1977, Theor. Comput. Sci..

[4] Eljas SOISALON-SOININEN. On the Covering Problem for Left-Recursive Grammars , 1979, Theor. Comput. Sci..

[5] Anton Nijholt,et al. On the Covering of Parsable Grammars , 1977, J. Comput. Syst. Sci..

[6] Anton Nijholt,et al. Cover Results and Normal Forms , 1977, MFCS.

[7] Jim Gray,et al. On the Covering and Reduction Problems for Context-Free Grammars , 1972, JACM.

[8] Ivan M. Havel,et al. Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..