|
|
researchv10 Norman
char ftGR[256-32] = { /*GR*/
12, /*space*/
0, /*!*/
0, /*"*/
0, /*#*/
20, /*$*/
0, /*%*/
20, /*&*/
10, /*' close*/
16, /*(*/
16, /*)*/
0, /***/
0, /*+*/
10, /*,*/
15, /*- hyphen*/
10, /*.*/
0, /*/*/
20+0200, /*0*/
20+0200, /*1*/
6+0200, /*2*/
6+0200, /*3*/
4+0200, /*4*/
6+0200, /*5*/
4+0200, /*6*/
15+0200, /*7*/
15+0200, /*8*/
20+0200, /*9*/
11, /*:*/
14, /*;*/
0, /*<*/
20, /*=*/
0, /*>*/
20, /*?*/
0, /*@*/
23+0200, /*A*/
26+0200, /*B*/
28+0200, /*C*/
28+0200, /*D*/
27+0200, /*E*/
30+0200, /*F*/
24+0200, /*G*/
23+0200, /*H*/
16+0200, /*I*/
20+0200, /*J*/
29+0200, /*K*/
28+0200, /*L*/
33+0200, /*M*/
30+0200, /*N*/
26+0200, /*O*/
25+0200, /*P*/
30+0300, /*Q*/
29+0200, /*R*/
27+0200, /*S*/
25+0200, /*T*/
29+0200, /*U*/
21+0200, /*V*/
24+0200, /*W*/
29+0200, /*X*/
33+0200, /*Y*/
25+0200, /*Z*/
28, /*[*/
0, /*\*/
0, /*]*/
0, /*^*/
0, /*_*/
10, /*` open*/
23, /*a*/
25+0200, /*b*/
18, /*c*/
19+0200, /*d*/
17, /*e*/
24+0200, /*f*/
21+0100, /*g*/
23+0200, /*h*/
12+0200, /*i*/
18+0300, /*j*/
21+0200, /*k*/
21+0200, /*/ exit(2);
}
break;
case 'l':
rep->r1.command = LCOM;
break;
case 's':
rep->r1.command = SCOM;
seof = *cp++;
rep->r1.re1 = p;
p = compile(rep->r1.re1);
if(p == badp) {
fprintf(stderr, CGMES, linebuf);
exit(2);
}
if(p == rep->r1.re1) {
rep->r1.re1 = op;
} else {
op = rep->r1.re1;
}
if((rep->r1.rhs = p) > reend) {
fprintf(stderr, TMMES, linebuf);
exit(2);
}
if((p = compsub(rep->r1.rhs)) == badp) {
fprintf(stderr, CGMES, linebuf);
exit(2);
}
if(*cp == 'g') {
cp++;
rep->r1.gfl++;
} else if(gflag)
rep->r1.gfl++;
if(*cp == 'p') {
cp++;
rep->r1.pfl = 1;
}
if(*cp == 'P') {
cp++;
rep->r1.pfl = 2;
}
if(*cp == 'w') {
cp++;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.