Re: Call stack manipulation?

2002-04-20 Thread Andrew J Bromage
G'day all. On Fri, Apr 19, 2002 at 09:55:46AM +0100, Piers Cawley wrote: > It's fine for partial continuations certainly, but less fine if you > want to implement full continations which require you to save the > state of the entire stack. I was hoping I'd find a way to do this > without having

Re: Call stack manipulation?

2002-04-19 Thread Piers Cawley
Andrew J Bromage <[EMAIL PROTECTED]> writes: > G'day all. > > On Fri, Apr 19, 2002 at 07:06:04AM +0100, Piers Cawley wrote: > >> If I'm going to be doing tail call optimization >> (and I can't call it scheme if I don't) then my first thought was as >> follows. >> >> # This is a tail call >> >

Re: Call stack manipulation?

2002-04-18 Thread Andrew J Bromage
G'day all. On Fri, Apr 19, 2002 at 07:06:04AM +0100, Piers Cawley wrote: > If I'm going to be doing tail call optimization > (and I can't call it scheme if I don't) then my first thought was as > follows. > > # This is a tail call > > branch FOO_tail > ... > > #

Call stack manipulation?

2002-04-18 Thread Piers Cawley
So, here I am, roughing out some ideas for how I'm going to implement a very lovely and worthwhile scheme interpreter (or a compiler, I'm not proud) for parrot. If I'm going to be doing tail call optimization (and I can't call it scheme if I don't) then my first thought was as follows. # This i