-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 11/07/11 15:36, Richard Guenther wrote:
> > Yes. tree-affine does this for a sum of expressions of the form a > + b * c. It collects such sum, optimizes it (and you can > add/subtract or scale these things) and re-emit the new simplified > form. Kai, what what were the concerns with this kind of approach? Richard's suggestion seems sound to me. From a maintenance standpoint reusing/extending the tree-affine code seems like a better route. jeff -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQEcBAEBAgAGBQJOusfNAAoJEBRtltQi2kC7qjYH/35nH85/+mgZNQiKTSfh2QMp eC9XUDScOzzIbCiN0kZZiedHarIlZL7LJ9285t5PGJP0oTzCpFuHOKrdp7+CC1e4 bNJSXlZpVKhJfvd5NCoJVts/CR/AlwA2P4hOGMHs2jn939fbIokxjknGsevG8udm W/SCS2B65IysJFNCQLjz7/CiZNq36Keuw2BC6c6dn1bXXDxAcvGuR8dgr3CEBbE1 fkR2WRzucOxnoy3/d05kJuG+GRXjQBLCVtFDl1SKK/moK3Zck2MDleI4oguCj+Gp B1zCA2BjEcdDQOoQjip8XhYqhoL1hFGJXoz7KU9nwl6utVG4SGeYw1V7Wr+i3u0= =3e/j -----END PGP SIGNATURE-----