Ecosyste.ms: Repos

An open API service providing repository metadata for many open source software ecosystems.

GitHub topics: postfix-evaluation

Repositories

h4jack/cal

This project is a simple expression calculator implemented in C. It provides functionalities to convert infix expressions to postfix notation and evaluate the resulting postfix expressions.

Language: C - Size: 52.7 KB - Last synced: 7 days ago - Pushed: 9 days ago - Stars: 0 - Forks: 0

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...

Language: JavaScript - Size: 8.79 KB - Last synced: 11 days ago - Pushed: 11 days ago - Stars: 0 - Forks: 0

Shojiyao12/MIPS_Calculator

A basic MIPS-based Calculator, that would ask for an input from the user, then the program will convert that input into Postfix first and display it. Afterwards, assess the original input from the user and perform the following operations (based on what was inputted): Addition, Subtraction, Multiplication, Division. Then, output the result.

Language: Assembly - Size: 3.71 MB - Last synced: about 1 month ago - Pushed: about 1 month ago - Stars: 0 - Forks: 0

Alexey-Sagaydak/Compiler

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

Language: C# - Size: 3.13 MB - Last synced: about 1 month ago - Pushed: about 1 month ago - Stars: 3 - Forks: 0

prathwik0/data-structures-in-c

Data Structures in C

Language: C - Size: 246 KB - Last synced: about 2 months ago - Pushed: about 1 year ago - Stars: 5 - Forks: 2

ranimeshehata/Expression-Evaluator

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

Language: Java - Size: 2.93 KB - Last synced: about 2 months ago - Pushed: about 2 months ago - Stars: 1 - Forks: 0

BaseMax/PostfixEvaluatorC

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

Language: C - Size: 16.6 KB - Last synced: about 2 months ago - Pushed: over 1 year ago - Stars: 2 - Forks: 0

Shubham-Lal/Infix-Operation

Infix Expression Operations | Collaborated on this Project with @Jay9874

Language: HTML - Size: 22.5 KB - Last synced: about 1 month ago - Pushed: about 1 year ago - Stars: 1 - Forks: 1

MovieTone/PostfixToInfixExpressionTree

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

Language: Java - Size: 17.6 KB - Last synced: about 2 months ago - Pushed: 4 months ago - Stars: 1 - Forks: 0

njmarko/googolplex-pdf-search

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.

Language: Python - Size: 6.2 MB - Last synced: 25 days ago - Pushed: almost 2 years ago - Stars: 3 - Forks: 1

Viren002/Calc

This calculator project is made in HTML , CSS, JS. Uses postfix expression conversion and evaluation .

Language: CSS - Size: 45.9 KB - Last synced: 8 months ago - Pushed: 8 months ago - Stars: 0 - Forks: 0

Dashminder-Singh/DSA_through_C

This Repository is a part of Learning DSA through C

Language: C - Size: 48.8 KB - Last synced: 9 months ago - Pushed: almost 3 years ago - Stars: 1 - Forks: 0

Showwaiyan/Calculator

Calculator written with HTML, CSS & JavaScript that includes Expression Evaluation between in-fix and post-fix.

Language: JavaScript - Size: 7.81 KB - Last synced: 10 months ago - Pushed: 10 months ago - Stars: 0 - Forks: 0

rcpacini/LabVIEW-Expressions

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

Language: LabVIEW - Size: 1.29 MB - Last synced: 10 months ago - Pushed: 10 months ago - Stars: 1 - Forks: 0

Haus226/automaticDifferentiation

An automatic differentiation library inspired by micrograd and extend some functionalities

Language: Python - Size: 205 MB - Last synced: 5 months ago - Pushed: 5 months ago - Stars: 0 - Forks: 0

jaydattpatel/Stack

Different Operation for Stack

Language: C++ - Size: 3.91 KB - Last synced: 11 months ago - Pushed: about 1 year ago - Stars: 1 - Forks: 0

Evebarr20/CSCD300Lab5

Stack Linked-list: infix expression to postfix expression, evaluate postfix expression

Language: Java - Size: 12.7 KB - Last synced: 11 months ago - Pushed: almost 2 years ago - Stars: 0 - Forks: 0

kchan139/dsc-assignment

hk222

Language: C++ - Size: 354 KB - Last synced: 11 months ago - Pushed: about 1 year ago - Stars: 0 - Forks: 0

angiee99/lab3

Calculates the result of a mathematical expression using Shunting Yard by turning infix to postfix and evaluating it

Language: C++ - Size: 19.5 KB - Last synced: 12 months ago - Pushed: 12 months ago - Stars: 0 - Forks: 0

Przemyslawmd/MathExpression

Language: Python - Size: 201 KB - Last synced: about 1 year ago - Pushed: about 1 year ago - Stars: 0 - Forks: 0

kobedelta-phi-edu/InfixToPostfix

A program that converts an Infix expression to a Postfix one as well as evaluates a Postfix expression by utilizing a LinkedStack data structure.

Language: Java - Size: 4.88 KB - Last synced: about 1 year ago - Pushed: about 1 year ago - Stars: 0 - Forks: 0

mohamedhassan279/Expression-Evaluator

Java application uses stack data structure to convert infix notation to postfix and evaluate it.

Language: Java - Size: 4.88 KB - Last synced: about 1 year ago - Pushed: over 1 year ago - Stars: 0 - Forks: 1

TerminalBear/postfixEvaluator

A program to implement the algorithm for evaluating postfix expressions that involve integers with more than one digit and the integer operations +, -, *, /, %. Displays each token as it is encountered and displays the action of each stack operation to trace the action of postfix evaluation.

Language: C++ - Size: 5.86 KB - Last synced: 6 months ago - Pushed: over 1 year ago - Stars: 0 - Forks: 0

senavs/MathExpressionCompiler

:heavy_check_mark: Functions that show how compilers evaluate mathematical expressions

Language: Python - Size: 6.84 KB - Last synced: over 1 year ago - Pushed: almost 5 years ago - Stars: 2 - Forks: 0

Sabretooth1405/calculator

Calculator

Language: JavaScript - Size: 6.84 KB - Last synced: 4 months ago - Pushed: 4 months ago - Stars: 0 - Forks: 0

ShaanCoding/Boolean-Expression-Solver

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

Language: C# - Size: 83 KB - Last synced: over 1 year ago - Pushed: over 4 years ago - Stars: 3 - Forks: 2

Siddharthj2002/Postfix-Evaluator

An evaluator for postfix expressions. The evaluator is stack-based, and capable of evaluating correctly formed but otherwise arbitrary arithmetic expressions on integers. The implementation of the stack is done using linked lists.

Language: Java - Size: 336 KB - Last synced: 11 months ago - Pushed: about 3 years ago - Stars: 0 - Forks: 0

hussainmansour/EvaluatorExpressions

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

Language: Java - Size: 17.6 KB - Last synced: over 1 year ago - Pushed: over 1 year ago - Stars: 0 - Forks: 0

MahmoudGoda2003/Expression_Evaluator

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

Language: Java - Size: 165 KB - Last synced: about 1 year ago - Pushed: over 1 year ago - Stars: 0 - Forks: 0

SAZZAD-AMT/Infix-to-Prefix-to-Postfix-Conversion-Assembly-code-by-c-program

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.

Language: C++ - Size: 433 KB - Last synced: about 1 year ago - Pushed: over 2 years ago - Stars: 3 - Forks: 0