This of course concerns push_back and push_front as well. * src/bin/common_finput.cc, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltlfilt.cc, src/dstarparse/dstarparse.yy, src/kripkeparse/kripkeparse.yy, src/ltlast/formula.cc, src/ltlparse/ltlparse.yy, src/misc/minato.cc, src/neverparse/neverclaimparse.yy, src/priv/bddalloc.cc, src/ta/ta.cc, src/taalgos/emptinessta.cc, src/tgba/taatgba.cc, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gtec/sccstack.cc, src/tgbaalgos/magic.cc, src/tgbaalgos/ndfs_result.hxx, src/tgbaalgos/rundotdec.cc, src/tgbaalgos/scc.cc, src/tgbaalgos/se05.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03opt.cc, src/tgbaparse/tgbaparse.yy: Use emplace to make the code less verbose and avoid creating temporaries.
303 lines
6.7 KiB
Text
303 lines
6.7 KiB
Text
/* -*- coding: utf-8 -*-
|
|
** Copyright (C) 2010, 2011, 2012, 2013, 2014 Laboratoire de Recherche
|
|
** et Développement de l'Epita (LRDE).
|
|
**
|
|
** 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/>.
|
|
*/
|
|
%language "C++"
|
|
%locations
|
|
%defines
|
|
%expect 0 // No shift/reduce
|
|
%name-prefix "neverclaimyy"
|
|
%debug
|
|
%error-verbose
|
|
%lex-param { spot::neverclaim_parse_error_list& error_list }
|
|
%define api.location.type "spot::location"
|
|
|
|
%code requires
|
|
{
|
|
#include <string>
|
|
#include <cstring>
|
|
#include "ltlast/constant.hh"
|
|
#include "public.hh"
|
|
|
|
typedef std::pair<const spot::ltl::formula*, std::string*> pair;
|
|
}
|
|
|
|
%parse-param {spot::neverclaim_parse_error_list& error_list}
|
|
%parse-param {spot::ltl::environment& parse_environment}
|
|
%parse-param {spot::tgba_explicit_string*& result}
|
|
%union
|
|
{
|
|
std::string* str;
|
|
pair* p;
|
|
std::list<pair>* list;
|
|
}
|
|
|
|
%code
|
|
{
|
|
#include "ltlast/constant.hh"
|
|
#include "ltlparse/public.hh"
|
|
|
|
/* neverclaimparse.hh and parsedecl.hh include each other recursively.
|
|
We must ensure that YYSTYPE is declared (by the above %union)
|
|
before parsedecl.hh uses it. */
|
|
#include "parsedecl.hh"
|
|
using namespace spot::ltl;
|
|
static bool accept_all_needed = false;
|
|
static bool accept_all_seen = false;
|
|
}
|
|
|
|
%token NEVER "never"
|
|
%token SKIP "skip"
|
|
%token IF "if"
|
|
%token FI "fi"
|
|
%token DO "do"
|
|
%token OD "od"
|
|
%token ARROW "->"
|
|
%token GOTO "goto"
|
|
%token FALSE "false"
|
|
%token ATOMIC "atomic"
|
|
%token ASSERT "assert"
|
|
%token <str> FORMULA "boolean formula"
|
|
%token <str> IDENT "identifier"
|
|
%type <str> formula opt_dest
|
|
%type <p> transition src_dest
|
|
%type <list> transitions transition_block
|
|
%type <str> ident_list
|
|
|
|
|
|
%destructor { delete $$; } <str>
|
|
%destructor { $$->first->destroy(); delete $$->second; delete $$; } <p>
|
|
%destructor {
|
|
for (std::list<pair>::iterator i = $$->begin();
|
|
i != $$->end(); ++i)
|
|
{
|
|
i->first->destroy();
|
|
delete i->second;
|
|
}
|
|
delete $$;
|
|
} <list>
|
|
%printer {
|
|
if ($$)
|
|
debug_stream() << *$$;
|
|
else
|
|
debug_stream() << "\"\""; } <str>
|
|
|
|
%%
|
|
neverclaim:
|
|
"never" '{' states '}'
|
|
|
|
|
|
states:
|
|
/* empty */
|
|
| state
|
|
| states ';' state
|
|
| states ';'
|
|
|
|
ident_list:
|
|
IDENT ':'
|
|
{
|
|
$$ = $1;
|
|
}
|
|
| ident_list IDENT ':'
|
|
{
|
|
result->add_state_alias(*$2, *$1);
|
|
// Keep any identifier that starts with accept.
|
|
if (strncmp("accept", $1->c_str(), 6))
|
|
{
|
|
delete $1;
|
|
$$ = $2;
|
|
}
|
|
else
|
|
{
|
|
delete $2;
|
|
$$ = $1;
|
|
}
|
|
}
|
|
|
|
|
|
transition_block:
|
|
"if" transitions "fi"
|
|
{
|
|
$$ = $2;
|
|
}
|
|
| "do" transitions "od"
|
|
{
|
|
$$ = $2;
|
|
}
|
|
|
|
state:
|
|
ident_list "skip"
|
|
{
|
|
if (*$1 == "accept_all")
|
|
accept_all_seen = true;
|
|
|
|
spot::state_explicit_string::transition* t = result->create_transition(*$1, *$1);
|
|
bool acc = !strncmp("accept", $1->c_str(), 6);
|
|
if (acc)
|
|
result->add_acceptance_condition(t,
|
|
spot::ltl::constant::true_instance());
|
|
delete $1;
|
|
}
|
|
| ident_list { delete $1; }
|
|
| ident_list "false" { delete $1; }
|
|
| ident_list transition_block
|
|
{
|
|
std::list<pair>::iterator it;
|
|
bool acc = !strncmp("accept", $1->c_str(), 6);
|
|
for (it = $2->begin(); it != $2->end(); ++it)
|
|
{
|
|
spot::state_explicit_string::transition* t =
|
|
result->create_transition(*$1, *it->second);
|
|
|
|
result->add_condition(t, it->first);
|
|
if (acc)
|
|
result
|
|
->add_acceptance_condition(t, spot::ltl::constant::true_instance());
|
|
}
|
|
// Free the list
|
|
delete $1;
|
|
for (std::list<pair>::iterator it = $2->begin();
|
|
it != $2->end(); ++it)
|
|
delete it->second;
|
|
delete $2;
|
|
}
|
|
|
|
|
|
transitions:
|
|
/* empty */ { $$ = new std::list<pair>; }
|
|
| transitions transition
|
|
{
|
|
if ($2)
|
|
{
|
|
$1->push_back(*$2);
|
|
delete $2;
|
|
}
|
|
$$ = $1;
|
|
}
|
|
|
|
|
|
formula: FORMULA | "false" { $$ = new std::string("0"); }
|
|
|
|
opt_dest:
|
|
/* empty */
|
|
{
|
|
$$ = 0;
|
|
}
|
|
| "->" "goto" IDENT
|
|
{
|
|
$$ = $3;
|
|
}
|
|
| "->" "assert" FORMULA
|
|
{
|
|
delete $3;
|
|
$$ = new std::string("accept_all");
|
|
accept_all_needed = true;
|
|
}
|
|
|
|
src_dest: formula opt_dest
|
|
{
|
|
// If there is no destination, do ignore the transition.
|
|
// This happens for instance with
|
|
// if
|
|
// :: false
|
|
// fi
|
|
if (!$2)
|
|
{
|
|
delete $1;
|
|
$$ = 0;
|
|
}
|
|
else
|
|
{
|
|
spot::ltl::parse_error_list pel;
|
|
const spot::ltl::formula* f =
|
|
spot::ltl::parse_boolean(*$1, pel, parse_environment,
|
|
debug_level(), true);
|
|
delete $1;
|
|
for(spot::ltl::parse_error_list::const_iterator i = pel.begin();
|
|
i != pel.end(); ++i)
|
|
{
|
|
// Adjust the diagnostic to the current position.
|
|
spot::location here = @1;
|
|
here.end.line = here.begin.line + i->first.end.line - 1;
|
|
here.end.column = here.begin.column + i->first.end.column -1;
|
|
here.begin.line += i->first.begin.line - 1;
|
|
here.begin.column += i->first.begin.column - 1;
|
|
error(here, i->second);
|
|
}
|
|
$$ = new pair(f, $2);
|
|
}
|
|
}
|
|
|
|
|
|
transition:
|
|
':' ':' "atomic" '{' src_dest '}'
|
|
{
|
|
$$ = $5;
|
|
}
|
|
| ':' ':' src_dest
|
|
{
|
|
$$ = $3;
|
|
}
|
|
%%
|
|
|
|
void
|
|
neverclaimyy::parser::error(const location_type& location,
|
|
const std::string& message)
|
|
{
|
|
error_list.emplace_back(location, message);
|
|
}
|
|
|
|
namespace spot
|
|
{
|
|
tgba_explicit_string*
|
|
neverclaim_parse(const std::string& name,
|
|
neverclaim_parse_error_list& error_list,
|
|
bdd_dict* dict,
|
|
environment& env,
|
|
bool debug)
|
|
{
|
|
if (neverclaimyyopen(name))
|
|
{
|
|
error_list.emplace_back(spot::location(),
|
|
std::string("Cannot open file ") + name);
|
|
return 0;
|
|
}
|
|
tgba_explicit_string* result = new tgba_explicit_string(dict);
|
|
result->declare_acceptance_condition(spot::ltl::constant::true_instance());
|
|
neverclaimyy::parser parser(error_list, env, result);
|
|
parser.set_debug_level(debug);
|
|
parser.parse();
|
|
neverclaimyyclose();
|
|
|
|
if (accept_all_needed && !accept_all_seen)
|
|
{
|
|
spot::state_explicit_string::transition* t =
|
|
result->create_transition("accept_all", "accept_all");
|
|
result->add_acceptance_condition
|
|
(t, spot::ltl::constant::true_instance());
|
|
}
|
|
accept_all_needed = false;
|
|
accept_all_seen = false;
|
|
|
|
return result;
|
|
}
|
|
}
|
|
|
|
// Local Variables:
|
|
// mode: c++
|
|
// End:
|