595     *aAction,                  /* The yy_action[] table under construction */  member
610 #define acttab_yyaction(X,N)  ((X)->aAction[N].action)
613 #define acttab_yylookahead(X,N)  ((X)->aAction[N].lookahead)
617   free( p->aAction );  in acttab_free()
693     p->aAction = (struct lookahead_action *) realloc( p->aAction,  in acttab_insert()
694                           sizeof(p->aAction[0])*p->nActionAlloc);  in acttab_insert()
695     if( p->aAction==0 ){  in acttab_insert()
700       p->aAction[i].lookahead = -1;  in acttab_insert()
701       p->aAction[i].action = -1;  in acttab_insert()
713     if( p->aAction[i].lookahead==p->mnLookahead ){  in acttab_insert()
716       if( p->aAction[i].action!=p->mnAction ) continue;  in acttab_insert()
720         if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break;  in acttab_insert()
721         if( p->aLookahead[j].action!=p->aAction[k].action ) break;  in acttab_insert()
729         if( p->aAction[j].lookahead<0 ) continue;  in acttab_insert()
730         if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++;  in acttab_insert()
749       if( p->aAction[i].lookahead<0 ){  in acttab_insert()
753           if( p->aAction[k].lookahead>=0 ) break;  in acttab_insert()
757           if( p->aAction[j].lookahead==j+p->mnLookahead-i ) break;  in acttab_insert()
775     p->aAction[k] = p->aLookahead[j];  in acttab_insert()
792   while( n>0 && p->aAction[n-1].lookahead<0 ){ n--; }  in acttab_action_size()
4564         if( pActtab->aAction[jj].action<0 ) nn++;  in ReportTable()