> We would be thrilled for you to add some optimizations to our C--
> compiler.
Indeed, I'm kind of in a scramble to finish my current project (which
is due at the end of February for my HS credit).
After I finish, I'd be glad to read up on C-- and start making some
contributions over the summer and such. I'm interested
in verified optimization (certified compilation?), so I might play
around with that. I know that C-- uses noweb, and found that
to be an interesting concept about which I'd like to learn more.
> At present, Quick C-- makes very few optimizations. The critical ones
> are coalescing of register-register moves (done in the register
> allocator), peephole optimization, and dead-code elimination.
> We would dearly love to have some forms of redundancy elimination, but
> at present we don't.
Sure, I think I can look into some of that. I'll have to become
reacquainted with x86 again though.
> We have a nice, functional control-flow graph with expression trees.
> There was a paper in the 2005 ML Workshop. I think you will like the
> data structure. I have made a few refinements in Haskell for the
> Glasgow Haskell compiler and I hope eventually there will be a journal
> submission.
I'll try to locate everything need as need arises.
Thanks,
--Kristopher Micinski
_______________________________________________
Cminusminus mailing list
[email protected]
https://cminusminus.org/mailman/listinfo/cminusminus
