1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
// Author(s): Wieger Wesselink
// Copyright: see the accompanying file COPYING or copy at
// https://svn.win.tue.nl/trac/MCRL2/browser/trunk/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
/// \file normalize_sorts_test.cpp
/// \brief Test for normalizing sorts.
#include <algorithm>
#include <iterator>
#include <set>
#include <vector>
#include <boost/test/minimal.hpp>
#include "mcrl2/data/data_specification.h"
#include "mcrl2/data/parse.h"
#include "mcrl2/data/normalize_sorts.h"
using namespace mcrl2;
using namespace mcrl2::data;
void test_normalize_sorts()
{
std::string DATASPEC =
"sort Bit = struct e0 | e1; \n"
" AbsBit = struct arbitrary; \n"
" \n"
"map inv: Bit -> Bit; \n"
" h: Bit -> AbsBit; \n"
" \n"
"eqn inv(e0) = e1; \n"
" inv(e1) = e0; \n"
;
data_specification dataspec = parse_data_specification(DATASPEC);
data::function_symbol f;
f = parse_function_symbol("abseq : AbsBit # AbsBit -> Set(Bool)", DATASPEC);
dataspec.add_mapping(f);
f = parse_function_symbol("absinv : AbsBit -> Set(AbsBit)", DATASPEC);
dataspec.add_mapping(f);
data_equation_vector equations = dataspec.user_defined_equations();
data::normalize_sorts(equations, dataspec);
}
int test_main(int argc, char* argv[])
{
test_normalize_sorts();
return 0;
}
|
