🚀 go-pugleaf

In article <oun34tm3c7.fsf@lynx.cs.byu.edu> hall@cs.byu.edu "Kelly Hall" writes:

>>>>>> "Lawrence" == Lawrence Kirby <fred@genesis.demon.co.uk> writes:
>    Lawrence> An O(log N) stack depth is generally not a problem. I
>    Lawrence> guess you could say that is finite because there are
>    Lawrence> typically practical upper bounds to N.
>
>Tail recursion is implemented by all non-stupid compilers the same way
>as the imperative (goto) version.  Gcc will do this, whether or not
>your favorite compiler will is a different matter.
>
>No stack problems at all.

Code that relies on compiler optimisations (which C doesn't guarantee) to
even work at all is at best highly suspect and at worst plain broken. In
some cases it is company policy to compile with optimisations turned off,
this should not cause code to blow up.

-- 
-----------------------------------------
Lawrence Kirby | fred@genesis.demon.co.uk
Wilts, England | 70734.126@compuserve.com
-----------------------------------------