Index of /anton/lvas/stack-abgaben/07w/automaton
authors:
stefand dösinger
peter haberl
gregor kaufmann
files:
automaton.fs the actual forth program
input sample finite automaton
mode of operation:
the program uses the forth parser to parse and work on (deterministic)
finite automatons defined in files. while parsing such a file, the program
builds a hybrid representation of that dfa, consistig of in-memory data
structures and code created at runtime. using dynamically created code to
represent parts of the dfa, enables the program to easily deceide wheter
certain inputs lead to reaching a goal state, or ending up in a trap state.