|Source to source translator. email@example.com (1995-08-30)|
|Re: Source to source translator. johnm@soda.CSUA.Berkeley.EDU (1995-09-04)|
|Re: Source to source translator. firstname.lastname@example.org (1995-09-05)|
|Re: Source to source translator. email@example.com (1995-09-07)|
|Re: Source to source translator. firstname.lastname@example.org (1995-09-16)|
|From:||email@example.com (Mokrane Amzal)|
|Date:||Wed, 30 Aug 1995 14:32:46 GMT|
Do anybody have ever heard about a system which allows abstract tree
rewriting based on rules given in high level language ?
I mean the user specifies the rewriting rules in a very abstract
language. As input, the system takes a tree, applies the rules
(compiled or pre-compiled), and gives another tree.
(Purpose of the system: Source to source translation, Database request
optimization, and so on...)
Both research and commercial system could interest me.
Thanks in advance.
Return to the
Search the comp.compilers archives again.