2 citations found. Retrieving documents...
P.-E. Moreau, C. Ringeissen, and M. Vittek. A pattern-matching compiler. In D. Parigot and M. van den Brand, editors, Proceedings of the 1st International Workshop on Language Descriptions, Tools and Applications, volume 44, Genova, april 2001. Electronic Notes in Theoretical Computer Science.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
SmartTools: a Development Environment Generator.. - Attali, Courbis.. (2001)   (1 citation)  (Correct)

....Its features are very similar to those of XSLT but it is much more concise, more readable and can perform transformations only on subtrees for incremental purposes. An Xpp specification is currently converted in XSLT. We plan to propose other implementations based on rewriting systems like TOM [19]. Xpp consists of a set of rule definitions which match patterns with explicit variables for subtrees. These variables are used in the code part for recursive calls. This constraint offers the capability of preserving incremental changes of the transformation. With Xpp, it is possible to define ....

P.-E. Moreau, C. Ringeissen, and M. Vittek. A PatternMatching Compiler. In Workshop on Language Descriptions, Tools and Applications (LDTA), volume 422. Electronic Notes in Theoretical Computer Science, April 2001.


Improving Symbolic Model Checking by Rewriting.. - Déharbe, Moreira..   Self-citation (Ringeissen)   (Correct)

....The communication between this executable and the symbolic model checker is possible via Unix pipes. Another more elegant solution would be to link the generated C code of the rewrite program with the C code implementing symbolic model checking. In this direction, we envision to use the TOM [14] pattern matching compiler, which is a part of the ongoing e ort to develop an ELAN toolkit. TOM can be viewed as a pre processor for classical imperative languages such as C or Java. It allows us to combine rule based declarations and C code, and to declare functions by pattern matching like in ....

P.-E. Moreau, C. Ringeissen, and M. Vittek. A pattern-matching compiler. In D. Parigot and M. van den Brand, editors, Proceedings of the 1st International Workshop on Language Descriptions, Tools and Applications, volume 44, Genova, april 2001. Electronic Notes in Theoretical Computer Science.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC