Worked on this during semester 2 between ISA 2 because Unit 3 Maths (UE25MA141B) is built different. This C engine tokenizes mathematical equations, structures them into a pointer-linked Abstract Syntax Tree (AST) on the heap via a recursive descent parser, and generates
- Inverse Laplace Transformation routines
- Complex transcendental functions (
$\sin(at)$ ,$\cos(at)$ , shifting theorems) - Make it more cool (ASCII/Graphviz node layout visualizer)