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
|
/***
* Bitwuzla: Satisfiability Modulo Theories (SMT) solver.
*
* Copyright (C) 2023 by the authors listed in the AUTHORS file at
* https://github.com/bitwuzla/bitwuzla/blob/main/AUTHORS
*
* This file is part of Bitwuzla under the MIT license. See COPYING for more
* information at https://github.com/bitwuzla/bitwuzla/blob/main/COPYING
*/
#include "parser/smt2/symbol_table.h"
#include "test/unit/test.h"
namespace bzla::test {
using namespace bzla::parser::smt2;
class TestSmt2SymbolTable : public ::testing::Test
{
};
TEST_F(TestSmt2SymbolTable, insert)
{
SymbolTable table;
table.insert(Token::SYMBOL, "x", false, 0);
SymbolTable::Node* x = table.find("x");
table.insert(Token::SYMBOL, "y", false, 0);
SymbolTable::Node* y = table.find("y");
ASSERT_NE(x, y);
ASSERT_EQ(x->d_symbol, "x");
ASSERT_EQ(x->d_assertion_level, 0);
ASSERT_EQ(y->d_symbol, "y");
ASSERT_EQ(y->d_assertion_level, 0);
table.insert(Token::SYMBOL, "x", false, 1);
SymbolTable::Node* x1 = table.find("x");
ASSERT_NE(x, x1);
ASSERT_EQ(x1->d_symbol, "x");
ASSERT_EQ(x1->d_assertion_level, 1);
table.remove(x1);
x1 = table.find("x");
ASSERT_EQ(x, x1);
ASSERT_EQ(x1->d_symbol, "x");
ASSERT_EQ(x1->d_assertion_level, 0);
table.remove(x1);
ASSERT_EQ(table.find("x"), nullptr);
}
TEST_F(TestSmt2SymbolTable, insert_quoted1)
{
SymbolTable table;
table.insert(Token::SYMBOL, "x", false, 0);
SymbolTable::Node* x = table.find("x");
ASSERT_NE(x, nullptr);
table.insert(Token::SYMBOL, "y", false, 0);
SymbolTable::Node* y = table.find("y");
ASSERT_NE(y, nullptr);
ASSERT_NE(x, y);
ASSERT_EQ(x->d_symbol, "x");
ASSERT_EQ(x->d_assertion_level, 0);
ASSERT_EQ(y->d_symbol, "y");
ASSERT_EQ(y->d_assertion_level, 0);
table.insert(Token::SYMBOL, "|x|", false, 1);
table.insert(Token::SYMBOL, "|y|", false, 1);
table.insert(Token::SYMBOL, "| x|", false, 2);
table.insert(Token::SYMBOL, "|y |", false, 2);
SymbolTable::Node* x_quoted = table.find("|x|");
ASSERT_NE(x_quoted, nullptr);
ASSERT_NE(x, x_quoted);
ASSERT_EQ(x_quoted->d_symbol, "|x|");
ASSERT_EQ(x_quoted->d_assertion_level, 1);
SymbolTable::Node* y_quoted = table.find("|y|");
ASSERT_NE(y_quoted, nullptr);
ASSERT_NE(y, y_quoted);
ASSERT_EQ(y_quoted->d_symbol, "|y|");
ASSERT_EQ(y_quoted->d_assertion_level, 1);
SymbolTable::Node* x_new = table.find("| x|");
ASSERT_NE(x_new, nullptr);
ASSERT_EQ(table.find(" x"), x_new);
ASSERT_NE(x, x_new);
ASSERT_NE(x_quoted, x_new);
ASSERT_EQ(x_new->d_symbol, "| x|");
ASSERT_EQ(x_new->d_assertion_level, 2);
SymbolTable::Node* y_new = table.find("|y |");
ASSERT_NE(y_new, nullptr);
ASSERT_EQ(table.find("y "), y_new);
ASSERT_NE(y, y_new);
ASSERT_NE(y_quoted, y_new);
ASSERT_EQ(y_new->d_symbol, "|y |");
ASSERT_EQ(y_new->d_assertion_level, 2);
table.remove(x_quoted);
x_quoted = table.find("|x|");
assert(x_quoted != nullptr);
ASSERT_NE(x_quoted, nullptr);
ASSERT_EQ(x, x_quoted);
ASSERT_EQ(x_quoted->d_symbol, "x");
ASSERT_EQ(x_quoted->d_assertion_level, 0);
y_quoted = table.find("|y|");
ASSERT_NE(y_quoted, nullptr);
ASSERT_NE(y, y_quoted);
ASSERT_EQ(y_quoted->d_symbol, "|y|");
ASSERT_EQ(y_quoted->d_assertion_level, 1);
table.remove(x_new);
ASSERT_EQ(table.find(" x"), nullptr);
}
TEST_F(TestSmt2SymbolTable, insert_quoted2)
{
SymbolTable table;
table.insert(Token::SYMBOL, "|x|", false, 0);
SymbolTable::Node* x = table.find("x");
ASSERT_NE(x, nullptr);
table.insert(Token::SYMBOL, "|y|", false, 0);
SymbolTable::Node* y = table.find("y");
ASSERT_NE(y, nullptr);
ASSERT_NE(x, y);
ASSERT_EQ(x->d_symbol, "|x|");
ASSERT_EQ(x->d_assertion_level, 0);
ASSERT_EQ(y->d_symbol, "|y|");
ASSERT_EQ(y->d_assertion_level, 0);
table.insert(Token::SYMBOL, "x", false, 1);
table.insert(Token::SYMBOL, "|y|", false, 1);
table.insert(Token::SYMBOL, " x", false, 2);
table.insert(Token::SYMBOL, "y ", false, 2);
SymbolTable::Node* x_quoted = table.find("|x|");
ASSERT_NE(x_quoted, nullptr);
ASSERT_NE(x, x_quoted);
ASSERT_EQ(x_quoted->d_symbol, "x");
ASSERT_EQ(x_quoted->d_assertion_level, 1);
SymbolTable::Node* y_quoted = table.find("|y|");
ASSERT_NE(y_quoted, nullptr);
ASSERT_NE(y, y_quoted);
ASSERT_EQ(y_quoted->d_symbol, "|y|");
ASSERT_EQ(y_quoted->d_assertion_level, 1);
SymbolTable::Node* x_new = table.find("| x|");
ASSERT_NE(x_new, nullptr);
ASSERT_EQ(table.find(" x"), x_new);
ASSERT_NE(x, x_new);
ASSERT_NE(x_quoted, x_new);
ASSERT_EQ(x_new->d_symbol, " x");
ASSERT_EQ(x_new->d_assertion_level, 2);
SymbolTable::Node* y_new = table.find("|y |");
ASSERT_NE(y_new, nullptr);
ASSERT_EQ(table.find("y "), y_new);
ASSERT_NE(y, y_new);
ASSERT_NE(y_quoted, y_new);
ASSERT_EQ(y_new->d_symbol, "y ");
ASSERT_EQ(y_new->d_assertion_level, 2);
table.remove(x_quoted);
x_quoted = table.find("|x|");
ASSERT_NE(x_quoted, nullptr);
ASSERT_EQ(x, x_quoted);
ASSERT_EQ(x_quoted->d_symbol, "|x|");
ASSERT_EQ(x_quoted->d_assertion_level, 0);
table.remove(y_quoted);
y_quoted = table.find("|y|");
ASSERT_NE(y_quoted, nullptr);
ASSERT_EQ(y, y_quoted);
ASSERT_EQ(y_quoted->d_symbol, "|y|");
ASSERT_EQ(y_quoted->d_assertion_level, 0);
table.remove(x_new);
ASSERT_EQ(table.find(" x"), nullptr);
}
} // namespace bzla::test
|
