Tabular Algorithms

We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language process- ing, this problem arises in several areas of application, including …...