Learn advanced Rust by building a type-safe, auto-vectorized database expression engine

Register Allocator for 8086

.NET runtime C# expression evaluator powered by Roslyn — dynamic string interpolation, LINQ support, configurable security levels, and expression caching for templates.

A Python extension module written in Rust that provides bindings to the evalexpr crate, enabling quick and safe expression evaluation in Python.

My implementation of "Very Bad Calculator" — a small arithmetic expression evaluator supporting digits, +, *, and parentheses.

Basically, an expression evaluation is an algorithm that aims to receive a mathematical expression and return the result of that expression.

This project implements an arithmetic calculator capable of parsing and evaluating mathematical expressions using a custom stack data structure. The calculator handles various arithmetic operations and parentheses, providing accurate results for complex expressions.

Math Expression Library

Rust CLI for parsing and evaluating arithmetic expressions defined by a context-free grammar.

Arbitrary precision arithmetic library in Java supporting large integer and floating-point computations without external libraries.

Master stack data structure — Monotonic stack, NGE, stock span, expression evaluation, min-stack. 30+ interview problems with O(n) solutions.

The shunting yard algorithm is used to convert the infix notation to reverse polish notation.

🇵🇱 Polish notation expression calculator in Python with console and window interfaces

The CalculatorApp is a Java-based calculator application with a graphical user interface. It provides users with the ability to perform various mathematical operations such as addition, subtraction, multiplication, division, exponentiation, square root, and trigonometric functions.

My assignments in the mathematical logic discipline

C++ program for converting infix expressions to postfix and evaluating them using stack-based algorithms.

A simple Command Line Interface (CLI) calculator program written in Zig. It evaluates arithmetic expressions containing numbers, the four basic operators, and parentheses for operator precedence. It utilizes the zig-libraries dependency.

Today I learned about the Stack data structure, which follows the LIFO (Last In, First Out) principle. This means the element added last is the one removed first.

C++ program for representing polynomials with linked lists and performing addition, multiplication, and evaluation operations.

C++20 implementation of an arithmetic expression tree using infix-to-postfix conversion, binary trees, variable evaluation, level-order traversal, and dynamic memory management.