Skip to main content

Postfix to Prefix conversion

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

Algorithm to convert Postfix expression to Prefix 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 = (operator)+(poped_sym2)+(poped_sym1)
      • push the string STR into stack
    • Else
      • push the operand symb into stack
    • End If
  • End While
  • prefix_str = pop the stack


 

Function to convert Postfix Expression to Prefix Expression:


void postfix_to_prefix(char postfix[], char prefix[]){
 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, op);
   strcat(temp, poped2);
   strcat(temp, poped1);
   push(temp);
  }
  else{
   op[0] = postfix[i];//operand
   push(op);
  }
 }
 pop(prefix);
}
 

Program to convert Postfix Expression to Prefix 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_prefix(char postfix[], char prefix[]){
 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, op);
   strcat(temp, poped2);
   strcat(temp, poped1);
   push(temp);
  }
  else{
   op[0] = postfix[i];//operand
   push(op);
  }
 }
 pop(prefix);
}

int main(){
 char postfix[] = "AB^C*D-EF/GH+/+"; //PREFIX : +-*^ABCD//EF+GH
 char prefix[MAX];
 postfix_to_prefix(postfix,prefix);
 printf("Input Postfix Expression : %s\n",postfix);
 printf("Output Prefix Expression : %s\n",prefix);
 
 return 0;
}
 
Input Postfix Expression : AB^C*D-EF/GH+/+
Output Prefix Expression : +-*^ABCD//EF+GH
 

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

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

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