blob: 32049f58f5cb9099d7d88145469b25ffab04623e (
plain)
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
|
package ast.nodes;
import ast.types.*;
import java.util.ArrayList;
import semanticanalysis.SemanticError;
import semanticanalysis.SymbolTable;
/**
* Node for the `testlist_comp` statement of the grammar.
*/
public class TestlistCompNode implements Node {
private final ArrayList<Node> exprs;
private final CompForNode comp;
public TestlistCompNode(ArrayList<Node> exprs, Node comp) {
this.exprs = exprs;
this.comp = (CompForNode) comp;
}
@Override
public ArrayList<SemanticError> checkSemantics(SymbolTable ST, int _nesting) {
ArrayList<SemanticError> errors = new ArrayList<>();
if (comp != null) {
// if comp is set, then we save the atom in the ST (we assume the first expr is
// an atom)
String id = ((ExprNode) exprs.get(0)).getId();
Type t = ((ExprNode) exprs.get(0)).typeCheck();
ST.insert(id, t, _nesting, "");
// errors.addAll(comp.checkSemantics(ST, _nesting));
} else {
// if comp is not set, then exprs is a list of 1 or more element
for (var param : exprs) {
var exp = (ExprNode) param;
ST.insert(exp.getId(), exp.typeCheck(), _nesting, "");
errors.addAll(param.checkSemantics(ST, _nesting));
}
}
return errors;
}
public int getSize() {
return exprs.size();
}
/**
* Returns the i-th expressions of `exprs` field. If the index is greater or
* equals than the size return `null`.
*/
public Node getElem(int i) {
if (i >= this.exprs.size()) {
return null;
}
return exprs.get(i);
}
@Override
public Type typeCheck() {
return new VoidType();
}
// TODO: code generation for expr list
@Override
public String codeGeneration() {
return "";
}
@Override
public String toPrint(String prefix) {
String str = prefix + "Testlist_comp\n";
prefix += " ";
for (var param : exprs) {
str += param.toPrint(prefix);
}
return str;
}
}
|
