Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2002: Implementation and Application of Automata pp 239–247Cite as

On Predictive Parsing and Extended Context-Free Grammars

  • Conference paper
  • First Online:

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

Abstract

Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to only finite languages. We present a novel view on top-down predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees. This work is motivated by our development of ecfg, a Java toolkit for the manipulation of extended context-free grammars, and by our continuing investigation of XML.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading, MA, 1986.

    Google Scholar 

  2. T. Bray, J. P. Paoli, and C. M. Sperberg-McQueen. Extensible Markup Language (XML) 1.0. http://www.w3.org/TR/1998/REC-xml-19980210/, February 1998.

  3. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120:197–213, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 140:229–253, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages: Theory amp; Practice, 2(1):81–106, 2000.

    Article  Google Scholar 

  6. J. Clark, 1992. Source code for SGMLS. Available by anonymous ftp from ftp://ftp.uu.net and sgml1.ex.ac.uk.

  7. D.J. Cohen and C.C. Gotlieb. A list structure form of grammars for syntactic analysis. Computing Surveys, 2:65–82, 1970.

    Article  Google Scholar 

  8. D. Giammarresi and D. Wood. Transition diagram systems and normal form transformations. In Proceedings of the Sixth Italian Conference on Theoretical Computer Science, pages 359–370, Singapore, 1998. World Scientific Publishing Co. Pte. Ltd.

    Google Scholar 

  9. R. Heckmann. An efficient ELL(1)-parser generator. Acta Informatica, 23:127–148, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading, MA, 1979.

    MATH  Google Scholar 

  11. P. Kilpeläinen and D. Wood. SGML and XML document grammars and exceptions. Information and Computation, 169:230–251, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  12. W. R. LaLonde. Regular right part grammars and their parsers. Communications of the ACM, 20:731–741, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Lewi, K. de Vlaminck, E. Steegmans, and I. van Horebeek. Software Develepment by LL(1) Syntax Description. John Wiley amp; Sons, Chichester, UK, 1992.

    Google Scholar 

  14. H. Mössenböck. A generator for production quality compilers. In Lecture Notes in Computer Science 471, Berlin, 1990. Springer-Verlag. Proceedings of the Third International Workshop on Compiler-Compilers.

    Google Scholar 

  15. T. J. Parr and R. W. Quong. ANTRL: A predicated-LL(k) parser generator. Software-Practice and Experience, 25(7):789–810, 1995.

    Article  Google Scholar 

  16. S. Sippu and E. Soisalon-Soininen. Parsing Theory, Volume1, Languages and Parsing, Volume 2, LL(k) and LR(k) Parsing,. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  17. P. D. Terry. Compilers and Compiler Generators. Out of print, available on the Web, 2000.

    Google Scholar 

  18. J. Warmer and S. Townsend. The implementation of the Amsterdam SGML parser. Electronic Publishing, Origination, Dissemination, and Design, 2:65–90, 1989.

    Google Scholar 

  19. J. Warmer and H. van Vliet. Processing SGML documents. Electronic Publishing, Origination, Dissemination, and Design, 4(1):3–26, March 1991.

    Google Scholar 

  20. R. Wilhelm and D. Maurer. Compiler Design. Addison-Wesley, Reading, MA, 1995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, 80290, München, Germany

    Anne Brüggemann-Klein

  2. Department of Computer Science, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong SAR

    Derick Wood

Authors
  1. Anne Brüggemann-Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    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

Brüggemann-Klein, A., Wood, D. (2003). On Predictive Parsing and Extended Context-Free Grammars. 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_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-44977-9_24

  • 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