Volume Seven

Articles:

Finite State Machines in Forth: J. V. Noble
Abstract
This note provides methods for constructing deterministic and nondeterministic finite state automata in Forth. The "best" method produces a one-to-one relation between the definition and the state table of the automaton. An important feature of the technique is the absence of (slow) nested IF clauses.
Using IBM's NetBIOS from Forth: Peter Knaggs
Abstract
A general overview of the IBM NetBios system is given and its Multi-Tasking abilities are discussed. A Forth interface that exploits these is presented along with an example application program, which illustrates the integration of NetBios with Forth's Multi-Tasker is described.

Forth200x Standard Meetings: