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.
88 lines
2.4 KiB
C++
88 lines
2.4 KiB
C++
// Copyright (C) 2009 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.
|
|
|
|
/// \file ltlast/formula_tree.hh
|
|
/// \brief Trees representing formulae where atomic propositions are unknown
|
|
#ifndef SPOT_LTLAST_FORMULA_TREE_HH
|
|
# define SPOT_LTLAST_FORMULA_TREE_HH
|
|
|
|
# include <vector>
|
|
# include <boost/shared_ptr.hpp>
|
|
# include "formula.hh"
|
|
# include "multop.hh"
|
|
# include "binop.hh"
|
|
# include "unop.hh"
|
|
# include "nfa.hh"
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
/// Trees representing formulae where atomic propositions are unknown.
|
|
namespace formula_tree
|
|
{
|
|
struct node
|
|
{
|
|
virtual ~node() {};
|
|
};
|
|
/// We use boost::shared_ptr to easily handle deletion.
|
|
typedef boost::shared_ptr<node> node_ptr;
|
|
|
|
struct node_unop : node
|
|
{
|
|
unop::type op;
|
|
node_ptr child;
|
|
};
|
|
struct node_binop : node
|
|
{
|
|
binop::type op;
|
|
node_ptr lhs;
|
|
node_ptr rhs;
|
|
};
|
|
struct node_multop : node
|
|
{
|
|
multop::type op;
|
|
node_ptr lhs;
|
|
node_ptr rhs;
|
|
};
|
|
struct node_nfa : node
|
|
{
|
|
std::vector<node_ptr> children;
|
|
spot::ltl::nfa::ptr nfa;
|
|
};
|
|
/// Integer values for True and False used in node_atomic.
|
|
enum { True = -1, False = -2 };
|
|
struct node_atomic : node
|
|
{
|
|
int i;
|
|
};
|
|
|
|
/// Instanciate the formula corresponding to the node with
|
|
/// atomic propositions taken from \a v.
|
|
formula* instanciate(const node_ptr np, const std::vector<formula*>& v);
|
|
|
|
/// Get the arity.
|
|
size_t arity(const node_ptr np);
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif // SPOT_LTLAST_FORMULA_TREE_HH_
|