Skip to main content

Infix to Postfix Expression Conversion

With a given Infix Expression, we will see how to convert Infix Expression into Postfix Expression using stack.
 

Algorithm to convert Infix expression to Postfix expression:

In this algorithm, we will use operatorStack to store operators during the conversion. The step are as follows:
  • Initialize empty operatorStack
  • While the end of input infix string
    • symbol = next input character
    • If symbol is an operand
      • add symbol to the postfix string
    • Else
      • While( operatorStack is not empty && precedence of top character of operatorStack is higher than symbol)
        • topsymbol = pop the operatorStack
        • add topsymbol to the postfix string
      • End While
      • If (operatorStack is empty || symbol is not equal to '(' )
        • push symbol into operatorStack
      • Else
        • pop the operatorStack
      • End If
    • End If
    • While the operatorStack is not empty
      • topsymbol = pop the operatorStack
      • add topsymbol to the postfix string
    • End While
 


 

Function to convert Infix expression to Postfix expression:


void infix_to_postfix(char *infix_str, char *postfix_str){
 int i = -1, j = -1;
 STACK stk;
 stk.top = -1;
 while(infix_str[++i]){
  if(infix_str[i] == ' '){
   continue;
  }
  if( ischar(infix_str[i]) ){
   postfix_str[++j] = infix_str[i];
  }
  else{
   while( !empty_stack(&stk) && precedence( top_of_stack(&stk), infix_str[i]) ){
   postfix_str[++j] = pop(&stk);
   }
   if(empty_stack(&stk) || infix_str[i] != ')'){
    push(&stk,infix_str[i]);
   }
   else{
    pop(&stk);
   }
  }
 }
 while(!empty_stack(&stk)){
  postfix_str[++j] = pop(&stk);
 }
 postfix_str[++j] = '\0';
}
 

Program to convert Infix expression to Postfix expression:


#include <stdio.h>
#include <stdlib.h>
#define STACK_SIZE 50

typedef struct{
 int top;
 char stack[STACK_SIZE];
} STACK;

void push(STACK *, char );
char pop(STACK *);
void infix_to_postfix(char *, char*);
char top_of_stack(STACK *);
int ischar(char );
int empty_stack(STACK*);
int precedence(char,char);

int main(){
 char *infix_str = "A+(B*C)/D";
 char postfix_str[100];
 infix_to_postfix(infix_str, postfix_str);
 printf("Infix Expression   : %s\n", infix_str);
 printf("Postfix Expression : %s\n", postfix_str);
 return 0;
}

// return true when op1 has higher precedence over op2
int precedence(char op1, char op2){ 
 char *sym = "/*+-";
 int i1 = -1, i2 = -1,i = -1;
 if(op1 == '(')
  return 0;
 if(op2 == '('){
  if(op1 != ')')
   return 0;
  return 1;
 }
 if(op2 == ')'){
  if(op1 != '(')
   return 1;
  return 0;
 }
 if(op1 == ')')
  exit(1);
 while(sym[++i]){
  if(op1 == sym[i])
   i1 = i;
  if(op2 == sym[i])
   i2 = i;
 }
 return i1 < i2;
}

void infix_to_postfix(char *infix_str, char *postfix_str){
 int i = -1, j = -1;
 STACK stk;
 stk.top = -1;
 while(infix_str[++i]){
  if(infix_str[i] == ' '){
   continue;
  }
  if( ischar(infix_str[i]) ){
   postfix_str[++j] = infix_str[i];
  }
  else{
   while( !empty_stack(&stk) && precedence( top_of_stack(&stk), infix_str[i]) ){
   postfix_str[++j] = pop(&stk);
   }
   if(empty_stack(&stk) || infix_str[i] != ')'){
    push(&stk,infix_str[i]);
   }
   else{
    pop(&stk);
   }
  }
 }
 while(!empty_stack(&stk)){
  postfix_str[++j] = pop(&stk);
 }
 postfix_str[++j] = '\0';
}


char top_of_stack(STACK *s){
 return s->stack[s->top];
}

int empty_stack(STACK *stk){
 return stk->top == -1;
}

int ischar(char c){
 return  ( (c >= 'a') && (c <= 'z') ) || 
   ( (c >= 'A') && (c <= 'Z') ) || 
   ( (c >= '0') && (c <= '9') );
}

void push(STACK *s, char c){
 if(s->top == STACK_SIZE-1){
  printf("Stack Overflow\n");
  exit(1);
 }
 else{
  s->stack[++s->top] = c;
 }
}

char pop(STACK *s){
 if(s->top == -1){
  printf("Stack Underflow\n");
  exit(1);
 }
 else{
  return s->stack[s->top--];
 }
}
 
Infix Expression   : A+(B*C)/D
Postfix Expression : ABC*D/+
 

Related topics:

Labels:

Comments

Post a Comment

Popular posts from this blog

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

Deletion of node at specific position N in circular link list

Now we will see how to delete node at position 'N' in circular link list. Algorithm to delete node at position 'N' in circular link list: In this algorithm, TAIL points to last node of the link list and POS is position where the new node to be deleted. The steps are as follows: Initialize TEMP and TEMP2 If list have no node or position is less than one  (TAIL == NULL or POS < 1) Node cannot be deleted Else If (POS == 1) If list have one node   (TAIL->NEXT == TAIL) Delete TAIL   (TAIL = NULL) Else Delete the first node   (TAIL->NEXT = TAIL->NEXT->NEXT) End If; Else Set TEMP = TAIL->NEXT   (TEMP now points to first node) Traverse the list for (POS-1)th node using TEMP If node to be deleted is last node i.e. (TEMP->NEXT == TAIL) Set TAIL = TEMP End If; Set TEMP->NEXT = TEMP->NEXT->NEXT End If; End If;     Function to delete node at position 'N' in circular link list: int deleteAtPosition(NODE **tail, ...
Post a Comment
Read more

Deletion of first node in circular link list

Deletion of first node from the circular link list requires that the list has at least one node. It is error to delete a node doesn't exist. In this process, last node's next pointer is updated to point to second node of the list. Now we will see the algorithm to delete node at first position in circular link list. Algorithm to delete first node in circular link list: The algorithm uses TAIL as pointer to the last node of circular list and TEMP is temporary pointer that help in deletion process. The steps are as follows: Declare TEMP If list have only one node FREE (TAIL) TAIL = NULL Else TEMP = TAIL->NEXT  [TEMP will point to first node] TAIL->NEXT = TAIL->NEXT->NEXT [TAIL's next will now point to second node] Free (TEMP) [free the first node] End If; Function to delete node at first position in circular link list: The function takes pointer to last node as input and return info part of the list if no error occur, otherwise returns -1 after printi...
Post a Comment
Read more