-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.java
More file actions
663 lines (567 loc) · 27.2 KB
/
Copy pathParser.java
File metadata and controls
663 lines (567 loc) · 27.2 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
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
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
package ba55_compiler;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Stack;
import ba55_compiler.lexical_ANALyzer.Type;
public class Parser {
static LinkedList<Token> tokens;
static LinkedList parsed = new LinkedList();
//The "table" of the the literals
static LinkedList knownLiterals = new LinkedList();
public Parser(LinkedList list) {
tokens=list;
}
private static int getPrecedence(Token current) {
switch ((Type)current.getType()) {
case ADD:
case SUBTRACT:
return 1;
case MULTIPLY:
case DIVIDE:
return 2;
}
return -1;
}
private static String extractVariableName(Token t) {
String name="";
String theToken=t.toString();
boolean started=false;
boolean finished=false;
for(int i=0;i<theToken.length() & !finished;i = i+1) {
if(theToken.charAt(i) == ',') {
started=true;
}else if(theToken.charAt(i) == '$' | theToken.charAt(i) == '>') {
finished = true;
}else if(started == true) {
name = name + theToken.charAt(i);
}
}
return name;
}
private static String extractVariableValue(Token t) {
String name="";
String theToken=t.toString();
boolean started=false;
boolean finished=false;
if(t.getType().equals(Type.OPERAND) | t.getType().equals(Type.LITERAL)) {
for(int i=0;i<theToken.length() & !finished;i = i+1) {
if(theToken.charAt(i) == ',') {
started=true;
}else if(theToken.charAt(i) == '>') {
finished = true;
}else if(started == true) {
name = name + theToken.charAt(i);
}
}
}else {
for(int i=0;i<theToken.length() & !finished;i = i+1) {
if(theToken.charAt(i) == '$') {
started=true;
}else if(theToken.charAt(i) == '>') {
finished = true;
}else if(started == true) {
name = name + theToken.charAt(i);
}
}
}
return name;
}
private static int evaluateCondition(LinkedList<Token> tokens,int index) {
int i=index+1;
//Check that the if statement is followed by an opening bracket
if(tokens.get(i).getType().equals(Type.OPENBRACKET)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal condition statement --> No openning bracket after 'if' ");
}
//Check if the variable in the brackets is of boolean type
if(tokens.get(i).getType().equals(Type.LITERAL)) {
boolean found = false;
Iterator<Token> iter = knownLiterals.iterator();
String literalName = Parser.extractVariableName(tokens.get(i));
while(iter.hasNext() & !found) {
Token current = iter.next();
String currentTokenName = Parser.extractVariableName(current);
if(currentTokenName.equals(literalName) & current.getType().equals(Type.BOOLEAN) & (Parser.extractVariableValue(current).equals("true") | Parser.extractVariableValue(current).equals("false"))) {
found = true;
}
}
if(found == true) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("The literal in the if condition is not of type BOOLEAN OR it wasnt initialised");
}
if(tokens.size() > i && tokens.get(i).getType().equals(Type.CLOSEBRACKET)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal condition statement --> No closing bracket after 'if' ");
}
}else {
throw new RuntimeException("Illegal form of 'if' expression --> No LITERAL in the condition");
}
//Check that there is an opening parenthesis after the condition
if(i< tokens.size() && tokens.get(i).getType().equals(Type.OPEN)) {
parsed.add(tokens.get(i));
i = i+1;
Token t;
Stack<Token> stack = new Stack<Token>();
boolean closed=false;
for (; i < tokens.size() & !closed; i++) {
t = (Token) tokens.get(i);
//If a closing parenthesis is encountered finish
if(t.getType().equals(Type.CLOSE)) {
parsed.add(tokens.get(i));
closed = true;
}else {
if (t.getType().equals(Type.OPERAND) | t.getType().equals(Type.SEMICOLON)) {
parsed.add(t);
//If a new variable is initialized add it to the "table" of known variables
}else if(t.getType().equals(Type.STRING) | t.getType().equals(Type.CHARACTER) | t.getType().equals(Type.BOOLEAN) | t.getType().equals(Type.INTEGER)){
knownLiterals.add(t);
parsed.add(t);
//If a literal is encountered check if it was initialized before(from the "table") and add it only if it was initialized
}else if(t.getType().equals(Type.LITERAL)) {
String literalName = Parser.extractVariableName(t);
boolean found =false;
Iterator<Token> iter = knownLiterals.iterator();
while(iter.hasNext() & !found) {
String current = Parser.extractVariableName(iter.next());
if(literalName.equals(current)) {
found = true;
}
}
if(found == true) {
parsed.add(t);
}else {
throw new RuntimeException("Undeclared variable -->" + Parser.extractVariableName(t));
}
//If a condition is encountered check that it is in correct form: if<cond> --> <stmt> else--> <stmt>
}else if(t.getType().equals(Type.IF)){
parsed.add(t);
i = Parser.evaluateCondition(tokens, i);
}else if(t.getType().equals(Type.ELSE)) {
throw new RuntimeException("'ELSE' without previous 'IF' token");
}else if(t.getType().equals(Type.WHILE)) {
parsed.add(t);
i = Parser.evaluateWhile(tokens, i);
}else {
if (!stack.isEmpty() && getPrecedence(t) <= getPrecedence(stack.peek())) {
parsed.add(stack.pop());
}
stack.push(t);
}
}
while (!stack.isEmpty()) {
parsed.add(stack.pop());
}
}
if(closed == false) {
throw new RuntimeException("Illegal form of 'if' expression --> No closing parenthesis after the statement");
}
}else {
throw new RuntimeException("Illegal form of 'if' expression --> No opening parenthesis after the condition");
}
//Check if the next token is an ELSE token --> add it to the parsed list if so
if(tokens.get(i).getType().equals(Type.ELSE)) {
parsed.add(tokens.get(i));
i = i+1;
//Check that the else statement is followed by open parenthesis --> If not throw an exception
if(i<tokens.size() && tokens.get(i).getType().equals(Type.OPEN)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal form of 'else' expression --> No opening parenthesis after the else statement");
}
//Now parse all there is inside it and throw an exception if there are no closing parenthesis
Token t;
Stack<Token> stack = new Stack<Token>();
boolean closed=false;
for (; i < tokens.size() & !closed; i++) {
t = (Token) tokens.get(i);
//If a closing parenthesis is encountered finish
if(t.getType().equals(Type.CLOSE)) {
parsed.add(tokens.get(i));
closed = true;
}else {
if (t.getType().equals(Type.OPERAND) | t.getType().equals(Type.SEMICOLON)) {
parsed.add(t);
//If a new variable is initialized add it to the "table" of known variables
}else if(t.getType().equals(Type.STRING) | t.getType().equals(Type.CHARACTER) | t.getType().equals(Type.BOOLEAN) | t.getType().equals(Type.INTEGER)){
knownLiterals.add(t);
parsed.add(t);
//If a literal is encountered check if it was initialized before(from the "table") and add it only if it was initialized
}else if(t.getType().equals(Type.LITERAL)) {
String literalName = Parser.extractVariableName(t);
boolean found =false;
Iterator<Token> iter = knownLiterals.iterator();
while(iter.hasNext() & !found) {
String current = Parser.extractVariableName(iter.next());
if(literalName.equals(current)) {
found = true;
}
}
if(found == true) {
parsed.add(t);
}else {
throw new RuntimeException("Undeclared variable -->" + Parser.extractVariableName(t));
}
//If a condition is encountered check that it is in correct form: if<cond> --> <stmt> else--> <stmt>
}else if(t.getType().equals(Type.IF)){
parsed.add(t);
i = Parser.evaluateCondition(tokens, i);
}else if(t.getType().equals(Type.ELSE)) {
throw new RuntimeException("'ELSE' without previous 'IF' token");
}else if(t.getType().equals(Type.WHILE)) {
parsed.add(t);
i = Parser.evaluateWhile(tokens, i);
}else {
if (!stack.isEmpty() && getPrecedence(t) <= getPrecedence(stack.peek())) {
parsed.add(stack.pop());
}
stack.push(t);
}
}
while (!stack.isEmpty()) {
parsed.add(stack.pop());
}
}
if(closed == false) {
throw new RuntimeException("Illegal form of 'else' expression --> No closing parenthesis after the statement");
}
}
return i - 1;
}
private static int evaluateWhile(LinkedList<Token> tokens,int index) {
int i=index+1;
//Check that the while statement is followed by an opening bracket
if(tokens.get(i).getType().equals(Type.OPENBRACKET)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal condition statement --> No openning bracket after 'while' ");
}
//Check if the variable in the brackets is of boolean type
if(tokens.get(i).getType().equals(Type.LITERAL)) {
boolean found = false;
Iterator<Token> iter = knownLiterals.iterator();
String literalName = Parser.extractVariableName(tokens.get(i));
while(iter.hasNext() & !found) {
Token current = iter.next();
String currentTokenName = Parser.extractVariableName(current);
if(currentTokenName.equals(literalName) & current.getType().equals(Type.BOOLEAN) & (Parser.extractVariableValue(current).equals("true") | Parser.extractVariableValue(current).equals("false"))) {
found = true;
}
}
if(found == true) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("The literal in the while condition is not of type BOOLEAN OR it wasnt initialised");
}
if(tokens.size() > i && tokens.get(i).getType().equals(Type.CLOSEBRACKET)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal condition statement --> No closing bracket after 'while' ");
}
}else {
throw new RuntimeException("Illegal form of 'while' expression --> No LITERAL in the condition");
}
//Check that there is an opening parenthesis after the condition
if(i< tokens.size() && tokens.get(i).getType().equals(Type.OPEN)) {
parsed.add(tokens.get(i));
i = i+1;
Token t;
Stack<Token> stack = new Stack<Token>();
boolean closed=false;
for (; i < tokens.size() & !closed; i++) {
t = (Token) tokens.get(i);
//If a closing parenthesis is encountered finish
if(t.getType().equals(Type.CLOSE)) {
parsed.add(tokens.get(i));
closed = true;
}else {
if (t.getType().equals(Type.OPERAND) | t.getType().equals(Type.SEMICOLON)) {
parsed.add(t);
//If a new variable is initialized add it to the "table" of known variables
}else if(t.getType().equals(Type.STRING) | t.getType().equals(Type.CHARACTER) | t.getType().equals(Type.BOOLEAN) | t.getType().equals(Type.INTEGER)){
knownLiterals.add(t);
parsed.add(t);
//If a literal is encountered check if it was initialized before(from the "table") and add it only if it was initialized
}else if(t.getType().equals(Type.LITERAL)) {
String literalName = Parser.extractVariableName(t);
boolean found =false;
Iterator<Token> iter = knownLiterals.iterator();
while(iter.hasNext() & !found) {
String current = Parser.extractVariableName(iter.next());
if(literalName.equals(current)) {
found = true;
}
}
if(found == true) {
parsed.add(t);
}else {
throw new RuntimeException("Undeclared variable -->" + Parser.extractVariableName(t));
}
//If a condition is encountered check that it is in correct form: if<cond> --> <stmt> else--> <stmt>
}else if(t.getType().equals(Type.IF)){
parsed.add(t);
i = Parser.evaluateCondition(tokens, i);
}else if(t.getType().equals(Type.ELSE)) {
throw new RuntimeException("'ELSE' without previous 'IF' token");
}else if(t.getType().equals(Type.WHILE)) {
parsed.add(t);
i = Parser.evaluateWhile(tokens, i);
}else {
if (!stack.isEmpty() && getPrecedence(t) <= getPrecedence(stack.peek())) {
parsed.add(stack.pop());
}
stack.push(t);
}
}
while (!stack.isEmpty()) {
parsed.add(stack.pop());
}
}
if(closed == false) {
throw new RuntimeException("Illegal form of 'while' expression --> No closing parenthesis after the statement");
}
}else {
throw new RuntimeException("Illegal form of 'while' expression --> No opening parenthesis after the condition");
}
return i -1;
}
private static Token extractInitial(Token t){
String thisTokenName = Parser.extractVariableName(t);
Iterator<Token> iter = knownLiterals.iterator();
Token raw = null;
boolean found = false;
while(iter.hasNext() & !found) {
Token current = iter.next();
String currentName = Parser.extractVariableName(current);
if((!current.getType().equals(Type.LITERAL)) & currentName.equals(thisTokenName)) {
found =true;
raw = current;
}
}
return raw;
}
private static boolean arithmeticExpression(LinkedList<Token> tokens,int index) {
int i = index;
boolean isValid = true;
while(i < tokens.size() & isValid & (!tokens.get(i).getType().equals(Type.SEMICOLON))){
if(!(tokens.get(i).getType().equals(Type.OPERAND) | tokens.get(i).getType().equals(Type.ADD) | tokens.get(i).getType().equals(Type.SUBTRACT) | tokens.get(i).getType().equals(Type.MULTIPLY) | tokens.get(i).getType().equals(Type.DIVIDE))){
isValid = false;
}
i = i+1;
}
return isValid;
}
private static int evaluateAssignment(LinkedList<Token> tokens,int index) {
int i =index;
//Check that the previous token is a Literal --> if not throw an exception
if(tokens.get(i).getType().equals(Type.LITERAL)) {
Token toAssign = tokens.get(i);
i = i+1;
//Add the assignment token to the parsed list
parsed.add(tokens.get(i));
i = i+1;
//Check that the values that we want to assign are the same type --> if not throw a type mismatch
if(Parser.extractInitial(toAssign).getType().equals(Type.STRING) & tokens.get(i).getType().equals(Type.STRINGLITERAL)) {
parsed.add(tokens.get(i));
i = i+1;
}else if(Parser.extractInitial(toAssign).getType().equals(Type.INTEGER) & Parser.arithmeticExpression(tokens, i)) {
parsed.add(tokens.get(i));
i = i+1;
}else if(Parser.extractInitial(toAssign).getType().equals(Type.INTEGER) & tokens.get(i).getType().equals(Type.STRINGLITERAL)) {
throw new RuntimeException("Type mismatch in ASSIGMENT --> CANNOT ASSIGN "+Type.STRINGLITERAL+" to "+Parser.extractInitial(toAssign).getType());
}else if(Parser.extractInitial(toAssign).getType().equals(Type.STRING) & Parser.arithmeticExpression(tokens, i)) {
throw new RuntimeException("Type mismatch in ASSIGMENT --> CANNOT ASSIGN arithmetic expression to "+Parser.extractInitial(toAssign).getType());
}else if((tokens.get(i).getType().equals(Type.LITERAL) | tokens.get(i).getType().equals(Type.OPERAND)) & Parser.extractInitial(toAssign).getType().equals(Type.CHARACTER)) {
if(Parser.extractVariableValue(tokens.get(i)).length() == 1) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("INVALID CHARACHTER ASSINGMENT --> cannot assign "+Parser.extractVariableValue(tokens.get(i))+" to CHARACHTER");
}
}else if(Parser.extractInitial(toAssign).getType().equals(Parser.extractInitial(tokens.get(i)).getType())){
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Type mismatch in ASSIGMENT --> CANNOT ASSIGN "+Parser.extractInitial(tokens.get(i)).getType()+" to "+Parser.extractInitial(toAssign).getType());
}
}else {
throw new RuntimeException("Evaluation error --> The Variable before the aasigment is not a LITERAL");
}
return i - 1;
}
private static boolean checkKnown(Token t) {
Token toCheck = t;
String tokenName = Parser.extractVariableName(toCheck);
boolean found = false;
Iterator<Token> iter = knownLiterals.iterator();
while(iter.hasNext() & !found) {
Token current =iter.next();
String currentName = Parser.extractVariableName(current);
if(currentName.equals(tokenName)) {
found = true;
}
}
return found;
}
private static String extractFunctionType(Token t) {
String type = "";
String function = t.toString();
int i = 0;
boolean started = false;
while(function.charAt(i) != ',') {
if(function.charAt(i) == '_') {
started = true;
i = i+1;
}else if(started == true) {
type = type + function.charAt(i);
i = i+1;
}else {
i = i+1;
}
}
return type;
}
private static int evaluateFunction(LinkedList<Token> tokens,int index) {
//We don't have to verify the structure of the function because the lexer already did this,
//We only check the correctness of the syntax
int i=index;
//Keep the function type so that we can compare it to the return type
String functionType = Parser.extractFunctionType(tokens.get(i));
i = i+1;
//Add the name of the function to the parsed list -->only if it is a literal
if(tokens.get(i).getType().equals(Type.LITERAL)) {
parsed.add(tokens.get(i));
i = i+1;
}else {
throw new RuntimeException("Illegal function name --> "+tokens.get(i).toString());
}
//Parse the function and check the return value
Stack<Token> stack = new Stack<Token>();
Token t;
boolean finished = false;
for (; i < tokens.size() & !finished; i++) {
t = (Token) tokens.get(i);
if (t.getType().equals(Type.OPERAND) | t.getType().equals(Type.SEMICOLON)) {
parsed.add(t);
//If a new variable is initialized add it to the "table" of known variables
}else if(t.getType().equals(Type.STRING) | t.getType().equals(Type.CHARACTER) | t.getType().equals(Type.BOOLEAN) | t.getType().equals(Type.INTEGER) ){
knownLiterals.add(t);
parsed.add(t);
//If a literal is encountered check if it was initialized before(from the "table") and add it only if it was initialized
}else if(t.getType().equals(Type.LITERAL)) {
boolean found = Parser.checkKnown(t);
if(found == true) {
parsed.add(t);
}else {
throw new RuntimeException("Undeclared variable -->" + Parser.extractVariableName(t));
}
//If a condition is encountered check that it is in correct form: if<cond> --> <stmt> else--> <stmt>
}else if(t.getType().equals(Type.IF)){
parsed.add(t);
i = Parser.evaluateCondition(tokens, i);
}else if(t.getType().equals(Type.ELSE)) {
throw new RuntimeException("'ELSE' without previous 'IF' token");
//If a while loop is encountered check that it is in correct form: while<cond> --> <stmt>
}else if(t.getType().equals(Type.WHILE)) {
parsed.add(t);
i = Parser.evaluateWhile(tokens, i);
}else if(t.getType().equals(Type.ASSIGNMENT)) {
i = Parser.evaluateAssignment(tokens, i -1);
}else if(t.getType().equals(Type.FUNCTION_BOOLEAN) | t.getType().equals(Type.FUNCTION_CHARACTER) | t.getType().equals(Type.FUNCTION_INTEGER) | t.getType().equals(Type.FUNCTION_STRING) | t.getType().equals(Type.FUNCTION_VOID)){
parsed.add(t);
i = Parser.evaluateFunction(tokens, i);
}else if(t.getType().equals(Type.RETURN)){
parsed.add(t);
i = i+1;
t = (Token) tokens.get(i);
parsed.add(t);
if(t.getType().equals(Type.LITERAL) && Parser.checkKnown(t)) {
//Compare it to the function type
String theReturnType = Parser.extractInitial(t).getTypeString();
if(!theReturnType.equals(functionType)) {
throw new RuntimeException("The return type doesn't match the function type");
}
}else {
throw new RuntimeException("Undeclared variable in return value");
}
}else if(t.getType().equals(Type.CLOSE)){
parsed.add(t);
finished = true;
}else if(t.getType().equals(Type.OPEN)){
parsed.add(t);
}else if(t.getType().equals(Type.OPENBRACKET)){
parsed.add(t);
}else if(t.getType().equals(Type.CLOSEBRACKET)){
parsed.add(t);
}else {
if (!stack.isEmpty() && getPrecedence(t) <= getPrecedence(stack.peek())) {
parsed.add(stack.pop());
}
stack.push(t);
}
}
while (!stack.isEmpty()) {
parsed.add(stack.pop());
}
return i -1 ;
}
public LinkedList parse() {
Stack<Token> stack = new Stack<Token>();
Token t;
for (int i = 0; i < tokens.size(); i++) {
t = (Token) tokens.get(i);
if (t.getType().equals(Type.OPERAND) | t.getType().equals(Type.SEMICOLON)) {
parsed.add(t);
//If a new variable is initialized add it to the "table" of known variables
}else if(t.getType().equals(Type.STRING) | t.getType().equals(Type.CHARACTER) | t.getType().equals(Type.BOOLEAN) | t.getType().equals(Type.INTEGER) ){
knownLiterals.add(t);
parsed.add(t);
//If a literal is encountered check if it was initialized before(from the "table") and add it only if it was initialized
}else if(t.getType().equals(Type.LITERAL)) {
boolean found = Parser.checkKnown(t);
if(found == true) {
parsed.add(t);
}else {
throw new RuntimeException("Undeclared variable -->" + Parser.extractVariableName(t));
}
//If a condition is encountered check that it is in correct form: if<cond> --> <stmt> else--> <stmt>
}else if(t.getType().equals(Type.IF)){
parsed.add(t);
i = Parser.evaluateCondition(tokens, i);
}else if(t.getType().equals(Type.ELSE)) {
throw new RuntimeException("'ELSE' without previous 'IF' token");
//If a while loop is encountered check that it is in correct form: while<cond> --> <stmt>
}else if(t.getType().equals(Type.WHILE)) {
parsed.add(t);
i = Parser.evaluateWhile(tokens, i);
}else if(t.getType().equals(Type.ASSIGNMENT)) {
i = Parser.evaluateAssignment(tokens, i -1);
}else if(t.getType().equals(Type.FUNCTION_BOOLEAN) | t.getType().equals(Type.FUNCTION_CHARACTER) | t.getType().equals(Type.FUNCTION_INTEGER) | t.getType().equals(Type.FUNCTION_STRING) | t.getType().equals(Type.FUNCTION_VOID)){
parsed.add(t);
i = Parser.evaluateFunction(tokens, i);
}else if(t.getType().equals(Type.CLOSE)){
parsed.add(t);
}else if(t.getType().equals(Type.OPEN)){
parsed.add(t);
}else {
if (!stack.isEmpty() && getPrecedence(t) <= getPrecedence(stack.peek())) {
parsed.add(stack.pop());
}
stack.push(t);
}
}
while (!stack.isEmpty()) {
parsed.add(stack.pop());
}
return parsed;
}
}