|How to use IBURG to exchange tree nodes? firstname.lastname@example.org (2003-11-21)|
|Re: How to use IBURG to exchange tree nodes? email@example.com (Christian Lindig) (2003-12-03)|
|From:||Christian Lindig <firstname.lastname@example.org>|
|Date:||3 Dec 2003 20:26:39 -0500|
|Organization:||Programming Systems Lab, Universitaet des Saarlandes|
|Posted-Date:||03 Dec 2003 20:26:39 EST|
Alan Jiang <email@example.com> wrote:
> For example: (all variables are int type)
> a-c+d is expressed as tree (a-c)+d, but I hope IBURG can transform it
> Does it possible for IBURG rules to do the above job? Or it is just
> above the ability of IBURG?
IBurg can do it, but it is an unusual application of IBurg.
Typically, IBurg matches part of a tree and generates code for it in a
different representation. You could generate a new tree but you can't
re-write the tree that you are matching in place (at least I believe
Return to the
Search the comp.compilers archives again.