Results 11 to 20 of about 163,637 (234)
On the size of parsers and LR(k)-grammars [PDF]
Theoretical Computer Science, 2000 AbstractIn this paper, we consider two tradeoff results regarding the economy of description in parsing. One result is on the tradeoff between the size of a parser and its ability to detect an error early. The other result is on the tradeoff between the size of an LR(k)-grammar and the length k of the lookahead.
Hing Leung, Detlef Wotschke
openalex +2 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.
M. Dennis Mickunas, John A. Modry
openalex +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.
Jacques-Henri Jourdan +2 more
openalex +5 more sources
A Practical State Splitting Algorithm for Constructing LR-Parsers [PDF]
DAIMI Report Series, 1984 <p>A practical algorithm for constructing LR(k) parsers is given. The algorithm works by splitting those states in the LR(O)-machine that give rise to LALR(k)-conflicts. The algorithm takes a conflicting pair of items, say l,J in a state T, and performs a recursive backwards traversal of part of the predecessor tree of T.
Bent Bruun Kristensen +1 more
openalex +4 more sources
Bottom-Up Parser: Look-Ahead LR Parser
International journal of recent technology and engineering, 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.
Pooja Rani
openalex +2 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 +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
Rafael Corchuelo +3 more
openalex +5 more sources
Reachability and error diagnosis in LR(1) parsers [PDF]
Proceedings of the 25th International Conference on Compiler Construction, 2016 Given an LR(1) automaton, what are the states in which an error can be detected? For each such " error state " , what is a minimal input sentence that causes an error in this state? We propose an algorithm that answers these questions. This allows building a collection of pairs of an erroneous input sentence and a (handwritten) diagnostic message ...
François Pottier
openalex +6 more sources
LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and Generic Tokens [PDF]
arXiv, 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]. LR contains a number of novel feature. This paper discusses three of them in detail: an LR(1) grammar specified automatic error recovery algorithm, oracles, and generic tokens.
A. Sorkin, Peter Donovan
arxiv +3 more sources
Developing and Evaluating a Probabilistic LR Parser of Part-of-Speech and Punctuation Labels [PDF]
4th International Workshop on Parsing Technologies (IWPT-95),
48-58, 1995 We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-of-speech and punctuation labels using a unification-based grammar coupled with a probabilistic LR parser.
Ted Briscoe, John M. Carroll
arxiv +3 more sources