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

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SAZZAD-AMT%2FInfix-to-Prefix-to-Postfix-Conversion-Assembly-code-by-c-program

Topics: conversion, converter, infix, infix-evaluation, infix-notation, infix-to-postfix, infix-to-prefix, infixtopostfix, infixtopostfix-expression, infixtoprefix, postfix-evaluation

Files

No dependencies found