inria-00099427, version 1
A Pattern Matching Compiler for Multiple Target Languages
N° A02-R-184 || moreau02b (2002)
Résumé : 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.
- a – INRIA
- b – INSTITUT OF INFORMATICA MLYNSKA DOLINA
- 1 :
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domaine : Informatique/Autre
- Mots-clés : compilation – pattern matching || compilation – filtrage
- Référence interne : A02-R-184 || moreau02b
- Commentaire : Rapport interne.
- inria-00099427, version 1
- http://hal.inria.fr/inria-00099427
- oai:hal.inria.fr:inria-00099427
- Contributeur :
- Soumis le : Mardi 26 Septembre 2006, 09:03:29
- Dernière modification le : Jeudi 28 Septembre 2006, 15:22:46


Exporter