forked from flocho/udvl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bonus01Test.java
179 lines (143 loc) · 5.6 KB
/
Bonus01Test.java
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
import java.util.Map;
import java.util.HashMap;
class Case {
Map<String,Boolean> interpretation;
boolean result;
Case(Map<String, Boolean> interpretation, boolean result) {
this.interpretation = interpretation;
this.result = result;
}
}
class Tester {
int tested = 0;
int passed = 0;
public void compare(Object result, Object expected, String msg) {
tested += 1;
if (result.equals(expected)) {
passed += 1;
} else {
System.out.println(" Failed: " + msg + ":");
System.out.println(" got " + result + " expected " + expected);
}
}
public void test(Formula formula, String string, Case[] cases) {
System.out.println("Testing " + string);
Formula parsed = Formula.parse(string);
compare(parsed.toString(), string, "Formula.parse(XXX).toString() == XXX");
// TODO actually compare the structure of parsed and f
// but if the interpretation tests below pass, we are probably OK :)
for (Case c : cases) {
System.out.println(" interpretation " + c.interpretation + ":");
compare(formula.eval(c.interpretation), c.result, "eval");
}
}
public void status() {
System.out.println("TESTED " + tested);
System.out.println("PASSED " + passed);
if (tested == passed) {
System.out.println("OK");
} else {
System.out.println("ERROR");
}
}
}
/**
*
* @author shanki
*/
public class Bonus01Test {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Tester t = new Tester();
Map<String,Boolean> i1 = new HashMap<>();
i1.put("a", true);
Map<String,Boolean> i2 = new HashMap<>();
i2.put("a", false);
t.test(new Variable("a"), "a",new Case[] {
new Case(i1, true), new Case(i2, false)
});
t.test(new Negation(new Variable("a")), "-a", new Case[] {
new Case(i1, false), new Case(i2, true)
});
Map<String,Boolean> a1 = new HashMap<>();
a1.put("a", false);
a1.put("b", false);
Map<String, Boolean> a2 = new HashMap<>();
a2.put("a", false);
a2.put("b", true);
Map<String, Boolean> a3 = new HashMap<>();
a3.put("a", true);
a3.put("b", false);
Map<String, Boolean> a4 = new HashMap<>();
a4.put("a", true);
a4.put("b", true);
t.test(new Conjunction( new Formula[] { new Variable("a"), new Variable("b") } ), "(a&b)", new Case[] {
new Case(a1, false), new Case(a2, false), new Case(a3, false), new Case(a4, true)
});
t.test(new Disjunction( new Formula[] { new Variable("a"), new Variable("b") } ), "(a|b)", new Case[] {
new Case(a1, false), new Case(a2, true), new Case(a3, true), new Case(a4, true)
});
t.test(new Implication( new Variable("a"), new Variable("b") ), "(a=>b)", new Case[] {
new Case(a1, true), new Case(a2, true), new Case(a3, false), new Case(a4, true)
});
t.test(new Equivalence( new Variable("a"), new Variable("b") ), "(a<=>b)", new Case[] {
new Case(a1, true), new Case(a2, false), new Case(a3, false), new Case(a4, true)
});
t.test(new Disjunction(new Formula[] {
new Negation(new Implication(new Variable("a"), new Variable("b"))),
new Negation(new Implication(new Variable("b"), new Variable("a")))
}), "(-(a=>b)|-(b=>a))", new Case[] {
new Case(a1, false), new Case(a2, true), new Case(a3, true), new Case(a4, false)
});
Map<String,Boolean> b1 = new HashMap<>();
b1.put("a", false);
b1.put("b", false);
b1.put("c", false);
Map<String,Boolean> b2 = new HashMap<>();
b2.put("a", true);
b2.put("b", false);
b2.put("c", false);
Map<String,Boolean> b3 = new HashMap<>();
b3.put("a", false);
b3.put("b", true);
b3.put("c", false);
Map<String,Boolean> b4 = new HashMap<>();
b4.put("a", true);
b4.put("b", true);
b4.put("c", false);
Map<String,Boolean> b5 = new HashMap<>();
b5.put("a", false);
b5.put("b", false);
b5.put("c", true);
Map<String,Boolean> b6 = new HashMap<>();
b6.put("a", true);
b6.put("b", false);
b6.put("c", true);
Map<String,Boolean> b7 = new HashMap<>();
b7.put("a", false);
b7.put("b", true);
b7.put("c", true);
Map<String,Boolean> b8 = new HashMap<>();
b8.put("a", true);
b8.put("b", true);
b8.put("c", true);
t.test(new Conjunction(new Formula[] {
new Implication(new Variable("a"), new Variable("b")),
new Implication(new Negation(new Variable("a")), new Variable("c"))
}), "((a=>b)&(-a=>c))", new Case[] {
new Case(b1, false), new Case(b2, false), new Case(b3, false),
new Case(b4, true), new Case(b5, true), new Case(b6, false),
new Case(b7, true), new Case(b8, true)
});
t.test(new Equivalence(
new Conjunction(new Formula[] { new Variable("a"), new Negation(new Variable("b")) }),
new Disjunction(new Formula[] { new Variable("a"), new Implication( new Variable("b"), new Variable("a")) })
), "((a&-b)<=>(a|(b=>a)))", new Case[] {
new Case(a1, false), new Case(a2, true), new Case(a3, true), new Case(a4, false)
}
);
t.status();
}
}