Reply To: Simulation

Ivan,

Can genAsm’s go construct do backwards branches? (that is to a label earlier in the same function??

If so, then that’s sufficient for writing the endless loop of an interpreter (though I’ll welcome the syntactic sugar of better looping constructs.)

From what I can tell, memory operations and statically allocated memory are the key other pieces needed to write a (very) basic Forth interpreter, e.g. one that starts out handling only scalar integers and pointers.