Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

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 all is quiet...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2017-07-27 04:07 GMT
Find Nodes?
    Voting Booth?
    I came, I saw, I ...

    Results (402 votes). Check out past polls.