These data structures and all derivative products are the joint intellectual property of Shrapnel Games Forums and Lonnie Courtney Clay, 50/50 split.
The names assigned to structures, entries, and some description words and sizes may vary from current usage. Just grin and bear it.

struct ker
{
k_pre int;/* Int provides for more than 256 types. With iconic Languages you may need a long */
k_cen int;/* word > 64k combinations, but for English the sparse set is far less than 24*24*24 */
k_suf int;/* the cen is always non null, pre and suf may either or both be null */
k_opi int;/* index of function performed on pre,cen to produce suf */
}
/*
Each of the three components above is a particular node index referencing the set of all node types used
in the structure group given previously. Node types are distinguished by the linking fanin/fanout and processing power.
Ker node classes group together node types for task allocations. The actual ker is rather more complex but
you should get the drift from this example.
*/

struct kernal
{
lex struct ker[n];/* The full set of word components */
bor byte [n][n];/* see bit allocation below */
map byte *[n];/* pointers to whatsoever representations are desired */
}
/*
Note : in all the cases below, the bit allocation may be different from what is specified here, this is only a sample.
Furthermore, the 0/1 values may be swapped as 1/0 for the cases mentioned.
For an entry [n,n*] of bor
bit 0 = 0 if lex [n] is incompatible with lex [n*] else = 1
bit 1 = 0 if lex [n] can only either precede or follow but not do both for [n*] else = 1 and does both
bit 2 = 0 if lex [n] if lex[n*] precedes, else = 1 and follows
bit 3 = 0 if lex [n] gets its inputs direct from preceder [n*] else do op 5-7 on [n*] and = 1
bit 4 = 0 if lex [n] feeds its outputs directly to follower [n*] else do op 5-7 to [n*] and = 1
bit 5,6,7 sample operations
0 = invert, 1 = transpose, 2 = column swap, 3 = row swap
4 = AND mask preceder [n*] with [n] to make follower [n*]
5 =OR mask preceder [n*] with [n] to make follower [n*]
6 = NAND mask preceder [n*] with [n] to make follower [n*]
7 =NOR mask preceder [n*] with [n] to make follower [n*]
*/

Think about THAT a WHILE.

Lonnie Courtney Clay