-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathDodaSymbolTable.cpp
More file actions
275 lines (232 loc) · 6.59 KB
/
DodaSymbolTable.cpp
File metadata and controls
275 lines (232 loc) · 6.59 KB
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
#include <iostream>
#include <unordered_map>
#include <string>
#include <vector>
#include <fstream>
using namespace std;
struct record
{
string name;
string kind;
string type;
};
struct blockNode
{
string parent;
vector<string> childs;
vector<record> records;
};
class DodaSymbolTable
{
public:
DodaSymbolTable()
{
remove("resultsFile.txt");
SymbolTable["block0"].parent = "Global";
currentBlock = "block0";
// addBlock();
}
unordered_map<string, blockNode> SymbolTable;
int blocksNum = 0;
string currentBlock;
record currentRecord;
bool funcFlag = false; // flag for function
bool forFlag = false; // flag fotr loop
vector<record> funcRecords;
bool idenExp = false;
string secondidentifier;
vector<string> matches;
//printing the symbol table
ofstream resultsFile;
void addBlock()
{
blockNode b;
b.parent = currentBlock;
blocksNum++;
vector<string> assOp;
SymbolTable["block" + to_string(blocksNum)] = b;
vector<string> childreen;
childreen = SymbolTable[currentBlock].childs;
string blockName = "block" + to_string(blocksNum);
childreen.push_back(blockName);
SymbolTable[currentBlock].childs = childreen;
// SymbolTable[currentBlock].childs.push_back("block" + to_string(blocksNum)); //add child to parent
currentBlock = "block" + to_string(blocksNum); // from parent to child
if (funcFlag)
{
addRecordFunc();
funcFlag = false;
}
if (forFlag)
{
forFlag = false;
addRecord();
}
}
void closeBlock()
{
// cout << "close block bla bla bla " << endl;
currentBlock = SymbolTable[currentBlock].parent;
}
void addRecord()
{
checkDuplication();
if (!forFlag)
{
SymbolTable[currentBlock].records.push_back(currentRecord);
}
}
void addRecordFunc()
{
for (auto funcRecord : funcRecords)
SymbolTable[currentBlock].records.push_back(funcRecord);
funcRecords.clear();
}
void addMatches(string s)
{
matches.push_back(s);
}
void addToFunc()
{
// cout << "current record ........." << currentRecord.name << endl;
funcRecords.push_back(currentRecord);
}
void printTable()
{
resultsFile.open("resultsFile.txt",std::ios_base::app);
resultsFile << "Symbol Table **************************************************\n";
resultsFile << "blocksnum : " << blocksNum << endl;
for (auto x : SymbolTable)
{
resultsFile << x.first << endl;
printBlock(x.second);
}
cout << "**************************************************\n";
resultsFile.close();
}
void printBlock(blockNode b)
{
string parent;
resultsFile << "parent : " << b.parent << endl;
resultsFile << "printing the records" << endl;
for (auto record : b.records)
{
resultsFile << record.name << " " << record.type << " " << record.kind << endl;
}
resultsFile << "printing the childs" << endl;
for (auto child : b.childs)
{
resultsFile << child << endl;
}
resultsFile << "---------------------------------------------------------\n";
}
/*
Semantics functions
*/
bool checkDuplication()
{
for (auto var : SymbolTable[currentBlock].records)
{
if (var.name == currentRecord.name)
{
// printf(stdout,"\t conflicting declaration ; near line %d\n",yylineno); yyerrok;
cout << "\t conflicting declaration between " + var.type + " " + var.name + " && " + currentRecord.type + " " + currentRecord.name << endl;
return true;
}
}
return false;
}
void checkIdentifier(string identifier, int line)
{
if (forFlag && currentRecord.name == identifier)
{
return;
}
blockNode b = SymbolTable[currentBlock];
bool found = false;
int c = 0;
while (true)
{
for (auto var : b.records)
{
if (var.name == identifier)
{
found = true;
}
}
if (found || b.parent == "Global")
{
break;
}
b = SymbolTable[b.parent];
}
if (!found)
{
cout << "\t' error " << identifier << "'"
<< " was not declared in this scope near line" << to_string(line) << endl;
}
// cout << identifier << " close identifer" << endl;
}
void checkIdentifiersType(int line)
{
if (matches.size() < 2)
{
matches.clear();
return;
}
// cout<<"here3"<<endl;
bool result = false;
// cout << matches[0] << " " << matches[1] << " match one and two"<<endl;
if (matches[0] == "" || matches[1] == "")
{
matches[0] = "";
matches[1] = "";
return;
}
// cout<<"here4"<<endl;
string type1 = getIdenType(matches[0]);
string type2 = getIdenType(matches[1]);
if (type1 == type2)
{
result = true;
}
else
{
cout << " error: type mismatch " << type1 << " " << matches[0] << " && " << type2 << " " << matches[1] << " near line " << to_string(line) << endl;
result = false;
}
matches.clear();
}
string getIdenType(string identifier)
{
string type = "";
blockNode b = SymbolTable[currentBlock];
int c = 0;
while (true)
{
for (auto var : b.records)
{
if (var.name == identifier)
{
type = var.type;
break;
}
}
if (type != "" || b.parent == "Global")
{
break;
}
b = SymbolTable[b.parent];
}
if (forFlag && currentRecord.name == identifier)
{
return currentRecord.type;
}
return type;
}
~DodaSymbolTable()
{
resultsFile << "-----------------------------------------------------------------------------\n";
printTable();
}
};