Attention is paid to structure preserving properties of transformations from a non-leftrecursive context-free grammar to a Greibach normal form grammar. It is demonstrated that such a transformation cannot only be ambiguity preserving, but also both cover and functor relations between grammars or their associated syntax-categories can be obtained from such a transformation.
|Number of pages||6|
|Journal||BIT (Nordisk Tidskrift for Informationsbehandling)|
|Publication status||Published - 1979|
- grammar functor
- Greibach normal form
- HMI-SLT: Speech and Language Technology
- Context-free grammar