Communications of the ACM
A practical method for constructing LR (k) processors
Communications of the ACM
Machines, Languages and Computation
Machines, Languages and Computation
A technique for speeding up LR(k) parsers
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The care and feeding of LR(k) grammars
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the construction of LR(k) analyzers
ACM '71 Proceedings of the 1971 26th annual conference
PRACTICAL TRANSLATORS FOR LR(K) LANGUAGES
PRACTICAL TRANSLATORS FOR LR(K) LANGUAGES
Elimination of single productions from LR parsers in conjunction with the use of default reductions
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution
Proceedings of the 2008 ACM symposium on Applied computing
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
| Hi-index | 0.00 |
The paper presents, as far as the author is aware, the first practical general method for constructing LR(k) parsers. It has been used, without computational difficulty, to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL.