|Java Compilers and Tail Recursion email@example.com (Jason Karney) (1997-12-23)|
|Re: Java Compilers and Tail Recursion firstname.lastname@example.org (Mark Tillotson) (1997-12-29)|
|Re: Java Compilers and Tail Recursion email@example.com (Shri Borde) (1998-01-03)|
|Re: Java Compilers and Tail Recursion firstname.lastname@example.org (David Chase) (1998-01-03)|
|From:||"Shri Borde" <email@example.com>|
|Date:||3 Jan 1998 16:30:36 -0500|
If a tail-recursive method does not violate the security policy, there
is no reason why the optimized version will. So the compiler can
surely optimize it.
As to whether compilers actually do, I dont know. But I do know that
the Microsoft JIT compiler optimizes tail recursion.
Many of the Java compilers do not perform good optimizations. Its
mostly lazy programming. But also note that many optimizations are
best not done as it impedes the JIT compiler in generation of good
native code. But tail- recursion is not such a case, and should surely
Jason Karney <firstname.lastname@example.org> asked:
>| Is the current crop of Java compilers smart enough to optimize tail
>| recursion? I am specifically wondering about Symantec and Sun's JDK
Return to the
Search the comp.compilers archives again.