Skip to main content
SpringerLink
Log in

Bidirectional Push Down Automata

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2608))

Included in the following conference series:

  • 462 Accesses

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. Eric de la Clergerie. Automates à Piles et Programmation Dynamique. DyALog: Une Application à la Programmation en Logique. PhD thesis, Université Paris 7, Paris, France, 1993.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94–102, 1970.

    Article  MATH  Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Article  MATH  MathSciNet  Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Universidade da Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain

    Miguel A. Alonso & Manuel Vilares

  2. Departamento de Lenguajes y Sistemas Informáticos, Universidad de Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain

    Víctor J. Díaz

  3. Escuela Superior de Ingeniería Informática, Universidade de Vigo, Campus As Lagoas s/n, 32004, Orense, Spain

    Manuel Vilares

Authors
  1. Miguel A. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Víctor J. Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel Vilares
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, Université de Rouen, LIFAR, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud

  2. Departement Informatique, Laboratoire d’Informatique de l’Université de Tours École Polytechnique de l’Université de Tours, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation