No grammar in GNF can generate the null string. Conversely, every contextfree grammar which does not generate the null string can be transformed into an equivalent grammar in Greibach normal form. This can be used to prove that every contextfree language can be accepted by a nondeterministic pushdown automaton.
Search Encyclopedia

Featured Article
