Our flowgraphs can be rendered easely in languages that support gotos. For some potential targets in would be nice* to be able to reconstruct structured graphs that can be rendered in terms of ifs/whiles etc. For (future) reference these are pointers to literature touching the subject and containing also further pointers to more literature: Assembly to High-Level Language Translation http://citeseer.ist.psu.edu/cifuentes98assembly.html Structuring Assembly Programs http://www.cs.uq.edu.au/~cristina/students/doug/doug.html the algorithms described use concepts and data structures common in the context of data-flow analysis. * targeting an underlying bytecode is also a possibility, or using some while/switch idiom possibly postprocessing the compilation result or adding a tagbody-like construct support to a compiler for the target.