Fixed prsr/scnr/ast to pass microc basline. lrx functionality ongoing

Special decision of note regarding trees in parser/ast:

Tree($1, $3)
$3 is a list of nodes in order. Reminder a node is an expr so
trees can be embedded in trees or at least the syntax can. Embeddeble
trees are not allowed in Lorax. This syntax: 3[4, 5[6, 7]] will produce

expr
tree
node_expr LBRACKET nodes RBRACKET
node_expr LBRACKET expr COMMA nodes RBRACKET
node_expr LBRACKET expr COMMA expr RBRACKET
node_expr LBRACKET expr COMMA tree RBRACKET
node_expr LBRACKET expr COMMA node_expr LBRACKET nodes RBRACKET RBRACKET
node_expr LBRACKET expr COMMA node_expr LBRACKET expr COMMA nodes
        RBRACKET RBRACKET
node_expr LBRACKET expr COMMA node_expr LBRACKET expr COMMA expr
        RBRACKET RBRACKET
node_expr LBRACKET expr COMMA node_expr LBRACKET expr COMMA literal
        RBRACKET RBRACKET
node_expr LBRACKET expr COMMA node_expr LBRACKET expr COMMA Int_Literal
        RBRACKET RBRACKET
...
Ast.expr = Tree(Int_Literal(3), [Int_Literal(4); Tree(Int_Literal(5), [
        Int_Literal(6); Int_Literal(7)])])

Special Note: In a normal Ast.expr = Call of string * expr list the
list is in reverse order and is later reversed for use. Not the case
with this Tree type.
removed interpreter errors, added bool_literal
added all literals. added excpetions for unimplemented functions.

In files that I wasn't exclusively working on (interpret.ml, compile.ml,
execute.ml) I have added some cases which we haven't yet implemented to
make compiler warnings go away. Example | Mod -> raise (Failure "mod not
implmented"). I have followed this convention exactly so in the future
when someone needs to fix up the mod function (for example) they can
search "mod not implemented" and find all the cases that they need to
fix up.
child function added to parser/ast. semantics notimplemented.

The parser for the child binary operator should work but will require a
fair amount of semantic analysis to ensure that the child operation is
only working on appropriate operands. Some examples:

This is fine...

        (3[4, 5])%0

        expr
        expr CHILD expr
        LPAREN expr RPAREN CHILD expr
        LPAREN expr RPAREN CHILD literal
        LPAREN expr RPAREN CHILD INT_LITERAL
        ...

This will need to be figured out in semantic analysis...

        (3[4, 5])%6[7]

        expr
        expr CHILD expr
        LPAREN expr RPAREN CHILD expr
        LPAREN expr RPAREN CHILD tree
                                 ^^^^
                                 see the problem here?
                                 ok for parser. not for lorax.
and/or operators added to parser. not yet implemented
unary op neg added prsr/sc/ast. not implemented
Not unary operator added
At, Not operators added. Previous 3 commit s/r conflicts removed.

The associativity for AT is currently nonassoc which needs review. Expr
AT should be reviewed as well.
removed temporary hello.c from commits
renamed microc to lorax. tweaked readme. added examples dir
added other type vdecls. corrected string/char literal
in progress: adding multiple types prsr/ast/scnner. see note.

interpret.ml and compile.ml have been commented out while work on
different data types is implemented. All tests will fail.
tree decl syntax satisfies simple test
hello world source to ast working. small fixes. chunks commented out.

Makefile was missing debugger flags. compile, interpret all commented
out to allow for testing of hello world ast test. parser adjusted for
node_expr.
fixed previous commit didn't rename datatype throughout
added brackets to scanner, added back id in tree formation
function formals added to prsr/ast
return types added to fdecl prsr/ast. not implemented.

Interpret, Bytecode, Compile still commented out to allow for AST
testing.
reorganized example dir
important fix to str_lit scanner