Eliminating Epsilon-Productions in Contextfree (Chomsky-2) Grammars
We show how to eliminate epsilon productions from contextfree grammars. This leads to a simple yet inefficient algorithm for checking if a word is in a contextfree language.
We show how to eliminate epsilon productions from contextfree grammars. This leads to a simple yet inefficient algorithm for checking if a word is in a contextfree language.