/* Infix to Postfix then Evaluation Using Stack Data Structure */ #include #include #include using namespace std; // Verify whether a character is numeric digit or not. bool IsNumber(char C) { if(C >= '0' && C <= '9') return true; else return false; } // Verify whether a character is operator symbol or not. bool IsOperator(char C) { if(C == '+' || C == '-' || C == '*' || C == '/' || C == '^' || C == '(' || C == ')') return true; else return false; } // Get weight of an operator. int GetWeight(char op){ switch(op) { case '^': // square operator return 3; break; case '*': case '/': return 2; break; case '+': case '-': return 1; break; default: return 0; break; } } // Operation of precidence condition int HighPrecedence(char op1, char op2) { if(GetWeight(op1) <= GetWeight(op2)) return true; else return false; } // Postfix expression Converter void expressionToPostfix(char expression[], char postfix[], int size) { stack S; int i=0, k=0; // insert & print into stack & postfix until expression length is empty while(i S; for(int i=0; i>expression; //declare size of expression & postfix variable int size = strlen(expression); char postfix[size]; //call and print expression to postfix expressionToPostfix(expression, postfix, size); cout<<"\nThe Postfix Expression is : "<

infix to postfix evaluation