-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexpression.cpp
executable file
·533 lines (511 loc) · 13 KB
/
expression.cpp
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
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
/* implementace metod tridy Expression */
#include "program.h"
Node* Expression::Y(){
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case IDENTIFICATOR:
case NEW:
case NOT:
case MINUS:
case NULL_KEY:
return YC(X());
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, -, !, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::YC(Node* n){
switch(token.getType()){
case ASIGNMENT:{
token = lexan->nextToken();
statement = true;
Node* as = new Assignment(n,YC(X()));
as->setLine(lexan->getLine());
return as;
}
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu =, ), \',\' , ; na radku ",lexan->getLine()));
return n;
}
}
Node* Expression::X(){
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case IDENTIFICATOR:
case NEW:
case NOT:
case MINUS:
case NULL_KEY:
return XC(B());
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, -, !, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::XC(Node* n){
Node* temp;
switch(token.getType()){
case AND:
token = lexan->nextToken();
temp = new And(n,B());
temp->setLine(lexan->getLine());
return XC(temp);
case OR:
token = lexan->nextToken();
temp = new Or(n,B());
temp->setLine(lexan->getLine());
return XC(temp);
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
Node* Expression::B(){
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case IDENTIFICATOR:
case NEW:
case NOT:
case MINUS:
case NULL_KEY:
return BC(E());
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, -, !, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::BC(Node* n){
Node* temp;
switch(token.getType()){
case EQUAL:
token = lexan->nextToken();
temp = new Equal(n,E());
temp->setLine(lexan->getLine());
return temp;
case NOT_EQUAL:
token = lexan->nextToken();
temp = new NotEqual(n,E());
temp->setLine(lexan->getLine());
return temp;
case GREATER:
token = lexan->nextToken();
temp = new Greater(n,E());
temp->setLine(lexan->getLine());
return temp;
case GREATER_OR_EQUAL:
token = lexan->nextToken();
temp = new GreaterOrEqual(n,E());
temp->setLine(lexan->getLine());
return temp;
case LESSER:
token = lexan->nextToken();
temp = new Lesser(n,E());
temp->setLine(lexan->getLine());
return temp;
case LESSER_OR_EQUAL:
token = lexan->nextToken();
temp = new LesserOrEqual(n,E());
temp->setLine(lexan->getLine());
return temp;
case AND:
case OR:
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu ==, !=, <,\n<=, >, >=, &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
Node* Expression::E(){
Node* temp;
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case NULL_KEY:
case IDENTIFICATOR:
case NEW:
return EC(T());
case MINUS:
token = lexan->nextToken();
temp = new UnaryMinus(T());
temp->setLine(lexan->getLine());
return EC(temp);
case NOT:
token = lexan->nextToken();
temp = new Negation(T());
temp->setLine(lexan->getLine());
return EC(temp);
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, -, !, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::EC(Node* n){
Node* temp;
switch (token.getType()) {
case PLUS:
token = lexan->nextToken();
temp = new Plus(n,T());
temp->setLine(lexan->getLine());
return EC(temp);
case MINUS:
token = lexan->nextToken();
temp = new Minus(n,T());
temp->setLine(lexan->getLine());
return EC(temp);
case EQUAL:
case NOT_EQUAL:
case GREATER:
case GREATER_OR_EQUAL:
case LESSER:
case LESSER_OR_EQUAL:
case AND:
case OR:
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu +, -, ==, !=, <,\n<=, >, >=, &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
Node* Expression::T(){
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case IDENTIFICATOR:
case NEW:
case NULL_KEY:
return TC(F());
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::TC(Node* n){
Node* temp;
switch (token.getType()) {
case MUL:
token = lexan->nextToken();
temp = new Mul(n,F());
temp->setLine(lexan->getLine());
return TC(temp);
case DIV:
token = lexan->nextToken();
temp = new Div(n,F());
temp->setLine(lexan->getLine());
return TC(temp);
case PLUS:
case MINUS:
case EQUAL:
case NOT_EQUAL:
case GREATER:
case GREATER_OR_EQUAL:
case LESSER:
case LESSER_OR_EQUAL:
case AND:
case OR:
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu *, /, +, -, ==, !=, <,\n<=, >, >=, &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
Node* Expression::F(){
Node* result;
switch (token.getType()) {
case INTEGER:
result = new Constant(new Integer(token.getIntValue()));
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case DOUBLE:
result = new Constant(new Double(token.getDoubleValue()));
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case STRING:
result = new Constant(new String(token.getCharValue()));
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case TRUE:
result = new Constant(new Boolean(true));
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case FALSE:
result = new Constant(new Boolean(false));
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case NULL_KEY:
result = new Constant(new Null());
result->setLine(lexan->getLine());
token = lexan->nextToken();
return result;
case OPEN_ROUND_BRACKET:
token = lexan->nextToken();
result = Y();
if (token.getType() != CLOSE_ROUND_BRACKET)
setError(new ParserException("Ocekavana ) na radku ",lexan->getLine()));
token = lexan->nextToken();
return result;
case IDENTIFICATOR:
return F6(NULL);
case NEW:{
statement = true;
token = lexan->nextToken();
if (token.getType()!=IDENTIFICATOR){
setError(new ParserException("Ocekavan identifikator na radku ",lexan->getLine()));
return NULL;
}
LexElement type = token;
token = lexan->nextToken();
if (token.getType()!=OPEN_ROUND_BRACKET){
setError(new ParserException("Ocekavana ( na radku ",lexan->getLine()));
return NULL;
}
token = lexan->nextToken();
/*pouze konstruktor bez parametru*/
//HelperParams* parrams = F3(new HelperParams());
HelperParams* params = new HelperParams();
if(token.getType()!=CLOSE_ROUND_BRACKET){
setError(new ParserException("Ocekavana ) na radku ",lexan->getLine()));
}
result = new OperatorNew(type.getCharValue(),params->getParams(),this);
result->setLine(lexan->getLine());
delete params;
token = lexan->nextToken();
return F5(result);
}
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, cislo, retezec, true, false, identifikator, new, null na radku ",lexan->getLine()));
return NULL;
}
}
Node* Expression::FC(Node* n, char* name){
Node* result;
switch(token.getType()){
case OPEN_ROUND_BRACKET:{
statement = true;
token = lexan->nextToken();
HelperParams* parrams = F3(new HelperParams());
result = new FunctionCall(n,name,parrams->getParams(),this);
result->setLine(lexan->getLine());
delete parrams;
token = lexan->nextToken();
return result;
}
case DOT:
case MUL:
case DIV:
case PLUS:
case MINUS:
case EQUAL:
case NOT_EQUAL:
case GREATER:
case GREATER_OR_EQUAL:
case LESSER:
case LESSER_OR_EQUAL:
case AND:
case OR:
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
result = new Variable(n,name,this);
result->setLine(lexan->getLine());
return result;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu (, ., *, /, +, -, ==, !=, <,\n<=, >, >=, &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
HelperParams* Expression::F3(HelperParams* hiap){
switch(token.getType()){
case OPEN_ROUND_BRACKET:
case INTEGER:
case DOUBLE:
case STRING:
case TRUE:
case FALSE:
case IDENTIFICATOR:
case NEW:
case NOT:
case MINUS:
case NULL_KEY:
hiap->addParam(Y());
return F4(hiap);
case CLOSE_ROUND_BRACKET:
return hiap;
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu (, ), cislo, retezec, true, false, identifikator, new, -, !, null na radku ",lexan->getLine()));
return hiap;
}
}
HelperParams* Expression::F4(HelperParams* hiap){
switch(token.getType()){
case COMMA:
token = lexan->nextToken();
hiap->addParam(Y());
return F4(hiap);
case CLOSE_ROUND_BRACKET:
return hiap;
default:
setError(new ParserException("Ocekavan jeden z nasledujicich elementu \',\', ) na radku ",lexan->getLine()));
return hiap;
}
}
Node* Expression::F5(Node* n){
switch(token.getType()){
case DOT:
token = lexan->nextToken();
return F6(n);
case MUL:
case DIV:
case PLUS:
case MINUS:
case EQUAL:
case NOT_EQUAL:
case GREATER:
case GREATER_OR_EQUAL:
case LESSER:
case LESSER_OR_EQUAL:
case AND:
case OR:
case ASIGNMENT:
case CLOSE_ROUND_BRACKET:
case COMMA:
case SEMICOLON:
return n;
default:
setError(new ParserException(
"Ocekavan jeden z nasledujicich elementu ., *, /, +, -, ==, !=, <,\n<=, >, >=, &&, ||, =, ), \',\' , ; na radku "
,lexan->getLine()));
return n;
}
}
Node* Expression::F6(Node* n){
switch(token.getType()){
case IDENTIFICATOR:{
LexElement name = token;
token = lexan->nextToken();
return F5(FC(n,name.getCharValue()));
}
default:
setError(new ParserException("Ocekavan identifikator na radku ",lexan->getLine()));
return n;
}
}
Expression::Expression(){
error = NULL;
c = NULL;
b = NULL;
statement = true;
}
Expression::Expression(Lexan* lexan, LexElement& token){
error = NULL;
this->lexan = lexan;
this->token = token;
c = NULL;
b = NULL;
statement = false;
parsedExpression = Y();
}
Value* Expression::findValue(char* name, bool local){
if (c!=NULL)
/* deklarace ve tride */
return c->getField(name);
if (b!=NULL){
/* lokalni deklarace */
return b->findValue(name,local);
}
return NULL;
}
Class* Expression::parentClass(){
if (c!=NULL)
return c;
else
return b->getClass();
}
void copyValue(Value* v, Value* val){
if (v->getType()==INT_VALUE){
Integer* iv = (Integer*)v;
Integer* ival = (Integer*)val;
ival->setValue(iv->getValue());
}
else if (v->getType()==DOUBLE_VALUE){
Double* iv = (Double*)v;
Double* ival = (Double*)val;
ival->setValue(iv->getValue());
}
else if (v->getType()==BOOLEAN_VALUE){
Boolean* iv = (Boolean*)v;
Boolean* ival = (Boolean*)val;
ival->setValue(iv->getValue());
}
else if (v->getType()==STRING_VALUE){
String* iv = (String*)v;
String* ival = (String*)val;
ival->setValue(iv->getValue());
}
else if (v->getType()==OBJECT_VALUE){
Object* iv = (Object*)v;
Object* ival = (Object*)val;
ival->setClass(iv->getClass());
ival->setValue(iv->getValue());
ival->setNull(iv->isNull());
}
}