Results 51 to 60 of about 7,126 (164)
On LR(k)-parsers of polynomial size
CoRR, 2015 Usually, a parser for an $LR(k)$-grammar $G$ is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string $x \in L(G)$. The best known upper bound for the size of such a parser is $O(2^{|G||Σ|^k+k\log |Σ| + \log |G|})$ where $|G|$ and $|Σ|$ are the sizes of the grammar $G$ and the terminal ...
openaire +2 more sources
Self‐Admitted Technical Debt Detection Approaches: A Decade Systematic Review
Journal of Software: Evolution and Process, Volume 38, Issue 4, April 2026.This systematic literature review traces the evolution of self‐admitted technical debt (SATD) detection from heuristic approaches to machine learning, deep learning, and Transformer‐based models. We synthesize the literature by categorizing detection techniques, levels of automation, and evaluation practices, and we identify persistent gaps in ...
Edi Sutoyo, Andrea Capiluppi
wiley +1 more source
Construction of a menu-based system [PDF]
The development of the user interface to a software code management system is discussed. The user interface was specified using a grammar and implemented using a LR parser generator. This was found to be an effective method for the rapid prototyping of a
Collins, W. R., Noonan, R. E.
core +1 more source
Advanced Science, Volume 13, Issue 18, 27 March 2026.This research deciphers the m6A transcriptome by profiling its sites and functional readout effects: from mRNA stability, translation to alternative splicing, across five different cell types. Machine learning model identifies novel m6A‐binding proteins DDX6 and FXR2 and novel m6A reader proteins FUBP3 and L1TD1.
Zhou Huang +11 more
wiley +1 more source
C-structures and f-structures for the British national corpus [PDF]
, 2007 We describe how the British National Corpus (BNC), a one hundred million word balanced corpus of British English, was parsed into Lexical Functional Grammar (LFG) c-structures and f-structures, using a treebank-based parsing architecture.
Foster, Jennifer +3 more
core
Can Subcategorisation Probabilities Help a Statistical Parser?
, 1998 Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies of subcategorisation alternatives for individual verbal predicates. However,
Briscoe, Ted +2 more
core +1 more source
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
The parser generator as a general purpose tool [PDF]
The parser generator has proven to be an extremely useful, general purpose tool. It can be used effectively by programmers having only a knowledge of grammars and no training at all in the theory of formal parsing. Some of the application areas for which
Collins, W. R., Noonan, R. E.
core +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
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