A Study on Generating an Efficient Bottom-up Tree Rewrite Machine for JBurg
- 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
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.
Unable to display preview. Download preview PDF.