To compile the main/synoptic/verbs submodule.

§1. Before this runs, instances of these are scattered all over the Inter tree.

As this is called, Synoptic Utilities has already formed lists of verb_form_nodes of instances having the kind K_verb. 

void SynopticVerbs::compile(inter_tree *I, tree_inventory *inv) {
    if (TreeLists::len(inv->verb_form_nodes) > 0) {
        TreeLists::sort(inv->verb_form_nodes, SynopticVerbs::form_order);
    }

    Define TABLEOFVERBS array1.1;
}

int SynopticVerbs::form_order(const void *ent1, const void *ent2) {
    itl_entry *E1 = (itl_entry *) ent1;
    itl_entry *E2 = (itl_entry *) ent2;
    if (E1 == E2) return 0;
    inter_tree_node *P1 = E1->node;
    inter_tree_node *P2 = E2->node;
    inter_package *mod1 = Synoptic::module_containing(P1);
    inter_package *mod2 = Synoptic::module_containing(P2);
    inter_ti C1 = Metadata::read_optional_numeric(mod1, I"^category");
    inter_ti C2 = Metadata::read_optional_numeric(mod2, I"^category");
    int d = ((int) C2) - ((int) C1);  larger values sort earlier
    if (d != 0) return d;

    inter_ti S1 = Metadata::read_optional_numeric(Inter::Packages::container(P1), I"^verb_sorting");
    inter_ti S2 = Metadata::read_optional_numeric(Inter::Packages::container(P2), I"^verb_sorting");
    d = ((int) S1) - ((int) S2);  smaller values sort earlier
    if (d != 0) return d;

    return E1->sort_key - E2->sort_key;  smaller values sort earlier
}

§1.1. Define TABLEOFVERBS array1.1 = 

    inter_name *iname = HierarchyLocations::find(I, TABLEOFVERBS_HL);
    Synoptic::begin_array(I, iname);
    for (int i=0; i<TreeLists::len(inv->verb_form_nodes); i++) {
        inter_package *pack = Inter::Package::defined_by_frame(inv->verb_form_nodes->list[i].node);
        inter_symbol *vc_s = Metadata::read_symbol(pack, I"^verb_value");
        Synoptic::symbol_entry(vc_s);
    }
    Synoptic::numeric_entry(0);
    Synoptic::end_array(I);