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.
Type de document :
Rapport
[Intern report] A02-R-184 || moreau02b, 2002, 16 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00099427
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:03:29
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 11:49:01

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

149

Téléchargements de fichiers

188