439 |
for (i = 0; i < ntokens; i++) |
for (i = 0; i < ntokens; i++) |
440 |
actrow[i] = conflrow[i] = 0; |
actrow[i] = conflrow[i] = 0; |
441 |
|
|
442 |
if (redp->nreds >= 1) |
if (redp->num >= 1) |
443 |
{ |
{ |
444 |
int j; |
int j; |
445 |
/* loop over all the rules available here which require |
/* loop over all the rules available here which require |
478 |
|
|
479 |
/* See which tokens are an explicit error in this state (due to |
/* See which tokens are an explicit error in this state (due to |
480 |
%nonassoc). For them, record SHRT_MIN as the action. */ |
%nonassoc). For them, record SHRT_MIN as the action. */ |
481 |
for (i = 0; i < errp->nerrs; i++) |
for (i = 0; i < errp->num; i++) |
482 |
{ |
{ |
483 |
int symbol = errp->errs[i]; |
symbol_number_t symbol = errp->symbols[i]; |
484 |
actrow[symbol] = SHRT_MIN; |
actrow[symbol] = SHRT_MIN; |
485 |
} |
} |
486 |
|
|
487 |
/* Now find the most common reduction and make it the default action |
/* Now find the most common reduction and make it the default action |
488 |
for this state. */ |
for this state. */ |
489 |
|
|
490 |
if (redp->nreds >= 1 && !nodefault) |
if (redp->num >= 1 && !nodefault) |
491 |
{ |
{ |
492 |
if (state->consistent) |
if (state->consistent) |
493 |
default_rule = redp->rules[0]; |
default_rule = redp->rules[0]; |