The standard Forth text interpreter recognizes the following types of tokens: words in the dictionary, integer numbers, and floating point numbers. Defining new types of tokens isn't yet standardized. Gforth provides recognizers to make the text interpreter extensible as well.
Recognizers take a string and return some data and a “table” for
interpreting that data. Gforth implements that table as xt (which means
any xt is a valid result of a recognizer), but other Forth systems can
implement it as actual table, with three xts inside. The first xt is
the interpretation/run-time xt, it performs the interpretation semantics
on the data (usually, this means it just leaves the data on the stack).
The second xt performs the compilation semantics, it gets the data and
the run-time semantics xt. The third xt perfoms the postpone semantics,
it also gets the data and the run-time semantics xt. You can use
post, to postpone the run-time xt.
Recognizers are organized as stack, so you can arrange the sequence of recognizers in the same way as the vocabulary stack.
If a recognizer fails, it returns
doc-word-recognizer doc-num-recognizer doc-fnum-recognizer doc-get-recognizer doc-set-recognizer
do-recognizeraddr u – tokens xt unknown “do-recognizer”
process the string addr u in the recognizer stack
recognizer:int-xt comp-xt post-xt "name" – unknown “recognizer:”
create a new recognizer table