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.
|Title of host publication||Compiler Construction (Proceedings 11th International Conference, CC 2002, held as part of ETAPS 2002, Grenoble, France, April 8-12, 2002)|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|
Brand, van den, M. G. J., Scheerder, J. J., Vinju, J. J., & Visser, E. (2002). Disambiguation filters for scannerless generalized LR parsers. In R. N. Horspool (Ed.), Compiler Construction (Proceedings 11th International Conference, CC 2002, held as part of ETAPS 2002, Grenoble, France, April 8-12, 2002) (pp. 143-158). (Lecture Notes in Computer Science; Vol. 2304). Springer. https://doi.org/10.1007/3-540-45937-5_12