Lines Matching defs:lookahead

408     int lookahead;             /* Value of the lookahead token */
409 int action; /* Action to take on the given lookahead */
412 int mnLookahead; /* Minimum aLookahead[].lookahead */
414 int mxLookahead; /* Maximum aLookahead[].lookahead */
426 #define acttab_yylookahead(X,N) ((X)->aAction[N].lookahead)
448 void acttab_action(acttab *p, int lookahead, int action){
459 p->mxLookahead = lookahead;
460 p->mnLookahead = lookahead;
463 if( p->mxLookahead<lookahead ) p->mxLookahead = lookahead;
464 if( p->mnLookahead>lookahead ){
465 p->mnLookahead = lookahead;
469 p->aLookahead[p->nLookahead].lookahead = lookahead;
500 p->aAction[i].lookahead = -1;
513 if( p->aAction[i].lookahead<0 ){
515 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
517 if( p->aAction[k].lookahead>=0 ) break;
521 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) break;
526 }else if( p->aAction[i].lookahead==p->mnLookahead ){
529 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
531 if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break;
537 if( p->aAction[j].lookahead<0 ) continue;
538 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++;
547 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
553 /* Return the offset that is added to the lookahead in order to get the
909 ** rule "cfp->rp" if the lookahead symbol is "lemp->symbols[j]" */
925 ** finite state machine) an action to ACCEPT if the lookahead is the
938 /* The two actions "ap" and "nap" have the same lookahead.
3265 ** yy_lookahead[] A table containing the lookahead for each entry in