equals.cc 3.35 KB
Newer Older
1
2
3
// Copyright (C) 2003, 2004, 2006, 2008 Laboratoire d'Informatique de
// Paris 6 (LIP6), dpartement Systmes Rpartis Coopratifs (SRC),
// Universit Pierre et Marie Curie.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
//
// 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
25
#include <cstdlib>
#include <cstring>
26
#include "ltlparse/public.hh"
27
#include "ltlvisit/lunabbrev.hh"
28
#include "ltlvisit/tunabbrev.hh"
29
#include "ltlvisit/dump.hh"
30
#include "ltlvisit/nenoform.hh"
31
#include "ltlvisit/destroy.hh"
32
#include "ltlvisit/contain.hh"
33
#include "ltlast/allnodes.hh"
34
#include "ltlvisit/reduce.hh"
35
#include "ltlvisit/tostring.hh"
36
37

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

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

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

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

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

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

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

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

117
  int exit_code = f1 != f2;
118
119
120
121
122
123
124

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

126
  return exit_code;
127
}