Code generation based on formal BURS theory and heuristic search

Acta Informatica

Volumn 34, Issue 8, 1997, Pages 597-635

  Nymeyer, A ^a   Katoen, J P ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; FORMAL LANGUAGES; HEURISTIC PROGRAMMING;

AUTOMATIC CODE GENERATION; BOTTOM UP REWRITE SYSTEM;

PATTERN MATCHING;

EID: 0031295105     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050099     Document Type: Article

References (40)

1. Aho, A.V., Ganapathi, M., Tjiang, S.W.K.: Code generation using tree matching and dynamic programming. ACM Trans, on Prog. Lang, and Sys. 11(4), 491-516 (1989)
2. Aho, A.V., Johnson, S.C.: Optimal code generation for expression trees. J. ACM 23(3) 488-501 (1976)
3. Aho, A.V., Johnson, S.C., Ullman, J.D.: Code generation for machines with multiregister operations. In Proc. of the Fourth Ann. ACM Symp. on Principles of Progr. Lang., 21-28 (1977)
4. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Reading, MA: Addison-Wesley (1986)
5. Balachandran, A., Dhamdhere D.M., Biswas, S.: Efficient retargetable code generation using bottom-up tree pattern matching. Comput. Lang. 15(3), 127-140 (1990)
6. Cai, J., Paige, R., Tarjan, R.: More efficient bottom-up multi-pattern matching in trees. Theoret. Comput. Sci. 106, 21-60 (1992)
7. Cattell, R.G.G.: Code generation in a machine-independent compiler. Proc of the ACM SIGPLAN 1979 Symp. on Compiler Construction, ACM SIGPLAN Notices 14(8), 65-75 (1979)
8. Cattell, R.G.G.: Automatic derivation of code generators from machine descriptions. ACM Trans, on Prog. Lang, and Sys. 2(2), 173-190 (1980)
9. Cattell, R.G.G.: Formalization and Automatic Derivation of Code Generators. UMI Research Press, Ann Arbor, Michigan (1982)
10. Chase, D.R.: An improvement to bottom-up tree pattern matching. In Proc of the Fourteenth Ann. ACM Symp. on Principles of Progr. Lang., 168-177 (1987)
11. Christopher, T.W., Hatcher, P.J., Kukuk, R.C.: Using dynamic programming to generate optimised code in a Graham-Glanville style code generator. Proc of the ACM SIGPLAN 1984 Symp. on Compiler Construction, ACM SIGPLAN Notices 19(6), 25-36 (1984)
12. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), Leeuwen, J. van (ed), 245-320. Amsterdam: Elsevier (1990)
13. Emmelmann, H.: Code selection by regularly controlled term rewriting. Code generation - concepts, tools, techniques, Giegerich, R., Graham, S.L. (eds), (Workshops in Computing Series, 3-29) Berlin, Heidelberg, New York: Springer 1991
14. Emmelmann, H., Schröer, F.W., Landwehr, R.: BEG - a generator for efficient back ends. ACM SIGPLAN Notices 24(7), 246-257 (1989)
15. Ferdinand, C., Seidl, H., Wilhelm, R.: Tree automata for code selection. Acta Informatica 31(8), 741-760 (1994)
16. Fraser, C.W., Hanson, D.R., Proebsting, T.A.: Engineering a simple, efficient code-generator generator. ACM Letters on Progr. Lang, and Sys. 1(3), 213-226 (1992)
17. Fraser, C.W., Henry, R.R., Proebsting, T.A.: BURG - fast optimal instruction selection and tree parsing. ACM SIGPLAN Notices 27(4), 68-76 (1992)
18. Giegerich, R.: Code selection by inversion of order-sorted derivors. Theoret. Comput. Sci. 73, 177-211 (1990)
19. Giegerich, R , Schmal, K.: Code selection techniques: pattern matching, tree parsing, and inversion of derivors. Proc. 2nd European Symp. on Programming, Ganzinger, H. (ed) (Lect. Notes in Comput. Sci. vol. 300, 247-268). Berlin, Heidelberg, New York: Springer 1988
20. Glanville, R.S.: A machine independent algorithm for code generation and its use in retargetable compilers. Ph.D. thesis, University of California, Berkeley (1977)
21. Gough, K.J.: Bottom-up tree rewriting tool MBURG. ACM Sigplan Notices 31(1), 28-31 (1996)
22. Glanville, R.S., Graham, S.L.: A new method for compiler code generation. Proc. of the Fifth Ann. ACM Symp. on Principles of Progr. Lang., 231-240 (1978)
23. Hatcher, P.J. Christopher, T.W.: High-quality code generation via bottom-up tree pattern matching. Proc. of the Thirteenth Ann. ACM Symp. on Principles of Progr. Lang., 119-130 (1986)
24. Hemerik, C., Katoen, J.P.: Bottom-up tree acceptors. Sci. of Comput. Progr. 13, 51-72 (1990)
25. Henry, R.R.: The CODEGEN user's manual. Technical report 87-08-04, Computer Science Department, University of Washington (1988)
26. Henry, R.R.: Encoding optimal pattern selection in a table-driven bottom-up tree-pattern matcher. Technical Report 89-02-04, Computer Science Department, University of Washington (1989)
27. Henry, R.R, Damron, P.C.: Algorithms for table-driven generators using tree-pattern matching. Technical Report 89-02-03, Computer Science Department, University of Washington (1989)
28. Henry, R.R, Damron, P.C.: Performance of table-driven code generators using tree-pattern matching. Technical Report 89-02-02, Computer Science Department, University of Washington (1989)
29. Hoffmann, C.M., O'Donnell, M.J.: Pattern matching in trees. J. ACM 29(1), 68-95 (1982)
30. Kanal, L., Kumar, V., (eds): Search in Artificial Intelligence. Berlin, Heidelberg, New York: Springer (1988)
31. Kron, H : Tree templates and subtree transformational grammars. Ph.D. thesis, Information Sciences Department, University of California at Santa Cruz (1975)
32. Kurtz, S: Narrowing and Basic Forward Closures. Technical Report 5, Technische Fakultät, Universität Bielefeld (1992)
33. Nijmeijer, A: Review of the Graham-Glanville code-generation scheme. Technical Report 88-61, Department of Computer Science, University of Twente (1988)
34. Nilsson, N.: Principles of Artificial Intelligence. Palo Alto: Morgan Kaufmann (1980)
35. Pelegrí-Llopart, E.: Rewrite systems, pattern matching, and code generation. Ph.D. thesis, University of California, Berkeley (1987) (also as Technical Report CSD-88-423)
36. Pelegrí-Llopart, E., Graham, S.L.: Optimal code generation for expression trees: An application of BURS theory. Proc. of the Fifteenth Ann. ACM Symp. on Principles of Progr. Lang., 294-308 (1988)
37. Proebsting, T.A.: BURS automata generation. ACM Trans. on Prog. Lang. and Sys. 3(17), 461-486 (1995)
38. Proebsting, T.A., Whaley, B.R.: One-pass, optimal tree parsing - with or without trees. Compiler construction, Gyimóthy, T. (ed) (Lect. Notes in Comput. Sci. vol. 1060, 294-308) Berlin, Heidelberg, New York: Springer 1996
39. Weisgerber, B., Wilhelm, R.: Two tree pattern matchers for code selection. Compiler compilers and high speed compilation, Hammer, D. (ed) (Lect. Notes in Comput. Sci. vol. 371, 215-229) Berlin, Heidelberg, New York: Springer 1989
40. Wulf, W.A., Leverett, B.W., Cattell, R.G.G., Hobbs, S.O., Newcomer, J.M., Reiner, A.H., Schatz, B.R.: An overview of the production-quality compiler compiler project. IEEE Computer 13(8), 38-49 (1980)