25
3
Your task is to build the largest program you can that uses exactly one GOTO, without which the entire program (or at least a huge chunk of it) must be completely restructured. The score is counted as the number of statements in your code that change places or are newly introduced (removing statements doesn't add to your score) when the code is restructured without the GOTO (others are allowed to challenge your restructuring by presenting a more elegant one). As this is code bowling, highest score wins.
Note: I do not claim any liability for velociraptor attacks by attempting this challenge.
2The one single goto seems problematic. Every C code I can think of that uses a single goto can be trivially changed to use structured constructs. Multiple gotos however... – Pubby – 2013-02-26T01:42:28.637
@Pubby's claim seems to hold against the current two solutions. Replacing
goto
withswitch
seems possible for both. – ugoren – 2013-02-26T07:44:04.827@Pubby How many goto's would you need to create a workable solution? If the problem as currently stated is impossible, I can create an alternative problem. – Joe Z. – 2013-02-26T14:30:23.977
I think you're allowed to embed the cartoon, as long as there's a link too. – luser droog – 2013-02-28T04:07:43.867
1
It doesn't qualify, but I really did this.
– luser droog – 2013-02-28T04:10:26.797Use ASM where you can't even remove the GOTO – l4m2 – 2018-04-05T07:26:15.163