GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
expression-evaluationHere are 29 public repositories matching this topic...Language: All
Filter by language
Sort: Most stars
Sort options
Learn advanced Rust by building a type-safe, auto-vectorized database expression engine
rust tutorial course database generics type-erasure query-engine type-system database-systems gats expression-evaluation vectorized-execution
Register Allocator for 8086
dos compiler assembly x86 code-generation register-allocation compiler-design compiler-optimization 8086 compiler-backend expression-evaluation
DuckDB extension for running Rhai scripts and evaluating expressions in SQL queries.
sql database scripting user-defined-functions duckdb rhai expression-evaluation rhai-script duckdb-extension
.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.
python rust python-bindings evalexpr mathematical-expressions pyo3 rust-extension maturin expression-evaluation logical-expressions
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.
java calculator algorithm programming data-structures software-development reverse-polish-notation custom-stack arithmetic-calculator coding-practice custom-data-structure math-operations math-tool stack-implementation expression-evaluation
Rust CLI for parsing and evaluating arithmetic expressions defined by a context-free grammar.
docker rust cli parser recursive-descent context-free-grammar recursive-descent-parser rust-cli arithmetic-parser expression-evaluation
Master stack data structure — Monotonic stack, NGE, stock span, expression evaluation, min-stack. 30+ interview problems with O(n) solutions.
python stack algorithms competitive-programming data-structures nge interview-prep dsa expression-evaluation monotonic-stack
🇵🇱 Polish notation expression calculator in Python with console and window interfaces
My assignments in the mathematical logic discipline
java c-plus-plus math expression-parser expression-tree mathematical-logic grammar-parser expression-evaluation
C++ program for converting infix expressions to postfix and evaluating them using stack-based algorithms.
The shunting yard algorithm is used to convert the infix notation to reverse polish notation.
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.
gui event-handling mathematical-calculations swing-framework expression-evaluation layout-management
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.
C++ program for representing polynomials with linked lists and performing addition, multiplication, and evaluation operations.
linked-list cpp data-structures polynomial polynomial-multiplication expression-evaluation polynomial-addition
C++20 implementation of an arithmetic expression tree using infix-to-postfix conversion, binary trees, variable evaluation, level-order traversal, and dynamic memory management.
visual-studio cplusplus algorithms cpp postfix data-structures binary-tree expression-tree cpp20 expression-evaluation
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.
Add this topic to your repoTo associate your repository with the expression-evaluation topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |