414 |
print_reductions (FILE *out, int state) |
print_reductions (FILE *out, int state) |
415 |
{ |
{ |
416 |
int i; |
int i; |
|
int j; |
|
417 |
int m; |
int m; |
418 |
int n; |
int n; |
419 |
shifts *shiftp; |
shifts *shiftp; |
462 |
} |
} |
463 |
else if (n - m >= 1) |
else if (n - m >= 1) |
464 |
{ |
{ |
|
int k; |
|
|
|
|
465 |
int cmax = 0; |
int cmax = 0; |
466 |
int default_LA = -1; |
int default_LA = -1; |
467 |
int default_rule = 0; |
int default_rule = 0; |
470 |
for (i = m; i < n; i++) |
for (i = m; i < n; i++) |
471 |
{ |
{ |
472 |
int count = 0; |
int count = 0; |
473 |
|
int j, k; |
474 |
|
|
475 |
for (k = 0; k < tokensetsize; ++k) |
for (k = 0; k < tokensetsize; ++k) |
476 |
lookaheadset[k] = LA (i)[k] & ~shiftset[k]; |
lookaheadset[k] = LA (i)[k] & ~shiftset[k]; |
499 |
|
|
500 |
for (i = 0; i < ntokens; i++) |
for (i = 0; i < ntokens; i++) |
501 |
{ |
{ |
502 |
|
int j; |
503 |
int defaulted = 0; |
int defaulted = 0; |
504 |
int count = BITISSET (shiftset, i); |
int count = BITISSET (shiftset, i); |
505 |
|
|
506 |
for (j = m; j < n; j++) |
for (j = m; j < n; j++) |
507 |
{ |
{ |
508 |
if (BITISSET (LA (m), j)) |
if (BITISSET (LA (j), i)) |
509 |
{ |
{ |
510 |
if (count == 0) |
if (count == 0) |
511 |
{ |
{ |