Tom 2.0 release announcement

Antoine Reilles <reilles@loria.fr>
25 Jun 2004 01:56:14 -0400

          From comp.compilers
Related articles
Tom 2.0 release announcement reilles@loria.fr (Antoine Reilles) (2004-06-25)
| List of all articles for this month |
From: Antoine Reilles <reilles@loria.fr>
Newsgroups: comp.compilers
Date: 25 Jun 2004 01:56:14 -0400
Organization: CIRIL, Nancy, France
Keywords: tools, available
Posted-Date: 25 Jun 2004 01:56:14 EDT

Tom 2.0 release announcement
----------------------------


This release continues our work on the integration of pattern matching
and rule based programming facilities into C and Java.


Tom is a pattern matching compiler developed at INRIA. It is
particularly well-suited for programming various transformations on
trees/terms and XML based documents. Its design follows our research
on the efficient compilation of rule based languages (e.g. ELAN,
developed at INRIA-Loria).


Tom is a tool implemented in Tom itself. It can be seen as a Yacc-like
compiler translating patterns into executable pattern matching
automata. Similarly to Yacc, when a match is found, the corresponding
semantic action (a sequence of instructions written in C or Java) is
triggered and executed.
Looking from another point of view, Tom is a complex compiler which adds
powerful constructs to C and Java: non linear syntactic matching,
associative matching with neutral element (a.k.a. list-matching), XML
based pattern matching, string matching, and equational rewriting.
This offers the possibility to analyze and transform any kind of
data-structure. Tom can be used for large scale developments and
applications. It comes with documentation, programming, and debugging
support.




This new release contains many improvements and new features:


    - simple, ant based, installation procedure
    - Eclipse plug-in, with automatic compilation and error reporting
    - support for Caml
    - several predefined mappings
    - an optimizer which performs inlining and improves the efficiency
        of list-matching
    - support for builtin char and builtin string (seen as list of
        char)
    - a better XML support (backquote notation, anonymous nodes)
    - a re-designed kernel compiler (with better algorithms)
    - a constrained based compilation of non-linear patterns (in a
        more efficient way)
    - several bugs fixed


Tom is available, in open source (GPL/BSD License), from the Tom web page:


    http://tom.loria.fr




    best regards,
    Tom development team

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.