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
|
/********************* */
/*! \file symbol_table.cpp
** \verbatim
** Original author: Morgan Deters
** Major contributors: Christopher L. Conway
** Minor contributors (to current version): Andrew Reynolds, Dejan Jovanovic, Francois Bobot
** This file is part of the CVC4 project.
** Copyright (c) 2009-2014 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Convenience class for scoping variable and type
** declarations (implementation)
**
** Convenience class for scoping variable and type declarations
** (implementation).
**/
#include "expr/symbol_table.h"
#include <string>
#include <utility>
#include "context/cdhashmap.h"
#include "context/cdhashset.h"
#include "context/context.h"
#include "expr/expr.h"
#include "expr/expr_manager_scope.h"
#include "expr/type.h"
using namespace CVC4::context;
using namespace std;
namespace CVC4 {
SymbolTable::SymbolTable() :
d_context(new Context()),
d_exprMap(new(true) CDHashMap<std::string, Expr, StringHashFunction>(d_context)),
d_typeMap(new(true) CDHashMap<std::string, pair<vector<Type>, Type>, StringHashFunction>(d_context)),
d_functions(new(true) CDHashSet<Expr, ExprHashFunction>(d_context)) {
}
SymbolTable::~SymbolTable() {
d_exprMap->deleteSelf();
d_typeMap->deleteSelf();
d_functions->deleteSelf();
delete d_context;
}
void SymbolTable::bind(const std::string& name, Expr obj,
bool levelZero) throw() {
PrettyCheckArgument(!obj.isNull(), obj, "cannot bind to a null Expr");
ExprManagerScope ems(obj);
if(levelZero) d_exprMap->insertAtContextLevelZero(name, obj);
else d_exprMap->insert(name, obj);
}
void SymbolTable::bindDefinedFunction(const std::string& name, Expr obj,
bool levelZero) throw() {
PrettyCheckArgument(!obj.isNull(), obj, "cannot bind to a null Expr");
ExprManagerScope ems(obj);
if(levelZero){
d_exprMap->insertAtContextLevelZero(name, obj);
d_functions->insertAtContextLevelZero(obj);
} else {
d_exprMap->insert(name, obj);
d_functions->insert(obj);
}
}
bool SymbolTable::isBound(const std::string& name) const throw() {
return d_exprMap->find(name) != d_exprMap->end();
}
bool SymbolTable::isBoundDefinedFunction(const std::string& name) const throw() {
CDHashMap<std::string, Expr, StringHashFunction>::iterator found =
d_exprMap->find(name);
return found != d_exprMap->end() && d_functions->contains((*found).second);
}
bool SymbolTable::isBoundDefinedFunction(Expr func) const throw() {
return d_functions->contains(func);
}
Expr SymbolTable::lookup(const std::string& name) const throw() {
return (*d_exprMap->find(name)).second;
}
void SymbolTable::bindType(const std::string& name, Type t,
bool levelZero) throw() {
if(levelZero) {
d_typeMap->insertAtContextLevelZero(name, make_pair(vector<Type>(), t));
} else {
d_typeMap->insert(name, make_pair(vector<Type>(), t));
}
}
void SymbolTable::bindType(const std::string& name,
const std::vector<Type>& params,
Type t,
bool levelZero) throw() {
if(Debug.isOn("sort")) {
Debug("sort") << "bindType(" << name << ", [";
if(params.size() > 0) {
copy( params.begin(), params.end() - 1,
ostream_iterator<Type>(Debug("sort"), ", ") );
Debug("sort") << params.back();
}
Debug("sort") << "], " << t << ")" << endl;
}
if(levelZero) {
d_typeMap->insertAtContextLevelZero(name, make_pair(params, t));
} else {
d_typeMap->insert(name, make_pair(params, t));
}
}
bool SymbolTable::isBoundType(const std::string& name) const throw() {
return d_typeMap->find(name) != d_typeMap->end();
}
Type SymbolTable::lookupType(const std::string& name) const throw() {
pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
PrettyCheckArgument(p.first.size() == 0, name,
"type constructor arity is wrong: "
"`%s' requires %u parameters but was provided 0",
name.c_str(), p.first.size());
return p.second;
}
Type SymbolTable::lookupType(const std::string& name,
const std::vector<Type>& params) const throw() {
pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
PrettyCheckArgument(p.first.size() == params.size(), params,
"type constructor arity is wrong: "
"`%s' requires %u parameters but was provided %u",
name.c_str(), p.first.size(), params.size());
if(p.first.size() == 0) {
PrettyCheckArgument(p.second.isSort(), name.c_str());
return p.second;
}
if(p.second.isSortConstructor()) {
if(Debug.isOn("sort")) {
Debug("sort") << "instantiating using a sort constructor" << endl;
Debug("sort") << "have formals [";
copy( p.first.begin(), p.first.end() - 1,
ostream_iterator<Type>(Debug("sort"), ", ") );
Debug("sort") << p.first.back() << "]" << endl
<< "parameters [";
copy( params.begin(), params.end() - 1,
ostream_iterator<Type>(Debug("sort"), ", ") );
Debug("sort") << params.back() << "]" << endl
<< "type ctor " << name << endl
<< "type is " << p.second << endl;
}
Type instantiation =
SortConstructorType(p.second).instantiate(params);
Debug("sort") << "instance is " << instantiation << endl;
return instantiation;
} else if(p.second.isDatatype()) {
PrettyCheckArgument(DatatypeType(p.second).isParametric(), name, "expected parametric datatype");
return DatatypeType(p.second).instantiate(params);
} else {
if(Debug.isOn("sort")) {
Debug("sort") << "instantiating using a sort substitution" << endl;
Debug("sort") << "have formals [";
copy( p.first.begin(), p.first.end() - 1,
ostream_iterator<Type>(Debug("sort"), ", ") );
Debug("sort") << p.first.back() << "]" << endl
<< "parameters [";
copy( params.begin(), params.end() - 1,
ostream_iterator<Type>(Debug("sort"), ", ") );
Debug("sort") << params.back() << "]" << endl
<< "type ctor " << name << endl
<< "type is " << p.second << endl;
}
Type instantiation = p.second.substitute(p.first, params);
Debug("sort") << "instance is " << instantiation << endl;
return instantiation;
}
}
size_t SymbolTable::lookupArity(const std::string& name) {
pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
return p.first.size();
}
void SymbolTable::popScope() throw(ScopeException) {
if( d_context->getLevel() == 0 ) {
throw ScopeException();
}
d_context->pop();
}
void SymbolTable::pushScope() throw() {
d_context->push();
}
size_t SymbolTable::getLevel() const throw() {
return d_context->getLevel();
}
void SymbolTable::reset() {
this->SymbolTable::~SymbolTable();
new(this) SymbolTable();
}
}/* CVC4 namespace */
|
