A new algorithm for linear regular tree pattern matching

Theoretical Computer Science

Volumn 242, Issue 1-2, 2000, Pages 125-142

  Shankar, Priti ^a   Gantait, Amitranjan ^a   Yuvaraj, A R ^a   Madhavan, Maya ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Regular tree grammars; Retargetable code generation; Tree pattern matching

Indexed keywords

EID: 0042621472     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00205-9     Document Type: Article

References (13)

1. A.V. Aho, M. Ganapathi, Efficient tree pattern matching: an aid to code generation, in: Proc. 12th ACM Symp. on Priciples of Programming Languages, 1985, pp. 334-340.
2. A. Balachandran, D.M. Dhamdhere, S. Biswas, Efficient retargetable code generation using bottom up tree pattern matching, Comput. Lang. 3 (15) (1990) 127-140.
3. D. Chase, An improvement to bottom up tree pattern matching, in: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, 1987, pp. 168-177.
4. M. Dubiner, Z. Galil, E. Magen, Faster tree pattern matching, in: Proc. 31st IEEE FOCS '90, 1990.
5. C. Ferdinand, H. Seidl, R. Wilhelm, Tree automata for code selection, Acta Inform. 31 (1994) 741-760.
6. A. Gantait, A new algorithm for tree pattern matching and its application to retargetable code generation, M.E. Project Report, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, December 1996.
7. R.S. Glanville, S.L. Graham, A new method for compiler code generation, in: Proc. 5th Ann. ACM Symp. on Principles of Programming Languages, 1978, pp. 231-240.
8. P. Hatcher, T. Christopher, High-quality code generation via bottom-up tree pattern matching, in: Proc. 13th ACM Symp. on Principles of Programming Languages, 1986, pp. 119-130.
9. C. Hoffmann, M.J. O'Donnell, Pattern matching in trees, J. ACM 29 (1) (1982) 68-95.
10. J. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
11. Maya Madhavan, Optimal regular tree pattern matching using pushdown automata, MSc(Engineering) Thesis, Dept. of Computer Science and Automation. Indian Institute of Science, Bangalore, 1998.
12. E. Pelegri Llopart, S. Graham, Optimal code generation for expression trees: An application of BURS theory, in: Proc. 15th Annual ACM Symp. on Principles of Programming Languages, 1988, pp. 294-308.
13. S. Ravi Kumar, Retargettable code generation using bottom up tree pattern matching, M.E Project Report, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 1992.