8     Value_t value;
12 static Value_t map_goto(int state, int symbol);
13 static Value_t **transpose(Value_t **R, int n);
18 static void digraph(Value_t **relation);
30 Value_t *lookaheads;
31 Value_t *LAruleno;
33 Value_t *accessing_symbol;
37 Value_t *goto_base;
38 Value_t *goto_map;
39 Value_t *from_state;
40 Value_t *to_state;
42 static Value_t infinity;
44 static Value_t ngotos;
46 static Value_t **includes;
48 static Value_t **R;
49 static Value_t *INDEX;
50 static Value_t *VERTICES;
51 static Value_t top;
86     accessing_symbol = NEW2(nstates, Value_t);  in set_accessing_symbol()
114     Value_t *itemp;  in set_maxrhs()
115     Value_t *item_end;  in set_maxrhs()
145     lookaheads = NEW2(nstates + 1, Value_t);  in initialize_LA()
150 	lookaheads[i] = (Value_t)k;  in initialize_LA()
155     lookaheads[nstates] = (Value_t)k;  in initialize_LA()
158     LAruleno = NEW2(k, Value_t);  in initialize_LA()
183     Value_t *temp_base;  in set_goto_map()
184     Value_t *temp_map;  in set_goto_map()
185     Value_t state2;  in set_goto_map()
187     goto_base = NEW2(nvars + 1, Value_t);  in set_goto_map()
188     temp_base = NEW2(nvars + 1, Value_t);  in set_goto_map()
214 	temp_map[i] = (Value_t)k;  in set_goto_map()
221     goto_map[nsyms] = (Value_t)ngotos;  in set_goto_map()
222     temp_map[nsyms] = (Value_t)ngotos;  in set_goto_map()
224     from_state = NEW2(ngotos, Value_t);  in set_goto_map()
225     to_state = NEW2(ngotos, Value_t);  in set_goto_map()
229 	Value_t state1 = sp->number;  in set_goto_map()
250 static Value_t
265 	    return (Value_t)(middle);  in map_goto()
280     Value_t *edge;  in initialize_F()
282     Value_t *rp;  in initialize_F()
283     Value_t **reads;  in initialize_F()
291     reads = NEW2(ngotos, Value_t *);  in initialize_F()
292     edge = NEW2(ngotos + 1, Value_t);  in initialize_F()
323 		reads[i] = rp = NEW2(nedges + 1, Value_t);  in initialize_F()
355     Value_t *rulep;  in build_relations()
356     Value_t *rp;  in build_relations()
360     Value_t stateno;  in build_relations()
362     Value_t *shortp;  in build_relations()
363     Value_t *edge;  in build_relations()
364     Value_t *states;  in build_relations()
365     Value_t **new_includes;  in build_relations()
367     includes = NEW2(ngotos, Value_t *);  in build_relations()
368     edge = NEW2(ngotos + 1, Value_t);  in build_relations()
369     states = NEW2(maxrhs + 1, Value_t);  in build_relations()
375 	Value_t state1 = from_state[i];  in build_relations()
419 	    includes[i] = shortp = NEW2(nedges + 1, Value_t);  in build_relations()
461     sp->value = (Value_t)gotono;  in add_lookback_edge()
465 static Value_t **
466 transpose(Value_t **R2, int n)  in transpose()
468     Value_t **new_R;  in transpose()
469     Value_t **temp_R;  in transpose()
470     Value_t *nedges;  in transpose()
471     Value_t *sp;  in transpose()
474     nedges = NEW2(n, Value_t);  in transpose()
486     new_R = NEW2(n, Value_t *);  in transpose()
487     temp_R = NEW2(n, Value_t *);  in transpose()
495 	    sp = NEW2(k + 1, Value_t);  in transpose()
510 		*temp_R[*sp++]++ = (Value_t)i;  in transpose()
560 digraph(Value_t **relation)  in digraph()
564     infinity = (Value_t)(ngotos + 2);  in digraph()
565     INDEX = NEW2(ngotos + 1, Value_t);  in digraph()
566     VERTICES = NEW2(ngotos + 1, Value_t);  in digraph()
591     Value_t *rp;  in traverse()
593     Value_t height;  in traverse()
596     VERTICES[++top] = (Value_t)i;  in traverse()