Results 1 to 10 of about 1,018 (122)
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 +3 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
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 +6 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
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
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, Michael Madsen
openaire +2 more sources
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
Tolerant parsing using modified LR(1) and LL(1) algorithms with embedded “Any” symbol
Труды Института системного программирования РАН, 2019 Tolerant parsing is a form of syntax analysis aimed at capturing the structure of certain points of interest presented in a source code. While these points should be well-described in a tolerant grammar of the language, other parts of the program are ...
Alexey Valerievitch Goloveshkin
doaj +1 more source