Sorry! I replied without reading your message properly.
I could then work directly with parsing trees, and generate all binary trees of fixed lengths. But most of them would be unnecessary, so it seems like I'm attacking it from the wrong angle.
They won’t be unnecessary if you generate them in a right way. I will think about it and reply with a detailed answer as soon as possible.
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
