Sat Feb 6 08:05:54 CET 2010

Backtracking and lazy association

The idea: when converting an expression containing an associative
operator without parenthesis to ANF/CPS, extra information is
necessary about how to combine the binary operations into a tree.

The default association could be divide and conquer, as it shortens
the critical path.  However, it might be interesting to make different
combinations based on what happens down the stream (see previous post).

The question is then: how to implement this?  Can we get something for
free due to laziness?