rem: for (i = f->accept; i >= 0; i--) if (setvec[i] == 1) *++p = i;
add: for (i = f->accept; i >= 0; i--) { if (setvec[i] == 1) *++p = i; }
context: cfoll(f, v)	/* enter follow set of each leaf of vertex v into lfollow[leaf] */	fa *f;	register Node *v;{	register int i;	register int *p;	switch(type(v)) {	LEAF		f->re[(int) left(v)].ltype = type(v);		f->re[(int) left(v)].lval = (int) right(v);		for (i=0; i<=f->accept; i++)			setvec[i] = 0;		setcnt = 0;		follow(v);	/* computes setvec and setcnt */		if ((p = (int *) calloc(1, (setcnt+1)*sizeof(int))) == NULL)			overflo("follow set overflow");		f->re[(int) left(v)].lfollow = p;		*p = setcnt;		for (i = f->accept; i >= 0; i--)			if (setvec[i] == 1) *++p = i;		break;	UNARY		cfoll(f,left(v));		break;	case CAT:	case OR:		cfoll(f,left(v));		cfoll(f,right(v));		break;	default:		ERROR "unknown type %d in cfoll", type(v) FATAL;	}}