Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3043))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harword, T.: Announce: Jburg, a java-based burg. (July 2002), http://compilers.iecc.com

  2. Hoffmann, C.M., O’Donnell, M.J.: Pattern matching in trees. ACM Journal 1 (1982)

    Google Scholar 

  3. Fraser, D.R.H.C.W., Proebsting, T.A.: Engineering a simple, efficient code generator generator. ACM TOPLAS 6 (1993)

    Google Scholar 

  4. Gough, K.J.: Bottom-up tree rewriting tool mburg. ACM SIGPLAN Notices 1 (1996)

    Google Scholar 

  5. Fraser, C.W., Hanson, D.R., Retargetable, A.: C Compiler: Design and Implementation. The Benjamin/Cummings (1995)

    Google Scholar 

  6. Comer, D., Sethi, R.: The complexity of trie index construction. ACM Journal 24 (July 1977)

    Google Scholar 

  7. Kang, K.-W., Choe, K.-M.: On the automatic generation of instruction selector using bottom-up tree pattern matching. Technical Report, no. CS-TR-95-93 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Communication Engineering, Cheonan University, 115, Anseo-dong, 330-704, Cheonan, Choongnam, Republic of Korea

    KyungWoo Kang

Authors
  1. KyungWoo Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-540-24707-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24707-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22054-1

  • Online ISBN: 978-3-540-24707-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation