Tom (pattern matching language)
- Tom (pattern matching language)
Infobox Software
name = Tom
paradigm = Pattern-matching
caption =
developer =
latest release version = 2.5
latest release date = 2007-07-09
latest preview version =
latest preview date =
operating system = Cross-platform
platform =
genre = program transformation language
license = GPL/BSD
website = http://tom.loria.fr/
Tom is a programming language particularly well-suited for programming various transformations on trees/terms 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 DSL
* transforming XML documents
* implementing rule based systems
* describing algebraic transformations
External links
* [http://tom.loria.fr/ Tom language website]
* [http://gforge.inria.fr/projects/tom Tom gforge website]
* [http://tom.loria.fr/soft/release-2.5/manual-2.5/index.html Tutorial and Reference Manual]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Pattern matching — In computer science, pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact. The patterns generally have the form … Wikipedia
TOM (programming language) — TOM or Tom may be the computer programming language: * TOM (object oriented programming language), a defunct language based on Objective C * Tom (pattern matching language), a pattern matching and transform language … Wikipedia
Proto-Germanic language — Proto Germanic Spoken in Northern Europe Extinct evolved into Proto Norse, Gothic, Frankish and Ingvaeonic by the 4th century Language family Indo European … Wikipedia
Web Ontology Language — OWL Web Ontology Language Current Status Published Year Started 2002 Editors Mike Dean, Guus Schreiber Base Standards Resource Description Framework, RDFS Domain Semantic Web A … Wikipedia
Rewriting — In mathematics, computer science and logic, rewriting covers a wide range of potentially non deterministic methods of replacing subterms of a formula with other terms. What is considered are rewrite systems (also rewriting systems, or term… … Wikipedia
National Institute for Research in Computer Science and Control — The National Institute for Research in Computer Science and Control (French: Institut national de recherche en informatique et en automatique, INRIA) is a French national research institution focusing on computer science, control theory and… … Wikipedia
Michigan Terminal System — (MTS) The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the US, Canada, and the UK … Wikipedia
Delimiter — This article is about delimiters in computing. For delimiters in written human languages, see interword separation. A stylistic depiction of a fragment from a CSV formatted text file. The commas (shown in red) are used as field delimiters. A… … Wikipedia
Comparison of parser generators — This is a list of notable lexer generators and parser generators for various language classes. Contents 1 Regular languages 2 Deterministic context free languages 3 Parsing expression grammars, deterministic boolean grammars … Wikipedia
United States — a republic in the N Western Hemisphere comprising 48 conterminous states, the District of Columbia, and Alaska in North America, and Hawaii in the N Pacific. 267,954,767; conterminous United States, 3,022,387 sq. mi. (7,827,982 sq. km); with… … Universalium
