Algorithm

Hi


I am looking for an algorithm that enumerates all possible expression
trees obtained by applying the commutative law to an expresssion tree.


e.g.: a = b * c + d; ( expression is in the form of a tree )
            a = d + b * c;
            a = c * b + d;
            a = d + c * b;


Thanks.


--Amit
Compiler Research lab.
Univ. of Cincinnati.
arao@ececs.uc.edu
[My first cut at it would be to walk the tree recursively, flipping
at each node that is a commutative operator. -John]




--

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