The topic of this article may not meet Wikipedia's notability guidelines for products and services. (February 2012) |
Tom is a programming language particularly well-suited for programming various transformations[1] on tree structures and XML based documents. Tom is a language extension which adds new matching primitives to C and Java[2] as well as support for rewrite rules systems.[3] The rules can be controlled using a strategy language.
| Tom | |
|---|---|
| Stable release | 2.10
/ 2013-03-21 |
| Operating system | Cross-platform |
| Type | program transformation language |
| License | GPL, BSD licenses |
| Website | http://tom.loria.fr/ |
Tom is good for:
- programming by pattern matching[4]
- developing compilers and DSL
- transforming XML documents
- implementing rule based systems
- describing algebraic transformations
Notes
- ^ "Program-Transformation.Org".
- ^ "Tom: A Pattern-Matching Compiler for Java".
- ^ 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) - ^ "Pattern Matching Pointers".