ironwork-exec 0.7.0

ironwork for COBOL: an interpreter over EBCDIC storage
Documentation
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
use super::*;

/// A caller and SUBPROG, which has the alternate entry point PAYMASTR, as in the Programming Guide's
/// example (SC27-8714-03, p. 553).
fn caller_and_subprog(caller: &[String]) -> String {
    [
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. CALLER.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n",
        "       01  REC PIC X(5) VALUE 'HELLO'.\n       01  CODE-X PIC 9 VALUE 7.\n       01  PGM PIC X(8) VALUE 'PAYMASTR'.\n",
        "       PROCEDURE DIVISION.\n",
        &caller.concat(),
        "           GOBACK.\n       END PROGRAM CALLER.\n",
        &subprog(),
    ]
    .concat()
}

fn subprog() -> String {
    [
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. SUBPROG.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n",
        "       01  COUNTER PIC 9 VALUE 0.\n       LINKAGE SECTION.\n       01  PAYREC PIC X(5).\n       01  PAY-CODE PIC 9.\n",
        "       PROCEDURE DIVISION USING PAYREC.\n",
        &line("ADD 1 TO COUNTER"),
        &line("DISPLAY 'SUBPROG ' PAYREC ' ' COUNTER"),
        &line("ENTRY 'PASSED'."),
        &line("EXIT PROGRAM."),
        &line("ENTRY 'PAYMASTR' USING PAYREC PAY-CODE."),
        &line("ADD 1 TO COUNTER"),
        &line("DISPLAY 'PAYMASTR ' PAYREC ' ' PAY-CODE ' ' COUNTER"),
        &line("GOBACK."),
        &line("ENTRY 'NOCODE' USING PAYREC."),
        &line("DISPLAY PAY-CODE"),
        &line("GOBACK."),
        "       END PROGRAM SUBPROG.\n",
    ]
    .concat()
}

pub(super) fn fuzz_seeds() -> Vec<String> {
    vec![
        caller_and_subprog(&[line("CALL 'PAYMASTR' USING REC CODE-X"), line("CALL PGM USING REC CODE-X"), line("CANCEL PGM")]),
        program(
            "",
            "       01  I PIC 9.\n       01  J PIC 9.\n       01  X COMP-2.\n",
            &[
                "       MAIN SECTION.\n",
                &line("PERFORM SW VARYING I FROM 1 BY 1 UNTIL I > 2"),
                &line("    AFTER J FROM I BY 1 UNTIL J > 3"),
                &line("ALTER SW TO PROCEED TO P2"),
                &line("COMPUTE X = FUNCTION RANDOM(I) / J"),
                &line("GO TO P1 P2 DEPENDING ON I."),
                "       SEG SECTION 50.\n       SW.\n",
                &line("GO TO P1."),
                "       P1.\n",
                &line("DISPLAY I NO ADVANCING."),
                "       P2.\n",
                &line("GO TO."),
            ]
            .concat(),
        ),
    ]
}

#[test]
fn a_call_of_an_entry_name_begins_after_the_entry_and_binds_its_using_list() {
    let source = caller_and_subprog(&[line("CALL 'SUBPROG' USING REC"), line("CALL 'PAYMASTR' USING REC CODE-X"), line("CALL 'SUBPROG' USING REC")]);
    let (out, err, ending) = run_unit(&source, vec![], "");
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(out, "SUBPROG HELLO 1\nPAYMASTR HELLO 7 2\nSUBPROG HELLO 3\n");
}

#[test]
fn a_linkage_item_the_entry_does_not_name_has_no_address() {
    let (_, _, ending) = run_unit(&caller_and_subprog(&[line("CALL 'NOCODE' USING REC")]), vec![], "");
    assert_eq!(ending.unwrap_err().code, "S0C4");
}

#[test]
fn a_dynamic_call_of_an_entry_name_has_storage_of_its_own_until_cancelled() {
    let source = caller_and_subprog(&[
        line("CALL 'PAYMASTR' USING REC CODE-X"),
        line("CALL PGM USING REC CODE-X"),
        line("CALL PGM USING REC CODE-X"),
        line("CANCEL PGM"),
        line("CALL PGM USING REC CODE-X"),
        line("CALL 'PAYMASTR' USING REC CODE-X"),
    ]);
    let (out, err, ending) = run_unit(&source, vec![], "");
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(out, "PAYMASTR HELLO 7 1\nPAYMASTR HELLO 7 1\nPAYMASTR HELLO 7 2\nPAYMASTR HELLO 7 1\nPAYMASTR HELLO 7 2\n");
}

#[test]
fn under_dynam_a_call_of_a_literal_entry_name_is_dynamic() {
    let source = format!("       CBL DYNAM\n{}", caller_and_subprog(&[line("CALL 'SUBPROG' USING REC"), line("CALL 'PAYMASTR' USING REC CODE-X")]));
    let (out, err, ending) = run_unit(&source, vec![], "");
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(out, "SUBPROG HELLO 1\nPAYMASTR HELLO 7 1\n");
}

#[test]
fn an_entry_name_in_a_program_library_is_an_alias_of_the_member() {
    let dir = temp("entrylib");
    std::fs::create_dir_all(&dir).unwrap();
    std::fs::write(dir.join("PAYMASTR.cbl"), subprog()).unwrap();
    let source = "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. MAIN.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n       01  REC PIC X(5) VALUE 'LIBRY'.\n       01  C PIC 9 VALUE 3.\n       PROCEDURE DIVISION.\n           CALL 'PAYMASTR' USING REC C\n           CALL 'PAYMASTR' USING REC C\n           GOBACK.\n";
    let (out, err, ending) = run_unit(source, vec![dir], "");
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(out, "PAYMASTR LIBRY 3 1\nPAYMASTR LIBRY 3 2\n");
}

#[test]
fn the_entry_statements_rules_are_compile_errors() {
    let with = |linkage: &str, head: &str, body: &str| {
        compile_errors(&format!(
            "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. T.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n       01  W PIC X.\n       LINKAGE SECTION.\n{linkage}       PROCEDURE DIVISION{head}.\n{body}"
        ))
    };
    let l = "       01  L PIC X.\n";
    assert!(with(l, " RETURNING L", &line("ENTRY 'E'.")).contains("RETURNING cannot have ENTRY"));
    assert!(with(l, "", &[line("ENTRY 'T'."), line("ENTRY 'E'."), line("ENTRY 'E'.")].concat()).matches("already the program's or another ENTRY's").count() == 2);
    assert!(with(l, "", &line("ENTRY 'E' USING W.")).contains("ENTRY 'E' USING W: not an 01 or 77 item of the LINKAGE SECTION"));
    assert!(with(l, "", &line("IF W = 'A' ENTRY 'E' END-IF.")).contains("ENTRY 'E' must be a sentence of its own"));
    let nested = "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. OUTER.\n       PROCEDURE DIVISION.\n           GOBACK.\n       IDENTIFICATION DIVISION.\n       PROGRAM-ID. INNER.\n       PROCEDURE DIVISION.\n           ENTRY 'E'.\n           GOBACK.\n       END PROGRAM INNER.\n       END PROGRAM OUTER.\n";
    assert!(syntax::parse(nested).unwrap_err().message.contains("ENTRY cannot be used in a nested program"));
    assert!(syntax::parse(&program("", "", &line("ENTRY E."))).unwrap_err().message.contains("an alphanumeric literal naming the entry point"));
}

/// `caller_and_subprog` with procedure-pointers PP and PQ, function-pointer FP and pointer PTR in
/// CALLER's WORKING-STORAGE.
fn pointer_caller(caller: &[String]) -> String {
    let pointers = "       01  PP USAGE PROCEDURE-POINTER.\n       01  PQ USAGE PROCEDURE-POINTER.\n       01  FP USAGE FUNCTION-POINTER.\n       01  PTR USAGE POINTER.\n";
    caller_and_subprog(caller).replacen("       PROCEDURE DIVISION.\n", &format!("{pointers}       PROCEDURE DIVISION.\n"), 1)
}

#[test]
fn a_call_through_a_pointer_set_to_entry_enters_the_entry_as_a_call_of_its_name() {
    let source = pointer_caller(&[
        line("SET PP TO ENTRY 'PAYMASTR'"),
        line("CALL PP USING REC CODE-X"),
        line("SET FP TO ENTRY PGM"),
        line("CALL FP USING REC CODE-X"),
        line("CALL FP USING REC CODE-X"),
        line("SET PQ TO ENTRY 'SUBPROG'"),
        line("CALL PQ USING REC"),
        line("IF PP = PQ DISPLAY 'SAME' ELSE DISPLAY 'DIFFERENT' END-IF"),
        line("SET PQ TO ENTRY 'PAYMASTR'"),
        line("IF PP = PQ DISPLAY 'SAME' END-IF"),
        line("SET PQ TO FP"),
        line("CALL PQ USING REC CODE-X"),
        line("SET PP TO NULL"),
        line("IF PP = NULL DISPLAY 'NULL' END-IF"),
    ]);
    let (out, err, ending) = run_unit(&source, vec![], "");
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(out, "PAYMASTR HELLO 7 1\nPAYMASTR HELLO 7 1\nPAYMASTR HELLO 7 2\nSUBPROG HELLO 2\nDIFFERENT\nSAME\nPAYMASTR HELLO 7 3\nNULL\n");
}

#[test]
fn set_to_entry_of_a_name_no_program_has_abends_at_the_set() {
    let (out, _, ending) = run_unit(&pointer_caller(&[line("SET PP TO ENTRY 'NOSUCH'"), line("DISPLAY 'AFTER'")]), vec![], "");
    assert_eq!(out, "");
    assert_eq!(ending.unwrap_err().code, "S806");
}

#[test]
fn set_to_entry_takes_pointer_receivers_and_an_alphanumeric_entry() {
    let errors = |body: &str| compile_errors(&pointer_caller(&[line(body)]));
    assert!(errors("SET REC TO ENTRY 'SUBPROG'").contains("SET REC TO ENTRY: the receiver must be a procedure-pointer or function-pointer"));
    assert!(errors("SET PP TO ENTRY 12").contains("SET PP TO ENTRY: the entry literal must be alphanumeric"));
    assert!(errors("SET PP TO ENTRY CODE-X").contains("SET PP TO ENTRY: CODE-X must be an alphanumeric or alphabetic item"));
    assert!(errors("SET PP FP TO ENTRY FUNCTION UPPER-CASE(PGM)").contains("SET PP FP TO ENTRY: FUNCTION UPPER-CASE is an intrinsic function"));
    assert!(errors("SET PP TO REC").contains("SET PP TO: a function-pointer or procedure-pointer takes another, a pointer, ENTRY or NULL"));
    assert!(compile_errors(&pointer_caller(&[line("SET PP FP TO ENTRY PGM"), line("SET PP TO PTR")])).is_empty());
}

#[test]
fn alter_changes_where_a_paragraphs_go_to_goes() {
    let out = run(&program(
        "",
        "       01  D PIC 9 VALUE 0.\n",
        &[
            "       MAIN-LINE.\n",
            &line("PERFORM SWITCH THRU SWITCH-EXIT"),
            &line("ALTER SWITCH TO PROCEED TO SECOND-P"),
            &line("PERFORM SWITCH THRU SWITCH-EXIT"),
            &line("ALTER SWITCH TO FIRST-P"),
            &line("PERFORM SWITCH THRU SWITCH-EXIT"),
            &line("PERFORM NOT-YET THRU NOT-YET-EXIT"),
            &line("ALTER NOT-YET TO NOT-YET-EXIT"),
            &line("PERFORM NOT-YET THRU NOT-YET-EXIT"),
            &line("GO TO P1 P2 DEPENDING ON D"),
            &line("MOVE 2 TO D"),
            &line("GO TO P1 P2 DEPENDING ON D."),
            "       P1.\n",
            &line("DISPLAY 'P1'."),
            "       P2.\n",
            &line("DISPLAY 'P2'"),
            &line("STOP RUN."),
            "       SWITCH.\n",
            &line("GO TO FIRST-P."),
            "       FIRST-P.\n",
            &line("DISPLAY 'FIRST'"),
            &line("GO TO SWITCH-EXIT."),
            "       SECOND-P.\n",
            &line("DISPLAY 'SECOND'."),
            "       SWITCH-EXIT.\n",
            &line("EXIT."),
            "       NOT-YET.\n",
            &line("GO TO."),
            "       FELL-THROUGH.\n",
            &line("DISPLAY 'FELL THROUGH'."),
            "       NOT-YET-EXIT.\n",
            &line("EXIT."),
        ]
        .concat(),
    ));
    assert_eq!(out, "FIRST\nSECOND\nFIRST\nFELL THROUGH\nP2\n");
}

#[test]
fn an_altered_go_to_is_put_back_by_cancel_and_by_initial_but_kept_between_calls() {
    let sub = |initial: &str| {
        [
            &format!("       IDENTIFICATION DIVISION.\n       PROGRAM-ID. SUB{initial}.\n       PROCEDURE DIVISION.\n"),
            "       SWITCH.\n",
            &line("GO TO FIRST-P."),
            "       FIRST-P.\n",
            &line("DISPLAY 'FIRST'"),
            &line("ALTER SWITCH TO SECOND-P"),
            &line("GOBACK."),
            "       SECOND-P.\n",
            &line("DISPLAY 'SECOND'"),
            &line("GOBACK."),
            "       END PROGRAM SUB.\n",
        ]
        .concat()
    };
    let main = |initial: &str| {
        [
            "       CBL DYNAM\n       IDENTIFICATION DIVISION.\n       PROGRAM-ID. MAIN.\n       PROCEDURE DIVISION.\n",
            &line("CALL 'SUB'"),
            &line("CALL 'SUB'"),
            &line("CANCEL 'SUB'"),
            &line("CALL 'SUB'"),
            &line("GOBACK."),
            "       END PROGRAM MAIN.\n",
            &sub(initial),
        ]
        .concat()
    };
    assert_eq!(run_unit(&main(""), vec![], "").0, "FIRST\nSECOND\nFIRST\n");
    assert_eq!(run_unit(&main(" IS INITIAL"), vec![], "").0, "FIRST\nFIRST\nFIRST\n");
}

/// MAIN calls SUB twice, and SUB calls INNER, which it contains; each counts its calls in
/// WORKING-STORAGE.
fn nested_counters(card: &str, inner: &str) -> String {
    let counter = |id: &str, call: &str| {
        [
            format!("       IDENTIFICATION DIVISION.\n       PROGRAM-ID. {id}.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n"),
            "       01  N PIC 9 VALUE 0.\n       PROCEDURE DIVISION.\n".into(),
            line("ADD 1 TO N"),
            line(&format!("DISPLAY '{}' N", &id[..3])),
            call.into(),
            line("GOBACK."),
        ]
        .concat()
    };
    [
        card,
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. MAIN.\n       PROCEDURE DIVISION.\n",
        &line("CALL 'SUB'"),
        &line("CALL 'SUB'"),
        &line("GOBACK."),
        &counter("SUB", &line("CALL 'INNER'")),
        &counter(inner, ""),
        "       END PROGRAM INNER.\n       END PROGRAM SUB.\n       END PROGRAM MAIN.\n",
    ]
    .concat()
}

#[test]
fn the_initial_option_makes_every_program_of_the_source_initial_and_noinitial_leaves_is_initial_alone() {
    let run = |card: &str, inner: &str| run_unit(&nested_counters(card, inner), vec![], "").0;
    assert_eq!(run("", "INNER"), "SUB1\nINN1\nSUB2\nINN2\n");
    assert_eq!(run("       CBL INITIAL\n", "INNER"), "SUB1\nINN1\nSUB1\nINN1\n");
    assert_eq!(run("       PROCESS INITIAL,NOINITIAL\n", "INNER"), "SUB1\nINN1\nSUB2\nINN2\n");
    assert_eq!(run("       CBL NOINITIAL\n", "INNER IS INITIAL"), "SUB1\nINN1\nSUB2\nINN1\n");
}

#[test]
fn thread_forces_noinitial_on_the_programs_it_compiles() {
    let source = two_programs(
        "",
        &[line("CALL 'SUB'"), line("CALL 'SUB'"), line("GOBACK.")].concat(),
        "SUB RECURSIVE",
        "       WORKING-STORAGE SECTION.\n       01  N PIC 9 VALUE 0.\n",
        &["       PROCEDURE DIVISION.\n".into(), line("ADD 1 TO N"), line("DISPLAY N"), line("GOBACK.")].concat(),
    )
    .replacen("PROGRAM-ID. MAIN.", "PROGRAM-ID. MAIN RECURSIVE.", 1);
    let card = format!("       CBL INITIAL,THREAD\n{source}");
    assert_eq!(compile_errors(&card), "warning: INITIAL conflicts with THREAD, which IBM compiles only as NOINITIAL (see C217)");
    assert_eq!(run_unit(&card, vec![], "").0, "1\n2\n");
    assert_eq!(run_unit(&format!("       CBL INITIAL\n{source}"), vec![], "").0, "1\n1\n");
}

#[test]
fn an_independent_segment_is_entered_with_its_go_tos_as_written() {
    let segment = |name: &str, priority: u8| {
        [
            format!("       {name} SECTION {priority}.\n       {name}-START.\n"),
            line(&format!("DISPLAY 'IN {priority}'.")),
            format!("       {name}-SW.\n"),
            line(&format!("GO TO {name}-FIRST.")),
            format!("       {name}-FIRST.\n"),
            line("DISPLAY 'FIRST'"),
            line(&format!("ALTER {name}-SW TO PROCEED TO {name}-SECOND")),
            line(&format!("GO TO {name}-SW.")),
            format!("       {name}-SECOND.\n"),
            line("DISPLAY 'SECOND'."),
        ]
        .concat()
    };
    let out = run(&program(
        "",
        "",
        &[
            "       MAIN SECTION.\n".to_owned(),
            line("PERFORM FIXED"),
            line("PERFORM FIXED"),
            line("PERFORM INDEP"),
            line("PERFORM INDEP"),
            line("GOBACK."),
            segment("FIXED", 10),
            segment("INDEP", 50),
        ]
        .concat(),
    ));
    assert_eq!(out, "IN 10\nFIRST\nSECOND\nIN 10\nSECOND\nIN 50\nFIRST\nSECOND\nIN 50\nFIRST\nSECOND\n");
}

#[test]
fn the_alter_statements_rules_are_compile_errors() {
    let errors = |head: &str, body: &str| {
        compile_errors(&format!("       IDENTIFICATION DIVISION.\n       PROGRAM-ID. T{head}.\n       PROCEDURE DIVISION.\n       P0.\n{body}       P1.\n           GO TO P2.\n       P2.\n           DISPLAY 'X'.\n       S SECTION.\n           GO TO P2.\n       P3.\n           STOP RUN.\n"))
    };
    assert_eq!(errors("", &line("ALTER P1 TO PROCEED TO P0.")), "");
    assert!(errors("", &line("ALTER P2 TO P0.")).contains("ALTER P2: the paragraph must hold one sentence, a GO TO without DEPENDING ON"));
    assert!(errors("", &line("ALTER S TO P0.")).contains("ALTER S: a section"));
    assert!(errors("", &line("ALTER P1 TO NOWHERE.")).contains("no paragraph or section named NOWHERE"));
    assert!(errors(" IS RECURSIVE", &line("ALTER P1 TO P0.")).contains("ALTER cannot be used in a RECURSIVE program"));
    assert!(errors("", &[line("GO TO."), line("DISPLAY 'X'.")].concat()).contains("a GO TO with no procedure-name must be its paragraph's only sentence"));
    assert!(errors("", &line("IF 1 = 1 GO TO. ")).contains("only sentence"));
}

#[test]
fn perform_varying_after_augments_the_outer_variable_before_setting_the_inner() {
    let out = run(&program(
        "",
        "       01  I PIC 9(2).\n       01  J PIC 9(2).\n       01  K PIC 9(2).\n       01  N PIC 9(4) VALUE 0.\n",
        &[
            "       MAIN-LINE.\n",
            &line("PERFORM SHOW VARYING I FROM 1 BY 1 UNTIL I > 3"),
            &line("    AFTER J FROM I BY 1 UNTIL J > 3"),
            &line("DISPLAY 'END ' I ' ' J"),
            &line("PERFORM SHOW WITH TEST AFTER VARYING I FROM 1 BY 1"),
            &line("    UNTIL I > 2 AFTER J FROM I BY 1 UNTIL J > 2"),
            &line("DISPLAY 'END ' I ' ' J"),
            &line("PERFORM COUNT-IT VARYING I FROM 1 BY 1 UNTIL I > 2"),
            &line("    AFTER J FROM 1 BY 1 UNTIL J > 3"),
            &line("    AFTER K FROM 1 BY 1 UNTIL K > 4"),
            &line("DISPLAY 'N ' N ' ' I ' ' J ' ' K"),
            &line("PERFORM SHOW VARYING I FROM 5 BY 1 UNTIL I > 4"),
            &line("    AFTER J FROM 1 BY 1 UNTIL J > 1"),
            &line("DISPLAY 'NONE ' I ' ' J"),
            &line("GOBACK."),
            "       SHOW.\n",
            &line("DISPLAY I J."),
            "       COUNT-IT.\n",
            &line("ADD 1 TO N."),
        ]
        .concat(),
    ));
    let expected = [
        "0101\n0102\n0103\n0202\n0203\n0303\nEND 04 04\n",
        "0101\n0102\n0103\n0202\n0203\n0303\nEND 03 03\n",
        "N 0024 03 01 01\n",
        "NONE 05 01\n",
    ];
    assert_eq!(out, expected.concat());
}

#[test]
fn after_phrases_are_refused_where_enterprise_cobol_refuses_them() {
    let inline = program("", "       01  I PIC 9.\n       01  J PIC 9.\n", &[line("PERFORM VARYING I FROM 1 BY 1 UNTIL I > 2"), line("    AFTER J FROM 1 BY 1 UNTIL J > 2"), line("  CONTINUE"), line("END-PERFORM.")].concat());
    let message = syntax::parse(&inline).unwrap_err().message;
    assert!(message.contains("an inline PERFORM cannot have AFTER phrases") && !message.contains("not supported"), "{message}");
    let after = (0..7).map(|_| line("    AFTER J FROM 1 BY 1 UNTIL J > 2")).collect::<String>();
    let seven = program("", "       01  I PIC 9.\n       01  J PIC 9.\n", &[line("PERFORM P VARYING I FROM 1 BY 1 UNTIL I > 2"), after, line("GOBACK."), "       P.\n".into(), line("CONTINUE.")].concat());
    assert!(syntax::parse(&seven).unwrap_err().message.contains("at most six AFTER phrases"));
}

#[test]
fn display_takes_no_advancing_with_or_without_with() {
    let out = run(&program(
        "",
        "       01  A PIC X(3) VALUE 'ABC'.\n",
        &[line("DISPLAY A NO ADVANCING"), line("DISPLAY '-' UPON CONSOLE NO ADVANCING"), line("DISPLAY A WITH NO ADVANCING END-DISPLAY"), line("DISPLAY '!'"), line("GOBACK.")].concat(),
    ));
    assert_eq!(out, "ABC-ABC!\n");
    let reversed = program("", "", &[line("DISPLAY 'A' WITH NO ADVANCING UPON CONSOLE"), line("GOBACK.")].concat());
    assert!(syntax::parse(&reversed).unwrap_err().message.contains("Enterprise COBOL takes UPON before WITH NO ADVANCING"));
}

#[test]
fn function_random_repeats_its_sequence_for_a_seed_between_zero_and_one() {
    let body = [
        line("COMPUTE N = FUNCTION RANDOM * 1000000000"),
        line("DISPLAY N"),
        line("COMPUTE N = FUNCTION RANDOM * 1000000000"),
        line("DISPLAY N"),
        line("COMPUTE N = FUNCTION RANDOM(0) * 1000000000"),
        line("DISPLAY N"),
        line("COMPUTE N = FUNCTION RANDOM(42) * 1000000000"),
        line("DISPLAY N"),
        line("COMPUTE X = FUNCTION RANDOM"),
        line("COMPUTE N = X * 1000000000"),
        line("DISPLAY N"),
        line("MOVE 'A' TO T(FUNCTION RANDOM * 3 + 1)"),
        line("IF FUNCTION RANDOM(2147483645) > 0"),
        line("    AND FUNCTION RANDOM < 1 DISPLAY 'IN RANGE' END-IF"),
        line("GOBACK."),
    ]
    .concat();
    let data = "       01  X COMP-2.\n       01  N PIC 9(9).\n       01  G.\n           05 T PIC X OCCURS 3.\n";
    assert_eq!(run(&program("", data, &body)), "000007826\n131537788\n000007826\n000336534\n656124890\nIN RANGE\n");
    let (_, _, ending) = run_with(&program("", data, &[line("COMPUTE X = FUNCTION RANDOM(-1)"), line("GOBACK.")].concat()), &[]);
    assert!(ending.unwrap_err().message.contains("FUNCTION RANDOM(-1): the seed must be zero or a positive integer"));
}

#[test]
fn a_zero_divisor_outside_on_size_error_is_the_program_check_of_its_divide() {
    let check = |usage: &str, statement: &str| {
        let data = format!("       01  Z {usage} VALUE 0.\n       01  Y PIC 9.\n       01  G.\n           05 T PIC X OCCURS 3.\n");
        let (out, _, ending) = run_with(&program("", &data, &[line("COMPUTE Y = 5 / Z ON SIZE ERROR DISPLAY 'SIZE' END-COMPUTE"), line(statement), line("GOBACK.")].concat()), &[]);
        (out, ending.unwrap_err().code.to_string())
    };
    let size = "SIZE\n".to_owned();
    assert_eq!(check("PIC 9", "IF 1 / Z = 0 CONTINUE END-IF"), (size.clone(), "S0CB".into()));
    assert_eq!(check("PIC S9(3) COMP-3", "COMPUTE Y = 1 / Z"), (size.clone(), "S0CB".into()));
    assert_eq!(check("PIC S9(4) COMP", "IF 1 / Z = 0 CONTINUE END-IF"), (size.clone(), "S0C9".into()));
    assert_eq!(check("PIC S9(4) COMP", "MOVE 'A' TO T(3 / Z)"), (size.clone(), "S0C9".into()));
    assert_eq!(check("PIC S9(4) COMP", "IF 1.5 / Z = 0 CONTINUE END-IF"), (size.clone(), "S0CB".into()));
    assert_eq!(check("PIC S9(2)V9 COMP", "DIVIDE Z INTO Y"), (size.clone(), "S0CB".into()));
    assert_eq!(check("COMP-2", "IF 1 / Z = 0 CONTINUE END-IF"), (size, "S0CF".into()));
}

#[test]
fn what_is_not_enterprise_cobol_is_refused_as_such() {
    let refused = |body: &str| syntax::parse(&program("", "       01  A PIC X(4).\n", &line(body))).unwrap_err().message;
    for (body, named) in [
        ("IF A <> 'B' CONTINUE END-IF.", "<> is not an Enterprise COBOL relational operator"),
        ("MOVE 'A' & 'B' TO A.", "literal concatenation with & is not Enterprise COBOL's"),
        ("SET ENVIRONMENT 'X' TO 'Y'.", "SET ENVIRONMENT is GnuCOBOL's"),
        ("ACCEPT A FROM ENVIRONMENT 'X'.", "ACCEPT ... FROM ENVIRONMENT is GnuCOBOL's"),
    ] {
        let message = refused(body);
        assert!(message.contains(named) && !message.contains("not supported"), "{body}: {message}");
    }
}

fn perform_program(procedure: &[&str]) -> String {
    program("", "       01  K PIC 9 VALUE 0.\n", &procedure.concat())
}

#[test]
fn a_perform_range_returns_when_control_reaches_its_end_by_go_to() {
    let out = run(&perform_program(&[
        "       M.\n",
        &line("PERFORM B THRU C"),
        &line("DISPLAY 'BACK'"),
        &line("PERFORM D THRU A"),
        &line("DISPLAY 'BACK AGAIN'"),
        &line("STOP RUN."),
        "       A.\n",
        &line("DISPLAY 'A'."),
        "       B.\n",
        &line("DISPLAY 'B'"),
        &line("GO TO X."),
        "       C.\n",
        &line("DISPLAY 'C'."),
        "       D.\n",
        &line("DISPLAY 'D'"),
        &line("GO TO A."),
        "       X.\n",
        &line("DISPLAY 'X'"),
        &line("GO TO C."),
    ]));
    assert_eq!(out, "B\nX\nC\nBACK\nD\nA\nBACK AGAIN\n");
}

#[test]
fn a_perform_left_by_go_to_returns_when_control_later_passes_its_end() {
    let out = run(&perform_program(&[
        "       M.\n",
        &line("PERFORM P2"),
        &line("DISPLAY 'BACK ' K"),
        &line("GO TO P2."),
        "       P1.\n",
        &line("DISPLAY 'P1'."),
        "       P2.\n",
        &line("ADD 1 TO K"),
        &line("IF K = 1"),
        &line("    GO TO P1"),
        &line("END-IF"),
        &line("DISPLAY 'P2 ' K."),
        "       P3.\n",
        &line("DISPLAY 'P3'"),
        &line("STOP RUN."),
    ]));
    assert_eq!(out, "P1\nP2 2\nBACK 2\nP2 3\nP3\n");
}

#[test]
fn passing_the_end_of_an_active_perform_returns_to_it_from_a_range_inside_it() {
    let out = run(&perform_program(&[
        "       M.\n",
        &line("PERFORM A THRU B"),
        &line("DISPLAY 'M'"),
        &line("PERFORM A THRU C"),
        &line("DISPLAY 'M2'"),
        &line("STOP RUN."),
        "       A.\n",
        &line("DISPLAY 'A'"),
        &line("PERFORM B THRU C"),
        &line("DISPLAY 'A2'."),
        "       B.\n",
        &line("DISPLAY 'B'."),
        "       C.\n",
        &line("DISPLAY 'C'."),
    ]));
    assert_eq!(out, "A\nB\nM\nA\nB\nC\nA2\nB\nC\nM2\n");
}

#[test]
fn exit_section_in_a_performed_paragraph_goes_past_its_return_to_the_end_of_the_section() {
    let out = run(&perform_program(&[
        "       MAIN SECTION.\n",
        "       M.\n",
        &line("PERFORM S1-A"),
        &line("DISPLAY 'BACK'"),
        &line("STOP RUN."),
        "       S1 SECTION.\n",
        "       S1-A.\n",
        &line("DISPLAY 'A'"),
        &line("EXIT SECTION."),
        "       S1-B.\n",
        &line("DISPLAY 'B'."),
        "       S2 SECTION.\n",
        "       S2-A.\n",
        &line("DISPLAY 'S2'"),
        &line("STOP RUN."),
    ]));
    assert_eq!(out, "A\nS2\n");
}

#[test]
fn passing_the_end_of_a_repeated_perform_left_by_go_to_is_refused() {
    let (out, _, ending) = run_with(
        &perform_program(&[
            "       M.\n",
            &line("PERFORM P2 2 TIMES"),
            &line("STOP RUN."),
            "       P1.\n",
            &line("DISPLAY 'P1'."),
            "       P2.\n",
            &line("ADD 1 TO K"),
            &line("IF K = 1"),
            &line("    GO TO P1"),
            &line("END-IF."),
        ]),
        &[],
    );
    assert_eq!(out, "P1\n");
    assert!(ending.unwrap_err().message.starts_with("control passed the end of P2, which is armed to return to a PERFORM that control left by GO TO"));
}

#[test]
fn numeric_functions_take_floating_point_arguments() {
    let source = |statement: &str| {
        program(
            "",
            "       01  F COMP-2.\n       01  R PIC -9(4).99.\n",
            &[line("MOVE -2.5 TO F"), line(statement), line("DISPLAY R"), line("GOBACK.")].concat(),
        )
    };
    for (statement, shown) in [
        ("COMPUTE R = FUNCTION INTEGER(F)", "-0003.00"),
        ("COMPUTE R = FUNCTION INTEGER-PART(F)", "-0002.00"),
        ("COMPUTE R = FUNCTION INTEGER(100 * F)", "-0250.00"),
        ("COMPUTE R = FUNCTION ABS(F) + 1", " 0003.50"),
        ("COMPUTE R = FUNCTION REM(F * 3, 2)", "-0001.50"),
        ("COMPUTE R = FUNCTION MAX(1, F, 0.25)", " 0001.00"),
        ("COMPUTE R = FUNCTION MIN(1, F, 0.25)", "-0002.50"),
    ] {
        assert_eq!(run(&source(statement)), format!("{shown}\n"), "{statement}");
    }
    let (_, _, ending) = run_with(&source("COMPUTE R = FUNCTION MOD(F, 2)"), &[]);
    assert_eq!(ending.unwrap_err().message, "FUNCTION MOD needs integer arguments, and a floating-point argument is not one");
}

#[test]
fn a_paragraph_name_in_two_sections_is_the_referencing_sections_own() {
    let sections = |third: &str| {
        program(
            "",
            "       01  N PIC 9 VALUE 0.\n",
            &[
                "       FIRST-S SECTION.\n       P0.\n",
                &line("PERFORM P1"),
                &line("GO TO P1."),
                "       P1.\n",
                &line("DISPLAY 'FIRST'."),
                "       SECOND-S SECTION.\n       Q0.\n",
                &line("PERFORM P1"),
                &line("GO TO THIRD-S."),
                "       P1.\n",
                &line("DISPLAY 'SECOND'."),
                "       THIRD-S SECTION.\n       R0.\n",
                &line(third),
                &line("GOBACK."),
            ]
            .concat(),
        )
    };
    let out = run(&sections("CONTINUE."));
    assert_eq!(out, "FIRST\nFIRST\nSECOND\n");
    assert!(compile_errors(&sections("PERFORM P1.")).contains("P1 names more than one paragraph"));
}

#[test]
fn abbreviated_relations_keep_the_subject_the_operator_and_its_not() {
    let data = "       01  S PIC XX VALUE '61'.\n       01  D PIC 999 VALUE 15.\n       01  P PIC 9V999 VALUE .2.\n       01  B PIC 999 VALUE 20.\n";
    let out = run(&program(
        "",
        data,
        &[
            line("IF S = ('02' OR '03' OR '61') DISPLAY 'LIST'."),
            line("IF S = ('02' OR NOT '61') DISPLAY 'NO'."),
            line("IF D < 1 OR = 14 OR = 15 DISPLAY 'OR ='."),
            line("IF (P >= .15 AND <= .202) DISPLAY 'RANGE'."),
            line("IF D > 10 AND NOT > 20 DISPLAY 'NOT >'."),
            line("IF D NOT = 10 AND 15 DISPLAY 'NO'."),
            line("IF D NOT = 10 AND 16 DISPLAY 'NOT = LITERAL'."),
            line("IF D NOT < 10 AND B DISPLAY 'NO'."),
            line("IF D NOT > 10 OR B DISPLAY 'NOT > ITEM'."),
            line("GOBACK."),
        ]
        .concat(),
    ));
    assert_eq!(out, "LIST\nOR =\nRANGE\nNOT >\nNOT = LITERAL\nNOT > ITEM\n");
}

#[test]
fn an_evaluate_subject_that_is_a_condition_name_takes_truth_values() {
    let data = "       01  X PIC 9 VALUE 1.\n           88  X-ONE VALUE 1.\n           88  X-TWO VALUE 2.\n";
    let out = run(&program(
        "",
        data,
        &[
            line("EVALUATE X-ONE ALSO X WHEN TRUE ALSO 1 DISPLAY 'A'"),
            line("END-EVALUATE"),
            line("EVALUATE X-TWO WHEN FALSE DISPLAY 'B' END-EVALUATE"),
            line("EVALUATE X-ONE WHEN X-TWO DISPLAY 'NO'"),
            line("    WHEN NOT X-TWO DISPLAY 'C' END-EVALUATE"),
            line("GOBACK."),
        ]
        .concat(),
    ));
    assert_eq!(out, "A\nB\nC\n");
}

#[test]
fn an_abbreviated_relation_may_write_is_before_its_operator() {
    let body = |a: u8| {
        [
            line(&format!("MOVE {a} TO A")),
            line("IF A GREATER THAN B"),
            line("    AND IS NOT LESS THAN C OR D"),
            line("    DISPLAY 'TRUE' ELSE DISPLAY 'FALSE' END-IF"),
        ]
        .concat()
    };
    let data = "       01  A PIC 9.\n       01  B PIC 9 VALUE 1.\n       01  C PIC 9 VALUE 3.\n       01  D PIC 9 VALUE 9.\n";
    let source = program("", data, &[body(5), body(2), line("GOBACK.")].concat());
    assert_eq!(run(&source), "TRUE\nFALSE\n");
}

#[test]
fn an_abbreviated_object_may_be_qualified_subscripted_negated_or_in_parentheses() {
    let data = "       01  A PIC 9 VALUE 5.\n       01  B PIC 9 VALUE 1.\n       01  C PIC 9 VALUE 2.\n       01  D PIC 9 VALUE 5.\n       01  G.\n           05 E PIC 9 VALUE 5.\n           05 TE PIC 9 OCCURS 3 VALUE 5.\n";
    let check = |condition: &str| [line(&format!("IF {condition}")), line("    DISPLAY 'T' ELSE DISPLAY 'F' END-IF")].concat();
    let body = [
        check("NOT (A NOT = B AND C AND NOT D)"),
        check("A = B OR E OF G"),
        check("A = B OR TE (2)"),
        check("A = B OR NOT D"),
        check("A = 5 AND (C OR D)"),
        check("A > B AND NOT (C OR D)"),
        check("A = B OR (> C AND < 9)"),
        line("GOBACK."),
    ]
    .concat();
    assert_eq!(run(&program("", data, &body)), "F\nT\nT\nF\nT\nF\nT\n");
    let distributed = program("", data, &[check("A NOT = (NOT B OR C)"), line("GOBACK.")].concat());
    let refused = syntax::parse(&distributed).err().map(|e| e.to_string()).unwrap_or_default();
    assert!(refused.contains("NOT cannot follow the left parenthesis that distributes a relational operator"), "{refused}");
}

#[test]
fn an_initial_program_resets_the_programs_it_contains_and_closes_its_files_when_it_returns() {
    let out = temp("initial-out.txt");
    let source = [
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. MAIN.\n       PROCEDURE DIVISION.\n",
        &line("CALL 'SUB'"),
        &line("CALL 'SUB'"),
        &line("GOBACK."),
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. SUB IS INITIAL.\n       ENVIRONMENT DIVISION.\n       INPUT-OUTPUT SECTION.\n       FILE-CONTROL.\n",
        "           SELECT F ASSIGN TO OUTDD ORGANIZATION LINE SEQUENTIAL\n               FILE STATUS IS FS.\n",
        "       DATA DIVISION.\n       FILE SECTION.\n       FD  F.\n       01  R PIC X(3).\n       WORKING-STORAGE SECTION.\n       01  FS PIC XX.\n       PROCEDURE DIVISION.\n",
        &line("OPEN OUTPUT F"),
        &line("DISPLAY 'OPEN ' FS"),
        &line("CALL 'INNER'"),
        &line("GOBACK."),
        "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. INNER.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n       01  N PIC 9 VALUE 0.\n       PROCEDURE DIVISION.\n",
        &line("ADD 1 TO N"),
        &line("DISPLAY 'INN' N"),
        &line("GOBACK."),
        "       END PROGRAM INNER.\n       END PROGRAM SUB.\n       END PROGRAM MAIN.\n",
    ]
    .concat();
    let (stdout, err, ending) = run_files(&source, &[format!("OUTDD={}", out.display())]);
    assert!(ending.is_ok(), "{ending:?} {err}");
    assert_eq!(stdout, "OPEN 00\nINN1\nOPEN 00\nINN1\n");
    let _ = std::fs::remove_file(out);
}

#[test]
fn paragraphs_and_sections_named_by_digits_alone_are_procedure_names() {
    let out = run(&perform_program(&[
        "       M SECTION.\n",
        "       M1.\n",
        &line("MOVE 2 TO K"),
        &line("GO TO 3 4 5 DEPENDING ON K."),
        "       3.\n",
        &line("DISPLAY '3'."),
        "       4.\n",
        &line("DISPLAY '4'"),
        &line("PERFORM 3 TIMES DISPLAY 'T' NO ADVANCING END-PERFORM"),
        &line("PERFORM 01 2 TIMES"),
        &line("PERFORM 0002"),
        &line("ALTER 9 TO PROCEED TO 8"),
        &line("GO TO 9."),
        "       5.\n",
        &line("DISPLAY '5'."),
        "       9.\n",
        &line("GO TO 5."),
        "       8.\n",
        &line("DISPLAY '8'"),
        &line("STOP RUN."),
        "       01 SECTION.\n",
        "       1.\n",
        &line("DISPLAY '1 OF 01'."),
        "       0002 SECTION.\n",
        "       1.\n",
        &line("DISPLAY '1 OF 0002'."),
        "       2.\n",
        &line("DISPLAY '2 OF 0002'."),
    ]));
    assert_eq!(out, "4\nTTT1 OF 01\n1 OF 01\n1 OF 0002\n2 OF 0002\n8\n");
}

#[test]
fn perform_times_takes_a_subscripted_count_and_test_needs_no_with() {
    let out = run(&program(
        "",
        "       01  T.\n           05 N PIC 9 OCCURS 3 VALUE 2.\n       01  I PIC 9 VALUE 3.\n       01  K PIC 9 VALUE 0.\n",
        &[
            "       M.\n",
            &line("MOVE 1 TO N (2)"),
            &line("PERFORM P N (I) TIMES"),
            &line("PERFORM N (2) TIMES DISPLAY 'I' END-PERFORM"),
            &line("PERFORM P TEST AFTER UNTIL K > 4"),
            &line("PERFORM TEST BEFORE UNTIL K > 5 ADD 1 TO K END-PERFORM"),
            &line("DISPLAY K"),
            &line("STOP RUN."),
            "       P.\n",
            &line("ADD 1 TO K"),
            &line("DISPLAY 'P' K."),
        ]
        .concat(),
    ));
    assert_eq!(out, "P1\nP2\nI\nP3\nP4\nP5\n6\n");
}

#[test]
fn an_unqualified_paragraph_name_names_the_one_in_its_own_section() {
    let source = perform_program(&[
        "       S1 SECTION.\n       S1-START.\n",
        &line("PERFORM P"),
        &line("PERFORM P THRU Q"),
        &line("PERFORM S2"),
        &line("GO TO Q."),
        "       P.\n",
        &line("DISPLAY 'P OF S1'."),
        "       Q.\n",
        &line("DISPLAY 'Q OF S1'."),
        "       Z.\n",
        &line("STOP RUN."),
        "       S2 SECTION.\n       S2-START.\n",
        &line("MOVE 1 TO K"),
        &line("GO TO P Q DEPENDING ON K."),
        "       P.\n",
        &line("DISPLAY 'P OF S2'"),
        &line("ALTER R TO PROCEED TO Q"),
        &line("PERFORM R THRU Q."),
        "       R.\n",
        &line("GO TO P."),
        "       Q.\n",
        &line("DISPLAY 'Q OF S2'."),
    ]);
    assert_eq!(run(&source), "P OF S1\nP OF S1\nQ OF S1\nP OF S2\nQ OF S2\nQ OF S2\nQ OF S1\n");
    let elsewhere = format!("{source}       S3 SECTION.\n{}", line("GO TO P."));
    assert_eq!(compile_errors(&elsewhere), "P names more than one paragraph; qualify it with OF and its section");
}

#[test]
fn alphabetic_lower_and_upper_test_each_character_and_allow_spaces() {
    let data = "       01  U PIC X(4) VALUE 'AB C'.\n       01  L PIC X(4) VALUE 'ab c'.\n       01  M PIC X(4) VALUE 'Ab c'.\n";
    let test = |item: &str| {
        format!("IF {item} IS ALPHABETIC-UPPER DISPLAY '{item} U' END-IF\n           IF {item} NOT ALPHABETIC-LOWER DISPLAY '{item} NOT L' END-IF")
    };
    let out = run(&program("", data, &[line(&test("U")), line(&test("L")), line(&test("M")), line("IF U(2:2) ALPHABETIC-UPPER AND L(1:1) ALPHABETIC-LOWER"), line("    DISPLAY 'BOTH' END-IF"), line("GOBACK.")].concat()));
    assert_eq!(out, "U U\nU NOT L\nM NOT L\nBOTH\n");
}

#[test]
fn procedure_division_returning_names_an_01_or_77_item_of_the_linkage_section() {
    let with = |head: &str| {
        severe(&format!(
            "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. SUB.\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n       01  R PIC X(3) VALUE 'XYZ'.\n       LINKAGE SECTION.\n       01  L.\n           05 L1 PIC X(3).\n       PROCEDURE DIVISION{head}.\n{}",
            line("GOBACK.")
        ))
    };
    assert_eq!(with(" RETURNING R"), ["PROCEDURE DIVISION RETURNING R: not an 01 or 77 item of the LINKAGE SECTION"]);
    assert_eq!(with(" RETURNING L1"), ["PROCEDURE DIVISION RETURNING L1: not an 01 or 77 item of the LINKAGE SECTION"]);
    assert_eq!(with(" RETURNING L"), Vec::<String>::new());
}

#[test]
fn perform_varying_steps_a_numeric_item_from_and_by_an_identifier_or_literal() {
    let data = "       01  I PIC 99.\n       01  J PIC 99.\n       01  X PIC X(4).\n       01  F COMP-2.\n       01  G.\n           05 T PIC X OCCURS 3 INDEXED BY K.\n";
    let refused = |body: &str| severe(&program("", data, &[line(body), line("    CONTINUE"), line("END-PERFORM"), line("GOBACK.")].concat()));
    assert_eq!(refused("PERFORM VARYING J FROM I + 1 BY 1 UNTIL J > 3"), ["PERFORM VARYING J FROM: an arithmetic expression, where FROM takes an identifier, index-name or literal"]);
    assert_eq!(refused("PERFORM VARYING J FROM 1 BY I * 2 UNTIL J > 3"), ["PERFORM VARYING J BY: an arithmetic expression, where BY takes an identifier, index-name or literal"]);
    assert_eq!(refused("PERFORM VARYING X FROM 1 BY 1 UNTIL X > 3"), ["PERFORM VARYING X: not a numeric elementary item or an index-name"]);
    for accepted in ["PERFORM VARYING I FROM 10 BY -1 UNTIL I < 8", "PERFORM VARYING I FROM FUNCTION LENGTH(X) BY 1 UNTIL I > 5", "PERFORM VARYING F FROM 1.5 BY 0.5 UNTIL F > 3", "PERFORM VARYING K FROM 1 BY 1 UNTIL K > 3"] {
        assert_eq!(refused(accepted), Vec::<String>::new(), "{accepted}");
    }
}

#[test]
fn search_varying_names_an_index_or_an_elementary_integer_item() {
    let data = "       01  G.\n           05 E PIC X OCCURS 3 INDEXED BY K M.\n       01  V PIC 9(2)V9.\n       01  A PIC X.\n       01  F COMP-2.\n       01  IX USAGE INDEX.\n       01  B PIC S9(4) COMP.\n";
    let refused = |v: &str| severe(&program("", data, &[line(&format!("SEARCH E VARYING {v} WHEN E(K) = 'A' CONTINUE END-SEARCH")), line("GOBACK.")].concat()));
    for (v, refusal) in [("V", "SEARCH E VARYING V"), ("A", "SEARCH E VARYING A"), ("F", "SEARCH E VARYING F")] {
        assert_eq!(refused(v), [format!("{refusal}: not an index-name, an index data item or an elementary integer item")]);
    }
    for accepted in ["M", "IX", "B"] {
        assert_eq!(refused(accepted), Vec::<String>::new(), "{accepted}");
    }
}

#[test]
fn a_handle_label_names_a_paragraph_or_section_of_the_program() {
    let refused = |block: &str| severe(&program("", "", &["       MAIN.\n".to_owned(), line(block), line("GOBACK."), "       ERR-1.\n".to_owned(), line("GOBACK.")].concat()));
    assert_eq!(refused("EXEC CICS HANDLE CONDITION ERROR(NOPARA) END-EXEC"), ["EXEC CICS HANDLE CONDITION ERROR(NOPARA): no paragraph or section named NOPARA"]);
    assert_eq!(refused("EXEC CICS HANDLE AID PF3(NOPARA) END-EXEC"), ["EXEC CICS HANDLE AID PF3(NOPARA): no paragraph or section named NOPARA"]);
    assert_eq!(refused("EXEC CICS HANDLE ABEND LABEL(NOPARA) END-EXEC"), ["EXEC CICS HANDLE ABEND LABEL(NOPARA): no paragraph or section named NOPARA"]);
    for accepted in ["EXEC CICS HANDLE CONDITION ERROR(ERR-1) LENGERR END-EXEC", "EXEC CICS HANDLE AID PF3(err-1) END-EXEC", "EXEC CICS HANDLE ABEND PROGRAM('X') END-EXEC"] {
        assert_eq!(refused(accepted), Vec::<String>::new(), "{accepted}");
    }
}