-
Notifications
You must be signed in to change notification settings - Fork 0
/
advanceinfixtopostfix.c
144 lines (119 loc) · 2.01 KB
/
advanceinfixtopostfix.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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct node{
char data;
struct node *next;
}*top=NULL;
void push(char x){
struct node *t=(struct node*)malloc(sizeof(struct node));
if(t==NULL)
printf("Stack Overflow");
else{
t->data=x;
t->next=top;
top=t;
}
}
int pop()
{
struct node *t;
char x=-1;
if(top==NULL)
printf("Stack underflow");
else{
t=top;
x=t->data;
top=top->next;
free(t);
}
return x;
}
void display()
{
struct node *p;
p=top;
while(p){
printf("%c",p->data);
p=p->next;
}
}
int isbalancedparenthesis(char *exp){
for(int i=0;exp[i]!='\0';i++)
{
if(exp[i]=='(')
push(exp[i]);
else if(exp[i]==')')
{
if(top==NULL)return 0;
pop();
}
}
if(top==NULL)
return 1;
else
return 0;
}
int pre(char x)
{
if(x=='+'||x=='-')
return 1;
else if(x=='*'||x=='/')
return 3;
else if(x==')')
return 0;
return 0;
}
int insidestack()
{
if(top==NULL)
return 0;
else if(top->data=='+'||top->data=='-')
return 2;
else if(top->data=='*'||top->data=='/')
return 4;
else if(top->data=='^')
return 5;
else if(top->data='(')
return 0;
else if(top==NULL)
return 0;
}
int isOperand(char x)
{
if(x=='+'||x=='-'||x=='*'||x=='/'||x=='^'||x=='('||x==')')
return 0;
else return 1;
}
char* intopost(char *infix){
char *postfix;
int len=strlen(infix);
postfix=(char*)malloc((len+2)*sizeof(char));
int i=0,j=0,flag=0;
while(infix[i]!='\0')
{
if(isOperand(infix[i]))
postfix[j++]=infix[i++];
else if(infix[i]=='(')
push(infix[i++]);
else if(pre(infix[i])>insidestack() && infix[i]!=')')
push(infix[i++]);
else
{
if(top->data=='(')
{pop();
i++;}
else
postfix[j++]=pop();
}}
while(top!=NULL)
postfix[j++]=pop();
postfix[j]='\0';
return postfix;
}
void main(){
char *infix="a+(b*c)/d-e";
char *postfix=intopost(infix);
printf("%s",postfix);
}
//brackets have highest parenthesis