Skip to main content

Postfix to Infix Conversion

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

Algorithm to convert Postfix expression to Infix expression:

In this algorithm, we will use stack to store operands during the conversion. The step are as follows:
  • Read the postfix string
  • While the end of postfix string
    • symb = the current character
    • If symb is an operator
      • poped_sym1 = pop the stack
      • poped_sym2 = pop the stack
      • concat the string  STR = (poped_sym2)+(operator)+(poped_sym1)
      • push the string STR into stack
    • Else
      • push the operand symb into stack
    • End If
  • End While
  • infix_str = pop the stack


 

Function to convert Postfix expression to Infix expression:


void postfix_to_infix(char postfix[], char infix[]){
 char op[2]; //operator string
 char poped1[MAX];
 char poped2[MAX];
 char temp[MAX];
 int i = -1;
 op[1] = '\0';
 while(postfix[++i]){
  if(postfix[i] == ' '){
   continue;
  }
  if(isoperator(postfix[i])){
   pop(poped1);
   pop(poped2);
   op[0] = postfix[i]; //operator
   
   strcpy(temp, poped2);
   strcat(temp, op);
   strcat(temp, poped1);
   push(temp);
  }
  else{
   op[0] = postfix[i];//operand
   push(op);
  }
 }
 pop(infix);
}
 

Program to convert Postfix expression to Infix expression:


#include <stdio.h>
#include <string.h>
#define MAX 30

char stack[MAX][MAX];
int top = -1;

void push(char str[]){
 if(top != MAX-1){
  strcpy(stack[++top], str);
 }
 else{
  printf("Stack overflow : May be invalid postfix expression\n");
 }
}

void pop(char str[]){
 if(top != -1){
  strcpy(str,stack[top--]);
 }
 else{
  printf("Stack underflow : May be invalid postfix expression\n");
 }
}

int isoperator(char c){
 if(c == '+' || c == '-' || c == '*' || c == '/' || c == '^')
  return 1;
 return 0;
}

void postfix_to_infix(char postfix[], char infix[]){
 char op[2]; //operator string
 char poped1[MAX];
 char poped2[MAX];
 char temp[MAX];
 int i = -1;
 op[1] = '\0';
 while(postfix[++i]){
  if(postfix[i] == ' '){
   continue;
  }
  if(isoperator(postfix[i])){
   pop(poped1);
   pop(poped2);
   op[0] = postfix[i]; //operator
   
   strcpy(temp, poped2);
   strcat(temp, op);
   strcat(temp, poped1);
   push(temp);
  }
  else{
   op[0] = postfix[i];//operand
   push(op);
  }
 }
 pop(infix);
}

int main(){
 char postfix[] = "AB^C*D-EF/GH+/+"; //INFIX : +-*^ABCD//EF+GH
 char infix[MAX];
 postfix_to_infix(postfix,infix);
 printf("Input Postfix Expression : %s\n",postfix);
 printf("Output  Infix Expression : %s\n",infix);
 
 return 0;
}
 
Input Postfix Expression : AB^C*D-EF/GH+/+
Output  Infix Expression : A^B*C-D+E/F/G+H
 

Related topics:

Labels:

Comments

Post a Comment

Popular posts from this blog

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

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

Postfix Expression Evaluation

With a given Postfix Expression, we will show you how to evaluate a postfix expression using stack.   Algorithm to evaluate postfix expression: In this algorithm, we will use stack to store operands. The step are as follows: Get the Postfix Expression String While the end of Postfix Expression string If the current character is operand Push it into Stack End If If the current character is operator Pop stack for second_operand Pop stack for first_operand Evaluate the expression (first_operand)(operator)(second_operand) and push the result into stack End If End While Pop stack for result and return it       Function to Evaluate Postfix Expression: double evaluate_postfix_exp(char *poststr){ STACK stk; //stack for pushing operands int i = -1; double op1, op2; stk.top = -1; //top of stack while(poststr[++i]){ if(poststr[i] == ' '){ //escape space continue; } if(isdig(poststr[i])){ push( &stk, (double)(poststr[i]-'0')/*char to int...
Post a Comment
Read more