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
|
/*
* antlr_parser.cpp
*
* Created on: Nov 30, 2009
* Author: dejan
*/
#include <iostream>
#include "antlr_parser.h"
#include "expr/expr_manager.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::parser;
ostream& operator <<(ostream& out, AntlrParser::BenchmarkStatus status) {
switch(status) {
case AntlrParser::SMT_SATISFIABLE:
out << "sat";
break;
case AntlrParser::SMT_UNSATISFIABLE:
out << "unsat";
break;
case AntlrParser::SMT_UNKNOWN:
out << "unknown";
break;
default:
Unhandled("Unhandled ostream case for AntlrParser::BenchmarkStatus");
}
return out;
}
unsigned AntlrParser::getPrecedence(Kind kind) {
switch(kind) {
// Boolean operators
case OR:
return 5;
case AND:
return 4;
case IFF:
return 3;
case IMPLIES:
return 2;
case XOR:
return 1;
default:
Unhandled ("Undefined precedence - necessary for proper parsing of CVC files!");
}
return 0;
}
AntlrParser::AntlrParser(const antlr::ParserSharedInputState& state, int k) :
antlr::LLkParser(state, k) {
}
AntlrParser::AntlrParser(antlr::TokenBuffer& tokenBuf, int k) :
antlr::LLkParser(tokenBuf, k) {
}
AntlrParser::AntlrParser(antlr::TokenStream& lexer, int k) :
antlr::LLkParser(lexer, k) {
}
Expr AntlrParser::getVariable(std::string var_name) {
return d_var_symbol_table.getObject(var_name);
}
Expr AntlrParser::getTrueExpr() const {
return d_expr_manager->mkExpr(TRUE);
}
Expr AntlrParser::getFalseExpr() const {
return d_expr_manager->mkExpr(FALSE);
}
Expr AntlrParser::newExpression(Kind kind, const Expr& child) {
return d_expr_manager->mkExpr(kind, child);
}
Expr AntlrParser::newExpression(Kind kind, const Expr& child_1, const Expr& child_2) {
return d_expr_manager->mkExpr(kind, child_1, child_2);
}
Expr AntlrParser::newExpression(Kind kind, const std::vector<Expr>& children) {
return d_expr_manager->mkExpr(kind, children);
}
void AntlrParser::newPredicate(std::string p_name, const std::vector<
std::string>& p_sorts) {
if(p_sorts.size() == 0)
d_var_symbol_table.bindName(p_name, d_expr_manager->mkExpr(VARIABLE));
else
Unhandled("Non unary predicate not supported yet!");
}
void AntlrParser::newPredicates(const std::vector<std::string>& p_names) {
vector<string> sorts;
for(unsigned i = 0; i < p_names.size(); ++i)
newPredicate(p_names[i], sorts);
}
void AntlrParser::setBenchmarkStatus(BenchmarkStatus status) {
d_benchmark_status = status;
}
void AntlrParser::addExtraSorts(const std::vector<std::string>& extra_sorts) {
}
void AntlrParser::setExpressionManager(ExprManager* em) {
d_expr_manager = em;
}
bool AntlrParser::isDeclared(string name, SymbolType type) {
switch(type) {
case SYM_VARIABLE:
return d_var_symbol_table.isBound(name);
default:
Unhandled("Unhandled symbol type!");
}
}
void AntlrParser::rethrow(antlr::SemanticException& e, string new_message)
throw (antlr::SemanticException) {
throw antlr::SemanticException(new_message, getFilename(),
LT(0).get()->getLine(),
LT(0).get()->getColumn());
}
Expr AntlrParser::createPrecedenceExpr(const vector<Expr>& exprs, const vector<
Kind>& kinds) {
return createPrecedenceExpr(exprs, kinds, 0, exprs.size() - 1);
}
unsigned AntlrParser::findPivot(const std::vector<Kind>& kinds,
unsigned start_index, unsigned end_index) const {
int pivot = start_index;
unsigned pivot_precedence = getPrecedence(kinds[pivot]);
for(unsigned i = start_index + 1; i <= end_index; ++i) {
unsigned current_precedence = getPrecedence(kinds[i]);
if(current_precedence > pivot_precedence) {
pivot = i;
pivot_precedence = current_precedence;
}
}
return pivot;
}
Expr AntlrParser::createPrecedenceExpr(const std::vector<Expr>& exprs,
const std::vector<Kind>& kinds,
unsigned start_index, unsigned end_index) {
if(start_index == end_index)
return exprs[start_index];
unsigned pivot = findPivot(kinds, start_index, end_index - 1);
Expr child_1 = createPrecedenceExpr(exprs, kinds, start_index, pivot);
Expr child_2 = createPrecedenceExpr(exprs, kinds, pivot + 1, end_index);
return d_expr_manager->mkExpr(kinds[pivot], child_1, child_2);
}
|
