Jump to content

Tom (programming language)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Newslinger (talk | contribs) at 01:16, 24 December 2018 (Use Free and open-source software portal name (via WP:JWB)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Tom
Developer(s)INRIA
Stable release
2.10[1] / 2013-03-21
Typeprogram transformation language
LicenseGPL, BSD licenses
Websitetom.loria.fr

Tom is a programming language[2] particularly well-suited for programming various transformations[3] on tree structures and XML based documents. Tom is a language extension which adds new matching primitives to C and Java[4] as well as support for rewrite rules systems.[5] The rules can be controlled using a strategy[6] language.

Tom is good for:

  • programming by pattern matching[7]
  • developing compilers and DSL
  • transforming XML documents
  • implementing rule based systems
  • describing algebraic transformations

Notes

  1. ^ https://gforge.inria.fr/frs/?group_id=78&release_id=7940
  2. ^ "Freecode".
  3. ^ "Program-Transformation.Org".
  4. ^ Java Community News Tom: A Pattern-Matching Compiler for Java
  5. ^ 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)
  6. ^ "Data structure traversal with Tom".
  7. ^ "Pattern Matching Pointers".
Retrieved from "https://en.wikipedia.org/w/index.php?title=Tom_(programming_language)&oldid=875131195"