Results 11 to 20 of about 192,464 (184)

On LR Parsing with Selective Delays [PDF]

International Conference on Compiler Construction, 2013
The paper investigates an extension of LR parsing that allows the delay of parsing decisions until a sufficient amount of context has been processed. We provide two characterizations for the resulting class of grammars, one based on grammar transformations, the other on the direct construction of a parser.
E. Bertsch, M. Nederhof, S. Schmitz
semanticscholar   +2 more sources

LR Parsing of Permutation Phrases

arXiv.org
This paper presents an efficient method for LR parsing of permutation phrases. In practical cases, the proposed algorithm constructs an LR(0) automaton that requires significantly fewer states to process a permutation phrase compared to the standard ...
Jana Kosticová
semanticscholar   +3 more sources

LR Parsing

ACM Computing Surveys, 1974
A. Aho, Stephen C. Johnson
semanticscholar   +3 more sources

A Drop-in Replacement for LR(1) Table-Driven Parsing

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   +1 more source

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

Mathematics, 2022
The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber, Matej Črepinšek, Marjan Mernik, Tomaž Kosar   +3 more
doaj   +1 more source

On Parsing Programming Languages with Turing-Complete Parser

Mathematics, 2023
A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj   +1 more source

Speeding up Generalized PSR Parsers by Memoization Techniques [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) grammars is very efficient, but restricted to a subclass of unambiguous HR grammars.
Mark Minas
doaj   +1 more source

An Approach for Plant Leaf Image Segmentation Based on YOLOV8 and the Improved DEEPLABV3+

Plants, 2023
Accurate plant leaf image segmentation provides an effective basis for automatic leaf area estimation, species identification, and plant disease and pest monitoring.
Tingting Yang, Suyin Zhou, Aijun Xu, Junhua Ye, Jianxin Yin   +4 more
doaj   +1 more source

Unifying LL and LR parsing [PDF]

, 1993
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper the relation between these methods is clarified.As shown in literature on parsing theory, for every context-free grammar, a so-called non-deterministic LR(
Pijls, W.H.L.M. (Wim)
core   +16 more sources

GLR-Parsing of Word Lattices Using a Beam Search Method [PDF]

, 1995
This paper presents an approach that allows the efficient integration of speech recognition and language understanding using Tomita's generalized LR-parsing algorithm. For this purpose the GLRP-algorithm is revised so that an agenda mechanism can be used
Staab, Steffen
core   +3 more sources