VB icon

Infix 2 Postfix

Email
Submitted on: 1/1/2015 1:00:00 PM
By: Elmer Baluyo (from psc cd)  
Level: Beginner
User Rating: By 4 Users
Compatibility: C, C++ (general)
Views: 683
 
     It converts infix equation to postfix or reverse polish notation
 

INCLUDE files:

Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
//**************************************
//INCLUDE files for :Infix 2 Postfix
//**************************************
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <conio.h>
code:
Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
				
//**************************************
// Name: Infix 2 Postfix
// Description:It converts infix equation to postfix or reverse polish notation
// By: Elmer Baluyo (from psc cd)
//
// Returns:It shows the user what the postfix notation the entered equation and prints the answer to the screen.
//
// Assumes:It uses string input with a maximum length of 50 which can be changed by the programmer
//**************************************

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <conio.h>
#define MAX 50
int Stack[MAX];
int Top = 0;
void push (int x)
{
 if (Top<MAX)
Stack[Top++] = x;
}
int pop (void)
{
 if (Top>0)
 return Stack[--Top];
 return MAX;
}
void get_infix (char *infix)
{
 printf("\nEnter infix notation(max:%d\)->", MAX);
 scanf("%s",infix);
}
infix_2_postfix(char *infix, char *postfix)
{
 while (*infix) {
switch (*infix) {
case '+':
case '*':
 push (*infix);
 break;
case '(':
 break;
case ')':
 *postfix = (char) pop();
 postfix++;
 break;
default:
 *postfix = *infix;
 postfix++;
 break;
}
infix++;
 }
 while (Top) {
 *postfix = (char) pop();
 postfix++;
 }
 *postfix = '\0';
}
int eval (char *postfix)
{
int ans = 0;
 while (*postfix) {
 switch (*postfix) {
case '+': ans = (pop()-48) + (pop()-48); push(ans+48);
 break;
case '*': ans = (pop()-48) * (pop()-48); push(ans+48);
 break;
default:
 push(*postfix);
 break;
}
 postfix++;
 }
 return ans;
}
void main(void)
{
int i;
char infix[MAX], postfix[MAX];
 get_infix(infix);
 infix_2_postfix(infix, postfix);
 printf("\n %s%s = %d", infix, postfix, eval(postfix));
}


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Beginner category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)
 

Other User Comments


 There are no comments on this submission.
 

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)
 

To post feedback, first please login.