billwolf%hazel.cs.clemson.edu@hubcap.clemson.edu (William Thomas Wolfe, 2847 ) (02/26/90)
From kassover@jupiter.crd.ge.com (David Kassover): > Ada is functionally complete without the GOTO. There is no > program that could not be written without it. BUT in some > circumstances the cost of programming around the unconditional > transfer is high. (Retesting a condition? when that condition > is REAL-TIME and not likely to be in the same state? Reading to > the end of a 40 Gigabyte data set (don't laugh, please, such > exist) when it is already determined that such is futile?) There was a paper recently (I saw the abstract listed in CACM within the past 12 months or so) which published an effective procedure for mechanically transforming any program having GOTOs into an equivalent program using the loop...exit construct. I'd suspect that there would not be any loss of efficiency involved... Bill Wolfe, wtwolfe@hubcap.clemson.edu