-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathNonterminal.java
More file actions
111 lines (97 loc) · 2.54 KB
/
Nonterminal.java
File metadata and controls
111 lines (97 loc) · 2.54 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
import java.util.ArrayList;
public class Nonterminal extends Token {
public ArrayList<Rule> rules;
private ArrayList<Token> first;
private ArrayList<Token> follow;
public Nonterminal(String name) {
this.name = name;
rules = new ArrayList<Rule>();
first = new ArrayList<Token>();
follow = new ArrayList<Token>();
}
public Token[] First() {
return first.toArray(new Token[]{});
}
public Token[] Follow() {
return follow.toArray(new Token[]{});
}
public boolean EnsureFirstContains(Token[] set) {
boolean somethingChanged = false;
for (Token t : set) {
if (t.equals(this) || firstContains(t)) continue;
first.add(t);
somethingChanged = true;
}
return somethingChanged;
}
private boolean firstContains(Token t) {
for (Token f : first) {
if (f.equals(t)) return true;
}
return false;
}
public boolean EnsureFollowContains(Token[] set) {
boolean somethingChanged = false;
for (Token t : set) {
if (t.equals(this) || followContains(t)) continue;
follow.add(t);
somethingChanged = true;
}
return somethingChanged;
}
private boolean followContains(Token t) {
for (Token f : follow) {
if (f.equals(t)) return true;
}
return false;
}
public void AddRule(Rule rule) {
Rule cleanRule = cleanRule(rule);
if (!rules.contains(rule)) rules.add(cleanRule);
}
public void DeleteRule(Rule rule) {
rules.remove(rule);
}
private Rule cleanRule(Rule rule) {
ArrayList<Token> cleanRule = new ArrayList<Token>(rule.rule.length);
for (Token token : rule.rule) {
if (token != null) {
cleanRule.add(token);
}
}
return new Rule(cleanRule.toArray(new Token[cleanRule.size()]));
}
public boolean isLeftRecursive() {
for (Rule rule : rules){
if (rule.rule[0].name.equals(name)) {
return true;
}
}
return false;
}
public void replaceRule(Token replace, Token[][] with) {
ArrayList<Rule> rulesToDelete = new ArrayList<Rule>();
ArrayList<Rule> rulesToAdd = new ArrayList<Rule>();
for (Rule rule : rules) {
if (rule.rule[0].name.equals(replace.name)) {
for (Token[] w : with) {
Token[] newRuleArray = new Token[rule.rule.length + w.length - 1];
for (int i = 0; i < w.length; i++) {
newRuleArray[i] = w[i];
}
for (int i = w.length; i < newRuleArray.length; i++) {
newRuleArray[i] = rule.rule[i - w.length + 1];
}
rulesToAdd.add(new Rule(newRuleArray));
}
rulesToDelete.add(rule);
}
}
for (Rule rule : rulesToDelete) {
this.DeleteRule(rule);
}
for (Rule rule : rulesToAdd) {
this.AddRule(rule);
}
}
}