On 16 Aug 2007 at 13:06, Sridhar Ayengar wrote:
Although, I might consider assembler code where every
second instruction
is a jump to be spaghetti code.
The old CDC FTN compiler had a routine to process COMMON and
EQUIVALENCE storage allocation (i.e. EQUIVALENCE-d items in COMMON).
It was done as a state machine composed of uncommented ASSIGN-ed
GOTOs (without the possible targets listed in each GOTO statement
itself--some FORTRANs let you get away with that). At least with a
computed GOTO, you had an idea of what the legitimate targets of the
GOTO were.
I'll never forget it. The universal reaction was "Don't touch it--
you might break it--and nobody knows how it works."
Cheers,
Chuck