Fibo at last!

On the 6th of August, 2003, Boomerang became capable of decompiling the wily "fibo-O4" test program (which prints the result of the fibonacci function). There is nothing all that special about this test program; it's only about 20 lines of C, though it has recursion. A combinbation of factors has prevented this program from being successfully decompiled, until the sixth. Who knows? Perhaps that day will go down in history...

This marks the point where the design of Boomerang will hopefully settle down. We are using standard SSA (after experimenting with a variation we called "implicit SSA"); it turns out to be very useful for almost all aspects of decompilation.

The next major problem to be tackeld is types. This will probably take until the end of the year to implement, and depends on many factors.