Results 11 to 20 of about 163,441 (217)
Disambiguation Filters for Scannerless Generalized LR Parsers [PDF]
, 2002 In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax de.nitions in which all aspects (lexical and context-free) of the syntax of a language are de.ned explicitly in one formalism. Furthermore, there are no restrictions on the class of grammars, thus allowing a natural syntax tree ...
Mark van den Brand +3 more
openalex +9 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.
Per Olav Heggtveit
openalex +2 more sources
Reachability and error diagnosis in LR(1) parsers [PDF]
Proceedings of the 25th International Conference on Compiler Construction, 2016 Given an LR(1) automaton, what are the states in which an error can be detected? For each such " error state " , what is a minimal input sentence that causes an error in this state? We propose an algorithm that answers these questions. This allows building a collection of pairs of an erroneous input sentence and a (handwritten) diagnostic message ...
François Pottier
openalex +5 more sources
ACM SIGPLAN Notices, 1986 The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
Philip Machanick
openalex +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
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 Simple, Possibly Correct LR Parser for C11
ACM Transactions on Programming Languages and Systems, 2017 Jacques-Henri Jourdan, François Pottier
openalex +3 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