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 contextfree)
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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.