We have decided to open source our calculator project to the world. Here are some of the features of the code:
- Implements a lexer, parser, and Dijkstra’s shunting yard algorithm to convert an expression into postfix form.
- Implements a simple stack machine for parsing these expressions. When using float and double, the speed is quite fast.
- Implements a basic UI, as seen below (keep in mind that many of the features are not implemented):
If you’re interested in learning more about lexing and parsing, or even if you’re just curious, you can access the GitHub project here. The code is licensed under the Apache 2.0 license.
