public void MonaTestVar0decl()
{
string input = @"
var0 a, b ; # Boolean vars a and b
";
MonaProgram pgm = MonaParser.Parse(input);
Assert.AreEqual <int>(1, pgm.declarations.Count);
Assert.AreEqual <string>("var0 a,b;", pgm.ToString().Trim());
}
public void MonaTest2()
{
string input = @"
# Qe describes the valid indices of a queue
pred isWfQueue(var2 Qe) =
all1 p: (p in Qe & p > 0 => p - 1 in Qe);
# isx holds if p contains an x
pred is0(var1 p, var2 Qe, Q1, Q2) = p in Qe & p notin Q1 & p notin Q2;
pred is1(var1 p, var2 Qe, Q1, Q2) = p in Qe & p notin Q1 & p in Q2;
pred is2(var1 p, var2 Qe, Q1, Q2) = p in Qe & p in Q1 & p notin Q2;
pred is3(var1 p, var2 Qe, Q1, Q2) = p in Qe & p in Q1 & p in Q2;
# lt compares the elements at positions p and q of a queue
pred lt(var1 p, q, var2 Qe, Q1, Q2) =
(is0(p, Qe, Q1, Q2) & ~is0(q, Qe, Q1, Q2))
| ( is1(p, Qe, Q1, Q2)
& (is2(q, Qe, Q1, Q2) | is3(q, Qe, Q1, Q2)))
| ( is2(p, Qe, Q1, Q2)
& (is3(q, Qe, Q1, Q2)));
# isLast holds if p is the last element in the queue
pred isLast(var1 p, var2 Qe) =
p in Qe & (all1 q': q' in Qe => q' <= p);
# an ordered queue of length l
pred Queue(var2 Qe, Q1, Q2, var1 l) =
isLast(l - 1, Qe)
&
(all1 p, q: p<q & p in Qe & q in Qe => lt(p, q, Qe, Q1, Q2));
# eqQueue2 compares elements in two queues
pred eqQueue2(var1 p, q, var2 Q1, Q2, Q1', Q2') =
(p in Q1 <=> q in Q1')
& (p in Q2 <=> q in Q2');
# LooseOne holds about a queue Q and a queue Q' if
# queue Q' is the same as Q except that one
# element (denoted by p below) is removed
pred LooseOne(var2 Qe, Q1, Q2, Qe', Q1', Q2') =
ex1 p: p in Qe
& (all1 q: (~isLast(q, Qe) => (q in Qe <=> q in Qe'))
& (isLast(q, Qe) => (q notin Qe')))
& (all1 q: q<p & q in Qe => eqQueue2(q, q, Q1, Q2, Q1', Q2'))
& (all1 q: q > p & q in Qe => eqQueue2(q, q - 1, Q1, Q2, Q1', Q2'));
var2 Qe, Q1, Q2; # the queue Q
var2 Qe', Q1', Q2'; # the queue Q'
assert isWfQueue(Qe);
# the primed variables denote a queue of length 3 containing
# three of the elements 0, 1, 2, 3 in that order and the element 3
Queue(Qe, Q1, Q2, 4); # the queue Q is a queue of length 3
# containing the elements 0, 1, 2, 3
LooseOne(Qe, Q1, Q2, Qe', Q1', Q2'); # Q' is Q except for one element
ex1 p: is3(p, Qe', Q1', Q2'); # Q' does contain the element 3
";
MonaProgram pgm = MonaParser.Parse(input);
string s = pgm.ToString();
Assert.IsTrue(pgm.declarations.Count > 0);
}