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 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Testsuite Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2011, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision: 1298 $ $Date: 2011-01-11 02:39:40 +0300 (Вт, 11 янв 2011) $
------------------------------------------------------------------------------
-- This test reads test data in AT&T Research regression tests format and
-- Matreshka's corrections for expressions; and execute them.
with Ada.Characters.Conversions;
with Ada.Characters.Wide_Wide_Latin_1;
with Ada.Command_Line;
with Ada.Containers.Hashed_Maps;
with Ada.Containers.Vectors;
with Ada.Exceptions;
with Ada.Integer_Wide_Wide_Text_IO;
with Ada.Strings.Wide_Wide_Maps;
with Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash;
with Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO;
with Ada.Wide_Wide_Text_IO;
with League.Application;
with League.Regexps;
with League.Strings;
procedure Regexp_Ataresearch is
use Ada.Characters.Conversions;
use Ada.Characters.Wide_Wide_Latin_1;
use Ada.Command_Line;
use Ada.Exceptions;
use Ada.Integer_Wide_Wide_Text_IO;
-- use Ada.Strings;
use Ada.Strings.Wide_Wide_Maps;
use Ada.Strings.Wide_Wide_Unbounded;
use Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO;
use Ada.Wide_Wide_Text_IO;
use League.Regexps;
use League.Strings;
package Maps is
new Ada.Containers.Hashed_Maps
(Unbounded_Wide_Wide_String,
Unbounded_Wide_Wide_String,
Wide_Wide_Hash,
"=");
type Pair is record
First : Integer;
Last : Integer;
end record;
package Vectors is new Ada.Containers.Vectors (Natural, Pair);
procedure Do_Test
(Pattern : Universal_String;
Data : Universal_String;
Matches : Wide_Wide_String;
Success : in out Boolean);
function Unescape (Item : Wide_Wide_String) return Universal_String;
procedure Load_Substitutions;
function To_Pairs (Item : Wide_Wide_String) return Vectors.Vector;
Substitutions : Maps.Map;
-------------
-- Do_Test --
-------------
procedure Do_Test
(Pattern : Universal_String;
Data : Universal_String;
Matches : Wide_Wide_String;
Success : in out Boolean)
is
P : Regexp_Pattern;
M : Regexp_Match;
R : Vectors.Vector;
procedure Output;
procedure Output is
begin
New_Line;
Put_Line ("Pattern: '" & To_Wide_Wide_String (Pattern) & ''');
Put_Line ("String: '" & To_Wide_Wide_String (Data) & ''');
Put_Line ("Expected: " & Matches);
Put ("Loaded: ");
for J in R.First_Index .. R.Last_Index loop
Put ('(');
Put (R.Element (J).First, 0);
Put (',');
Put (R.Element (J).Last, 0);
Put (')');
end loop;
New_Line;
Put ("Actual: ");
if M.Is_Matched then
Put ('(');
Put (M.First_Index - 1, 0);
Put (',');
Put (M.Last_Index, 0);
Put (')');
for J in 1 .. M.Capture_Count loop
if M.First_Index (J) = 1 and then M.Last_Index (J) = 0 then
Put ("(?,?)");
else
Put ('(');
Put (M.First_Index (J) - 1, 0);
Put (',');
Put (M.Last_Index (J), 0);
Put (')');
end if;
end loop;
New_Line;
else
Put_Line ("not matched");
end if;
end Output;
begin
P := Compile (Pattern);
M := P.Find_Match (Data);
R := To_Pairs (Matches);
if not M.Is_Matched then
Output;
else
for J in R.First_Index .. R.Last_Index loop
if J = 0 then
if M.First_Index /= R.Element (J).First
or else M.Last_Index /= R.Element (J).Last
then
Success := False;
Output;
exit;
end if;
else
if M.First_Index (J) /= R.Element (J).First
or else M.Last_Index (J) /= R.Element (J).Last
then
Success := False;
Output;
exit;
end if;
end if;
end loop;
end if;
exception
when E : others =>
if Matches (Matches'First) = '(' then
Output;
Put_Line (To_Wide_Wide_String (Exception_Information (E)));
Success := False;
end if;
end Do_Test;
------------------------
-- Load_Substitutions --
------------------------
procedure Load_Substitutions is
Tab_Set : constant Wide_Wide_Character_Set
:= To_Set (Wide_Wide_String'(1 => HT));
File : File_Type;
Buffer : Unbounded_Wide_Wide_String;
Tab_Index : Natural;
Expression : Unbounded_Wide_Wide_String;
Substitution : Unbounded_Wide_Wide_String;
begin
Open (File, In_File, Argument (2), "wcem=8");
while not End_Of_File (File) loop
Get_Line (File, Buffer);
Tab_Index := Index (Buffer, Tab_Set);
Expression := Unbounded_Slice (Buffer, 1, Tab_Index - 1);
Substitution :=
Unbounded_Slice (Buffer, Tab_Index + 1, Length (Buffer));
Trim (Substitution, Tab_Set, Tab_Set);
Substitutions.Insert (Expression, Substitution);
end loop;
Close (File);
end Load_Substitutions;
--------------
-- To_Pairs --
--------------
function To_Pairs (Item : Wide_Wide_String) return Vectors.Vector is
Pairs : Vectors.Vector;
First : Positive := Item'First + 1;
Last : Natural := 0;
Index_First : Positive;
Index_Last : Natural;
begin
loop
Last := First;
while Item (Last) /= ',' loop
Last := Last + 1;
end loop;
Last := Last - 1;
if Item (First .. Last) = "?" then
Index_First := 1;
else
Index_First := Integer'Wide_Wide_Value (Item (First .. Last)) + 1;
end if;
First := Last + 2;
Last := First;
while Item (Last) /= ')' loop
Last := Last + 1;
end loop;
Last := Last - 1;
if Item (First .. Last) = "?" then
Index_Last := 0;
else
Index_Last := Integer'Wide_Wide_Value (Item (First .. Last));
end if;
First := Last + 3;
Pairs.Append ((Index_First, Index_Last));
exit when First > Item'Last;
end loop;
return Pairs;
end To_Pairs;
--------------
-- Unescape --
--------------
function Unescape (Item : Wide_Wide_String) return Universal_String is
-- Result : Universal_String;
Result : Unbounded_Wide_Wide_String;
Index : Positive := Item'First;
begin
if Item = "NULL" then
return To_Universal_String (To_Wide_Wide_String (Result));
end if;
loop
exit when Index > Item'Last;
case Item (Index) is
when '\' =>
Index := Index + 1;
case Item (Index) is
when 'n' =>
Append (Result, LF);
when 'x' =>
Append
(Result,
Wide_Wide_Character'Val
(Integer'Wide_Wide_Value
("16#" & Item (Index + 1 .. Index + 2) & '#')));
Index := Index + 2;
when others =>
Append (Result, '\');
Append (Result, Item (Index));
end case;
when others =>
Append (Result, Item (Index));
end case;
Index := Index + 1;
end loop;
return To_Universal_String (To_Wide_Wide_String (Result));
end Unescape;
File : File_Type;
Buffer : Wide_Wide_String (1 .. 1024);
Last : Natural;
F1_First : Positive;
F1_Last : Natural;
F2_First : Positive;
F2_Last : Natural;
F3_First : Positive;
F3_Last : Natural;
F4_First : Positive;
F4_Last : Natural;
F5_First : Positive;
F5_Last : Natural;
Success : Boolean := True;
begin
Load_Substitutions;
Open (File, In_File, Argument (1), "wcem=8");
while not End_Of_File (File) loop
Get_Line (File, Buffer, Last);
if Last > 4 and then Buffer (1 .. 4) /= "NOTE" then
-- Put_Line (Buffer (1 .. Last));
F1_First := 1;
F1_Last := 0;
F2_First := 1;
F2_Last := 0;
F3_First := 1;
F3_Last := 0;
F4_First := 1;
F4_Last := 0;
F5_First := 1;
F5_Last := 0;
for J in F1_First + 1 .. Last loop
F1_Last := J;
F2_First := J;
if Buffer (J) = HT then
F1_Last := J - 1;
for K in J .. Last loop
F2_First := K;
exit when Buffer (K) /= HT;
end loop;
exit;
end if;
end loop;
for J in F2_First + 1 .. Last loop
F2_Last := J;
F3_First := J;
if Buffer (J) = HT then
F2_Last := J - 1;
for K in J .. Last loop
F3_First := K;
exit when Buffer (K) /= HT;
end loop;
exit;
end if;
end loop;
for J in F3_First + 1 .. Last loop
F3_Last := J;
F4_First := J;
if Buffer (J) = HT then
F3_Last := J - 1;
for K in J .. Last loop
F4_First := K;
exit when Buffer (K) /= HT;
end loop;
exit;
end if;
end loop;
for J in F4_First + 1 .. Last loop
F4_Last := J;
F5_First := J;
if Buffer (J) = HT then
F4_Last := J - 1;
for K in J .. Last loop
F5_First := K;
exit when Buffer (K) /= HT;
end loop;
exit;
end if;
end loop;
for J in F5_First + 1 .. Last loop
F5_Last := J;
if Buffer (J) = HT then
F5_Last := J - 1;
exit;
end if;
end loop;
-- Put_Line (" '" & Buffer (F1_First .. F1_Last) & ''');
-- Put_Line (" '" & Buffer (F2_First .. F2_Last) & ''');
-- Put_Line (" '" & Buffer (F3_First .. F3_Last) & ''');
-- Put_Line (" '" & Buffer (F4_First .. F4_Last) & ''');
-- Put_Line (" '" & Buffer (F5_First .. F5_Last) & ''');
if Substitutions.Contains
(To_Unbounded_Wide_Wide_String (Buffer (F2_First .. F2_Last)))
then
if Substitutions.Element
(To_Unbounded_Wide_Wide_String
(Buffer (F2_First .. F2_Last))) /= "SKIP"
then
Do_Test
(To_Universal_String
(To_Wide_Wide_String
(Substitutions.Element (To_Unbounded_Wide_Wide_String (Buffer (F2_First .. F2_Last))))),
Unescape (Buffer (F3_First .. F3_Last)),
Buffer (F4_First .. F4_Last),
Success);
end if;
else
Do_Test
(To_Universal_String (Buffer (F2_First .. F2_Last)),
Unescape (Buffer (F3_First .. F3_Last)),
Buffer (F4_First .. F4_Last),
Success);
end if;
end if;
end loop;
Close (File);
if not Success then
raise Program_Error;
end if;
end Regexp_Ataresearch;
|