Top Down Operator Precedence (TDOP) parsing is a parsing technique introduced by Vaughan Pratt in a 1973 paper. The technique combines the best properties of recursive descent and operator precedence.
This program can successfully parse and evaluate a given expression in accordance to a predefined set of precedence rules.
In accordance to BEDMAS, the input expression 2 * 10 / 5 - 1 + 4 can be successfully parsed and evaluated. The following is the output:
> 2 * 10 / 5 - 1 + 4
Precedence Parsing:
( ( 2 * ( 10 / 5 ) ) - ( 1 + 4 ) )
Interpreter results:
-1
Tree Structure:
Left: 10, Right: 5, Operator: /
Left: 2, Right: ( 10 / 5 ), Operator: *
Left: 1, Right: 4, Operator: +
Left: ( 2 * ( 10 / 5 ) ), Right: ( 1 + 4 ), Operator: -
| Operator | Precedence |
|---|---|
- |
0 |
+ |
1 |
* |
2 |
/ |
3 |
- Implement a Custom Lexer
- Implement a Stack-based Interpreter
- Support for Unary & Ternary Operators
- Allow decimal values as input
- Create User Interface