Results 1 to 10 of about 1,597 (177)
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +5 more sources
Efficient tabular LR parsing [PDF]
Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1996 8 pages, uses aclap ...
NEDERHOF M. J., SATTA, GIORGIO
openaire +7 more sources
Heavy Rain Face Image Restoration: Integrating Physical Degradation Model and Facial Component-Guided Adversarial Learning [PDF]
Sensors, 2022 With the recent increase in intelligent CCTVs for visual surveillance, a new image degradation that integrates resolution conversion and synthetic rain models is required.
Chang-Hwan Son, Da-Hee Jeong
doaj +2 more sources
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 +3 more sources
Attribute-Influenced LR Parsing [PDF]
DAIMI Report Series, 1980 <p>Methods are described which make it possible, when given an arbitrary attribute grammar (or AG),</p><ol> <li> to analyze the AG to determine which of its attributes may be computed during LR parsing; </li><li> to augment the parser with instructions and data structures to compute many attributes during parsing ...
Neil D. Jones, C. Michael Madsen
openaire +4 more sources
The essence of LR parsing [PDF]
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95, 1995 Partial evaluation can turn a general parser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We use an inherently functional approach to implement general LR(k) parsers and specialize them using the partial evaluator Similix.
Michael Sperber, Peter Thiemann 0001
openaire +2 more sources
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 +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 +4 more
doaj +1 more source