/
regexpr.pas
7750 lines (7053 loc) · 258 KB
/
regexpr.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
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
unit RegExpr;
{ Modified by V.V.Pekunov, 2017-2020 }
{$IF DEFINED(UNIX) OR DEFINED(LINUX)}
{$linklib c}
{$linklib stdc++}
{$ENDIF}
{$CODEPAGE UTF8}
{
TRegExpr class library
Delphi Regular Expressions
Copyright (c) 1999-2004 Andrey V. Sorokin, St.Petersburg, Russia
You can choose to use this Pascal unit in one of the two following licenses:
Option 1>
You may use this software in any kind of development,
including comercial, redistribute, and modify it freely,
under the following restrictions :
1. This software is provided as it is, without any kind of
warranty given. Use it at Your own risk.The author is not
responsible for any consequences of use of this software.
2. The origin of this software may not be mispresented, You
must not claim that You wrote the original software. If
You use this software in any kind of product, it would be
appreciated that there in a information box, or in the
documentation would be an acknowledgement like
Partial Copyright (c) 2004 Andrey V. Sorokin
http://RegExpStudio.com
mailto:anso@mail.ru
3. You may not have any income from distributing this source
(or altered version of it) to other developers. When You
use this product in a comercial package, the source may
not be charged seperatly.
4. Altered versions must be plainly marked as such, and must
not be misrepresented as being the original software.
5. RegExp Studio application and all the visual components as
well as documentation is not part of the TRegExpr library
and is not free for usage.
mailto:anso@mail.ru
http://RegExpStudio.com
http://anso.da.ru/
Option 2>
The same modified LGPL with static linking exception as the Free Pascal RTL
}
interface
{off $DEFINE DebugSynRegExpr}
{$IFDEF FPC}
{$MODE DELPHI} // Delphi-compatible mode in FreePascal
{$ENDIF}
// ======== Determine compiler
{$IFDEF VER80} Sorry, TRegExpr is for 32-bits Delphi only. Delphi 1 is not supported (and whos really care today?!). {$ENDIF}
{$IFDEF VER90} {$DEFINE D2} {$ENDIF} // D2
{$IFDEF VER93} {$DEFINE D2} {$ENDIF} // CPPB 1
{$IFDEF VER100} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // D3
{$IFDEF VER110} {$DEFINE D4} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // CPPB 3
{$IFDEF VER120} {$DEFINE D4} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // D4
{$IFDEF VER130} {$DEFINE D5} {$DEFINE D4} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // D5
{$IFDEF VER140} {$DEFINE D6} {$DEFINE D5} {$DEFINE D4} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // D6
{$IFDEF VER150} {$DEFINE D7} {$DEFINE D6} {$DEFINE D5} {$DEFINE D4} {$DEFINE D3} {$DEFINE D2} {$ENDIF} // D7
// ======== Define base compiler options
{$BOOLEVAL OFF}
{$EXTENDEDSYNTAX ON}
{$LONGSTRINGS ON}
{$IFNDEF FPC}
{$OPTIMIZATION ON}
{$ENDIF}
{$IFDEF D6}
{$WARN SYMBOL_PLATFORM OFF} // Suppress .Net warnings
{$ENDIF}
{$IFDEF D7}
{$WARN UNSAFE_CAST OFF} // Suppress .Net warnings
{$WARN UNSAFE_TYPE OFF} // Suppress .Net warnings
{$WARN UNSAFE_CODE OFF} // Suppress .Net warnings
{$ENDIF}
// ======== Define options for TRegExpr engine
{$DEFINE UniCode} // Unicode support
{$ifdef FPC_OS_UNICODE}
{$define UNICODE}
{$endif}
{$DEFINE RegExpPCodeDump} // p-code dumping (see Dump method)
{$IFNDEF FPC} // the option is not supported in FreePascal
{$DEFINE reRealExceptionAddr} // exceptions will point to appropriate source line, not to Error procedure
{$ENDIF}
{$DEFINE ComplexBraces} // support braces in complex cases
{$IFNDEF UniCode} // the option applicable only for non-UniCode mode
{$IFNDEF FPC_REQUIRES_PROPER_ALIGNMENT} //sets have to be aligned
{$DEFINE UseSetOfChar} // Significant optimization by using set of char
{$ENDIF}
{$ENDIF}
{$IFDEF UseSetOfChar}
{$DEFINE UseFirstCharSet} // Fast skip between matches for r.e. that starts with determined set of chars
{$ENDIF}
// ======== Define Pascal-language options
// Define 'UseAsserts' option (do not edit this definitions).
// Asserts used to catch 'strange bugs' in TRegExpr implementation (when something goes
// completely wrong). You can swith asserts on/off with help of {$C+}/{$C-} compiler options.
{$IFDEF D3} {$DEFINE UseAsserts} {$ENDIF}
{$IFDEF FPC} {$DEFINE UseAsserts} {$ENDIF}
// Define 'use subroutine parameters default values' option (do not edit this definition).
{$IFDEF D4} {$DEFINE DefParam} {$ENDIF}
// Define 'OverMeth' options, to use method overloading (do not edit this definitions).
{$IFDEF D5} {$DEFINE OverMeth} {$ENDIF}
{$IFDEF FPC} {$DEFINE OverMeth} {$ENDIF}
uses
Classes, // TStrings in Split method
Lexique,
Common,
Math,
StrUtils,
DateUtils,
dynlibs,
SysUtils,
XPath; // Exception
type
{$IFDEF UniCode}
PRegExprChar = PWideChar;
RegExprString = WideString;
REChar = WideChar;
{$ELSE}
PRegExprChar = PChar;
RegExprString = AnsiString; //###0.952 was string
REChar = Char;
{$ENDIF}
TREOp = REChar; // internal p-code type //###0.933
PREOp = ^TREOp;
TRENextOff = PtrInt; // internal Next "pointer" (offset to current p-code) //###0.933
PRENextOff = ^TRENextOff; // used for extracting Next "pointers" from compiled r.e. //###0.933
TREBracesArg = integer; // type of {m,n} arguments
PREBracesArg = ^TREBracesArg;
const
dirParallel = 'parallel';
dirSequential = 'sequential';
const
fpFast = 'fast';
fpNearest = 'nearest';
fpNeuro = 'neuro';
const
parPreStage = 4;
parSimpleStage = 30;
parFirstStage = 7;
parSecondStage = 8;
parSerie = parFirstStage+parSecondStage;
nt1Shift = 0; // 0 -- without const a[0] (use all nt1Koeffs point), 1 -- with const a[0]
nt1Koeffs = 4;
ntnPower = 2;
const
REOpSz = SizeOf (TREOp) div SizeOf (REChar); // size of p-code in RegExprString units
{$IFDEF FPC_REQUIRES_PROPER_ALIGNMENT}
// add space for aligning pointer
// -1 is the correct max size but also needed for InsertOperator that needs a multiple of pointer size
RENextOffSz = (2 * SizeOf (TRENextOff) div SizeOf (REChar))-1;
REBracesArgSz = (2 * SizeOf (TREBracesArg) div SizeOf (REChar)); // add space for aligning pointer
{$ELSE}
RENextOffSz = (SizeOf (TRENextOff) div SizeOf (REChar)); // size of Next 'pointer' -"-
REBracesArgSz = SizeOf (TREBracesArg) div SizeOf (REChar); // size of BRACES arguments -"-
{$ENDIF}
type
TRegExprInvertCaseFunction = function (const Ch : REChar) : REChar
of object;
const
EscChar = '\'; // 'Escape'-char ('\' in common r.e.) used for escaping metachars (\w, \d etc).
RegExprModifierI : boolean = False; // default value for ModifierI
RegExprModifierR : boolean = True; // default value for ModifierR
RegExprModifierS : boolean = True; // default value for ModifierS
RegExprModifierG : boolean = True; // default value for ModifierG
RegExprModifierM : boolean = False; // default value for ModifierM
RegExprModifierX : boolean = False; // default value for ModifierX
RegExprSpaceChars : RegExprString = // default value for SpaceChars
' '#$9#$A#$D#$C;
RegExprWordChars : RegExprString = // default value for WordChars
'0123456789' //###0.940
+ 'abcdefghijklmnopqrstuvwxyz'
+ 'ABCDEFGHIJKLMNOPQRSTUVWXYZ_';
RegExprLineSeparators : RegExprString =// default value for LineSeparators
#$d#$a{$IFDEF UniCode}+#$b#$c#$2028#$2029#$85{$ENDIF}; //###0.947
RegExprLinePairedSeparator : RegExprString =// default value for LinePairedSeparator
#$d#$a;
{ if You need Unix-styled line separators (only \n), then use:
RegExprLineSeparators = #$a;
RegExprLinePairedSeparator = '';
}
const
NSUBEXP = 150; // max number of subexpression //###0.929
// Cannot be more than NSUBEXPMAX
// Be carefull - don't use values which overflow CLOSE opcode
// (in this case you'll get compiler erorr).
// Big NSUBEXP will cause more slow work and more stack required
NSUBEXPMAX = 255; // Max possible value for NSUBEXP. //###0.945
// Don't change it! It's defined by internal TRegExpr design.
MaxBracesArg = $7FFFFFFF - 1; // max value for {n,m} arguments //###0.933
{$IFDEF ComplexBraces}
LoopStackMax = 10; // max depth of loops stack //###0.925
{$ENDIF}
TinySetLen = 3;
// if range includes more then TinySetLen chars, //###0.934
// then use full (32 bytes) ANYOFFULL instead of ANYOF[BUT]TINYSET
// !!! Attension ! If you change TinySetLen, you must
// change code marked as "//!!!TinySet"
type
{$IFDEF UseSetOfChar}
PSetOfREChar = ^TSetOfREChar;
TSetOfREChar = set of REChar;
{$ENDIF}
TRegExpr = class;
TRegExprReplaceFunction = function (ARegExpr : TRegExpr): string
of object;
{ TVarValue }
TVarStruct = class;
TByteSet = Set Of Byte;
TVarValue = class(TStringList)
protected
Num: Integer; // Number of Var
Parent: TVarValue;
ParentIdx: Integer;
baseVal: RegExprString;
Ref: TRegExpr;
public
Constructor Create(_Ref: TRegExpr; _Num: Integer; _Parent: TVarValue; _ParentIdx: Integer; Const bv: RegExprString = '');
Procedure Mark(Var M: TByteSet);
Function ExportPredicates(Const MacroID: String; Const R:TRegExpr; Var id: Integer; Var L: String): String;
Function ExportXML(Const R:TRegExpr): String;
Function FindNode(ID: Integer): TVarStruct;
Procedure Out(Const Shift: String);
Procedure AssignBVal(Var stp, enp: PRegExprChar);
Destructor Destroy; override;
end;
{ TVarStruct }
TVarStruct = class(TStringList)
Public
ID: Integer;
_First, _Last: Integer;
Tags: WideString;
Constructor Create;
Procedure Mark(Var M: TByteSet);
Function ExportPredicates(Const MacroID: String; Const R:TRegExpr; Var id: Integer; Var L: String): String;
Function ExportXML(Const R:TRegExpr): String;
Function FindNode(ID: Integer): TVarStruct;
Procedure GrammarParse(Const VName: String; command: String; Var text: WideString; Var stp, enp: PRegExprChar);
Procedure Out(Const Shift: String);
end;
TFastPositionKind = (fpAny, fpBound, fpFree);
TFastPosition = record
Kind: TFastPositionKind;
Logged: Boolean;
Value: WideString
end;
TFastPositions = Array Of TFastPosition;
TFastPredicate = class
public
Function ExportDB(Const Name: String): String; virtual; abstract;
Function ExportPascalDB(Const ID: String; Var out: TStringList; Const Offs, vDB: String): Boolean; virtual; abstract;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; virtual; abstract;
Function Assert(Const Descriptor: TFastPositions): Boolean; virtual; abstract;
Function Retract(Const Descriptor: TFastPositions): Boolean; virtual; abstract;
Function Learn(Const Descriptor: TFastPositions): Boolean; virtual; abstract;
Procedure StartTransaction; virtual; abstract;
Procedure Commit; virtual; abstract;
Procedure RollBack; virtual; abstract;
End;
{ TFastTable }
TFastTable = class(TFastPredicate)
private
FThreshold: Integer;
FName: String;
FExact: Boolean;
FJournal: TStringList;
FJournalled: Boolean;
public
Constructor Create(Const FName: String);
Destructor Destroy; override;
Function ExportDB(Const Name: String): String; override;
function ExportPascalDB(Const ID: String; Var out: TStringList; Const Offs, vDB: String): Boolean; override;
Function Compare(Const S1, S2: String): Integer; virtual;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
Function Assert(Const Descriptor: TFastPositions): Boolean; override;
Function Retract(Const Descriptor: TFastPositions): Boolean; override;
Function Learn(Const Descriptor: TFastPositions): Boolean; override;
Procedure StartTransaction; override;
Procedure Commit; override;
Procedure RollBack; override;
End;
{ TFastNearestTable }
TFastNearestTable = class(TFastTable)
public
Constructor Create(Threshold: Integer; Const FName: String);
Function ExportDB(Const Name: String): String; override;
function ExportPascalDB(Const ID: String; Var out: TStringList; Const Offs, vDB: String): Boolean; override;
Function Compare(Const S1, S2: String): Integer; override;
End;
TExternalVals = ^PWideChar;
TExternal = function (N: Integer; Map: PWideChar; Vals: TExternalVals): Boolean; cdecl;
TFastDB = class;
{ TFastExternal }
TFastExternal = class(TFastPredicate)
private
Caller: TExternal;
public
Constructor Create(proc: Pointer);
Function ExportDB(Const Name: String): String; override;
function ExportPascalDB(Const ID: String; Var out: TStringList; Const Offs, vDB: String): Boolean; override;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
Function Assert(Const Descriptor: TFastPositions): Boolean; override;
Function Retract(Const Descriptor: TFastPositions): Boolean; override;
Function Learn(Const Descriptor: TFastPositions): Boolean; override;
Procedure StartTransaction; override;
Procedure Commit; override;
Procedure RollBack; override;
end;
{ TFastXPath }
TFastXPath = class(TFastExternal)
public
Constructor Create;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastXPathF }
TFastXPathF = class(TFastExternal)
public
Constructor Create;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastStopFail }
TFastStopFail = class(TFastExternal)
public
Constructor Create;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastBoolConst }
TFastBoolConst = class(TFastExternal)
Val: Boolean;
public
Constructor Create(V: Boolean);
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastEqual }
TFastEqual = class(TFastExternal)
public
Constructor Create(V: Boolean);
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastSimilar }
TFastSimilar = class(TFastExternal)
public
Constructor Create(V: Boolean);
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastSet }
TFastSet = class(TFastExternal)
public
Constructor Create(V: Boolean);
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
end;
{ TFastNet }
TFastNet = class(TFastPredicate)
private
FName: String;
FDB: TFastDB;
public
Constructor Create(Const FName: String; FDB: TFastDB);
Function ExportDB(Const Name: String): String; override;
function ExportPascalDB(Const ID: String; Var out: TStringList; Const Offs, vDB: String): Boolean; override;
Function Unify(R: TRegExpr; ENV: TXPathEnvironment; Var Descriptor: TFastPositions): Boolean; override;
Function Assert(Const Descriptor: TFastPositions): Boolean; override;
Function Retract(Const Descriptor: TFastPositions): Boolean; override;
Function Learn(Const Descriptor: TFastPositions): Boolean; override;
Procedure StartTransaction; override;
Procedure Commit; override;
Procedure RollBack; override;
end;
{ TFastDB }
TFastDB = class(TStringList)
private
nUses : Integer;
libs: TStringList;
public
Constructor Create;
Destructor Destroy; override;
function ExportDB: String;
function ExportPascalDB(Var out: TStringList; Const Offs, vDB: String): Boolean;
Procedure Use;
Procedure Release;
Function GetIndexOf(Const Predicate: String): Integer;
function Unify(R: TRegExpr; ENV: TXPathEnvironment; Const Predicate: String; Var Descriptor: TFastPositions): Boolean;
Function Assert(Const Predicate: String; Const Descriptor: TFastPositions): Boolean;
Function Retract(Const Predicate: String; Const Descriptor: TFastPositions): Boolean;
Function Learn(Const Predicate: String; Const Descriptor: TFastPositions): Boolean;
Procedure StartTransaction;
Procedure Commit;
Procedure RollBack;
end;
TFastCall = class
Predicate: String;
Negate: Boolean;
Descriptor: TFastPositions;
References: Array Of Integer; // Номера переменных из дескриптора. -1 для _ или константы
end;
RealArray = Array Of Real;
IntArray = Array Of Integer;
{ TParallelizer }
TParallelizer = class
Stage: Integer;
Counter: Integer;
t1, tn: RealArray;
a: RealArray;
m: RealArray;
predt1, predtn: Real;
Constructor Create;
Procedure Clear;
Procedure PutT(Parallel: Boolean; T: Real);
Function InParallel: Boolean;
end;
{ TFastCalls }
TFastCallsAction = function(Const Predicate: String; Const Descriptor: TFastPositions): Boolean of Object;
TFastCalls = class(TList)
public // Если в списке встречается TFastCalls -- вложенная цепочка
Constructor Create;
Destructor Destroy; override;
procedure ClearAnalyzers;
function Unify(ENV: TXPathEnvironment; Const DB: TFastDB; const R: TRegExpr; Var valext: TStringList; Var valsp): Boolean;
Function Assert(Const DB: TFastDB; const R: TRegExpr; Var valext: TStringList; Var valsp): Boolean;
Function Retract(Const DB: TFastDB; const R: TRegExpr; Var valext: TStringList; Var valsp): Boolean;
Function Learn(Const DB: TFastDB; const R: TRegExpr; Var valext: TStringList; Var valsp): Boolean;
private
Analyzers: TList;
Alternation: TFastCalls; // Альтернативная цепочка после ';'
function ARL(const DB: TFastDB; const R: TRegExpr; var valext: TStringList;
var valsp; Action: TFastCallsAction; makeFillIn: Boolean): Boolean;
function FillIn(pcall: TFastCall; const R: TRegExpr; var valext: TStringList
): Boolean;
function FillOut(pcall: TFastCall; const R: TRegExpr;
var _valsp): Boolean;
end;
{ TRegExpr }
TRegExpr = class
private
startp : array [0 .. NSUBEXP - 1] of PRegExprChar; // founded expr starting points
endp : array [0 .. NSUBEXP - 1] of PRegExprChar; // founded expr end points
varsp : array [0 .. NSUBEXP - 1] of PRegExprChar; // Var Names
valsp : array [0 .. NSUBEXP - 1] of TVarValue; // Var Values
fcalls : array [0 .. NSUBEXP - 1] of TFastCalls; // Predicate Calls
valext: TStringList;
nExecs: Integer;
db: TFastDB;
ENV: TXPathEnvironment;
storedWords: TStringList;
storedRels: TStringList;
trash: TList;
RootID: Integer;
{$IFDEF ComplexBraces}
LoopStack : array [1 .. LoopStackMax] of integer; // state before entering loop
LoopStackIdx : integer; // 0 - out of all loops
{$ENDIF}
// The "internal use only" fields to pass info from compile
// to execute that permits the execute phase to run lots faster on
// simple cases.
regstart : REChar; // char that must begin a match; '\0' if none obvious
reganch : REChar; // is the match anchored (at beginning-of-line only)?
regmust : PRegExprChar; // string (pointer into program) that match must include, or nil
regmlen : PtrInt; // length of regmust string
// Regstart and reganch permit very fast decisions on suitable starting points
// for a match, cutting down the work a lot. Regmust permits fast rejection
// of lines that cannot possibly match. The regmust tests are costly enough
// that regcomp() supplies a regmust only if the r.e. contains something
// potentially expensive (at present, the only such thing detected is * or +
// at the start of the r.e., which can involve a lot of backup). Regmlen is
// supplied because the test in regexec() needs it and regcomp() is computing
// it anyway.
{$IFDEF UseFirstCharSet} //###0.929
FirstCharSet : TSetOfREChar;
{$ENDIF}
// work variables for Exec's routins - save stack in recursion}
reginput : PRegExprChar; // String-input pointer.
fInputStart : PRegExprChar; // Pointer to first char of input string.
fInputEnd : PRegExprChar; // Pointer to char AFTER last char of input string
// work variables for compiler's routines
regparse : PRegExprChar; // Input-scan pointer.
regnpar : PtrInt; // count.
regdummy : char;
regcode : PRegExprChar; // Code-emit pointer; @regdummy = don't.
regsize : PtrInt; // Code size.
regexpbeg : PRegExprChar; // only for error handling. Contains
// pointer to beginning of r.e. while compiling
fExprIsCompiled : boolean; // true if r.e. successfully compiled
// programm is essentially a linear encoding
// of a nondeterministic finite-state machine (aka syntax charts or
// "railroad normal form" in parsing technology). Each node is an opcode
// plus a "next" pointer, possibly plus an operand. "Next" pointers of
// all nodes except BRANCH implement concatenation; a "next" pointer with
// a BRANCH on both ends of it connects two alternatives. (Here we
// have one of the subtle syntax dependencies: an individual BRANCH (as
// opposed to a collection of them) is never concatenated with anything
// because of operator precedence.) The operand of some types of node is
// a literal string; for others, it is a node leading into a sub-FSM. In
// particular, the operand of a BRANCH node is the first node of the branch.
// (NB this is *not* a tree structure: the tail of the branch connects
// to the thing following the set of BRANCHes.) The opcodes are:
programm : PRegExprChar; // Unwarranted chumminess with compiler.
fExpression : PRegExprChar; // source of compiled r.e.
fInputString : PRegExprChar; // input string
fLastError : integer; // see Error, LastError
fModifiers : integer; // modifiers
fCompModifiers : integer; // compiler's copy of modifiers
fProgModifiers : integer; // modifiers values from last programm compilation
fSpaceChars : RegExprString; //###0.927
fWordChars : RegExprString; //###0.929
fInvertCase : TRegExprInvertCaseFunction; //###0.927
fLineSeparators : RegExprString; //###0.941
fLinePairedSeparatorAssigned : boolean;
fLinePairedSeparatorHead,
fLinePairedSeparatorTail : REChar;
{$IFNDEF UniCode}
fLineSeparatorsSet : set of REChar;
{$ENDIF}
Trasher: TRTLCriticalSection;
procedure AddTrash(p: TObject);
function GetVarName(Idx : integer): PRegExprChar;
function GetVarValue(Idx : integer): TVarValue;
// Mark programm as having to be [re]compiled
procedure InvalidateProgramm;
// Check if we can use precompiled r.e. or
// [re]compile it if something changed
function IsProgrammOk : boolean; //###0.941
function GetExpression : RegExprString;
procedure SetExpression (const s : RegExprString);
function GetModifierStr : RegExprString;
// Parse AModifiers string and return true and set AModifiersInt
// if it's in format 'ismxrg-ismxrg'.
class function ParseModifiersStr (const AModifiers : RegExprString;
var AModifiersInt : integer) : boolean; //###0.941 class function now
procedure SetModifierStr (const AModifiers : RegExprString);
function GetModifier (AIndex : integer) : boolean;
procedure SetModifier (AIndex : integer; ASet : boolean);
// Default handler raises exception ERegExpr with
// Message = ErrorMsg (AErrorID), ErrorCode = AErrorID
// and CompilerErrorPos = value of property CompilerErrorPos.
procedure Error (AErrorID : integer); virtual; // error handler.
{==================== Compiler section ===================}
// compile a regular expression into internal code
function CompileRegExpr (exp : PRegExprChar) : boolean;
// set the next-pointer at the end of a node chain
procedure Tail (p : PRegExprChar; val : PRegExprChar);
// regoptail - regtail on operand of first argument; nop if operandless
procedure OpTail (p : PRegExprChar; val : PRegExprChar);
// regnode - emit a node, return location
function EmitNode (op : TREOp) : PRegExprChar;
// emit (if appropriate) a byte of code
procedure EmitC (b : REChar);
// insert an operator in front of already-emitted operand
// Means relocating the operand.
procedure InsertOperator (op : TREOp; opnd : PRegExprChar; sz : integer); //###0.90
// regular expression, i.e. main body or parenthesized thing
function ParseReg (paren : integer; var flagp : integer) : PRegExprChar;
// one alternative of an | operator
function ParseBranch (var flagp : integer) : PRegExprChar;
// something followed by possible [*+?]
function ParsePiece (var flagp : integer) : PRegExprChar;
// the lowest level
function ParseAtom (var flagp : integer) : PRegExprChar;
// current pos in r.e. - for error hanling
function GetCompilerErrorPos : PtrInt;
{$IFDEF UseFirstCharSet} //###0.929
procedure FillFirstCharSet (prog : PRegExprChar);
{$ENDIF}
{===================== Matching section ===================}
// repeatedly match something simple, report how many
function regrepeat (p : PRegExprChar; AMax : PtrInt) : PtrInt;
// dig the "next" pointer out of a node
function regnext (p : PRegExprChar) : PRegExprChar;
// recursively matching routine
function MatchPrim (context: TVarValue; contextNum: Integer; prog : PRegExprChar; Var Pruning: Boolean) : boolean;
// Exec for stored InputString
function ExecPrim (AOffset: PtrInt; Const Anchored: Boolean = False) : boolean;
{$IFDEF RegExpPCodeDump}
function DumpOp (op : REChar) : RegExprString;
{$ENDIF}
function GetSubExprMatchCount : integer;
function GetMatchPos (Idx : integer) : PtrInt;
function GetMatchLen (Idx : integer) : PtrInt;
function GetMatch (Idx : integer) : RegExprString;
function GetInputString : RegExprString;
procedure SetInputString (const AInputString : RegExprString);
{$IFNDEF UseSetOfChar}
function StrScanCI (s : PRegExprChar; ch : REChar) : PRegExprChar; //###0.928
{$ENDIF}
procedure SetLineSeparators (const AStr : RegExprString);
procedure SetLinePairedSeparator (const AStr : RegExprString);
function GetLinePairedSeparator : RegExprString;
public
constructor Create; overload;
constructor Create(AExpression: RegExprString); overload;
destructor Destroy; override;
class function VersionMajor : integer; //###0.944
class function VersionMinor : integer; //###0.944
// Regular expression.
// For optimization, TRegExpr will automatically compiles it into 'P-code'
// (You can see it with help of Dump method) and stores in internal
// structures. Real [re]compilation occures only when it really needed -
// while calling Exec[Next], Substitute, Dump, etc
// and only if Expression or other P-code affected properties was changed
// after last [re]compilation.
// If any errors while [re]compilation occures, Error method is called
// (by default Error raises exception - see below)
property Expression : RegExprString read GetExpression write SetExpression;
// Set/get default values of r.e.syntax modifiers. Modifiers in
// r.e. (?ismx-ismx) will replace this default values.
// If you try to set unsupported modifier, Error will be called
// (by defaul Error raises exception ERegExpr).
property ModifierStr : RegExprString read GetModifierStr write SetModifierStr;
// Modifier /i - caseinsensitive, initialized from RegExprModifierI
property ModifierI : boolean index 1 read GetModifier write SetModifier;
// Modifier /r - use r.e.syntax extended for russian,
// (was property ExtSyntaxEnabled in previous versions)
// If true, then а-я additional include russian letter 'ё',
// А-Я additional include 'Ё', and а-Я include all russian symbols.
// You have to turn it off if it can interfere with you national alphabet.
// , initialized from RegExprModifierR
property ModifierR : boolean index 2 read GetModifier write SetModifier;
// Modifier /s - '.' works as any char (else as [^\n]),
// , initialized from RegExprModifierS
property ModifierS : boolean index 3 read GetModifier write SetModifier;
// Switching off modifier /g switchs all operators in
// non-greedy style, so if ModifierG = False, then
// all '*' works as '*?', all '+' as '+?' and so on.
// , initialized from RegExprModifierG
property ModifierG : boolean index 4 read GetModifier write SetModifier;
// Treat string as multiple lines. That is, change `^' and `$' from
// matching at only the very start or end of the string to the start
// or end of any line anywhere within the string.
// , initialized from RegExprModifierM
property ModifierM : boolean index 5 read GetModifier write SetModifier;
// Modifier /x - eXtended syntax, allow r.e. text formatting,
// see description in the help. Initialized from RegExprModifierX
property ModifierX : boolean index 6 read GetModifier write SetModifier;
property Execs : Integer read nExecs write nExecs;
// match a programm against a string AInputString
// !!! Exec store AInputString into InputString property
// For Delphi 5 and higher available overloaded versions - first without
// parameter (uses already assigned to InputString property value)
// and second that has PtrInt parameter and is same as ExecPos
function Exec (const AInputString : RegExprString) : boolean; {$IFDEF OverMeth} overload;
{$IFNDEF FPC} // I do not know why FreePascal cannot overload methods with empty param list
function Exec : boolean; overload; //###0.949
{$ENDIF}
function Exec (AOffset: PtrInt; Const Anchored: Boolean = False) : boolean; overload; //###0.949
{$ENDIF}
procedure RewindAndClear;
function FindNode(ID: Integer): TVarStruct;
procedure SetDB(base: TFastDB);
procedure SetENV(_ENV: TXPathEnvironment);
procedure StartTransaction;
procedure Commit;
procedure RollBack;
// find next match:
// ExecNext;
// works the same as
// if MatchLen [0] = 0 then ExecPos (MatchPos [0] + 1)
// else ExecPos (MatchPos [0] + MatchLen [0]);
// but it's more simpler !
// Raises exception if used without preceeding SUCCESSFUL call to
// Exec* (Exec, ExecPos, ExecNext). So You always must use something like
// if Exec (InputString) then repeat { proceed results} until not ExecNext;
function ExecNext(Const Anchored: Boolean = False): boolean;
// find match for InputString starting from AOffset position
// (AOffset=1 - first char of InputString)
function ExecPos (AOffset: PtrInt {$IFDEF DefParam}= 1{$ENDIF}) : boolean;
// returns current input string (from last Exec call or last assign
// to this property).
// Any assignment to this property clear Match* properties !
property InputString : RegExprString read GetInputString write SetInputString;
// Returns ATemplate with '$&' or '$0' replaced by whole r.e.
// occurence and '$n' replaced by occurence of subexpression #n.
// Since v.0.929 '$' used instead of '\' (for future extensions
// and for more Perl-compatibility) and accept more then one digit.
// If you want place into template raw '$' or '\', use prefix '\'
// Example: '1\$ is $2\\rub\\' -> '1$ is <Match[2]>\rub\'
// If you want to place raw digit after '$n' you must delimit
// n with curly braces '{}'.
// Example: 'a$12bc' -> 'a<Match[12]>bc'
// 'a${1}2bc' -> 'a<Match[1]>2bc'.
function Substitute (const ATemplate : RegExprString) : RegExprString;
// Split AInputStr into APieces by r.e. occurencies
// Internally calls Exec[Next]
procedure Split (AInputStr : RegExprString; APieces : TStrings);
function Replace (AInputStr : RegExprString;
const AReplaceStr : RegExprString;
AUseSubstitution : boolean{$IFDEF DefParam}= False{$ENDIF}) //###0.946
: RegExprString; {$IFDEF OverMeth} overload;
function Replace (AInputStr : RegExprString;
AReplaceFunc : TRegExprReplaceFunction)
: RegExprString; overload;
{$ENDIF}
// Returns AInputStr with r.e. occurencies replaced by AReplaceStr
// If AUseSubstitution is true, then AReplaceStr will be used
// as template for Substitution methods.
// For example:
// Expression := '({-i}block|var)\s*\(\s*([^ ]*)\s*\)\s*';
// Replace ('BLOCK( test1)', 'def "$1" value "$2"', True);
// will return: def 'BLOCK' value 'test1'
// Replace ('BLOCK( test1)', 'def "$1" value "$2"')
// will return: def "$1" value "$2"
// Internally calls Exec[Next]
// Overloaded version and ReplaceEx operate with call-back function,
// so you can implement really complex functionality.
function ReplaceEx (AInputStr : RegExprString;
AReplaceFunc : TRegExprReplaceFunction):
RegExprString;
// Number of subexpressions has been found in last Exec* call.
// If there are no subexpr. but whole expr was found (Exec* returned True),
// then SubExprMatchCount=0, if no subexpressions nor whole
// r.e. found (Exec* returned false) then SubExprMatchCount=-1.
// Note, that some subexpr. may be not found and for such
// subexpr. MathPos=MatchLen=-1 and Match=''.
// For example: Expression := '(1)?2(3)?';
// Exec ('123'): SubExprMatchCount=2, Match[0]='123', [1]='1', [2]='3'
// Exec ('12'): SubExprMatchCount=1, Match[0]='12', [1]='1'
// Exec ('23'): SubExprMatchCount=2, Match[0]='23', [1]='', [2]='3'
// Exec ('2'): SubExprMatchCount=0, Match[0]='2'
// Exec ('7') - return False: SubExprMatchCount=-1
property SubExprMatchCount : integer read GetSubExprMatchCount;
// pos of entrance subexpr. #Idx into tested in last Exec*
// string. First subexpr. has Idx=1, last - MatchCount,
// whole r.e. has Idx=0.
// Returns -1 if in r.e. no such subexpr. or this subexpr.
// not found in input string.
property MatchPos [Idx : integer] : PtrInt read GetMatchPos;
property VarNames [Idx : integer] : PRegExprChar read GetVarName; // Var Names
property VarValues [Idx : integer] : TVarValue read GetVarValue; // Var Names
function ExportPredicates(Const MacroID: String): String;
function ExportXML: String;
function ExportDB: String;
Function ExportPascalDB(Var out: TStringList; Const Offs, vDB: String): Boolean;
procedure AddExtRegExpr(Const Name: String; Const R: TRegExpr);
// len of entrance subexpr. #Idx r.e. into tested in last Exec*
// string. First subexpr. has Idx=1, last - MatchCount,
// whole r.e. has Idx=0.
// Returns -1 if in r.e. no such subexpr. or this subexpr.
// not found in input string.
// Remember - MatchLen may be 0 (if r.e. match empty string) !
property MatchLen [Idx : integer] : PtrInt read GetMatchLen;
// == copy (InputString, MatchPos [Idx], MatchLen [Idx])
// Returns '' if in r.e. no such subexpr. or this subexpr.
// not found in input string.
property Match [Idx : integer] : RegExprString read GetMatch;
// Returns ID of last error, 0 if no errors (unusable if
// Error method raises exception) and clear internal status
// into 0 (no errors).
function LastError : integer;
// Returns Error message for error with ID = AErrorID.
function ErrorMsg (AErrorID : integer) : RegExprString; virtual;
// Returns position in r.e. where compiler stopped.
// Useful for error diagnostics
property CompilerErrorPos : PtrInt read GetCompilerErrorPos;
// Contains chars, treated as /s (initially filled with RegExprSpaceChars
// global constant)
property SpaceChars : RegExprString read fSpaceChars write fSpaceChars; //###0.927
// Contains chars, treated as /w (initially filled with RegExprWordChars
// global constant)
property WordChars : RegExprString read fWordChars write fWordChars; //###0.929
// line separators (like \n in Unix)
property LineSeparators : RegExprString read fLineSeparators write SetLineSeparators; //###0.941
// paired line separator (like \r\n in DOS and Windows).
// must contain exactly two chars or no chars at all
property LinePairedSeparator : RegExprString read GetLinePairedSeparator write SetLinePairedSeparator; //###0.941
// Converts Ch into upper case if it in lower case or in lower
// if it in upper (uses current system local setings)
class function InvertCaseFunction (const Ch : REChar) : REChar;
// Set this property if you want to override case-insensitive functionality.
// Create set it to RegExprInvertCaseFunction (InvertCaseFunction by default)
property InvertCase : TRegExprInvertCaseFunction read fInvertCase write fInvertCase; //##0.935
// [Re]compile r.e. Useful for example for GUI r.e. editors (to check
// all properties validity).
procedure Compile; //###0.941
{$IFDEF RegExpPCodeDump}
// dump a compiled regexp in vaguely comprehensible form
function Dump : RegExprString;
{$ENDIF}
end;
ERegExpr = class (Exception)
public
ErrorCode : integer;
CompilerErrorPos : PtrInt;
end;
const
// default for InvertCase property:
RegExprInvertCaseFunction : TRegExprInvertCaseFunction = {$IFDEF FPC} nil {$ELSE} TRegExpr.InvertCaseFunction{$ENDIF};
function EscapeString(Const S: WideString): WideString;
function UnescapeString(Const S: WideString): WideString;
function EscapeText(Const S: String): String;