Lines Matching full:each
10 * states under terminal and non-terminal symbols. Each state represents
197 * recognizer. When the machine is constructed, each item that results
236 * the beginning and EOF as expected lookahead). Then for each state
239 * from a state we make a transition on each symbol that appears before
327 /* now create a transition out for each individual symbol */
383 /* look at each propagate link out of that item */
421 /* recursively propagate out from each item in the state */
430 * action table and a reduce-goto table. The rows in each table
465 /* consider each item in our state */
475 /* consider each lookahead symbol */
510 /* consider each outgoing transition */
557 /* consider each element */
