Rapid and Robust Compiler Construction Using Template-Based Metacompilation

Abstract

We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data structures. With this process, Tm is able to generate program code to manipulate these data structures. Since it uses templates, the generated code is not restricted to a specific programming language: any sufficiently powerful programming language can be targeted. Tm has been used for a wide variety of tasks and languages. However, it was designed to support compiler construction, and most applications have been in that area. In this paper we outline Tm, and describe our experiences with using it to construct a static compiler for Java. As we will show, it has significantly accelerated implementation of the compiler. Almost 75% of its source code is generated by Tm, allowing us to rapidly implement a much more robust and sophisticated compiler than would have been possible otherwise.

EDUCATIONAL PEARL: A Nanopass framework for compiler education

“…Tm is a macro processor in the spirit of m4 that takes a source code template and a set of data structure definitions and generates source code (van Reeuwijk, 1992). Tree-walker and analyzer templates that resemble define-pass have been generated using Tm (van Reeuwijk, 2003). These templates are low-level relatives of define-pass, which provides convenient input pattern syntax for matching nested record structures and output template syntax constructing nested record structures.…”

Generator of efficient strongly typed abstract syntax trees in Java

“…[1,8,7,9,10] any programming language. An important aspect is that if the target language has a strong enough typing mechanism, the types of the datatype definition can be reflected somehow in the generated code.…”