Take tokens created from lexer and convert this into an abstract syntax tree

Current thought on how to do this is to use Pratt parsing

Another option to use is the shunting yard algorithm but this algorithm might not be as useful since this converts the tokens into reverse polish notation which will then have to be converted into an abstract syntax tree (whereas pratt parsing directly converts the tokens into an abstract syntax tree)