The word is entered into the word list that was the compilation word list
at the start of the definition. Any changes to the name field (e.g.,
immediate) or the code field (e.g., when executing DOES>)
are applied to the latest defined word (as reported by latest or
latestxt), if possible, irrespective of the compilation word list.
previous): ¶-4 throw (stack underflow). You can distinguish this from data
stack underflows by having throw on the top of the backtrace
and stack> close by.
also): ¶The search order size in Gforth is only limited by memory, and when
the resize fails, an appropriate exception is thrown. However,
if you use get-order, you will probably get a data stack
overflow at a much smaller size (by default, the data stack can hold
4K elements).