Repository navigation
Expand file tree
/
Copy pathExecuter.cpp
More file actions
370 lines (302 loc) · 11.4 KB
/
Copy pathExecuter.cpp
File metadata and controls
370 lines (302 loc) · 11.4 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
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
#include <iostream>
#include <cmath>
#include "Lex.cpp"
#include "Stack.cpp"
#include "Poliz.cpp"
#include "Ident.cpp"
#include "Parser.cpp"
using namespace std;
class Executer { // обработчик всегоооооо
Parser parser;
Stack<Lex,100> stack;
Stack<int, 100> minus;
Stack<int, 100> plus;
int index;
Lex lex, lex_1, lex_2;
Ident id;
double d_op_1, d_op_2; // операнды
int i_op_1, i_op_2; // операнды
string tmp;
private:
void lex_from_address(Lex &lex, tabl_Ident &TID);
void execute(tabl_Ident &TID, Poliz &P);
public:
Executer(const char* program) : parser(program), index(0) { }
~Executer() {}
void run() {
parser.analize();
execute(parser.TID, parser.P);
}
};
void Executer::execute(tabl_Ident &TID, Poliz &P) {
TID.print();
P.print();
while(index != P.get_top()) {
lex = P[index++];
switch(lex.get_type()) {
case LEX_INT :
case LEX_BOOL :
case LEX_DOUBLE :
case LEX_STR :
case LEX_ENDL :
case POLIZ_ADDRESS :
case POLIZ_LABEL :
stack.push(lex);
break;
case LEX_SEMICOLON :
stack.clear();
while(!plus.empty()) {
i_op_1 = plus.pop();
d_op_1 = 1 + atof(TID[i_op_1].get_value().c_str());
if(TID[i_op_1].get_type() == LEX_DOUBLE)
TID[i_op_1].put_value(to_string(d_op_1));
else
TID[i_op_1].put_value(to_string((int)d_op_1));
}
while(!minus.empty()) {
i_op_1 = minus.pop();
d_op_1 = -1 + atof(TID[i_op_1].get_value().c_str());
if(TID[i_op_1].get_type() == LEX_DOUBLE)
TID[i_op_1].put_value(to_string(d_op_1));
else
TID[i_op_1].put_value(to_string((int)d_op_1));
}
break;
case LEX_OUT:
lex = stack.pop();
switch(lex.get_type()) {
case LEX_ENDL :
cout << endl;
break;
case POLIZ_ADDRESS:
cout << TID[atoi(lex.get_value().c_str())].get_value();
break;
default :
cout << lex.get_value();
break;
}
break;
case LEX_IN:
lex = stack.pop();
id = TID[atoi(lex.get_value().c_str())];
cin >> tmp;
switch (id.get_type()) {
case LEX_INT :
id.put_value(to_string(atoi(tmp.c_str())));
break;
case LEX_BOOL :
tmp = tmp == "true" ? "1" : "0";
id.put_value(to_string(atoi(tmp.c_str())));
break;
case LEX_DOUBLE :
id.put_value(to_string(atof(tmp.c_str())));
break;
}
TID[atoi(lex.get_value().c_str())] = id;
break;
case LEX_EQ:
lex_2 = stack.pop();
if(lex_2.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_2, TID);
lex_1 = stack.pop();
id = TID[atoi(lex_1.get_value().c_str())];
switch (id.get_type()) {
case LEX_INT :
id.put_value(to_string(atoi(lex_2.get_value().c_str())));
break;
case LEX_BOOL :
d_op_2 = atof(lex_2.get_value().c_str());
tmp = d_op_2 != 0 ? "1" : "0";
id.put_value(to_string(atoi(tmp.c_str())));
break;
case LEX_DOUBLE :
id.put_value(to_string(atof(lex_2.get_value().c_str())));
break;
}
TID[atoi(lex_1.get_value().c_str())] = id;
lex_from_address(lex_1, TID);
stack.push(lex_1);
break;
case LEX_PLUS:
case LEX_MINUS:
case LEX_POW:
case LEX_SLASH:
case LEX_TIMES:
case LEX_MOD:
lex_2 = stack.pop();
if(lex_2.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_2, TID);
lex_1 = stack.pop();
if(lex_1.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_1, TID);
if(lex_1.get_type() == LEX_DOUBLE || lex_2.get_type() == LEX_DOUBLE) {
d_op_1 = atof(lex_1.get_value().c_str());
d_op_2 = atof(lex_2.get_value().c_str());
switch(lex.get_type()) {
case LEX_PLUS:
d_op_1 += d_op_2;
break;
case LEX_MINUS:
d_op_1 -= d_op_2;
break;
case LEX_POW:
d_op_1 = pow(d_op_1, d_op_2);
break;
case LEX_SLASH:
if(d_op_2 == 0)
throw Exception(lex_2,Division_by_zero);
d_op_1 /= d_op_2;
break;
case LEX_TIMES:
d_op_1 *= d_op_2;
break;
}
stack.push(Lex(LEX_DOUBLE, -1, to_string(d_op_1)));
}
else {
i_op_1 = atoi(lex_1.get_value().c_str());
i_op_2 = atoi(lex_2.get_value().c_str());
switch(lex.get_type()) {
case LEX_PLUS:
i_op_1 += i_op_2;
break;
case LEX_MINUS:
i_op_1 -= i_op_2;
break;
case LEX_POW:
i_op_1 = pow(i_op_1, i_op_2);
break;
case LEX_SLASH:
if(i_op_2 == 0)
throw Exception(lex_2,Division_by_zero);
i_op_1 /= i_op_2;
break;
case LEX_TIMES:
i_op_1 *= i_op_2;
break;
case LEX_MOD:
if(i_op_2 == 0)
throw Exception(lex_2,Division_by_zero);
i_op_1 %= i_op_2;
break;
}
stack.push(Lex(LEX_INT, -1, to_string(i_op_1)));
}
break;
case LEX_LSS:
case LEX_GTR:
case LEX_LEQ:
case LEX_NEQ:
case LEX_CMP:
case LEX_GEQ:
case LEX_AND:
case LEX_OR:
lex_2 = stack.pop();
if(lex_2.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_2, TID);
lex_1 = stack.pop();
if(lex_1.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_1, TID);
//cout << lex_1.get_value() << " " << lex_2.get_value() << endl;
d_op_1 = atof(lex_1.get_value().c_str());
d_op_2 = atof(lex_2.get_value().c_str());
switch(lex.get_type()) {
case LEX_LSS:
d_op_1 = d_op_1 < d_op_2;
break;
case LEX_GTR:
d_op_1 = d_op_1 > d_op_2;
break;
case LEX_LEQ:
d_op_1 = d_op_1 <= d_op_2;
break;
case LEX_GEQ:
d_op_1 = d_op_1 >= d_op_2;
break;
case LEX_CMP:
//cout << d_op_1 << " " << d_op_2 << endl;
d_op_1 = d_op_1 == d_op_2;
break;
case LEX_NEQ:
d_op_1 = d_op_1 != d_op_2;
break;
case LEX_AND:
d_op_1 = d_op_1 && d_op_2;
break;
case LEX_OR:
d_op_1 = d_op_1 || d_op_2;
break;
}
stack.push(Lex(LEX_BOOL, -1, to_string((int) d_op_1)));
break;
case LEX_NOT:
lex_1 = stack.pop();
if(lex_1.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_1, TID);
d_op_1 = atof(lex_1.get_value().c_str());
tmp = d_op_1 != 0 ? "0" : "1";
stack.push(Lex(LEX_BOOL, -1, tmp));
break;
case POLIZ_GO:
lex_1 = stack.pop();
index = atoi(lex_1.get_value().c_str());
stack.push(Lex(LEX_BOOL, -1, "1"));
break;
case POLIZ_FGO:
lex_2 = stack.pop();
lex_1 = stack.pop();
if(lex_1.get_type() == POLIZ_ADDRESS)
lex_from_address(lex_1, TID);
d_op_1 = atof(lex_1.get_value().c_str());
if(d_op_1 == 0) {
index = atoi(lex_2.get_value().c_str());
stack.push(Lex(LEX_BOOL, -1, "0"));
}
else stack.push(Lex(LEX_BOOL, -1, "1"));
break;
case LEX_IPLUS:
lex_1 = stack.pop();
stack.push(lex_1);
plus.push(atoi(lex_1.get_value().c_str()));
break;
case LEX_IMINUS:
lex_1 = stack.pop();
stack.push(lex_1);
minus.push(atoi(lex_1.get_value().c_str()));
break;
}
}
}
void Executer:: lex_from_address(Lex &lex, tabl_Ident &TID) {
Ident id = TID[atoi(lex.get_value().c_str())];
lex = Lex(id.get_type(), -1, id.get_value());
}
int main(int argc, char** argv) {
if(argc == 2) {
Executer exec(argv[1]);
try {
exec.run();
}
catch(Exception &ex) {
cout << "Error:" << endl;
cout << ex;
exit(1);
}
catch(const char* str) {
cout << "Error:" << endl;
cout << str << endl;
exit(1);
}
catch (Lex &l) {
cout << "Error:" << l;
exit(1);
}
catch (...) {
cout << "UnlnownError";
exit(1);
}
//cout << "Success" << endl;
}
else cout << "Bad arguments" << endl;
return 0;
}