-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSemanticAnalysis.cpp
More file actions
154 lines (96 loc) · 2.01 KB
/
SemanticAnalysis.cpp
File metadata and controls
154 lines (96 loc) · 2.01 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
#include <string>
#include "SemanticAnalysis.h"
using namespace std;
void SemanticAnalysis::getSymbolListIndex(list<SymbolItem> slist) {
int i = 0;
for (auto it = slist.begin(); it != slist.end(); it++) {
toSymbolList[i] = it;
i++;
}
}
int SemanticAnalysis::entry(string name) {
list<SymbolItem>::iterator tmp;
int i;
for (i = 0; i < symbol_num; i++) {
tmp = toSymbolList[i];
if ((*tmp).name == name)
return i;
}
}
int SemanticAnalysis::getAddr(string name) {
int i;
list<SymbolItem>::iterator tmp;
for (i = 0; i < symbol_num; i++) {
tmp = toSymbolList[i];
if ((*tmp).name == name) {
return (*tmp).addr;
}
}
}
void SemanticAnalysis::addAddr(int index, int address) {
(*toSymbolList[index]).addr = address;
}
void SemanticAnalysis::addType(int index, int type) {
(*toSymbolList[index]).type = type;
}
void SemanticAnalysis::Gen(string op, int arg1, int arg2, int result) {
Code c;
c.op = op;
c.arg1 = arg1;
c.arg2 = arg2;
c.result = result;
codes[nextquad] = c;
nextquad++;
}
int SemanticAnalysis::newtemp() {
return mid_index;
}
vector<int> SemanticAnalysis::makelist(int quad) {
vector<int> v;
v.push_back(quad);
return v;
}
vector<int> SemanticAnalysis::merge(vector<int> v1, vector<int> v2) {
vector<int> v;
int i, j;
bool flag = false;
for (i = 0; i < v1.size(); i++) {
v.push_back(v1[i]);
}
for (i = 0; i < v2.size(); i++) {
//ÅжÏÊÇ·ñÒѾ´æÔÚ
for (j = 0; j < v1.size(); j++) {
if (v2[i] == v1[j]) {
flag = true;
break;
}
}
if (flag)
continue;
v.push_back(v2[i]);
}
return v;
}
void SemanticAnalysis::backpatch(vector<int> p, int quad) {
int i, index;
for (i = 0; i < p.size(); i++) {
index = p[i];
codes[index].result = quad;
}
}
void SemanticAnalysis::translate(Production p) {
string pleft, pright;
vector<string> right;
int i;
pleft = p.pleft;
pright = p.pright;
right = p.right;
if (pleft == "Y") {
if (pright == "OY") {
}
}
else if (pleft == "O") {
if (pright == "C") {
}
}
}