Affiliation:
1. Royal Holloway, University of London, United Kingdom
Abstract
The right nulled generalized LR parsing algorithm is a new generalization of LR parsing which provides an elegant correction to, and extension of, Tomita's GLR methods whereby we extend the notion of a
reduction
in a shift-reduce parser to include
right nulled
items. The result is a parsing technique which runs in linear time on LR(1) grammars and whose performance degrades gracefully to a polynomial bound in the presence of nonLR(1) rules. Compared to other GLR-based techniques, our algorithm is simpler and faster.
Publisher
Association for Computing Machinery (ACM)
Reference42 articles.
1. Deterministic parsing of ambiguous grammars
2. Aho A. V. and Ullman J. D. 1972. The Theory of Parsing Translation and Compiling. Series in Automatic Computation vol. 1---Parsing. Prentice-Hall Upper Saddle River N. J. Aho A. V. and Ullman J. D. 1972. The Theory of Parsing Translation and Compiling. Series in Automatic Computation vol. 1---Parsing. Prentice-Hall Upper Saddle River N. J.
3. The structure of shared forests in ambiguous parsing
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献