We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACEcomplete.
Mark-Jan Nederhof and Giorgio Satta REF considered the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generateed finite languages and presented two tabular algorithms for these grammars.
Parsing non-recursive context-free grammars