A Study on Generating an Efficient Bottom-up Tree Rewrite Machine for JBurg

  • KyungWoo Kang
Conference paper

DOI: 10.1007/978-3-540-24707-4_9

Volume 3043 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kang K. (2004) A Study on Generating an Efficient Bottom-up Tree Rewrite Machine for JBurg. In: Laganá A., Gavrilova M.L., Kumar V., Mun Y., Tan C.J.K., Gervasi O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg

Abstract

In this paper, we propose a method of generating an efficient bottom-up tree rewrite machine for JBurg. JBurg is a Bottom-Up Rewrite Machine Generator for Java. Our method can be derived from some relations over tree patterns. The proposed scheme is more efficient than JBurg because we can avoid unfruitful tests with the smaller size of the scheme. Furthermore, the relevant analyses needed for this proposal are largely achieved at compile-compile time, which secures actual efficiency at compilation time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • KyungWoo Kang
    • 1
  1. 1.Department of Computer and Communication EngineeringCheonan UniversityCheonanRepublic of Korea