At 11:45 PM +0100 4/5/02, Piers Cawley wrote:
>So, here I am working on a Scheme interpreter in Perl 6, and I'm
>trying to write it in a (for want of a better description)
>'Scheme-like' fashion with lots of recursion.
>
>The trouble is, unless Perl6 is going to be guaranteed to do
>optimization of tail calls, this is going to lead to horribly slow
>code. So, do I bite the bullet and recast some of the functions in an
>iterative vein, or do I trust that Perl6 will do tail call optimization?
If you don't mind emitting bytecode directly, Parrot's calling
conventions are such that tail calls and tail recursion works OK.
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
