论文信息 - Greibach Normal Form Transformation Revisited

Greibach Normal Form Transformation Revisited

We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrarye-free context-free grammarG, we transformGinto an equivalent context-free grammarHin extended Greibach normal form; i.e., in addition to rules, fulfilling the Greibach normal form properties, the grammar can have chain rules. The size ofHwill beO(|G|3), where |G| is the size ofG. Moreover, in the case thatGis chain rule free,Hwill be already in Greibach normal form. IfHis not chain rule free then we use the standard method for chain rule elimination for the transformation ofHinto Greibach normal form. The size of the constructed grammar isO(|G|4).

Norbert Blum | Robert Koch | Norbert Blum | Robert Koch

[1] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[2] Daniel J. Rosenkrantz,et al. Matrix Equations and Normal Forms for Context-Free Grammars , 1967, JACM.

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

[4] Alica Pirická-Kelemenová. Greibach normal form complexity , 1975 .

[5] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[7] Amiram Yehudai,et al. Eliminating Null Rules in Linear Time , 1981, Comput. J..

[8] Norbert Blum,et al. More on the Power of Chain Rules in Context-Free Grammars , 1983, Theor. Comput. Sci..

[9] Andrzej Ehrenfeucht,et al. An Easy Proof of Greibach Normal Form , 1984, Inf. Control..

[10] Alica Kelemenová,et al. Complexity of Normal Form Grammars , 1984, Theor. Comput. Sci..

[11] Friedrich J. Urbanek. On Greibach Normal Form Construction , 1986, Theor. Comput. Sci..

[12] Derick Wood,et al. Theory of computation , 1986 .

[13] Norbert Blum,et al. Greibach Normal Form Transformation, Revisited , 1997, STACS.