Results 111 to 120 of about 7,126 (164)
Unveiling scientific articles from paper mills with provenance analysis. [PDF]
PLoS OneCardenuto JP, Moreira D, Rocha A.
europepmc +1 more source
The structure-preserving spectral graph neural network for dual kinase inhibitors and synergy scoring in gastric cancer. [PDF]
NPJ Digit MedZhang Y +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
LR—Automatic Parser Generator and LR(1) Parser
IEEE Transactions on Software Engineering, 1981LR is an LR(1) parser generation system. It is written entirely in portable ANS1 standard Fortran 66 and has been successfully operated on a number of computers. LR uses a powerful algorithm of Pager's to generate a space efficient parser for any LR(1) grammar.
Charles S. Wetherell, Alfred Shannon
openaire +1 more source
DR parsers: a generalization of LR parsers
Proceedings of the 1990 IEEE Workshop on Visual Languages, 2002A method is presented to construct a parser for a visual language whose specification can be done by a context-free grammar. The main idea is to allow a traditional LR parser to choose the next symbol to parse from a two-dimensional space. The positional grammar is defined, and some examples are given.
Costagliola G., Chang S. K.
openaire +2 more sources
Information Processing Letters, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eljas Soisalon-Soininen, Jorma Tarhio
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eljas Soisalon-Soininen, Jorma Tarhio
openaire +1 more source
On the reduction of LR(k) parsers
Information Processing Letters, 1993We propose a new formalism for merging \(LR(k)\) states without any conflict, after constructing the full \(LR(k)\) parsing table. First, we define a new relation compatible \(C\) and \(C\)-covering for a core block, both of which are different from the notion in dynamic reduction methods. Then, we propose well-defined reduction (WDR) which is a set of
PARK, WJ +2 more
openaire +2 more sources
ACM SIGPLAN Notices, 2006
Here a scheme is presented, which reduces the size of an LR parser. It is accomplished by merging two states, which do not perform differently on the same input symbol or non-terminal. This state merging has following advantages:1. The reduction in number of states is greater than the reduction in an LALR parser.2. The power of parser is not reduced as
Dillip Kumar Lenka, Pawan Kumar
openaire +1 more source
Here a scheme is presented, which reduces the size of an LR parser. It is accomplished by merging two states, which do not perform differently on the same input symbol or non-terminal. This state merging has following advantages:1. The reduction in number of states is greater than the reduction in an LALR parser.2. The power of parser is not reduced as
Dillip Kumar Lenka, Pawan Kumar
openaire +1 more source
Acta Informatica, 1973
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +2 more sources
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +2 more sources
Optimization of LR(k) “Reduced parsers”
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ANCONA, MASSIMO +2 more
openaire +3 more sources