Results 11 to 20 of about 298,955 (157)
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 +4 more sources
Theoretical Computer Science, 1992 A purely functional implementation of LR(0) parsers is given, together with a simple correctness proof. For non-LR(0) grammars its time complexity is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that
R. Leermakers +2 more
semanticscholar +3 more sources
The Generalized LR Parser/Compiler V8-4: A Software Package for Practical NL Projects
International Conference on Computational Linguistics, 1990 This paperldescribes a software package designed for practical projects which involve natural language parsing.]he Generalized LR Parser/Compiler V8-4 is based on Tomita's Generalized LR Parsing ...
M. Tomita
semanticscholar +2 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
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
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
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
Notes on LR Parser Design [PDF]
International 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 +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
Adapting a WSJ-trained parser to grammatically noisy text [PDF]
, 2008 We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank is created automatically by modifying Penn treebank sentences so that they contain one or more syntactic errors.
Jennifer Foster +5 more
core +3 more sources