Bibliography

[Denny 2008]

Joel E. Denny and Brian A. Malloy, IELR(1): Practical LR(1) Parser Tables for Non-LR(1) Grammars with Conflict Resolution, in Proceedings of the 2008 ACM Symposium on Applied Computing (SAC’08), ACM, New York, NY, USA, pp. 240–245. http://dx.doi.org/10.1145/1363686.1363747

[Denny 2010 May]

Joel E. Denny, PSLR(1): Pseudo-Scannerless Minimal LR(1) for the Deterministic Parsing of Composite Languages, Ph.D. Dissertation, Clemson University, Clemson, SC, USA (May 2010). http://proquest.umi.com/pqdlink?did=2041473591&Fmt=7&clientId=79356&RQT=309&VName=PQD

[Denny 2010 November]

Joel E. Denny and Brian A. Malloy, The IELR(1) Algorithm for Generating Minimal LR(1) Parser Tables for Non-LR(1) Grammars with Conflict Resolution, in Science of Computer Programming, Vol. 75, Issue 11 (November 2010), pp. 943–979. http://dx.doi.org/10.1016/j.scico.2009.08.001

[DeRemer 1982]

Frank DeRemer and Thomas Pennello, Efficient Computation of LALR(1) Look-Ahead Sets, in ACM Transactions on Programming Languages and Systems, Vol. 4, No. 4 (October 1982), pp. 615–649. http://dx.doi.org/10.1145/69622.357187

[Knuth 1965]

Donald E. Knuth, On the Translation of Languages from Left to Right, in Information and Control, Vol. 8, Issue 6 (December 1965), pp. 607–639. http://dx.doi.org/10.1016/S0019-9958(65)90426-2

[Scott 2000]

Elizabeth Scott, Adrian Johnstone, and Shamsa Sadaf Hussain, Tomita-Style Generalised LR Parsers, Royal Holloway, University of London, Department of Computer Science, TR-00-12 (December 2000). http://www.cs.rhul.ac.uk/research/languages/publications/tomita_style_1.ps