Skip to main content
SpringerLink
Log in

Generation of Incremental Parsers

  • Conference paper
  • First Online:
Computational Linguistics and Intelligent Text Processing (CICLing 2003)

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

  • 864 Accesses

Abstract

An incremental development environment for unrestricted context-free languages is described and tested. Our proposal includes a parse generator, an incremental facility to make the overall parsing efficient in the context of program development; and a graphical interface that provides a complete set of customization and trace facilities. The tool, baptized Ice after Incremental Context-Free Environment, appears to be superior to other general context-free parsing environments and is comparable to deterministic ones, when the context is not ambiguous.

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. M. A. Alonso, D. Cabrero, and M. Vilares. Construction of efficient generalized LR parsers. In Derick Wood and Sheng Yu, editors, Automata Implementation, volume 1436 of Lecture Notes in Computer Science, pages 7–24. Springer-Verlag, Berlin-Heidelberg-New York, 1998.

    Chapter  Google Scholar 

  2. Charles Donnelly and Richard Stallman. Bison: the YACC-compatible Parser Generator, Bison Version 1.28. Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA, Tel: (617) 876-3296, USA, January 1999.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  4. H. Höge and E. Marschall. Statistical analysis of left-to-right parser for wordhypothesing. NATO ASI Series, F46:297–303, 1988.

    Google Scholar 

  5. M. Kay. Algorithm schemata and data structures in syntactic processing. Technical report, XEROX Palo Alto Research Center, Palo Alto, California, U.S.A., 1980.

    Google Scholar 

  6. Bernard Lang. Deterministic techniques for efficient non-deterministic parsers. In J. Loeckx, editor, Automata, Languages and Programming, number 14 in Lecture Notes in Computer Science, pages 255–269. Springer, Berlin, DE, 1974.

    Google Scholar 

  7. J. Rekers. Parser Generation for Interactive Environments. PhD thesis, University of Amsterdam, Amsterdam, The Netherlands, 1992.

    Google Scholar 

  8. S. M. Shieber, Y. Schabes, and F. C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 1–2:3–36, 1995.

    Article  MathSciNet  Google Scholar 

  9. K. Sikkel. Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands, 1993.

    Google Scholar 

  10. Mark van den Brand, Paul Klint, and Pieter A. Olivier. Compilation and memory management for ASF+SDF. In 93, page 15. Centrum voor Wiskunde en Informatica (CWI), ISSN 1386-369X, February 28 1999. SEN (Software Engineering (SEN)).

    Google Scholar 

  11. M. G. J. van den Brand. A Generator for Incremental Programming Environments. PhD thesis, Katholieke Universiteit Nijmegen, Nijmegen, The Netherlands, 1992.

    Google Scholar 

  12. M. Vilares. Efficient Incremental Parsing for Context-Free Languages. PhD thesis, University of Nice. ISBN 2-7261-0768-0, France, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Campus As Lagoas s/n, 32004, Orense, Spain

    Manuel Vilares, Miguel A. Alonso & Victor M. Darriba

Authors
  1. Manuel Vilares
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel A. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor M. Darriba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Computación (CIC), Instituto Politécnico Nacional (IPN), Col. Zacatenco, CP 07738, Mexico D.F., Mexico

    Alexander Gelbukh

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vilares, M., Alonso, M.A., Darriba, V.M. (2003). Generation of Incremental Parsers. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2003. Lecture Notes in Computer Science, vol 2588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36456-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36456-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00532-2

  • Online ISBN: 978-3-540-36456-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation