t = tally[i];
w = width[i];
+ /* If VECTOR has GLR conflicts, return -1 */
+ if (conflict_tos[i] != NULL)
+ {
+ int j;
+ for (j = 0; j < t; j += 1)
+ if (conflict_tos[i][j] != 0)
+ return -1;
+ }
+
for (prev = vector - 1; prev >= 0; prev--)
{
vector_number_t j = order[prev];
return -1;
for (k = 0; match && k < t; k++)
- if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k])
+ if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k]
+ || (conflict_tos[j] != NULL && conflict_tos[j][k] != 0))
match = 0;
if (match)
if (loc > high)
high = loc;
- if (j < BASE_MIN || BASE_MAX < j)
- fatal ("base_t too small to hold %d\n", j);
+ assert (BASE_MIN <= j && j <= BASE_MAX);
return j;
}
}
token_actions ();
goto_actions ();
- XFREE (goto_map + ntokens);
- XFREE (from_state);
- XFREE (to_state);
+ free (goto_map + ntokens);
+ free (from_state);
+ free (to_state);
order = XCALLOC (vector_number_t, nvectors);
sort_actions ();
for (i = 0; i < nvectors; i++)
{
- XFREE (froms[i]);
- XFREE (tos[i]);
+ free (froms[i]);
+ free (tos[i]);
XFREE (conflict_tos[i]);
}