Mathy parses token arrays into symbolic trees that can be inspected, transformed, and visualized.
While a Token array verifies that text maps to some mathematical expression, its form fails to encode the
Order of Operations that is required to evaluate the end result.
Said another way, a token array is sufficient to make sure there are not errors in an expression, but a tree encoding the order of operations is required to iterate the expression and calculate its numeric value.
To help better understand what the parser does, consider a few examples of expressions and their visualized trees: