A Pattern Matching Compiler for Multiple Target Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

A Pattern Matching Compiler for Multiple Target Languages

Abstract

Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations: parse trees, abstract syntax trees, tree transformations, etc. 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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
A02-R-184.pdf (275.03 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00099427 , version 1

Cite

Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek. A Pattern Matching Compiler for Multiple Target Languages. [Intern report] A02-R-184 || moreau02b, 2002, 16 p. ⟨inria-00099427⟩
112 View
356 Download

Share

Gmail Facebook X LinkedIn More