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