This gets the interface of all the functions parsing formula in line with the interface of the automaton parser: both return a "parsed_*" object (parsed_formula or parsed_automaton) that contains the said object and its list of errors. Doing so avoid having to declare the parse_error_list in advance. * spot/tl/parse.hh, spot/parsetl/parsetl.yy: Do the change. * spot/parsetl/fmterror.cc: Adjust the error printer. * NEWS: Document it. * bin/common_finput.cc, bin/common_finput.hh, bin/ltlcross.cc, bin/ltldo.cc, bin/ltlfilt.cc, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut10.org, doc/org/tut20.org, python/ajax/spotcgi.in, python/spot/impl.i, spot/parseaut/parseaut.yy, tests/core/checkpsl.cc, tests/core/checkta.cc, tests/core/consterm.cc, tests/core/emptchk.cc, tests/core/equalsf.cc, tests/core/ikwiad.cc, tests/core/kind.cc, tests/core/length.cc, tests/core/ltlprod.cc, tests/core/ltlrel.cc, tests/core/randtgba.cc, tests/core/readltl.cc, tests/core/reduc.cc, tests/core/safra.cc, tests/core/syntimpl.cc, tests/core/tostring.cc, tests/ltsmin/modelcheck.cc, tests/python/alarm.py, tests/python/interdep.py, tests/python/ltl2tgba.py, tests/python/ltlparse.py: Adjust all uses.
75 lines
1.9 KiB
C++
75 lines
1.9 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2008, 2009, 2012, 2015, 2016 Laboratoire de Recherche
|
|
// et Développement de l'Epita (LRDE).
|
|
// 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 3 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#include <iostream>
|
|
#include <cassert>
|
|
#include <cstdlib>
|
|
#include <spot/tl/parse.hh>
|
|
#include <spot/tl/print.hh>
|
|
|
|
static void
|
|
syntax(char *prog)
|
|
{
|
|
std::cerr << prog << " formula1" << std::endl;
|
|
exit(2);
|
|
}
|
|
|
|
int
|
|
main(int argc, char **argv)
|
|
{
|
|
if (argc != 2)
|
|
syntax(argv[0]);
|
|
|
|
{
|
|
auto pf1 = spot::parse_infix_psl(argv[1]);
|
|
if (pf1.format_errors(std::cerr))
|
|
return 2;
|
|
auto f1 = pf1.f;
|
|
|
|
// The string generated from an abstract tree should be parsable
|
|
// again.
|
|
|
|
std::string f1s = spot::str_psl(f1);
|
|
std::cout << f1s << '\n';
|
|
|
|
auto pf2 = spot::parse_infix_psl(f1s);
|
|
if (pf2.format_errors(std::cerr))
|
|
return 2;
|
|
auto f2 = pf2.f;
|
|
|
|
// 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::str_psl(f2);
|
|
std::cout << f2s << '\n';
|
|
|
|
if (f2s != f1s)
|
|
return 1;
|
|
}
|
|
|
|
assert(spot::fnode::instances_check());
|
|
return 0;
|
|
}
|