Results 11 to 20 of about 7,549 (199)
LLLR Parsing: a Combination of LL and LR Parsing [PDF]
, 2016 A new parsing method called LLLR parsing is defined and a method for producing LLLR parsers is described. An LLLR parser uses an LL parser as its backbone and parses as much of its input string using LL parsing as possible.
core +3 more sources
Validating LR(1) Parsers [PDF]
, 2012 An LR(1) parser is a finite-state automaton, equipped with a stack, which uses a combination of its current state and one lookahead symbol in order to determine which action to perform next. We present a validator which, when applied to a context-free grammar G and an automaton A, checks that A and G agree.
Jourdan, Jacques-Henri +2 more
openaire +2 more sources
Tolerant parsing using modified LR(1) and LL(1) algorithms with embedded “Any” symbol
Труды Института системного программирования РАН, 2019 Tolerant parsing is a form of syntax analysis aimed at capturing the structure of certain points of interest presented in a source code. While these points should be well-described in a tolerant grammar of the language, other parts of the program are ...
Alexey Valerievitch Goloveshkin
doaj +3 more sources
Are LR parsers too powerful? [PDF]
ACM SIGPLAN Notices, 1986 The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
Philip Machanick
openaire +2 more sources
LR(1) parser generation system [PDF]
ACM SIGSOFT Software Engineering Notes, 2011 The LR(1) Parser Generation System generates full LR(1) parsers that are comparable in speed and size to those generated by LALR(1) parser generators, such as yacc [5]. In addition to the inherent advantages of full LR(1) parsing, it contains a number of novel features.
Sorkin, Arthur, Donovan, Peter
+5 more sources
Disambiguation Filters for Scannerless Generalized LR Parsers [PDF]
, 2002 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 ...
van den Brand, Mark G. J. +3 more
openaire +8 more sources
Efficient full LR(I) parser generation [PDF]
ACM SIGPLAN Notices, 1988 This paper proposes that full LR(1) parser generators are easier to use than the LALR(1) parser generators commonly in use, and that minimal-state full LR(1) tables are not much larger than LALR(1) tables. A method is presented for the automatic construction of minimal-state full LR(1) parser tables.
David Spector
openaire +2 more sources
Full LR(1) parser generation [PDF]
ACM SIGPLAN Notices, 1981 Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
David Spector
openaire +2 more sources
Generating LR(1) parsers of small size [PDF]
, 1992 Classic LR(1) parsing methods have the problem of producing too large parsing tables for programming language grammars. An alternative is to build an automaton that combines the lookahead symbol with reading the parsing stack from its top, to determine the next parsing action.
Fortes Gálvez José
openaire +4 more sources
Automatic error recovery for LR parsers [PDF]
Communications of the ACM, 1978 In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser.
Mickunas, M. Dennis, Modry, John A.
openaire +2 more sources