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
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
|
/*
* Copyright (C) 2007-2023 Xagasoft, All rights reserved.
*
* This file is part of the libbu++ library and is released under the
* terms of the license contained in the file LICENSE.
*/
#include <bu/sio.h>
#include <bu/lexer.h>
#include <bu/parser.h>
#include <bu/file.h>
#include <bu/queuebuf.h>
using namespace Bu;
enum TokenType
{
tokIdentifier,
tokColon,
tokOr,
tokSemiColon,
tokTokens,
tokEquals,
tokOpenCurly,
tokCloseCurly,
tokOpenSquare,
tokCloseSquare,
tokEos=-1
};
class BnfLexer : public Lexer
{
public:
BnfLexer( Stream &rSrc ) :
rSrc( rSrc )
{
}
virtual ~BnfLexer()
{
}
virtual Token *nextToken()
{
char cBuf;
for(;;)
{
if( qbIn.getSize() == 0 )
{
char buf[4096];
qbIn.write( buf, rSrc.read( buf, 4096 ) );
if( rSrc.isEos() && qbIn.getSize() == 0 )
return new Token( tokEos );
}
qbIn.peek( &cBuf, 1 );
if( (cBuf >= 'a' && cBuf <= 'z') ||
(cBuf >= 'A' && cBuf <= 'Z') ||
(cBuf >= '0' && cBuf <= '9') ||
cBuf == '_' )
{
sBuf.append( cBuf );
qbIn.seek( 1 );
}
else if( sBuf.isSet() )
{
if( sBuf == "tokens" )
{
sBuf.clear();
return new Token( tokTokens );
}
else
{
Token *pRet = new Token( tokIdentifier, sBuf );
sBuf.clear();
return pRet;
}
}
else
{
switch( cBuf )
{
case ' ':
case '\t':
case '\n':
case '\r':
qbIn.seek( 1 );
continue;
case ':':
qbIn.seek( 1 );
return new Token( tokColon );
case ';':
qbIn.seek( 1 );
return new Token( tokSemiColon );
case '|':
qbIn.seek( 1 );
return new Token( tokOr );
case '=':
qbIn.seek( 1 );
return new Token( tokEquals );
case '[':
qbIn.seek( 1 );
return new Token( tokOpenSquare );
case ']':
qbIn.seek( 1 );
return new Token( tokCloseSquare );
case '{':
qbIn.seek( 1 );
return new Token( tokOpenCurly );
case '}':
qbIn.seek( 1 );
return new Token( tokCloseCurly );
default:
throw ExceptionBase("Unexpected character '%c'.",
cBuf );
break;
}
}
}
}
virtual String tokenToString( const Token &t )
{
switch( (TokenType)t.iToken )
{
case tokIdentifier: return "tokIdentifier";
case tokColon: return "tokColon";
case tokOr: return "tokOr";
case tokSemiColon: return "tokSemiColon";
case tokTokens: return "tokTokens";
case tokEquals: return "tokEquals";
case tokOpenCurly: return "tokOpenCurly";
case tokCloseCurly: return "tokCloseCurly";
case tokOpenSquare: return "tokOpenSquare";
case tokCloseSquare: return "tokCloseSquare";
case tokEos: return "tokEos";
}
return "???";
}
private:
Stream &rSrc;
QueueBuf qbIn;
String sBuf;
};
class BnfParser
{
public:
BnfParser( BnfLexer &l ) :
l( l ),
pCur( NULL ),
iLastToken( 0 )
{
}
virtual ~BnfParser()
{
delete pCur;
pCur = NULL;
}
void parse()
{
for(;;)
{
next();
switch( pCur->iToken )
{
case tokTokens:
tokens();
break;
case tokIdentifier:
nonTerminal();
break;
case tokEos:
return;
break;
default:
tokenError("tokTokens, tokIdentifier, or tokEos");
}
}
}
private:
void tokens()
{
next();
if( pCur->iToken != tokEquals )
tokenError("tokEquals");
for(;;)
{
next();
if( pCur->iToken == tokIdentifier )
{
hTokens.insert( pCur->vExtra.get<Bu::String>(), ++iLastToken );
sio << "Added token[" << iLastToken << "]: "
<< pCur->vExtra.get<Bu::String>() << sio.nl;
}
else if( pCur->iToken == tokSemiColon )
break;
else
tokenError("tokIdentifier or tokSemiColon");
}
}
void nonTerminal()
{
Bu::String sNtName = pCur->vExtra.get<Bu::String>();
Parser::NonTerminal nt;
p.addNonTerminal( sNtName );
sio.incIndent();
sio << "Created non-terminal: " << sNtName << sio.nl;
next();
if( pCur->iToken != tokColon )
tokenError("tokColon");
production( nt );
for(;;)
{
switch( pCur->iToken )
{
case tokOr:
production( nt );
break;
case tokSemiColon:
p.setNonTerminal( sNtName, nt );
sio.decIndent();
sio << "Closing non-terminal." << sio.nl;
return;
default:
tokenError("tkOr or tokSemiColon");
break;
}
}
}
void production( Parser::NonTerminal &nt )
{
sio.incIndent();
sio << "Adding new production:" << sio.nl;
Parser::Production pr;
bool bAnything = false;
for(;;)
{
next();
switch( pCur->iToken )
{
case tokIdentifier:
{
const Bu::String &sName =
pCur->vExtra.get<Bu::String>();
if( hTokens.has( sName ) )
{
pr.append(
Parser::State(
Parser::State::typeTerminal,
hTokens.get( sName )
)
);
sio << "Added terminal " << sName << sio.nl;
}
else
{
if( !p.hasNonTerminal( sName ) )
{
p.addNonTerminal( sName );
}
pr.append(
Parser::State(
Parser::State::typeNonTerminal,
p.getNonTerminalId( sName )
)
);
sio << "Added non-terminal " << sName << sio.nl;
}
}
break;
case tokOpenSquare:
{
next();
if( pCur->iToken != tokIdentifier )
tokenError("tokIdentifier");
Bu::String sName =
pCur->vExtra.get<Bu::String>();
next();
if( pCur->iToken != tokCloseSquare )
tokenError("tokCloseSquare");
if( !hTokens.has( sName ) )
throw ExceptionBase("Only token names may be "
"enclosed in square brackets.");
pr.append(
Parser::State(
Parser::State::typeTerminalPush,
hTokens.get( sName )
)
);
sio << "Added terminal-push " << sName << sio.nl;
}
break;
case tokOpenCurly:
{
next();
if( pCur->iToken != tokIdentifier )
tokenError("tokIdentifier");
Bu::String sName =
pCur->vExtra.get<Bu::String>();
next();
if( pCur->iToken != tokCloseCurly )
tokenError("tokCloseCurly");
if( !p.hasReduction( sName ) )
p.addReduction( sName );
pr.append(
Parser::State(
Parser::State::typeReduction,
p.getReductionId( sName )
)
);
sio << "Added reduction " << sName << sio.nl;
}
break;
case tokOr:
case tokSemiColon:
if( bAnything )
{
nt.addProduction( pr );
sio.decIndent();
sio << "Closing production." << sio.nl;
}
else
{
nt.setCanSkip();
sio.decIndent();
sio << "Closing empty production." << sio.nl;
}
return;
default:
tokenError("tokIdentifier, tokOpenSquare, tokOr, "
"tokOpenCurly, or tokSemiColon");
}
}
}
private:
void next()
{
delete pCur;
pCur = l.nextToken();
}
void tokenError( const String &s )
{
throw ExceptionBase( ("Expected " + s + " but found "
+ l.tokenToString( *pCur ) + ".").getStr() );
}
private:
typedef Bu::Hash<Bu::String, int> TokenHash;
TokenHash hTokens;
BnfLexer &l;
BnfLexer::Token *pCur;
int iLastToken;
Parser p;
};
int main( int argc, char *argv[] )
{
if( argc < 2 )
{
println("Provide an input filename as the first parameter.");
return 0;
}
File fIn( argv[1], File::Read );
BnfLexer bl( fIn );
BnfParser parser( bl );
parser.parse();
/*
for(;;)
{
Lexer::Token *pTok = bl.nextToken();
sio << bl.tokenToString(*pTok);
if( pTok->vExtra.isSet() )
{
sio << " - " << pTok->vExtra;
}
sio << sio.nl;
if( pTok->iToken == tokEos )
break;
}
*/
return 0;
}
|