Results 61 to 70 of about 1,597 (177)
Noncanonical Extensions of LR Parsing Methods [PDF]
, 1990 Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various attempts have been made to enhance the power and exibility of the LR method, without losing the property of linear time parsing, or introducing inordinately
Michael D. Hutton
core
Sistem Penganalisis Sintaks Otomatis dengan Metode Generalized-LR Parsing [PDF]
, 2009 The main problem of difficulties in natural language processing is ambiguity. Almostin all level of natural language processing there are ambiguities, including in syntax level.LR-Parser is an efficient method that often be used in developing a ...
Sigit, Antonius +3 more
core +1 more source
Abstract LDTA’04 Preliminary Version Parameterized LR Parsing [PDF]
, 2008 Common LR parser generators lack abstraction facilities for defining recurring patterns of productions. Although there are generators capable of supporting regular expressions on the right hand side of productions, no generator supports user defined ...
Matthias Neubauer +2 more
core
LR parsing for tree adjoining grammars and its application to corpus-based natural language parsing [PDF]
, 2003 This thesis develops the formal aspects of LR parsing for Tree Adjoining Grammars (TAGS) and investigates its application to natural language best-parse parsing. It is argued that the combination of TAG and the LR technique is beneficial to both.
Prolo, Carlos Augusto
core
Generalized LR parsing and the shuffle operator
CoRR, 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.
openaire +2 more sources
Probabilistic Language Modeling for Generalized LR Parsing [PDF]
, 1998 In this thesis, we introduce probabilistic models to rank the likelihood of resultant parses within the GLR parsing framework. Probabilistic models can also bring about the benefit of reduction of search space, if the models allow prefix probabilities ...
Virach Sornlertlamvanich
core
, 1991 This paper is a short introduction to the research in LR parsing and its applications. It is concerned with the history of LR grammars and languages, LR parsing and parser optimization, generalizations of the LR grammar definition and parsing method, automatic parser construction, error handling and LR parsing for natural language.
openaire +3 more sources
Syntax directed translation with LR parsing [PDF]
, 1992 A simple extension of the usual LR parser construction is made in order to build a translator. The LR parsing algorithm is extended by a facility to do output operations within the action shift and reduce. A class of translation grammars, called R-translation grammars, is introduced as an extension of the class of postfix translation grammars ...
openaire +1 more source
A New Probabilistic LR Language Model for Statistical Parsing [PDF]
, 1997 This paper presents a newly formalized probabilistic LR language model. Our model inherits its essential features from Briscoe and Carroll's generalized probabilistic LR (PLR) model [3], which obtains context-sensitivity by assigning a probability ...
Tokunaga Takenobu +4 more
core
Incremental scannerless generalized LR parsing
Proceedings Companion of the 2019 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, 2019 We present the Incremental Scannerless Generalized LR (ISGLR) parsing algorithm, which combines the benefits of Incremental Generalized LR (IGLR) parsing and Scannerless Generalized LR (SGLR) parsing. The parser preprocesses the input by modifying the previously saved parse forest.
openaire +2 more sources