Infix to Postfix

-

Program

#include<iostream>
#include<conio.h>
#include<stdio.h>
using namespace std;
#define MAX 100
class stack{
 int top;
 char infix[MAX],postfix[MAX],s[MAX];
 public:
  stack()
  {
  top=-1;
}
  void read();
  char Push(char);
  char Pop();
  int conversion();
  char Prioity(char);
  void display();
};
char stack::Push(char a){
 if(top>MAX)
 cout<"STACK is over flow";
 else{
  top++;
  s[top]=a;
 }
}
char stack::Pop(){
 char item;
 if(top==-1)
    {
       cout<<"\n Stack is under flow"<<endl;
    }
    else
    { item=s[top];
     top--;
     return item;
}
}
char stack::Prioity(char x){
 switch(x){
     case'(':
  return 0;
  case'+':
  return 1;
  case'-':
  return 1;
  case'*':
  return 2;
  case'/':
  return 2;
}
}
int stack::conversion(){
 int k=0,i;char sp;
 for(i=0;infix[i]!='\0';i++&&k++)
 {
 if(infix[i]>='0'&&infix[i]<='9')
 postfix[k]=infix[i];
 else if(infix[i]>='A'&&infix[i]<='Z')
 postfix[k]=infix[i];
 else if(infix[i]>='a'&&infix[i]<='z')
 postfix[k]=infix[i];
 else if(infix[i]=='(')
 Push(infix[i]);
 else if(infix[i]==')'){
  while(sp=Pop()!='('){
   infix[i]=sp;}}
 else{
  while(top!=-1)
  {
   while(Prioity(infix[i])<=Prioity(sp=Pop())){
   postfix[k]=sp;
   }
}
   //if(Prioity(infix[i])>Prioity(sp)){
   Push(sp);
   Push(infix[i]);
   //}
  }
}
 while(top!=-1){
  sp=Pop();
  postfix[k]=sp;
  k++;}
 postfix[k-1]='\0';
 //for(i=0;postfix[i]='\0';i++)
  cout<<"Expression in Postfix :"<<postfix;
}
/*void stack::display(){
 for(int i=1;postfix[i]='\0';i++)
  cout<<"Expression in Postfix :"<<postfix[i];
 }*/

void stack::read(){
 cout<<"Enter expression in postfix:";
 cin>>infix;
 //cout<<"Expression in Postfix :"<<infix;
}
int main(){
 stack s;
 s.read();
 s.conversion();
// s.display();
}

Comments

Post a Comment

Popular posts from this blog

Stack

-
Image
Program #include<iostream> using namespace std; struct node { int data; node *next; }; class ListStack{ node *head; public: ListStack() { head=NULL; } void push(int info) { node *NewNode=new node; NewNode->data=info; NewNode->next=head; head=NewNode; } int pop() { if(IsEmpty()) { cout<<"Underflow occurs "; return NULL; } int info; node *cur=head; info=head->data; head=head->next; delete cur;             return info; } int IsEmpty() { if(head==NULL) return 1; return 0; } }; int main() { ListStack s; s.push(20); cout<<s.pop(); cout<<s.pop(); }
Read more

Operation on Single Linked List

-
Image
Program /*  * C++ Program to Implement Singly Linked List  */ #include<iostream> #include<cstdio> #include<cstdlib> using namespace std; /*  * Node Declaration  */ struct node {     int info;     struct node *next; }*start; /*  * Class Declaration  */ class single_llist {     public:         node* create_node(int);         void insert_begin();         void insert_pos();         void insert_last();         void delete_pos();         void sort();         void search();         void update();         void reverse();         void display();         single_llist()         {             start = NULL;   ...
Read more

EXTRA INFORMATION ABOUT TECHNOLOGY

-
Image
Here are some more things from which you should know about them. There are many things but you should know about some of them Firstly I would like to give you information about  GLOBAL VILLAGE: In this Century,  the World has become a Global Village.  You are a thing about the above sentence that HOW THE WORLD HAS BECAME A GLOBAL VILLAGE? Yeah, It is the reality. You can see that within a seconds or minutes we can contact every person from the world by using some Social Media Sites excepting those which we know or we don't know.  Some Social Media Sites are: FACEBOOK TWITTER SKYPE IMO INSTAGRAM WHATS APP YOUTUBE THROUGH E-MAIL AND MUCH MORE SITES ARE AVAILABLE IN THE MARKET               If you want to get an extra information about Technology then you must check our YouTube Channel's Link and directly go to the COLLEGE OF INFORMATION    ...
Read more