blob: 96132d823f1b12c366e4d425933ae6e15d2c7fc5 (
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
|
package ast.nodes;
import ast.types.*;
import java.util.ArrayList;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import semanticanalysis.SemanticError;
import semanticanalysis.SymbolTable;
/**
* Node for the `atom` statement of the grammar.
*/
public class AtomNode implements Node {
protected String val;
public AtomNode(String val) {
this.val = val;
}
public String getId() {
return this.val;
}
@Override
public ArrayList<SemanticError> checkSemantics(SymbolTable ST, int _nesting) {
var errors = new ArrayList<SemanticError>();
// Print the symbol table
// System.out.println(ST);
if ((this.typeCheck() instanceof AtomType) && ST.nslookup(this.getId()) < 0) {
// System.out.println(!(this.typeCheck() instanceof IntType) + " " + !ST.top_lookup(this.getId()));
errors.add(new SemanticError("'" + this.getId() + "' is not defined."));
}
return errors;
}
// ENHANCE: return more specific types
@Override
public Type typeCheck() {
// this regex should match every possible atom name written in this format: CHAR (CHAR | DIGIT)*
Pattern pattern = Pattern.compile("^[a-zA-Z][a-zA-Z0-9]*$", Pattern.CASE_INSENSITIVE);
Matcher matcher = pattern.matcher(this.val);
boolean matchFound = matcher.find();
if (matchFound) {
// System.out.println("Match found for " + this.val);
return new AtomType(); // could be a variable or a fuction
} else {
// System.out.println("Match not found for " + this.val);
return new VoidType(); // could be any type of data
}
}
// TODO: add code generation for atom node
@Override
public String codeGeneration() {
return "";
}
@Override
public String toPrint(String prefix) {
if (val != null) {
return prefix + "Atom(" + val + ")\n";
}
return prefix + "Atom(null)\n";
}
}
|
