visitor.hh 1.75 KB
Newer Older
1
// Copyright (C) 2009, 2010, 2012 Laboratoire de Recherche et Dveloppement
2
// de l'Epita (LRDE).
3
4
5
6
7
8
9
10
// Copyright (C) 2003, 2004, 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
// 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
11
// the Free Software Foundation; either version 3 of the License, or
12
13
14
15
16
17
18
19
// (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
20
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
21
22
23
24
25
26
27
28
29
30
31
32
33

/// \file ltlast/visitor.hh
/// \brief LTL visitor interface
#ifndef SPOT_LTLAST_VISITOR_HH
# define SPOT_LTLAST_VISITOR_HH

#include "predecl.hh"

namespace spot
{
  namespace ltl
  {
    /// \ingroup ltl_essential
34
    /// \brief Formula visitor
35
    ///
36
37
    /// Implementing visitors is the prefered way
    /// to traverse a formula, since it does not
38
39
40
41
42
43
44
45
46
    /// involve any cast.
    struct visitor
    {
      virtual ~visitor() {}
      virtual void visit(const atomic_prop* node) = 0;
      virtual void visit(const constant* node) = 0;
      virtual void visit(const binop* node) = 0;
      virtual void visit(const unop* node) = 0;
      virtual void visit(const multop* node) = 0;
47
      virtual void visit(const automatop* node) = 0;
48
      virtual void visit(const bunop* node) = 0;
49
50
51
52
53
    };
  }
}

#endif // SPOT_LTLAST_VISITOR_HH