Lines Matching full:state
1 /* Generate the nondeterministic finite state machine for Bison.
24 /* See comments in state.h for the data structures that represent it.
42 #include "state.h"
48 state *state;
56 | A state was just discovered from another state. Queue it for |
60 static state *
64 state *s = state_new (sym, core_size, core);
67 fprintf (stderr, "state_list_append (state = %d, symbol = %d (%s))\n",
71 node->state = s;
86 static state **shiftset;
176 new_itemsets (state *s)
181 fprintf (stderr, "Entering new_itemsets, state = %d\n", s->number);
205 | Find the state we would get to (from the current state) by |
206 | shifting SYM. Create a new state if no equivalent one exists |
210 static state *
213 state *s;
230 | Use the information computed by new_itemsets to find the state |
237 append_states (state *s)
242 fprintf (stderr, "Entering append_states, state = %d\n", s->number);
265 | current state and make a reductions structure for the state to |
270 save_reductions (state *s)
315 state *s = this->state;
332 | Compute the nondeterministic finite state machine (see state.h for |
344 /* Create the initial state. The 0 at the lhs is the index of the
351 state *s = list->state;
353 fprintf (stderr, "Processing state %d (reached by %s)\n",
357 state. ruleset gets a 1 bit for each rule that could reduce
361 /* Record the reductions allowed out of this state. */
369 now that the state numbers transitioning to are known. */
