The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.
CITATION STYLE
Alonso, M. A., De La Clergerie, E., & Vilares, M. (2001). A formal definition of bottom-up embedded push-down automata and their tabulation technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2099, pp. 44–61). Springer Verlag. https://doi.org/10.1007/3-540-48199-0_3
Mendeley helps you to discover research relevant for your work.