Tom_(pattern_matching_language)

Tom (pattern matching language)

Tom (pattern matching language)

Add article description

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.

Quick Facts Developer(s), Stable release ...

Tom is good for:

References

  1. [1]
    https://gforge.inria.fr/frs/?group_id=78&release_id=7940 [dead link]
  2. [2]
    "Freecode".
  3. [3]
    Java Community News Tom: A Pattern-Matching Compiler for Java
  4. [4]
    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)
  5. [5]
    "Data structure traversal with Tom". 4 April 2008.
  6. [6]
    "Pattern Matching Pointers".
Share this article:

This article uses material from the Wikipedia article Tom_(pattern_matching_language), and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.