40 |
print_core (int state, struct obstack *node_obstack) |
print_core (int state, struct obstack *node_obstack) |
41 |
{ |
{ |
42 |
int i; |
int i; |
43 |
core *statep = state_table[state].state; |
state_t *statep = state_table[state]; |
44 |
|
|
45 |
if (!statep->nitems) |
if (!statep->nitems) |
46 |
return; |
return; |
85 |
{ |
{ |
86 |
int i; |
int i; |
87 |
|
|
88 |
shifts *shiftp = state_table[state].shifts; |
shifts *shiftp = state_table[state]->shifts; |
89 |
reductions *redp = state_table[state].reductions; |
reductions *redp = state_table[state]->reductions; |
90 |
#if 0 |
#if 0 |
91 |
errs *errp = err_table[state]; |
errs *errp = state_table[state]->errs; |
92 |
#endif |
#endif |
93 |
|
|
94 |
static char buff[10]; |
static char buff[10]; |
109 |
if (!SHIFT_IS_DISABLED (shiftp, i)) |
if (!SHIFT_IS_DISABLED (shiftp, i)) |
110 |
{ |
{ |
111 |
int state1 = shiftp->shifts[i]; |
int state1 = shiftp->shifts[i]; |
112 |
int symbol = state_table[state1].accessing_symbol; |
int symbol = state_table[state1]->accessing_symbol; |
113 |
|
|
114 |
new_edge (&edge); |
new_edge (&edge); |
115 |
|
|
150 |
obstack_1grow (node_obstack, '\n'); |
obstack_1grow (node_obstack, '\n'); |
151 |
} |
} |
152 |
|
|
153 |
if (state_table[state].consistent && redp) |
if (state_table[state]->consistent && redp) |
154 |
{ |
{ |
155 |
rule = redp->rules[0]; |
rule = redp->rules[0]; |
156 |
symbol = rule_table[rule].lhs; |
symbol = rule_table[rule].lhs; |
168 |
if (!SHIFT_IS_DISABLED (shiftp, i)) |
if (!SHIFT_IS_DISABLED (shiftp, i)) |
169 |
{ |
{ |
170 |
int state1 = shiftp->shifts[i]; |
int state1 = shiftp->shifts[i]; |
171 |
int symbol = state_table[state1].accessing_symbol; |
int symbol = state_table[state1]->accessing_symbol; |
172 |
|
|
173 |
new_edge (&edge); |
new_edge (&edge); |
174 |
open_edge (&edge, fgraph); |
open_edge (&edge, fgraph); |