Recursive Descent Parser for Abstract Syntax Tree Visualization of Mathematical Expressions

This study presents a novel method for finding and evaluating mathematical expressions using Abstract Syntax Trees (AST). The approach is particularly adaptable for both academic and professional applications since it accurately parses complex equations and accommodates a large number of mathematical operations. The AST model ensures a hierarchical expression structure, enabling accurate and efficient evaluation. Parsed expressions are improved by incorporating interactive graph vi-sualisation, which simplifies mathematical computations and engineering tasks for understanding and application. The project's complete approach to detecting mathematical expressions stands out since it takes into account a wide range of functions and variables and ultimately enhances the system's accuracy and adaptability. The visual representation of AST also helps with debugging and checking the accuracy of parsed expressions, which adds to its significance in the field of mathematical expression recognition.