Results 11 to 20 of about 169,566 (212)
Notes on LR Parser Design [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 The design of an LR parser based on interleaving the atomic symbol processing of a context-free backbone grammar with the full constraints of the underlying unification grammar is described.
C. Samuelsson
semanticscholar +4 more sources
Bottom-Up Parser: Look-Ahead LR Parser
International Journal of Recent Technology and Engineering (IJRTE), 2019 Compiler is used for the purpose of converting high level code to machine code. For doing this procedure we have six steps. On these steps the syntax analyses is the second step of compiler. The lexical analyzer produce token in the output.
semanticscholar +2 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.
Jacques-Henri Jourdan +2 more
openalex +2 more sources
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.
Boštjan Slivnik
openalex +4 more sources
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Leermakers +2 more
semanticscholar +4 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 ...
Mark van den Brand +3 more
openalex +8 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
openalex +2 more sources
LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and\n Generic Tokens [PDF]
ACM SIGSOFT Software Engineering Notes, 2010 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.
A. Sorkin, Peter Donovan
+5 more sources
The Generalized LR Parser/Compiler V8-4: A Software Package for Practical NL Projects [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 M. Tomita
semanticscholar +2 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
openalex +2 more sources