Results 1 to 10 of about 163,421 (197)
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
Practical LR Parser Generation [PDF]
arXiv.org, 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
Joe Zimmerman
semanticscholar +3 more sources
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 +5 more sources
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Leermakers +2 more
semanticscholar +5 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
LR-parser-driven Viterbi search with hypotheses merging mechanism using context-dependent phone models [PDF]
Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 2002 Describes a Viterbi search algorithm for continuous speech recognition using context-dependent phone models under the constraint defined by a context-free grammar (CFG).
Tatsuro Yamada, Shigeki Sagayama
openalex +2 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
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
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