Tom (pattern matching language)

From Wikipedia, the free encyclopedia

Stable release
2.10[1] / 2013-03-21
Typeprogram transformation language
LicenseGPL, BSD licenses

Tom is a programming language[2] particularly well-suited for programming various transformations on tree structures and XML-based documents. Tom is a language extension which adds new matching primitives to C and Java[3] as well as support for rewrite rules systems.[4] The rules can be controlled using a strategy[5] language.

Tom is good for:


  1. ^[dead link]
  2. ^ "Freecode".
  3. ^ Java Community News Tom: A Pattern-Matching Compiler for Java
  4. ^ Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau and Antoine Reilles (April 2008). "Tom Manual" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link)
  5. ^ "Data structure traversal with Tom". 4 April 2008.
  6. ^ "Pattern Matching Pointers".

External links[edit]