Full LR(1) parser generation

Authors:
David Spector
Affiliations:
MS 10B-17-3, Prime Computer, Inc., Framingham, Massachusetts
Venue:
ACM SIGPLAN Notices
Year:
1981

Citing 1
Cited 5

Methods for Computing LALR(k) Lookahead

ACM Transactions on Programming Languages and Systems (TOPLAS)

Efficient full LR(I) parser generation

ACM SIGPLAN Notices
Building collections of LR(K) items with partial expansion of lookahead strings

ACM SIGPLAN Notices
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution

Proceedings of the 2008 ACM symposium on Applied computing
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

Science of Computer Programming
Full LR(1) parser generator Hyacc and study on the performance of LR(1) algorithms

Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.