A Clojure library for expressing LISP expressions as infix rather than prefix notation

Personal design calculator 2015.12.12

✔️ Functions that show how compilers evaluate mathematical expressions

This is a simple program that converts infix expressions to postfix expressions. It is written in C and uses a stack to store the operators. It is a simple program that I wrote to show how to use a stack in C.

Document 100 hard level algorithm practice starting from summer 2018

Infix Expression Operations | Collaborated on this Project with @Jay9874

A simple C program to evaluate infix expression

Arm Assembly to solve math expressions

Converts infix expressions to prefix expressions in C.

Solution to CO203 data structures and algo. course

Algorithm python

This is a simple infix to postfix converter written in JavaScript. It is a simple project that I made to show other students how they can easily design this type of program and how they can use it to solve their problems.

Back from the college days, an implementation of arithmetic terms and their prefix, infix & postfix traverse

C program that reads an infix expression and converts it to a postfix one

This package hosts an array of frequently used regex validations and regex expression evaluation functionalities. In general, String check encompasses last word check, middle word check, first word check, sentence validation, phone number validation, name validation with or without honorific, password with both default parameter settings and cus…

Perform all type of arithmetic operations including infix-expression evaluation