🚀 go-pugleaf

MBURG is a tool which produces hardwired bottom up tree rewriters from 
a set of tree productions.  It is similar in its scope to Fraser, Hanson
and Proebsting's "iburg", but has a somewhat different implementation, and
generates ISO Modula-2 as output.  

Bottom-up tree rewriters are able to perform optimal code selection, based
on a the declared cost of the tree reductions.  In MBURG these costs must
be constants, but productions may be guarded by predicates. The rewriter
performs dynamic programming at compile time.

We have experimented with code selectors created by MBURG as plug compatible
replacements for our current code selectors which use shadow stack automata.
So far the experience is good, so we may switch in the interests of easy
adaptability (at the cost of slightly larger compiler code, and very slightly 
slower compilation on some platforms.) 

The sources of the tool are available by ftp, as follows
        mburg06.tar.Z              -- the sources
        mburg06.ps.Z               -- the reference manual
        sigplan.ps.Z               -- a more full announcement
site: ftp.fit.qut.edu.au (131.181.2.16)
dir:  /pub/coco

Enjoy.

-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
K John Gough                      Internet:     j.gough@qut.edu.au
Professor of Computer Science     VOX:          +61 7 3864-2781
Queensland University of Tech.    Fax:          +61 7 3864-1507
                                  http://www.dstc.qut.edu.au/~gough/

Automata      _--_|\              Faculty of Information Technology
rules OK     /      QUT           Queensland University of Technology
             \_.--._/             Box 2434  Brisbane 4001  AUSTRALIA
                   v              Phone: +61 7 864-2111

-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-