Tue Jun 2 19:14:44 CEST 2009

more standalone forth

NEXT: the dictionary.  I already settled on using a 2-part
dictionary with metadata and code stored separately.

Things to figure out:
  * Where to put it
  * What to put in it
  * How to store head pointers.

Note that recursion is difficult in standard Forth, because the word's
semantics is only known _after_ the definition is compiled.  One could
say that immediate words don't really need recursion so storing the
address at the invokation of ":" makes recursion work.  I don't think
the standard says anything about this..  Actually, I'm wrong.  RECURSE
is used to make sure that words can be redefined keeping the previous
behaviour reachable for delegation.

Let's just keep it simple and use the abstract "_," to create the
dictionary entries too.  This leads to reasonably portable code.

[1] http://www.taygeta.com/forth_intro/recurse.htm