Results 71 to 80 of about 636 (187)
Practical arbitrary lookahead LR parsing
, 1990 We present a practical technique for computing lookahead for an LR(0) parser, that progressively attempts single-symbol, multi-symbol, and arbitrary lookahead.
Schimpf, Karl M., Bermudez, Manuel E.
core +1 more source
Automata library - LR parser construction
, 2016 Předmětem této práce jsou základní LR parsovací algoritmy. Práce v úvodu popisuje obecně bottom-up a shift-reduce parsování. Dále se zaměřuje na LR parsování, specificky LR(0) a SLR(1) parsery.
Kočička Martin
core
LR-regular grammars—an extension of LR(k) grammars
, 1973 LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is allowed before making a parsing decision during the bottom-up syntactical analysis; however, this look-ahead is restricted ...
Cohen, Rina +3 more
core +1 more source
An interactive simple LR (k) parser generator for language design applications
, 1977 The SLR(k) Parser Generator discussed in this paper is based upon the automated parser construction algorithm developed by D. E. Knuth and the optimizations proposed by F. L. DeRemer.
LaNata, Arthur Lionel J.
core
Integrated Molecular and Bioinformatics Approaches for Disease-Related Genes in Plants. [PDF]
Plants (Basel), 2023 Joshi A, Song HG, Yang SY, Lee JH.
europepmc +1 more source
A Bounded Graph-Connect Construction for LR-regular Parsers
, 2001 Parser generation tools currently used for computer language analysis rely on user wisdom in order to resolve grammar conflicts. Here practical LR(0)-based parser generation is introduced, with automatic conflict resolution by potentially-unbounded ...
José Fortes Gálvez +3 more
core +1 more source
Generating LR(1) parsers of small size
, 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 ...
Fortes Gálvez José +1 more
core +1 more source
Do syntactic trees enhance Bidirectional Encoder Representations from Transformers (BERT) models for chemical-drug relation extraction? [PDF]
Database (Oxford), 2022 Tang A +4 more
europepmc +1 more source