-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexpr.c
486 lines (458 loc) · 13.6 KB
/
expr.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
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
/*
* Project: IFJ16, a programming language interpreter
* FIT VUT Brno
* Authors: xzaryb00 - Zarybnický Jakub
* xtamas01 - Tamaškovič Marek
* xvasko12 - Vaško Martin
* xvasko14 - Vaško Michal
* xzales12 - Záleský Jiří
*/
#include "expr.h"
PredStack *createPStack() {
PredStack *s = malloc_c(sizeof(PredStack));
s->sStack = malloc_c(20 * sizeof(PredSymbol));
s->tStack = malloc_c(20 * sizeof(Token *));
s->stackSize = 20;
s->stackPtr = 0;
return s;
}
bool emptyPStack(PredStack *s) {
return s->stackPtr == 0;
}
void pushPStack(PredStack *x, PredSymbol s, void *t) {
if (x->stackPtr == x->stackSize) {
x->stackSize *= 2;
x->sStack = realloc_c(x->sStack, x->stackSize * sizeof(PredSymbol));
x->tStack = realloc_c(x->tStack, x->stackSize * sizeof(void *));
}
x->sStack[x->stackPtr] = s;
x->tStack[x->stackPtr] = t;
x->stackPtr++;
}
void markTerminal(PredStack *s) {
if (s->stackPtr == s->stackSize) {
s->stackSize *= 2;
s->sStack = realloc_c(s->sStack, s->stackSize * sizeof(PredSymbol));
s->tStack = realloc_c(s->tStack, s->stackSize * sizeof(void *));
}
//Find out where to place the mark...
int mark = -1;
for (int i = s->stackPtr; i > 0; i--) {
if (s->sStack[i - 1] <= P_END) { //non-terminal
mark = i - 1;
break;
}
}
if (mark == -1) {
ERROR(ERR_INTERNAL);
}
//...and do it.
for (int i = s->stackPtr; i > mark; i--) {
s->sStack[i] = s->sStack[i - 1];
s->tStack[i] = s->tStack[i - 1];
}
s->sStack[mark + 1] = P_MARK;
s->tStack[mark + 1] = NULL;
s->stackPtr++;
}
Expression *peekNonTerminal(PredStack *s) {
if (s->stackPtr == 0) {
ERROR(ERR_INTERNAL);
}
for (unsigned i = s->stackPtr; i > 0; i--) {
if (s->sStack[i - 1] == P_NON) {
return s->tStack[i - 1];
}
}
return NULL;
}
PredSymbol peekTerminal(PredStack *s, Token **t) {
if (s->stackPtr == 0) {
ERROR(ERR_INTERNAL);
}
for (unsigned i = s->stackPtr; i > 0; i--) {
if (s->sStack[i - 1] > P_END) //P_MARK, P_NON(-terminal)
continue;
*t = (Token *) s->tStack[i - 1];
return s->sStack[i - 1];
}
*t = NULL;
return P_END;
}
PredSymbol peekPStack(PredStack *s) {
if (s->stackPtr == 0) {
ERROR(ERR_INTERNAL);
}
return s->sStack[s->stackPtr - 1];
}
void popPStack(PredStack *s) {
if (s->stackPtr == 0) {
ERROR(ERR_INTERNAL);
}
s->stackPtr--;
}
Expression *handleSingle(PredStack *s) {
Expression *e;
PredSymbol top = s->sStack[s->stackPtr - 1];
switch (top) {
case P_NON:
e = peekNonTerminal(s);
popPStack(s);
break;
default:
FERROR(ERR_INTERNAL, "handleSingle: invalid symbol %s", showPredSymbol(top));
}
return e;
}
void reduce(PredStack *s) {
Expression *e = NULL;
Token *t;
switch (peekTerminal(s, &t)) {
case P_TF:
case P_LIT:
case P_ID:
e = parseTerm(s->tStack[s->stackPtr - 1]);
popPStack(s);
break;
case P_COMMA:
case P_LP:
case P_MARK:
case P_NON:
case P_END:
FERROR(ERR_INTERNAL, "Unexpected symbol %s",
showPredSymbol(peekTerminal(s, &t)));
case P_RP:
e = parseFuncallExpr(s);
break;
case P_INC:
case P_DEC:
e = parseIncExpr(s);
break;
case P_NOT:
case P_NEG:
e = parseUnaryExpr(s);
break;
case P_ADD:
case P_SUB:
case P_MUL:
case P_DIV:
case P_LT:
case P_GT:
case P_LE:
case P_GE:
case P_EQ:
case P_NEQ:
case P_AND:
case P_OR:
e = parseBinExpr(s);
break;
}
if (e == NULL) {
FERROR(ERR_INTERNAL, "As of yet unknown symbol %s",
showPredSymbol(peekTerminal(s, &t)));
}
if (peekPStack(s) != P_MARK) {
FERROR(ERR_INTERNAL, "Expected P_MARK, instead received %s",
showPredSymbol(peekPStack(s)));
}
popPStack(s);
pushPStack(s, P_NON, e);
}
Expression *parseExpression(Lexer *l, SymbolType end) {
Token *t;
PredStack *s = createPStack();
pushPStack(s, P_END, NULL);
bool minusIsUnary = true;
while ((translatePred(peekToken(l)) != P_END && !isSymbol(l, end)) || peekTerminal(s, &t) != P_END) {
PredSymbol a = peekTerminal(s, &t);
t = peekToken(l);
PredSymbol b = translatePred(t);
if (b == P_SUB && minusIsUnary) {
b = P_NEG;
}
switch (predTable[a][b]) {
case O:
printToken(t);
FERROR(ERR_SYNTAX, "Invalid token encountered on %d:%d, '%s'",
t->lineNum, t->lineChar, t->original);
case L:
markTerminal(s);
pushPStack(s, b, t);
nextToken(l);
minusIsUnary = b == P_LP || (b > P_NOT && b < P_ID);
break;
case E:
pushPStack(s, b, t);
nextToken(l);
minusIsUnary = b == P_LP || (b > P_NOT && b < P_ID);
break;
case G:
reduce(s);
break;
}
#if DEBUG
printf("%s%s%s\t", showPredSymbol(a), showPredType(predTable[a][b]), showPredSymbol(b));
for (unsigned i = 0; i < s->stackPtr; i++) {
printf("%s ", showPredSymbol(s->sStack[i]));
}
putchar('\n');
#endif
}
#if DEBUG
putchar('\n');
#endif
Expression *e = peekNonTerminal(s);
return e;
}
Expression *parseTerm(Token *t) {
Expression *e;
switch (t->type) {
case RESERVED:
e = createExpression(E_VALUE);
e->data.value = createValue(T_BOOLEAN);
if (t->val.reserved == RES_TRUE) {
e->data.value->data.boolean = true;
} else if (t->val.reserved == RES_FALSE) {
e->data.value->data.boolean = false;
} else {
FERROR(ERR_SYNTAX, "Unexpected reserved word on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case LIT_INTEGER:
e = createExpression(E_VALUE);
e->data.value = createValue(T_INTEGER);
e->data.value->data.integer = t->val.intVal;
break;
case LIT_STRING:
e = createExpression(E_VALUE);
e->data.value = createValue(T_STRING);
e->data.value->data.str = strdup_(t->val.stringVal);
break;
case LIT_DOUBLE:
e = createExpression(E_VALUE);
e->data.value = createValue(T_DOUBLE);
e->data.value->data.dbl = t->val.doubleVal;
break;
case ID_SIMPLE:
case ID_COMPOUND:
e = createExpression(E_REFERENCE);
e->data.reference = strdup_(t->val.id);
break;
default:
FERROR(ERR_SYNTAX, "Unexpected token on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
return e;
}
Expression *parseFuncallExpr(PredStack *s) {
Token *t;
PredFunState state = F_START;
Expression *argHead = NULL, *argNext, *f;
char *name = NULL;
int argCount = 0;
while (peekPStack(s) != P_MARK) {
switch (state) {
case F_START:
switch (peekPStack(s)) {
case P_RP:
state = F_RP;
popPStack(s);
break;
default:
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Unexpected token on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case F_LP:
switch (peekPStack(s)) {
case P_ID:
peekTerminal(s, &t);
name = strdup_(t->val.id);
state = F_END;
popPStack(s);
break;
default:
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Expected an id on line %d:%d, instead received '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case F_RP:
switch (peekPStack(s)) {
case P_LP:
state = F_LP;
popPStack(s);
continue;
case P_NON:
if (argHead == NULL) {
argHead = peekNonTerminal(s);
} else {
argNext = peekNonTerminal(s);
argNext->next = argHead;
argHead = argNext;
}
argCount++;
state = F_E;
popPStack(s);
break;
default:
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Expected an expression on line %d:%d, instead received '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case F_E:
switch (peekPStack(s)) {
case P_COMMA:
state = F_C;
popPStack(s);
break;
case P_LP:
state = F_LP;
popPStack(s);
break;
default:
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case F_C:
switch (peekPStack(s)) {
case P_NON:
if (argHead == NULL) {
argHead = peekNonTerminal(s);
} else {
argNext = peekNonTerminal(s);
argNext->next = argHead;
argHead = argNext;
}
argCount++;
state = F_E;
popPStack(s);
break;
default:
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
break;
case F_END:
ERROR(ERR_INTERNAL);
}
}
if (name == NULL) {
if (argCount != 1) {
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Invalid bracketed expression on line %d:%d",
t->lineNum, t->lineChar);
}
return argHead; //an expression, not a function call
}
f = createExpression(E_FUNCALL);
f->data.funcall.name = name;
f->data.funcall.argCount = argCount;
f->data.funcall.argHead = argHead;
return f;
}
BinaryOperation translateBinOp(Token *t) {
if (t->type != SYMBOL) {
ERROR(ERR_INTERNAL);
}
switch (t->val.symbol) {
case SYM_PLUS: return EB_ADD;
case SYM_MINUS: return EB_SUBTRACT;
case SYM_STAR: return EB_MULTIPLY;
case SYM_SLASH: return EB_DIVIDE;
case SYM_LESS: return EB_LESS;
case SYM_GREATER: return EB_GREATER;
case SYM_LESS_EQUAL: return EB_LESS_EQUAL;
case SYM_GREATER_EQUAL: return EB_GREATER_EQUAL;
case SYM_EQUALS: return EB_EQUAL;
case SYM_NOT_EQUALS: return EB_NOT_EQUAL;
case SYM_AND: return EB_AND;
case SYM_OR: return EB_OR;
default:
ERROR(ERR_INTERNAL);
}
}
Expression *parseBinExpr(PredStack *s) {
Expression *a, *b;
BinaryOperation op;
Token *t;
if (peekPStack(s) != P_NON) {
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
a = peekNonTerminal(s);
popPStack(s);
peekTerminal(s, &t);
if (peekPStack(s) >= P_END) {
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
op = translateBinOp(t);
popPStack(s);
if (peekPStack(s) != P_NON) {
peekTerminal(s, &t);
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
b = peekNonTerminal(s);
popPStack(s);
Expression *e = createExpression(E_BINARY);
e->data.binary.op = op;
e->data.binary.left = b;
e->data.binary.right = a;
return e;
}
Expression *parseIncExpr(PredStack *s) {
Token *t;
Expression *operand;
UnaryOperation op;
if (peekPStack(s) == P_NON) {
operand = peekNonTerminal(s);
popPStack(s);
peekTerminal(s, &t);
if (peekPStack(s) >= P_END) {
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
popPStack(s);
op = t->val.symbol == SYM_UNARY_PLUS ? U_PREINC : U_PREDEC;
} else {
peekTerminal(s, &t);
popPStack(s);
if (peekPStack(s) != P_NON) {
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
operand = peekNonTerminal(s);
popPStack(s);
op = t->val.symbol == SYM_UNARY_PLUS ? U_POSTINC : U_POSTDEC;
}
Expression *e = createExpression(E_UNARY);
e->data.unary.op = op;
e->data.unary.e = operand;
return e;
}
Expression *parseUnaryExpr(PredStack *s) {
Token *t;
Expression *operand;
operand = peekNonTerminal(s);
popPStack(s);
peekTerminal(s, &t);
if (peekPStack(s) >= P_END) {
printToken(t);
FERROR(ERR_SYNTAX, "Unexpected symbol on line %d:%d '%s'",
t->lineNum, t->lineChar, t->original);
}
popPStack(s);
Expression *e = createExpression(E_UNARY);
e->data.unary.op = t->val.symbol == SYM_MINUS ? U_NEG : U_NOT;
e->data.unary.e = operand;
return e;
}