-
Notifications
You must be signed in to change notification settings - Fork 0
/
postfix.c
366 lines (358 loc) · 7.07 KB
/
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
#include<string.h>
#include"operandstack.h"
#include"integer.h"
#include"functions.h"
#define OPERATOR 100
#define OPERAND 200
#define END 300
#define ERROR 400
typedef struct token{
int type; // type takes values OPERAND/OPERATOR/END/
char *s;
char op;
}token;
char *postfix(char *str);
token *getnext(char *str, int *reset);
void print(char *str);
int quit(char *str);
int readline(char *arr, int len);
char * multiply(char a[],char b[]);
enum states {START, DIG, OP, STOP, ERR, SPC};
token *getnext(char *str, int *reset) {
static int i;
static int currstate;
int nextstate;
if(*reset == 1){
*reset = 0;
currstate = START;
i = 0;
}
token *t = (token *)malloc(sizeof(token));
t->s = (char *)malloc(1024);
char currchar, currop;
int j = 0;
while(1) {
currchar = str[i];
switch(currstate) {
case START:
switch(currchar) {
case '0': case '1': case '2':
case '3': case '4': case '5':
case '6': case '7': case '8':
case '9': case '.':
nextstate = DIG;
t->s[j] = currchar;
t->s[j + 1] = '\0';
j++;
break;
case '+': case '-': case '*':
case '/': case '%': case '^':
case '>': case '<': case '=':
nextstate = OP;
currop = currchar;
break;
case ' ': case '\t':
nextstate = SPC;
break;
case '\0':
nextstate = STOP;
t->type = END;
break;
default:
break; }
break;
case DIG:
switch(currchar) {
case '0': case '1': case '2':
case '3': case '4': case '5':
case '6': case '7': case '8':
case '9': case '.':
nextstate = DIG;
t->s[j] = currchar;
t->s[j + 1] = '\0';
j++;
break;
case '+': case '-': case '*':
case '/': case '%': case '^':
case '>': case '<': case '=':
nextstate = OP;
t->type = OPERAND;
i++;
currstate = nextstate;
return t;
break;
case ' ': case '\t':
nextstate = SPC;
t->type = OPERAND;
i++;
currstate = nextstate;
return t;
break;
case '\0':
nextstate = STOP;
t->type = OPERAND;
i++;
currstate = nextstate;
return t;
break;
default:
nextstate = ERR;
t->type = OPERAND;
i++;
currstate = nextstate;
return t;
break;
}
break;
case OP:
switch(currchar) {
case '0': case '1': case '2':
case '3': case '4': case '5':
case '6': case '7': case '8':
case '9': case '.':
nextstate = DIG;
currop = currchar;
t->s[j] = currchar;
t->s[j + 1] = '\0';
j++;
t->type = OPERATOR;
t->op = currop;
i++;
currstate = nextstate;
return t;
break;
case '+': case '-': case '*':
case '/': case '%': case '^':
case '>': case '<': case '=':
nextstate = OP;
t->type = OPERATOR;
t->op = currop;
currop = currchar;
i++;
currstate = nextstate;
return t;
break;
case ' ': case '\t':
nextstate = SPC;
t->type = OPERATOR;
t->op = currop;
i++;
currstate = nextstate;
return t;
break;
case '\0':
nextstate = STOP;
t->type = OPERATOR;
t->op = currop;
i++;
currstate = nextstate;
return t;
break;
default:
nextstate = ERR;
t->type = OPERATOR;
t->op = currop;
i++;
currstate = nextstate;
return t;
break;
}
break;
case SPC:
switch(currchar) {
case '0': case '1': case '2':
case '3': case '4': case '5':
case '6': case '7': case '8':
case '9': case '.':
nextstate = DIG;
t->s[j] = currchar;
t->s[j + 1] = '\0';
j++;
break;
case '+': case '-': case '*':
case '/': case '%': case '^':
case '>': case '<': case '=':
nextstate = OP;
currop = currchar;
break;
case ' ': case '\t':
nextstate = SPC;
break;
case '\0':
nextstate = STOP;
break;
default:
nextstate = ERR;
break;
}
break;
case STOP:
t->type = END;
return t;
break;
case ERR:
t->type = ERROR;
return t;
break;
}
currstate = nextstate;
i++;
}
}
//int main(int argc, char *argv[]) {
void bc() {
char *str, *ans;
str = (char *)malloc(1024);
int x, i, qut, clr;
while((x = readline(str, 1024))) {
qut = quit(str);
if(qut == 0) {
free(str);
return ;
}
ans = postfix(str);
if(ans == NULL)
fprintf(stderr, "Error in Expression\n");
else
print(ans);
}
free(str);
return ;
}
int readline(char *arr, int len) {
int i = 0;
//static int j = 0;
char ch;
/*if(j == 0) {
ch = getchar();
}*/
while((ch = getchar()) != '\n') {
arr[i] = ch;
i++;
}
/*Need to add the null character at the end to make it a string
*/
arr[i] = '\0';
//j++;
return i;
}
void print(char *s){
printf(">>%s\n",s);
}
int quit(char *s){
if(strcmp(s, "quit") == 0)
return 0;
else
return 1;
}
char *postfix(char *str) {
token *t;
char *x, *y;
char *result;
int k;
stack a;
init(&a);
int reset = 1;
while(1) {
t = getnext(str, &reset);
/*if(t->type == END)
break;
if(t->type == ERROR)
return NULL;
if(t->type == OPERAND) {
print(t->s);
result = t->s;
}
if(t->type == OPERATOR)
printf("%c\n", t->op);
*/
if(t->type == OPERAND) {
push(&a, t->s);
//print(t.s);
}
else if (t->type == OPERATOR) {
if(!isempty(&a))
x = pop(&a);
else
return NULL;
if(!isempty(&a))
y = pop(&a);
else
return NULL;
//result = calc(y, x, t->op);
switch(t->op) {
case '+':
result = realadd(x, y);
break;
case '-':
result = realsub(y, x);
break;
case '*':
result = realmult(x, y);
break;
case '/':
result = realdiv(x, y);
break;
case '^' :
result = power(y, x);
break;
case '>' : case '<' : case '=' :
result = realcomp(x, y, t->op);
}
if(strcmp(result, "undefined") == 0)
return "undefined";
if(result != NULL)
push(&a, result);
else
return NULL;
}
else if (t->type == ERROR)
return NULL;
else {
if(!isempty(&a))
result = pop(&a);
else
return NULL;
if(isempty(&a))
return result;
else
return NULL;
}
}
return result;
}
/*For Postfix evaluator run using ./project -postfix
*For Scientific Functions run using ./project -functions
*/
int main(int argc, char *argv[]) {
//char opt[30];
/*while(1) {
printf("For postfix evaluator type postfix\nFor scientific functions type functions\nTo Exit type exit\n");
scanf("%s", opt);
if(strcmp(opt, "postfix") == 0)
bc();
if(strcmp(opt, "functions") == 0) {
while(1)
functions();
}
if(strcmp(opt, "exit") == 0)
exit(0);
}
printf("Wrong Option\n");*/
if(argc != 2) {
fprintf(stderr, "Error\n use -p or -f \n");
exit(0);
}
if(strcmp(argv[1], "-p") == 0)
bc();
else if(strcmp(argv[1], "-f") == 0)
while(1)
functions();
else {
printf("Use ./project -p for postfix evaluator\nUse ./project -f for scientific functions\n");
}
return 0;
}