Skip to main content

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*/ );
  }
  else{
   op2 = pop(&stk); // first poped number will be used as 2nd operand
   op1 = pop(&stk);
   push( &stk, operation( poststr[i], op1, op2 ) );
  }
 }
 return pop( &stk ); //answer of evaluation
}
 

Program to Evaluate Postfix Expression:


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

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

double evaluate_postfix_exp(char *);
void push(STACK *, double );
double pop(STACK *);
int isdig(char);
double operation(char, double, double);

int main(){
 double answer;
 char *postfix_str = "1 2 + 3 ^ 4 *"; //108
 answer = evaluate_postfix_exp(postfix_str);
 printf("The answer of postfix expression \"%s\" =   %.2f", postfix_str, answer);
 return 0;
}

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*/ );
  }
  else{
   op2 = pop(&stk); // first poped number will be used as 2nd operand
   op1 = pop(&stk);
   push( &stk, operation( poststr[i], op1, op2 ) );
  }
 }
 return pop( &stk ); //answer of evaluation
}

int isdig(char c){ //whether the c is number
 return ( (c >= '0') && (c <= '9') );
}

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

double pop(STACK *s){
 if(s->top == -1){
  printf("Stack Underflow\n");
  exit(2);
 }
 else{
  return s->stack[s->top--];
 }
}

double operation(char c, double op1, double op2){
 switch(c){
  case '+' : return op1+op2;
  case '-' : return op1-op2;
  case '*' : return op1*op2;
  case '/' : return op1/op2;
  case '^' : return pow(op1, op2);
  default  : printf("Invalid operator %c used", c);
      exit(1);
 }
}
 
The answer of postfix expression "1 2 + 3 ^ 4 *" =   108.00
 

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

Prefix to Infix Conversion

With a given Prefix Expression, we will see how to convert Prefix Expression into Infix Expression using stack.   Algorithm to convert Prefix Expression to Infix Expression: In this algorithm, we will use stack to store operands during the conversion. The step are as follows: Read the prefix string While the end of prefix string scanned from right to left symb = the current character If symb is an operator poped_sym1 = pop the stack poped_sym2 = pop the stack concat the string  STR = ( poped_sym1 )+ ( operator )+( poped_sym2 ) 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 Prefix Expression to Infix Expression: void prefix_to_infix(char prefix[], char infix[]){ char op[2]; //operator string char poped1[MAX]; char poped2[MAX]; char temp[MAX]; int i = strlen(prefix); op[1] = '\0'; while(--i != -1){ if(prefix[i] == ' '){ continue; } if(isoper...
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