Results 151 to 160 of about 168,331 (215)
A generalized LR(1) parser for extended context-free grammars
, 2020 Angelo Borsotti +3 more
openalex +1 more source
Understanding COVID-19 vaccine hesitancy of different regions in the post-epidemic era: A causality deep learning approach. [PDF]
Digit HealthLiu Y, Zhao C, Zhang C.
europepmc +1 more source
Semantic approaches for query expansion: taxonomy, challenges, and future research directions. [PDF]
PeerJ Comput SciAllahim A, Cherif A, Imine A.
europepmc +1 more source
BBDetector: Intelligent border binary detection in IoT device firmware based on a multidimensional feature model. [PDF]
PLoS OneYue S +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Applied Mechanics and Materials, 2013
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
Hong-jun Tang
semanticscholar +2 more sources
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
Hong-jun Tang
semanticscholar +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
semanticscholar +2 more sources
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
semanticscholar +2 more sources
Embedding semantics in LR parser tables
Software: Practice and Experience, 1978AbstractThis paper addresses two of the problems commonly associated with LR parsing and syntax directed translation schemes, namely grammar stratification and excessively large table size, A solution is discussed which can eliminate stratification of the grammar by allowing the designer to embed semantics directly within the LR table (i.e., at shift ...
W. Gillett, S. Leach
semanticscholar +3 more sources
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
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.
C. Wetherell, A. Shannon
openaire +1 more source