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: 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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00099427
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:03:29 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Friday, November 25, 2016 - 11:49:01 AM

Identifiers

  • HAL Id : inria-00099427, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

168

Files downloads

251