Extending Graham-Glanville techniques for optimal code generation

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 6, 2000, Pages 973-1001

  Madhavan, Maya ^a   Shankar, Priti ^a   Rai, Siddhartha ^a   Ramakrishna, U ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Code generator generator; D.3.4 Programming Languages : Processors Code generation, retargetable compilers, translator writing systems and compiler generators; Languages; Optimal code generation; Tree pattern matching

Indexed keywords

EID: 0042911757     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/371880.371881     Document Type: Article

References (23)

1. AHO, A. AND GANAPATHI, M. 1985. Efficient tree pattern matching: An aid to code generation. In Proc. 12th ACM Symp. on Principles of Programming Languages. 334-340.
2. BALACHANDRAN, A., DHAMDHERE, D., AND BISWAS, S. 1990. Efficient retargetable code generation using bottom up tree pattern matching. Computer Languages 3, 15, 127-140.
3. CHASE, D. 1987. An improvement to bottom up tree pattern matching. In Proc. of the 14th ACM Symp. on Principles of Programming Languages. 168-177.
4. CHRISTOPHER, T., HATCHER, P., AND KUKUK, R. 1984. Using dynamic programming to generate optimised code in a Graham-Glanville style code generator. In Proceedings of the ACM SIGPLAN 1984 Symposium on Compiler Construction. 25-36.
5. FERDINAND, C., SEIDL, H., AND WILHELM, R. 1994. Tree automata for code selection. Acta Informatica 31, 741-760.
6. FRASER, C. AND HANSON, D. 1995. A Retargetable C Compiler: Design and Implementation. Benjamin/Cummings, Redwood City, Redwood City, California.
7. FRASER, C., HANSON, D., AND PROEBSTING, T. 1992. Engineering a simple, efficient code-generator generator. ACM Letters on Prog. Lang. and Systems 1, 3, 213-226.
8. GANAPATHI, M. AND FISCHER, C. 1985. Affix grammar driven code generation. ACM Trans. Program. Lang. Syst. 7, 4, 560-599.
9. GANTAIT, A. 1996. Design of a bottom-up tree pattern matching algorithm and its application to code generation. M.E.Project Report, Dept of Computer Science and Automation, Indian Institute of Science, Bangalore, India.
10. GRAHAM., S. AND GLANVILLE, R. 1978. A new approach to compiler code generation. In Proc. of the 5th ACM Symp. om Principles of Programming Languages. 231-240.
11. HATCHER, P. AND CHRISTOPHER, T. 1986. High-quality code generation via bottom-up tree pattern matching. In Proc. of the 13th ACM Symp. on Principles of Programming Languages. 119-130.
12. HENRY, R. AND DAMRON, P. 1989. Performance of table driven generators using tree pattern matching. Tech. Rep. 89-02-02, Computer Science Dept, Univ of Washington.
13. HOFFMAN, C. AND O'DONNELL, M. 1982. Pattern matching in trees. Journal of the ACM 29, 1, 68-95.
14. HOPCROFT, J. AND ULLMAN, J. 1979. An Introduction to Automata Theory, Languages and Computation. Addison Wesley.
15. JOHNSON, S. 1975. Yacc - yet another compiler compiler. Tech. Rep. TR 32, AT & T, Bell Laboratories, New Jersey, USA.
16. KUMAR, R. 1992. Retargetable code generation using bottom-up tree pattern matching. M.E. Project Report, Dept of Computer Science and Automation, Indian Institute of Science, Bangalore, India.
17. NEUMANN, A. AND SEIDL, H. 1998. Locating matches of tree patterns in forests. In Proceedings of 18th FSTTCS, LNCS 1530. 134-145.
18. NYMEYER, A. AND KATOEN, J. 1997. Code generation based on formal BURS theory and heuristic search. Acta Informatica 34, 8, 597-636.
19. PELEGRI-LLOPART, E. AND GRAHAM., S. 1988. Optimal code generation for expression trees. In Proc. of the 15th ACM Symp. on Principles of Programming Languages. 119-129.
20. PROEBSTING, T. 1995. BURS automata generation. ACM Trans. Program. Lang. Syst. 17, 3, 461-486.
21. PROEBSTING, T. AND WHALEY, B. 1996. One-pass optimal tree parsing-with or without trees. In International Conference on Compiler Construction. 294-308.
22. SHANKAR, P., GANTAIT, A., YUVARAJ, A., AND MADHAVAN, M. 2000. A new algorithm for linear regular tree pattern matching. Theor. Comput. Sci. 242, 125-142.
23. WEISBERGER, B. AND WILLHELM, R. 1988. Two tree pattern matchers for code selection. In Compiler compilers and high speed compilation, LNCS 371. 215-229.