Results 11 to 20 of about 635 (186)
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leermakers, M.C.J. +2 more
core +5 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 +2 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
LR(1) parser generation system
Software Engineering Notes: an Informal Newsletter of the Special Interest Committee on Software Engineering / ACM, 2011 The LR(1) Parser Generation System generates full LR(1) parsers that are comparable in speed and size to those generated by LALR(1) parser generators, such as yacc [5]. In addition to the inherent advantages of full LR(1) parsing, it contains a number of
Peter Donovan, Arthur Sorkin
exaly +2 more sources
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
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
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