Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
formal grammar normal form
|
| gptkbp:abbreviation |
GNF
|
| gptkbp:application |
parsing algorithms
|
| gptkbp:defines |
A context-free grammar is in Greibach normal form if all production rules are of the form A → aα, where a is a terminal and α is a (possibly empty) string of nonterminals.
|
| https://www.w3.org/2000/01/rdf-schema#label |
Greibach normal form
|
| gptkbp:introducedIn |
1965
|
| gptkbp:namedAfter |
gptkb:Sheila_Greibach
|
| gptkbp:property |
In GNF, the right-hand side of every production starts with a terminal symbol.
Every context-free grammar can be converted to an equivalent grammar in Greibach normal form. |
| gptkbp:relatedTo |
gptkb:Chomsky_normal_form
|
| gptkbp:usedIn |
context-free grammar
|
| gptkbp:bfsParent |
gptkb:context-free_grammar
|
| gptkbp:bfsLayer |
5
|