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
|
/********************* */
/** parser_state.cpp
** Original author: cconway
** Major contributors: dejan, mdeters
** 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.
**
** Parser state implementation.
**/
#include <iostream>
#include <fstream>
#include <stdint.h>
#include "input.h"
#include "expr/command.h"
#include "expr/expr.h"
#include "expr/kind.h"
#include "expr/type.h"
#include "util/output.h"
#include "util/Assert.h"
#include "parser/parser_exception.h"
#include "parser/symbol_table.h"
#include "parser/cvc/cvc_input.h"
#include "parser/smt/smt_input.h"
using namespace std;
using namespace CVC4::kind;
namespace CVC4 {
namespace parser {
ParserState::ParserState(ExprManager* exprManager, const std::string& filename, Input* input) :
d_exprManager(exprManager),
d_input(input),
d_filename(filename),
d_done(false),
d_checksEnabled(true) {
}
Expr ParserState::getSymbol(const std::string& name, SymbolType type) {
Assert( isDeclared(name, type) );
switch( type ) {
case SYM_VARIABLE: // Functions share var namespace
return d_varTable.getObject(name);
default:
Unhandled(type);
}
}
Expr ParserState::getVariable(const std::string& name) {
return getSymbol(name, SYM_VARIABLE);
}
Type*
ParserState::getType(const std::string& var_name,
SymbolType type) {
Assert( isDeclared(var_name, type) );
Type* t = getSymbol(var_name,type).getType();
return t;
}
Type* ParserState::getSort(const std::string& name) {
Assert( isDeclared(name, SYM_SORT) );
Type* t = d_sortTable.getObject(name);
return t;
}
/* Returns true if name is bound to a boolean variable. */
bool ParserState::isBoolean(const std::string& name) {
return isDeclared(name, SYM_VARIABLE) && getType(name)->isBoolean();
}
/* Returns true if name is bound to a function. */
bool ParserState::isFunction(const std::string& name) {
return isDeclared(name, SYM_VARIABLE) && getType(name)->isFunction();
}
/* Returns true if name is bound to a function returning boolean. */
bool ParserState::isPredicate(const std::string& name) {
return isDeclared(name, SYM_VARIABLE) && getType(name)->isPredicate();
}
Expr
ParserState::mkVar(const std::string& name, Type* type) {
Debug("parser") << "mkVar(" << name << "," << *type << ")" << std::endl;
Expr expr = d_exprManager->mkVar(name, type);
defineVar(name,expr);
return expr;
}
const std::vector<Expr>
ParserState::mkVars(const std::vector<std::string> names,
Type* type) {
std::vector<Expr> vars;
for(unsigned i = 0; i < names.size(); ++i) {
vars.push_back(mkVar(names[i],type));
}
return vars;
}
void
ParserState::defineVar(const std::string& name, const Expr& val) {
Assert(!isDeclared(name));
d_varTable.bindName(name,val);
Assert(isDeclared(name));
}
void
ParserState::undefineVar(const std::string& name) {
Assert(isDeclared(name));
d_varTable.unbindName(name);
Assert(!isDeclared(name));
}
void
ParserState::setLogic(const std::string& name) {
if( name == "QF_UF" ) {
mkSort("U");
} else {
Unhandled(name);
}
}
Type*
ParserState::mkSort(const std::string& name) {
Debug("parser") << "newSort(" << name << ")" << std::endl;
Assert( !isDeclared(name, SYM_SORT) ) ;
Type* type = d_exprManager->mkSort(name);
d_sortTable.bindName(name, type);
Assert( isDeclared(name, SYM_SORT) ) ;
return type;
}
const std::vector<Type*>
ParserState::mkSorts(const std::vector<std::string>& names) {
std::vector<Type*> types;
for(unsigned i = 0; i < names.size(); ++i) {
types.push_back(mkSort(names[i]));
}
return types;
}
bool ParserState::isDeclared(const std::string& name, SymbolType type) {
switch(type) {
case SYM_VARIABLE:
return d_varTable.isBound(name);
case SYM_SORT:
return d_sortTable.isBound(name);
default:
Unhandled(type);
}
}
void ParserState::checkDeclaration(const std::string& varName,
DeclarationCheck check,
SymbolType type)
throw (ParserException) {
if(!d_checksEnabled) {
return;
}
switch(check) {
case CHECK_DECLARED:
if( !isDeclared(varName, type) ) {
parseError("Symbol " + varName + " not declared");
}
break;
case CHECK_UNDECLARED:
if( isDeclared(varName, type) ) {
parseError("Symbol " + varName + " previously declared");
}
break;
case CHECK_NONE:
break;
default:
Unhandled(check);
}
}
void ParserState::checkFunction(const std::string& name)
throw (ParserException) {
if( d_checksEnabled && !isFunction(name) ) {
parseError("Expecting function symbol, found '" + name + "'");
}
}
void ParserState::checkArity(Kind kind, unsigned int numArgs)
throw (ParserException) {
if(!d_checksEnabled) {
return;
}
unsigned int min = d_exprManager->minArity(kind);
unsigned int max = d_exprManager->maxArity(kind);
if( numArgs < min || numArgs > max ) {
stringstream ss;
ss << "Expecting ";
if( numArgs < min ) {
ss << "at least " << min << " ";
} else {
ss << "at most " << max << " ";
}
ss << "arguments for operator '" << kind << "', ";
ss << "found " << numArgs;
parseError(ss.str());
}
}
void ParserState::enableChecks() {
d_checksEnabled = true;
}
void ParserState::disableChecks() {
d_checksEnabled = false;
}
}/* CVC4::parser namespace */
}/* CVC4 namespace */
|
