Bidirectional Automata for Tree Adjoining Grammars
Miguel Á. Alonso, Víctor J. Díaz, Manuel Vilares Ferro · 2001
We de ne a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution.