Results 11 to 20 of about 636 (187)
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leermakers, M.C.J. +2 more
core +5 more sources
Practical LR Parser Generation
CoRR, 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 ...
Zimmerman, Joe
openaire +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
openaire +3 more sources
Notes on LR parser design [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 5 pages, uuncoded, gzipped ...
openaire +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.
Jourdan, Jacques-Henri +2 more
openaire +1 more source
Journal of Computer and System Sciences, 1972 Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by Korenjak [2] and DeRemer [3, 4]. We show that the techniques of the latter can be characterized by two transformations on sets of tables. We then show that the “simple” LR(1) method of DeRemer [4] can be considered a special case of Korenjak's method [2].
Alfred V. Aho, Jeffrey D. Ullman
openaire +1 more source
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.
openaire +1 more source
A Drop-in Replacement for LR(1) Table-Driven Parsing [PDF]
, 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
core +1 more source
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
Advanced Science, EarlyView.We propose the Full‐Body AI Agent, a multi‐scale collaborative framework with 7 biological‐layer agents. It unifies multi‐omics/clinical data via standardized protocols, enabling phenotype‐guided closed‐loop reasoning, quantitative evaluation, and LLM safeguards, with promising applications in tumor metastasis modeling and precision drug development ...
Aoqi Wang +11 more
wiley +1 more source