Lines Matching defs:i
53 int i, j, k;
55 i = name[v];
56 if (!ISOPERATOR(i))
57 i = 1;
58 switch (i) {
69 if (i == RSTR)
71 else if (i == RCCL || i == RNCCL) {
73 symbol[j] = (i == RNCCL);
76 symbol[*p++] = (i == RCCL);
132 int i, k, *p;
136 for (i = 0; i < tptr; i++)
137 if (p = foll[i]) {
140 (void) printf("%d:\t%d", i, *p++);
152 int i, *temp;
158 for (i = 0; i < tptr; i++)
159 if (ctemp[i] == TRUE)
160 *temp++ = i;
233 int i;
235 i = name[v];
236 if (!ISOPERATOR(i))
237 i = 1;
238 switch (i) {
273 i = stnum/2 +1;
276 if (*p++ == i) {
315 int i, j;
331 for (i = 0; i < tptr; i++)
332 tmpstat[i] = 0;
355 for (i = 0; i < ncg; i++)
356 symbol[i] = 0;
358 for (i = 1; i <= npos; i++) {
359 curpos = *(state[s]+i);
397 for (i = 1; i < ncg; i++) {
398 if (symbol[i]) {
399 printf("%d,", i);
401 if (i == ncg-1)
412 for (i = 1; i < ncg; i++) {
413 if (symbol[i]) {
415 nextstate(s, i);
418 warning("bad state %d %o", s, i);
431 tch[n] = i;
434 tch[n] = i;
459 int *pos, i, *f, num, curpos, number;
464 for (i = 0; i < num; i++) {
495 int i;
499 for (i = n; i >= 0; i--) { /* for each state */
500 j = state[i];
506 return (i);
524 int i, j, k;
540 for (i = 1; i < ncg; i++) {
541 go[i] = temp[i] = -1;
542 symbol[i] = 1;
544 for (i = 0; i < cnt; i++) {
545 index = (unsigned char) tch[i];
547 go[index] = tst[i];
552 i, (int)tch[i]);
555 for (i = 0; i < cnt; i++) {
556 c = match[tch[i]];
557 if (go[c] != tst[i] || c == tch[i])
558 temp[tch[i]] = tst[i];
561 for (i = 1; i < ncg; i++)
562 if (symbol[i])
563 temp[i] = -2; /* error trans */
566 for (i = 1; i < ncg; i++)
567 if (temp[i] != -1)
576 for (i = 1; i < ncg; i++)
577 if (temp[i] != -1) {
578 cwork[k] = i;
580 (temp[i] == -2 ? -1 : temp[i]);
597 for (i = 0; i < st; i++) {
598 if (sfall[i] != -1)
601 if (!(cpackflg[i] == 1))
603 p = gotof[i];
639 cmin = i;
696 for (i = 0; i < cnt; i++) {
697 nchar[nptr] = ach[i];
698 nexts[++nptr] = ast[i];
718 int *p, i, j;
721 i = *p++;
722 if (i == 0)
725 for (j = 1; j < i; j++) {
750 stprt(int i)
753 (void) printf("State %d:", i);
755 t = atable[i];
759 if (cpackflg[i] == TRUE)
761 if (sfall[i] != -1)
762 (void) printf("fall back state %d\n", sfall[i]);
763 p = gotof[i];
791 int *p, i, j;
801 for (i = 0; i < cnt; i++) {
823 for (i = 0; i < k; i++)
824 for (j = i+1; j < k; j++)
825 if (temp[j] < temp[i]) {
827 temp[j] = temp[i];
828 temp[i] = m;
831 for (i = 0; i < k-1; i++)
832 if (temp[i] == temp[i+1])
833 temp[i] = 0;
841 for (i = 0; i < k; i++)
842 if (temp[i] != 0) {
845 aptr, temp[i]) :
846 fprintf(fout, "%d,\n", temp[i]));
849 (void) printf("%d ", temp[i]);
853 for (i = 0; i < n; i++) { /* copy fall back actions - all neg */
855 (void) fprintf(fout, "data vstop(%d)/%d/\n", aptr, neg[i]) :
856 (void) fprintf(fout, "%d,\n", neg[i]);
860 (void) printf("%d ", neg[i]);
877 int i, j;
879 for (i = 0; i < ccount; i++) {
881 (void) printf("class %d:\n\t", i);
883 if (cindex[j] == i) {
894 for (i = 0; i < ncg; i++) {
895 allprint(match[i]);
908 int i;
910 for (i = 0; i < ccount; i++)
911 tab[i] = 0;
912 for (i = 1; i < ncg; i++)
913 if (tab[cindex[i]] == 0)
914 tab[cindex[i]] = i;
915 /* tab[i] = principal char for new ccl i */
916 for (i = 1; i < ncg; i++)
917 match[i] = tab[cindex[i]];
924 int i, j, k;
927 for (i = 0; i < outsize; i++)
928 verify[i] = advance[i] = 0;
931 for (i = 0; i <= stnum; i++) { /* for each state */
932 j = gotof[i];
934 stoff[i] = 0;
943 (void) printf("State %d: (layout)\n", i);
984 verify[k] = i + 1; /* state number + 1 */
1007 verify[k] = i+1; /* state number + 1 */
1013 stoff[i] = startup;
1016 /* stoff[i] = offset into verify, advance for trans for state i */
1036 for (i = 0; i <= yytop; i += 4) {
1038 k = i+j;
1053 for (i = 0; i <= stnum; i++) { /* for each state */
1054 if (cpackflg[i])
1055 stoff[i] = -stoff[i];
1056 (void) fprintf(fout, "yycrank+%d,\t", stoff[i]);
1057 if (sfall[i] != -1)
1059 "yysvec+%d,\t", sfall[i]+1); /* state + 1 */
1062 if (atable[i] != -1)
1063 (void) fprintf(fout, "yyvstop+%d,", atable[i]);
1067 (void) fprintf(fout, "\t\t/* state %d */", i);
1084 for (i = 0; i < ncg; i += 8) {
1087 fbch = match[i+j];
1098 for (i = 0; i < MAXNCG; i++)
1099 fbarr[i] = 0;
1100 for (i = 0; i < ncg; i++)
1101 fbarr[ctable[i]] = ctable[match[i]];
1102 for (i = 0; i < ncg; i += 8) {
1105 fbarr[i+j]);
1114 for (i = 0; i < casecount; i += 8) {
1116 (void) fprintf(fout, "%d,", i+j < NACTIONS ?
1117 extra[i+j] : 0);
1129 for (i = 0; i < ncgidtbl; ++i) {
1130 if (i%8 == 0)
1132 (void) fprintf(fout, "0x%08x, ", (int)yycgidtbl[i]);
1141 int i;
1146 for (i = 1; i <= n; i++) {
1147 if (i%8 == 1)
1149 (void) fprintf(fout, "%s (%d)/%d/", s, i, a[i]);
1150 (void) fprintf(fout, (i%8 && i < n) ? ", " : "\n");
1158 int i;
1159 for (i = n; i >= 0; i--)
1160 a[i+1] = a[i];
1166 int i;
1167 for (i = 0; i <= n; i++)
1168 a[i]++;
1174 int i, j, k;
1179 for (i = 1; i < n; i += 8) {
1180 (void) fprintf(fout, "data %s (%d)/%d/", s, i, a[i]);
1182 k = i+j;
1196 int i, *j, k;
1202 for (i = tptr-1; i >= 0; i--) {
1203 j = array[i];
1209 array[n] = array[i];