MathParser

This is my programming experiment to build a parser and tokenizer that reads mathematical expressions and processes them. The parser is working and the evaluator is a WIP.

How does the program work?

The entire parser is one large object-oriented recursive descent parser. You are inside a recursive call from the start until the end. I use a tokenizer to get each token in the string and then I recursively sort the tokens into a large JSON structure. The program also uses the concept of folding which is an optimization technique that compilers use.

Basic arithmetic operators currently supported:

• addition, subtraction, division, multiplication

Logarithmic and trigonometric operators/functions currently supported:

• square root
• absolute value
• sin, cos, tangent
• natural log
• vector math
• factorial

Below is an example of the program parsing and evaluating a simple addition expression

Notice the JSON structure which is a decomposed representation of the terms into logical units.

Below is an example of the parser implementing order of operations and additional expression terms

Notice that the program understands parentheses enforce order.