-
Notifications
You must be signed in to change notification settings - Fork 0
/
spdiff.js
806 lines (727 loc) · 20.7 KB
/
spdiff.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
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
"use strict";
var murmurHash3 = require("murmurhash3js");
var jsParser = require("recast");
//var jsParser = require('acorn');
function str(obj) {
return JSON.stringify(obj, null, 2);
}
function hashCode(s){
var valueToHash =
!s.split ? "\"" + s.toString() + "\"" : s;
// we don't want numbers and and their string representation
// to hash to the same value
return murmurHash3.x86.hash32(valueToHash);
// return s.split("").reduce(function(a,b){
// a=((a<<5)-a)+b.charCodeAt(0);
// return a&a
// },0);
}
var termsMemo = {};
function isTerm(term) {
return term && term.op;
}
function getHKey(term) {
if(isTerm(term)) {
return term.hkey;
} else {
return hashCode(term);
}
}
function makeTerm(op, elems) {
var opHash = hashCode(op);
if(!Array.isArray(elems)) {
console.log("something is wrong with elems: " + JSON.stringify(elems, null, 2));
throw "Oh no!";
}
var termHash =
elems.reduce(function(accHash, elem){
var elemHash;
if(isTerm(elem)) {
elemHash = elem.hkey;
} else {
elemHash = hashCode(elem);
}
var newHash = ((accHash << 5) - accHash) + elemHash;
return Math.abs(newHash & newHash);
}, opHash);
var existingTerm = termsMemo[termHash];
if(existingTerm){
//TODO: handle collisions
return existingTerm;
}
var newTerm = { op: op, elems: elems, hkey: termHash};
//TODO: somehow get weak references here
termsMemo[termHash] = newTerm;
return newTerm;
}
var nextMeta = 0;
function makeMeta() {
var m = nextMeta;
nextMeta = nextMeta + 1;
return makeTerm("meta", [m]);
}
function makeMetaAt(num) {
return makeTerm("meta", [num]);
}
function isMeta(term) {
return term && term.op && term.op === "meta";
}
function equalsTerm(t1, t2) {
if(!isTerm(t1) || !isTerm(t2)) {
return t1 === t2;
}
return t1.hkey === t2.hkey;
}
// lookup 'meta' in 'sub'
function lookupMeta(meta, sub) {
return sub[meta.hkey];
}
// updates 'sub' to have a binding from 'meta' to 'term'
function bindTerm(meta, term, sub){
sub[meta.hkey] = term;
}
// Apply substitution in 'pattern' with bindings from 'sub'
function applyPattern(origPattern, sub) {
function apply(pattern) {
if(isMeta(pattern)) {
var boundTerm = lookupMeta(pattern, sub);
if(boundTerm) {
return boundTerm;
}
return pattern;
}
if(pattern.elems) {
var newArgs = pattern.elems.map(apply);
return makeTerm(pattern.op, newArgs);
}
return pattern;
}
return apply(origPattern);
}
function areComparable(tree1, tree2) {
return tree1 && tree2
&& tree1.op === tree2.op
&& tree1.elems && tree2.elems
&& tree1.elems.length === tree2.elems.length;
}
// Compute a substitution from meta-variables in 'pattern' such that
// applyPattern pattern subst = tree
function computeMatches(origPattern, origTree) {
var env = {};
function match(pattern, tree) {
if(equalsTerm(pattern, tree)) {
return;
}
if(isMeta(pattern)) {
var boundTerm = lookupMeta(pattern, env);
if(typeof boundTerm === "undefined" || boundTerm == null) {
bindTerm(pattern, tree, env);
return;
}
if(equalsTerm(boundTerm, tree) ) {
return;
} else {
env = null;
return;
}
}
// pattern is comparable to tree, recurse on each subtree
// pattern is non-comparable, fail
if(areComparable(pattern, tree) )
{
for(var i in pattern.elems) {
match(pattern.elems[i], tree.elems[i]);
if(!env) {
return;
}
}
} else {
env = null;
return;
}
}
match(origPattern, origTree);
return env;
}
// traverses two trees in parallel, while building a new tree
function traverse2(nodeVisit) {
return function visit(tree1, tree2) {
var res = nodeVisit(tree1, tree2);
if(res.done) {
return res.newTree;
} else if(areComparable(tree1, tree2)){
var newOp = res.newOp;
var newElems = [];
for(var i in tree1.elems){
newElems.push(visit(tree1.elems[i], tree2.elems[i]));
}
return makeTerm(newOp, newElems);
}
};
}
function isDone(newTree) {
return { done: true,
newTree: newTree };
}
function notDone(newOp) {
return { done: false,
newOp: newOp };
}
// compute anti-unifier
function mergeTerms(tree1, tree2, startEnv) {
var env = startEnv || {};
function merge(t1, t2) {
if(equalsTerm(t1, t2)) {
return isDone(t1);
}
if(areComparable(t1, t2)) {
return notDone(t1.op);
}
var boundMeta = env[[getHKey(t1), getHKey(t2)]];
if(typeof boundMeta !== undefined && boundMeta != null) {
return isDone(boundMeta);
}
var newMeta = makeMeta();
env[[getHKey(t1), getHKey(t2)]] = newMeta;
return isDone(newMeta);
}
var visitor = traverse2(merge);
return visitor(tree1, tree2);
}
function mkRewrite(lhs, rhs) {
var rewrite = {};
rewrite.lhs = lhs;
rewrite.rhs = rhs;
return rewrite;
}
function getMetas(origT) {
var metas = [];
function loop(t) {
if(isMeta(t)) {
metas.push(t);
} else {
if(t && t.op && t.elems.length > 0) {
t.elems.forEach(loop);
}
}
}
loop(origT);
return metas;
}
function metaReplace(rewrite, term) {
if(equalsTerm(rewrite.lhs, term)) {
return rewrite.rhs;
}
if(isTerm(term)) {
return makeTerm(term.op, term.elems.map(function(t) {
return metaReplace(rewrite, t);
}));
} else {
return term;
}
}
function mergeRewrites(rw1, rw2) {
var mergeEnv = {};
var mergedLHS = mergeTerms(rw1.lhs, rw2.lhs, mergeEnv);
var mergedRHS = mergeTerms(rw1.rhs, rw2.rhs, mergeEnv);
var lhsMetas = getMetas(mergedLHS);
var rhsMetas = getMetas(mergedRHS);
var unboundMetas =
rhsMetas.filter(function (rhsMeta) {
return lhsMetas.every(function(lhsMeta) {
return !equalsTerm(lhsMeta, rhsMeta);
});
});
if(unboundMetas.length === 0) {
return mkRewrite(mergedLHS, mergedRHS);
} else {
// some RHS meta is unbound
// console.log("some unbound metas for " + print(mergedLHS) + " => " + print(mergedRHS));
// for each unbound meta:
var resultRHS = mergedRHS;
unboundMetas.forEach(function (meta) {
for(var key in mergeEnv) {
// var thisMeta = mergeEnv[key];
if(equalsTerm(mergeEnv[key], meta)) {
var hkeys = key.split(",");
var left = hkeys[0];
var right = hkeys[1];
for(var otherKey in mergeEnv) {
var oMeta = mergeEnv[otherKey];
// console.log("mergeEnv[otherKey] = " + str(oMeta));
var otherHKeys = otherKey.split(",");
var otherLeft = otherHKeys[0];
var otherRight = otherHKeys[1];
if(otherLeft === left && otherRight !== right ||
otherRight === right && otherLeft !== left) {
// console.log("other: " + str(otherKey));
// console.log("this : " + str(key));
// console.log("mergeEnv " + str(mergeEnv));
// console.log("apply rewrite: " + printRewrite(mkRewrite(meta, oMeta)));
// console.log("to : " + print(resultRHS));
resultRHS = metaReplace(mkRewrite(meta, oMeta), resultRHS);
// console.log("resultRHS: " + print(resultRHS));
return;
}
}
}
}
});
return mkRewrite(mergedLHS, resultRHS);
// - find the pair of terms it was bound to in mergeEnv
// - try to find another pair such that one equals one from the previous pair
// - get the meta the new pair binds to and replace old meta with newly found
}
}
// apply a term-rewrite, lhs=>rhs such that every subterm, sub of
// tree where computeMatches(lhs,sub) = env and and <> null is
// replaced by applyPattern(rhs, env)
function applyRewrite(patch, origTree) {
function apply(tree) {
var env = computeMatches(patch.lhs, tree);
if(env !== null && env) {
return applyPattern(patch.rhs, env);
}
if(tree.elems) {
return makeTerm(tree.op, tree.elems.map(apply));
}
return tree;
}
return apply(origTree);
}
function treeSize(origTree) {
var accSize = 0;
function size(tree) {
if(!tree) { return; }
accSize++;
if(isTerm(tree) && tree.elems) {
for(var i in tree.elems) {
size(tree.elems[i]);
}
}
}
size(origTree);
return accSize;
}
function eqIs0(l, r) {
return (equalsTerm(l, r)) ? 0 : 2;
}
function editDist(oldT, newT) {
function red(s, t) {
return treeSize(t) + s;
}
var memoDist = {};
function distTerms(oldElems, newElems) {
if(oldElems.length === 0 && newElems.length > 0) {
return newElems.reduce(red, 0);
}
if(newElems.length === 0 && oldElems.length > 0) {
return oldElems.reduce(red, 0);
}
if(newElems.length === 0 && oldElems.length === 0) {
return 0;
}
// both oldElems and newElems are non-null and have a
// length > 0
var min1 =
distTerms(oldElems.slice(1),
newElems)
+ treeSize(oldElems[0]);
var min2 =
distTerms(oldElems,
newElems.slice(1))
+ treeSize(newElems[0]);
var min3 =
distTerms(oldElems.slice(1),
newElems.slice(1))
+ dist(oldElems[0],
newElems[0]);
var res = Math.min(min1, min2, min3);
return res;
}
function dist(o, n) {
var ohkey = getHKey(o);
var nhkey = getHKey(n);
var memoKey = [ohkey, nhkey];
var memo = memoDist[memoKey];
if(memo) {
return memo;
}
var newMemo = 0;
var oIsTerm = isTerm(o);
var nIsTerm = isTerm(n);
if(oIsTerm && nIsTerm){
if(equalsTerm(o, n)) {
newMemo = 0;
} else {
newMemo = eqIs0(o.op, n.op) + distTerms(o.elems, n.elems);
}
} else if(oIsTerm && !nIsTerm) {
newMemo = 1 + treeSize(o);
} else if(!oIsTerm && nIsTerm) {
newMemo = 1 + treeSize(n);
} else {
newMemo = eqIs0(o, n);
}
memoDist[memoKey] = newMemo;
return newMemo;
}
return dist(oldT, newT);
}
function print(origTerm) {
var resStr = "";
function toStr(term) {
if(isMeta(term)) {
resStr += "X" + JSON.stringify(term.elems[0]);
} else if(isTerm(term)) {
resStr += term.op;
if(term.elems && term.elems.length > 0) {
resStr += "(";
for(var i in term.elems) {
toStr(term.elems[i]);
if(i < term.elems.length - 1) {
resStr += ", ";
}
}
resStr += ")";
}
} else {
resStr += JSON.stringify(term);
}
}
toStr(origTerm);
return resStr;
}
function isSafe(rewrite, srcTerm, tgtTerm) {
var midTerm = applyRewrite(rewrite, srcTerm);
if(equalsTerm(srcTerm, midTerm)) {
return false;
}
var haveSameDist = editDist(srcTerm, midTerm) + editDist(midTerm, tgtTerm) ===
editDist(srcTerm, tgtTerm);
return haveSameDist;
}
function diffCost(diff) {
return diff.reduce(
function(accCost, diffElem) {
return accCost + treeSize(diffElem.lhs) + treeSize(diffElem.rhs);
}, 0);
}
function d(srcTerms, tgtTerms) {
/* d([], ys) = map (+) ys
d(xs, []) = map (-) xs
d(x:xs, y:ys) =
let min1 = -x @ d(xs, y:ys)
let min2 = +y @ d(x:xs, ys)
let min3 = d(x,y) @ d(xs,ys)
min_by cost [min1, min2, min3]
*/
if(srcTerms.length === 0) {
return tgtTerms.map(function(term) {
return mkRewrite(null, term);
});
}
if(tgtTerms.length === 0) {
return srcTerms.map(function(term) {
return mkRewrite(term, null);
});
}
var min1 = [mkRewrite(srcTerms[0], null)].concat(d(srcTerms.slice(1), tgtTerms));
var cost1 = diffCost(min1);
var min2 = [mkRewrite(null, tgtTerms[0])].concat(d(srcTerms, tgtTerms.slice(1)));
var cost2 = diffCost(min2);
var min3 = getMinimalDiffs(srcTerms[0], tgtTerms[0]).concat(d(srcTerms.slice(1), tgtTerms.slice(1)));
var cost3 = diffCost(min3);
if(cost3 <= cost1 && cost3 <= cost2) {
return min3;
} else if ( cost1 <= cost2) {
return min1;
} else {
return min2;
}
}
function getMinimalDiffs(srcTerm, tgtTerm) {
if(equalsTerm(srcTerm, tgtTerm)) {
return [];
}
if(isTerm(srcTerm) && isTerm(tgtTerm)) {
var diffs = [];
if(srcTerm.op !== tgtTerm.op) {
diffs.push(mkRewrite(srcTerm.op, tgtTerm.op));
}
return diffs.concat(d(srcTerm.elems, tgtTerm.elems));
}
return [mkRewrite(srcTerm, tgtTerm)];
}
function getSimpleDiffs(srcTerm, tgtTerm) {
var diffs = [];
function get(src, tgt) {
if(equalsTerm(src, tgt)) {
return;
}
diffs.push(mkRewrite(src, tgt));
if(src && tgt && src.elems && tgt.elems &&
src.elems.length === tgt.elems.length) {
src.elems.forEach(
function(srcElem, srcIndex) {
var tgtElem = tgt.elems[srcIndex];
get(srcElem, tgtElem);
}
);
} else if ( src && tgt && src.elems && tgt.elems &&
src.op === tgt.op &&
src.elems.length !== tgt.elems.length ) {
console.log("TODO?");
}
}
get(srcTerm, tgtTerm);
return diffs;
}
// we'll assume both lhsRewrite and rhsRewrite are safe for the changeset given
// in other words, both rewrites applies to all pairs in the changeset
function isSubRewrite(changeset) { // changeset = [ {oldTerm:term,newTerm:term} ]
return function(lhsRewrite, rhsRewrite) {
return changeset.every(function(change) {
var midTerm = applyRewrite(rhsRewrite, change.oldTerm);
return isSafe(lhsRewrite, change.oldTerm, midTerm);
});
};
}
function isUndef(o) {
return typeof o === "undefined" || o === null;
}
function getSubTerms(term) {
var subtermSet = {};
function loop(nextTerm) {
if(isUndef(nextTerm)) {
return;
}
var key;
if(isTerm(nextTerm)){
key = getHKey(nextTerm);
if(nextTerm.elems) {
nextTerm.elems.forEach(loop);
}
} else if(!isUndef(nextTerm)) {
key = hashCode(nextTerm);
}
if(isUndef(subtermSet[key])) {
subtermSet[key] = nextTerm;
}
}
loop(term);
var subterms = [];
for(var key in subtermSet) {
if(subtermSet.hasOwnProperty(key)) {
subterms.push(subtermSet[key]);
}
}
return subterms;
}
function getCommonPatterns(terms) {
// a list of lists of subterms
var subtermLists = terms.map(getSubTerms);
var common = [];
function loop(curPat, subtermListsTail) {
if(subtermListsTail.length === 0) {
// TODO
// - check for existance in list
// - check infeasible pattern
common.push(curPat);
} else {
var headTerms = subtermListsTail[0];
headTerms.forEach(function(term){
var newPat = curPat ? mergeTerms(curPat, term) : term;
if(isMeta(newPat)) {
return;
}
loop(newPat, subtermListsTail.slice(1));
});
}
}
loop(null, subtermLists);
return common;
}
// given changeset:
// map each changeset to set of simple changes
// try to merge simple changes from all elements in changeset
// - remove merged change if unsafe
// - don't merge with more changes if merged change is subpatch of already found
function getMergeDiffs(changeset) {
var lhss = changeset.map(function(pair) { return pair.oldTerm; });
var commonPats = getCommonPatterns(lhss);
// commonPats.forEach(function(pat) {
// console.log(">>> " + print(pat));
// });
console.log("computing pair diffs");
var simpleDiffs = changeset.map(function(change) {
// somewhat slow
return getSimpleDiffs(change.oldTerm, change.newTerm)
//return getMinimalDiffs(change.oldTerm, change.newTerm)
.filter(function(filterChange) {
// console.log("testing simple: " + printRewrite(change));
var isGood = commonPats.some(function(pat) {
return computeMatches(pat, filterChange.lhs);
});
// console.log(" good? " + isGood);
return isGood;
});
// faster, but fewer results
//return getMinimalDiffs(change.oldTerm, change.newTerm);
});
console.log("no simple diffs = " + simpleDiffs.reduce(function(accSum, diffs) {
return diffs.length + accSum;
}, 0));
// simpleDiffs.forEach(function(diffs) {
// diffs.forEach(function (diff) {
// console.log("diff: " + printRewrite(diff));
// });
// });
var mergedChanges = [];
function mergeFold(curMerge, otherDiffs) {
if(otherDiffs.length === 0) {
// check safety
var newMergeSafe = changeset.every(function(change) {
return isSafe(curMerge, change.oldTerm, change.newTerm);
});
if(!newMergeSafe) {
return;
}
mergedChanges.push(curMerge);
} else {
var rewrites = otherDiffs[0];
rewrites.forEach(function (rewrite) {
var newMerge = curMerge ? mergeRewrites(curMerge, rewrite) : rewrite;
if(!newMerge) {
return;
}
if(newMerge && newMerge.lhs && isMeta(newMerge.lhs)) {
return;
}
// TODO: consider to check not subpatch of already found patch
mergeFold(newMerge, otherDiffs.slice(1));
});
}
}
console.log("merging diffs");
mergeFold(null, simpleDiffs);
// filter out found changes that are not smallest (unless we do that in the "base-case"
var subPatch = isSubRewrite(changeset);
var largestChanges =
mergedChanges.filter(function (patch) {
return mergedChanges.every(function(other) {
return subPatch(other, patch);
});
});
// find(function(patch) {
// return mergedChanges.every(function(other) {
// return subPatch(other, patch);
// });
// }, mergedChanges);
return largestChanges;
//return mergedChanges;
}
function printRewrite(rw) {
return print(rw.lhs) + " => " + print(rw.rhs);
}
function convertToTerm(ast) {
if(typeof ast === "undefined" || ast == null) {
throw "No AST?";
}
if(typeof ast !== "object") {
return ast;
}
if(Array.isArray(ast)){
return ast.map(convertToTerm);
}
if(ast.type) {
var elems = [];
for(var prop in ast) {
if(prop !== "type" && prop !== "loc" && prop !== "start" && prop !== "end" && prop !== "typeAnnotation") {
if(ast.hasOwnProperty(prop)){
var value = ast[prop];
if(value == null) {
continue;
}
// foo : [a,b,c] => t(foo,[t("[]", [|a|,|b|,|c|]])
if(Array.isArray(value)) {
var arr = value.map(convertToTerm);
elems.push(makeTerm(prop, [makeTerm("[]", arr)]));
} else {
var conv = convertToTerm(value);
// foo : e => t(foo,[e])
elems.push(makeTerm(prop, [conv]));
}
}
}
}
return makeTerm(ast.type, elems);
}
return ast;
}
function convertToAST(term) {
if(term == null) {
console.log("no term");
console.log(term);
throw "No term?";
}
if(typeof term !== "object") {
return term;
}
if(Array.isArray(term)) {
return term.map(convertToAST);
}
if(isTerm(term)) {
if(term.op === "[]") {
return convertToAST(term.elems);
}
if(isMeta(term)) {
return "X" + term.elems[0];
}
var ast = {};
ast.type = term.op;
if(term.elems.length === 1 && term.elems[0].op === "[]") {
return convertToAST(term.elems[0]);
}
for(var elemIdx in term.elems) {
var termValue = term.elems[elemIdx];
var prop = termValue.op;
if(termValue.elems.length !== 1) {
// console.log("not === 1");
// console.log(termValue);
// console.log(">>> IN :");
// console.log(term);
// throw "Not === 1";
ast[prop] = convertToAST(termValue.elems);
} else {
ast[prop] = convertToAST(termValue.elems[0]);
}
// if(termValue.elems.length === 0) {
// throw "=== 0?";
// }
}
return ast;
}
return term;
}
var spdiff = {};
spdiff.findLargestCommonRewrites = function(changeset) {
function convert(change) {
var oldAST = jsParser.parse(change.oldTerm);
var newAST = jsParser.parse(change.newTerm);
return { oldTerm: convertToTerm(oldAST),
newTerm: convertToTerm(newAST) };
}
var convChangeSet = changeset.map(convert);
var termRewrites = getMergeDiffs(convChangeSet);
return termRewrites.map(function (rewrite) {
try {
return mkRewrite( convertToAST(rewrite.lhs),
convertToAST(rewrite.rhs) );
} catch (err) {
//TODO
}
}).filter(function (e) { return e; });
};
spdiff.jsParser = jsParser;
module.exports = spdiff;