Massage the AST so that identical sub-formula share the same
reference-counted formula*. One can't call constructors for AST items anymore, everything need to be acquired through instance() class methods. * src/ltlast/formula.cc, src/ltlast/refformula.cc, src/ltlast/refformula.hh: New files. * src/ltlast/Makefile.am (libltlast_la_SOURCES): Add them. * src/ltlast/atomic_prop.cc, src/ltlast/atomic_prop.hh, src/ltlast/unop.cc, src/ltlast/unop.hh, src/ltlast/binop.cc, src/ltlast/binop.hh: Make the constructor and destructor protected. Define a static function `instance()' to get an instance with specific argument. Use a map called `instances' to store all known instances. Inherit from ref_formula. * src/ltlast/constant.hh, src/ltlast/constant.cc: Protect the constructor and destructor. Provide the false_instance() and true_instance() functions instead. * src/formula.hh (ref, unref, ref_, unref_): New methods. * src/ltlast/multop.cc, src/ltlast/multop.hh: Protect the constructor, destructor, as well as the add() method. Provides the instance(), and add() class methods instead. Store children_ as a pointer. * src/ltlenv/defaultenv.cc (require): Adjust to call atomic_prop::instance. * src/ltlparse/ltlparse.yy: Adjust to call instance() functions instead of constructors. * src/ltltest/Makefile.am (LDADD): Tweak library ordering. * src/ltlvisit/clone.hh (clone_visitor): Inherit from visitor, not const_visitor, and adjust all prototypes appropriately. * src/ltlvisit/clone.cc (clone_visitor): Likewise. Call ref() or instance() methods instead of copy constructors. * src/ltlvisit/equals.cc: Simplify atomic_prop and constant cases. * src/ltlvisit/lunabbrev.hh, src/ltlvisit/lunabbrev.cc, src/ltlvisit/tunabbrev.hh, src/ltlvisit/tunabbrev.cc, src/ltlvisit/nenoform.hh, src/ltlvisit/nenoform.cc: Use instance() methods instead of constructor. Make these children of visitor, not const_visitor. * src/ltltest/readltl.c (main): Do not delete the formula.
This commit is contained in:
parent
f1838ab8ef
commit
5f6d8b6234
29 changed files with 548 additions and 253 deletions
|
|
@ -1,7 +1,7 @@
|
|||
#include "ltlast/allnodes.hh"
|
||||
#include "tunabbrev.hh"
|
||||
|
||||
namespace spot
|
||||
namespace spot
|
||||
{
|
||||
namespace ltl
|
||||
{
|
||||
|
|
@ -13,8 +13,8 @@ namespace spot
|
|||
{
|
||||
}
|
||||
|
||||
void
|
||||
unabbreviate_ltl_visitor::visit(const unop* uo)
|
||||
void
|
||||
unabbreviate_ltl_visitor::visit(unop* uo)
|
||||
{
|
||||
switch (uo->op())
|
||||
{
|
||||
|
|
@ -23,26 +23,26 @@ namespace spot
|
|||
this->super::visit(uo);
|
||||
return;
|
||||
case unop::F:
|
||||
result_ = new binop(binop::U,
|
||||
new constant(constant::True),
|
||||
recurse(uo->child()));
|
||||
result_ = binop::instance(binop::U,
|
||||
constant::true_instance(),
|
||||
recurse(uo->child()));
|
||||
return;
|
||||
case unop::G:
|
||||
result_ = new binop(binop::R,
|
||||
new constant(constant::False),
|
||||
recurse(uo->child()));
|
||||
result_ = binop::instance(binop::R,
|
||||
constant::false_instance(),
|
||||
recurse(uo->child()));
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
formula*
|
||||
unabbreviate_ltl_visitor::recurse(const formula* f)
|
||||
|
||||
formula*
|
||||
unabbreviate_ltl_visitor::recurse(formula* f)
|
||||
{
|
||||
return unabbreviate_ltl(f);
|
||||
}
|
||||
|
||||
formula*
|
||||
unabbreviate_ltl(const formula* f)
|
||||
formula*
|
||||
unabbreviate_ltl(formula* f)
|
||||
{
|
||||
unabbreviate_ltl_visitor v;
|
||||
f->accept(v);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue