Results 21 to 30 of about 163,637 (234)
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 +11 more sources
Parsing Transformative LR(1) Languages [PDF]
arXiv, 2006 We consider, as a means of making programming languages more flexible and powerful, a parsing algorithm in which the parser may freely modify the grammar while parsing. We are particularly interested in a modification of the canonical LR(1) parsing algorithm in which, after the reduction of certain productions, we examine the source sentence seen so ...
Blake Hegerle
arxiv +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
Apportioning Development Effort in a Probabilistic LR Parsing System through Evaluation [PDF]
Conference on Empirical Methods in Natural Language Processing
(EMNLP-96), 92-100, 1996 We describe an implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-of-speech and punctuation labels coupled with a probabilistic LR parser. We present evaluations of the system's performance along several different dimensions; these enable us to assess the contribution that each ...
Briscoe, Ted, Carroll, John
arxiv +5 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
Faster reachability analysis for LR(1) parsers [PDF]
Proceedings of the 14th ACM SIGPLAN International Conference on Software Language Engineering, 2021 We present a novel algorithm for reachability in an LR(1) automaton. For each transition in the automaton, the problem is to determine under what conditions this transition can be taken, that is, which (minimal) input fragment and which lookahead symbol allow taking this transition.
Bour, Frédéric, Pottier, François
openaire +3 more sources
Latent class analysis to characterize neonatal risk for neurodevelopmental differences
Journal of Child Psychology and Psychiatry, Volume 64, Issue 1, Page 100-109, January 2023., 2023 Background Neonatal risk factors, such as preterm birth and low birth weight, have been robustly linked to neurodevelopmental deficits, yet it is still unclear why some infants born preterm and/or low birth weight experience neurodevelopmental difficulties while others do not.
Allison M. Momany +4 more
wiley +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