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 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
|
// Maria expression class -*- c++ -*-
#ifndef EXPRESSION_H_
# define EXPRESSION_H_
# ifdef __GNUC__
# pragma interface
# endif // __GNUC__
# include "Type.h"
# include "Constraint.h"
# include "Value.h"
# include "Valuation.h"
/** @file Expression.h
* Abstract base class for expressions
*/
/* Copyright 1998-2003 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. */
/** Abstract base class for expressions */
class Expression
{
public:
/** Expression kinds (@see getKind) */
enum Kind {
eVariable, eConstant, eUndefined,
eStruct, eStructComponent, eStructAssign,
eUnion, eUnionComponent, eUnionType,
eVector, eVectorIndex, eVectorAssign, eVectorShift,
eUnop, eBinop, eBooleanBinop, eNot, eRelop,
eBuffer, eBufferUnop, eBufferRemove, eBufferWrite, eBufferIndex,
eSet, eIfThenElse, eTemporalBinop, eTemporalUnop,
eTypecast, eCardinality, eMarking, eTransitionQualifier,
ePlaceContents, eSubmarking, eMapping, eEmptySet
};
/** Constructor */
Expression ();
private:
/** Copy constructor */
Expression (const class Expression& old);
/** Assignment operator */
class Expression& operator= (const class Expression& old);
protected:
/** Destructor */
virtual ~Expression ();
public:
/** Common subexpression elimination
* @return pointer to this, or to a similar object
*/
class Expression* cse ();
/** Get a shared copy of the expression */
class Expression* copy () { myReferences++; return this; }
/** Destructs Expression, provided that there aren't any references to it */
void destroy () { if (this && !--myReferences) delete this; }
/** Determine whether this is the last copy of an expression */
bool isLastCopy () const { return myReferences == 1; }
/** Determine the type of the expression */
virtual enum Expression::Kind getKind () const = 0;
/** Set the atomicity flag
* @param atomic specifies whether this should be treated
* as an atomic (non-temporal) expression
*/
void setAtomic (bool atomic) { myIsAtomic = atomic; }
/** Read the atomicity flag */
bool isAtomic () const { return myIsAtomic; }
/** Set the type of the expression
* @param type Type of the expression
*/
virtual void setType (const class Type& type);
/** Get the type associated with the expression */
const class Type* getType () const { return myType; }
/**
* Determine whether this is a basic expression containing
* no temporal logic or set operations
* @return true if this is a basic expression
*/
virtual bool isBasic () const = 0;
/**
* Determine whether this is a temporal logic expression
* @return true if this is a temporal logic expression
*/
virtual bool isTemporal () const = 0;
/**
* Determine whether this is a multiset-valued expression
* @return true if this is a multiset-valued expression
*/
virtual bool isSet () const { return false; }
/** Equality comparison operator */
bool operator== (const class Expression& other) const;
/** Ordering comparison operator */
bool operator< (const class Expression& other) const;
/** Evaluate the expression
* @param valuation Variable substitutions
* @return Value of the expression, or NULL in case of error
*/
class Value* eval (const class Valuation& valuation) const {
return do_eval (valuation);
}
/** Evaluate the multiset expression
* @param valuation variable substitutions and the global marking
* @return a marking
*/
virtual class PlaceMarking* meval (const class Valuation& valuation) const;
private:
/** Evaluate the expression
* @param valuation Variable substitutions
* @return Value of the expression, or NULL in case of error
*/
virtual class Value* do_eval (const class Valuation& valuation) const;
protected:
/** Check the constraints of a value
* @param valuation Variable substitutions (for error reporting)
* @param value the value to be checked
* @return value, or NULL in case of error
*/
class Value* constrain (const class Valuation& valuation,
class Value* value) const {
assert (!!value);
if (const class Constraint* const constraint = myType->getConstraint ()) {
if (!constraint->isConstrained (*value)) {
valuation.flag (errConst, *this);
delete value;
return NULL;
}
}
return value;
}
public:
/** Try to evaluate the expression using a valuation
* @param valuation Variable substitutions
* @return new pointer to this
*/
class Expression* ground (const class Valuation& valuation);
/** 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
*/
virtual class Expression* ground (const class Valuation& valuation,
class Transition* transition,
bool declare) = 0;
/** Substitute some variables in the expression with expressions
* @param substitution Variable substitutions
* @return substituted expression
*/
virtual class Expression* substitute (class Substitution& substitution) = 0;
/** 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
*/
virtual bool depends (const class VariableSet& vars,
bool complement) const = 0;
/** 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
*/
virtual bool forExpressions (bool (*operation)
(const class Expression&,void*),
void* data) const = 0;
/** Remove transition qualifiers from the expression
* @param transition the transition for which the expression is qualified
* @return the expession without qualifiers, or NULL
*/
virtual class Expression* disqualify (const class Transition& transition);
/** Determine whether the expression is assignable to the given data type
* (perform static analysis)
* @param type Data type to be checked
* @return true if the expression is assignable to the type
*/
bool isAssignable (const class Type& type) const {
return myType->isAssignable (type);
}
/** Determine whether the expression is type compatible with the specified
* value (whether it ever could evaluate to the value)
*/
bool isTypeCompatible (const class Value& value) const;
/** Determine whether the expression is compatible with the specified value,
* neglecting subexpressions that cannot be evaluated
* @param value value the expression will be compared to
* @param valuation variable substitutions
* @return true if the expression is compatible with the value
*/
virtual bool isCompatible (const class Value& value,
const class Valuation& valuation) const;
/** Unify variables from this expression
* @param value the value the expression should evaluate to
* @param valuation variable substitutions
* @param vars the variables to unify
*/
virtual void getLvalues (const class Value& value,
class Valuation& valuation,
const class VariableSet& vars) const;
/** Determine which variables could be unified from this expression
* @param rvalues variables unified so far
* @param lvalues (output) variables that could be unified
*/
virtual void getLvalues (const class VariableSet& rvalues,
class VariableSet*& lvalues) const;
/** Translate the expression to a list of temporal logic connectives
* and Boolean propositions
* @param property the property automaton
* @return the translated object
*/
virtual class Ltl* toFormula (class Property& property);
# ifdef EXPR_COMPILE
/** Generate lvalue gathering code
* @param cexpr the compilation
* @param indent level of indentation
* @param vars the variables
* @param lvalue C expression referring to the value
*/
virtual void compileLvalue (class CExpression& cexpr,
unsigned indent,
const class VariableSet& vars,
const char* lvalue) const;
/** Generate compatibility check code
* @param cexpr the compilation
* @param indent level of indentation
* @param vars the variables that have been assigned a value
* @param value C expression referring to the desired value
*/
virtual void compileCompatible (class CExpression& cexpr,
unsigned indent,
const class VariableSet& vars,
const char* value) const;
/** 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
*/
virtual void compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const = 0;
/** Generate C code for evaluating a multi-set expression as a scalar
* @param cexpr the compilation
* @param indent indentation level
* @param result scalar to assign the multi-set to (must be singleton)
* @param vars the variables that have been assigned a value
* @param check flag: check for result overflow
*/
virtual void compileScalarMset (class CExpression& cexpr,
unsigned indent,
const char* result,
const class VariableSet* vars,
bool check) const;
/** Generate C code for evaluating the multi-set expression
* @param cexpr the compilation
* @param indent indentation level
* @param resulttype type of result (optional typecast qualifier)
* @param result multi-set to add items to
* @param vars the variables that have been assigned a value
*/
virtual void compileMset (class CExpression& cexpr,
unsigned indent,
const char* resulttype,
const char* result,
const class VariableSet* vars) const;
/** Generate C code for checking the constraint of this expression
* @param cexpr the compilation
* @param indent indentation level
* @param value C expression referring to the value
*/
void compileConstraint (class CExpression& cexpr,
unsigned indent,
const char* value) const {
if (const class Constraint* c = myType->getConstraint ())
c->compileCheck (cexpr, indent, value);
}
# endif // EXPR_COMPILE
/** Display the expression
* @param printer the printer object
*/
virtual void display (const class Printer& printer) const = 0;
private:
/** Number of references to the expression */
unsigned myReferences;
/** Type of the expression */
const class Type* myType;
/** Flag: is this an atomic expression */
bool myIsAtomic;
};
#endif // EXPRESSION_H_
|