An expression parser supporting multiple types

Tiny code fragments in Aarch64 assembly

A simple algorithm to evaluate an arithmetic expression

A graphing calculator application that uses custom-built data structures like lists, stacks, and queues, along with the Shunting Yard algorithm for expression parsing. Features include plotting graphs of expressions, handling trigonometric functions, and an intuitive user interface built with SFML

Basic calculator implementation in C++ with the Shunting Yard algorithm.

An implementation of the shunting-yard algorithm in Java.

A toy self-compiling C compiler.

Converts infix to RPN and then evaluates the expression

Calculator using Shunting Yard algorithm

Complex implementation for Expr4j library

BigDecimal implementation for Expr4j library

Double implementation for Expr4j library

Java library to evaluate mathematical expressions

A simple calculator which supports brackets and various operators.

Python implementation of the Shunting-yard algorithm to compute string mathematical expression. Available on PyPI.

A collection of math expression parsers that were developed in my tutorial series: https://inspirnathan.com/posts/149-math-expression-parser-in-javascript/

An implementation of the shunting yard algorithm by Edsger Dijkstra and a postfix stack evaluator.

Evaluates mathematical expressions written in infix notation

Implementation of precedence parsers and it's specific case - shunting yard algorithm