Content deleted Content added
mNo edit summary |
Citation bot (talk | contribs) Add: date. | Use this bot. Report bugs. | Suggested by EthanGaming7640 | Category:Pattern matching | #UCB_Category 1/33 |
||
Line 16:
}}
{{Portal|Free and open-source software}}
'''Tom''' is a [[programming language]]<ref>{{cite web|url=http://freecode.com/projects/jtom|title=Freecode}}</ref> 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]]<ref>Java Community News [http://www.artima.com/forums/flat.jsp?forum=276&thread=217701&start=0&msRange=15 Tom: A Pattern-Matching Compiler for Java]</ref> 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<ref>{{cite web|url=http://langexplr.blogspot.ch/2008/03/data-structure-traversal-with-tom.html|title=Data structure traversal with Tom|date=4 April 2008}}</ref> language.
Tom is good for:
| |||