Math Parser supports learning how a compiler creates an executable program file from source code.
Using mathematical expressions as an input, Math Parser shows how the following stages of compilation are performed:
- Lexical Analysis
- Syntax Analysis
- Code Generation
- Optimisation
In addition, Math Parser demonstrates:
- How mathematical expressions are formed into Reverse Polish Notation (RPN) for execution using the Shunting Yard algorithm and the Stack data structure.
- How an Abstract Syntax Tree can be created from the RPN, showing how a recursive algorithm is used in practice.
The RPN and Data Dictionary from successfully compiled expressions can be saved and then evaluated using the Math Parser Virtual Machine.
Math Parser supports implied multiplication (e.g. 5x) as well as explicit multiplication (e.g. 5 * x) in its input expressions.
Fully supported by a comprehensive Help file, Math Parser includes all the algorithms used and explains all the technical terminology.
Windows only.
For Site Licences, please contact us
