Sun Aug 9 11:32:40 CEST 2009
I got distracted.. Getting a front row view of how Scheme is
implemented on top of a bare machine is fascinating.
Anyways. Now that the core of the interpreter seems to work, let's
make the first attempt at re-usable code: a reader = tokenizer +
"compressed ast parser" for s-expressions.
A compressed ast is a binary flat representation of a tree, consisting
of a stream of words. This is important, because it will be the main
interface between two communicating processes that do not share
memory (or not all memory: they might share constant pointers.).