News for hackers. Stuff that matters.
Re:My Life as a Forth Interpreter (1986) [pdf] by dimitar on Sunday March 16, 2014 @04:36PM (#7411145)
Wow, can someone explain this story? Its hard to follow if you are not a forth hacker.
Re:My Life as a Forth Interpreter (1986) [pdf] by Someone on Sunday March 16, 2014 @05:36PM (#7411434)
The tokens coming in are the tokens from the user's ("Him") input. The outer interpreter is what translates those tokens into actions to perform. The inner interpreter performs those actions.

In a Forth, both the inner and the outer interpreter are extremely simple. The story describes them in detail.

Outer interpreter: look up token in dictionary/dictionaries. If found, instruct inner interpreter to execute it by giving it the address of the function that the token describes. If not found, try interpreting the word as a number in the current base. If that succeeds, push the number on the stack. If it fails, signal an error and clear some state.

Inner interpreter: start reading at the address supplied. Recursively interpret every word read as address of another function until encountering a 'end of function' marker.

Leo Brodie's variant of this story doesn't use the terms inner and outer interpreter because it was written before the names were invented, but it may be instructive, anyways: http://www.forth.com/starting-forth/sf1/sf1.html

Re:My Life as a Forth Interpreter (1986) [pdf] by raverbashing on Sunday March 16, 2014 @05:49PM (#7411526)
So the inner interpreter is a VM of some sort?

Outer interpreter looks like exactly that, an interpreter (as opposed to a compiler)

Re:My Life as a Forth Interpreter (1986) [pdf] by Someone on Sunday March 16, 2014 @06:19PM (#7411648)
Yes, it has been described as such. A main difference/interesting property of this VM is that end users write programs in Forth by extending the VM's instruction set (= the set of dictionary definitions). While in interpreted mode or at compile time (i.e. when the user types words in the terminal), the instruction lookup is slow, through one or more linked lists. At run time, definitions simply consist of lists of pointers to other functions.
Re:My Life as a Forth Interpreter (1986) [pdf] by nocoment on Sunday March 16, 2014 @05:23PM (#7411362)
It looks like an introduction to FORTH via Kafka..

There is a nice browser interpreter here: http://forthfreak.net/jsforth80x25.html

you can start with: 1 1 + . (+ adds, . prints and this is clearly reverse polish notation)

FORTH is in essence an accumulator CPU like the 68000, except it has an easier abstraction to define new instructions (aka "Words") to act like the + or . above.

Re:My Life as a Forth Interpreter (1986) [pdf] by emeraldd on Sunday March 16, 2014 @07:05PM (#7411813)
Is that another term for a stack machine? I haven't heard of an accumulator cpu before ...
Re:My Life as a Forth Interpreter (1986) [pdf] by nocoment on Sunday March 16, 2014 @08:09PM (#7412057)
A CPU with an accumulator register (default locations that accepts the result for each instruction and is usually one of the operands in each new instruction.)

I guess that is a bit less capable than an actual stack machine like FORTH but sort of the starting point of this programming mentality (at least as I think of it.)

Re:My Life as a Forth Interpreter (1986) [pdf] by davidw on Sunday March 16, 2014 @05:19PM (#7411337)