structured programming - Are there any good published algorithms for restructuring procedural code? -


i've got ugly old program try organize/prettify. few thousand lines, few dozen labels , 100 goto's. goto's half forward , half backward. overlap every way, , there computed goto's , case statements spray goto's willy-nilly out of several of cases. bad things can program not branch thens, elses or cases. uses conditional branches backwards instead of loops, many of these within cases statements.

i recall proved maybe 40 or 50 years ago goto's not needed if 1 has loops , if-then-else (not mention cases). question is: there manageable algorithms or sets of rules follow, hand or computer, proof proved possible, i.e. translate spaghetti reasonably readable code of goto's gone?


Comments

Popular posts from this blog

Delphi XE2 Indy10 udp client-server interchange using SendBuffer-ReceiveBuffer -

Qt ActiveX WMI QAxBase::dynamicCallHelper: ItemIndex(int): No such property in -

Enable autocomplete or intellisense in Atom editor for PHP -