An idea to work towards for the output of the parser - tree structured expressions.
Merge pull request #2 from lukemarsden/tree-idea

An idea to work towards for the output of the parser
parser with imported set of classes for binary connectives
Abstract syntax tree works :)
tidied up
Added a function to write latex to produce a tree for inputted string that branches on the connective, OR or AND, that has the widest scope
Branching now controled bya function rather than an if-statememt
Branching now defined as a method on proposition classes AND, OR and PROP_VAR.
Ideas for fixing recursivity in AND branch
Examples of AND and OR branches in tex
A presentation layer for qtree with tests.