Results 111 to 120 of about 163,637 (234)
Generating LR(1) parsers of small size [PDF]
, 1992 Classic LR(1) parsing methods have the problem of producing too large parsing tables for programming language grammars. An alternative is to build an automaton that combines the lookahead symbol with reading the parsing stack from its top, to determine the next parsing action.
openaire +3 more sources
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
Strict deterministic versus LR(0) parsing [PDF]
, 1973 Matthew M. Geller, Michael A. Harrison
openalex +1 more source
Evaluating an app for digital medical history taking in urgent care practices: study protocol of the cluster-randomized interventional trial 'DASI'. [PDF]
BMC Prim Care, 2023 Noack EM +8 more
europepmc +1 more source
Empirical comparison of LR(k) and precedence parsers [PDF]
, 1970 J. J. Horning, Wilf R. LaLonde
openalex +1 more source
Inessential Error Entries and Their Use in LR Parser Optimization
ACM Transactions on Programming Languages and Systems, 1982 E. Soisalon-Soininen
semanticscholar +1 more source
prPred: A Predictor to Identify Plant Resistance Proteins by Incorporating k-Spaced Amino Acid (Group) Pairs. [PDF]
Front Bioeng Biotechnol, 2020 Wang Y +5 more
europepmc +1 more source
A Study on ML-Based Software Defect Detection for Security Traceability in Smart Healthcare Applications. [PDF]
Sensors (Basel), 2023 Mcmurray S, Sodhro AH.
europepmc +1 more source
On directly constructing LR(k) parsers without chain reductions [PDF]
, 1976 Wilf R. LaLonde
openalex +1 more source