Re: Stack vs stackless operation

Probably because the case where the two operands
of a + are in memory, and the result is needed
in memory is not that frequent.

One example could be matrix multiplication.
It's rather trivial but cumbersome operation,
where usually a few transitional variables are
used to maintain clarity of the code.

I don't think that it would be faster or shorter to use
memory-to-memory operations here.  That's also why the VAX died: RISCs
just outperformed it.

Probably "bigger" Forth compilers are indeed
already "too good" for the difference to be
(practically) noticeable — still maybe for
simpler Forths, I mean like the ones for DOS
or even for 8-bit machines it would make sense?
I'll try to do a few checks in the days that'll
follow.
--