Use 'const formula*' instead of 'formula*' everywhere.
The distinction makes no sense since Spot 0.5, where we switched from mutable furmulae to immutable formulae. The difference between const_visitor and visitor made no sense either. They have been merged into one: visitor. * iface/dve2/dve2check.cc, iface/gspn/ltlgspn.cc, src/eltlparse/eltlparse.yy, src/eltlparse/public.hh, src/evtgbatest/ltl2evtgba.cc, src/kripkeparse/kripkeparse.yy, src/ltlast/atomic_prop.cc, src/ltlast/atomic_prop.hh, src/ltlast/automatop.cc, src/ltlast/automatop.hh, src/ltlast/binop.cc, src/ltlast/binop.hh, src/ltlast/bunop.cc, src/ltlast/bunop.hh, src/ltlast/constant.cc, src/ltlast/constant.hh, src/ltlast/formula.cc, src/ltlast/formula.hh, src/ltlast/formula_tree.cc, src/ltlast/formula_tree.hh, src/ltlast/multop.cc, src/ltlast/multop.hh, src/ltlast/predecl.hh, src/ltlast/refformula.cc, src/ltlast/refformula.hh, src/ltlast/unop.cc, src/ltlast/unop.hh, src/ltlast/visitor.hh, src/ltlenv/declenv.cc, src/ltlenv/declenv.hh, src/ltlenv/defaultenv.cc, src/ltlenv/defaultenv.hh, src/ltlenv/environment.hh, src/ltlparse/ltlfile.cc, src/ltlparse/ltlfile.hh, src/ltlparse/ltlparse.yy, src/ltlparse/public.hh, src/ltltest/consterm.cc, src/ltltest/equals.cc, src/ltltest/genltl.cc, src/ltltest/kind.cc, src/ltltest/length.cc, src/ltltest/randltl.cc, src/ltltest/readltl.cc, src/ltltest/reduc.cc, src/ltltest/syntimpl.cc, src/ltltest/tostring.cc, src/ltlvisit/apcollect.cc, src/ltlvisit/apcollect.hh, src/ltlvisit/clone.cc, src/ltlvisit/clone.hh, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/dotty.cc, src/ltlvisit/length.cc, src/ltlvisit/lunabbrev.cc, src/ltlvisit/lunabbrev.hh, src/ltlvisit/mark.cc, src/ltlvisit/mark.hh, src/ltlvisit/nenoform.cc, src/ltlvisit/nenoform.hh, src/ltlvisit/postfix.cc, src/ltlvisit/postfix.hh, src/ltlvisit/randomltl.cc, src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.cc, src/ltlvisit/reduce.hh, src/ltlvisit/simpfg.cc, src/ltlvisit/simpfg.hh, src/ltlvisit/simplify.cc, src/ltlvisit/simplify.hh, src/ltlvisit/snf.cc, src/ltlvisit/snf.hh, src/ltlvisit/tostring.cc, src/ltlvisit/tunabbrev.cc, src/ltlvisit/tunabbrev.hh, src/ltlvisit/wmunabbrev.cc, src/ltlvisit/wmunabbrev.hh, src/neverparse/neverclaimparse.yy, src/sabatest/sabacomplementtgba.cc, src/tgba/bdddict.cc, src/tgba/formula2bdd.cc, src/tgba/taatgba.cc, src/tgba/taatgba.hh, src/tgbaalgos/eltl2tgba_lacim.cc, src/tgbaalgos/ltl2taa.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc, src/tgbaalgos/minimize.cc, src/tgbaalgos/randomgraph.cc, src/tgbaparse/tgbaparse.yy, src/tgbatest/complementation.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/mixprod.cc, src/tgbatest/randtgba.cc: Massive adjustment! * src/tgbatest/reductgba.cc: Delete.
This commit is contained in:
parent
0f0ada825a
commit
bf62d439c9
98 changed files with 1318 additions and 1535 deletions
|
|
@ -183,11 +183,11 @@ namespace spot
|
|||
|
||||
// If the formula has the form (!b)[*], return b.
|
||||
static
|
||||
formula*
|
||||
const formula*
|
||||
strip_star_not(const formula* f)
|
||||
{
|
||||
if (bunop* s = is_Star(f))
|
||||
if (unop* n = is_Not(s->child()))
|
||||
if (const bunop* s = is_Star(f))
|
||||
if (const unop* n = is_Not(s->child()))
|
||||
return n->child();
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -195,11 +195,11 @@ namespace spot
|
|||
// If the formula as position i in multop mo has the form
|
||||
// (!b)[*];b with b being a Boolean formula, return b.
|
||||
static
|
||||
formula*
|
||||
const formula*
|
||||
match_goto(const multop *mo, unsigned i)
|
||||
{
|
||||
assert(i + 1 < mo->size());
|
||||
formula* b = strip_star_not(mo->nth(i));
|
||||
const formula* b = strip_star_not(mo->nth(i));
|
||||
if (!b || !b->is_boolean())
|
||||
return 0;
|
||||
if (mo->nth(i + 1) == b)
|
||||
|
|
@ -207,7 +207,7 @@ namespace spot
|
|||
return 0;
|
||||
}
|
||||
|
||||
class to_string_visitor: public const_visitor
|
||||
class to_string_visitor: public visitor
|
||||
{
|
||||
public:
|
||||
to_string_visitor(std::ostream& os,
|
||||
|
|
@ -301,13 +301,13 @@ namespace spot
|
|||
in_ratexp_ = true;
|
||||
top_level_ = true;
|
||||
{
|
||||
multop* m = is_multop(bo->first(), multop::Concat);
|
||||
const multop* m = is_multop(bo->first(), multop::Concat);
|
||||
if (m)
|
||||
{
|
||||
unsigned s = m->size();
|
||||
if (m->nth(s - 1) == constant::true_instance())
|
||||
{
|
||||
formula* tmp = m->all_but(s - 1);
|
||||
const formula* tmp = m->all_but(s - 1);
|
||||
tmp->accept(*this);
|
||||
tmp->destroy();
|
||||
onelast = true;
|
||||
|
|
@ -409,11 +409,11 @@ namespace spot
|
|||
switch (op)
|
||||
{
|
||||
case bunop::Star:
|
||||
if (multop* mo = is_Concat(c))
|
||||
if (const multop* mo = is_Concat(c))
|
||||
{
|
||||
unsigned s = mo->size();
|
||||
if (s == 2)
|
||||
if (formula* b = match_goto(mo, 0))
|
||||
if (const formula* b = match_goto(mo, 0))
|
||||
{
|
||||
c = b;
|
||||
sugar = Goto;
|
||||
|
|
@ -602,7 +602,7 @@ namespace spot
|
|||
if (i + 1 < max)
|
||||
{
|
||||
// Try to match (!b)[*];b
|
||||
formula* b = match_goto(mo, i);
|
||||
const formula* b = match_goto(mo, i);
|
||||
if (b)
|
||||
{
|
||||
emit_bunop_child(b);
|
||||
|
|
@ -622,10 +622,10 @@ namespace spot
|
|||
continue;
|
||||
}
|
||||
// Try to match ((!b)[*];b)[*i..j];(!b)[*]
|
||||
if (bunop* s = is_Star(mo->nth(i)))
|
||||
if (formula* b2 = strip_star_not(mo->nth(i + 1)))
|
||||
if (multop* sc = is_Concat(s->child()))
|
||||
if (formula* b1 = match_goto(sc, 0))
|
||||
if (const bunop* s = is_Star(mo->nth(i)))
|
||||
if (const formula* b2 = strip_star_not(mo->nth(i + 1)))
|
||||
if (const multop* sc = is_Concat(s->child()))
|
||||
if (const formula* b1 = match_goto(sc, 0))
|
||||
if (b1 == b2)
|
||||
{
|
||||
emit_bunop_child(b1);
|
||||
|
|
@ -754,7 +754,7 @@ namespace spot
|
|||
to_spin_string(const formula* f, std::ostream& os, bool full_parent)
|
||||
{
|
||||
// Remove xor, ->, and <-> first.
|
||||
formula* fu = unabbreviate_logic(f);
|
||||
const formula* fu = unabbreviate_logic(f);
|
||||
// Also remove W and M.
|
||||
f = unabbreviate_wm(fu);
|
||||
fu->destroy();
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue