Abstract
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 it would be in an LALR parser.The above merging scheme has following disadvantages:1. Even erroneous inputs are accepted. However, it is stopped by changing the notion of acceptance.2. Errors are report late and in a misleading manner.3. Parsing takes more time because string matching is done during reduction.
- Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Compiler: Principles, Techniques, and Tools, 1986, Addison-Wesley. Google Scholar
Digital Library
Index Terms
States merging in LR parser
Recommendations
LR Automatic Parser Generator and LR(1) Parser
LR 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) ...
An efficient LR parser generator for tree-adjoining grammars
New developments in parsing technologyIn this chapter we discuss practical LR-like parser generator models for Tree Adjoining Grammars (TAGs) and propose a new algorithm. The algorithm has been implemented and applied to two large coverage TAGs for English: the XTAG English grammar, and a ...






Comments