Results 1 to 10 of about 163,637 (234)
Practical LR Parser Generation [PDF]
arXiv, 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 ...
Joe Zimmerman
arxiv +6 more sources
Notes on LR Parser Design [PDF]
Coling 94, 1996 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. The parser employs a set of reduced constraints derived from the unification grammar in the LR parsing step. Gap threading is simulated to reduce the applicability
Christer Samuelsson
arxiv +9 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 +4 more sources
A Simple, Possibly Correct LR Parser for C11 [PDF]
ACM Transactions on Programming Languages and Systems, 2017 The syntax of the C programming language is described in the C11 standard by an ambiguous context-free grammar, accompanied with English prose that describes the concept of “scope” and indicates how certain ambiguous code fragments should be interpreted. Based on these elements, the problem of implementing a compliant C11 parser is not entirely trivial.
Jacques-Henri Jourdan, François Pottier
semanticscholar +7 more sources
A generalized LR parser for text-to-speech synthesis [PDF]
Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 2002 The development of a parser for a Norwegian text-to-speech system is reported. The generalized left-right (GLR) algorithm is applied, which is a generalization of the well-known LR algorithm for parsing computer languages. This paper briefly describes the GLR algorithm, the integration of a probabilistic scoring model, our implementation of the parser ...
Per Olav Heggtveit
semanticscholar +3 more sources
Incremental Parser Generation for Tree Adjoining Grammars [PDF]
Longer version of paper in Proceedings of the 34th Meeting of the
ACL, Student Session. Santa Cruz, June 1996, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is defined in which parse tables are created by need while ...
Sarkar, Anoop
arxiv +3 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 +2 more sources
Theoretical Computer Science, 1992 AbstractA 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 memorize the results of previous invocations.
René Leermakers +2 more
openaire +4 more sources
Generalized LR parsing and the shuffle operator [PDF]
arXiv, 2016 We adapt Tomita's Generalized LR algorithm to languages generated by context-free grammars enriched with a shuffle operator. The change involves extensions to the underlying handle-finding finite automaton, construction of parser tables, and the necessary optimizations in constructing a deterministic parser.
John Maraist
arxiv +3 more sources
LR-parser-driven Viterbi search with hypotheses merging mechanism using context-dependent phone models [PDF]
Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 2002 Describes a Viterbi search algorithm for continuous speech recognition using context-dependent phone models under the constraint defined by a context-free grammar (CFG).
Tatsuro Yamada, Shigeki Sagayama
openalex +2 more sources