Greibach Normal Form (Q7361208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Greibach_Normal_Form
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greibach Normal Form |
AFP entry Greibach_Normal_Form |
Statements
27 August 2025
0 references
Alexander Haberl
0 references
Tobias Nipkow
0 references
Akihisa Yamada
0 references
Greibach Normal Form (English)
0 references
This theory formalizes Hopcroft and Ullman’s algorithm to transform a set of productions into Greibach Normal Form (GNF). We concentrate on the essential property of the GNF: every production starts with a terminal; the tail of a rhs may contain further terminals. The complexity of the algorithm can be exponential.
0 references
