Path: utzoo!attcan!uunet!bu.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!decwrl!megatest!djones
From: djones@megatest.UUCP (Dave Jones)
Newsgroups: comp.lang.misc
Subject: Re: Answers, Chapter 2: to point or not to point
Message-ID: <14271@goofy.megatest.UUCP>
Date: 22 Oct 90 21:09:55 GMT
References: <66254@lanl.gov>
Organization: Megatest Corporation, San Jose, Ca
Lines: 17

From article <66254@lanl.gov), by jlg@lanl.gov (Jim Giles):
) Conditional GOTOs can
) simulate _all_ the "Gaggle" of control constructs that Structured
) programming fanatics demand.  However, for efficiency the compiler
) would have to be told, or have to rediscover, all the useful semantic
) properties of the missing control constructs (like proper nesting and
) so forth).  Automatic rediscovery of such properties may be completely
) intractable.

Where do you get this?

I've seen a few compilers, and more than a few compiler books, and
unless my memory fails me, every algorithm I've ever seen that takes
advantage of the "useful semantic properties" does so by first turning
all the control-statements into gotos, then analyzing that. What
"rediscovery" are you thinking of that may be "completely intractable"?
I'm baffled.