Tom (pattern matching language)
Tom is a programming language[2] 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[3] as well as support for rewrite rules systems.[4] The rules can be controlled using a strategy[5] language.
_logo.png.webp){kind=logo} | |
| Developer(s) | INRIA |
|---|---|
| Stable release | 2.10[1]
/ 2013-03-21 |
| Type | program transformation language |
| License | GPL, BSD licenses |
| Website | tom |
Tom is good for:
- programming by pattern matching[6]
- 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".
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.