Miguel Angel Alonso Pardo
Eric Villemonte de la Clergerie
jorge Graña Gil
Manuel Vilares Ferro
in Proc. of Sixth International Workshop on Parsing Technologies (IWPT 2000), Trento, Italy, 2000.
We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.