Tom (pattern matching language)
From Infogalactic: the planetary knowledge core
| 64px | |
| 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/ |
.svg){kind=logo}
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
<templatestyles src="Reflist/styles.css" />
Cite error: Invalid <references> tag; parameter "group" is allowed only.
<references />, or <references group="..." />External links
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Java Community News Tom: A Pattern-Matching Compiler for Java
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
_logo.png){kind=link}