Disambiguation Filters for Scannerless Generalized LR Parsers

Mark G. J. van den Brand 1 J. Scheerder J.J. Vinju Eelco Visser
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax de.nitions in which all aspects (lexical and context-free) of the syntax of a language are de.ned 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 de.nition 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00101032
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:54:03 PM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM

Identifiers

  • HAL Id : inria-00101032, version 1

Collections

Citation

Mark G. J. van den Brand, J. Scheerder, J.J. Vinju, Eelco Visser. Disambiguation Filters for Scannerless Generalized LR Parsers. 11th International Conference on Compiler Construction - CC'02, Apr 2002, Grenoble, France, pp.143-158. ⟨inria-00101032⟩

Share

Metrics

Record views

103