-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathtricks_package.adb
More file actions
2221 lines (1765 loc) · 83.1 KB
/
tricks_package.adb
File metadata and controls
2221 lines (1765 loc) · 83.1 KB
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
with TEXT_IO;
with STRINGS_PACKAGE; use STRINGS_PACKAGE;
with WORD_PARAMETERS; use WORD_PARAMETERS;
with DEVELOPER_PARAMETERS; use DEVELOPER_PARAMETERS;
with INFLECTIONS_PACKAGE; use INFLECTIONS_PACKAGE;
with DICTIONARY_PACKAGE; use DICTIONARY_PACKAGE;
with WORD_SUPPORT_PACKAGE; use WORD_SUPPORT_PACKAGE;
with WORD_PACKAGE; use WORD_PACKAGE;
with PUT_STAT;
package body TRICKS_PACKAGE is
function IS_A_VOWEL(C : CHARACTER) return BOOLEAN is
begin
if LOWER_CASE(C) = 'a' or
LOWER_CASE(C) = 'e' or
LOWER_CASE(C) = 'i' or
LOWER_CASE(C) = 'o' or
LOWER_CASE(C) = 'u' or
LOWER_CASE(C) = 'y' then
return TRUE;
else
return FALSE;
end if;
end IS_A_VOWEL;
function A_ROMAN_DIGIT(CHAR : CHARACTER) return BOOLEAN is
begin
case CHAR is
when 'M' | 'm' =>
return TRUE;
when 'D' | 'd' =>
return TRUE;
when 'C' | 'c' =>
return TRUE;
when 'L' | 'l' =>
return TRUE;
when 'X' | 'x' =>
return TRUE;
--when 'U' | 'u' => return TRUE; -- possible but unlikely
when 'V' | 'v' =>
return TRUE;
when 'I' | 'i' =>
return TRUE;
when others =>
return FALSE;
end case;
end A_ROMAN_DIGIT;
function VALUE(CHAR : CHARACTER) return NATURAL is
begin
case CHAR is
when 'M' | 'm' =>
return 1000;
when 'D' | 'd' =>
return 500;
when 'C' | 'c' =>
return 100;
when 'L' | 'l' =>
return 50;
when 'X' | 'x' =>
return 10;
--when 'U' | 'u' => return 5; -- possible but unlikely
when 'V' | 'v' =>
return 5;
when 'I' | 'i' =>
return 1;
when others =>
return 0;
end case;
end VALUE;
function ONLY_ROMAN_DIGITS(S : STRING) return BOOLEAN is
begin
for I in S'range loop
if not A_ROMAN_DIGIT(S(I)) then
return FALSE;
end if;
end loop;
return TRUE;
end ONLY_ROMAN_DIGITS;
function ROMAN_NUMBER(ST : STRING) return NATURAL is
-- Determines and returns the value of a Roman numeral, or 0 if invalid
use TEXT_IO;
TOTAL : NATURAL := 0;
INVALID : exception;
DECREMENTED : BOOLEAN := FALSE;
J : INTEGER := 0;
S : constant STRING := UPPER_CASE(ST);
begin
if ONLY_ROMAN_DIGITS(S) then
--
--NUMERALS IN A STRING ARE ADDED: CC = 200 ; CCX = 210.
--ONE NUMERAL TO THE LEFT of A LARGER NUMERAL IS SUBTRACTED FROM THAT NUMBER: IX = 9
--
--SUBTRACT ONLY A SINGLE LETTER FROM A SINGLE NUMERAL.
--VIII FOR 8, NOT IIX; 19 IS XIX, NOT IXX.
--
--SUBTRACT ONLY POWERS of TEN, SUCH AS I, X, or C.
--NOT VL FOR 45, BUT XLV.
--
--DON'T SUBTRACT A LETTER FROM ANOTHER LETTER MORE THAN TEN TIMES GREATER.
--ONLY SUBTRACT I FROM V or X, and X FROM L or C.
--NOT IL FOR 49, BUT XLIX. MIM is ILLEGAL.
--
--ONLY IF ANY NUMERAL PRECEEDING IS AT LEAST TEN TIMES LARGER.
--NOT VIX FOR 14, BUT XIV.
--NOT IIX, BUT VIII.
--ONLY IF ANY NUMERAL FOLLOWING IS SMALLER.
--NOT XCL FOR 140, BUT CXL.
--
J := S'LAST;
EVALUATE:
while J >= S'FIRST loop
--
--Legal in the Ones position
-- I
-- II
-- III
-- IIII IV
-- V
-- VI
-- VII
-- VIII
-- VIIII IX
--
--
-- Ones
if S(J) = 'I' then
TOTAL := TOTAL + 1;
J := J - 1;
exit EVALUATE when J < S'FIRST;
whiLe S(J) = 'I' loop
TOTAL := TOTAL + 1;
if TOTAL >= 5 then raise INVALID; end if;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end loop;
end if;
if S(J) = 'V' then
TOTAL := TOTAL + 5;
J := J - 1;
exit EVALUATE when J < S'FIRST;
if S(J) = 'I' and TOTAL = 5 then
TOTAL := TOTAL - 1;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' then raise INVALID; end if;
end if;
--
--Legal in the tens position
-- X
-- XX
-- XXX
-- XXXX XL
-- L
-- LX
-- LXX
-- LXXX
-- LXXXX XC
--
-- Tens
if S(J) = 'X' then
TOTAL := TOTAL + 10;
J := J - 1;
exit EVALUATE when J < S'FIRST;
whiLe S(J) = 'X' loop
TOTAL := TOTAL + 10;
if TOTAL >= 50 then raise INVALID; end if;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end loop;
if S(J) = 'I' and TOTAL = 10 then
TOTAL := TOTAL - 1;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' then
raise INVALID;
end if;
end if;
if S(J) = 'L' then
TOTAL := TOTAL + 50;
J := J - 1;
exit EVALUATE when J < S'FIRST;
if S(J) = 'X' and TOTAL <= 59 then
TOTAL := TOTAL - 10;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' or S(J) = 'X' or S(J) = 'L' then raise INVALID; end if;
if S(J) = 'C' then
TOTAL := TOTAL + 100;
J := J - 1;
exit EVALUATE when J < S'FIRST;
if S(J) = 'X' and TOTAL = 100 then
TOTAL := TOTAL - 10;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
end if;
if S(J) = 'I' or S(J) = 'V' or S(J) = 'X' or S(J) = 'L' then raise INVALID; end if;
end if;
if S(J) = 'C' then
TOTAL := TOTAL + 100;
J := J - 1;
exit EVALUATE when J < S'FIRST;
whiLe S(J) = 'C' loop
TOTAL := TOTAL + 100;
if TOTAL >= 500 then raise INVALID; end if;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end loop;
if S(J) = 'X' and TOTAL <= 109 then
TOTAL := TOTAL - 10;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' or S(J) = 'X' or S(J) = 'L' then raise INVALID; end if;
end if;
if S(J) = 'D' then
TOTAL := TOTAL + 500;
J := J - 1;
exit EVALUATE when J < S'FIRST;
if S(J) = 'C' and TOTAL <= 599 then
TOTAL := TOTAL - 100;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'M' then
TOTAL := TOTAL + 1000;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'C' and TOTAL <= 1099 then
TOTAL := TOTAL - 100;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' or S(J) = 'X' or S(J) = 'L' or S(J) = 'C' or S(J) = 'D' then raise INVALID; end if;
end if;
if S(J) = 'M' then
TOTAL := TOTAL + 1000;
J := J - 1;
exit EVALUATE when J < S'FIRST;
whiLe S(J) = 'M' loop
TOTAL := TOTAL + 1000;
if TOTAL >= 5000 then raise INVALID; end if;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end loop;
if S(J) = 'C' and TOTAL <= 1099 then
TOTAL := TOTAL - 100;
J := J - 1;
exit EVALUATE when J < S'FIRST;
end if;
if S(J) = 'I' or S(J) = 'V' or S(J) = 'X' or S(J) = 'L' or S(J) = 'C' or S(J) = 'D' then raise INVALID; end if;
end if;
end loop EVALUATE;
end if; -- On Only Roman digits
return TOTAL;
exception
when INVALID =>
return 0;
when CONSTRAINT_ERROR =>
return 0;
end ROMAN_NUMBER;
procedure ROMAN_NUMERALS(INPUT_WORD : STRING;
PA : in out PARSE_ARRAY; PA_LAST : in out INTEGER) is
W : constant STRING := TRIM(INPUT_WORD);
ROMAN_NUMBER_W : INTEGER := ROMAN_NUMBER(W);
begin
if ONLY_ROMAN_DIGITS(W) and then (ROMAN_NUMBER_W /= 0) then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ( STEM => HEAD(W, MAX_STEM_SIZE),
IR => (
QUAL => (
POFS => NUM,
NUM => (
DECL => (2, 0),
CS => X,
NUMBER => X,
GENDER => X,
SORT => CARD) ),
KEY => 0,
ENDING => NULL_ENDING_RECORD,
AGE => X,
FREQ => A),
D_K => RRR,
MNPC => NULL_MNPC);
RRR_MEANING := HEAD(INTEGER'IMAGE(ROMAN_NUMBER_W) & " as a ROMAN NUMERAL;",
MAX_MEANING_SIZE);
else
null; -- Is not ROMAN NUMERAL, so go on and try something else
end if;
end ROMAN_NUMERALS;
function BAD_ROMAN_NUMBER(S : STRING) return NATURAL is
-- Determines and returns the value of a Roman numeral, or 0 if invalid
-- This seems to allow all of Caesar's. Actually there are no rules
-- if you look at some of the 12-15 century stuff
use TEXT_IO;
TOTAL : INTEGER := 0;
DECREMENTED_FROM : INTEGER := 0;
begin
-- Already known that all the characters may be valid numerals
-- Loop over the string to check validity, start with second place
--PUT_LINE(" In function BAD_ROMAN_NUMBER ");
--PUT_LINE(" BEFORE LOOP S = " & S);
TOTAL := VALUE(S(S'LAST));
DECREMENTED_FROM := VALUE(S(S'LAST));
for I in reverse S'FIRST..S'LAST-1 loop
if VALUE(S(I)) < VALUE(S(I+1)) then
-- Decrement
TOTAL := TOTAL - VALUE(S(I));
DECREMENTED_FROM := VALUE(S(I+1));
elsif VALUE(S(I)) = VALUE(S(I+1)) then
if VALUE(S(I)) < DECREMENTED_FROM then
TOTAL := TOTAL - VALUE(S(I)); -- IIX = 8 !
else
TOTAL := TOTAL + VALUE(S(I));
end if;
elsif VALUE(S(I)) > VALUE(S(I+1)) then
TOTAL := TOTAL + VALUE(S(I));
DECREMENTED_FROM := VALUE(S(I+1));
end if;
end loop;
if TOTAL > 0 then
return TOTAL;
else
return 0;
end if;
exception
when others =>
return 0;
end BAD_ROMAN_NUMBER;
procedure SYNCOPE(W : STRING;
PA : in out PARSE_ARRAY; PA_LAST : in out INTEGER) is
S : constant STRING(1..W'LENGTH) := LOWER_CASE(W);
PA_SAVE : INTEGER := PA_LAST;
SYNCOPE_INFLECTION_RECORD : INFLECTION_RECORD := NULL_INFLECTION_RECORD;
-- ((V, ((0, 0), (X, X, X), 0, X, X)), 0, NULL_ENDING_RECORD, X, A);
begin
-- Syncopated forms (see Gildersleeve and Lodge, 131)
YYY_MEANING := NULL_MEANING_TYPE;
-- This one has to go first -- special for 3 4
-- ivi => ii , in perfect (esp. for V 3 4)
-- This is handled in WORDS as syncope
-- It seems to appear in texts as alternative stems ii and ivi
for I in reverse S'FIRST..S'LAST-1 loop
if (S(I..I+1) = "ii") then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ("Syncope ii => ivi", SYNCOPE_INFLECTION_RECORD,
YYY, NULL_MNPC);
WORD(S(S'FIRST..I) & "v" & S(I+1..S'LAST), PA, PA_LAST);
if PA_LAST > PA_SAVE + 1 then
exit;
end if;
end if;
PA_LAST := PA_SAVE; -- No luck, or it would have exited above
end loop;
if PA_LAST > PA_SAVE + 1 and then
PA(PA_LAST).IR.QUAL.POFS = V and then
--PA(PA_LAST).IR.QUAL.V.CON = (3, 4)/(6, 1) and then
PA(PA_LAST).IR.KEY = 3 then -- Perfect system
YYY_MEANING := HEAD(
"Syncopated perfect ivi can drop 'v' without contracting vowel "
, MAX_MEANING_SIZE);
PUT_STAT("SYNCOPE ivi at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
-- avis => as, evis => es, ivis => is, ovis => os in perfect
for I in reverse S'FIRST..S'LAST-2 loop -- Need isse
if ((S(I..I+1) = "as") or
(S(I..I+1) = "es") or
(S(I..I+1) = "is") or
(S(I..I+1) = "os")) then
--TEXT_IO.PUT_LINE("SYNCOPE vis S = " & S & " PA_SAVE = " & INTEGER'IMAGE(PA_SAVE));
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ("Syncope s => vis", SYNCOPE_INFLECTION_RECORD,
YYY, NULL_MNPC);
--TEXT_IO.PUT_LINE("SYNCOPE vis S+ = " & S(S'FIRST..I) & "vi" & S(I+1..S'LAST) & " " & INTEGER'IMAGE(PA_LAST));
WORD(S(S'FIRST..I) & "vi" & S(I+1..S'LAST), PA, PA_LAST);
--TEXT_IO.PUT_LINE("SYNCOPE vis DONE " & " PA_LAST = " & INTEGER'IMAGE(PA_LAST));
if PA_LAST > PA_SAVE + 1 then
exit; -- Exit loop here if SYNCOPE found hit
end if;
end if;
PA_LAST := PA_SAVE; -- No luck, or it would have exited above
end loop;
-- Loop over the resulting solutions
if PA_LAST > PA_SAVE + 1 and then
PA(PA_LAST).IR.QUAL.POFS = V and then
PA(PA_LAST).IR.KEY = 3 then -- Perfect system
YYY_MEANING := HEAD(
"Syncopated perfect often drops the 'v' and contracts vowel "
, MAX_MEANING_SIZE);
PUT_STAT("SYNCOPE vis at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
end if;
-- end loop; -- over resulting solutions
if PA_LAST > PA_SAVE + 1 then
return;
else
PA_LAST := PA_SAVE;
end if;
-- aver => ar, ever => er, in perfect
for I in reverse S'FIRST+1..S'LAST-2 loop
if ((S(I..I+1) = "ar") or
(S(I..I+1) = "er") or
(S(I..I+1) = "or")) then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ("Syncope r => v.r", SYNCOPE_INFLECTION_RECORD,
YYY, NULL_MNPC);
WORD(S(S'FIRST..I) & "ve" & S(I+1..S'LAST), PA, PA_LAST);
if PA_LAST > PA_SAVE + 1 then
exit;
end if;
end if;
PA_LAST := PA_SAVE; -- No luck, or it would have exited above
end loop;
if PA_LAST > PA_SAVE + 1 and then
PA(PA_LAST).IR.QUAL.POFS = V and then
PA(PA_LAST).IR.KEY = 3 then -- Perfect system
YYY_MEANING := HEAD(
"Syncopated perfect often drops the 'v' and contracts vowel "
, MAX_MEANING_SIZE);
PUT_STAT("SYNCOPE ver at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
-- iver => ier, in perfect
for I in reverse S'FIRST..S'LAST-3 loop
if (S(I..I+2) = "ier") then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ("Syncope ier=>iver", SYNCOPE_INFLECTION_RECORD,
YYY, NULL_MNPC);
WORD(S(S'FIRST..I) & "v" & S(I+1..S'LAST), PA, PA_LAST);
if PA_LAST > PA_SAVE + 1 then
exit;
end if;
end if;
PA_LAST := PA_SAVE; -- No luck, or it would have exited above
end loop;
if PA_LAST > PA_SAVE + 1 and then
PA(PA_LAST).IR.QUAL.POFS = V and then
PA(PA_LAST).IR.KEY = 3 then -- Perfect system
YYY_MEANING := HEAD(
"Syncopated perfect often drops the 'v' and contracts vowel "
, MAX_MEANING_SIZE);
PUT_STAT("SYNCOPE ier at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
-- -- sis => s, xis => x, in perfect
for I in reverse S'FIRST..S'LAST-2 loop
if ((S(I) = 's') or
(S(I) = 'x')) then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := ("Syncope s/x => +is", SYNCOPE_INFLECTION_RECORD,
YYY, NULL_MNPC);
WORD(S(S'FIRST..I) & "is" & S(I+1..S'LAST), PA, PA_LAST);
if PA_LAST > PA_SAVE + 1 then
exit; -- Exit loop here if SYNCOPE found hit
end if;
end if;
PA_LAST := PA_SAVE; -- No luck, or it would have exited above
end loop;
-- Loop over the resulting solutions
if PA_LAST > PA_SAVE + 1 and then
PA(PA_LAST).IR.QUAL.POFS = V and then
PA(PA_LAST).IR.KEY = 3 then -- Perfect system
YYY_MEANING := HEAD(
"Syncopated perfect sometimes drops the 'is' after 's' or 'x' "
, MAX_MEANING_SIZE);
PUT_STAT("SYNCOPEx/sis at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
-- end loop; -- over resulting solutions
if PA_LAST > PA_SAVE + 1 then
return;
else
PA_LAST := PA_SAVE;
end if;
PA(PA_LAST+1) := NULL_PARSE_RECORD; -- Just to clear the trys
exception
when others =>
PA_LAST := PA_SAVE;
PA(PA_LAST+1) := NULL_PARSE_RECORD; -- Just to clear the trys
end SYNCOPE;
procedure TRY_TRICKS(W : STRING;
PA : in out PARSE_ARRAY; PA_LAST : in out INTEGER;
LINE_NUMBER : INTEGER; WORD_NUMBER : INTEGER) is
-- Since the chances are 1/1000 that we have one,
-- Ignore the possibility of two in the same word
-- That is called lying with statistics
use INFLECTIONS_PACKAGE.INTEGER_IO;
S : constant STRING(1..W'LENGTH) := W;
PA_SAVE : INTEGER := PA_LAST;
procedure TWORD(W : STRING;
PA : in out PARSE_ARRAY; PA_LAST : in out INTEGER) is
begin
WORD_PACKAGE.WORD(W, PA, PA_LAST);
SYNCOPE(W, PA, PA_LAST);
end TWORD;
procedure FLIP(X1, X2 : STRING; EXPLANATION : STRING := "") is
-- At the begining of input word, replaces X1 by X2
PA_SAVE : INTEGER := PA_LAST;
begin
if S'LENGTH >= X1'LENGTH+2 and then
S(S'FIRST..S'FIRST+X1'LENGTH-1) = X1 then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := (HEAD("Word mod " & X1 & "/" & X2, MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
TWORD(X2 & S(S'FIRST+X1'LENGTH..S'LAST), PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) and then
(PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
if EXPLANATION = "" then
XXX_MEANING := HEAD(
"An initial '" & X1 & "' may have replaced usual '" & X2 & "'"
, MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK FLIP at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
PA_LAST := PA_SAVE;
end FLIP;
procedure FLIP_FLOP(X1, X2 : STRING; EXPLANATION : STRING := "") is
-- At the begining of input word, replaces X1 by X2 - then X2 by X1
-- To be uesd only when X1 and X2 start with the same letter because it
-- will be called from a point where the first letter is established
PA_SAVE : INTEGER := PA_LAST;
begin
--TEXT_IO.PUT_LINE("FLIP_FLOP called " & X1 & " " & X2);
if S'LENGTH >= X1'LENGTH+2 and then
S(S'FIRST..S'FIRST+X1'LENGTH-1) = X1 then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := (HEAD("Word mod " & X1 & "/" & X2, MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
--TEXT_IO.PUT_LINE("Trying " & X2 & S(S'FIRST+X1'LENGTH..S'LAST));
TWORD(X2 & S(S'FIRST+X1'LENGTH..S'LAST), PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) and then
(PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
--TEXT_IO.PUT_LINE("FLIPF worked");
if EXPLANATION = "" then
XXX_MEANING := HEAD(
"An initial '" & X1 & "' may be rendered by '" & X2 & "'"
, MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK FLIPF at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
--TEXT_IO.PUT_LINE("FLIPF failed");
--TEXT_IO.PUT_LINE("Try FFLOP");
if S'LENGTH >= X2'LENGTH+2 and then
S(S'FIRST..S'FIRST+X2'LENGTH-1) = X2 then
--TEXT_IO.PUT_LINE("Trying FFLOP");
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := (HEAD("Word mod " & X2 & "/" & X1, MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
--TEXT_IO.PUT_LINE("Trying " & X1 & S(S'FIRST+X2'LENGTH..S'LAST));
TWORD(X1 & S(S'FIRST+X2'LENGTH..S'LAST), PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) and then
(PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
--TEXT_IO.PUT_LINE("FFLOP worked");
if EXPLANATION = "" then
XXX_MEANING := HEAD(
"An initial '" & X2 & "' may be rendered by '" & X1 & "'"
, MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK FFLOP at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
--TEXT_IO.PUT_LINE("FFLIP failed");
PA_LAST := PA_SAVE;
end FLIP_FLOP;
procedure INTERNAL(X1, X2 : STRING; EXPLANATION : STRING := "") is
-- Replaces X1 with X2 anywhere in word and tries it for validity
PA_SAVE : INTEGER := PA_LAST;
begin
for I in S'FIRST..S'LAST-X1'LENGTH+1 loop
if S(I..I+X1'LENGTH-1) = X1 then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := (HEAD("Word mod " & X1 & "/" & X2, MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
TWORD(S(S'FIRST..I-1) & X2 & S(I+X1'LENGTH..S'LAST), PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) and then
(PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
if EXPLANATION = "" then
XXX_MEANING := HEAD(
"An internal '" & X1 & "' might be rendered by '" & X2 & "'"
, MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK INTR at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
end loop;
PA_LAST := PA_SAVE;
end INTERNAL;
procedure ADJ_TERMINAL_IIS(EXPLANATION : STRING := "") is
PA_SAVE : INTEGER := PA_LAST;
I : INTEGER := 0;
TRICK_TRANSLATION_RECORD : TRANSLATION_RECORD := NULL_TRANSLATION_RECORD;
begin
if S'LENGTH > 3 and then
S(S'LAST-1..S'LAST) = "is" then -- Terminal 'is'
PA_LAST := PA_LAST + 1;
TRICK_TRANSLATION_RECORD.FREQ := C;
PA(PA_LAST) := (HEAD("Word mod iis -> is", MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
WORD(S(S'FIRST..S'LAST-2) & "iis", PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) then
I := PA_LAST;
while I > PA_SAVE + 1 loop
if PA(I).IR.QUAL.POFS = ADJ and then
PA(I).IR.QUAL.ADJ.DECL = (1, 1) and then
((PA(I).IR.QUAL.ADJ.CS = DAT) or
(PA(I).IR.QUAL.ADJ.CS = ABL)) and then
PA(I).IR.QUAL.ADJ.NUMBER = P then
null; -- Only for ADJ 1 1 DAT/ABL P
else
PA(I..PA_LAST-1) := PA(I+1..PA_LAST);
PA_LAST := PA_LAST - 1;
end if;
I := I - 1;
end loop;
end if;
if (PA_LAST > PA_SAVE + 1) then
if EXPLANATION = "" then
XXX_MEANING := HEAD("A Terminal 'iis' on ADJ 1 1 DAT/ABL P might drop 'i'",
MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK ADJIS at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
PA_LAST := PA_SAVE;
end ADJ_TERMINAL_IIS;
-- Now SLUR is handled in TRY_SLURY
--
-- procedure SLUR(X1 : STRING; EXPLANATION : STRING := "") is
-- PA_SAVE : INTEGER := PA_LAST;
-- SL : INTEGER := X1'LENGTH;
-- begin
-- if S'LENGTH >= X1'LENGTH+2 then
-- if S(S'FIRST..S'FIRST+X1'LENGTH-1) = X1 and then -- Initial X1
-- not IS_A_VOWEL(S(S'FIRST+SL)) then
-- PA_LAST := PA_LAST + 1;
-- PA(PA_LAST) := (HEAD("Slur " & X1 & "/" & X1(1..SL-1) & "~", MAX_STEM_SIZE),
-- NULL_INFLECTION_RECORD,
-- XXX, NULL_MNPC);
-- TWORD(X1(1..SL-1) & S(S'FIRST+SL) & S(S'FIRST+SL..S'LAST), PA, PA_LAST);
-- if (PA_LAST > PA_SAVE + 1) and then
-- (PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
-- if EXPLANATION = "" then
-- XXX_MEANING := HEAD(
-- "An initial '" & X1 & "' may be rendered by " & X1(1) & "~"
-- , MAX_MEANING_SIZE);
-- else
-- XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
-- end if;
--PUT_STAT("TRICK SLUR at "
-- & HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
-- & " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
-- return;
-- else
-- PA_LAST := PA_SAVE;
-- end if;
--
-- elsif (S(S'FIRST..S'FIRST+SL-1) = X1(1..SL-1)) and then
-- (S(S'FIRST+SL-1) = S(S'FIRST+SL)) and then -- Double letter
-- not IS_A_VOWEL(S(S'FIRST+SL)) then
-- PA_LAST := PA_LAST + 1;
-- PA(PA_LAST) := (HEAD("Slur " & X1(1..SL-1) & "~" & "/" & X1, MAX_STEM_SIZE),
-- NULL_INFLECTION_RECORD,
-- XXX, NULL_MNPC);
-- TWORD(X1 & S(S'FIRST+SL..S'LAST), PA, PA_LAST);
-- if (PA_LAST > PA_SAVE + 1) and then
-- (PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
-- if EXPLANATION = "" then
-- XXX_MEANING := HEAD(
-- "An initial '" & X1(1..SL-1) & "~" & "' may be rendered by " & X1
-- , MAX_MEANING_SIZE);
-- else
-- XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
-- end if;
--PUT_STAT("TRICK SLUR at "
-- & HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
-- & " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
-- return;
-- else
-- PA_LAST := PA_SAVE;
-- end if;
--
-- end if;
-- end if;
-- PA_LAST := PA_SAVE;
-- end SLUR;
--
--
procedure DOUBLE_CONSONANTS(EXPLANATION : STRING := "") is
PA_SAVE : INTEGER := PA_LAST;
begin
-- Medieval often replaced a classical doubled consonant with single
-- The problem is to take possible medieval words
-- and double (all) (isolated) consonants
for I in S'FIRST+1..S'LAST-1 loop -- probably dont need to go to end
if (not IS_A_VOWEL(S(I))) and then
(IS_A_VOWEL(S(I-1)) and IS_A_VOWEL(S(I+1))) then
PA_LAST := PA_LAST + 1;
PA(PA_LAST) := (HEAD("Word mod " & S(I) &
" -> " & S(I) & S(I), MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
TWORD(S(S'FIRST..I) & S(I) & S(I+1..S'LAST), PA, PA_LAST);
--TEXT_IO.PUT_LINE(S(S'FIRST..I) & S(I) & S(I+1..S'LAST));
if (PA_LAST > PA_SAVE + 1) and then
(PA(PA_LAST-1).IR.QUAL.POFS /= TACKON) then
if EXPLANATION = "" then
XXX_MEANING := HEAD(
"A doubled consonant may be rendered by just the single"
& " MEDIEVAL", MAX_MEANING_SIZE);
else
XXX_MEANING := HEAD(EXPLANATION, MAX_MEANING_SIZE);
end if;
PUT_STAT("TRICK 2CON at "
& HEAD(INTEGER'IMAGE(LINE_NUMBER), 8) & HEAD(INTEGER'IMAGE(WORD_NUMBER), 4)
& " " & HEAD(W, 20) & " " & PA(PA_SAVE+1).STEM);
return;
else
PA_LAST := PA_SAVE;
end if;
end if;
end loop;
PA_LAST := PA_SAVE;
end DOUBLE_CONSONANTS;
procedure TWO_WORDS(EXPLANATION : STRING := "") is
-- This procedure examines the word to determine if it is made up
-- of two separate inflectted words
-- They are usually an adjective and a noun or two nouns
PA_SAVE, PA_SECOND : INTEGER := PA_LAST;
NUM_HIT_ONE, NUM_HIT_TWO : BOOLEAN := FALSE;
--MID : INTEGER := S'LENGTH/2;
I, I_MID : INTEGER := 0;
REMEMBER_SYNCOPE : BOOLEAN := FALSE;
procedure WORDS_NO_SYNCOPE (W : STRING;
PA : in out PARSE_ARRAY; PA_LAST : in out INTEGER) is
begin
if WORDS_MDEV(DO_SYNCOPE) then
REMEMBER_SYNCOPE := TRUE;
WORDS_MDEV(DO_SYNCOPE) := FALSE;
end if;
WORD_PACKAGE.WORD(W, PA, PA_LAST);
if REMEMBER_SYNCOPE then
WORDS_MDEV(DO_SYNCOPE) := TRUE;
end if;
end WORDS_NO_SYNCOPE;
function COMMON_PREFIX(S : STRING) return BOOLEAN is
-- Common prefixes that have corresponding words (prepositions usually)
-- which could confuse TWO_WORDS. We wish to reject these.
begin
if S = "dis" or
S = "ex" or
S = "in" or
S = "per" or
S = "prae" or
S = "pro" or
S = "re" or
S = "si" or
S = "sub" or
S = "super" or
S = "trans" then
return TRUE;
else
return FALSE;
end if;
end COMMON_PREFIX;
begin
--TEXT_IO.PUT_LINE("Entering TWO_WORDS PA_LAST = " & INTEGER'IMAGE(PA_LAST));
--if S(S'FIRST) /= 'q' then -- qu words more complicated
if S'LENGTH < 5 then -- Dont try on too short words
return;
end if;
I := 2; -- Smallest is re-publica, but that killed by PREFIX, meipsum
OUTER_LOOP:
while I < S'LENGTH - 2 loop
PA_LAST := PA_LAST + 1;
PA(PA_LAST):= (HEAD("Two words", MAX_STEM_SIZE),
NULL_INFLECTION_RECORD,
XXX, NULL_MNPC);
--TEXT_IO.PUT_LINE("Setting PA TWO_WORDS PA_LAST = " & INTEGER'IMAGE(PA_LAST));
while I < S'LENGTH - 2 loop
--TEXT_IO.PUT_LINE("Trying " & S(S'FIRST..S'FIRST+I-1));
if not COMMON_PREFIX(S(S'FIRST..S'FIRST+I-1)) then
WORDS_NO_SYNCOPE(S(S'FIRST..S'FIRST+I-1), PA, PA_LAST);
if (PA_LAST > PA_SAVE + 1) then
I_MID := I;
for J in PA_SAVE+1..PA_LAST loop
if PA(J).IR.QUAL.POFS = NUM then
NUM_HIT_ONE := TRUE;
exit;
end if;
end loop;
--TEXT_IO.PUT_LINE("HIT first " & S(S'FIRST..I_MID-1) & " PA_LAST = " & INTEGER'IMAGE(PA_LAST));
--PARSE_RECORD_IO.PUT(PA(PA_LAST)); TEXT_IO.NEW_LINE;
exit;
end if;
end if;
I := I + 1;
end loop;
if (PA_LAST > PA_SAVE + 1) then
null;
--TEXT_IO.PUT_LINE("Confirm first " & S(S'FIRST..I_MID) & " PA_LAST =" & INTEGER'IMAGE(PA_LAST));
else
--TEXT_IO.PUT_LINE("No possible first " & S(S'FIRST..I_MID));
PA_LAST := PA_SAVE;
return;
end if;
-- Now for second word
--TEXT_IO.PUT_LINE("Looking for second >" & S(I_MID+1..S'LAST));
PA_LAST := PA_LAST + 1;