Generation of LR parsers by partial evaluation

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 2, 2000, Pages 224-264

  Sperber, Michael ^a   Thiemann, Peter ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

D.1.1 Programming Techniques : Applicative (Functional) Programming; D.1.2 Programming Techniques : Automatic Programming; D.3.2 Programming Languages : Language Classifications Applicative Languages; D.3.4 Programming Languages : Processors

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING; ERROR ANALYSIS; NATURAL SCIENCES COMPUTING; PROGRAM COMPILERS; SEMANTICS;

FUNCTIONAL PROGRAMMING; MEMOIZATION; PARSER GENERATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0039893757     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/349214.349219     Document Type: Article

References (58)

1. BONDORF, A. 1991. Automatic autoprojection of higher order recursive equations. Science of Computer Programming 17, 3-34.
2. BONDORF, A. 1993. Similix 5.0 Manual. DIKU, University of Copenhagen.
3. CHAPMAN, N. P. 1987. LR parsing: theory and practice. Cambridge University Press, Cambridge.
4. CHIRICA, L. AND MARTIN, D. 1979. An order algebraic definition of Knuthian semantics. Theor. Comp. Sci. 13, 1-27.
5. CONSEL, C. AND DANVY, O. 1991. For a better support of static data flow. See Hughes [1991], pp. 496-519.
6. CONSEL, C. AND DANVY, O. 1993. Tutorial notes on partial evaluation. In Proc. 20th Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, pp. 493-501. ACM Press.
7. DANVY, O. AND FILINSKI, A. 1992. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science 2, 361-391.
8. DANVY, O., MALMKJÆR, K., AND PALSBERG, J. 1996. Eta-expansion does The Trick. ACM Transactions on Programming Languages and Systems 18, 6 (Nov.), 730-751.
9. DENCKER, P., DÜRRE, K., AND HEUFT, J. 1984. Optimization of parser tables for portable compilers. ACM Transactions on Programming Languages and Systems 6, 4 (Oct.), 546-572.
10. DEREMER, F. AND PENNELLO, T. 1982. Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems 4, 4 (Oct.), 615-649.
11. DEREMER, F. L. 1969. Practical translators for LR(k) parsers. Ph.D. thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Ma.
12. DEREMER, F. L. 1971. Simple LR(k) grammars. Communications of the ACM 14, 7, 453-460.
13. DONNELLY, C. AND STALLMAN, R. 1995. Bison - The YACC-compatible Parser Generator. Boston, MA: Free Software Foundation. Part of the Bison distribution.
14. DYBKJÆR, H. 1985. Parsers and partial evaluation: An experiment. Student Report 85-7-15 (July), DIKU, University of Copenhagen, Denmark.
15. ERSHOV, A. P. AND OSTROVSKY, B. N. 1987. Controlled mixed computation and its application to systematic development of language-oriented parsers. In L. G. L. T. MEERTENS (Ed.), Program Specification and Transformation, Proc. IFIP TC2/WG 2.1 Working Conference on Program Specification and Transformation, pp. 31-48. North Holland.
16. FISCHER, M. J. 1993. Lambda-calculus schemata. Lisp and Symbolic Computation 6, 3/4, 259-288.
17. FUTAMURA, Y. 1971. Partial evaluation of computation process - an approach to a compiler-compiler. Systems, Computers, Controls 2, 5, 45-50.
18. GOMARD, C. K. AND JONES, N. D. 1991. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming 1, 1 (Jan.), 21-70.
19. GROSCH, J. 1990. Lalr - a generator for efficient parsers. Software - Practice & Experience 20, 11 (Nov.), 1115-1135.
20. HOLST, C. K. AND GOMARD, C. K. 1991. Partial evaluation is fuller laziness. In P. HUDAK AND N. D. JONES (Eds.), Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '91, New Haven, CT, pp. 223-233. ACM. SIGPLAN Notices 26(9).
21. HUGHES, J. (Ed.) 1991. Functional Programming Languages and Computer Architecture, Volume 523 of Lecture Notes in Computer Science, Cambridge, MA. Springer-Verlag.
22. HUTTON, G. 1990. Parsing using combinators. In K. DAVIS AND J. HUGHES (Eds.), Functional Programming, Glasgow 1989, pp. 353-370. Springer-Verlag.
23. IEEE 1991. Standard for the Scheme programming language. Tech. Rep. 1178-1990, Institute of Electrical and Electronic Engineers, Inc., New York.
24. IVES, F. 1986. Unifying view of recent LALR(1) lookahead set algorithms. SIGPLAN Notices 21, 7 (July), 131-135. Proceedings of the SIGPLAN'86 Symposium on Compiler Construction.
25. IVES, F. 1987a. An LALR(1) lookahead set algorithm. Unpublished manuscript.
26. IVES, F. 1987b. Response to remarks on recent algorithms for LALR lookahead sets. SIGPLAN Notices 22, 8 (August), 99-104.
27. JOHNSON, S. C. 1975. Yacc - yet another compiler compiler. Tech. Rep. 32, AT&T Bell Laboratories, Murray Hill, NJ.
28. JOHNSSON, T. 1985. Lambda lifting: Transforming programs to recursive equations. In Proc. Functional Programming Languages and Computer Architecture 1985, Volume 201 of Lecture Notes in Computer Science. Springer-Verlag.
29. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall.
30. JONES, N. D., SESTOFT, P., AND SØNDERGAARD, H. 1985. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. JOUANNAUD (Ed.), Rewriting Techniques and Applications, Dijon, France, pp. 124-140. Springer-Verlag. LNCS 202.
31. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation 11, 1, 7-105. Also appears in ACM SIGPLAN Notices 33(9), September 1998. Available electronically as http://www.neci.nj.nec.com/homepages/kelsey/r5rs.ps.gz.
32. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation 11, 1, 7-105. Also appears in ACM SIGPLAN Notices 33(9), September 1998. Available electronically as http://www.neci.nj.nec.com/homepages/kelsey/r5rs.ps.gz.
33. KERNIGHAN, B. W. AND RITCHIE, D. M. 1988. The C Programming Language. Prentice-Hall. 2nd edition.
34. KNUTH, D. E. 1965. On the translation of languages from left to right. Information and Control 8, 607-639.
35. KNUTH, D. E. 1968. Semantics of context-free languages. Mathematical Systems Theory 2, 127-145.
36. KNUTH, D. E. 1971. Semantics of context-free languages. Mathematical Systems Theory 5, 95-96. Correction to [Knuth 1968].
37. LAUNCHBURY, J. AND HOLST, C. K. 1991. Handwriting cogen to avoid problems with static typing. In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pp. 210-218. Glasgow University.
38. LAWALL, J. L. AND DANVY, O. 1994. Continuation-based partial evaluation. In Proc. 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida, USA, pp. 227-238. ACM Press.
39. LEERMAKERS, R. 1993. The Functional Treatment of Parsing. Kluwer Academic Publishers, Boston.
40. MOSSIN, C. 1993. Partial evaluation of general parsers. In D. SCHMIDT (Ed.), Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '93, Copenhagen, Denmark, pp. 13-21. ACM Press.
41. PAGAN, F. L. 1991. Partial Computation and the Construction of Language Processors. Prentice-Hall.
42. PARK, J. C. AND CHOE, K.-M. 1987. Remarks on recent algorithms for LALR lookahead sets. SIGPLAN Notices 22, 4 (April), 30-32.
43. PARK, J. C. H., CHOE, K. M., AND CHANG, C. H. 1985. A new analysis of LALR formalisms. ACM Transactions on Programming Languages and Systems 7, 1 (Jan.), 159-175.
44. PENNELLO, T. J. 1986. Very fast LR parsing. SIGPLAN Notices 21, 7, 145-151.
45. PLOTKIN, G. 1975. Call-by-name, call-by-value and the λ-calculus. Theor. Comp. Sci. 1, 125-159.
46. REYNOLDS, J. C. 1972. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, pp. 717-740.
47. RÖHRICH, J. 1980. Methods for the automatic construction of error correcting parsers. Acta Inf. 13, 115-139.
48. ROBERTS, G. H. 1988. Recursive ascent: An LR analog to recursive descent. SIGPLAN Notices 23, 8, 23-29.
49. SIPPU, S. AND SOISALON-SOININEN, E. 1990. Parsing Theory, Volume II (LR(k) and LL(k) Parsing) of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin.
50. SPERBER, M. 1994. Attribute-directed functional LR parsing. Unpublished manuscript.
51. SPERBER, M. AND THIEMANN, P. 1999. Essence - User Manual. Freiburg, Germany: Universität Freiburg. Available from ftp://ftp.informatik.uni-freiburg.de/iif/thiemann/essence/.
52. SWIERSTRA, S. D. AND DUPONCHEEL, L. 1996. Deterministic, error-correcting combinator parsers. In J. LAUNCHBURY, E. MEIJER, AND T. SHEARD (Eds.), Advanced Functional Programming, Volume 1129 of Lecture Notes in Computer Science, pp. 184-207. Springer-Verlag.
53. TARJAN, R. E. AND YAO, A. 1979. Storing a sparse table. Communications of the ACM 22, 11, 606-611.
54. THIEMANN, P. 1996a. Cogen in six lines. In R. K. DYBVIG (Ed.), Proc. International Conference on Functional Programming 1996, Philadelphia, PA, pp. 180-189. ACM Press, New York.
55. THIEMANN, P. 1996b. Towards partial evaluation of full Scheme. In G. KICZALES (Ed.), Reflection'96, San Francisco, CA, USA, pp. 95-106.
56. THIEMANN, P. 1999. The PGG System - User Manual. Freiburg, Germany: Universität Freiburg. Available from ftp://ftp.informatik.uni-freiburg.de/iif/thiemann/pgg/.
57. TURCHIN, V. F. 1979. A supercompiler system based on the language Refal. SIGPLAN Notices 14, 2 (Feb.), 46-54.
58. WILHELM, R. AND MAURER, D. 1995. Compiler Design. Addison-Wesley.