- Free and open-source software portal
Tom is a programming language 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 as well as support for rewrite rules systems. The rules can be controlled using a strategy language.
Tom is good for:
- programming by pattern matching
- developing compilers and domain-specific languages (DSL)
- transforming XML documents
- implementing rule-based systems
- describing algebraic transformations
External links
References
"Freecode". http://freecode.com/projects/jtom ↩
Java Community News Tom: A Pattern-Matching Compiler for Java http://www.artima.com/forums/flat.jsp?forum=276&thread=217701&start=0&msRange=15 ↩
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) http://www.loria.fr/~moreau/Papers/tom-manual-2.6.pdf ↩
"Data structure traversal with Tom". 4 April 2008. http://langexplr.blogspot.ch/2008/03/data-structure-traversal-with-tom.html ↩
"Pattern Matching Pointers". http://www.cs.ucr.edu/~stelo/pattern.html ↩