[<<][libprim][>>][..]
Sun Oct 10 20:10:14 CEST 2010

Generating byte code from ANF trees..

..is then of course very straightforward (it's the whole point of
ANF).  The idea is to flatten the tree and use jumps, return address
pushes or combinations (calls) to implement it, depending on what is
simplest for the architecture.

Generating C code it's probably best to stick to calls, and return
environment on primitive return.  However if continuation capture is
to be implemented, a CELL stack is necessary.




[Reply][About]
[<<][libprim][>>][..]