Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Re: Pure Perl tail call optimization

by Elian (Parson)
on Apr 26, 2002 at 15:12 UTC ( #162298=note: print w/ replies, xml ) Need Help??

in reply to Re: Pure Perl tail call optimization
in thread Pure Perl tail call optimization

Last time I checked with the Parrot docs (the tutorial mainly), there was no mention of jumps to computed values (which is what you said you need for implementing call/cc). So the question is: how can one do proper tail recursion without jumps? (Parrot does have jump LABEL though)
Parrot supports jumping (and branching) to locations (and offsets, though they're less useful) stored in registers. Only works with the jump, jsr, branch, and bsr ops though. (Used to work with the conditionals, but that was silly so we yanked that support)

Comment on Re: Re: Pure Perl tail call optimization

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://162298]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (8)
As of 2015-03-28 13:08 GMT
Find Nodes?
    Voting Booth?

    When putting a smiley right before a closing parenthesis, do you:

    Results (625 votes), past polls