K. John Gough
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.
- {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. Google Scholar
Digital Library
- {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). Google ScholarDigital Library
- {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.Google Scholar
Index Terms
- Bottom-up tree rewriting tool MBURG
Recommendations
Bottom-up and top-down tree series transformations
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up tree series transducer and top-down tree series transducer, respectively, by allowing formal tree series as output rather than trees, where a formal tree ...
Bottom-Up tree evaluation in tree-based genetic programming
ICSI'10: Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part IIn tree-based genetic programming (GP) performance optimization, the primary optimization target is the process of fitness evaluation This is because fitness evaluation takes most of execution time in GP Standard fitness evaluation uses the top-down ...
Constrained tree inclusion
CPM'03: Proceedings of the 14th annual conference on Combinatorial pattern matchingThe tree matching problem is considered of given labeled trees P and T, determining if the pattern tree P can be obtained from the text tree T by deleting degree-one and degree-two nodes and, in the case of unordered trees, by also permuting siblings. ...
Comments