This reminds me of the decompilation stuff I worked on long ago, which was essentially a large recursive pattern-matching algorithm. Flows that couldn't be matched as loop constructs just got left as gotos, and breaks would be identified as such where possible, but for the most part it worked pretty well with the (very) stupid compiler output of the time, and even with much of the handwritten Asm that was far more common than it is now.