Paper Info
Title
A pattern matching compiler for multiple target languages
Abstract
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.
Year
DOI
Venue
2003
10.1007/3-540-36579-6_5
CC
Keywords
Field
DocType
imperative language,treelike data structure,compiler construction,multiple target language,tree transformation,data structure,pattern matching,rewriting
Data structure,Functional compiler,Programming language,Computer science,Compiler correctness,Imperative programming,Theoretical computer science,Compiler,Compiler construction,Pattern matching,Eiffel
Conference
Volume
ISSN
ISBN
2622
0302-9743
3-540-00904-3
Citations 
PageRank 
References 
54
2.07
9
Authors
3
Name
Order
Citations
PageRank
Pierre-etienne Moreau159840.40
Christophe Ringeissen265149.35
Marian Vittek316513.39