Skip to content

This Java project was done when I was in freshman and it resembles the process of a finite automata equipped with basic algorithms to deal with mathematical operations, mainly binary ones. It matches binary operators and operands totally in base 10 (realized by stringbuffers) and calculate step by step to obtain the result.

Notifications You must be signed in to change notification settings

LeoW1728/Maths-Interpreter

Repository files navigation

Description

This project is a naive base 10 step-by-step maths calculator implemented in Java, it can do basic calculations and flexible to have new operators and types of operands added in it. The author designed the whole project himself in freshman year. Albeit, the author later learnt the theory of finite automata and compiler design, and this project worked as a bridging piece. Due to some time limitation, the author wasn't able to further update it to realize the "functions" and "Rationals". The basic functionality of detecting arithmetic formulas and break it down step by step still works, however, sometimes the string-to-number algorithm doesn't work normally and lead to a mistake.

About

This Java project was done when I was in freshman and it resembles the process of a finite automata equipped with basic algorithms to deal with mathematical operations, mainly binary ones. It matches binary operators and operands totally in base 10 (realized by stringbuffers) and calculate step by step to obtain the result.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages