Results 181 to 190 of about 163,637 (234)
Some of the next articles are maybe not open access.
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 +3 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
openaire +3 more sources
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
openaire +3 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
openaire +3 more sources
Parglare: A LR/GLR parser for Python
Science of Computer Programming, 2022Abstract Parglare is a Python parsing library that implements deterministic LR and its generalized extension GLR algorithms. Parglare strives to be easy to use by providing rich error messages, visualization, a CLI tool for grammar development, and good documentation. The same grammar format is used for both algorithms. It is easy to choose either LR
Igor Dejanović
openaire +3 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 ...
Will D. Gillett, Sandra Leach
openaire +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 +3 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 +2 more sources
An LR parser with pre-determined reduction goals
Information Processing Letters, 1999Kwang-Moo Choe, Gyung-Ok Lee
openaire +3 more sources
Information Processing Letters, 1988
Abstract An LR parser generated from an arbitrary grammar may be looping. A characterization is given for grammars that will never produce a looping LR parser. A testing algorithm is outlined, and its time complexity is analyzed.
Jorma Tarhio, Eljas Soisalon-Soininen
openaire +2 more sources
Abstract An LR parser generated from an arbitrary grammar may be looping. A characterization is given for grammars that will never produce a looping LR parser. A testing algorithm is outlined, and its time complexity is analyzed.
Jorma Tarhio, Eljas Soisalon-Soininen
openaire +2 more sources
Optimization of LR(k) “Reduced parsers”
Information Processing Letters, 1992Abstract Some optimization algorithms for LR( k ) tables presented by A.V. Aho and J.D. Ullman ( J. Comput. System Sci. 6 (1972) 573-602) are extended to a new type of parsing tables, called Reduced Tables . The corresponding algorithms are compared and a sufficient condition which guarantees a lower space size of the new tables with respect to the
ANCONA, MASSIMO +2 more
openaire +3 more sources
Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources