Advertisement

On Predictive Parsing and Extended Context-Free Grammars

  • Anne Brüggemann-Klein
  • Derick Wood
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2598)

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 topdown 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 contextfree grammars, and by our continuing investigation of XML.

Keywords

Active Node Regular Language Input String Semantic Action Syntax Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    J. Albert and Th. Ottmann. Automaten, Sprachen und Maschinen. Bibliographisches Institut, Mannheim, 1983.Google Scholar
  3. 3.
    T. Bray, J. P. Paoli, and C.M. Sperberg-McQueen. ExtensibleMarkup Language (XML) 1.0. http://www.w3.org/TR/1998/REC-xml-19980210/, February 1998.
  4. 4.
    A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120:197–213, 1993.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 140:229–253, 1998.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages: Theory & Practice, 2(1):81–106, 2000.CrossRefGoogle Scholar
  7. 7.
    A. Brüggemann-Klein and D. Wood. On predictive parsing and extended context-free grammars, 2002. Proceedings of the International Conference CIAA 2002. To appear.Google Scholar
  8. 8.
    A. Brüggemann-Klein and D. Wood. On predictive parsing and extended context-free grammars: Algorithms and complexity results, 2002. Manuscript in preparation.Google Scholar
  9. 9.
    J. Clark, 1992. Source code for SGMLS. Available by anonymous ftp from ftp.uu.net and sgml1.ex.ac.uk.Google Scholar
  10. 10.
    D. J. Cohen and C. C. Gotlieb. A list structure form of grammars for syntactic analysis. Computing Surveys, 2:65–82, 1970.CrossRefGoogle Scholar
  11. 11.
    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
  12. 12.
    R. Heckmann. An efficient ELL(1)-parser generator. Acta Informatica, 23:127–148, 1986.zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    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.zbMATHGoogle Scholar
  14. 14.
    H. B. Hunt III, T. G. Szymanski, and J. D. Ullman. Operations on sparse relations. Communications of the ACM, 20:171–176, 1977.zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    P. Kilpeläinen and D. Wood. SGML and XML document grammars and exceptions. Information and Computation, 169:230–251, 2001.zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    W. R. LaLonde. Regular right part grammars and their parsers. Communications of the ACM, 20:731–741, 1977.zbMATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    J. Lewi, K. de Vlaminck, E. Steegmans, and I. van Horebeek. Software Develepment by LL(1) Syntax Description. John Wiley & Sons, Chichester, UK, 1992.Google Scholar
  18. 18.
    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 InternationalWorkshop on Compiler-Compilers.Google Scholar
  19. 19.
    T. J. Parr and R. W. Quong. ANTRL: A predicated-LL(k) parser generator. Software-Practice and Experience, 25(7):789–810, 1995.CrossRefGoogle Scholar
  20. 20.
    S. Sippu and E. Soisalon-Soininen. Parsing Theory, Volume 1, Languages and Parsing, Volume 2, LL(k) and LR(k) Parsing,. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.Google Scholar
  21. 21.
    P. D. Terry. Compilers and Compiler Generators. Out of print, available on the Web, 2000.Google Scholar
  22. 22.
    J. Warmer and S. Townsend. The implementation of the Amsterdam SGML parser. Electronic Publishing, Origination, Dissemination, and Design, 2:65–90, 1989.Google Scholar
  23. 23.
    J. Warmer and H. van Vliet. Processing SGML documents. Electronic Publishing, Origination, Dissemination, and Design, 4(1):3–26, March 1991.Google Scholar
  24. 24.
    R. Wilhelm and D. Maurer. Compiler Design. Addison-Wesley, Reading, MA, 1995.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Anne Brüggemann-Klein
    • 1
  • Derick Wood
    • 2
  1. 1.Institut für InformatikTechnische Universität MünchenMünchenGermany
  2. 2.Department of Computer ScienceHong Kong University of Science & TechnologyKowloonHong Kong SAR

Personalised recommendations