Tom (pattern matching language)

Short description: None

Tom

Developer(s)| INRIA
Stable release|

2.10[1] / 2013-03-21

Type| program transformation language
License| GPL, BSD licenses
Website| tom.loria.fr

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:

* programming by pattern matching[6]
* developing compilers and domain-specific languages (DSL)
* transforming XML documents
* implementing rule-based systems
* describing algebraic transformations

## References

1. ↑ https://gforge.inria.fr/frs/?group_id=78&release_id=7940 [|permanent dead link|dead link}}]
2. ↑ "Freecode". http://freecode.com/projects/jtom.
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". http://www.loria.fr/~moreau/Papers/tom-manual-2.6.pdf.
5. ↑ "Data structure traversal with Tom". 4 April 2008. http://langexplr.blogspot.ch/2008/03/data-structure-traversal-with-tom.html.
6. ↑ "Pattern Matching Pointers". http://www.cs.ucr.edu/~stelo/pattern.html.

## External links

* Tom language website
* Tom gforge website
* Tutorial and Reference Manual

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Software:Tom_(pattern_matching_language)&oldid=735333"