-
Notifications
You must be signed in to change notification settings - Fork 1
/
chardfa.pas
549 lines (438 loc) · 12.8 KB
/
chardfa.pas
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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
unit chardfa;
{$mode objfpc}{$H+}
interface
uses Classes, SysUtils;
type
PDFAToken = ^TDFAToken;
TDFAToken = record
TokenId : Integer;
TokenVal : AnsiString;
TokenName: AnsiString;
TokenCharStart : Integer;
TokenLine : Integer;
end;
TDFATokenHandler = procedure(ADfaToken : PDFAToken) of object;
TDFAComparator = class(TObject)
public
procedure Free(); Virtual; Abstract;
function Compare(AInput : AnsiString) : Boolean; Virtual; Abstract;
end;
TDFAComp_IsIn = class(TDFAComparator)
private
FCharList : Array of AnsiString;
public
constructor Create(ACharList : Array of AnsiString);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAComp_IsNotIn = class(TDFAComparator)
private
FCharList : Array of AnsiString;
public
constructor Create(ACharList : Array of AnsiString);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAComp_Is = class(TDFAComparator)
private
FChar : AnsiString;
public
constructor Create(AChar : AnsiString);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAComp_IsNot = class(TDFAComparator)
private
FChar : AnsiString;
public
constructor Create(AChar : AnsiString);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAComp_And = class(TDFAComparator)
private
FComparators : Array of TDFAComparator;
public
constructor Create(AComps : Array of TDFAComparator);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAComp_Or = class(TDFAComparator)
private
FComparators : Array of TDFAComparator;
public
constructor Create(AComps : Array of TDFAComparator);
destructor Destroy(); Override;
procedure Free(); Override;
function Compare(AInput : AnsiString) : Boolean; Override;
end;
TDFAState = class;
TDFADelta = class
private
FComparator : TDFAComparator;
FDestination : TDFAState;
FAddToBuffer : Boolean;
FReprocess : Boolean;
public
constructor Create(AComparator : TDFAComparator; ADestination : TDFAState; AAddToBuffer : Boolean = True; AReprocess : Boolean = False);
destructor Destroy(); Override;
end;
TCharDFA = class;
TDFAState = class(TObject)
private
FDeltas : Array of TDFADelta;
FName : AnsiString;
FIdent : AnsiString;
FTokenId : Integer;
FDfa : TCharDFA;
function GetIsLeaf() : Boolean;
public
function ProcessChar(c : AnsiString; var reprocess : Boolean) : Boolean;
procedure AddDelta(delta : TDFADelta);
constructor Create(AName : AnsiString; AIdent : AnsiString; ATokenId : Integer);
destructor Destroy(); Override;
property IsLeaf : Boolean read GetIsLeaf;
end;
TCharDFA = class
private
FStates : Array of TDFAState;
FCurState : TDFAState;
FStartState : TDFAState;
FBuffer : AnsiString;
FTokenHandler : TDFATokenHandler;
protected
public
constructor Create();
destructor Destroy(); Override;
procedure AddState(state : TDFAState);
procedure SetTokenHandler(handler : TDFATokenHandler);
function nextChar(c : AnsiString; var reprocess : Boolean) : Boolean;
end;
implementation
constructor TDFAComp_IsIn.Create(ACharList : Array of AnsiString);
var
el : AnsiString;
i : Integer;
begin
inherited Create();
SetLength(Self.FCharList, Length(ACharList));
i := 0;
for el in ACharList do
begin
Self.FCharList[i] := Copy(el, 1, 1);
Inc(i);
end;
end;
destructor TDFAComp_IsIn.Destroy();
begin
inherited Destroy();
end;
procedure TDFAComp_IsIn.Free();
begin
SetLength(Self.FCharList, 0);
Self.FCharList := Nil;
end;
function TDFAComp_IsIn.Compare(AInput : AnsiString) : Boolean;
var
el : AnsiString;
begin
Result := False;
for el in Self.FCharList do
begin
if el = AInput then
begin
Result := True;
break;
end;
end;
end;
constructor TDFAComp_IsNotIn.Create(ACharList : Array of AnsiString);
var
el : AnsiString;
i : Integer;
begin
inherited Create();
SetLength(Self.FCharList, Length(ACharList));
i := 0;
for el in ACharList do
begin
Self.FCharList[i] := Copy(el, 1, 1);
Inc(i);
end;
end;
destructor TDFAComp_IsNotIn.Destroy();
begin
inherited Destroy();
end;
procedure TDFAComp_IsNotIn.Free();
begin
SetLength(Self.FCharList, 0);
Self.FCharList := Nil;
end;
function TDFAComp_IsNotIn.Compare(AInput : AnsiString) : Boolean;
var
el : AnsiString;
begin
Result := True;
for el in Self.FCharList do
begin
if el = AInput then
begin
Result := False;
break;
end;
end;
end;
constructor TDFAComp_Is.Create(AChar : AnsiString);
begin
inherited Create();
self.FChar := AChar;
end;
destructor TDFAComp_Is.Destroy();
begin
inherited Destroy();
end;
procedure TDFAComp_Is.Free();
begin
Self.FChar := '';
end;
function TDFAComp_Is.Compare(AInput : AnsiString) : Boolean;
var
el : AnsiString;
begin
Result := True;
if AnsiCompareStr(AInput, FChar) <> 0 then
Result := False;
end;
constructor TDFAComp_IsNot.Create(AChar : AnsiString);
begin
inherited Create();
self.FChar := AChar;
end;
destructor TDFAComp_IsNot.Destroy();
begin
inherited Destroy();
end;
procedure TDFAComp_IsNot.Free();
begin
Self.FChar := '';
end;
function TDFAComp_IsNot.Compare(AInput : AnsiString) : Boolean;
var
el : AnsiString;
begin
Result := True;
if AnsiCompareStr(AInput, FChar) = 0 then
Result := False;
end;
constructor TDFAComp_And.Create(AComps : Array of TDFAComparator);
var i : Integer;
comp : TDFAComparator;
begin
inherited Create();
SetLength(Self.FComparators, Length(AComps));
i := 0;
for comp in AComps do
begin
Self.FComparators[i] := comp;
Inc(i);
end;
end;
destructor TDFAComp_And.Destroy();
begin
inherited Destroy();
end;
procedure TDFAComp_And.Free();
begin
end;
function TDFAComp_And.Compare(AInput : AnsiString) : Boolean;
var comp : TDFAComparator;
begin
Result := True;
for comp in self.FComparators do
begin
if not comp.Compare(AInput) then
begin
Result := False;
break;
end;
end;
end;
constructor TDFAComp_Or.Create(AComps : Array of TDFAComparator);
var i : Integer;
begin
inherited Create();
SetLength(Self.FComparators, Length(AComps));
for i := 0 to Length(AComps) - 1 do
begin
self.FComparators[i] := AComps[i];
end;
end;
destructor TDFAComp_Or.Destroy();
begin
WriteLn('Destroy Or');
inherited Destroy();
end;
procedure TDFAComp_Or.Free();
var comp : TDFAComparator;
i : Integer;
begin
WriteLn('Freeing Or');
for i := 0 to Length(Self.FComparators) - 1 do
begin
comp := Self.FComparators[i];
//Self.FComparators[i] := nil;
Self.FComparators[i].Free();
FreeAndNil(Self.FComparators[i]);
//comp := nil;
end;
SetLength(Self.FComparators, 0);
Self.FComparators := nil;
end;
function TDFAComp_Or.Compare(AInput : AnsiString) : Boolean;
var comp : TDFAComparator;
begin
Result := False;
for comp in self.FComparators do
begin
if comp.Compare(AInput) then
begin
Result := True;
break;
end;
end;
end;
constructor TDFADelta.Create(AComparator : TDFAComparator; ADestination : TDFAState; AAddToBuffer : Boolean = True; AReprocess : Boolean = False);
begin
self.FComparator := AComparator;
self.FDestination := ADestination;
self.FAddToBuffer := AAddToBuffer;
self.FReprocess := AReprocess;
end;
destructor TDFADelta.Destroy();
begin
FreeAndNil(self.FComparator);
inherited Destroy();
end;
constructor TDFAState.Create(AName : AnsiString; AIdent : AnsiString; ATokenId : Integer);
begin
FName := AName;
FIdent := AIdent;
FTokenId := ATokenId;
end;
destructor TDFAState.Destroy();
var curDelta : TDFADelta;
i : Integer;
begin
for i := 0 to Length(self.FDeltas) - 1 do
begin
curDelta := self.FDeltas[i];
FreeAndNil(curDelta);
end;
inherited Destroy();
end;
function TDFAState.GetIsLeaf() : Boolean;
begin
Result := False;
if Length(self.FDeltas) = 0 then
Result := True;
end;
function TDFAState.ProcessChar(c : AnsiString; var reprocess : Boolean) : Boolean;
var delta : TDFADelta;
begin
Result := False;
for delta in self.FDeltas do
begin
if delta.FComparator.Compare(c) then
begin
Result := True;
(* We need to handle the transition *)
if delta.FReprocess then
begin
(* Handle reversing the buffer, somehow *)
reprocess := True;
end;
if delta.FAddToBuffer then
begin
(* Add the current character to the DFA Buffer for current token *)
self.FDfa.FBuffer := self.FDfa.FBuffer + c;
end;
(* Move to Dest state *)
self.FDfa.FCurState := delta.FDestination;
Exit;
end;
end;
end;
procedure TDFAState.AddDelta(delta : TDFADelta);
var numDeltas : Integer;
begin
numDeltas := Length(self.FDeltas);
SetLength(self.FDeltas, numDeltas + 1);
self.FDeltas[numDeltas] := delta;
end;
constructor TCharDFA.Create();
begin
end;
destructor TCharDFA.Destroy();
var state : TDFAState;
i : Integer;
begin
(* Free up all States *)
for i := 0 to Length(self.FStates) - 1 do
begin
state := self.FStates[i];
(* Call free on state, then freeandnil *)
//state.Free();
FreeAndNil(State);
end;
inherited Destroy();
end;
procedure TCharDFA.AddState(state : TDFAState);
var numStates : Integer;
begin
numStates := Length(self.FStates);
SetLength(self.FStates, numStates + 1);
self.FStates[numStates] := state;
if not Assigned(self.FCurState) then
self.FCurState := state;
if not Assigned(self.FStartState) then
self.FStartState := state;
// Put a reference to this DFA in the state (used for changing current state)
state.FDfa := self;
end;
procedure TCharDFA.SetTokenHandler(handler : TDFATokenHandler);
begin
self.FTokenHandler := handler;
end;
function TCharDFA.nextChar(c : AnsiString; var reprocess : Boolean) : Boolean;
var
pToken : PDFAToken;
begin
(* Test each Delta in the current state, if it can process this char *)
Result := FCurState.ProcessChar(c, reprocess);
if Result = True then
begin
(* Test if state is a leaf *)
if self.FCurState.IsLeaf then
begin
(* This is a dead end, it is time to generate a token, clear buffer, and got to StartState *)
New(pToken);
pToken^.TokenName := self.FCurState.FName;
pToken^.TokenId := self.FCurState.FTokenId;
pToken^.TokenVal := Copy(self.FBuffer, 1, Length(self.FBuffer));
self.FTokenHandler(pToken);
Dispose(pToken);
self.FBuffer := '';
(* Go Back to StartState *)
self.FCurState := self.FStartState;
end;
end;
(* return if the char was processed correctly *)
//Result := True;
end;
end.