removing +x on the files and adding semantic library
refactor parser to be clearer and not use global variables
safety
Change error reporting and fix a bug where "[[if [= 1 1] [let [[y int]]]
[:= y 3]] [:= x 2]]" doesn't parse properly
priting these tress using infix notation doesn't work right
80-char wrap
still finally finished recovering the the massive find/replace of "is"
with "=="
making the test function more obvious in the result and changing the spacing for the tree priting to distinguish better the nodes
Change "MINUS" to reflect either negate or minus
Change numerical minus to seperate negation
Add option to build stack of tree w/ node elements to fix nodes for
float types
Change oper section handling minus to reflect binop or unop
keeping track of tested combinations
semantic checks 2nd boolean operand recursion
fixes #14
Can now semantic check boolean operator with boolean expr in first
operand

fixes #15
Change the way the node stores the token data
Parse [[+ 10 .1]] properly
safety
Can parse single layer binop with mixed int/float