Tom (programming language): Difference between revisions

Revision as of 07:07, 16 October 2013

Revision as of 07:26, 1 May 2014

Line 19:

}}

{{Portal|Free software}}

'''Tom''' is a [[programming language]] particularly well-suited for programming various transformations on [[tree structure]]s and [[XML]] based documents. Tom is a language extension which adds new matching primitives to [[C (programming language)|C]] and [[Java (programming language)|Java]] as well as support for rewrite rules systems.<ref>{{cite web|url=http://www.loria.fr/~moreau/Papers/tom-manual-2.6.pdf|title=Tom Manual|date=April 2008|author=Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, and Antoine Reilles}}</ref> The rules can be controlled using a strategy language.

Tom is good for:

Line 27:

* implementing rule based systems

* describing algebraic transformations

==Notes==

{{reflist}}

==External links==