Lines Matching defs:j

53 	int i, j, k;
60 for (j = 0; j < tptr; j++)
61 tmpstat[j] = FALSE;
72 for (j = 1; j < ncg; j++)
73 symbol[j] = (i == RNCCL);
78 for (j = 1; j < ncg; j++)
79 if (symbol[j]) {
81 if (cindex[j] ==
85 *pcptr++ = cindex[j];
133 int j;
138 j = *p++;
139 if (j >= 1) {
141 for (k = 2; k <= j; k++)
315 int i, j;
368 for (j = 1; j < ncg; j++)
369 if (cindex[j] == *q)
370 symbol[j] =
457 int j, *newpos;
466 j = name[curpos];
467 if ((!ISOPERATOR(j)) && j == c ||
468 j == RSTR && c == right[curpos] ||
469 j == RCCL && member(c, (CHR *) left[curpos])) {
473 for (j = 0; j < number; j++)
477 j = 0;
481 j++;
487 count = j;
493 int *j, k;
500 j = state[i];
501 if (count == *j++) {
503 if (!temp[*j++])
524 int i, j, k;
611 j = 0;
613 while (ach[j] && p < upper) {
614 while (ach[j] < nchar[p] && ach[j]) {
616 j++;
618 if (ach[j] == 0)
620 if (ach[j] > nchar[p]) {
624 /* ach[j] == nchar[p] */
625 if (ast[j] != nexts[++p] ||
626 ast[j] == -1 ||
627 (cpackflg[st] && ach[j] != match[ach[j]]))
629 j++;
631 while (ach[j]) {
633 j++;
656 j = 0;
657 while (ach[j]) {
660 while (ach[j] < nchar[p-1] && ach[j]) {
662 nchar[nptr] = ach[j];
663 nexts[++nptr] = ast[j];
664 j++;
668 if (ach[j] > nchar[p-1]) {
672 /* ach[j] == nchar[p-1] */
673 if (ast[j] != nexts[p] ||
674 ast[j] == -1 ||
675 (cpackflg[st] && ach[j] != match[ach[j]])) {
677 nchar[nptr] = ach[j];
678 nexts[++nptr] = ast[j];
681 j++;
683 while (ach[j]) {
684 nchar[nptr] = ach[j];
685 nexts[++nptr] = ast[j++];
718 int *p, i, j;
725 for (j = 1; j < i; j++) {
727 if (j%30 == 0)
791 int *p, i, j;
824 for (j = i+1; j < k; j++)
825 if (temp[j] < temp[i]) {
826 m = temp[j];
827 temp[j] = temp[i];
877 int i, j;
882 for (j = 1; j < ncg; j++)
883 if (cindex[j] == i) {
884 allprint(j);
924 int i, j, k;
932 j = gotof[i];
933 if (j == -1) {
937 bot = j;
938 while (nchar[j])
939 j++;
940 top = j - 1;
944 for (j = bot; j <= top; j++) {
945 (void) printf(" %o", nchar[j]);
946 if (j % 10 == 0)
966 for (j = bot; j <= top; j++) {
967 k = startup+ctable[nchar[j]];
971 } while (j <= top);
978 for (j = bot; j <= top; j++) {
979 k = startup + ctable[nchar[j]];
980 if (ctable[nchar[j]] <= 0)
982 "j %d nchar %d ctable.nch %d\n",
983 j, (int)nchar[j], ctable[nchar[k]]);
985 advance[k] = nexts[j+1]+1;
994 for (j = bot; j <= top; j++) {
995 k = startup + nchar[j];
999 } while (j <= top);
1005 for (j = bot; j <= top; j++) {
1006 k = startup + nchar[j];
1008 advance[k] = nexts[j+1] + 1;
1037 for (j = 0; j < 4; j++) {
1038 k = i+j;
1085 for (j = 0; j < 8; j++) {
1087 fbch = match[i+j];
1103 for (j = 0; j < 8; j++)
1105 fbarr[i+j]);
1115 for (j = 0; j < 8; j++)
1116 (void) fprintf(fout, "%d,", i+j < NACTIONS ?
1117 extra[i+j] : 0);
1174 int i, j, k;
1181 for (j = 1; j < 8; j++) {
1182 k = i+j;
1196 int i, *j, k;
1203 j = array[i];
1204 if (j && *j++ == count) {
1206 if (!tmpstat[*j++])