Tom (pattern matching language)

Tom
Developer(s)	INRIA
Stable release	2.10 / 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 DSL
transforming XML documents
implementing rule based systems
describing algebraic transformations

Notes

^ https://gforge.inria.fr/frs/?group_id=78&release_id=7940
^ "Freecode".
^ Java Community News Tom: A Pattern-Matching Compiler for Java
^ Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau and Antoine Reilles (April 2008). "Tom Manual" (PDF).CS1 maint: multiple names: authors list (link)
^ "Data structure traversal with Tom".
^ "Pattern Matching Pointers".

External links

[1] ttps://gforge.inria.fr/frs/?group_id=78&release_id=7940

[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).CS1 maint: multiple names: authors list (link)

[5] "Data structure traversal with Tom".

[6] "Pattern Matching Pointers".

[1]

[2]

[3]

[4]

[5]

[6]