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
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
|
//===-- Lexer.cpp ---------------------------------------------------------===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "klee/Expr/Parser/Lexer.h"
#include "llvm/Support/MemoryBuffer.h"
#include "llvm/Support/raw_ostream.h"
#include <iomanip>
#include <string.h>
using namespace llvm;
using namespace klee;
using namespace klee::expr;
///
const char *Token::getKindName() const {
switch (kind) {
default:
case Unknown: return "Unknown";
case Arrow: return "Arrow";
case At: return "At";
case Colon: return "Colon";
case Comma: return "Comma";
case Comment: return "Comment";
case EndOfFile: return "EndOfFile";
case Equals: return "Equals";
case Identifier: return "Identifier";
case KWArray: return "KWArray";
case KWFalse: return "KWFalse";
case KWQuery: return "KWQuery";
case KWReserved: return "KWReserved";
case KWSymbolic: return "KWSymbolic";
case KWTrue: return "KWTrue";
case KWWidth: return "KWWidth";
case LBrace: return "LBrace";
case LParen: return "LParen";
case LSquare: return "LSquare";
case Number: return "Number";
case RBrace: return "RBrace";
case RParen: return "RParen";
case RSquare: return "RSquare";
case Semicolon: return "Semicolon";
}
}
void Token::dump() {
llvm::errs() << "(Token \"" << getKindName() << "\" "
<< (const void*) start << " " << length << " "
<< line << " " << column << ")";
}
///
static inline bool isInternalIdentifierChar(int Char) {
return isalnum(Char) || Char == '_' || Char == '.' || Char == '-';
}
Lexer::Lexer(const llvm::MemoryBuffer *MB)
: BufferPos(MB->getBufferStart()), BufferEnd(MB->getBufferEnd()),
LineNumber(1), ColumnNumber(0) {
}
Lexer::~Lexer() {
}
int Lexer::PeekNextChar() {
if (BufferPos == BufferEnd)
return -1;
return *BufferPos;
}
int Lexer::GetNextChar() {
if (BufferPos == BufferEnd)
return -1;
// Handle DOS/Mac newlines here, by stripping duplicates and by
// returning '\n' for both.
char Result = *BufferPos++;
if (Result == '\n' || Result == '\r') {
if (BufferPos != BufferEnd && *BufferPos == ('\n' + '\r' - Result))
++BufferPos;
Result = '\n';
}
if (Result == '\n') {
++LineNumber;
ColumnNumber = 0;
} else {
++ColumnNumber;
}
return Result;
}
Token &Lexer::SetTokenKind(Token &Result, Token::Kind k) {
Result.kind = k;
Result.length = BufferPos - Result.start;
return Result;
}
static bool isReservedKW(const char *Str, unsigned N) {
unsigned i;
// Check for i[0-9]+
if (N>1 && Str[0] == 'i') {
for (i=1; i<N; ++i)
if (!isdigit(Str[i]))
break;
if (i==N)
return true;
}
// Check for fp[0-9]+([.].*)?$
if (N>3 && Str[0]=='f' && Str[1]=='p' && isdigit(Str[2])) {
for (i=3; i<N; ++i)
if (!isdigit(Str[i]))
break;
if (i==N || Str[i]=='.')
return true;
}
return false;
}
static bool isWidthKW(const char *Str, unsigned N) {
if (N<2 || Str[0] != 'w')
return false;
for (unsigned i=1; i<N; ++i)
if (!isdigit(Str[i]))
return false;
return true;
}
Token &Lexer::SetIdentifierTokenKind(Token &Result) {
unsigned Length = BufferPos - Result.start;
switch (Length) {
case 3:
if (memcmp("def", Result.start, 3) == 0)
return SetTokenKind(Result, Token::KWReserved);
if (memcmp("var", Result.start, 3) == 0)
return SetTokenKind(Result, Token::KWReserved);
break;
case 4:
if (memcmp("true", Result.start, 4) == 0)
return SetTokenKind(Result, Token::KWTrue);
break;
case 5:
if (memcmp("array", Result.start, 5) == 0)
return SetTokenKind(Result, Token::KWArray);
if (memcmp("false", Result.start, 5) == 0)
return SetTokenKind(Result, Token::KWFalse);
if (memcmp("query", Result.start, 5) == 0)
return SetTokenKind(Result, Token::KWQuery);
break;
case 6:
if (memcmp("define", Result.start, 6) == 0)
return SetTokenKind(Result, Token::KWReserved);
break;
case 7:
if (memcmp("declare", Result.start, 7) == 0)
return SetTokenKind(Result, Token::KWReserved);
break;
case 8:
if (memcmp("symbolic", Result.start, 8) == 0)
return SetTokenKind(Result, Token::KWSymbolic);
break;
}
if (isReservedKW(Result.start, Length))
return SetTokenKind(Result, Token::KWReserved);
if (isWidthKW(Result.start, Length))
return SetTokenKind(Result, Token::KWWidth);
return SetTokenKind(Result, Token::Identifier);
}
void Lexer::SkipToEndOfLine() {
for (;;) {
int Char = GetNextChar();
if (Char == -1 || Char =='\n')
break;
}
}
Token &Lexer::LexNumber(Token &Result) {
while (isalnum(PeekNextChar()) || PeekNextChar()=='_')
GetNextChar();
return SetTokenKind(Result, Token::Number);
}
Token &Lexer::LexIdentifier(Token &Result) {
while (isInternalIdentifierChar(PeekNextChar()))
GetNextChar();
// Recognize keywords specially.
return SetIdentifierTokenKind(Result);
}
Token &Lexer::Lex(Token &Result) {
Result.kind = Token::Unknown;
Result.length = 0;
Result.start = BufferPos;
// Skip whitespace.
while (isspace(PeekNextChar()))
GetNextChar();
Result.start = BufferPos;
Result.line = LineNumber;
Result.column = ColumnNumber;
int Char = GetNextChar();
switch (Char) {
case -1: return SetTokenKind(Result, Token::EndOfFile);
case '(': return SetTokenKind(Result, Token::LParen);
case ')': return SetTokenKind(Result, Token::RParen);
case ',': return SetTokenKind(Result, Token::Comma);
case ':': return SetTokenKind(Result, Token::Colon);
case ';': return SetTokenKind(Result, Token::Semicolon);
case '=': return SetTokenKind(Result, Token::Equals);
case '@': return SetTokenKind(Result, Token::At);
case '[': return SetTokenKind(Result, Token::LSquare);
case ']': return SetTokenKind(Result, Token::RSquare);
case '{': return SetTokenKind(Result, Token::LBrace);
case '}': return SetTokenKind(Result, Token::RBrace);
case '#':
SkipToEndOfLine();
return SetTokenKind(Result, Token::Comment);
case '+': {
if (isdigit(PeekNextChar()))
return LexNumber(Result);
else
return SetTokenKind(Result, Token::Unknown);
}
case '-': {
int Next = PeekNextChar();
if (Next == '>')
return GetNextChar(), SetTokenKind(Result, Token::Arrow);
else if (isdigit(Next))
return LexNumber(Result);
else
return SetTokenKind(Result, Token::Unknown);
break;
}
default:
if (isdigit(Char))
return LexNumber(Result);
else if (isalpha(Char) || Char == '_')
return LexIdentifier(Result);
return SetTokenKind(Result, Token::Unknown);
}
}
|