Create infix_to_postfix_using_stack.cpp

infix_to_postfix_using_stack.cpp

@@ -0,0 +1,95 @@
+#include <bits/stdc++.h>
+using namespace std;
+char sta[100];
+int top=-1;
+void push(char s){
+    if(top>=99){
+        cout<<"OverFlow";
+    }
+    else{
+        top++;
+        sta[top]=s;
+    }
+}
+char pop(){
+    char s;
+    if(top==-1){
+        cout<<"Underflow";
+        exit(1);
+    }
+    else{
+    s=sta[top];
+    top--;
+    return s;
+    }
+}
+int isOperator(char sym){
+    if(sym =='/'||sym =='+'||sym =='-'||sym =='^'||sym =='*'){
+        return 1;
+    }
+    return 0;
+}
+int Precedence(char sym){
+    if(sym=='^'){
+        return 3;
+    }
+    else if(sym=='/'||sym=='*'){
+        return 2;
+    }
+    else if(sym=='+'||sym=='-'){
+        return 1;
+    }
+    else
+        return 0;
+}
+void convert(char infix[],char postfix[]){
+    int i=0,j=0;
+    char x,rem;
+    push('(');
+    strcat(infix,")");
+    x=infix[i];
+    while(x!='\0'){
+
+        if(x=='('){
+            push(x);   
+        }
+        else if(isOperator(x)){
+            rem=pop();
+            if( (isOperator(x)) && (Precedence(x)<=Precedence(rem))){
+               postfix[j]=rem;
+                j++;
+                rem=pop();
+            }
+            push(rem);
+            push(x);
+        }
+        else if(isalpha(x)||isdigit(x)){
+            postfix[j]=x;
+            j++;
+        }
+        else if(x==')'){
+            rem=pop();
+            while(rem!='('){
+
+                postfix[j]=rem;
+                j++;
+                rem=pop();
+            }
+        }
+        i++;
+        x=infix[i];
+    }
+    if(top>-1){
+        cout<<"ERROR";
+    }
+    postfix[j]='\0';
+}
+int main(){
+    char infix[100],postfix[100];
+    cout<<"Enter the infix expression:";
+    cin>>infix;
+    convert(infix,postfix);
+    cout<<"The postfix Expression is:";
+    cout<<postfix;
+    return 0;
+}