Results 1 to 10 of about 169,566 (212)
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 +3 more sources
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 +3 more sources
State Merging in LR Parser under Count based Reduction
, 2014 R. D. SolomonRaju, Priyesh Kumar
semanticscholar +2 more sources
Technical Correspondence: Comments on Soisalon-Soininen's ``Inessential Error Entries and Their Use in LR Parser Optimization'' [PDF]
ACM Transactions on Programming Languages and Systems, 1984 W. LaLonde
semanticscholar +2 more sources
Inessential Error Entries and Their Use in LR Parser Optimization [PDF]
ACM Transactions on Programming Languages and Systems, 1982 E. Soisalon-Soininen
semanticscholar +2 more sources
A Simple, Possibly Correct LR Parser for C11
ACM Transactions on Programming Languages and Systems, 2017 Jacques-Henri Jourdan, F. Pottier
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
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