-
Notifications
You must be signed in to change notification settings - Fork 0
/
37_Infix_to_postfix.c
115 lines (99 loc) · 2.01 KB
/
37_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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Stack{
int size;
int top;
char *arr;
} stack;
int isEmpty(stack *ptr){
if (ptr->top == -1){
return 1;
}
else{
return 0;
}
}
int isFull(stack *ptr){
if(ptr->top == ptr->size-1){
return 1;
}
else{
return 0;
}
}
void push(stack * ptr, char val){
if(isFull(ptr)){
printf("Stack Overflow! Cannot push %d to the stack\n", val);
}
else{
ptr->top++;
ptr->arr[ptr->top]=val;
}
}
//Pop funtion to pop the elements from the stack
int pop(stack * ptr){
if(isEmpty(ptr)){
printf("Stack Underflow! Cannot pop to the stack\n");
}
else{
char val = ptr->arr[ptr->top];
ptr->top--;
return val;
}
}
int stackTop(stack* sp){
return sp->arr[sp->top];
}
int precedence(char ch){
if(ch=='*' || ch=='/')
return 3;
if(ch=='+' || ch=='-')
return 2;
else
return 0;
}
int isOperator(char ch){
if(ch=='*' || ch=='/' || ch=='+' || ch=='-')
return 1;
else
return 0;
}
char * infixToPostfix(char * infix){
stack * s = (stack*) malloc(sizeof(stack));
s->size = 100;
s->top = -1;
s->arr = (char*) malloc(s->size*sizeof(char));
char * postfix = (char*) malloc((strlen(infix)+1)*sizeof(char));
int i=0, j=0;
while (infix[i]!='\0')
{
if(!isOperator(infix[i])){
postfix[j] = infix[i];
j++;
i++;
}
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(){
char * infix = "a-b+c*d-p/q";
printf("The postfix is %s", infixToPostfix(infix));
return 0;
}