equals.cc 3.31 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2006  Laboratoire d'Informatique de Paris 6 (LIP6),
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// dpartement Systmes Rpartis Coopratifs (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.

22
#include <iostream>
23
#include <cassert>
24
#include "ltlparse/public.hh"
25
#include "ltlvisit/lunabbrev.hh"
26
#include "ltlvisit/tunabbrev.hh"
27
#include "ltlvisit/dump.hh"
28
#include "ltlvisit/nenoform.hh"
29
#include "ltlvisit/destroy.hh"
30
#include "ltlvisit/contain.hh"
31
#include "ltlast/allnodes.hh"
32
#include "ltlvisit/reduce.hh"
33
#include "ltlvisit/tostring.hh"
34
35

void
36
syntax(char* prog)
37
{
38
  std::cerr << prog << " [-E] formula1 formula2" << std::endl;
39
40
41
42
  exit(2);
}

int
43
main(int argc, char** argv)
44
{
45
46
47
48
49
50
51
52
53
  bool check_first = true;

  if (argc > 1 && !strcmp(argv[1], "-E"))
    {
      check_first = false;
      argv[1] = argv[0];
      ++argv;
      --argc;
    }
54
55
56
57
  if (argc != 3)
    syntax(argv[0]);

  spot::ltl::parse_error_list p1;
58
  spot::ltl::formula* f1 = spot::ltl::parse(argv[1], p1);
59

60
  if (check_first && spot::ltl::format_parse_errors(std::cerr, argv[1], p1))
61
62
63
    return 2;

  spot::ltl::parse_error_list p2;
64
  spot::ltl::formula* f2 = spot::ltl::parse(argv[2], p2);
65

66
  if (spot::ltl::format_parse_errors(std::cerr, argv[2], p2))
67
68
    return 2;

69
70
71
#if (defined LUNABBREV) || (defined TUNABBREV) || (defined NENOFORM)
  spot::ltl::formula* tmp;
#endif
72
#ifdef LUNABBREV
73
  tmp = f1;
74
  f1 = spot::ltl::unabbreviate_logic(f1);
75
  spot::ltl::destroy(tmp);
76
  spot::ltl::dump(std::cout, f1);
77
  std::cout << std::endl;
78
#endif
79
#ifdef TUNABBREV
80
  tmp = f1;
81
  f1 = spot::ltl::unabbreviate_ltl(f1);
82
  spot::ltl::destroy(tmp);
83
  spot::ltl::dump(std::cout, f1);
84
85
86
  std::cout << std::endl;
#endif
#ifdef NENOFORM
87
  tmp = f1;
88
  f1 = spot::ltl::negative_normal_form(f1);
89
  spot::ltl::destroy(tmp);
90
  spot::ltl::dump(std::cout, f1);
91
  std::cout << std::endl;
92
#endif
93
94
95
96
97
98
99
#ifdef REDUC
  spot::ltl::formula* tmp;
  tmp = f1;
  f1 = spot::ltl::reduce(f1);
  spot::ltl::destroy(tmp);
  spot::ltl::dump(std::cout, f1);
#endif
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#ifdef REDUC_TAU
  spot::ltl::formula* tmp;
  tmp = f1;
  f1 = spot::ltl::reduce_tau03(f1, false);
  spot::ltl::destroy(tmp);
  spot::ltl::dump(std::cout, f1);
#endif
#ifdef REDUC_TAUSTR
  spot::ltl::formula* tmp;
  tmp = f1;
  f1 = spot::ltl::reduce_tau03(f1, true);
  spot::ltl::destroy(tmp);
  spot::ltl::dump(std::cout, f1);
#endif
114

115
  int exit_code = f1 != f2;
116
117
118
119
120
121
122

  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);
123

124
  return exit_code;
125
}