Tom (pattern matching language)
_logo.png){kind=logo} | |
| Developer(s) | INRIA |
|---|---|
| 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 a programming language[1] particularly well-suited for programming various transformations[2] 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
- ↑ "Freecode".
- ↑ "Program-Transformation.Org".
- ↑ 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).
- ↑ "Data structure traversal with Tom".
- ↑ "Pattern Matching Pointers".
External links
This article is issued from Wikipedia - version of the 12/10/2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.