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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Miguel A. Alonso, Víctor J. Díaz, and Manuel Vilares. Bidirectional automata for tree adjoining grammars. In Proc. of the Seventh International Workshop on Parsing Technologies (IWPT-2001), pages 42–53, Beijing, China, October 2001. Tsinghua University Press.
Eric de la Clergerie. Automates à Piles et Programmation Dynamique. DyALog: Une Application à la Programmation en Logique. PhD thesis, Université Paris 7, Paris, France, 1993.
Eric de la Clergerie and Bernard Lang. LPDA: Another look at tabulation in logic programming. In Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP’94), pages 470–486. MIT Press, June 1994.
J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94–102, 1970.
Bernard Lang. Towards a uniform formal framework for parsing. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 153–171. Kluwer Academic Publishers, Norwell, MA, USA, 1991.
Mark-Jan Nederhof. An optimal tabular parsing algorithm. In Proc. of 32nd Annual Meeting of the Association for Computational Linguistics, pages 117–124, Las Cruces, NM, USA, June 1994. ACL.
Mark-Jan Nederhof. Reversible pushdown automata and bidirectional parsing. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 472–481. World Scientific, Singapore, 1996.
Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1–2):3–36, July–August 1995.
Klaas Sikkel. Parsing Schemata-A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science-An EATCS Series. Springer-Verlag, Berlin/Heidelberg/New York, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, M.A., Díaz, V.J., Vilares, M. (2003). Bidirectional Push Down Automata. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive