/
BinaryExpression.java
20357 lines (18248 loc) · 781 KB
/
BinaryExpression.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
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
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import java.util.Vector;
import java.io.*;
import javax.swing.JOptionPane;
/******************************
* Copyright (c) 2003--2024 Kevin Lano
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License 2.0 which is available at
* http://www.eclipse.org/legal/epl-2.0
*
* SPDX-License-Identifier: EPL-2.0
* *****************************/
// package: OCL
class BinaryExpression extends Expression
{ // Represents binary expressions: left operator right
Expression left;
Expression right;
String operator;
Expression objectRef; // just for B
String iteratorVariable = null; // for ->exists( x, ->forAll( x, etc
Attribute accumulator = null; // let and ->iterate( )
Expression keyValue = null;
// for map operators ->including(key,right), ->excluding(key,right)
public BinaryExpression(String op, Expression ll, Expression rr)
{ operator = op;
if ("<>".equals(op) || op.equals("!="))
{ operator = "/="; }
else if ("->one".equals(op))
{ operator = "->exists1"; }
// else if ("div".equals(op))
// { operator = "/"; }
left = ll;
right = rr;
} // change <> to /=, ->one to ->exists1, etc
public static BinaryExpression newBinaryExpression(String op, Expression lx, Expression rx)
{ if (lx == null || rx == null)
{ return null; }
return new BinaryExpression(op,lx,rx);
}
public static BinaryExpression newBinaryExpression(String op, String lx, String rx)
{ if (lx == null || rx == null)
{ return null; }
BasicExpression ex1 = new BasicExpression(lx);
BasicExpression ex2 = new BasicExpression(rx);
return new BinaryExpression(op,ex1,ex2);
}
public Object clone()
{ BinaryExpression res =
new BinaryExpression(operator,(Expression) left.clone(),(Expression) right.clone());
res.iteratorVariable = iteratorVariable;
res.accumulator = accumulator;
res.keyValue = keyValue;
res.type = type;
res.elementType = elementType;
res.entity = entity;
res.umlkind = umlkind;
res.multiplicity = multiplicity;
res.modality = modality;
res.needsBracket = needsBracket;
res.formalParameter = formalParameter;
return res;
}
/*
public Object clone()
{ BinaryExpression be = new BinaryExpression(operator,
(Expression) left.clone(),
(Expression) right.clone());
if (javaForm != null)
{ be.javaForm = (Expression) javaForm.clone(); }
be.modality = modality; // surely?
be.type = type;
be.entity = entity;
be.elementType = elementType;
be.multiplicity = multiplicity;
be.umlkind = umlkind;
be.setBrackets(needsBracket);
return be;
} // is this sufficient?
*/
public BinaryExpression(Attribute att)
{ left = new BasicExpression(att);
right = new BasicExpression(att.getType());
operator = ":";
type = new Type("boolean", null);
}
public BinaryExpression(BasicExpression be)
{ // obj.op(par) becomes obj->op(par)
left = ((BasicExpression) be).getObjectRef();
right = (Expression) ((Vector) be.getParameters()).get(0);
operator = "->" + be.getData();
type = be.getType();
elementType = be.getElementType();
}
public void setLeft(Expression le) { left = le; }
public void setRight(Expression re) { right = re; }
public void setKeyValue(Expression key) { keyValue = key; }
public void setOperator(String op) { operator = op; }
public void setIteratorVariable(String var)
{ iteratorVariable = var; }
public void setVariable(String var)
{ iteratorVariable = var; }
public void setAccumulator(Attribute acc)
{ accumulator = acc; }
public Attribute getAccumulator()
{ return accumulator; }
public Vector getParameters()
{ return new Vector(); }
public Expression getLeft() { return left; }
public Expression getRight() { return right; }
public String getOperator() { return operator; }
public Expression getKeyValue() { return keyValue; }
public BasicExpression getVariable()
{ if (iteratorVariable == null)
{ return null; }
BasicExpression res = new BasicExpression(iteratorVariable);
res.umlkind = VARIABLE;
res.setType(elementType); // except for any, when it is type
if ("|A".equals(operator))
{ res.setType(type); }
return res;
}
public Expression definedness()
{ Expression dl = left.definedness();
Expression dr = right.definedness();
Expression res = simplify("&",dl,dr,null); // simplifyAnd(dl,dr);
if ("/".equals(operator) ||
"mod".equals(operator) || "div".equals(operator))
{ Expression zero = new BasicExpression(0);
Expression neqz = new BinaryExpression("/=",right,zero);
return simplify("&",res,neqz,null);
}
// and case for ->pow
if ("->pow".equals(operator))
{ Expression zero = new BasicExpression(0);
Expression eqz = new BinaryExpression("=",left,zero);
Expression geqz = new BinaryExpression(">",right,zero);
Expression pex = new BinaryExpression("=>",eqz,geqz);
pex.setBrackets(true);
return simplify("&",res,pex,null);
} // left < 0 => right->oclIsTypeOf("int")
if ("->at".equals(operator))
{ if ("String".equals(right.getType() + ""))
{ UnaryExpression kexp = new UnaryExpression("->keys", left);
Expression inkeys = new BinaryExpression(":", right, kexp);
return simplify("&",res,inkeys,null);
}
UnaryExpression selfsize = new UnaryExpression("->size", left);
Expression lbnd = new BinaryExpression("<=", new BasicExpression(1), right);
Expression ubnd = new BinaryExpression("<=", right, selfsize);
Expression inrange = new BinaryExpression("&",lbnd,ubnd);
return simplify("&",res,inrange,null);
}
return res;
}
public Expression determinate()
{ if ("or".equals(operator))
{ return new BasicExpression(false); }
if ("#".equals(operator) || "#LC".equals(operator) || "#1".equals(operator) || "!".equals(operator) ||
"|".equals(operator) || "|R".equals(operator) || "|C".equals(operator))
{ Expression leftdet = ((BinaryExpression) left).right.determinate();
Expression rightdet = right.determinate();
return (new BinaryExpression("&",leftdet,rightdet)).simplify();
}
if ("->exists".equals(operator) || "=".equals(operator) ||
"->existsLC".equals(operator) ||
"->forAll".equals(operator) || "->exists1".equals(operator) ||
"->select".equals(operator) || "->reject".equals(operator) ||
"->collect".equals(operator) || "=>".equals(operator) || "->closure".equals(operator) ||
"->isUnique".equals(operator) || "->unionAll".equals(operator) ||
"->intersectAll".equals(operator) || "->symmetricDifference".equals(operator) ||
"->selectMaximals".equals(operator) || "->sortedBy".equals(operator) ||
"->selectMinimals".equals(operator) || "->at".equals(operator) ||
"->iterate".equals(operator) ||
"->apply".equals(operator))
{ Expression leftdet = left.determinate();
Expression rightdet = right.determinate();
return (new BinaryExpression("&",leftdet,rightdet)).simplify();
}
/* if (":".equals(operator) ||
"/:".equals(operator) || "<:".equals(operator) ||
"->includes".equals(operator) || "->excludes".equals(operator) ||
"->includesAll".equals(operator) || "->excludesAll".equals(operator) ||
"->including".equals(operator) || "->excluding".equals(operator) ||
"->count".equals(operator) || "->prepend".equals(operator) ||
"->indexOf".equals(operator) || "->hasPrefix".equals(operator) ||
"->hasSuffix".equals(operator) ||
"->hasMatch".equals(operator) ||
"->isMatch".equals(operator) ||
"/<:".equals(operator))
{ return new BasicExpression(true); }
// provided left, right have no common features */
if ("&".equals(operator) && isCaseExpression())
{ return caseDisjointness(); }
else // if ("&".equals(operator))
{ Expression dand =
new BinaryExpression("&",left.determinate(),right.determinate());
return dand.simplify();
}
// union, intersection, etc?
// return new BasicExpression("false",0);
}
public Expression firstConjunct()
{ if ("&".equals(operator))
{ return left.firstConjunct(); }
return this;
}
public Expression removeFirstConjunct()
{ if ("&".equals(operator))
{ Expression lrem = left.removeFirstConjunct();
return simplify("&",lrem,right,null);
}
return new BasicExpression(true);
}
public void setPre()
{ left.setPre();
right.setPre();
if (accumulator != null &&
accumulator.getInitialExpression() != null)
{ accumulator.getInitialExpression().setPre(); }
}
public Expression removePrestate()
{ Expression dl = left.removePrestate();
Expression dr = right.removePrestate();
BinaryExpression res = new BinaryExpression(operator,dl,dr);
res.setType(type);
res.setElementType(elementType);
res.needsBracket = needsBracket;
res.formalParameter = formalParameter;
res.accumulator = accumulator;
res.iteratorVariable = iteratorVariable;
return res;
}
public Expression checkConversions(Type propType, Type propElemType, java.util.Map interp)
{ /* if (type != null && type.isEntity())
{ Entity ent = type.getEntity();
if (ent.hasStereotype("source"))
{ Entity tent = (Entity) interp.get(ent + "");
System.out.println("INTERPRETATION OF " + ent + " IS= " + tent);
if (tent == null) // use the expected target type instead
{ if (propType != null && propType.isEntity())
{ tent = propType.getEntity(); }
} */
Expression leftres = null;
Expression rightres = null;
if ("boolean".equals(type + "") || "int".equals(type + "") || "long".equals(type + "") ||
"double".equals(type + "") || "String".equals(type + ""))
{ return this; }
if (operator.equals("->exists") || operator.equals("->forAll") ||
"->existsLC".equals(operator) || "#LC".equals(operator) ||
operator.equals("#") || operator.equals("!") || operator.equals("->exists1") ||
operator.equals("#1") || operator.equals("and") || operator.equals("or"))
{ return this; } // intended as a boolean value
if (operator.equals("->select") || operator.equals("->reject") || operator.equals("->collect") ||
operator.equals("|") || operator.equals("|R") || operator.equals("|C"))
{ if (elementType != null && elementType.isEntity())
{ Entity ent = elementType.getEntity();
if (ent.hasStereotype("source"))
{ Entity tent = (Entity) interp.get(ent + "");
if (tent == null)
{ if (propElemType != null && propElemType.isEntity())
{ tent = propElemType.getEntity(); }
else
{ return this; } // no interpretation
}
BasicExpression res = new BasicExpression(tent + "");
res.setType(type);
res.setMultiplicity(multiplicity);
res.setElementType(new Type(tent));
res.setUmlKind(Expression.CLASSID);
BinaryExpression ind =
new BinaryExpression("->collect",this,new BasicExpression("$id"));
ind.setType(type);
ind.setElementType(new Type("String",null));
res.setArrayIndex(ind);
return res;
}
}
}
if (operator.equals("^") ||
"->concatenate".equals(operator)
|| operator.equals("\\/") ||
operator.equals("->at") || operator.equals("->apply") ||
operator.equals("/\\") || operator.equals("->union") ||
operator.equals("->intersection") || operator.equals("->symmetricDifference"))
{ leftres = left.checkConversions(propType, propElemType, interp);
rightres = right.checkConversions(propType, propElemType, interp);
return new BinaryExpression(operator,leftres,rightres);
}
else if (operator.equals("->append") || operator.equals("->including") ||
operator.equals("->prepend") || operator.equals("->excluding") ||
operator.equals("->excludingAt") ||
operator.equals("->excludingFirst"))
{ leftres = left.checkConversions(propType, propElemType, interp);
rightres = right.checkConversions(propElemType, propElemType, interp);
return new BinaryExpression(operator,leftres,rightres);
}
// if ->append, ->prepend, ->including expect a single elem
if (elementType != null && elementType.isEntity())
{ Entity ent = elementType.getEntity();
if (ent.hasStereotype("source"))
{ Entity tent = (Entity) interp.get(ent + "");
if (tent == null)
{ if (propElemType != null && propElemType.isEntity())
{ tent = propElemType.getEntity(); }
else
{ return this; } // no interpretation
}
BasicExpression res = new BasicExpression(tent + "");
res.setType(type);
res.setMultiplicity(multiplicity);
res.setElementType(new Type(tent));
res.setUmlKind(Expression.CLASSID);
BinaryExpression ind =
new BinaryExpression("->collect",this,new BasicExpression("$id"));
ind.setType(type);
ind.setElementType(new Type("String",null));
res.setArrayIndex(ind);
return res;
}
}
return this;
}
public Expression replaceModuleReferences(UseCase uc)
{ Expression rr = right.replaceModuleReferences(uc);
Expression ll = left.replaceModuleReferences(uc);
Expression res = new BinaryExpression(operator,ll,rr);
res.setType(type);
res.setElementType(elementType);
res.umlkind = umlkind;
res.formalParameter = formalParameter;
return res;
}
private boolean isForallExists()
{ if (operator.equals("!") && (right instanceof BinaryExpression))
{ BinaryExpression br = (BinaryExpression) right;
if (br.operator.equals("#") || "#LC".equals(br.operator) || br.operator.equals("#1"))
{ if (br.right instanceof BinaryExpression)
{ return true; }
}
}
return false;
}
private boolean isCaseExpression()
{ boolean res = "&".equals(operator);
BinaryExpression beleft;
BinaryExpression beright;
if (res && left instanceof BinaryExpression &&
right instanceof BinaryExpression)
{ beleft = (BinaryExpression) left;
beright = (BinaryExpression) right;
}
else
{ return false; }
if ("=>".equals(beleft.operator) && "=>".equals(beright.operator))
{ return res; }
if ("=>".equals(beleft.operator) && beright.isCaseExpression())
{ return res; }
if ("=>".equals(beright.operator) && beleft.isCaseExpression())
{ return res; }
return false;
}
private Vector caseConditions()
{ Vector res = new Vector();
BinaryExpression beleft;
BinaryExpression beright;
if (left instanceof BinaryExpression &&
right instanceof BinaryExpression)
{ beleft = (BinaryExpression) left;
beright = (BinaryExpression) right;
}
else
{ return res; }
if ("=>".equals(beleft.operator) && "=>".equals(beright.operator))
{ res.add(beleft.left);
res.add(beright.left);
return res;
}
if ("=>".equals(beleft.operator) && beright.isCaseExpression())
{ res.add(beleft.left);
res.addAll(beright.caseConditions());
return res;
}
if ("=>".equals(beright.operator) && beleft.isCaseExpression())
{ res.addAll(beleft.caseConditions());
res.add(beright.left);
return res;
}
return res;
}
private Vector cases(Vector caselist)
{ Vector res = new Vector();
BinaryExpression beleft;
BinaryExpression beright;
if (left instanceof BinaryExpression &&
right instanceof BinaryExpression)
{ beleft = (BinaryExpression) left;
beright = (BinaryExpression) right;
}
else
{ return res; }
if ("=>".equals(beleft.operator) && "=>".equals(beright.operator))
{ res.add(beleft.left);
res.add(beright.left);
caselist.add(beleft);
caselist.add(beright);
return res;
}
if ("=>".equals(beleft.operator) && beright.isCaseExpression())
{ res.add(beleft.left);
caselist.add(beleft);
res.addAll(beright.cases(caselist));
return res;
}
if ("=>".equals(beright.operator) && beleft.isCaseExpression())
{ res.addAll(beleft.cases(caselist));
res.add(beright.left);
caselist.add(beright);
return res;
}
return res;
}
private Expression caseDisjointness()
{ Vector cases = caseConditions();
Expression res = new BasicExpression(true);
for (int i = 0; i < cases.size(); i++)
{ Expression e1 = (Expression) cases.get(i);
for (int j = i + 1; j < cases.size(); j++)
{ Expression e2 = (Expression) cases.get(j);
Expression neg = e2.computeNegation4succ();
Expression next = new BinaryExpression("=>",e1,neg);
next.setBrackets(true);
res = simplify("&",res,next,null);
}
}
return res;
}
private Expression caseCompleteness(Entity ent)
{ Vector caselist = new Vector();
Vector caseconds = cases(caselist);
Expression res = new BasicExpression(true);
for (int i = 0; i < caselist.size(); i++)
{ BinaryExpression cse = (BinaryExpression) caselist.get(i);
Expression e1 = (Expression) caseconds.get(i);
Expression ce = cse.completeness(ent);
Expression next = new BinaryExpression("=>",e1,ce);
next.setBrackets(true);
res = simplify("&",res,next,null);
}
return res;
} // and disjunction of guards is true
public Expression completeness(Entity ent)
{ Expression res = new BasicExpression(true);
if (operator.equals("or"))
{ Expression cleft = left.completeness(ent);
Expression cright = right.completeness(ent);
res = simplify("&",cleft,cright,null);
return res;
}
if (operator.equals("&") && isCaseExpression())
{ return caseCompleteness(ent); } // /\i Ei => completeness(casei)
else
{ Vector v = updateFeatures();
Vector feats = ent.allDefinedFeatures();
if (v.containsAll(feats)) // complete
{ // System.out.println("Expression: " + this + " complete.");
return res;
}
else
{ System.out.println("Expression: " + this + " incomplete: updates " + v +
", not all defined features: " + feats);
return new BasicExpression(false);
}
}
}
public Expression addPreForms(String v)
{ Expression l1 = left.addPreForms(v);
Expression r1 = right.addPreForms(v);
Expression res = new BinaryExpression(operator,l1,r1);
res.needsBracket = needsBracket;
res.formalParameter = formalParameter;
return res;
}
public Vector updateFeatures()
{ Vector uv = updateVariables();
Vector res = new Vector();
for (int i = 0; i < uv.size(); i++)
{ Expression e = (Expression) uv.get(i);
if (e instanceof BasicExpression)
{ res.add(((BasicExpression) e).data); }
}
return res;
}
public String toZ3()
{ String res = "";
String op = operator;
if (operator.startsWith("->"))
{ op = operator.substring(2,operator.length()); }
String leftz3 = left.toZ3();
String rightz3 = right.toZ3();
String memberEnt = "";
Type membt = right.elementType;
if (membt != null)
{ Entity e = membt.getEntity();
memberEnt = e + "";
}
if (operator.equals("!")) // Should be no # or #1 remaining
{ res = "(forall ((" + ((BinaryExpression) left).left + " " +
((BinaryExpression) left).right + ")) " + rightz3 + ")";
return res;
}
if (operator.equals("&"))
{ return "(and " + leftz3 + " " + rightz3 + ")"; }
if (operator.equals("->at") || operator.equals("->apply"))
{ return "(" + leftz3 + " " + rightz3 + ")"; }
if (operator.equals(":"))
{ return "(member" + memberEnt + " " + leftz3 + " " + rightz3 + ")"; }
if (operator.equals("/:"))
{ return "(not (member" + memberEnt + " " + leftz3 + " " + rightz3 + "))"; }
if (operator.equals("->includes"))
{ return "(member" + memberEnt + " " + rightz3 + " " + leftz3 + ")"; }
if (operator.equals("->excludes"))
{ return "(not (member" + memberEnt + " " + rightz3 + " " + leftz3 + "))"; }
if (operator.equals("->including") || operator.equals("->prepend"))
{ return "(insert " + rightz3 + " " + leftz3 + ")"; }
return "(" + op + " " + leftz3 + " " + rightz3 + ")";
}
public String toOcl(java.util.Map env, boolean local)
{ String re = right.toOcl(env,local);
if ("#LC".equals(operator) || operator.equals("#"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->exists(" + lle + " | " + re + ")";
}
if (operator.equals("#1"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->one(" + lle + " | " + re + ")";
}
if (operator.equals("!"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->forAll(" + lle + " | " + re + ")";
}
if (operator.equals("|"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->select(" + lle + " | " + re + ")";
}
if (operator.equals("|R"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->reject(" + lle + " | " + re + ")";
}
if (operator.equals("|C"))
{ String lle = ((BinaryExpression) left).left.toOcl(env,local);
String lri = ((BinaryExpression) left).right.toOcl(env,local);
return lri + "->collect(" + lle + " | " + re + ")";
}
String le = left.toOcl(env,local);
if (operator.equals("=>"))
{ return le + " implies " + re; }
if (operator.equals("&"))
{ return le + " and " + re; }
if (operator.equals(":"))
{ return re + "->includes(" + le + ")"; }
if (operator.equals("/:"))
{ return re + "->excludes(" + le + ")"; }
if (operator.equals("<:"))
{ return re + "->includesAll(" + le + ")"; }
if (operator.equals("/<:"))
{ return "not(" + re + "->includesAll(" + le + "))"; }
if (operator.equals("\\/") || operator.equals("^") || "->concatenate".equals(operator))
{ return le + "->union(" + re + ")"; }
if (operator.equals("/\\"))
{ return le + "->intersection(" + re + ")"; }
if (operator.equals("->including") && keyValue != null)
{ return le + "->including(" + keyValue.toOcl(env,local) + ", " + re + ")"; }
if (operator.equals("->excluding") && keyValue != null)
{ return le + "->excluding(" + keyValue.toOcl(env,local) + ", " + re + ")"; }
if (operator.startsWith("->"))
{ return le + operator + "(" + re + ")"; } // always brackets on re
return le + " " + operator + " " + re;
} // - on collections is excludesAll in OCL? Plus set < elem, etc
// saveTextModel
public String saveModelData(PrintWriter out)
{ String id =
Identifier.nextIdentifier("binaryexpression_");
out.println(id + " : BinaryExpression");
out.println(id + ".expId = \"" + id + "\"");
String op = operator;
Expression lft = left;
if (operator.equals("->iterate"))
{ op = "->iterate";
out.println(id + ".variable = \"" + iteratorVariable + "\"");
if (accumulator != null)
{ String accid = accumulator.saveModelData(out);
out.println(id + ".accumulator = " + accid);
}
}
else if (operator.equals("#"))
{ op = "->exists";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if ("#LC".equals(operator))
{ op = "->existsLC";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("!"))
{ op = "->forAll";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("#1"))
{ op = "->exists1";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|"))
{ op = "->select";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|R"))
{ op = "->reject";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|C"))
{ op = "->collect";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|unionAll"))
{ op = "->unionAll";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|intersectAll"))
{ op = "->intersectAll";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|concatenateAll"))
{ op = "->concatenateAll";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|selectMaximals"))
{ op = "->selectMaximals";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|selectMinimals"))
{ op = "->selectMinimals";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("|sortedBy"))
{ op = "->sortedBy";
lft = ((BinaryExpression) left).right;
out.println(id + ".variable = \"" + ((BinaryExpression) left).left + "\"");
}
else if (operator.equals("let"))
{ op = "let";
String var = accumulator.getName();
out.println(id + ".variable = \"" + var + "\"");
Type vtype = accumulator.getType();
if (vtype != null)
{ String vtypeid = vtype.getUMLModelName(out);
out.println(id + ".variableType = " + vtypeid);
}
}
else if (operator.equals("->exists") ||
operator.equals("->exists1") ||
"->existsLC".equals(operator) ||
operator.equals("->forAll") ||
operator.equals("->select") ||
operator.equals("->reject") ||
operator.equals("->collect"))
{ out.println(id + ".variable = \"self\""); }
// Cannot use self, because it is a keyword in Python, etc.
if (operator.equals("->including") && keyValue != null)
{ String varid = keyValue.saveModelData(out);
out.println(id + ".variable = " + varid);
}
else if (operator.equals("->excluding") && keyValue != null)
{ String varid = keyValue.saveModelData(out);
out.println(id + ".variable = " + varid);
}
out.println(id + ".operator = \"" + op + "\"");
String leftid = lft.saveModelData(out);
String rightid = right.saveModelData(out);
out.println(id + ".left = " + leftid);
out.println(id + ".right = " + rightid);
String tname = "void";
if (type != null)
{ tname = type.getUMLModelName(out); }
out.println(id + ".type = " + tname);
if (elementType != null)
{ String etname = elementType.getUMLModelName(out);
out.println(id + ".elementType = " + etname);
}
else if (type != null &&
type.getElementType() != null)
{ String etname =
type.getElementType().getUMLModelName(out);
out.println(id + ".elementType = " + etname);
}
else if (type != null &&
Type.isBasicType(type))
{ out.println(id + ".elementType = " + tname); }
else
{ out.println(id + ".elementType = " + tname); }
out.println(id + ".needsBracket = " + needsBracket);
out.println(id + ".umlKind = " + umlkind);
// out.println(id + ".prestate = " + prestate);
return id;
}
public Vector mutantOperators(String op)
{ Vector res = new Vector();
if (":".equals(op))
{ res.add("/:"); }
else if ("/:".equals(op))
{ res.add(":"); }
else if ("<".equals(op))
{ res.add("<="); }
else if (">".equals(op))
{ res.add(">="); }
else if ("/=".equals(op))
{ res.add("="); }
else if ("=".equals(op) && left.isNotLocalVariable())
{ res.add("/="); }
else if ("->union".equals(op))
{ res.add("->intersection"); }
else if ("->intersection".equals(op))
{ res.add("->union"); }
else if ("->unionAll".equals(op))
{ res.add("->intersectAll"); }
else if ("->intersectAll".equals(op))
{ res.add("->unionAll"); }
else if ("->append".equals(op))
{ res.add("->prepend"); }
else if ("->prepend".equals(op))
{ res.add("->append"); }
else if ("->including".equals(op))
{ res.add("->excluding"); }
else if ("->excluding".equals(op))
{ res.add("->including"); }
else if ("->includes".equals(op))
{ res.add("->excludes"); }
else if ("->excludes".equals(op))
{ res.add("->includes"); }
else if ("->select".equals(op))
{ res.add("->reject"); }
else if ("->reject".equals(op))
{ res.add("->select"); }
else if ("->selectMinimals".equals(op))
{ res.add("->selectMaximals"); }
else if ("->selectMaximals".equals(op))
{ res.add("->selectMinimals"); }
else if ("|".equals(op))
{ res.add("|R"); }
else if ("|R".equals(op))
{ res.add("|"); }
else if ("|unionAll".equals(op))
{ res.add("|intersectAll"); }
else if ("|intersectAll".equals(op))
{ res.add("|unionAll"); }
else if ("->exists".equals(op))
{ res.add("->forAll"); }
else if ("->forAll".equals(op) || "->exists1".equals(op))
{ res.add("->exists"); }
else if ("!".equals(op) || "#1".equals(op))
{ res.add("#"); }
else if ("->before".equals(op))
{ res.add("->after"); }
else if ("->after".equals(op))
{ res.add("->before"); }
else if ("->hasPrefix".equals(op))
{ res.add("->hasSuffix"); }
else if ("->hasSuffix".equals(op))
{ res.add("->hasPrefix"); }
else if ("->restrict".equals(op))
{ res.add("->antirestrict"); }
else if ("->antirestrict".equals(op))
{ res.add("->restrict"); }
else if ("/".equals(op))
{ res.add("*"); }
else if ("mod".equals(op))
{ res.add("div"); }
else if ("div".equals(op))
{ res.add("mod"); }
else if (left.isNumeric() && right.isNumeric() && op.equals("+"))
{ res.add("-");
res.add("*");
}
else if (left.isNumeric() && right.isNumeric() && op.equals("-"))
{ res.add("+"); }
res.add(op);
return res;
} // ->compareTo: swap left & right.
public Vector mutants()
{ Vector lms = left.mutants();
Vector rms = right.mutants();
Vector res = new Vector();
if ("->compareTo".equals(operator))
{ for (int i = 0; i < lms.size(); i++)
{ Expression lm = (Expression) lms.get(i);
for (int j = 0; j < rms.size(); j++)
{ Expression rm = (Expression) rms.get(j);
BinaryExpression mutant =
(BinaryExpression) this.clone();
mutant.operator = "->compareTo";
mutant.left = rm;
mutant.right = lm;
if (VectorUtil.containsEqualString(mutant + "",res)) { }
else
{ res.add(mutant); }
}
}
System.out.println(">>> All mutants of " + this + " are: " + res);
return res;
}
Vector mutantOps = mutantOperators(operator);
for (int i = 0; i < lms.size(); i++)
{ Expression lm = (Expression) lms.get(i);
for (int j = 0; j < rms.size(); j++)
{ Expression rm = (Expression) rms.get(j);
for (int k = 0; k < mutantOps.size(); k++)
{ String mop = (String) mutantOps.get(k);
BinaryExpression mutant = (BinaryExpression) this.clone();
mutant.operator = mop;
mutant.left = lm;
mutant.right = rm;
if (VectorUtil.containsEqualString(mutant + "",res)) { }
else
{ res.add(mutant); }
}
}
}
System.out.println(">>> All mutants of " + this + " are: " + res);
return res;
}
public Vector singleMutants()
{ Vector rms = right.singleMutants();
Vector mutantOps = mutantOperators(operator);
if ("result".equals(left + "") && "=".equals(operator))
{ mutantOps = new Vector(); }
Vector res = new Vector();
if ("#".equals(operator) || "!".equals(operator) ||
"#1".equals(operator) || "|C".equals(operator) ||
"|".equals(operator) || "|R".equals(operator) ||
"|A".equals(operator) || "#LC".equals(operator) ||
"|intersectAll".equals(operator) ||
"|unionAll".equals(operator) ||
"|selectMinimals".equals(operator) ||
"|selectMaximals".equals(operator) ||
"|concatenateAll".equals(operator) ||
"|sortedBy".equals(operator))
{ BinaryExpression dom = (BinaryExpression) left;
Expression var = dom.left;
Expression lhs = dom.right;
Vector leftmuts = lhs.singleMutants();
for (int i = 0; i < leftmuts.size(); i++)
{ Expression lm = (Expression) leftmuts.get(i);
BinaryExpression mutant =
(BinaryExpression) this.clone();
mutant.operator = operator;
mutant.left = new BinaryExpression(":", var, lm);
mutant.right = right;
if (VectorUtil.containsEqualString(mutant + "",res)) { }
else
{ res.add(mutant); }
}
for (int i = 0; i < rms.size(); i++)
{ Expression rm = (Expression) rms.get(i);
BinaryExpression mutant =
(BinaryExpression) this.clone();
mutant.operator = operator;
mutant.left = left;
mutant.right = rm;
if (VectorUtil.containsEqualString(mutant + "",res)) { }
else
{ res.add(mutant); }
}
if (mutantOps.size() > 0)
{ String mutop = (String) mutantOps.get(0);
BinaryExpression mut = (BinaryExpression) this.clone();
mut.left = left;