Results 61 to 70 of about 168,331 (215)
Developing and Evaluating a Probabilistic LR Parser of Part-of-Speech and Punctuation Labels [PDF]
, 1995 Ted Briscoe, John M. Carroll
openalex +3 more sources
Error repair with validation in LR-based parsing [PDF]
, 2001 Ik-Soon Kim, Kwang-Moo Choe
openalex +1 more source
On the size of parsers and LR(k)-grammars
Theoretical Computer Science, 2000 AbstractIn this paper, we consider two tradeoff results regarding the economy of description in parsing. One result is on the tradeoff between the size of a parser and its ability to detect an error early. The other result is on the tradeoff between the size of an LR(k)-grammar and the length k of the lookahead.
Leung, Hing, Wotschke, Detlef
openaire +1 more source
The Mystro system: A comprehensive translator toolkit [PDF]
Mystro is a system that facilities the construction of compilers, assemblers, code generators, query interpretors, and similar programs. It provides features to encourage the use of iterative enhancement.
Collins, W. R., Noonan, R. E.
core +1 more source
When Protein Structure Embedding Meets Large Language Models. [PDF]
Genes (Basel), 2023 Ali S, Chourasia P, Patterson M.
europepmc +1 more source
CHR as grammar formalism. A first report
, 2001 Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity.
Christiansen, Henning
core
An empirical evaluation of Lex/Yacc and ANTLR parser generation tools. [PDF]
PLoS One, 2022 Ortin F +3 more
europepmc +1 more source
, 2004 A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility
Christiansen, Henning
core
Optimizing directly executable LR parsers [PDF]
, 1991 Traditionally, LR parsers are implemented as table interpreters. A parser generator creates tables whose entries are interpreted by the parser driver. Recent research shows that much faster LR parsers can be obtained by converting the table entries into directly executed code.
openaire +1 more source