Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2005.12A.1.059

A study on the generation of JIT compiler using JBURG  

Kang Kyung-Woo (천안대학교 정보통신학부)
Publication Information
The KIPS Transactions:PartA / v.12A, no.1, 2005 , pp. 59-64 More about this Journal
Abstract
In this paper, we propose a method of generating a JIT compiler using JBURG. JBURG is a tool of generating the code generator using bottom-up tree pattern matching 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 site of the scheme. Furthermore, the relevant analyses needed for this proposal are largely achieved at non- compile time, which secures actual efficiency at compilation time.
Keywords
Compiler; Code Generator; Bottom-Up Tree Pattern Matching;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. A. Preobsting, 'Simple and efficient BURS table generation', SIGPLAN Notices, Vol.27, No.7, pp.331-340, 1992   DOI
2 T. A. Proebsting, C. Fischer, 'Code Generation Techniques', PhD Dissertation, Department of Computer Science, University of Wisconsin-Madison, 1992
3 D. Comer, R. Sethi, 'The Complexity of Trie Index Construction', ACM Journal, Vol.24, No.3, pp.428-440, 1977   DOI   ScienceOn
4 T. Harword, 'Announce: JBURG, a Java-based BURG', http://compilers.iecc.com, July, 2002
5 Soo-Mook Moon외 9인, 'LaTTe : a Java VM just-in -time compiler with fast and efficient register allocation', International Conference on Parallel Architectures and Compilation Techniques, pp.128-138, March, 2000
6 D. R. Chase, 'An improvement to bottom-up tree pattern matching', 14th Annual symposium on POPL, pp.168-177, 1987   DOI
7 C. W. Fraser, R. R. Henry, T. A. Proebsting, 'BURG-Fast Optimal Instruction Selectin and Tree Parsing', ACM SIGPLAN Nocices, Vol.27, No.4, pp.68-76, 1991   DOI
8 E. Pelegri-Liopart, 'Rewrite Systems, Parrern Matching, and Code Generation', PhD Dissertation, Report No. UCB/CSD 84/184, CSD, EECS, UCB, CA, May 1988
9 E. Pelegri-Liopart, S. L. Graham, 'Optimal Code Generation for Expression Trees : An Application of BURS Theory', 15th Annual ACM SIGACT-SIGPLAN symposium on POPL, San Diego, California, pp.294-307, January, 1988   DOI
10 F. Guillaume, L. George, 'MLBurg-Dxumentation', 1933
11 K. John Gough, 'Bottom-Up Tree Rewriting Tool MBURG', ACM SIGPLAN Notices, Vol.31, No.1, pp.28-31, 1996   DOI
12 A. V. Aho, R. Sethi, J. K. Ullman, 'Compilers -Principles, Techniques, and Tools', Addison Wesley, 1986
13 C. W. Fraser, David R. Hanson, 'A Retargetable C Compiler: Design and Implementation', The Ben-ja-min/Cummings, 1995
14 C. M. Hoffmann, M. j. O'Donnell, 'Pattern Matching in Trees', ACM Journal, Vol.29, No.1, pp.68-95, 1982   DOI   ScienceOn
15 C. W. Fraser, D. R. Hanson, T. A. Proebsting, 'Engineering a simple, Efficient Code Generator Generator', ACM LOPLAS, Vol.1, No.3, pp.331- 340, 1992   DOI
16 A. Balachandran, D. M. Dhamdhere, S. Biswas, 'Efficient retargetable code generation using bottom-up tree patterns matching', Computer Languages Vo1.15, No.3, pp.127-140, 1990   DOI   ScienceOn
17 A. V. Aho, M. Ganapathi, S. W. K. Tjiang, 'Code Generatin Using Tree Matching and Dynamic Programming', ACM TOPLAS Vol.11, No.4, pp.159-175, 1989   DOI