Add support for W (weak until) and M (strong release) operators.

* src/ltlast/binop.cc, src/ltlast/binop.cc: Add support for
these new operators.
* src/ltlparse/ltlparse.yy, src/ltlparse/ltlscan.ll: Parse them.
* src/ltltest/reduccmp.test: Add new tests for W and M.
* src/ltlvisit/basicreduce.cc, src/ltlvisit/contain.cc,
src/ltlvisit/lunabbrev.cc, src/ltlvisit/nenoform.cc,
src/ltlvisit/randomltl.cc, src/ltlvisit/randomltl.hh,
src/ltlvisit/reduce.cc, src/ltlvisite/simpfg.cc,
src/ltlvisit/simpfg.hh, src/ltlvisit/syntimpl.cc,
src/ltlvisit/tostring.cc, src/tgba/formula2bdd.cc,
src/tgbaalgos/eltl2tgba_lacim.cc, src/tgbaalgos/ltl2taa.cc,
src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc:
Add support for W and M.
* src/tgbatest/ltl2neverclaim.test: Test never claim output
using LBTT, this is more thorough.  Also we cannot use -N
any more in the spotlbtt.test.
* src/tgbatests/ltl2tgba.cc: Define M and W for ELTL.
* src/tgbatest/ltl2neverclaim.test: Test W and M, and use
-DS instead of -N, because lbtt-translate does not want
to translate these operators for tools that masquerade as Spin.

src/ltlast/binop.cc

@@ -1,4 +1,4 @@
-// Copyright (C) 2009 Laboratoire de Recherche et Développement
+// Copyright (C) 2009, 2010 Laboratoire de Recherche et Développement
 // de l'Epita (LRDE).
 // Copyright (C) 2003, 2005 Laboratoire d'Informatique de Paris
 // 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
@@ -115,6 +115,10 @@ namespace spot
 	  return "U";
 	case R:
 	  return "R";
+	case W:
+	  return "W";
+	case M:
+	  return "M";
 	}
       // Unreachable code.
       assert(0);
@@ -126,7 +130,7 @@ namespace spot
     binop*
     binop::instance(type op, formula* first, formula* second)
     {
-      // Sort the operands of associative operators, so that for
+      // Sort the operands of commutative operators, so that for
       // example the formula instance for 'a xor b' is the same as
       // that for 'b xor a'.
       switch (op)
@@ -139,7 +143,9 @@ namespace spot
 	case Implies:
 	case U:
 	case R:
-	  // Non associative operators.
+	case W:
+	case M:
+	  // Non commutative operators.
 	  break;
 	}
 

src/ltlast/binop.hh

@@ -1,4 +1,4 @@
-// Copyright (C) 2009 Laboratoire de Recherche et Développement
+// Copyright (C) 2009, 2010 Laboratoire de Recherche et Développement
 // de l'Epita (LRDE).
 // Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris
 // 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
@@ -47,7 +47,14 @@ namespace spot
       ///
       /// And and Or are not here.  Because they
       /// are often nested we represent them as multops.
-      enum type { Xor, Implies, Equiv, U, R };
+      enum type { Xor,
+		  Implies,
+		  Equiv,
+		  U, //< until
+		  R, //< release (dual of until)
+		  W, //< weak until
+		  M  //< strong release (dual of weak until)
+      };
 
       /// Build an unary operator with operation \a op and
       /// children \a first and \a second.