-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexpression.c
190 lines (166 loc) · 7.43 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
/**
* Predmet: IFJ / IAL
* Projekt: Implementace interpretu imperativniho jazyka IFJ12
* Varianta: a/1/I
* Soubor: expression.c
* Popis: Vyhodnoceni vyrazu
* Datum: 1.12.2012
* Autori: Frantisek Kolacek <[email protected]>
* Petr Matyas <[email protected]>
* Veronika Necasova <[email protected]>
* Michaela Muzikarova <[email protected]>
* Dalibor Skacel <[email protected]>
*/
#include"expression.h"
const char PrecedentTable [MAXTABLE][MAXTABLE] =
{ // tabulka nemusi byt dobre, chce se to nekomu kontrolovat?
// tokeny id ( ) + - * / ** == != < <= > >=
[LEX_ID] ={[LEX_ID]= 0 , 0 ,'>','>','>','>','>','>','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_L_BRACKET] ={[LEX_ID]='<','<','=','<','<','<','<','<','<','<','<','<','<','<',[LEX_EOL]= 0 },
[LEX_R_BRACKET] ={[LEX_ID]= 0 , 0 ,'>','>','>','>','>','>','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_ADDITION] ={[LEX_ID]='<','<','>','>','>','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_SUBSTRACTION] ={[LEX_ID]='<','<','>','>','>','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_MULTIPLICATION] ={[LEX_ID]='<','<','>','>','>','>','>','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_DIVISION] ={[LEX_ID]='<','<','>','>','>','>','>','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_POWER] ={[LEX_ID]='<','<','>','>','>','>','>','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_EQUAL] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_UNEQUAL] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_LESSER] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_LESSER_EQUAL] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_GREATER] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_GREATER_EQUAL] ={[LEX_ID]='<','<','>','<','<','<','<','<','>','>','>','>','>','>',[LEX_EOL]='>'},
[LEX_EOL] ={[LEX_ID]='<','<', 0 ,'<','<','<','<','<','<','<','<','<','<','<',[LEX_EOL]='$'},
};
E_CODE prsExpression(tSymbolTable *table,tKeyword kw,tSymbol **result)
{
E_CODE err=ERROR_OK;
tKeyword a,b;
char c;
tExprData *tmpData;
tSymbol *dest=NULL,*sourc1=NULL,*sourc2=NULL;
tInstr *i;
tItype itype=NOINSTR;
tStack* stack=stackCreate();
stackInit(stack);
stackPush(stack,(newExprdata(LEX_EOL,NULL)));//vlozi $ na zasobnik
do{
a=topTerm(stack);
b=kw;//printf("a=%d,b=%d\n",a,b);
if(b==LEX_ID || b==LEX_STRING || b==LEX_NUMBER ||kw==KW_NIL||kw==KW_TRUE||kw==KW_FALSE){
c=PrecedentTable[a][LEX_ID];
if(((tExprData*)stackTop(stack))->kw==EXPRESSION)c=0;//nesmi byt 2 termy za sebou
}
else c=PrecedentTable[a][b];
if(c==0)
{
b=LEX_EOL;
c=PrecedentTable[a][b];
}
//printf("C je:%c\n",c);
switch(c)
{
case '=':
case '<':
if((err=pushExprdata(table,stack,b,NULL))!=ERROR_OK)return err;
kw=getToken();
break;
case '>':
//najdi pravidla
if (stackEmpty(stack))return ERROR_SYNTAX;
//E->(E)
if((tmpData=((tExprData*)stackPop(stack)))->kw==LEX_R_BRACKET)
{
itype=NOINSTR;
mmuFree(tmpData);
if(stackEmpty(stack))return ERROR_SYNTAX;
if((tmpData=((tExprData*)stackPop(stack)))->kw!=EXPRESSION)
{mmuFree(tmpData);return ERROR_SYNTAX;}
dest = tmpData->symbol;
mmuFree(tmpData);
if(stackEmpty(stack))return ERROR_SYNTAX;
if((tmpData=((tExprData*)stackPop(stack)))->kw!=LEX_L_BRACKET)
{mmuFree(tmpData);return ERROR_SYNTAX;}
mmuFree(tmpData);
}
//E-> E op E
else if(tmpData->kw==EXPRESSION)
{
sourc2 = tmpData->symbol;
mmuFree(tmpData);
if(stackEmpty(stack))return ERROR_SYNTAX;
tmpData=((tExprData*)stackPop(stack));
if(!isOper(tmpData->kw)){mmuFree(tmpData);return ERROR_SYNTAX;}
itype = getItype(tmpData->kw);
mmuFree(tmpData);
if(stackEmpty(stack))return ERROR_SYNTAX;
if((tmpData=((tExprData*)stackPop(stack)))->kw!=EXPRESSION)
{mmuFree(tmpData);return ERROR_SYNTAX;}
sourc1 = tmpData->symbol;
mmuFree(tmpData);
}
else return ERROR_SYNTAX;
//vlozit instrukci
if(itype!=NOINSTR){//jen v pripade E->EopE
dest=insertBlankConstant(table->currentFunc);
i=genInstr(itype,dest,sourc1,sourc2);
listInsertLast(&(table->currentFunc->instructions),i);
}
if((err=pushExprdata(table,stack,EXPRESSION,dest))!=ERROR_OK)return err;//pushne se vysledek expr
break;
case '$':
tmpData=NULL;
if(stackEmpty(stack))return ERROR_SYNTAX;
if((tmpData=((tExprData*)stackPop(stack)))->kw!=EXPRESSION)
{mmuFree(tmpData);return ERROR_SYNTAX;}
*result=tmpData->symbol;
break;
default:/*printf("ERROR - default\n")*/;return ERROR_SYNTAX;
}
}while(!(a==LEX_EOL && b==LEX_EOL));
stackDispose(stack);
stackDestroy(stack);
//printf("uspesne expression\n");
return ERROR_OK;
}
tExprData* newExprdata(tKeyword kw,tSymbol *symbol)
{
tExprData *new=mmuMalloc(sizeof(tExprData));
new->kw=kw;
new->symbol=symbol;
return new;
}
E_CODE pushExprdata(tSymbolTable *table,tStack *stack,tKeyword kw,tSymbol *symb)
{
if(kw==LEX_ID)
{
if((symb=functionSearchSymbol(table->currentFunc,gToken.data))==NULL)
return ERROR_SEMANTIC_VARIABLE;
kw=EXPRESSION; //E->id
}
else if (kw==LEX_STRING || kw==LEX_NUMBER ||kw==KW_NIL ||kw==KW_FALSE ||kw==KW_TRUE)
{
symb=functionInsertConstant(table->currentFunc,gToken.data,kw);
kw=EXPRESSION; //E->id
}
stackPush(stack,(newExprdata(kw,symb)));
return ERROR_OK;
}
tKeyword topTerm(tStack *stack)
{
tStackPtr tmp=stack->top;
while(tmp!=NULL && (((tExprData*)tmp->data)->kw==EXPRESSION))
{
tmp=tmp->ptr;
}
return (tmp==NULL) ? EXPRESSION:((tExprData*)tmp->data)->kw;
}
bool isOper(tKeyword kw)
{
return(kw==LEX_ADDITION||kw==LEX_SUBSTRACTION||kw==LEX_MULTIPLICATION||
kw==LEX_DIVISION||kw==LEX_POWER||kw==LEX_LESSER||kw==LEX_LESSER_EQUAL||
kw==LEX_EQUAL||kw==LEX_UNEQUAL||kw==LEX_GREATER||kw==LEX_GREATER_EQUAL);
}
tItype getItype(tKeyword kw)
{
return (tItype)(kw+(I_ADD-LEX_ADDITION));
}