d3b702a97c
* src/ltlast/formula.hh (hash): Remove const from return type. This kills a g++-4.3 warning. * src/misc/hash.hh: Adjust to use unordered_set and unordered_map from TR1 when g++-4.3 is used. * src/evtgba/product.cc, src/ltltest/randltl.cc, src/ltlvisit/randomltl.cc, src/ltlvisit/tostring.cc, src/misc/freelist.hh, src/misc/optionmap.cc, src/tgba/tgbareduc.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/randomgraph.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/randtgba.cc, src/ltltest/equals.cc, src/ltltest/readltl.cc, src/ltltest/reduc.cc, src/ltltest/syntimpl.cc, src/ltltest/tostring.cc, src/tgbatest/ltlprod.cc, src/tgbatest/powerset.cc, src/tgbatest/explprod.cc, src/tgbatest/mixprod.cc, src/tgbatest/readsave.cc, src/tgbatest/reductgba.cc, src/tgbatest/tgbaread.cc, src/tgbatest/tripprod.cc, src/evtgbatest/product.cc, src/evtgbatest/readsave.cc, src/evtgbatest/ltl2evtgba.cc, src/evtgbatest/readsave.cc: Add missing includes. * src/tgbatest/explicit.test, src/tgbatest/explprod.test, src/tgbatest/explpro2.test, src/tgbatest/troprod.test, src/tgbatest/emptchk.test: Cope with different outputs.
80 lines
2.2 KiB
C++
80 lines
2.2 KiB
C++
// Copyright (C) 2003, 2008 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 <iostream>
|
|
#include <cassert>
|
|
#include <cstdlib>
|
|
#include "ltlparse/public.hh"
|
|
#include "ltlvisit/tostring.hh"
|
|
#include "ltlvisit/destroy.hh"
|
|
#include "ltlast/allnodes.hh"
|
|
|
|
void
|
|
syntax(char *prog)
|
|
{
|
|
std::cerr << prog << " formula1" << std::endl;
|
|
exit(2);
|
|
}
|
|
|
|
int
|
|
main(int argc, char **argv)
|
|
{
|
|
if (argc != 2)
|
|
syntax(argv[0]);
|
|
|
|
spot::ltl::parse_error_list p1;
|
|
spot::ltl::formula* f1 = spot::ltl::parse(argv[1], p1);
|
|
|
|
if (spot::ltl::format_parse_errors(std::cerr, argv[1], p1))
|
|
return 2;
|
|
|
|
// The string generated from an abstract tree should be parsable
|
|
// again.
|
|
|
|
std::string f1s = spot::ltl::to_string(f1);
|
|
std::cout << f1s << std::endl;
|
|
|
|
spot::ltl::formula* f2 = spot::ltl::parse(f1s, p1);
|
|
|
|
if (spot::ltl::format_parse_errors(std::cerr, f1s, p1))
|
|
return 2;
|
|
|
|
// This second abstract tree should be equal to the first.
|
|
|
|
if (f1 != f2)
|
|
return 1;
|
|
|
|
// It should also map to the same string.
|
|
|
|
std::string f2s = spot::ltl::to_string(f2);
|
|
std::cout << f2s << std::endl;
|
|
|
|
if (f2s != f1s)
|
|
return 1;
|
|
|
|
spot::ltl::destroy(f1);
|
|
spot::ltl::destroy(f2);
|
|
assert(spot::ltl::atomic_prop::instance_count() == 0);
|
|
assert(spot::ltl::unop::instance_count() == 0);
|
|
assert(spot::ltl::binop::instance_count() == 0);
|
|
assert(spot::ltl::multop::instance_count() == 0);
|
|
return 0;
|
|
}
|