Open AccessA Pattern Matching Compiler for Multiple Target Languages
Author(s) -
Moreau Pierre-Etienne,
Christophe Ringeissen,
Marian Vittek
Publication year - 2003
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-00904-3
DOI - 10.1007/3-540-36579-6_5
Subject(s) - computer science , compiler , programming language , pattern matching , tree (set theory) , java , set (abstract data type) , reuse , matching (statistics) , theoretical computer science , statistics , ecology , mathematics , biology , mathematical analysis
Many processes can be seen as transformations of treelike 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom