Download Menhir Reference Manual

Transcript
[5] Frank DeRemer and Thomas Pennello. Efficient computation of LALR(1) look-ahead sets. ACM Transactions on
Programming Languages and Systems, 4(4):615–649, 1982.
[6] Charles Donnelly and Richard Stallman. Bison, September 2005.
[7] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and
Computation. Addison-Wesley, 2000.
[8] R. Nigel Horspool and Michael Whitney. Even faster LR parsing. Software – Practice & Experience, 20(6):515–535,
June 1990.
[9] Steven C. Johnson. Yacc: Yet another compiler compiler. In UNIX Programmer’s Manual, volume 2, pages 353–387.
Holt, Rinehart, and Winston, 1979.
[10] Donald E. Knuth. On the translation of languages from left to right. Information & Control, 8(6):607–639, December
1965.
[11] Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier Rémy, and Jérôme Vouillon. The Objective Caml system,
October 2005.
[12] David Pager. A practical general method for constructing LR(k) parsers. Acta Informatica, 7:249–268, 1977.
[13] François Pottier and Yann Régis-Gianas. Towards efficient, typed LR parsers. In ACM Workshop on ML, volume
148 of Electronic Notes in Theoretical Computer Science, pages 155–180, March 2006.
[14] David R. Tarditi and Andrew W. Appel. ML-Yacc User’s Manual, April 2000.
[15] Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606–
611, 1979.