Re: Detecting endless recursion?

Joachim Durchholz <joachim.durchholz@web.de> writes:
|>
|> > Like many advanced optimisations,
|>
|> Tail recursion removal is as far from advanced as I can imagine.
|> Actually I have seen it taught in undergraduate courses.


I wasn't meaning advanced in that sense. I was using it in the sense
that it is an optimisation which has effects that may be visible to
the programmer. In this, it is like converting multiplication to
division, the use of associativity for the reordering of operations
and so on, and unlike register allocation, simple common expression
removal and strength reduction in for-loops.


Most commercial compilers separate the two classes of optimisation and
invoke the 'advanced' ones only at higher levels. There is usually a
third class, where it may break some of the language standard's more
subtle promises.


Regards,
Nick Maclaren.

Return to the comp.compilers page.
Search the comp.compilers archives again.