Results 1 to 10 of about 7,307 (201)
A Drop-in Replacement for LR(1) Table-Driven Parsing [PDF]
Advances in Computing and Engineering, 2021 This paper presents a construction method for a deterministic one-symbol look-ahead LR parser which allows non-terminals in the parser look-ahead. This effectively relaxes the requirement of parsing the reverse of the right-most derivation of a string ...
Michael Oudshoorn
doaj +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
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
Notes on LR Parser Design [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1996 5 pages, uuncoded, gzipped ...
Christer Samuelsson
openalex +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 +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
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 +9 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 +5 more sources
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
Generation of LR parsers by partial evaluation [PDF]
ACM Transactions on Programming Languages and Systems, 2000 The combination of modern programming languages and partial evaluation yields new approaches to old problems. In particular, the combination of functional programming and partial evaluation can turn a general parser into a parser generator.
Michael Sperber, Peter Thiemann
openalex +4 more sources