Skip to content
Publications

Talk · International Conference on Implementation and application of automata · July 3, 2002

Bidirectional push down automata

Miguel Á. Alonso, Víctor J. Díaz, Jesús Vilares

Abstract

c ○ Springer-Verlag Abstract. We define a new model of automata for the description of bidirectional parsing strategies for context-free grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of defining bidirectional parsers, separating the description of a strategy from its execution. 1

semigroups and automata theoryNatural Language Processing TechniquesAlgorithms and Data Compressioncontext-free grammarsparsing strategiestabulation

More by Miguel Alonso