-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.c
178 lines (163 loc) · 4.82 KB
/
util.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
#include "globals.h"
#include "util.h"
void printToken( TipoToken token, const char* tokenString )
{
switch (token)
{
case IF: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case ELSE: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case INT: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case RETURN: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case VOID: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case WHILE: fprintf(listing, "Reserved Word: %s\n",tokenString); break;
case IGUAL: fprintf(listing,"Symbol: =\n"); break;
case MENOR: fprintf(listing,"<\n"); break;
case COMP: fprintf(listing,"==\n"); break;
case MAIOR: fprintf(listing,">\n"); break;
case MEIGUAL: fprintf(listing, "<=\n"); break;
case MAIGUAL: fprintf(listing, ">=\n"); break;
case DIF: fprintf(listing, "!=\n"); break;
case COLC1: fprintf(listing, "[\n"); break;
case COLC2: fprintf(listing, "]\n"); break;
case CH1: fprintf(listing, "{\n"); break;
case CH2: fprintf(listing, "}\n"); break;
case PAR1: fprintf(listing,"(\n"); break;
case PAR2: fprintf(listing,")\n"); break;
case PVIRG: fprintf(listing,";\n"); break;
case VIRG: fprintf(listing,",\n"); break;
case SUM: fprintf(listing,"+\n"); break;
case SUB: fprintf(listing,"-\n"); break;
case MULT: fprintf(listing,"*\n"); break;
case DIV: fprintf(listing,"/\n"); break;
case FIM: fprintf(listing,"EOF\n"); break;
case NUM: fprintf(listing,"Number: %s\n",tokenString); break;
case ID: fprintf(listing,"ID: %s\n",tokenString); break;
case ERROR: fprintf(listing,"ERROR: %s\n",tokenString); break;
default: fprintf(listing,"Token Desconhecido: %d\n",token);
}
}
NoArvore * newStmtNode(TipoDeclaracao tipo)
{
NoArvore * t = (NoArvore *) malloc(sizeof(NoArvore));
int i;
if (t==NULL)
fprintf(listing,"Out of memory error at line %d\n",lineno);
else {
for (i=0;i<MAXFILHOS;i++) t->filho[i] = NULL;
t->irmao = NULL;
t->tipoNo = DECLARACAO;
t->tipo.dcl = tipo;
t->lineno = lineno;
}
return t;
}
NoArvore * newExpNode(IdExpressao tipo)
{
NoArvore * t = (NoArvore *) malloc(sizeof(NoArvore));
int i;
if (t==NULL)
fprintf(listing,"Out of memory error at line %d\n",lineno);
else {
for (i=0;i<MAXFILHOS;i++)
t->filho[i] = NULL;
t->irmao = NULL;
t->tipoNo = EXP;
t->tipo.exp = tipo;
t->lineno = lineno;
t->tipoExp = Void;
}
return t;
}
char * copyString(char * s)
{
int n;
char * t;
if (s==NULL) return NULL;
n = strlen(s)+1;
t = malloc(n);
if (t==NULL)
fprintf(listing,"Out of memory error at line %d\n",lineno);
else strcpy(t,s);
return t;
}
static int indentno = 0;
#define INDENT indentno+=2
#define UNINDENT indentno-=2
static void printSpaces(void)
{
int i;
for (i=0;i<indentno;i++)
fprintf(listing," ");
}
void printTree( NoArvore * tree )
{
int i;
INDENT;
while (tree != NULL) {
printSpaces();
if (tree->tipoNo==DECLARACAO)
{
switch (tree->tipo.dcl) {
case IFt:
fprintf(listing,"If\n");
break;
case IGUALt:
fprintf(listing,"Atribuicao\n");
break;
case WHILEt:
fprintf(listing,"While\n");
break;
case VARIAVEL:
fprintf(listing,"Variavel %s\n", tree->atr.nome);
break;
case VETORt:
fprintf(listing,"Vetor %s\n", tree->atr.nome);
break;
case PARAMETRO:
fprintf(listing,"Parametro %s\n", tree->atr.nome);
break;
case FUNCAO:
fprintf(listing,"Funcao %s\n", tree->atr.nome);
break;
case CALL:
fprintf(listing,"Chamada da funcao %s\n", tree->atr.nome);
break;
case RETURNt:
fprintf(listing, "Return\n");
break;
default:
fprintf(listing,"Tipo de nó de declaracao desconhecido\n");
break;
}
}
else if (tree->tipoNo==EXP)
{
switch (tree->tipo.exp) {
case OPERACAO:
fprintf(listing,"Operacao: ");
printToken(tree->atr.op,"\0");
break;
case CONSTANTE:
fprintf(listing,"Constante: %d\n",tree->atr.val);
break;
case IDt:
fprintf(listing,"Id: %s\n",tree->atr.nome);
break;
case VETOR:
fprintf(listing,"Vetor: %s\n",tree->atr.nome);
break;
case TIPO:
fprintf(listing,"Tipo %s\n",tree->atr.nome);
break;
default:
fprintf(listing,"Tipo de nó de expressao desconhecido\n");
break;
}
}
else fprintf(listing,"Unknown node kind\n");
for (i=0;i<MAXFILHOS;i++)
printTree(tree->filho[i]);
tree = tree->irmao;
}
UNINDENT;
}