This repository was archived by the owner on Jun 10, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSymbolTable.java
More file actions
135 lines (119 loc) · 4.04 KB
/
SymbolTable.java
File metadata and controls
135 lines (119 loc) · 4.04 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
import java.util.LinkedList;
import java.util.Stack;
public class SymbolTable {
Stack<SymbolTableNode> rows;
LinkedList<Node> leafNodes;
SymbolTable() {
rows = new Stack<>();
}
public void addTreeAsList(LinkedList<Node> lN) {
leafNodes = lN;
}
public void addRow(SymbolTableNode node) {
rows.push(node);
}
public boolean searchValue(String value) {
for (int i = rows.size() - 1; i >= 0; i++) {
if (rows.elementAt(i).value.equals(value)) {
return true;
}
}
return false;
}
public void displayProcTable() {
for (int i = 0; i < rows.size(); i++) {
System.out.println(rows.elementAt(i).procRow());
}
}
public void displayVarTable() {
for (int i = 0; i < rows.size(); i++) {
System.out.println(rows.elementAt(i).varRow());
}
}
public LinkedList<SymbolTableNode> requestType(String t) {
LinkedList<SymbolTableNode> temp = new LinkedList<>();
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).type.equals(t)) {
temp.add(rows.elementAt(i));
}
}
return temp;
}
public boolean lookup(int sID, String v, boolean isD, boolean isA) {
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).scopeID == (sID) && (rows.elementAt(i).value.equals(v))
&& (rows.elementAt(i).isDeclaration == isD) && (rows.elementAt(i).isArray == isA)) {
return true;
}
}
return false;
}
public LinkedList<SymbolTableNode> lookupNodes(int sID, String v, boolean isD, boolean isA) {
LinkedList<SymbolTableNode> connections = new LinkedList<>();
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).scopeID == (sID) && (rows.elementAt(i).value.equals(v))
&& (rows.elementAt(i).isDeclaration == isD) && (rows.elementAt(i).isArray == isA)) {
connections.add(rows.elementAt(i));
}
}
return connections;
}
public void connect() {
for (int i = 0; i < rows.size(); i++) {
for (int j = 0; j < rows.size(); j++) {
if (rows.elementAt(i).isDeclaration && rows.elementAt(i).nodeID == rows.elementAt(j).varLinkNodeID) {
rows.elementAt(i).isUsed = true;
}
}
}
}
public LinkedList<SymbolTableNode> declarations() {
LinkedList<SymbolTableNode> d = new LinkedList<>();
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).isDeclaration) {
d.add(rows.elementAt(i));
}
}
return d;
}
public LinkedList<SymbolTableNode> getArrays() {
LinkedList<SymbolTableNode> d = new LinkedList<>();
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).isArray) {
d.add(rows.elementAt(i));
}
}
return d;
}
public LinkedList<SymbolTableNode> getVars() {
LinkedList<SymbolTableNode> d = new LinkedList<>();
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).isArray) {
d.add(rows.elementAt(i));
}
}
return d;
}
public void setAllUDNTypesToU() {
for (int i = 0; i < rows.size(); i++) {
if (rows.elementAt(i).type.equals("userDefinedName")) {
rows.elementAt(i).type = "U";
}
}
}
public void assignDefaultTypes() {
for (int i = 0; i < rows.size(); i++) {
switch (rows.elementAt(i).type) {
case "string":
rows.elementAt(i).type = "S";
break;
case "num":
rows.elementAt(i).type = "N";
break;
case "bool":
rows.elementAt(i).type = "B";
break;
}
}
}
}