Skip to Main content Skip to Navigation
Conference papers

A Pattern Matching Compiler for Multiple Target Languages

Pierre-Etienne Moreau 1 Christophe Ringeissen 1 Marian Vittek
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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. 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:39:44 AM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00099644, version 1



Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek. A Pattern Matching Compiler for Multiple Target Languages. 12th International Conference on Compiler Construction 2003 - CC'2003, 2003, Varsovie, Pologne, pp.61-76. ⟨inria-00099644⟩



Record views