From: billwolf%hazel.cs.clemson.edu@hubcap.clemson.edu (William Thomas Wolfe, 2847 )
Subject: Re: Eliminating the GOTO
Date: 25 Feb 90 21:12:44 GMT [thread overview]
Message-ID: <8148@hubcap.clemson.edu> (raw)
In-Reply-To: 5519@crdgw1.crd.ge.com
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
next prev parent reply other threads:[~1990-02-25 21:12 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
1990-02-21 23:57 Problems/Risks Mark Oestmann
1990-02-25 20:11 ` Problems/Risks David Kassover
1990-02-25 21:12 ` William Thomas Wolfe, 2847 [this message]
1990-02-26 13:20 ` Problems/Risks John F Nixon
1990-02-26 18:32 ` Problems/Risks David Kassover
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox