An Implementation of Steensgaard's Algorithm
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   by Vince Weaver,  vince _at_ csl.cornell.edu
   

BUILDING:
~~~~~~~~~
  * Unpack
  * run "make"
  * run "make test" to run tests.
  * run "./steen" to get an interactive session going.  See below
    for usage.

FILES:
~~~~~~
  * main.c - holds the parser
  * steensgaard.c - holds the steensgaard algorithm
  * union_find.c  - handles the lower level union/find stuff

USAGE:
~~~~~~
	
	        ../steen -debug -show-dummy -h -html=prefix
		
        -debug       = turn on debug messages
	-show-dummy  = show dummy variables
	-h           = print this help
	-html=PREFIX = create HTML result, with prefix given


Commands the Interpreter Understands:
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    * variables are auto-created the first time you use them
    * // - everything following until new-line is a comment
    * dump(); - dumps the current state of the algorithm
    * a=4; - can be any number. creates a if not already there and has it point to bottom
    * a=b; a=*b; *a=b; a=&b; - the various Steensgaard assignments 

