-
Notifications
You must be signed in to change notification settings - Fork 101
/
Copy pathInfix_to_Postfix.c
127 lines (124 loc) · 2.31 KB
/
Infix_to_Postfix.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
121
122
123
124
125
126
127
// Infix to postfix conversion program
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct stack{
int size;
int top;
char *array;
};
int isFull(struct stack *ptr)
{
if(ptr->top ==ptr->size-1)
{
printf("The stack is full\n");
return 1;
}else{
return 0;
}
}
int isEmpty(struct stack *ptr)
{
if(ptr->top ==-1)
{
printf("The stack is empty\n");
return 1;
}else{
return 0;
}
}
void push(struct stack *ptr,char value)
{
if(isFull(ptr))
{
printf("The element cannot be inserted as the stack is full\n");
}else{
ptr->top++;
ptr->array[ptr->top]=value;
}
}
char pop(struct stack *ptr)
{
if(isEmpty(ptr))
{
printf("The element cannot be popped as the stack is empty\n");
return '$';
}else{
char c;
c=ptr->array[ptr->top];
ptr->top--;
return c;
}
}
char stackTop(struct stack *ptr)
{
return ptr->array[ptr->top];
}
int operator(char a)
{
if(a =='+' || a=='-' || a=='*' || a=='/')
{
return 1;
}
else{
return 0;
}
}
int precedence(char a)
{
if(a== '*' || a=='/')
{
return 2;
}
if(a=='+' || a=='-')
{
return 1;
}
else{
return 0;
}
}
char * infixtopostfix(struct stack *s,char *infix)
{
char *postfix= (char *)malloc(strlen(infix)+1 * sizeof(char));
int i=0;
int j=0;
while(infix[i]!='\0')
{
if(!(operator(infix[i])))
{
postfix[j]=infix[i];
i++;
j++;
}
else{
if(precedence(infix[i]) > precedence(stackTop(s)))
{
push(s,infix[i]);
i++;
}else{
postfix[j]=pop(s);
j++;
}
}
} while(!isEmpty(s))
{
postfix[j]=pop(s);
j++;
}
postfix[j]='\0';
return postfix;
}
int main()
{
// struct stack *s=(struct stack *)malloc(sizeof(struct stack));
struct stack *s;
s->top=-1;
s->size=50;
s->array=(char *)malloc(s->size * sizeof(char));
char *infix;
// infix
infix= "x+y*z-k";
printf("The postfix of the infix expression is %s\n",infixtopostfix(s,infix));
return 0;
}