Data Structures in C

Python program for searching pdf text, ranking the results and exporting highlighted search results in pdf. Uses trie structure, stack, heap, page graph. Converts queries to postfix notation. Allows for logical expressions and phrases. Offers did you mean functionality.

Текстовый редактор с функциями языкового процессора (курсовая работа по теории формальных языков и компиляторов (ТФЯиК) за 6 семестр)

A simple boolean expression validator, creating truth tables for boolean expressions

Link-List,Stack,Queue,Tree,hash Function,Graph

This project is a Math Interpreter, built entirely in VBA using the Shunting-Yard algorithm.

Some basic Data Structures programs (C/C++)

LabVIEW library to evaluate numerical and conditional expressions at run-time.

While we use infix expressions in our day to day lives. Computers have trouble understanding this format because they need to keep in mind rules of operator precedence and also brackets. Prefix and Postfix expressions are easier for a computer to understand and evaluate. Given two operands a and b and an operator \odot , the infix notation implies that O will be placed in between a and b i.e (a * b) . When the operator is placed after both operands i.e ab\odot , it is called postfix notation. And when the operator is placed before the operands i.e (* a b) , the expression in prefix notation. Given any infix expression, we can obtain the equivalent prefix and postfix format.

:heavy_check_mark: Functions that show how compilers evaluate mathematical expressions

Conversion from infix to postfix notations using implemented stack data structure and evaluate the postfix expression.

A desktop calculator with a synthwave aesthetic. Made with React and Electron.

This is a postfix evaluator written in C. It takes a postfix expression as input and evaluates it. It supports the following operators: + - * / ^ ( )

MEE Math Expression Evaluator

Infix to postfix/prefix convertor and evaluator.

Postfix to Infix converter built on binary Expression Tree. To convert the tree to Infix expression the inorder tree traversal is applied. Implemented in Java with GUI

This Repository is a part of Learning DSA through C

A menu driven C++ programe to do all type of polish conversions . Infix to Postfix converter,Infix to Prefix converter,Postfix to Infix converter,Prefix to Infix converter,Postfix to Prefix and Prefix to Postfix

Implementation of Stack data structure with Infix To Postfix Generator and Postfix Evaluator for calculating calculating mathematical expressions, also Parentheses checking.

A responsive calculator using postfix evaluation with stack, built in Vanilla JS and styled with Tailwind CSS. Fast, clean, and keyboard-friendly.

A simple expression parser to process logic gates.

No description provided.

RPN calculator using MVC pattern

Convert ifix expression to postfix expression.

No description provided.

Infix Expression Operations

This project is a simple calculator web application built using HTML, CSS, and JavaScript. It allows users to perform basic arithmetic operations like addition, subtraction, multiplication, and division. and more...

Application using implemented stack data structure to convert from infix to postfix notations. And evaluate the postfix expression

Go library for parsing and evaluating mathematical expression

Calculator