188 |
|
|
189 |
if (trace_flag) |
if (trace_flag) |
190 |
fprintf (stderr, "Entering new_state, state = %d, symbol = %d (%s)\n", |
fprintf (stderr, "Entering new_state, state = %d, symbol = %d (%s)\n", |
191 |
this_state->number, symbol, tags[symbol]); |
this_state->number, symbol, symbols[symbol]->tag); |
192 |
|
|
193 |
if (nstates >= MAXSHORT) |
if (nstates >= MAXSHORT) |
194 |
fatal (_("too many states (max %d)"), MAXSHORT); |
fatal (_("too many states (max %d)"), MAXSHORT); |
227 |
|
|
228 |
if (trace_flag) |
if (trace_flag) |
229 |
fprintf (stderr, "Entering get_state, state = %d, symbol = %d (%s)\n", |
fprintf (stderr, "Entering get_state, state = %d, symbol = %d (%s)\n", |
230 |
this_state->number, symbol, tags[symbol]); |
this_state->number, symbol, symbols[symbol]->tag); |
231 |
|
|
232 |
/* Add up the target state's active item numbers to get a hash key. |
/* Add up the target state's active item numbers to get a hash key. |
233 |
*/ |
*/ |
406 |
{ |
{ |
407 |
if (trace_flag) |
if (trace_flag) |
408 |
fprintf (stderr, "Processing state %d (reached by %s)\n", |
fprintf (stderr, "Processing state %d (reached by %s)\n", |
409 |
this_state->number, tags[this_state->accessing_symbol]); |
this_state->number, |
410 |
|
symbols[this_state->accessing_symbol]->tag); |
411 |
/* Set up ruleset and itemset for the transitions out of this |
/* Set up ruleset and itemset for the transitions out of this |
412 |
state. ruleset gets a 1 bit for each rule that could reduce |
state. ruleset gets a 1 bit for each rule that could reduce |
413 |
now. itemset gets a vector of all the items that could be |
now. itemset gets a vector of all the items that could be |