-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinfixtopost.c
121 lines (105 loc) · 2.17 KB
/
infixtopost.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <stdio.h>
#define max 100
char ar[max];
int top=0;
int isfull()
{
if(top==max)
return 1;
else
return 0;
}
int isempty()
{
if(top==0)
return 1;
else
return 0;
}
void push(char c)
{
if(!isfull())
ar[top++]=c;
}
void displaystack()
{
int i;
printf("\t stack: ");
for(i=0;i<top;i++)
printf("%c",ar[i]);
}
void displaypost(char a[],int k)
{
int i;
printf("\t postfix: ");
for(i=0;i<k;i++)
printf("%c",a[i]);
}
char peek()
{
return(ar[top-1]);
}
char pop()
{
return(ar[--top]);
}
int intopre(char c)
{
switch(c)
{
case '-':
case '+':return(1);break;
case '*':
case '/':return(3);break;
case '^':return(6);break;
}
}
int topre(char c)
{
switch(c)
{
case '-':
case '+':return(2);break;
case '*':
case '/':return(4);break;
case '^':return(5);break;
case '(':return(0);break;
}
}
int main()
{
int i,j=0;
char ex[50],post[50],token ,c;
printf("enter the infix expression888888");
scanf("%[^\n]",ex);
for(i=0;ex[i]!='\0';i++)
{
token = ex[i];
switch(token)
{
case '(': push(token);break;
case ')':
while((c =pop())!='(')
post[j++]=c;
break;
case '-':
case '+':
case '*':
case '/':
case '^':
while(!isempty() && (topre(peek())>intopre(token)))
post[j++] = pop();
push(token);
break;
default :post[j++] = token;break;
}
printf("\ntoken :%c",token);
displaystack();
displaypost(post,j);
}
while(!isempty())
post[j++]=pop();
post[j] ='\0';
printf("\n postfix:%s\n", post);
return 0;
}