Advertisement

Optimal Regular Tree Pattern Matching Using Pushdown Automata

  • Maya Madhavan
  • Priti Shankar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1530)

Abstract

We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionally generated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed by conventional methods, and has been tested on some input problem instances representing instruction sets for processors.

Keywords

Normal Form Tree Pattern Subject Tree Regular Tree Context Free Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Ganapathi, M.: Efficient tree pattern matching: an aid to code generation. In: Proc. 12th ACM Symp. on Priciples of Programming Languages, pp. 334–340 (1985)Google Scholar
  2. 2.
    Balachandran, A., Dhamdhere, D.M., Biswas, S.: Efficient retargetable code generation using bottom up tree pattern matching. Comput. Lang. 3(15), 127–140 (1990)CrossRefGoogle Scholar
  3. 3.
    Chase, D.: An improvement to bottom up tree pattern matching. In: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, pp. 168–177 (1987)Google Scholar
  4. 4.
    Ferdinand, C., Seidl, H., Wilhelm, R.: Tree Automata for Code Selection. Acta Informatica 31, 741–760 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gantait, A.: Design of a bottom up tree pattern matching algorithm and its application to code generation, ME Project Report, Department Of Computer Science and Automation, Indian Institute of Science, Bangalore (1996) Google Scholar
  6. 6.
    Glanville, R.S., Graham, S.L.: A new approach to compiler code generation. In: Proc. 5th ACM Symposium on Principles of Programming Languages, pp. 231–240 (1978)Google Scholar
  7. 7.
    Hatcher, P., Christopher, T.: High-qualityc ode generation via bottom-up tree pattern matching. In: Proc. 13th ACM Symp. on Principles of Programming Languages, pp. 119–130 (1986)Google Scholar
  8. 8.
    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) Google Scholar
  9. 9.
    Hoffmann, C., O’Donnell, M.J.: Pattern matching in trees. J. ACM 29(1), 68–95 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Hopcroft, J.E., Ullman, J.D.: An Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)Google Scholar
  11. 11.
    Madhavan, M.: Optimal linear regular tree pattern matching using pushdown automata, MSc (Engineering) Thesis(submitted), Department of Computer Science and Automation, Indian Institute of Science, Bangalore (1998) Google Scholar
  12. 12.
    Madhavan, M., Shankar, P.: Finding minimal cost derivation trees for regular tree grammars, Technical report IISC-CSA-98-07, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India (August 1998) Google Scholar
  13. 13.
    Nymeyer, A., Katoen, J.P.: Code generation based on formal BURS theory and heuristic search. Acta Informatica 34(8), 597–636 (1997)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Pelegri-Llopart, E., Graham, S.L.: Optimal code generation for expression trees: An application of BURS theory. In: Proc. 15th ACM Symposium on Principles of Programming Languages, pp. 119–129 (1988)Google Scholar
  15. 15.
    Proebsting, T.A.: BURS automata generation. ACM Trans. on Prog. Lang. and Sys. 3(17), 461–486 (1995)CrossRefGoogle Scholar
  16. 16.
    Ravi Kumar, S.: 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) Google Scholar
  17. 17.
    Shankar, P., Gantait, A., Yuvaraj, A.R., Madhavan, M.: A New algorithm for linear regular tree pattern matching. To appear in Theoretical Computer ScienceGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Maya Madhavan
    • 1
  • Priti Shankar
    • 1
  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations