Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| How to use IBURG to exchange tree nodes? whjiang_cn@hotmail.com (2003-11-21) |
| Re: How to use IBURG to exchange tree nodes? lindig+news@lindig.dyndns.org (Christian Lindig) (2003-12-03) |
| From: | Christian Lindig <lindig+news@lindig.dyndns.org> |
| Newsgroups: | comp.compilers |
| Date: | 3 Dec 2003 20:26:39 -0500 |
| Organization: | Programming Systems Lab, Universitaet des Saarlandes |
| References: | 03-11-085 |
| Keywords: | code, tools |
| Posted-Date: | 03 Dec 2003 20:26:39 EST |
Alan Jiang <whjiang_cn@hotmail.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
so).
-- Christian
Return to the
comp.compilers page.
Search the
comp.compilers archives again.