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.
Type de document :
Communication dans un congrès
Görel Hedin. 12th International Conference on Compiler Construction 2003 - CC'2003, 2003, Varsovie, Pologne, 2622, pp.61-76, 2003, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00099644
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:39:44
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00099644, version 1

Collections

Citation

Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek. A Pattern Matching Compiler for Multiple Target Languages. Görel Hedin. 12th International Conference on Compiler Construction 2003 - CC'2003, 2003, Varsovie, Pologne, 2622, pp.61-76, 2003, Lecture Notes in Computer Science. 〈inria-00099644〉

Partager

Métriques

Consultations de la notice

212