Results 11 to 20 of about 7,527 (197)
LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and 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
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
Practical LR Parser Generation [PDF]
, 2022 Parsing is a fundamental building block in modern compilers, and for industrial programming languages, it is a surprisingly involved task. There are known approaches to generate parsers automatically, but the prevailing consensus is that automatic parser generation is not practical for real programming languages: LR/LALR parsers are considered to be ...
Joe Zimmerman
openalex +3 more sources
Parallel decomposition of LR(k) parsers [PDF]
, 1977 David Benson, Ralph D. Jeffords
openalex +2 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
LR parsers for natural languages [PDF]
Proceedings of the 22nd annual meeting on Association for Computational Linguistics -, 1984 MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a shift-reduce parser which is deterministically guided by a parsing table. A parsing table can be obtained automatically from a context-free phrase structure grammar.
Masaru Tomita
openalex +3 more sources
Repairing syntax errors in LR parsers [PDF]
ACM Transactions on Programming Languages and Systems, 2002 This article reports on an error-repair algorithm for LR parsers. It locally inserts, deletes or shifts symbols at the positions where errors are detected, thus modifying the right context in order to resume parsing on a valid piece of input. This method improves on others in that it does not require the user to provide additional information about the
Corchuelo Gil, Rafael +3 more
openaire +3 more sources
The generalized LR parser/compiler V8-4 [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 Masaru Tomita
openalex +2 more sources
Notes on LR parser design [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 5 pages, uuncoded, gzipped ...
openaire +2 more sources
Towards Efficient, Typed LR Parsers
Electronic Notes in Theoretical Computer Science, 2006 AbstractThe LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient ...
Pottier, François, Régis-Gianas, Yann
openaire +2 more sources