A Pattern-Matching Compiler - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

A Pattern-Matching Compiler

Abstract

Implementation of a rule-based transformation engine consists of several tasks with various abstraction levels. We present a new tool called MTOM for the efficient implementation of rule-based transformations. This engine should help to bridge the gap between rewriting implementations and practical applications. It aims at implementing well-identified parts of complex applications where the use of rewriting is natural or crucial. These parts are specified using rewrite rules and integrated with the rest of the application, which is kept in a classical imperative language such as C, C++ or Java. Our tool, which can be viewed as a YACC-like pre-processor, does not depend on a given term representation, rather it accepts implementation of terms (or term like data-types) of yet existing applications and it permits to define and execute rewrite rules upon those types. From our experiences, this system is well-suited for industrial use as well as for implementations of rule-based languages. The paper introduces several features supported by MTOM.
Not file

Dates and versions

inria-00100437 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100437 , version 1

Cite

Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek. A Pattern-Matching Compiler. First Workshop on Language Descriptions, Tools and Applications - LDTA'01, Apr 2001, Genova, Italy, 14 p. ⟨inria-00100437⟩
143 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More