How we shall test it.

• §1.
• §2. Minimal Preform grammar
• §4. Syntax tree

§1.

parse_node_tree *syntax_tree = NULL;

§2. Minimal Preform grammar. Only <dividing-sentence> can ever match, since the others are wired to match any text but then fail.

<dividing-sentence> ::=
    chapter ... |  ==> { 1, - }
    section ...    ==> { 2, - }

<structural-sentence> ::=
    ... ==> { fail }

<language-modifying-sentence> ::=
    ... ==> { fail }

<comma-divisible-sentence> ::=
    ... ==> { fail }

• This is Preform grammar, not regular C code.

§3.

<scan-individual-phrase> ::=
    ... banana ...          ==> Issue PM_UnexpectedFruit problem3.1;

• This is Preform grammar, not regular C code.

§3.1. Issue PM_UnexpectedFruit problem3.1 =

    Problems::quote_wording(1, W);
    StandardProblems::handmade_problem(syntax_tree, _p_(PM_UnexpectedFruit));
    Problems::issue_problem_segment(
        "The sentence '%1' contained an unexpected fruit item, and now supper "
        "will be ruined.");
    Problems::issue_problem_end();

• This code is used in §3.

§4. Syntax tree.

void Unit::test_problems?Usage of Unit::test_problems:
Program Control - §1(text_stream *arg) {
    filename *F = Filenames::from_text(arg);
    feed_t FD = Feeds::begin();
    source_file *sf = TextFromFiles::feed_into_lexer(F, NULL_GENERAL_POINTER);
    wording W = Feeds::end(FD);
    if (sf == NULL) { PRINT("File has failed to open\n"); return; }
    syntax_tree = SyntaxTree::new();
    PRINT("Read %d words\n", Wordings::length(W));
    Sentences::break(syntax_tree, W);

    SyntaxTree::traverse(syntax_tree, Unit::scan_tree);
}

void Unit::scan_tree(parse_node *p) {
    if (Node::get_type(p) == SENTENCE_NT) {
        wording W = Node::get_text(p);
        <scan-individual-phrase>(W);
    }
}