-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.js
executable file
·486 lines (444 loc) · 19.4 KB
/
main.js
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
#!/usr/bin/env node
/**
* Load the Structures.
**/
var Structures = require("./lib/structures");
var StoreRef = Structures.StoreRef;
var CompleteStructure = Structures.CompleteStructure;
var Procedure = Structures.Procedure;
var Variable = Structures.Variable;
var Utils = require("./lib/utils");
/**
* Load the Instructions.
**/
var Instructions = require("./lib/instructions");
/**
* Load Compiler
**/
var Compiler = require("./lib/compilers");
var DEBUG = false;
var exampleNames = {
"main":WamBookExample,
"2var":UnifyTwoVariables,
"fail1":Failure1,
"vi":VariableIndependance,
"put_value":PutValueTest,
"put_value_fail":PutValueFailTest,
"deep_nesting":DeepNestingTest,
"mf1":MultiFactProgram1,
"l2":FirstL2Program
};
/**
* Check the args
**/
if(process.argv.length === 2) {
printUsage();
} else if(process.argv.length >= 3) {
if(exampleNames[process.argv[2]]) {
exampleNames[process.argv[2]](process.argv[3] === "debug");
} else {
console.log("Program "+process.argv[2]+" not found.");
printUsage();
process.exit();
}
}
function printUsage() {
console.log("Usage: node main.js <example> [debug]");
console.log("Current Examples:");
for (var i = Object.keys(exampleNames).length - 1; i >= 0; i--) {
console.log("\t" + Object.keys(exampleNames)[i]);
};
process.exit();
}
/**
* Try unifying terms that dont unify.
* Query: p(A,f(b)).
* Program: p(b, f(c)).
* Expected Result: failure on b/0 and c/0
**/
function Failure1(DEBUG) {
console.log("Query Term:\t p(A,f(b)).");
console.log("Program Term:\t p(b,f(c)).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Parse and Flatten the Query:
* ?- p(A,f(b)).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new Variable("A", new StoreRef(ENV.X(),2))); // A1 = A
ENV.X().set(2, new CompleteStructure("f",1,[new StoreRef(ENV.X(), 3)])); // A2 = f(X3)
ENV.X().set(3, new CompleteStructure("b",0,[])); // X3 = b
return new CompleteStructure("p", 2,[ new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2) ]);
},
// Prepare the program.
function(ENV){
/**
* Compile and Flatten the Program:
* p(b, f(c)).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new CompleteStructure("b",0,[])); // A1 = b/0
ENV.X().set(2, new CompleteStructure("f",1,[ new StoreRef(ENV.X(), 3) ])); // A2 = f(X3)
ENV.X().set(3, new CompleteStructure("c",0,[])); // X3 = c/0
return [
new CompleteStructure("p", 2, [ new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2)])
];
}
);
}
/**
* Try unifying terms that shows that variable names are scoped only to the query.
* Query: p(a, b, X).
* Program: p(X, b, c).
* Expected Result: X = c
**/
function VariableIndependance(DEBUG) {
console.log("Query Term:\t p(a, b, X).");
console.log("Program Term:\t p(X, b, c).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Parse and Flatten the Query:
* ?- p(a, b, X).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new CompleteStructure("a",0,[])); // A1 = a
ENV.X().set(2, new CompleteStructure("b",0,[])); // A2 = b
ENV.X().set(3, new Variable("X", new StoreRef(ENV.X(), 3))); // A3 = X
return new CompleteStructure("p", 3,[new StoreRef(ENV.X(), 1),new StoreRef(ENV.X(), 2),new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/**
* Compile and Flatten the Program:
* p(X, b, c).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new Variable("X", new StoreRef(ENV.X(), 4))); // A1 = X [X4]
ENV.X().set(2, new CompleteStructure("b",0, [])); // A2 = b/0
ENV.X().set(3, new CompleteStructure("c",0, [])); // A3 = c/0
ENV.X().set(4, new Variable("X", new StoreRef(ENV.X(), 4))); // X4 = X
return [
new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)])
];
}
);
}
/**
* Try a basic unification of two variables.
* Query: p(A).
* Program: p(Z).
* Expected Result: P(_H1)
**/
function UnifyTwoVariables(DEBUG) {
console.log("Query Term:\t p(A).");
console.log("Program Term:\t p(Z).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Parse and Flatten the Query:
* ?- p(A)
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new Variable("A", new StoreRef(ENV.X(),1))); // A1 = A
return new CompleteStructure("p", 1,[new StoreRef(ENV.X(), 1)]);
},
// Prepare the program.
function(ENV){
/**
* Compile and Flatten the Program:
* p(Z).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new Variable("Z", new StoreRef(ENV.X(),1))); // A1 = Z
return [
new CompleteStructure("p", 1,[new StoreRef(ENV.X(), 1)])
];
}
);
}
/**
* The wam book example uses:
* Query: p(Z, h(Z,W), f(W)).
* Program: p(f(X), h(Y, f(a)), Y).
* Expected Result: p(f(f(a)),h(f(f(a)),f(a)),f(f(a))).
**/
function WamBookExample(DEBUG) {
console.log("Query Term:\t p(Z, h(Z,W), f(W)).");
console.log("Program Term:\t p(f(X), h(Y, f(a)), Y).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Parse and Flatten the Query:
* ?- p(Z, h(Z,W), f(W)).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new Variable("Z", new StoreRef(ENV.X(),1))); // A1 = Z
ENV.X().set(2, new CompleteStructure("h",2,[new StoreRef(ENV.X(),1), new StoreRef(ENV.X(),4)])); // A2 = h(A1, X4)
ENV.X().set(3, new CompleteStructure("f",1,[new StoreRef(ENV.X(),4)])); // A3 = f(X4)
ENV.X().set(4, new Variable("W", new StoreRef(ENV.X(),4))); // X4 = W
return new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/**
* Compile and Flatten the Program:
* p(f(X), h(Y, f(a)), Y).
*
* Currently no code for this step :-(
**/
ENV.X().set(1, new CompleteStructure("f",1,[new StoreRef(ENV.X(),4)])); // A1 = f(X4)
ENV.X().set(2, new CompleteStructure("h",2,[new StoreRef(ENV.X(),5), new StoreRef(ENV.X(),6)])); // A2 = h(X5, X6)
ENV.X().set(3, new Variable("Y", new StoreRef(ENV.X(),5))); // A3 = Y [X5]
ENV.X().set(4, new Variable("X", new StoreRef(ENV.X(),4))); // X4 = X
ENV.X().set(5, new Variable("Y", new StoreRef(ENV.X(),5))); // X5 = Y
ENV.X().set(6, new CompleteStructure("f",1,[new StoreRef(ENV.X(), 7)])); // X6 = F(X7)
ENV.X().set(7, new CompleteStructure("a",0,[])); // X7 = a/0
return [
new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)])
];
}
);
}
/**
* A test to make sure that put_value instruction is used correctly.
* Query: p(A, b, A).
* Program: p(c, B, c).
* Expected Result: p(c, b, c).
**/
function PutValueTest(DEBUG) {
console.log("Query Term:\t p(A, b, A).");
console.log("Program Term:\t p(c, B, c).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Query:
* ?- p(A, b, A).
**/
ENV.X().set(1, new Variable("A", new StoreRef(ENV.X(), 1))); // A1 = A
ENV.X().set(2, new CompleteStructure("b", 0, [])); // A2 = b/0
ENV.X().set(3, new Variable("A", new StoreRef(ENV.X(), 1))); // A3 = A [A1]
return new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/**
* Program has only one fact:
* p(c, B, c).
**/
ENV.X().set(1, new CompleteStructure("c", 0, [])); // A1 = c/0
ENV.X().set(2, new Variable("B", new StoreRef(ENV.X(), 2))); // A2 = B
ENV.X().set(3, new CompleteStructure("c", 0, [])); // A3 = c/0
return [
new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)])
];
}
);
}
/**
* A test to make sure that put_value instruction is used correctly (by failing correctly.
* Query: p(A, b, A).
* Program: p(c, B, d).
* Expected Result: Failure c/0 expected d/0.
**/
function PutValueFailTest(DEBUG) {
console.log("Query Term:\t p(A, b, A).");
console.log("Program Term:\t p(c, B, c).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
/**
* Query:
* ?- p(A, b, A).
**/
ENV.X().set(1, new Variable("A", new StoreRef(ENV.X(), 1))); // A1 = A
ENV.X().set(2, new CompleteStructure("b", 0, [])); // A2 = b/0
ENV.X().set(3, new Variable("A", new StoreRef(ENV.X(), 1))); // A3 = A [A1]
return new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/**
* Program has only one fact:
* p(c, B, c).
**/
ENV.X().set(1, new CompleteStructure("c", 0, [])); // A1 = c/0
ENV.X().set(2, new Variable("B", new StoreRef(ENV.X(), 2))); // A2 = B
ENV.X().set(3, new CompleteStructure("d", 0, [])); // A3 = c/0
return [
new CompleteStructure("p", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)])
];
}
);
}
/**
* A test to make sure that deeply nested fields dont affect the compilers.
* Query: p(a(b(c(d(e)))), B).
* Program: p(X, a(b(c(d)))).
* Expected Result: Success, B = a(b(c(d)))
**/
function DeepNestingTest(DEBUG) {
console.log("Query Term:\t p(a(b(c(d(e)))), B).");
console.log("Program Term:\t p(X, a(b(c(d)))).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query
function(ENV){
ENV.X().set(1, new CompleteStructure("a", 1, [ new StoreRef(ENV.X(), 3) ])); // A1 = a(X3)
ENV.X().set(2, new Variable("B", new StoreRef(ENV.X(), 2))); // A2 = B
ENV.X().set(3, new CompleteStructure("b", 1, [ new StoreRef(ENV.X(), 4) ])); // X3 = b(X4)
ENV.X().set(4, new CompleteStructure("c", 1, [ new StoreRef(ENV.X(), 5) ])); // X4 = c(X5)
ENV.X().set(5, new CompleteStructure("d", 1, [ new StoreRef(ENV.X(), 6) ])); // X5 = d(X6)
ENV.X().set(6, new CompleteStructure("e", 0, [])); // X6 = e/0
return new CompleteStructure("p", 2, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2)]);
},
// Prepare the program.
function(ENV){
/**
* Program has only one fact:
* p(X, a(b(c(d)))).
**/
ENV.X().set(1, new Variable("X", new StoreRef(ENV.X(), 1) )); // A1 = X
ENV.X().set(2, new CompleteStructure("a", 1, [ new StoreRef(ENV.X(), 3) ])); // A2 = a(X3)
ENV.X().set(3, new CompleteStructure("b", 1, [ new StoreRef(ENV.X(), 4) ])); // X3 = b(X4)
ENV.X().set(4, new CompleteStructure("c", 1, [ new StoreRef(ENV.X(), 5) ])); // X4 = c(X5)
ENV.X().set(5, new CompleteStructure("d", 0, [ ])); // X5 = d/0
return [
new CompleteStructure("p", 2, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2)])
];
}
);
}
/**
* A test to test multiple facts in a program
* The program contains:
* a(b,c,d).
* b(c,d,e).
* c(d,e,f).
*
* The query will be:
* ?- c(X,Y,Z).
*
* Expected results would be:
* X = c, Y = d, Z = e
**/
function MultiFactProgram1(DEBUG) {
console.log("Query Term:\tc(X,Y,Z).");
console.log("Program Terms:\n\t\ta(b,c,d). \n\t\tb(c,d,e). \n\t\tc(d,e,f).");
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query:
function(ENV){
/**
* Prepare the query:
* ?- c(X,Y,Z).
**/
ENV.X().set(1, new Variable("X", new StoreRef(ENV.X(), 1))); // A1 = X
ENV.X().set(2, new Variable("Y", new StoreRef(ENV.X(), 2))); // A2 = Y
ENV.X().set(3, new Variable("Z", new StoreRef(ENV.X(), 3))); // A3 = Z
return new CompleteStructure("c", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/**
* First Fact: a(b,c,d).
**/
ENV.X().set(1, new CompleteStructure("b", 0, [])); // A1 = b/0
ENV.X().set(2, new CompleteStructure("c", 0, [])); // A2 = c/0
ENV.X().set(3, new CompleteStructure("d", 0, [])); // A3 = d/0
/**
* Second Fact: b(c,d,e).
**/
ENV.X().set(4, new CompleteStructure("c", 0, [])); // A4 = c/0
ENV.X().set(5, new CompleteStructure("d", 0, [])); // A5 = d/0
ENV.X().set(6, new CompleteStructure("e", 0, [])); // A6 = e/0
/**
* Third Fact: c(d,e,f).
**/
ENV.X().set(7, new CompleteStructure("d", 0, [])); // A7 = d/0
ENV.X().set(8, new CompleteStructure("e", 0, [])); // A8 = e/0
ENV.X().set(9, new CompleteStructure("f", 0, [])); // A9 = f/0
return [
new CompleteStructure("a", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]),
new CompleteStructure("b", 3, [new StoreRef(ENV.X(), 4), new StoreRef(ENV.X(), 5), new StoreRef(ENV.X(), 6)]),
new CompleteStructure("c", 3, [new StoreRef(ENV.X(), 7), new StoreRef(ENV.X(), 8), new StoreRef(ENV.X(), 9)])
];
}
);
}
/**
* The first attempted L2 program.
* This program will allow rules.
*
* The query will be:
* ?- a(X,Y,Z).
*
* The program will be:
* a(X,Y,Z) :- b(X,Y), c(Y,Z).
* b(a,b).
* c(b,c).
*
* The expected result is:
* X = a, Y = b, Z = c
**/
function FirstL2Program(DEBUG) {
var ENV = Utils.BuildAndRun(
DEBUG,
// Prepare the query:
function(ENV){
/**
* Prepare the query:
* ?- a(X,Y,Z).
**/
ENV.X().set(1, new Variable("X", new StoreRef(ENV.X(), 1))); // A1 = X
ENV.X().set(2, new Variable("Y", new StoreRef(ENV.X(), 2))); // A2 = Y
ENV.X().set(3, new Variable("Z", new StoreRef(ENV.X(), 3))); // A3 = Z
return new CompleteStructure("a", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]);
},
// Prepare the program.
function(ENV){
/** Load up the variables **/
ENV.X().set(1, new Variable("X", new StoreRef(ENV.X(), 1)));
ENV.X().set(2, new Variable("Y", new StoreRef(ENV.X(), 2)));
ENV.X().set(3, new Variable("Z", new StoreRef(ENV.X(), 3)));
/** Load up constants used by the facts **/
ENV.X().set(4, new CompleteStructure("a", 0, []));
ENV.X().set(5, new CompleteStructure("b", 0, []));
ENV.X().set(6, new CompleteStructure("c", 0, []));
/**
* The rule a(X,Y,Z) :- b(X,Y), c(Y,Z);
**/
var rule = new Procedure(
new CompleteStructure("a", 3, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]),
[
new CompleteStructure("b", 2, [new StoreRef(ENV.X(), 1), new StoreRef(ENV.X(), 2)]),
new CompleteStructure("c", 2, [new StoreRef(ENV.X(), 2), new StoreRef(ENV.X(), 3)]),
]
);
return [
rule,
new CompleteStructure("b", 2, [ new StoreRef(ENV.X(), 4), new StoreRef(ENV.X(), 5) ]),
new CompleteStructure("c", 2, [ new StoreRef(ENV.X(), 5), new StoreRef(ENV.X(), 6) ]),
];
}
);
}