Lines Matching defs:last
153 int last = lastst[mach];
155 for ( i = firstst[mach]; i <= last; ++i )
281 * new = link_machines( first, last );
283 * new - a machine constructed by connecting first to last
284 * first - the machine whose successor is to be last
285 * last - the machine whose predecessor is to be first
288 * last to produce a machine new which will pattern-match first first
289 * and then last, and will fail if either of the sub-patterns fails.
290 * FIRST is set to new by the operation. last is unmolested.
293 int link_machines( first, last )
294 int first, last;
297 return last;
299 else if ( last == NIL )
304 mkxtion( finalst[first], last );
305 finalst[first] = finalst[last];
306 lastst[first] = MAX( lastst[first], lastst[last] );
307 firstst[first] = MIN( firstst[first], firstst[last] );
412 * 1. mach must be the last machine created
