An enhancement of math equation parsing using call stacks / Kristine Kyle T. Diaz and Mary Zeychelle L. Hundana.

ABSTRACT:
Math Equation Parsing Using Call Stacks is focused on constructing a stack of instructions which will be executed in order of priority to calculate a final value. Given an equation, the stacks will be generated by parsing the individual characters of the mathematical formula, then it will determine the type, order and tier of the stacks before it execute the given equation and generate its resulting value. In the idea of call stacks, the formula is dissected into blocks of information, which are identified as operations and executed by order of importance such as the PEMDAS rule, If a block is a sub-stack then these can be nested as callable blocks which need invoking. However good it may seem, math equation parsing is not perfect. This led the researchers to enhance some of its problems that they have encountered mainly: The negative and positive prefixes for numbers do not function correctly, incorrect output when computing squareroots, inability to compute decimal, binary, octal and hexadecimal with fractional part correctly. We have enhanced some parts of the algorithm that Math Equation Parsing Using Call-Stacks uses that led us to fix these encountered problems. The proponents used the survey method for the gathering of data in order for us to know other people's view and opinion about MQ Parser Calculator where the researchers based the creation of the enhanced system. The researchers recommend people to use the enhanced application, and recommend those that are interested to further enhance the system, better improving the accuracy of recognitions and other enhancements.