[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Bottom-up tree rewriting tool MBURG

Published: 01 January 1996 Publication History

Abstract

mburg is a tool for producing bottom up tree rewriters. It has been used for code selection in compilers. It produces hard coded tree pattern matchers from tree grammars, with dynamic programming at runtime. It is comparable in its capabilities with iburg[1], but has a rather different implementation, and produces its output in ISO Modula-2. The source code for the tool is available by ftp.

References

[1]
{1} C. W. Fraser and D. R. Hanson, and T. A. Proebsting. Engineering a simple efficient code-generator generator, Letter's on Programming Languages and Systems, Vol. 1(3), 213-226, 1992.
[2]
{2} C. W. Fraser attd D. R. Hanson. A code-generation interface for ANSI-C, Software Practice and Experience, Vol. 21, Sep. 1991. (Also fully described in the same author's A Retargetable Compiler for ANSI C, Benjamin Cummings, 1995).
[3]
{3} K. J. Gough. The DCode Intermediate Program Representation, Reference Manual and Report, QUT 1992-1994. This report is maintained in electronic form on the ftp server ftp.fit.qut.edu.au (Internet 131.181.2.16). The current (January 1995) version is 2.2.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 31, Issue 1
Jan. 1996
47 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/249094
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1996
Published in SIGPLAN Volume 31, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)10
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)A study of compiler techniques for multiple targets in compiler infrastructuresACM SIGPLAN Notices10.1145/571727.57173537:6(45-51)Online publication date: 27-Feb-2019
  • (2019)Pattern-matching algorithms based on term rewrite systemsTheoretical Computer Science10.1016/S0304-3975(00)00041-4238:1-2(439-464)Online publication date: 5-Jan-2019
  • (2012)Reconceptualizing Bottom-Up Tree RewritingPatterns, Programming and Everything10.1007/978-1-4471-2350-7_4(31-44)Online publication date: 2012
  • (2005)A study on the generation of JIT compiler using JBURGThe KIPS Transactions:PartA10.3745/KIPSTA.2005.12A.1.05912A:1(59-64)Online publication date: 1-Feb-2005
  • (2005)Multi-language, multi-target compiler development: Evolution of the Gardens Point compiler projectModular Programming Languages10.1007/3-540-62599-2_28(17-40)Online publication date: 2-Jun-2005
  • (2004)A Study on Generating an Efficient Bottom-up Tree Rewrite Machine for JBurgComputational Science and Its Applications – ICCSA 200410.1007/978-3-540-24707-4_9(65-72)Online publication date: 2004
  • (2000)Design of Multilingual Retargetable Compilers: Experience of the XDS Framework EvolutionModular Programming Languages10.1007/10722581_19(238-249)Online publication date: 2000

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media