Field Summary
final boolean	echoInput
final static int	failure
boolean	finished
String	finl Final string
final static int	gotoRule
String	initial Initial string
KeyList	keys The key list
KeyStack	keyStack Key stack
DecompList	lastDecomp
ReasembList	lastReasemb
Mem	mem Memory
PrePostList	post The post list
PrePostList	pre The pre list
final boolean	printData
final boolean	printInitialFinal
final boolean	printKeys
final boolean	printPrePost
final boolean	printSyns
WordList	quit Quit list
final static int	success
SynList	syns The syn list
TextArea	textarea
TextField	textfield

Method Summary
String	assemble(Decomp d, String reply, Key gotoKey) Assembly a reply from a decomp rule and the input.
public void	collect(String s) Process a line of script input.
String	decompose(Key key, String s, Key gotoKey) Decompose a string according to the given key.
public boolean	finished()
public boolean	handleEvent(Event event)
public void	print() Print the stored script.
public String	processInput(String s) Process a line of input.
public int	readScript(boolean local, String script)
public void	response(String str)
int	runProgram(String test, Panel w)
String	sentence(String s) Process a sentence.
public void	setFinished(boolean isFinished)

Assembly a reply from a decomp rule and the input. If the reassembly rule is goto, return null and give the gotoKey to use. Otherwise return the response.

Decompose a string according to the given key. Try each decomposition rule in order. If it matches, assemble a reply and return it. If assembly fails, try another decomposition rule. If assembly is a goto rule, return null and give the key. If assembly succeeds, return the reply;

Process a sentence. (1) Make pre transformations. (2) Check for quit word. (3) Scan sentence for keys, build key stack. (4) Try decompositions for each key.