Mathematical Expression Evaluator

Implementation of an arithmetic expression evaluator. The work includes the development of a lexer, parser, and a step-by-step evaluator, focusing on readability, reliability, and execution cost.

Full Assignment (pt-br)

---

Overall Architecture:

Lexer:

Receives the expression as input and returns an array of tokens

Parser:

Receives an array of tokens as input and builds a syntax tree that represents the original expression

Eval Step:

Traverses the expression tree following a bottom-up approach, resolving the entire expression in parts by evaluating results inferred by subtrees

To String:

Traverses the tree and prints the current state of the expression

Created by:

• Reidner
• Vitor Padovani
• Hudson da Silva