A pattern matching compiler for multiple target languages

  • Authors:
  • Pierre-Etienne Moreau;Christophe Ringeissen;Marian Vittek

  • Affiliations:
  • LORIA-INRIA, Villers-lès-Nancy Cedex, France;LORIA-INRIA, Villers-lès-Nancy Cedex, France;Institut of Informatica Mlynska dolina, Bratislava, Slovakia

  • Venue:
  • CC'03 Proceedings of the 12th international conference on Compiler construction
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many processes can be seen as transformations of treelike data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations. This paper introduces a pattern matching compiler (TOM): a set of primitives which add pattern matching facilities to imperative languages such as C, Java, or Eiffel. We show that this tool is extremely non-intrusive, lightweight and useful to implement tree transformations. It is also flexible enough to allow the reuse of existing data structures.