 | The topic of this article may not meet Misplaced Pages's notability guidelines for products and services. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: "Tom" programming language – news · newspapers · books · scholar · JSTOR (August 2021) (Learn how and when to remove this message) |
_logo.png){kind=logo} | |
| Developer(s) | INRIA |
|---|---|
| Stable release | 2.10 / 2013-03-21 |
| Type | program transformation language |
| License | GPL, BSD licenses |
| Website | tom |
Tom is a programming language 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 as well as support for rewrite rules systems. The rules can be controlled using a strategy language.
Tom is good for:
- programming by pattern matching
- developing compilers and domain-specific languages (DSL)
- transforming XML documents
- implementing rule-based systems
- describing algebraic transformations
References
- 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).
{{cite web}}: CS1 maint: multiple names: authors list (link) - "Data structure traversal with Tom". 4 April 2008.
- "Pattern Matching Pointers".