Boolean values and operators (bitwise)

[n-arms]

Description

Handling boolean comparisons between numbers, as well as true/false key variables

• 5 > 3 -> true
• true & false -> false

Implementation

The lexer should have a static list of keywords, and whenever it detects a would-be symbol with the text of that keyword, it creates a keyword token instead. This includes true and false, which are then handled by the Parser during Parser.parseLiteral().

[n-arms]

By default the ExpressionSyntax.eval() method returns a double, which wouldn't work with a boolean. Similarly, compiling for graphing (#3 ), would involve reducing as much as possible to just constants. It would thus make sense to remove the old eval method and create a new one which returns a tree that is as reduced as possible, a combination of the old eval and reduce methods.

• [x] Key values should be identifiable at Lexer level
• [x] Determine whether a segment of tree can be reduced to a constant (contains only constants and defined vars when reduced)
• [x] Reducing trees should default to returning a numerical value (or boolean), but variable values (Implementing like terms: #2 ) would also be acceptable