Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
A parser-generating system for constructing compressed compilers
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
Compiler Design Theory
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
Bounded context parsing was first introduced by Floyd and Graham in which they used a precedence parsing method. However, precedence parsing has some drawbacks such as the parser is often very large and not all languages are precedence parsable.Another technique for generating a Bounded Context Parser was developed by Mickunas at Purdue University. This technique, which is often referred to as Bounded Context Acceptor (BCA) or Extended Bounded Context Acceptor (EBCA), can generate a more compact parser.This paper introduces a new parsing method which is derived from EBCA. The parse table generated by this method is much smaller than those generated by EBCA. The parsing technique yields similiar or improved efficiency when compared to EBCA.