blob: 1c779bd79a610b99be51f11db448b8bd8ffb4368 (
plain)
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
|
/********************* */
/*! \file theory_builtin.cpp
** \verbatim
** Original author: mdeters
** Major contributors: none
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Implementation of the builtin theory.
**
** Implementation of the builtin theory.
**/
#include "theory/builtin/theory_builtin.h"
#include "theory/valuation.h"
#include "expr/kind.h"
using namespace std;
namespace CVC4 {
namespace theory {
namespace builtin {
Node TheoryBuiltin::getValue(TNode n) {
switch(n.getKind()) {
case kind::VARIABLE:
// no variables that the builtin theory is responsible for
Unreachable();
case kind::EQUAL: { // 2 args
// has to be an EQUAL over tuples, since all others should be
// handled elsewhere
Assert(n[0].getKind() == kind::TUPLE &&
n[1].getKind() == kind::TUPLE);
return NodeManager::currentNM()->
mkConst( getValue(n[0]) == getValue(n[1]) );
}
case kind::TUPLE: { // 2+ args
NodeBuilder<> nb(kind::TUPLE);
for(TNode::iterator i = n.begin(),
iend = n.end();
i != iend;
++i) {
nb << d_valuation.getValue(*i);
}
return Node(nb);
}
default:
// all other "builtins" should have been rewritten away or handled
// by the valuation, or handled elsewhere.
Unhandled(n.getKind());
}
}
}/* CVC4::theory::builtin namespace */
}/* CVC4::theory */
}/* CVC4 namespace */
|