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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
// relation operator class -*- c++ -*-
#ifndef RELOPEXPRESSION_H_
# define RELOPEXPRESSION_H_
# ifdef __GNUC__
# pragma interface
# endif // __GNUC__
# include "Expression.h"
/** @file RelopExpression.h
* Comparison operations
*/
/* Copyright 1998-2001 Marko Mkel (msmakela@tcs.hut.fi).
This file is part of MARIA, a reachability analyzer and model checker
for high-level Petri nets.
MARIA 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, or (at your option)
any later version.
MARIA 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.
The GNU General Public License is often shipped with GNU software, and
is generally kept in a file called COPYING or LICENSE. If you do not
have a copy of the license, write to the Free Software Foundation,
59 Temple Place, Suite 330, Boston, MA 02111 USA. */
/** Comparison operator */
class RelopExpression : public Expression
{
protected:
/** Constructor
* @param equal Flag: equality comparison instead of less-than
* @param left Left-hand expression of the operator
* @param right Right-hand expression of the operator
*/
RelopExpression (bool equal,
class Expression& left,
class Expression& right);
private:
/** Copy constructor */
RelopExpression (const class RelopExpression& old);
/** Assignment operator */
class RelopExpression& operator= (const class RelopExpression& old);
protected:
/** Destructor */
~RelopExpression ();
public:
/** Determine the type of the expression */
enum Expression::Kind getKind () const { return eRelop; }
/** Determine whether this is a basic expression */
bool isBasic () const { return true; }
/** Determine whether this is a temporal logic expression */
bool isTemporal () const { return false; }
/** Construct a RelopExpression, optimizing if possible
* @param equal Flag: equality comparison instead of less-than
* @param left Left-hand expression of the operator
* @param right Right-hand expression of the operator
* @return a corresponding expression
*/
static class Expression* construct (bool equal,
class Expression& left,
class Expression& right);
/** Equality comparison operator */
bool operator== (const class RelopExpression& other) const {
return myEqual == other.myEqual &&
*myLeft == *other.myLeft &&
*myRight == *other.myRight;
}
/** Ordering comparison operator */
bool operator< (const class RelopExpression& other) const {
if (myEqual < other.myEqual) return true;
if (other.myEqual < myEqual) return false;
if (*myLeft < *other.myLeft) return true;
if (*other.myLeft < *myLeft) return false;
return *myRight < *other.myRight;
}
/** Evaluate the expression
* @param valuation Variable substitutions
* @return Value of the expression, or NULL in case of error
*/
class Value* do_eval (const class Valuation& valuation) const;
/** Partially evaluate the expression using a valuation
* @param valuation Variable substitutions
* @param transition Transition for registering quantified variables
* @param declare flag: declare new variables if required
* @return grounded expression, or NULL in case of error
*/
class Expression* ground (const class Valuation& valuation,
class Transition* transition,
bool declare);
/** Substitute some variables in the expression with expressions
* @param substitution Variable substitutions
* @return substituted expression
*/
class Expression* substitute (class Substitution& substitution);
/** Determine whether the expression depends on a set of variables
* @param vars the set of variables
* @param complement flag: treat the set as its complement
*/
bool depends (const class VariableSet& vars,
bool complement) const;
/** Perform an operation on all subexpressions of the expression
* @param operation operation to be performed (return false on failure)
* @param data parameters to be passed to the operation
* @return true if all operations succeeded
*/
bool forExpressions (bool (*operation)
(const class Expression&,void*),
void* data) const;
/** Remove transition qualifiers from the expression
* @param transition the transition for which the expression is qualified
* @return the expession without qualifiers, or NULL
*/
class Expression* disqualify (const class Transition& transition);
# ifdef EXPR_COMPILE
/** Generate C code for evaluating the expression
* @param cexpr the compilation
* @param indent indentation level
* @param lvalue C expression referring to the lvalue
* @param vars the variables that have been assigned a value
*/
void compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const;
# endif // EXPR_COMPILE
/** Display the expression
* @param printer the printer object
*/
void display (const class Printer& printer) const;
private:
/** Flag: equality comparison instead of less-than */
bool myEqual;
/** Left-hand expression */
class Expression* myLeft;
/** Right-hand expression */
class Expression* myRight;
};
#endif // RELOPEXPRESSION_H_
|
