e48338e8d8
new keyword in the ELTL format: finish, which applies to an automaton operator and tells whether it just completed. * src/eltlparse/eltlparse.yy: Clean it. Add finish. * src/eltlparse/eltlscan.ll: Add finish. * src/formula_tree.cc, src/formula_tree.hh: New files. Define a small AST representing formulae where atomic props are unknown which is used in the ELTL parser. * src/ltlast/automatop.cc, ltlast/automatop.hh, ltlast/nfa.cc, ltlast/nfa.hh: Adjust. * src/ltlast/unop.cc, src/ltlast/unop.hh: Finish is an unop. * src/ltlvisit/basicreduce.cc, src/ltlvisit/nenoform.cc, src/ltlvisit/reduce.cc, src/ltlvisit/syntimpl.cc, src/ltlvisit/tostring.cc, src/ltlvisit/tunabbrev.cc, src/tgba/formula2bdd.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc: Handle finish in switches. * src/tgbaalgos/eltl2tgba_lacim.cc: Translate finish. * src/tgbatest/eltl2tgba.test: More tests.
75 lines
1.9 KiB
C++
75 lines
1.9 KiB
C++
// Copyright (C) 2003 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
// License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Spot; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
// 02111-1307, USA.
|
|
|
|
#include "ltlast/allnodes.hh"
|
|
#include "tunabbrev.hh"
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
unabbreviate_ltl_visitor::unabbreviate_ltl_visitor()
|
|
{
|
|
}
|
|
|
|
unabbreviate_ltl_visitor::~unabbreviate_ltl_visitor()
|
|
{
|
|
}
|
|
|
|
void
|
|
unabbreviate_ltl_visitor::visit(unop* uo)
|
|
{
|
|
switch (uo->op())
|
|
{
|
|
case unop::Finish:
|
|
case unop::X:
|
|
case unop::Not:
|
|
this->super::visit(uo);
|
|
return;
|
|
case unop::F:
|
|
result_ = binop::instance(binop::U,
|
|
constant::true_instance(),
|
|
recurse(uo->child()));
|
|
return;
|
|
case unop::G:
|
|
result_ = binop::instance(binop::R,
|
|
constant::false_instance(),
|
|
recurse(uo->child()));
|
|
return;
|
|
}
|
|
}
|
|
|
|
formula*
|
|
unabbreviate_ltl_visitor::recurse(formula* f)
|
|
{
|
|
return unabbreviate_ltl(f);
|
|
}
|
|
|
|
formula*
|
|
unabbreviate_ltl(const formula* f)
|
|
{
|
|
unabbreviate_ltl_visitor v;
|
|
const_cast<formula*>(f)->accept(v);
|
|
return v.result();
|
|
}
|
|
|
|
}
|
|
}
|