Disambiguation Filters for Scannerless Generalized LR Parsers

  • Mark G. J. van den Brand
  • Jeroen Scheerder
  • Jurgen J. Vinju
  • Eelco Visser
Conference paper

DOI: 10.1007/3-540-45937-5_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2304)
Cite this paper as:
van den Brand M.G.J., Scheerder J., Vinju J.J., Visser E. (2002) Disambiguation Filters for Scannerless Generalized LR Parsers. In: Horspool R.N. (eds) Compiler Construction. CC 2002. Lecture Notes in Computer Science, vol 2304. Springer, Berlin, Heidelberg

Abstract

In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) of the syntax of a language are defined explicitly in one formalism. Furthermore, there are no restrictions on the class of grammars, thus allowing a natural syntax tree structure. Ambiguities that arise through the use of unrestricted grammars are handled by explicit disambiguation constructs, instead of implicit defaults that are taken by traditional scanner and parser generators. Hence, a syntax definition becomes a full declarative description of a language. Scannerless generalized LR parsing is a viable technique that has been applied in various industrial and academic projects.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mark G. J. van den Brand
    • 1
    • 4
  • Jeroen Scheerder
    • 2
  • Jurgen J. Vinju
    • 1
  • Eelco Visser
    • 3
  1. 1.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands
  2. 2.Department of PhilosophyUtrecht UniversityUtrechtThe Netherlands
  3. 3.Institute of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands
  4. 4.LORIAINRIAVillers-lès-Nancy CedexFrance

Personalised recommendations