[ASU86]

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co., Inc., 1986.
[ bib ]

[AU72]

Alfred V. Aho and Jeffrey D. Ullman. The Theory of Parsing, Translation, and Compiling, volume I: Parsing of Series in Automatic Computation. Prentice Hall, Englewood Cliffs, New Jersey, 1972.
[ bib ]

[BS90]

Manuel E. Bermudez and Karl M. Schimpf. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230-250, 1990.
[ bib | http ]

[BV02]

Carlos Javier Borges Villalba. Implementaciòn del méthodo LR(1)-inverso en la herramienta bison. Proyecto fin de carrera, Escula Universitaria de Informática de la Universidad de las Palmas de Gran Canaria, Septiembre 2002.
[ bib | http ]

[Cay01]

Robert Olivier Cayot. Récupération automatique d'erreurs syntaxiques en analyse discriminante rétrograde. PhD thesis, Université de Nice-Sophia Antipolis, décembre 2001.
[ bib ]

[CC73]

Karel and Rina Cohen. LR-Regular grammars-an extension of LR(k) grammars. Journal of Computer and System Sciences, 7:66-96, 1973.
[ bib ]

[Col70]

Alain Colmerauer. Total precedence relations. Journal of the ACM, 17(1):14-30, January 1970.
[ bib | http ]

[DeR69]

Franklin Lewis DeRemer. Practical Translators for LR(k) Languages. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1969.
[ bib | http ]

[DeR71]

Franklin L. DeRemer. Simple LR(k) grammars. Communications of the ACM, 14(7):453-460, 1971.
[ bib | http ]

[DP82]

Frank DeRemer and Thomas Pennello. Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(4):615-649, 1982.
[ bib | http ]

[DS02]

Charles Donnely and Richard Stallman. Bison, The YACC-compatible Parser Generator. The Free Software Foundation, February 2002.
[ bib | http ]

[FFG00]

Jacques Farré and José Fortes Gálvez. A simple-context noncanonical solution for extended discriminating-reverse parsing. Technical Report TR 00-12, I3S, 2000.
[ bib ]

[FFG01]

Jacques Farré and José Fortes Gálvez. A basis for looping extensions to discriminating-reverse parsing. In S. Yu and A. Paun, editors, Implementation and Applications of Automata, 5th International Conference, CIAA 2000, volume 2088 of LNCS, pages 122-134. Springer-Verlag, July 2001.
[ bib | http ]

[FFG02]

Jacques Farré and José Fortes Gálvez. Bounded-graph construction for noncanonical discriminating-reverse parsers. In B. Watson and D. Wood, editors, Implementation and Applications of Automata, 6th International Conference, CIAA 2001, volume 2494 of LNCS, pages 101-114. Springer-Verlag, January 2002.
[ bib | http ]

[FFG04]

Jacques Farré and José Fortes Gálvez. Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science, 313(1):73-91, February 2004.
[ bib | http ]

[FG98]

José Fortes Gálvez. A Discriminating Reverse Approach to LR(k) Parsing. PhD thesis, Universidad de Las Palmas de Gran Canaria and Université de Nice-Sophia Antipolis, 1998.
[ bib ]

[Fis75]

Charles N. Fischer. On parsing context free languages in parallel environments. Technical Report 75-237, Department of Computer Science, Cornell University, Ithaca, New York, April 1975.
[ bib | http ]

[Flo64]

Robert W. Floyd. Bounded context syntactic analysis. Communications of the ACM, 7(2):62-67, 1964.
[ bib | http ]

[GJ90]

Dick Grune and Ceriel J. H. Jacobs. Parsing Techniques: A Practical Guide. Ellis Horwood Limited, 1990.
[ bib | http ]

[Hun82]

H. B. Hunt, III. On the decidability of grammar problems. Journal of the ACM (JACM), 29(2):429-447, 1982.
[ bib | http ]

[Hut90]

Michael Hutton. Noncanonical extensions of LR parsing methods. Unpublished, August 1990.
[ bib | http ]

[Joh75]

Stephen C. Johnson. YACC - yet another compiler compiler. Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey, July 1975.
[ bib ]

[KC01]

Ik-Soon Kim and Kwang-Moo Choe. Error repair with validation in LR-based parsing. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(4):451-471, 2001.
[ bib | http ]

[Knu65]

Donald E. Knuth. On the translation of languages from left to right. Information and Control, 8:607-639, 1965.
[ bib ]

[Lan74]

Bernard Lang. Deterministic techniques for efficient non-deterministic parsers. In J. Loeckx, editor, Proceedings of the Second Colloquium on Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 255-269, Berlin, 1974. Springer Verlag.
[ bib ]

[LT96]

Alon Lavie and Masaru Tomita. GLR^* - an efficient noise-skipping parsing algorithm for context free grammars. In Harry Bunt and Masaru Tomita, editors, Recent Advances in Parsing Technology, volume 1 of Text Speech and Language Technology series. Kluwer Academic Press, August 1996.
[ bib | http ]

[McP02]

Scott McPeak. Elkhound: A fast, practical GLR parser generator. Technical report, University of California, Berkeley, Computer Science Division (EECS), December 2002.
[ bib | http ]

[MLS76]

M. D. Mickunas, R. L. Lancaster, and V. B. Schneider. Transforming LR(k) grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context grammars. Journal of the ACM (JACM), 23(3):511-533, 1976.
[ bib | http ]

[MM78]

M. Dennis Mickunas and John A. Modry. Automatic error recovery for LR parsers. Communications of the ACM, 21(6):459-465, 1978.
[ bib | http ]

[PD78]

Thomas J. Pennello and Frank DeRemer. A forward move algorithm for LR error recovery. In Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 241-254. ACM Press, 1978.
[ bib | http ]

[Pen86]

Thomas J. Pennello. Very fast LR parsing. In Proceedings of the 1986 SIGPLAN symposium on Compiler contruction, pages 145-151. ACM Press, 1986.
[ bib | http ]

[PQ95]

Terence J. Parr and Russel W. Quong. ANTLR: A predicated-LL(k) parser generator. Software, Practice and DSL Preisvergleich , 25(7):789-810, 1995.
[ bib | http ]

[Ruc98]

Martin Ruckert. Generating efficient substring parsers for BRC grammars. Technical Report 98-105, Department of Mathematics and Computer Science, State University of New York, New Platz, NY, July 1998.
[ bib ]

[SC89]

Daniel J. Salomon and Gordon V. Cormack. Scannerless NSLR(1) parsing of programming languages. In Proceedings of the SIGPLAN '89 Conference on Programming language design and implementation, pages 170-178. ACM Press, 1989.
[ bib | http ]

[Sch79]

Richard M. Schell. Methods for constructing parallel compilers for use in a multiprocessor environment. PhD dissertation, University of Illinois, Urbana, 1979.
[ bib ]

[Sei87]

B. Seité. A Yacc extension for LRR grammar parsing. Theoretical Computer Science, 52:91-143, 1987.
[ bib | http ]

[SSS90]

Seppo Sippu and Eljas Soisalon-Soininen. Parsing Theory, volume II: LR(k) and LL(k) Parsing of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
[ bib ]

[ST00]

Michael Sperber and Peter Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems (TOPLAS), 22(2):224-264, 2000.
[ bib | http ]

[SW76]

Thomas G. Szymanski and John H. Williams. Noncanonical extensions of bottom-up parsing techniques. SIAM Journal of Computing, 5(2):231-250, June 1976.
[ bib | http ]

[Szy73]

Thomas G. Szymanski. Generalized Bottom-Up Parsing. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, May 1973.
[ bib | http ]

[Tai79]

Kou-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems (TOPLAS), 1(2):295-320, 1979.
[ bib | http ]

[Tom86]

Masaru Tomita. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, 1986.
[ bib ]

[Wil72]

John H. Williams. Bounded context parsable grammars. Technical Report 72-127, Department of Computer Science, Cornell University, Ithaca, New York, April 1972.
[ bib | http ]