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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Moreau, P. E., Ringeissen, C., & Vittek, M. (2003). A pattern matching compiler for multiple target languages. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2622, 61–76. https://doi.org/10.1007/3-540-36579-6_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
