-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinfix to prefix1.c
100 lines (98 loc) · 1.24 KB
/
infix to prefix1.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
#include <stdio.h>
#include <conio.h>
#include <ctype.h>
#include <string.h>
#include <stdlib.h>
#define MAX 20
char stack[MAX];
int top=-1;
void push(char);
char pop();
int priority(char);
void main()
{
char exp[MAX],prefix[MAX];
char *ch,x;
int i=0;
printf("enter the infix expression=");
gets(exp);
strrev(exp);
ch=exp;
while(*ch!='\0')
{
if(isalnum(*ch))
{
prefix[i]=*ch;
i++;
}
else if(*ch==')')
{
push(*ch);
}
else if(*ch=='(')
{
while(x=pop()!=')')
{
prefix[i]=x;
i++;
}
}
else
{
while(priority(stack[top])>=priority(*ch))
{
prefix[i]=pop();
i++;
}
push(*ch);
}
ch++;
}
while(top!=-1)
{
prefix[i]=pop();
i++;
}
puts(strrev(prefix));//printf("%s",strrev(prefix));
}
int priority(char o)
{
if(o==')')
{
return 0;
}
if(o=='+'||o=='-')
{
return 1;
}
if(o=='*'||o=='/'||o=='%')
{
return 2;
}
}
void push(char c)
{
if(top==MAX-1)
{
printf("Stack Overflow");
}
else
{
top++;
stack[top]=c;
}
}
char pop()
{
char y;
if(top==-1)
{
printf("Stack underflow");
}
else
{
y=stack[top];
top--;
return y;
}
}