A Tabular Interpretation of Bottom-up Automata for TAG
Eric Villemonte de la Clergerie
Miguel Angel Alonso Pardo
David Cabrero Souto
to appear in Proc. of
TAG+, Fourth Workshop on Tree-Adjoining Grammars and Related Frameworks,
Philadelphia, PA, USA, 1998.
Abstract
We present a tabular interpretation for a class of 2-Stack Automata
that may be used to describe bottom-up parsing strategies for
TAGs. The results are also useful for tabulating other existing
bottom-up automata models for this kind of languages.