-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathanalyze.c
498 lines (411 loc) · 14.2 KB
/
analyze.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
/****************************************************/
/* File: analyze.c */
/* Semantic analyzer implementation */
/* for the TINY compiler */
/* Compiler Construction: Principles and Practice */
/* Kenneth C. Louden */
/****************************************************/
#include "globals.h"
#include "analyze.h"
#include "util.h"
#include "symboltable.h"
FILE * errorfile;
/*
* To insert to symbol table build-in functions
* int input() // One integer value is input from the user.
* void output() // Prints the value of arg.
*/
/*void changeContext(int currProc) -> unstack all registers (after set baserReg) -> unstack PC last*/
static void insertChangeContextFunc(void){
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Void;
TreeNode * type_specifier = newDeclNode(FunK);
type_specifier->attr.type = VOID;
TreeNode * params = newDeclNode(ParamK);
params->attr.name = "currProc";
params->child[0] = newExpNode(TypeK);
params->child[0]->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "changeContext";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = params;
fun_declaration->child[2] = compound_stmt;
/* Insert output function*/
st_insert("global", "changeContext", Void, fun_declaration, 0);
}
/*void changeContext(int currProc) -> unstack all registers (after set baserReg) -> unstack PC last*/
static void insertSetPCFunc(void){
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Void;
TreeNode * type_specifier = newDeclNode(FunK);
type_specifier->attr.type = VOID;
TreeNode * params = newDeclNode(ParamK);
params->attr.name = "currProc";
params->child[0] = newExpNode(TypeK);
params->child[0]->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "setPC";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = params;
fun_declaration->child[2] = compound_stmt;
/* Insert output function*/
st_insert("global", "setPC", Void, fun_declaration, 0);
}
/*void stackRegister(void) -> creates a stack and stacks all registers*/
static void insertStackRegisterFunc(){
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Void;
TreeNode * type_specifier = newExpNode(TypeK);
type_specifier->attr.type = VOID;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "stackRegisters";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = NULL;
fun_declaration->child[2] = compound_stmt;
/* Insert input function*/
st_insert("global", "stackRegisters", Void, fun_declaration, 0);
}
/*void storeRegisters(int currProc) -> stores regs to registers array */
static void insertStoreRegisterFunc(){
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Void;
TreeNode * type_specifier = newDeclNode(FunK);
type_specifier->attr.type = VOID;
TreeNode * params = newDeclNode(ParamK);
params->attr.name = "currProc";
params->child[0] = newExpNode(TypeK);
params->child[0]->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "storeRegisters";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = params;
fun_declaration->child[2] = compound_stmt;
/* Insert output function*/
st_insert("global", "storeRegisters", Void, fun_declaration, 0);
}
/*int processFinished(void) -> returns 1 if process sent finish signal, 0 otherwise */
static void insertProcessFinishedFunc(){
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Integer;
TreeNode * type_specifier = newExpNode(TypeK);
type_specifier->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "processFinished";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = NULL;
fun_declaration->child[2] = compound_stmt;
/* Insert input function*/
st_insert("global", "processFinished", Integer, fun_declaration, 0);
}
static void insertInputFunc(void) {
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Integer;
TreeNode * type_specifier = newExpNode(TypeK);
type_specifier->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "input";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = NULL;
fun_declaration->child[2] = compound_stmt;
/* Insert input function*/
st_insert("global", "input", Integer, fun_declaration, 0);
}
/* To insert to symbol table build-in functions
* int input() // One integer value is input from the user.
* void output() // Prints the value of arg.
*/
static void typeError(TreeNode * t, char * message)
{ fprintf(errorfile,"Erro de tipo na linha %d: %s\n",t->lineno,message);
Error = TRUE;
//exit(-1);
}
static void insertOutputFunc(void) {
TreeNode * fun_declaration = newDeclNode(FunK);
fun_declaration->type = Void;
TreeNode * type_specifier = newDeclNode(FunK);
type_specifier->attr.type = VOID;
TreeNode * params = newDeclNode(ParamK);
params->attr.name = "arg";
params->child[0] = newExpNode(TypeK);
params->child[0]->attr.type = INT;
TreeNode * compound_stmt = newStmtNode(CompoundK);
compound_stmt->child[0] = NULL;
compound_stmt->child[1] = NULL;
fun_declaration->lineno = 0;
fun_declaration->attr.name = "output";
fun_declaration->child[0] = type_specifier;
fun_declaration->child[1] = params;
fun_declaration->child[2] = compound_stmt;
/* Insert output function*/
st_insert("global", "output", Void, fun_declaration, 0);
}
/* counter for variable memory locations */
static int location = 0;
/* Procedure traverse is a generic recursive
* syntax tree traversal routine:
* it applies preProc in preorder and postProc
* in postorder to tree pointed to by t
*/
static void traverse( TreeNode * t, void (* preProc) (TreeNode *), void (* postProc) (TreeNode *) ){
if (t != NULL)
{ preProc(t);
{ int i;
for (i=0; i < MAXCHILDREN; i++)
traverse(t->child[i],preProc,postProc);
}
postProc(t);
traverse(t->sibling,preProc,postProc);
}
}
/* nullProc is a do-nothing procedure to
* generate preorder-only or postorder-only
* traversals from traverse
*/
static void nullProc(TreeNode * t)
{ if (t==NULL) return;
else return;
}
static void popAfterInsertProc(TreeNode * t) {
if (t->nodekind == StmtK) {
if (t->kind.stmt == CompoundK) {
popScope();
}
}
if (t==NULL) return;
else return;
}
static void symbolError(TreeNode * t, char * message) {
fprintf(errorfile,"ERRO SEMANTICO: Linha: %d: %s\n", t->lineno, message);
Error = TRUE;
//exit(-1);
}
/* Procedure insertNode inserts
* identifiers stored in t into
* the symbol table
*/
static void insertNode( TreeNode * t)
{ switch (t->nodekind)
{
//Statement case
case StmtK:{
switch (t->kind.stmt) {
case CompoundK: {
if (!isFirstCompoundK) {
Scope scope = newScope(currScope()->name, currScope()->type);
scope->parent = currScope();
pushScope(scope);
}
isFirstCompoundK = 0;
break;
}
case ReturnK:
if(t->child[0] == NULL){
if(currScope()->type != Void){
typeError(t, "Retorno esperado!");
}
}else{
if(currScope()->type == Void){
typeError(t, "Retorno vazio esperado!");
}
}
break;
case AssignK: {
// Verify the type match of two operands when assigning.
if (t->child[0]->type == IntegerArray) {
if(t->child[0]->child[0] == NULL){
typeError(t->child[0], "Atribuicao para uma variavel do tipo vetor");
}
}
if (t->child[0]->attr.arr.type == Void) {
typeError(t->child[0], "Atribuicao para uma variavel do tipo VOID");
}
if(t->child[1]->kind.exp == CallK){
if(st_lookup_scope(t->child[1]->attr.name) != NULL){
if(st_lookup_scope(t->child[1]->attr.name)->type == Void){
typeError(t->child[1], "Atribuicao de VOID");
}
}
}
break;
}
default:
break;
}
break;
}
//Expression case
case ExpK: {
switch (t->kind.exp){
case IdK:
case ArrIdK:
case CallK: {
// check undeclation / função não declarada
if (st_lookup_all_scope(t->attr.name) == NULL){
symbolError(t, "Simbolo nao definido");
} else {
BucketList list = st_lookup_all_scope(t->attr.name);
t->type = list->type;
insertLines(t->attr.name, t->lineno);
}
break;
}
default:
break;
}
break;
}
//Declaration case
case DeclK: {
switch (t->kind.decl) {
case FunK: {
// initialize location counter
locationCounter = 0;
/* Look up scope list to check scope existence / função já declarada*/
if (st_lookup_scope(t->attr.name) != NULL) {
symbolError(t, "Redefinicao de funcao");
break;
}
//verifica se o escopo atual é o global e cria um novo escopo
if (strcmp(currScope()->name, "global") == 0) {
st_insert(currScope()->name, t->attr.name, t->child[0]->type, t, locationCounter++);
}
Scope scope = newScope(t->attr.name, t->child[0]->type);
scope->parent = currScope();
pushScope(scope);
isFirstCompoundK = 1;
break;
}
//Variable case
case VarK: {
/* Look up to check variable existence / variavel já declarada*/
if (st_lookup(t->attr.name) != NULL) {
symbolError(t, "Redefinicao de variavel");
break;
}
// função com nome já existe
if(st_lookup_scope(t->attr.name) != NULL){
symbolError(t, "Declaracao Invalida");
break;
}
// Type Checking : Type should not be void / variável como void
if (t->child[0]->type == Void) {
symbolError(t, "Variavel nao deveria ser do tipo VOID");
break;
}
st_insert(currScope()->name, t->attr.name, t->child[0]->type, t, (currScope()->scopeCount++)+1);
break;
}
//Array case
case ArrVarK: {
// Type Checking : Type should not be void / vetor como void
if (t->child[0]->type == Void) {
symbolError(t, "Tipo invalido");
break;
}
// função já declarada
if(st_lookup_scope(t->attr.arr.name) != NULL){
symbolError(t, "Declaracao invalida");
break;
}
//vetor ja declarado
/* Look up to check array variable existence */
if (st_lookup(t->attr.arr.name) != NULL) {
symbolError(t, "Vetor ja foi declarado");
break;
}
st_insert(currScope()->name, t->attr.arr.name, t->type, t, (currScope()->scopeCount++)+1);
break;
}
//ArrayParamenter case
case ArrParamK: {
// Type Checking : Type should not be void / argumento não pode ser void
if (t->child[0]->type == Void) {
symbolError(t, "Tipo invalido");
break;
}
// função com esse nome ja existe
if(st_lookup_scope(t->attr.name) != NULL){
symbolError(t, "Declaracao invalida");
break;
}
/* Look up to check array parameter existence / parametro ja existente */
if (st_lookup(t->attr.name) != NULL) {
symbolError(t, "Redefinicao de um parametro vetor");
break;
}
st_insert(currScope()->name, t->attr.name, t->type, t, (currScope()->scopeCount++)+1);
break;
}
//Parameter case
case ParamK: {
if (t->attr.name != NULL) {
/* Look up to check parameter existence */
if(t->child[0]->type == Void){
symbolError(t, "Tipo invalido");
break;
}
if(st_lookup_scope(t->attr.name) != NULL){
symbolError(t, "Declaracao invalida");
break;
}
if (st_lookup(t->attr.name) != NULL) {
symbolError(t, "Redefinicao de parametro");
break;
}
st_insert(currScope()->name, t->attr.name, t->child[0]->type, t, (currScope()->scopeCount++)+1);
}
break;
}
default:
break;
}
break;
}
default:
break;
}
}
/* Function buildSymtab constructs the symbol
* table by preorder traversal of the syntax tree
*/
void buildSymtab(TreeNode * syntaxTree)
{
globalScope = newScope("global", Void);
// push global scope
pushScope(globalScope);
//Inser system calls
insertInputFunc();
insertOutputFunc();
insertChangeContextFunc();
insertStackRegisterFunc();
insertStoreRegisterFunc();
insertProcessFinishedFunc();
insertSetPCFunc();
traverse(syntaxTree, insertNode, popAfterInsertProc);
popScope();
if(st_lookup_scope("main") == NULL){
fprintf(errorfile, "ERRO SEMANTICO: Main nao declarada!\n");
}
if (TraceAnalyze)
{
printSymTab(listing);
}
}