Greibach normal form - Wikipedia, the free encyclopedia
In computer science, more precisely in formal language theory, a context-free grammar is in Greibach normal form , if the right-hand sides of all productions start with a terminal symbol, perhaps fo...
en.wikipedia.org/wiki/Greibach_normal_form
Chomsky normal form - Wikipedia, the free encyclopedia
In computer science, a context-free grammar is said to be in Chomsky normal form if all of its production rules are of the form: where A , B and C are nonterminal symbols, α is a terminal symb...
en.wikipedia.org/wiki/Chomsky_normal_form
Math reference, chomsky greibach normal form. ... Context Free, Chomsky Greibach Normal Form ... A grammar is in greibach normal form if each production yields a terminal followed by a (possibly empty) sequence of nonterminals. Again, s → E is a special case.
www.mathreference.com/lan-cfl,cgnf.html
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. ...
linkinghub.elsevier.com/retrieve/pii/S0890540198927729
Greibach Normal Form of a CFG has all productions of the form A ->aV Where 'A' is a variable, 'a' is exactly one terminal and 'V' is a string of none or more variables. Every CFG can be rewritten in Greibach Normal Form.
www.cs.umbc.edu/~squire/cs451_l17.html
Greibach Normal Form Transformation, Revisited Norbert Blum Robert Koch Informatik IV, Universitat Bonn Romerstr. 164, D-53117 Bonn, Germany email: blum@cs.uni-bonn.de August 25, 1998 We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size.
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.47.46... citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.47.460&rep=rep1&type=pdf
A formal grammar in Greibach normal form is a context-free grammar. Moreover, any context-free language not containing the empty word $\lambda$ can be generated by a grammar in Greibach normal form.
planetmath.org/encyclopedia/GreibachNormalForm.html planetmath.org/encyclopedia/GreibachNormalForm.html
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 arbitrary -free context-free grammar G, we transform G into an equivalent context-free grammar H in extended Greibach normal form;
theory.cs.bonn.edu/blum/papers/abstracts/node10.html
An arbitrary definite clause grammar can be transfomled into a so-called Generalized Oreibach Normal Form (GGNF), a generalization of the classical Groibach Norreal Form (GNF) for context-free grammars. ... A Generalized Greibach Normal Form for Definite Clause Grammars (1992) [9 citations — 3 self]
citeseer.ist.psu.edu/584478.html
A Generalized Greibach Normal Form for Definite Clause Grammars Marc Dymetman CCRIT, Communications Canada 1575 boul. that is, in the form of a definite grammar scheme to which has been added a set of auxiliary clauses defining its auxiliary predicates. This definite grammar scheme is in fact identical with DGSI...
www.aclweb.org/anthology/C/C92/C92-1057.pdf