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.

Data Structures in C

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

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

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

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

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

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

✔️ Functions that show how compilers evaluate mathematical expressions

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 impli…

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

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

RPN calculator using MVC pattern

Convert ifix expression to postfix expression.

This Repository is a part of Learning DSA through C