Results 11 to 20 of about 7,184 (201)
Practical LR Parser Generation
, 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
Generation of LR parsers by partial evaluation [PDF]
ACM Transactions on Programming Languages and Systems, 2000 The combination of modern programming languages and partial evaluation yields new approaches to old problems. In particular, the combination of functional programming and partial evaluation can turn a general parser into a parser generator.
Michael Sperber, Peter Thiemann
openalex +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
openalex +5 more sources
An alternative method of training probabilistic LR parsers [PDF]
Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04, 2004 We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in ...
Mark-Jan Nederhof, Giorgio Satta
openalex +5 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
openalex +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
Simple chain grammars and languages [PDF]
, 1979 A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k>0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars.
Nijholt, Anton
core +15 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
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 +3 more sources