Download to read offline
![/* Write a C program that uses Stack operations to perform the following:
i) Converting infix expression into postfix expression
ii) Evaluating the postfix expression */
#include<stdio.h>
#include<conio.h>
int st[100];
int st_top=-1;
int cal(char post[]);
void in_post(char in[]);
void push_item(int it);
int pop_item();
int st_ISP(char t);
int st_ICP(char t);
/*main function*/
void main()
{
char in[100],post[100];
clrscr();
printf("ntEnter the Infix Expression: ");
gets(in);](https://image.slidesharecdn.com/6846220/75/week-17x-1-2048.jpg)
![in_post(in);
getch();
}
/*end main*/
void push_item(int it)
{
if(st_top==99)
{
printf("nnt*STACK is Full*");
getch();
exit(1);
}
st[++st_top]=it;
}
int pop_item()
{
int it;
if(st_top==-1)
{
getch();
}
return(st[st_top--]);](https://image.slidesharecdn.com/6846220/75/week-17x-2-2048.jpg)
![}
/*Function for converting an infix expression to a postfix expression. */
void in_post(char in[])
{
int x=0,y=0,z,result=0;
char a,c, post[100];
char t;
push_item('0');
t=in[x];
while(t!='0')
{
if(isalnum(t))
/*For checking whether the value in t is an alphabet or number. */
{
post[y]=t;
y++;
}
else if(t=='(')
{
push_item('(');
}
else if(t==')')
{](https://image.slidesharecdn.com/6846220/75/week-17x-3-2048.jpg)
![while(st[st_top]!='(')
{
c=pop_item();
post[y]=c;
y++;
}
c=pop_item();
}
else
{
while(st_ISP(st[st_top])>=st_ICP(t))
{
c=pop_item();
post[y]=c;
y++;
}
push_item(t);
}
x++;
t=in[x];
}
while(st_top!=-1)
{](https://image.slidesharecdn.com/6846220/75/week-17x-4-2048.jpg)
![c=pop_item();
post[y]=c;
y++;
}
printf("ntThe Postfix Expression is:");
for(z=0;z<y;z++)
printf("%c",post[z]);
printf("nnDo you want to evaluate the Result of Postfix Expression?(Y/N):");
scanf("%c",&a);
if(a=='y' || a=='Y')
{
result=cal(post);
printf("nntResult is: %dn",result);
getch();
}
else if(a=='n' || a=='N')
{
exit(0);
}
}
/*Determining priority of inside elements*/
int st_ISP(char t)](https://image.slidesharecdn.com/6846220/75/week-17x-5-2048.jpg)
![case '+':return (7);
case '-':return (7);
case '*':return (8);
case '/':return (8);
case '0':return (0);
default: printf("Expression is invalid.");
break;
}
return 0;
}
/*Evaluating the result of postfix expression*/
int cal(char post[])
{
int m,n,x,y,j=0,len;
len=strlen(post);
while(j<len)
{
if(isdigit(post[j]))
{
x=post[j]-'0';
push_item(x);
}
else](https://image.slidesharecdn.com/6846220/75/week-17x-7-2048.jpg)
![{
m=pop_item();
n=pop_item();
switch(post[j])
{
case '+':x=n+m;
break;
case '-':x=n-m;
break;
case '*':x=n*m;
break;
case '/':x=n/m;
break;
}
push_item(x);
}
j++;
}
if(st_top>0)
{
printf("Number of Operands are more than Operators.");
exit(0);
}](https://image.slidesharecdn.com/6846220/75/week-17x-8-2048.jpg)
Uploaded byKITE www.kitecolleges.com
week-17x
This C program uses stack operations to perform two tasks: 1) Convert an infix expression to a postfix expression by pushing and popping operators and operands to a stack. 2) Evaluate the postfix expression by pushing operands, popping operands and operators, and performing operations. It includes functions to push and pop from the stack, determine operator precedence, convert expressions, and evaluate the postfix form.
More Related Content
week-17x
- 1. /* Write aC program that uses Stack operations to perform the following: i) Converting infix expression into postfix expression ii) Evaluating the postfix expression */ #include<stdio.h> #include<conio.h> int st[100]; int st_top=-1; int cal(char post[]); void in_post(char in[]); void push_item(int it); int pop_item(); int st_ISP(char t); int st_ICP(char t); /*main function*/ void main() { char in[100],post[100]; clrscr(); printf("ntEnter the Infix Expression: "); gets(in);
- 2. in_post(in); getch(); } /*end main*/ void push_item(int it) { if(st_top==99) { printf("nnt*STACK is Full*"); getch(); exit(1); } st[++st_top]=it; } int pop_item() { int it; if(st_top==-1) { getch(); } return(st[st_top--]);
- 3. } /*Function for convertingan infix expression to a postfix expression. */ void in_post(char in[]) { int x=0,y=0,z,result=0; char a,c, post[100]; char t; push_item('0'); t=in[x]; while(t!='0') { if(isalnum(t)) /*For checking whether the value in t is an alphabet or number. */ { post[y]=t; y++; } else if(t=='(') { push_item('('); } else if(t==')') {
- 4. while(st[st_top]!='(') { c=pop_item(); post[y]=c; y++; } c=pop_item(); } else { while(st_ISP(st[st_top])>=st_ICP(t)) { c=pop_item(); post[y]=c; y++; } push_item(t); } x++; t=in[x]; } while(st_top!=-1) {
- 5. c=pop_item(); post[y]=c; y++; } printf("ntThe Postfix Expression is:"); for(z=0;z<y;z++) printf("%c",post[z]); printf("nnDo you want to evaluate the Result of Postfix Expression?(Y/N):"); scanf("%c",&a); if(a=='y' || a=='Y') { result=cal(post); printf("nntResult is: %dn",result); getch(); } else if(a=='n' || a=='N') { exit(0); } } /*Determining priority of inside elements*/ int st_ISP(char t)
- 6. { switch(t) { case '(':return (10); case ')':return (9); case '+':return (7); case '-':return (7); case '*':return (8); case '/':return (8); case '0':return (0); default: printf("Expression is invalid."); break; } return 0; } /*Determining priority of approaching elements*/ int st_ICP(char t) { switch(t) { case '(':return (10); case ')':return (9);
- 7. case '+':return (7); case '-':return (7); case '*':return (8); case '/':return (8); case '0':return (0); default: printf("Expression is invalid."); break; } return 0; } /*Evaluating the result of postfix expression*/ int cal(char post[]) { int m,n,x,y,j=0,len; len=strlen(post); while(j<len) { if(isdigit(post[j])) { x=post[j]-'0'; push_item(x); } else
- 8. { m=pop_item(); n=pop_item(); switch(post[j]) { case '+':x=n+m; break; case '-':x=n-m; break; case '*':x=n*m; break; case '/':x=n/m; break; } push_item(x); } j++; } if(st_top>0) { printf("Number of Operands are more than Operators."); exit(0); }
- 9. else { y=pop_item(); return (y); } return 0; }