Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Activation Records on Stack Based Machines io@spunge.org (2004-01-22) |
| Re: Activation Records on Stack Based Machines torbenm@diku.dk (2004-01-31) |
| Re: Activation Records on Stack Based Machines anton@mips.complang.tuwien.ac.at (2004-01-31) |
| Re: Activation Records on Stack Based Machines basile-news@starynkevitch.net (Basile Starynkevitch \[news\]) (2004-01-31) |
| Re: Activation Records on Stack Based Machines joachim.durchholz@web.de (Joachim Durchholz) (2004-02-01) |
| Re: Activation Records on Stack Based Machines ftu@fi.uu.nl (2004-02-01) |
| Re: Activation Records on Stack Based Machines rbates@southwind.net (Rodney M. Bates) (2004-02-04) |
| From: | "Basile Starynkevitch \[news\]" <basile-news@starynkevitch.net> |
| Newsgroups: | comp.compilers |
| Date: | 31 Jan 2004 00:53:50 -0500 |
| Organization: | http://starynkevitch.net - Ours |
| References: | 04-01-129 |
| Keywords: | architecture |
| Posted-Date: | 31 Jan 2004 00:53:50 EST |
On 2004-01-23, leibniz <io@spunge.org> wrote:
> I'm actually new to code generation techniques dealing with
> function invocation/declaration. I am working on a small imperative
> language that uses a stack based virtual machine. I've searched/read
> about activation records, but all I found was register-based machines
> way of pushing activation records on the stack. [...]
I think that some chapters of C.Queinnec's book "Lisp in Small Pieces"
(I actually have the original french version) would help you.
On a more theoritical point of view, the whole domain of continuations
might also be relevant (even if continuations are not always
implemented as activation records' stacks)
--
Basile STARYNKEVITCH http://starynkevitch.net/Basile/
email: basile<at>starynkevitch<dot>net
aliases: basile<at>tunes<dot>org = bstarynk<at>nerim<dot>net
8, rue de la Faïencerie, 92340 Bourg La Reine, France
Return to the
comp.compilers page.
Search the
comp.compilers archives again.