gotos

[Daniel R. Levy]

In article <748 at l.cc.purdue.edu>, cik at l.cc.purdue.edu (Herman Rubin) writes:
# 
# Here is a challenge to the denigrators of goto.  I present a short fragment of
# code; this code should be modified if right shifts are negative left shifts,
# but the problems are the same. 
# 
# Case 5:	b >>= g16;
# 	m |= b;
# 	x = *(--geom);
# 	if (TEST)
# 		{if(ODD(x)) goto Case2; else goto Case1;};
# 	else {g4 = (x+1)/2; if(ODD(x)) goto Case3; else goto Case4;};

Gak, what IS this?  Where are the Case[1-4] labels even?  This IS raunchy code.
(Are you trying to hand-code a state machine?)
-- 
|------------Dan Levy------------|  Path: ..!{akgua,homxb,ihnp4,ltuxa,mvuxa,
|         an Engihacker @        |  	<most AT&T machines>}!ttrdc!ttrda!levy
|     AT&T Data Systems Group    |  Disclaimer?  Huh?  What disclaimer???
|--------Skokie, Illinois--------|