410   } *aAction,                  /* The yy_action[] table under construction */  member
423 #define acttab_yyaction(X,N)  ((X)->aAction[N].action)
426 #define acttab_yylookahead(X,N)  ((X)->aAction[N].lookahead)
430   free( p->aAction );  in acttab_free()
493     p->aAction = realloc( p->aAction,  in acttab_insert()
494                           sizeof(p->aAction[0])*p->nActionAlloc);  in acttab_insert()
495     if( p->aAction==0 ){  in acttab_insert()
500       p->aAction[i].lookahead = -1;  in acttab_insert()
501       p->aAction[i].action = -1;  in acttab_insert()
513     if( p->aAction[i].lookahead<0 ){  in acttab_insert()
517         if( p->aAction[k].lookahead>=0 ) break;  in acttab_insert()
521         if( p->aAction[j].lookahead==j+p->mnLookahead-i ) break;  in acttab_insert()
526     }else if( p->aAction[i].lookahead==p->mnLookahead ){  in acttab_insert()
527       if( p->aAction[i].action!=p->mnAction ) continue;  in acttab_insert()
531         if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break;  in acttab_insert()
532         if( p->aLookahead[j].action!=p->aAction[k].action ) break;  in acttab_insert()
537         if( p->aAction[j].lookahead<0 ) continue;  in acttab_insert()
538         if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++;  in acttab_insert()
548     p->aAction[k] = p->aLookahead[j];  in acttab_insert()