A practical arbitrary look-ahead LR parsing technique
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Crafting a compiler with C
Efficient construction of LR(k) states and tables
ACM Transactions on Programming Languages and Systems (TOPLAS)
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
Communications of the ACM
Parsing C++ code despite missing declarations
Advances in software engineering
SAM: Simple API for Object-Oriented Code Metrics
ICSR '08 Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
On LR parsing with selective delays
CC'13 Proceedings of the 22nd international conference on Compiler Construction
| Hi-index | 0.00 |
Language translation is a harder and more important problem than language recognition. In particular, programmers implement translators not recognizers. Yet too often, translation is equated with the simpler task of syntactic parsing. This misconception coupled with computing limitations of past computers has led to the almost exclusive use of LR(1) and LL(1) in parser generators. We claim that use of k < 1 lookahead can and should be available in practice, as it simplifies the translator development. We give several examples justifying our arguments.