Bidirectional push down automata

Authors:
Miguel A. Alonso;Víctor J. Díaz;Manuel Vilares
Affiliations:
Departamento de Computación, Universidade da Coruña, La Coruña, Spain;Departamento de Lenguajes y Sistemas Informáticos, Universidad de Sevilla, Sevilla, Spain;Departamento de Computación, Universidade da Coruña, La Coruña, Spain and Escuela Superior de Ingeniería Informática, Universidade de Vigo, Orense, Spain
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 4
Cited 0

LPDA: another look at tabulation in logic programming

Proceedings of the eleventh international conference on Logic programming
An efficient context-free parsing algorithm

Communications of the ACM
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
An optimal tabular parsing algorithm

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.