-
Notifications
You must be signed in to change notification settings - Fork 0
/
expression.c
876 lines (849 loc) · 33.1 KB
/
expression.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
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
/**
* Projekt: IFJ2021
*
* @brief Syntaktická analýza zdola nahoru
*
* @author Tomáš Bártů [email protected]
*/
#include "expression.h"
#include <stdlib.h>
// jezdec udavajici skutecnou pozici v ctenem souboru
fpos_t last_read_pos;
// Prediktivni tabulka
static TermsAndNonTerms p_table[17][17] = {
/* $ + - * / // ( ) i # .. < > <= >= == ~= */
/* $ */ { -1, R, R, R, R, R, R,-1, R, R, R, R, R, R, R, R, R },
/* + */ { I, I, I, R, R, R, R, I, R, R, I, I, I, I, I, I, I },
/* - */ { I, I, I, R, R, R, R, I, R, R, I, I, I, I, I, I, I },
/* * */ { I, I, I, I, I, I, R, I, R, R, I, I, I, I, I, I, I },
/* / */ { I, I, I, I, I, I, R, I, R, R, I, I, I, I, I, I, I },
/* // */ { I, I, I, I, I, I, R, I, R, R, I, I, I, I, I, I, I },
/* ( */ { -1, R, R, R, R, R, R, E, R, R, R, R, R, R, R, R, R },
/* ) */ { I, I, I, I, I, I,-1, I, H,-1, I, I, I, I, I, I, I },
/* i */ { I, I, I, I, I, I,-1, I, H, R, I, I, I, I, I, I, I },
/* # */ { I, I, I, I, I, I, R, I, R,-1, I, I, I, I, I, I, I },
/* .. */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* < */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* > */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* <= */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* >= */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* == */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I },
/* ~= */ { I, R, R, R, R, R, R, I, R, R, R, I, I, I, I, I, I } };
// hodnota predchoziho tokenu
Token_ID prev;
// pomocna promenna kontrolujici zda bylo jiz pouzti {==, ~=, <, >, <=, >=}
int isCorrect = 1;
// pomocna promenna udavajici jaky kod vytiskneme
TermsAndNonTerms decide = USD;
int elseCounter = 0;
/**
* @brief Preskoci netisknutelne znaky
*
* @param token Struktura tokenu
* @param file Ukazatel na zdrojovy soubor
* @return Navratova chyva
*/
int skipNonPrintChar(Token *token, FILE *file) {
int error = ERROR_PASSED;
prev = token->ID;
do {
fgetpos(file, &last_read_pos);
// nacteni noveho tokenu a kontrola vysupu scanneru
if ((error = get_token(token, file)) != ERROR_PASSED)
// lexikalni nebo kompilatorova chyba
return error;
} while (token->ID != TOKEN_ID_EOF && (
token->ID == TOKEN_ID_SPACE || token->ID == TOKEN_ID_EOL ||
token->ID == TOKEN_ID_TAB || token->ID == TOKEN_ID_LCMT2 ||
token->ID == TOKEN_ID_BCMT4));
return error;
}
/**
* @brief Funkce pro prevod stringu na string podporovany jazykem IFJcode21
*
* @param input Ukazatel na pole charu
* @return Upraveny string
*/
char *converString(char *input) {
char *output = (char *)malloc(strlen(input));
int positon = 0;
int i;
for(i = 1; input[i+1] != '\0'; i++) {
if (input[i] == '\\') {
if(input[i+1] == '\\') {
output = (char *) realloc(output, strlen(input) + 30);
output[positon++] = '\\';
output[positon++] = '0';
output[positon++] = '9';
output[positon++] = '2';
} else if (input[i+1] == '"') {
output = (char *) realloc(output, strlen(input) + 30);
output[positon++] = '\\';
output[positon++] = '0';
output[positon++] = '3';
output[positon++] = '4';
} else if (input[i+1] == 'n') {
output = (char *) realloc(output, strlen(input) + 30);
output[positon++] = '\\';
output[positon++] = '0';
output[positon++] = '1';
output[positon++] = '0';
} else if (input[i+1] == 't') {
output = (char *) realloc(output, strlen(input) + 30);
output[positon++] = '\\';
output[positon++] = '0';
output[positon++] = '0';
output[positon++] = '9';
} else {
output[positon++] = input[i];
i--;
}
i+=1;
} else if(input[i] <= 32 || input[i] == 34 || input[i] == 92) {
output = (char *) realloc(output, strlen(input) + 5);
output[positon++] = '\\';
output[positon++] = (char)((int)input[i]/100+48);
output[positon++] = (char)((int)input[i]/10+48);
output[positon++] = (char)((int)input[i]%10+48);
} else {
output[positon++] = input[i];
}
}
output[positon] = '\0';
return output;
}
/**
* @brief Prevod tokenu na terminal nebo neterminal
*
* @param token Ukazatel na aktualni token
* @param typeStack Zasobnik datovych typu
* @return Terminal ci neterminal daneho tokenu
*/
TermsAndNonTerms convertTokenType_To_TermsAndNonTerms(Token *token, TypeStack *typeStack) {
switch (token->ID) {
case TOKEN_ID_ADD:
return ADD;
case TOKEN_ID_SUB:
return SUB;
case TOKEN_ID_MUL:
return MUL;
case TOKEN_ID_DIV:
return DIV;
case TOKEN_ID_DIV2:
return DIV2;
case TOKEN_ID_LT:
if(!isCorrect)
return E;
decide = LT;
isCorrect = false;
return LT;
case TOKEN_ID_LTE:
if(!isCorrect)
return E;
decide = LTE;
isCorrect = false;
return LTE;
case TOKEN_ID_GT:
if(!isCorrect)
return E;
decide = GT;
isCorrect = false;
return GT;
case TOKEN_ID_GTE:
if(!isCorrect)
return E;
decide = GTE;
isCorrect = false;
return GTE;
case TOKEN_ID_NEQ2:
if(!isCorrect)
return E;
decide = NEQ;
isCorrect = false;
return NEQ;
case TOKEN_ID_EQ:
if(!isCorrect)
return E;
decide = EQ;
isCorrect = false;
return EQ;
case TOKEN_ID_LBR:
return LBR;
case TOKEN_ID_RBR:
return RBR;
case TOKEN_ID_ID:
return ID;
case TOKEN_ID_INT0:
case TOKEN_ID_ZERO:
case TOKEN_ID_INT:
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
return ID;
case TOKEN_ID_DBL2:
case TOKEN_ID_EXP3:
case TOKEN_ID_DHEX2:
case TOKEN_ID_HEXP3:
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
return ID;
case TOKEN_ID_FSTR:
TypeStack_push(typeStack, DATA_TYPE_STRING);
return ID;
case TOKEN_ID_LEN:
return LEN;
case TOKEN_ID_DDOT:
return DDOT;
default:
if (token->Value.keyword == KEYWORD_NIL) {
TypeStack_push(typeStack, DATA_TYPE_NIL);
return ID;
}
return USD;
}
}
/**
* @brief Kontrola kompatibility datoych typu
* ADD, SUB, MUL, DIV respektive v tomto poradi +, -, *
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {+,-,*} <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_ADD_SUB_MUL(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_INTEGER) {
// druhy operand je INT tak vyndej druhy ho pretypuj
make_POPSandPUSH_float();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NUMBER) {
// prvni operand je INT tak ho pretypuj
make_INT2FLOATS();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NUMBER) {
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoveho typu
* DIV respektive /
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {/} <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_DIV(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
// oba operandy jsou int tak je pretypuj
make_POPSandPUSH_float();
make_INT2FLOATS();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_INTEGER) {
// druhy operand je INT tak vyndej druhy ho pretypuj
make_POPSandPUSH_float();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NUMBER) {
// prvni operand je INT tak ho pretypuj
make_INT2FLOATS();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NUMBER) {
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoveho typu
* DIV2 respektive //
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {//} <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_DIV2(TypeStack *typeStack) {
DataTypes firstOP, secondOp;
firstOP = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOP == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoych typu
* LT, GT respektive v tomto poradi <, >
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {<,>} <firstOp>
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_LT_GT(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandPUSH_float();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NUMBER) {
make_INT2FLOATS();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NUMBER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoych typu
* EQ, NEQ respetive v tomto poradi ==, ~=
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {==, ~=} <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_EQ_NEQ(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandPUSH_float();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NUMBER) {
make_INT2FLOATS();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NUMBER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NIL && secondOp == DATA_TYPE_NIL) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else if (firstOp == DATA_TYPE_STRING && secondOp == DATA_TYPE_STRING) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_STRING);
} else if (firstOp == DATA_TYPE_NIL && secondOp == DATA_TYPE_STRING) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_STRING);
} else if (firstOp == DATA_TYPE_STRING && secondOp == DATA_TYPE_NIL) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_STRING);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NIL) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else if (firstOp == DATA_TYPE_NIL && secondOp == DATA_TYPE_INTEGER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else if (firstOp == DATA_TYPE_NIL && secondOp == DATA_TYPE_NUMBER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NIL) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoych typu
* LTE, GTE respektive v tomto poradi <=, >=
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> {<=, >=} <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_LTE_GTE(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_INTEGER) {
make_POPSandPUSH_float();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_INTEGER && secondOp == DATA_TYPE_NUMBER) {
make_INT2FLOATS();
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NUMBER && secondOp == DATA_TYPE_NUMBER) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (firstOp == DATA_TYPE_NIL && secondOp == DATA_TYPE_NIL) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Kontrola kompatibility datoveho typu DDOT
*
* @details Po zpracovani vlozi na zasobnik vysledny datovy typ
* | <firstOp> | <- topElement
* |------------|
* | <secondOp> |
* |------------|
* | ...... |
* |___BOTTOM___|
* tedy vyraz odpovida: <secondOp> .. <firstOp>
*
* @param typeStack Zasobnik datovych typu
* @return Typ erroru generovany analyzou
*/
int checkDataTypes_DDOT(TypeStack *typeStack) {
DataTypes firstOp, secondOp;
firstOp = TypeStack_pop(typeStack);
secondOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_STRING && secondOp == DATA_TYPE_STRING) {
make_POPSandMOVE_tmp1();
TypeStack_push(typeStack, DATA_TYPE_STRING);
} else {
return ERROR_SEM_COMPAT;
}
return ERROR_PASSED;
}
/**
* @brief Gramaticka pravidla a nasledne volani kontroly datoveho typu
*
* @param termStack Ukazatel na strukturu jednosmerne vazaneho seznamu
* @return int Typ erroru generovany analyzou
*/
int checkRulesAndApply(TermStack *termStack, TypeStack *typeStack) {
TermStackElementPtr ptr = NULL;
TermStack_top(termStack, &ptr);
if (ptr->data == ID && ptr->previousElement->data == R) {
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == ADD &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_ADD_SUB_MUL(typeStack)) return ERROR_SEM_COMPAT;
make_ADDS();
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == SUB &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_ADD_SUB_MUL(typeStack)) return ERROR_SEM_COMPAT;
make_SUBS();
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == MUL &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_ADD_SUB_MUL(typeStack)) return ERROR_SEM_COMPAT;
make_MULS();
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == DIV &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_DIV(typeStack)) return ERROR_SEM_COMPAT;
make_DIVS();
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == DIV2 &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_DIV2(typeStack)) return ERROR_SEM_COMPAT;
make_IDIVS();
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == DDOT &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_DDOT(typeStack)) return ERROR_SEM_COMPAT;
make_CONTAT();
TermStack_applyReduce(termStack);
} else if (ptr->data == RBR && ptr->previousElement->data == EXP &&
ptr->previousElement->previousElement->data == LBR &&
ptr->previousElement->previousElement->previousElement->data == R) {
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == LT &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_LT_GT(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == GT &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_LT_GT(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == LTE &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_LTE_GTE(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == GTE &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_LTE_GTE(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == EQ &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_EQ_NEQ(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == NEQ &&
ptr->previousElement->previousElement->data == EXP &&
ptr->previousElement->previousElement->previousElement->data == R) {
if (checkDataTypes_EQ_NEQ(typeStack)) return ERROR_SEM_COMPAT;
TermStack_applyReduce(termStack);
} else if (ptr->data == EXP && ptr->previousElement->data == LEN &&
ptr->previousElement->previousElement->data == R) {
DataTypes firstOp = TypeStack_pop(typeStack);
if (firstOp == DATA_TYPE_STRING) {
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else {
return ERROR_SEM_COMPAT;
}
make_STRLEN();
TermStack_applyReduce(termStack);
} else {
return ERROR_SYNTAX;
}
return ERROR_PASSED;
}
/**
* @brief Simulace terminalu $ na vstup
*
* @param stack Ukazatel na strukturu jednosmerne vazaneho seznamu
* @return int Logickou jednicku pokud zasobnik od dna vypadata takto: {|$|E|} jinak vraci logickou nulu
*/
int SA_isOK(TermStack *stack) {
struct TermStackElement *tmp = NULL;
TermStack_top(stack, &tmp);
return (tmp->data == EXP && tmp->previousElement->data == USD && tmp->previousElement->previousElement == NULL) ? 1 : 0;
}
/**
* @brief Syntakticka kontrola vyrazu
*
* @param token Struktura tokenu
* @param file Ukazatel na zdrojovy soubor
* @param listFrame Ukazatel na tabulku symbolu
* @param retData Datovy typ do ktereho se ma vysledny vyraz priradit
* @param var Nazev promenne do ktere se ma vysledny vyraz priradit
* @param loopCounter Ukazatel na citac cyklu
* @return int Typ erroru generovany analyzou
*/
int exprSyntaxCheck(Token *token, FILE *file, SLList_Frame *listFrame, Data_type retData, char *var, int *loopCounter) {
bool isNew = true;
int error;
bst_node_t *ptr_node = NULL;
// pridelim pamet zasobniku datovych typu
TypeStack *typeStack = (TypeStack *) malloc(sizeof(TypeStack));
if (!typeStack) return ERROR_COMPILER;
TypeStack_init(typeStack);
// pridelim pamet zasobniku terminalu a neterminalu
TermStack *termStack = (TermStack *) malloc(sizeof(TermStack));
if (!termStack) return ERROR_COMPILER;
TermStack_init(termStack);
// vlozim $
TermStack_push(termStack, USD);
struct TermStackElement *top = NULL;
// zjistim si dalsi token
skipNonPrintChar(token, file);
// proslo to, tak prelozime token na terminal
TermsAndNonTerms vstup = convertTokenType_To_TermsAndNonTerms(token, typeStack);
if(vstup == E) {
freeStacks(termStack, typeStack);
return ERROR_SEM_OTHERS;
}
do {
TermStack_firstTermPtr(termStack, &top);
if ((prev == TOKEN_ID_DIV2 || prev == TOKEN_ID_DIV) && (token->ID == TOKEN_ID_ZERO || token->ID == TOKEN_ID_INT0 || token->Value.Double == 0.0)) {
freeStacks(termStack, typeStack);
return ERROR_RUNTIME_DIV_ZERO;
}
// jedna se o identifikator?
if (token->ID == TOKEN_ID_ID && p_table[(top->data - 4)][vstup - 4] != H && vstup != USD) {
SLLElementPtr_Frame *ptrFrame = (SLLElementPtr_Frame *) malloc(sizeof(SLLElementPtr_Frame));
if(!ptrFrame) return ERROR_COMPILER;
(*ptrFrame) = listFrame->TopLocalElement;
ptr_node = bst_search(listFrame->globalElement->node, token->Value.string);
bool doLoop = ptr_node == NULL;
while(doLoop) {
if ((*ptrFrame) == listFrame->globalElement) {
free(ptrFrame);
freeStacks(termStack, typeStack);
return ERROR_SEM_UNDEFINED;
}
ptr_node = bst_search((*ptrFrame)->node, token->Value.string);
if (ptr_node != NULL && (isInitVar(ptr_node) || !strcmp(var, "if") || !strcmp(var, "while"))) {
make_PUSHS_TF(token->Value.string);
if (ptr_node->varData->type == TYPE_STRING) {
TypeStack_push(typeStack, DATA_TYPE_STRING);
} else if (ptr_node->varData->type == TYPE_NUMBER) {
TypeStack_push(typeStack, DATA_TYPE_NUMBER);
} else if (ptr_node->varData->type == TYPE_INTEGER) {
TypeStack_push(typeStack, DATA_TYPE_INTEGER);
} else if (ptr_node->varData->type == TYPE_NIL) {
TypeStack_push(typeStack, DATA_TYPE_NIL);
} else {
free(ptrFrame);
freeStacks(termStack, typeStack);
return ERROR_SEM_UNDEFINED;
}
break;
}
(*ptrFrame) = (*ptrFrame)->previousElement;
}
free(ptrFrame);
}
// podle pravidla v tabulce rozhodnu co budu delat
switch (p_table[(top->data - 4)][vstup - 4]) {
// terminaly jsou si rovny
case E:
TermStack_push(termStack, vstup);
// zjistim si dalsi token
skipNonPrintChar(token, file);
// jedna se o identifikator?
if (token->ID == TOKEN_ID_ID) {
if (ptr_node != NULL) {
// pokud to neni to promenna a je inicializovane?
// muze to ale byt buldin funkce (write, readi, ...)
if (isFnc(ptr_node) || !isInitVar(ptr_node)) {
freeStacks(termStack, typeStack);
return ERROR_SEM_UNDEFINED;
}
}
}
if ((prev == TOKEN_ID_DIV2 || prev == TOKEN_ID_DIV) && (token->Value.Double == 0.0 || token->Value.Integer == 0))
return ERROR_RUNTIME_DIV_ZERO;
// proslo to, tak prelozime token na terminal
vstup = convertTokenType_To_TermsAndNonTerms(token, typeStack);
if(vstup == E) {
freeStacks(termStack, typeStack);
return ERROR_SEM_OTHERS;
}
break;
// vlozim znak redukce
case R:
if(isNew) {
if(token->ID == TOKEN_ID_INT || token->ID == TOKEN_ID_INT0 || token->ID == TOKEN_ID_ZERO )
printf("PUSHS int@%lld\n", token->Value.Integer);
if(token->ID == TOKEN_ID_DBL2 || token->ID == TOKEN_ID_EXP3 || token->ID == TOKEN_ID_DHEX2 || token->ID == TOKEN_ID_HEXP3)
printf("PUSHS float@%a\n", token->Value.Double);
if(token->ID == TOKEN_ID_FSTR) {
char *str = converString(token->Value.string->str);
printf("PUSHS string@%s\n", str);
free(str);
}
if(token->Value.keyword == KEYWORD_NIL)
make_PUSHS_nil();
}
TermStack_insertReduce(termStack, top);
TermStack_push(termStack, vstup);
// zjisitm si dalsi token
skipNonPrintChar(token, file);
isNew = true;
vstup = convertTokenType_To_TermsAndNonTerms(token, typeStack);
if(vstup == E) {
freeStacks(termStack, typeStack);
return ERROR_SEM_OTHERS;
}
break;
// zredukuju po nejblizsi znak redukce
case I:
isNew = false;
error = checkRulesAndApply(termStack, typeStack);
// neexistije pro redukci pravidlo
if (error) {
freeStacks(termStack, typeStack);
return error;
}
break;
// vyhodnotim co se jde a predam rizeni zpet top-down analyze
case H:
vstup = USD;
break;
// chybovy stav
default:
freeStacks(termStack, typeStack);
return ERROR_SYNTAX;
}
} while (vstup != USD || !SA_isOK(termStack)); // opakuji dokud vstup neni $ a dokud muzu redukovat
//kontrola vyslednych datovych typu
if(retData == TYPE_INTEGER) {
if (typeStack->topElement->data == DATA_TYPE_STRING) {
freeStacks(termStack, typeStack);
return ERROR_SEM_ASSIGN;
}
if (typeStack->topElement->data == DATA_TYPE_NUMBER)
return ERROR_SEM_ASSIGN;
} else if (retData == TYPE_NUMBER) {
if (typeStack->topElement->data == DATA_TYPE_STRING) {
freeStacks(termStack, typeStack);
return ERROR_SEM_ASSIGN;
}
if (typeStack->topElement->data == DATA_TYPE_INTEGER)
make_INT2FLOATS();
} else if (retData == TYPE_STRING) {
if (typeStack->topElement->data == DATA_TYPE_INTEGER) {
freeStacks(termStack, typeStack);
return ERROR_SEM_ASSIGN;
}
if (typeStack->topElement->data == DATA_TYPE_NUMBER) {
freeStacks(termStack, typeStack);
return ERROR_SEM_ASSIGN;
}
} else if (retData == TYPE_NIL) {
if (typeStack->topElement->data != DATA_TYPE_NIL) {
freeStacks(termStack, typeStack);
return ERROR_SEM_ASSIGN;
}
}
// neni tam rovnost nebo nerovnost
if (!isCorrect) {
make_POPSandMOVE_tmp2();
} else {
if (retData != TYPE_UNDEFINED)
make_POPS_TF(var);
else
make_POPS_GF_if();
}
// je tam rovnost nebo nerovnost
switch (decide) {
case EQ:
if (!(strcmp(var, "if")))
make_EQ(elseCounter++);
if(!(strcmp(var, "loop")))
printf("JUMPIFNEQ !endLoop%d TF@&tmp2 TF@&tmp1\n", (*loopCounter)++);
break;
case NEQ:
if (!(strcmp(var, "if")))
make_NEQ(elseCounter++);
if(!(strcmp(var, "loop"))) {
printf("JUMPIFEQ !endLoop%d TF@&tmp2 TF@&tmp1\n", (*loopCounter)++);
}
break;
case LT:
make_insertNILcompare();
if (!(strcmp(var, "if")))
make_LT_all(elseCounter++);
if(!(strcmp(var, "loop"))) {
make_LT_loop();
printf("JUMPIFNEQS !endLoop%d\n", (*loopCounter)++);
}
break;
case LTE:
make_insertNILcompare();
if (!(strcmp(var, "if")))
make_LTE_all(elseCounter++);
if(!(strcmp(var, "loop"))) {
make_LTE_loop();
printf("JUMPIFNEQS !endLoop%d\n", (*loopCounter)++);
}
break;
case GT:
make_insertNILcompare();
if (!(strcmp(var, "if")))
make_GT_all(elseCounter++);
if(!(strcmp(var, "loop"))) {
make_GT_loop();
printf("JUMPIFNEQS !endLoop%d\n", (*loopCounter)++);
}
break;
case GTE:
make_insertNILcompare();
if (!(strcmp(var, "if")))
make_GTE_all(elseCounter++);
if(!(strcmp(var, "loop"))) {
make_GTE_loop();
printf("JUMPIFNEQS !endLoop%d\n", (*loopCounter)++);
}
break;
default:
if (!(strcmp(var, "if"))) {
make_IF_nil(elseCounter++);
} else if (!(strcmp(var, "loop"))) {
}
break;
}
isCorrect = 1;
//uvolnim pamet zasobniku
freeStacks(termStack, typeStack);
decide = USD;
isCorrect = 1;
fsetpos(file, &last_read_pos);
return ERROR_PASSED;
}
/**
* @brief Uvolneni pameti zasobniku
*
* @param termStack Ukazatel na zasobnik datovych typu
* @param typeStack Ukazatel na zasobmil terminalu a neterminalu
*/
void freeStacks(TermStack *termStack, TypeStack *typeStack) {
TypeStack_dispose(typeStack);
free(typeStack);
TermStack_dispose(termStack);
free(termStack);
}
/** @endcode */