home *** CD-ROM | disk | FTP | other *** search
/ Geek Gadgets 1 / ADE-1.bin / ade-dist / unixtex-6.1b-src.tgz / tar.out / contrib / unixtex / web2c / web / tangleboot.p < prev    next >
Text File  |  1996-09-28  |  47KB  |  823 lines
  1. {2:}program TANGLE;label 9999;const{8:}bufsize=100;maxbytes=45000;
  2. maxtoks=50000;maxnames=5000;maxtexts=2000;hashsize=353;longestname=400;
  3. linelength=72;outbufsize=144;stacksize=100;maxidlength=50;
  4. unambiglength=20;{:8}type{11:}ASCIIcode=0..255;{:11}{12:}
  5. textfile=packed file of ASCIIcode;{:12}{37:}eightbits=0..255;
  6. sixteenbits=0..65535;{:37}{39:}namepointer=0..maxnames;{:39}{43:}
  7. textpointer=0..maxtexts;{:43}{78:}
  8. outputstate=record endfield:sixteenbits;bytefield:sixteenbits;
  9. namefield:namepointer;replfield:textpointer;modfield:0..12287;end;{:78}
  10. var{9:}history:0..3;{:9}{13:}xord:array[ASCIIcode]of ASCIIcode;
  11. xchr:array[ASCIIcode]of ASCIIcode;{:13}{23:}webfile:textfile;
  12. changefile:textfile;{:23}{25:}Pascalfile:textfile;pool:textfile;{:25}
  13. {27:}buffer:array[0..bufsize]of ASCIIcode;{:27}{29:}phaseone:boolean;
  14. {:29}{38:}bytemem:packed array[0..2,0..maxbytes]of ASCIIcode;
  15. tokmem:packed array[0..3,0..maxtoks]of eightbits;
  16. bytestart:array[0..maxnames]of sixteenbits;
  17. tokstart:array[0..maxtexts]of sixteenbits;
  18. link:array[0..maxnames]of sixteenbits;
  19. ilk:array[0..maxnames]of sixteenbits;
  20. equiv:array[0..maxnames]of sixteenbits;
  21. textlink:array[0..maxtexts]of sixteenbits;{:38}{40:}nameptr:namepointer;
  22. stringptr:namepointer;byteptr:array[0..2]of 0..maxbytes;
  23. poolchecksum:integer;{:40}{44:}textptr:textpointer;
  24. tokptr:array[0..3]of 0..maxtoks;z:0..3;
  25. {maxtokptr:array[0..3]of 0..maxtoks;}{:44}{50:}idfirst:0..bufsize;
  26. idloc:0..bufsize;doublechars:0..bufsize;
  27. hash,chophash:array[0..hashsize]of sixteenbits;
  28. choppedid:array[0..unambiglength]of ASCIIcode;{:50}{65:}
  29. modtext:array[0..longestname]of ASCIIcode;{:65}{70:}
  30. lastunnamed:textpointer;{:70}{79:}curstate:outputstate;
  31. stack:array[1..stacksize]of outputstate;stackptr:0..stacksize;{:79}{80:}
  32. zo:0..3;{:80}{82:}bracelevel:eightbits;{:82}{86:}curval:integer;{:86}
  33. {94:}outbuf:array[0..outbufsize]of ASCIIcode;outptr:0..outbufsize;
  34. breakptr:0..outbufsize;semiptr:0..outbufsize;{:94}{95:}
  35. outstate:eightbits;outval,outapp:integer;outsign:ASCIIcode;
  36. lastsign:-1..+1;{:95}{100:}outcontrib:array[1..linelength]of ASCIIcode;
  37. {:100}{124:}ii:integer;line:integer;otherline:integer;templine:integer;
  38. limit:0..bufsize;loc:0..bufsize;inputhasended:boolean;changing:boolean;
  39. {:124}{126:}changebuffer:array[0..bufsize]of ASCIIcode;
  40. changelimit:0..bufsize;{:126}{143:}curmodule:namepointer;
  41. scanninghex:boolean;{:143}{156:}nextcontrol:eightbits;{:156}{164:}
  42. currepltext:textpointer;{:164}{171:}modulecount:0..12287;{:171}{179:}
  43. {troubleshooting:boolean;ddt:integer;dd:integer;debugcycle:integer;
  44. debugskipped:integer;}{:179}{185:}{wo:0..2;}{:185}{189:}
  45. webname,chgname,pascalfilename,poolfilename:array[1..PATHMAX]of char;
  46. {:189}{30:}{procedure debughelp;forward;}{:30}{31:}procedure error;
  47. var j:0..outbufsize;k,l:0..bufsize;begin if phaseone then{32:}
  48. begin if changing then write(stdout,'. (change file ')else write(stdout,
  49. '. (');writeln(stdout,'l.',line:1,')');
  50. if loc>=limit then l:=limit else l:=loc;
  51. for k:=1 to l do if buffer[k-1]=9 then write(stdout,' ')else write(
  52. stdout,xchr[buffer[k-1]]);writeln(stdout);
  53. for k:=1 to l do write(stdout,' ');
  54. for k:=l+1 to limit do write(stdout,xchr[buffer[k-1]]);
  55. write(stdout,' ');end{:32}else{33:}
  56. begin writeln(stdout,'. (l.',line:1,')');
  57. for j:=1 to outptr do write(stdout,xchr[outbuf[j-1]]);
  58. write(stdout,'... ');end{:33};flush(stdout);history:=2;{debughelp;}end;
  59. {:31}{190:}procedure scanargs;var dotpos,slashpos,i,a:integer;c:char;
  60. fname:array[1..PATHMAX]of char;foundweb,foundchange:boolean;
  61. begin foundweb:=false;foundchange:=false;
  62. for a:=1 to argc-1 do begin argv(a,fname);
  63. if fname[1]<>'-'then begin if not foundweb then{191:}begin dotpos:=-1;
  64. slashpos:=-1;i:=1;
  65. while(fname[i]<>' ')and(i<=PATHMAX-5)do begin webname[i]:=fname[i];
  66. if fname[i]='.'then dotpos:=i;if fname[i]='/'then slashpos:=i;i:=i+1;
  67. end;webname[i]:=' ';
  68. if(dotpos=-1)or(dotpos<slashpos)then begin dotpos:=i;
  69. webname[dotpos]:='.';webname[dotpos+1]:='w';webname[dotpos+2]:='e';
  70. webname[dotpos+3]:='b';webname[dotpos+4]:=' ';end;
  71. for i:=1 to dotpos do begin c:=webname[i];pascalfilename[i]:=c;
  72. poolfilename[i]:=c;end;pascalfilename[dotpos+1]:='p';
  73. pascalfilename[dotpos+2]:=' ';poolfilename[dotpos+1]:='p';
  74. poolfilename[dotpos+2]:='o';poolfilename[dotpos+3]:='o';
  75. poolfilename[dotpos+4]:='l';poolfilename[dotpos+5]:=' ';foundweb:=true;
  76. end{:191}else if not foundchange then{192:}begin dotpos:=-1;
  77. slashpos:=-1;i:=1;
  78. while(fname[i]<>' ')and(i<=PATHMAX-5)do begin chgname[i]:=fname[i];
  79. if fname[i]='.'then dotpos:=i;if fname[i]='/'then slashpos:=i;i:=i+1;
  80. end;chgname[i]:=' ';
  81. if(dotpos=-1)or(dotpos<slashpos)then begin dotpos:=i;
  82. chgname[dotpos]:='.';chgname[dotpos+1]:='c';chgname[dotpos+2]:='h';
  83. chgname[dotpos+3]:=' ';end;foundchange:=true;end{:192}else{195:}
  84. begin writeln(stdout,'Usage: tangle webfile[.web] [changefile[.ch]].');
  85. uexit(1);end{:195};end else{194:}begin{195:}
  86. begin writeln(stdout,'Usage: tangle webfile[.web] [changefile[.ch]].');
  87. uexit(1);end{:195};end{:194};end;if not foundweb then{195:}
  88. begin writeln(stdout,'Usage: tangle webfile[.web] [changefile[.ch]].');
  89. uexit(1);end{:195};if not foundchange then{193:}begin chgname[1]:='/';
  90. chgname[2]:='d';chgname[3]:='e';chgname[4]:='v';chgname[5]:='/';
  91. chgname[6]:='n';chgname[7]:='u';chgname[8]:='l';chgname[9]:='l';
  92. chgname[10]:=' ';end{:193};end;{:190}procedure initialize;var{16:}
  93. i:0..255;{:16}{41:}wi:0..2;{:41}{45:}zi:0..3;{:45}{51:}h:0..hashsize;
  94. {:51}begin{10:}history:=0;{:10}{14:}xchr[32]:=' ';xchr[33]:='!';
  95. xchr[34]:='"';xchr[35]:='#';xchr[36]:='$';xchr[37]:='%';xchr[38]:='&';
  96. xchr[39]:='''';xchr[40]:='(';xchr[41]:=')';xchr[42]:='*';xchr[43]:='+';
  97. xchr[44]:=',';xchr[45]:='-';xchr[46]:='.';xchr[47]:='/';xchr[48]:='0';
  98. xchr[49]:='1';xchr[50]:='2';xchr[51]:='3';xchr[52]:='4';xchr[53]:='5';
  99. xchr[54]:='6';xchr[55]:='7';xchr[56]:='8';xchr[57]:='9';xchr[58]:=':';
  100. xchr[59]:=';';xchr[60]:='<';xchr[61]:='=';xchr[62]:='>';xchr[63]:='?';
  101. xchr[64]:='@';xchr[65]:='A';xchr[66]:='B';xchr[67]:='C';xchr[68]:='D';
  102. xchr[69]:='E';xchr[70]:='F';xchr[71]:='G';xchr[72]:='H';xchr[73]:='I';
  103. xchr[74]:='J';xchr[75]:='K';xchr[76]:='L';xchr[77]:='M';xchr[78]:='N';
  104. xchr[79]:='O';xchr[80]:='P';xchr[81]:='Q';xchr[82]:='R';xchr[83]:='S';
  105. xchr[84]:='T';xchr[85]:='U';xchr[86]:='V';xchr[87]:='W';xchr[88]:='X';
  106. xchr[89]:='Y';xchr[90]:='Z';xchr[91]:='[';xchr[92]:='\';xchr[93]:=']';
  107. xchr[94]:='^';xchr[95]:='_';xchr[96]:='`';xchr[97]:='a';xchr[98]:='b';
  108. xchr[99]:='c';xchr[100]:='d';xchr[101]:='e';xchr[102]:='f';
  109. xchr[103]:='g';xchr[104]:='h';xchr[105]:='i';xchr[106]:='j';
  110. xchr[107]:='k';xchr[108]:='l';xchr[109]:='m';xchr[110]:='n';
  111. xchr[111]:='o';xchr[112]:='p';xchr[113]:='q';xchr[114]:='r';
  112. xchr[115]:='s';xchr[116]:='t';xchr[117]:='u';xchr[118]:='v';
  113. xchr[119]:='w';xchr[120]:='x';xchr[121]:='y';xchr[122]:='z';
  114. xchr[123]:='{';xchr[124]:='|';xchr[125]:='}';xchr[126]:='~';
  115. xchr[0]:=' ';xchr[127]:=' ';{:14}{17:}for i:=1 to 31 do xchr[i]:=chr(i);
  116. for i:=128 to 255 do xchr[i]:=chr(i);{:17}{18:}
  117. for i:=0 to 255 do xord[chr(i)]:=32;for i:=1 to 255 do xord[xchr[i]]:=i;
  118. xord[' ']:=32;{:18}{21:}{:21}{26:}scanargs;
  119. rewrite(Pascalfile,pascalfilename);{:26}{42:}
  120. for wi:=0 to 2 do begin bytestart[wi]:=0;byteptr[wi]:=0;end;
  121. bytestart[3]:=0;nameptr:=1;stringptr:=256;poolchecksum:=271828;{:42}
  122. {46:}for zi:=0 to 3 do begin tokstart[zi]:=0;tokptr[zi]:=0;end;
  123. tokstart[4]:=0;textptr:=1;z:=1 mod 4;{:46}{48:}ilk[0]:=0;equiv[0]:=0;
  124. {:48}{52:}for h:=0 to hashsize-1 do begin hash[h]:=0;chophash[h]:=0;end;
  125. {:52}{71:}lastunnamed:=0;textlink[0]:=0;{:71}{144:}scanninghex:=false;
  126. {:144}{152:}modtext[0]:=32;{:152}{180:}{troubleshooting:=true;
  127. debugcycle:=1;debugskipped:=0;troubleshooting:=false;debugcycle:=99999;}
  128. {:180}end;{:2}{24:}procedure openinput;begin reset(webfile,webname);
  129. reset(changefile,chgname);end;{:24}{28:}
  130. function inputln(var f:textfile):boolean;var finallimit:0..bufsize;
  131. begin limit:=0;finallimit:=0;
  132. if eof(f)then inputln:=false else begin while not eoln(f)do begin buffer
  133. [limit]:=xord[getc(f)];limit:=limit+1;
  134. if buffer[limit-1]<>32 then finallimit:=limit;
  135. if limit=bufsize then begin while not eoln(f)do vgetc(f);limit:=limit-1;
  136. if finallimit>limit then finallimit:=limit;begin writeln(stdout);
  137. write(stdout,'! Input line too long');end;loc:=0;error;end;end;
  138. readln(f);limit:=finallimit;inputln:=true;end;end;{:28}{49:}
  139. procedure printid(p:namepointer);var k:0..maxbytes;w:0..2;
  140. begin if p>=nameptr then write(stdout,'IMPOSSIBLE')else begin w:=p mod 3
  141. ;
  142. for k:=bytestart[p]to bytestart[p+3]-1 do write(stdout,xchr[bytemem[w,k]
  143. ]);end;end;{:49}{53:}function idlookup(t:eightbits):namepointer;
  144. label 31,32;var c:eightbits;i:0..bufsize;h:0..hashsize;k:0..maxbytes;
  145. w:0..2;l:0..bufsize;p,q:namepointer;s:0..unambiglength;
  146. begin l:=idloc-idfirst;{54:}h:=buffer[idfirst];i:=idfirst+1;
  147. while i<idloc do begin h:=(h+h+buffer[i])mod hashsize;i:=i+1;end{:54};
  148. {55:}p:=hash[h];
  149. while p<>0 do begin if bytestart[p+3]-bytestart[p]=l then{56:}
  150. begin i:=idfirst;k:=bytestart[p];w:=p mod 3;
  151. while(i<idloc)and(buffer[i]=bytemem[w,k])do begin i:=i+1;k:=k+1;end;
  152. if i=idloc then goto 31;end{:56};p:=link[p];end;p:=nameptr;
  153. link[p]:=hash[h];hash[h]:=p;31:{:55};if(p=nameptr)or(t<>0)then{57:}
  154. begin if((p<>nameptr)and(t<>0)and(ilk[p]=0))or((p=nameptr)and(t=0)and(
  155. buffer[idfirst]<>34))then{58:}begin i:=idfirst;s:=0;h:=0;
  156. while(i<idloc)and(s<unambiglength)do begin if buffer[i]<>95 then begin
  157. if buffer[i]>=97 then choppedid[s]:=buffer[i]-32 else choppedid[s]:=
  158. buffer[i];h:=(h+h+choppedid[s])mod hashsize;s:=s+1;end;i:=i+1;end;
  159. choppedid[s]:=0;end{:58};if p<>nameptr then{59:}
  160. begin if ilk[p]=0 then begin if t=1 then begin writeln(stdout);
  161. write(stdout,'! This identifier has already appeared');error;end;{60:}
  162. q:=chophash[h];
  163. if q=p then chophash[h]:=equiv[p]else begin while equiv[q]<>p do q:=
  164. equiv[q];equiv[q]:=equiv[p];end{:60};end else begin writeln(stdout);
  165. write(stdout,'! This identifier was defined before');error;end;
  166. ilk[p]:=t;end{:59}else{61:}
  167. begin if(t=0)and(buffer[idfirst]<>34)then{62:}begin q:=chophash[h];
  168. while q<>0 do begin{63:}begin k:=bytestart[q];s:=0;w:=q mod 3;
  169. while(k<bytestart[q+3])and(s<unambiglength)do begin c:=bytemem[w,k];
  170. if c<>95 then begin if choppedid[s]<>c then goto 32;s:=s+1;end;k:=k+1;
  171. end;if(k=bytestart[q+3])and(choppedid[s]<>0)then goto 32;
  172. begin writeln(stdout);write(stdout,'! Identifier conflict with ');end;
  173. for k:=bytestart[q]to bytestart[q+3]-1 do write(stdout,xchr[bytemem[w,k]
  174. ]);error;q:=0;32:end{:63};q:=equiv[q];end;equiv[p]:=chophash[h];
  175. chophash[h]:=p;end{:62};w:=nameptr mod 3;k:=byteptr[w];
  176. if k+l>maxbytes then begin writeln(stdout);
  177. write(stdout,'! Sorry, ','byte memory',' capacity exceeded');error;
  178. history:=3;uexit(1);end;
  179. if nameptr>maxnames-3 then begin writeln(stdout);
  180. write(stdout,'! Sorry, ','name',' capacity exceeded');error;history:=3;
  181. uexit(1);end;i:=idfirst;while i<idloc do begin bytemem[w,k]:=buffer[i];
  182. k:=k+1;i:=i+1;end;byteptr[w]:=k;bytestart[nameptr+3]:=k;
  183. nameptr:=nameptr+1;if buffer[idfirst]<>34 then ilk[p]:=t else{64:}
  184. begin ilk[p]:=1;
  185. if l-doublechars=2 then equiv[p]:=buffer[idfirst+1]+32768 else begin if
  186. stringptr=256 then rewrite(pool,poolfilename);equiv[p]:=stringptr+32768;
  187. l:=l-doublechars-1;if l>99 then begin writeln(stdout);
  188. write(stdout,'! Preprocessed string is too long');error;end;
  189. stringptr:=stringptr+1;write(pool,xchr[48+l div 10],xchr[48+l mod 10]);
  190. poolchecksum:=poolchecksum+poolchecksum+l;
  191. while poolchecksum>536870839 do poolchecksum:=poolchecksum-536870839;
  192. i:=idfirst+1;while i<idloc do begin write(pool,xchr[buffer[i]]);
  193. poolchecksum:=poolchecksum+poolchecksum+buffer[i];
  194. while poolchecksum>536870839 do poolchecksum:=poolchecksum-536870839;
  195. if(buffer[i]=34)or(buffer[i]=64)then i:=i+2 else i:=i+1;end;
  196. writeln(pool);end;end{:64};end{:61};end{:57};idlookup:=p;end;{:53}{66:}
  197. function modlookup(l:sixteenbits):namepointer;label 31;var c:0..4;
  198. j:0..longestname;k:0..maxbytes;w:0..2;p:namepointer;q:namepointer;
  199. begin c:=2;q:=0;p:=ilk[0];while p<>0 do begin{68:}begin k:=bytestart[p];
  200. w:=p mod 3;c:=1;j:=1;
  201. while(k<bytestart[p+3])and(j<=l)and(modtext[j]=bytemem[w,k])do begin k:=
  202. k+1;j:=j+1;end;
  203. if k=bytestart[p+3]then if j>l then c:=1 else c:=4 else if j>l then c:=3
  204. else if modtext[j]<bytemem[w,k]then c:=0 else c:=2;end{:68};q:=p;
  205. if c=0 then p:=link[q]else if c=2 then p:=ilk[q]else goto 31;end;{67:}
  206. w:=nameptr mod 3;k:=byteptr[w];
  207. if k+l>maxbytes then begin writeln(stdout);
  208. write(stdout,'! Sorry, ','byte memory',' capacity exceeded');error;
  209. history:=3;uexit(1);end;
  210. if nameptr>maxnames-3 then begin writeln(stdout);
  211. write(stdout,'! Sorry, ','name',' capacity exceeded');error;history:=3;
  212. uexit(1);end;p:=nameptr;if c=0 then link[q]:=p else ilk[q]:=p;
  213. link[p]:=0;ilk[p]:=0;c:=1;equiv[p]:=0;
  214. for j:=1 to l do bytemem[w,k+j-1]:=modtext[j];byteptr[w]:=k+l;
  215. bytestart[nameptr+3]:=k+l;nameptr:=nameptr+1;{:67};
  216. 31:if c<>1 then begin begin writeln(stdout);
  217. write(stdout,'! Incompatible section names');error;end;p:=0;end;
  218. modlookup:=p;end;{:66}{69:}
  219. function prefixlookup(l:sixteenbits):namepointer;var c:0..4;
  220. count:0..maxnames;j:0..longestname;k:0..maxbytes;w:0..2;p:namepointer;
  221. q:namepointer;r:namepointer;begin q:=0;p:=ilk[0];count:=0;r:=0;
  222. while p<>0 do begin{68:}begin k:=bytestart[p];w:=p mod 3;c:=1;j:=1;
  223. while(k<bytestart[p+3])and(j<=l)and(modtext[j]=bytemem[w,k])do begin k:=
  224. k+1;j:=j+1;end;
  225. if k=bytestart[p+3]then if j>l then c:=1 else c:=4 else if j>l then c:=3
  226. else if modtext[j]<bytemem[w,k]then c:=0 else c:=2;end{:68};
  227. if c=0 then p:=link[p]else if c=2 then p:=ilk[p]else begin r:=p;
  228. count:=count+1;q:=ilk[p];p:=link[p];end;if p=0 then begin p:=q;q:=0;end;
  229. end;if count<>1 then if count=0 then begin writeln(stdout);
  230. write(stdout,'! Name does not match');error;
  231. end else begin writeln(stdout);write(stdout,'! Ambiguous prefix');error;
  232. end;prefixlookup:=r;end;{:69}{73:}
  233. procedure storetwobytes(x:sixteenbits);
  234. begin if tokptr[z]+2>maxtoks then begin writeln(stdout);
  235. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  236. uexit(1);end;tokmem[z,tokptr[z]]:=x div 256;
  237. tokmem[z,tokptr[z]+1]:=x mod 256;tokptr[z]:=tokptr[z]+2;end;{:73}{74:}
  238. {procedure printrepl(p:textpointer);var k:0..maxtoks;a:sixteenbits;
  239. zp:0..3;
  240. begin if p>=textptr then write(stdout,'BAD')else begin k:=tokstart[p];
  241. zp:=p mod 4;while k<tokstart[p+4]do begin a:=tokmem[zp,k];
  242. if a>=128 then[75:]begin k:=k+1;
  243. if a<168 then begin a:=(a-128)*256+tokmem[zp,k];printid(a);
  244. if bytemem[a mod 3,bytestart[a]]=34 then write(stdout,'"')else write(
  245. stdout,' ');end else if a<208 then begin write(stdout,'@<');
  246. printid((a-168)*256+tokmem[zp,k]);write(stdout,'@>');
  247. end else begin a:=(a-208)*256+tokmem[zp,k];
  248. write(stdout,'@',xchr[123],a:1,'@',xchr[125]);end;
  249. end[:75]else[76:]case a of 9:write(stdout,'@',xchr[123]);
  250. 10:write(stdout,'@',xchr[125]);12:write(stdout,'@''');
  251. 13:write(stdout,'@"');125:write(stdout,'@$');0:write(stdout,'#');
  252. 64:write(stdout,'@@');2:write(stdout,'@=');3:write(stdout,'@\');
  253. others:write(stdout,xchr[a])end[:76];k:=k+1;end;end;end;}{:74}{84:}
  254. procedure pushlevel(p:namepointer);
  255. begin if stackptr=stacksize then begin writeln(stdout);
  256. write(stdout,'! Sorry, ','stack',' capacity exceeded');error;history:=3;
  257. uexit(1);end else begin stack[stackptr]:=curstate;stackptr:=stackptr+1;
  258. curstate.namefield:=p;curstate.replfield:=equiv[p];
  259. zo:=curstate.replfield mod 4;
  260. curstate.bytefield:=tokstart[curstate.replfield];
  261. curstate.endfield:=tokstart[curstate.replfield+4];curstate.modfield:=0;
  262. end;end;{:84}{85:}procedure poplevel;label 10;
  263. begin if textlink[curstate.replfield]=0 then begin if ilk[curstate.
  264. namefield]=3 then{91:}begin nameptr:=nameptr-1;textptr:=textptr-1;
  265. z:=textptr mod 4;{if tokptr[z]>maxtokptr[z]then maxtokptr[z]:=tokptr[z];
  266. }tokptr[z]:=tokstart[textptr];
  267. {byteptr[nameptr mod 3]:=byteptr[nameptr mod 3]-1;}end{:91};
  268. end else if textlink[curstate.replfield]<maxtexts then begin curstate.
  269. replfield:=textlink[curstate.replfield];zo:=curstate.replfield mod 4;
  270. curstate.bytefield:=tokstart[curstate.replfield];
  271. curstate.endfield:=tokstart[curstate.replfield+4];goto 10;end;
  272. stackptr:=stackptr-1;if stackptr>0 then begin curstate:=stack[stackptr];
  273. zo:=curstate.replfield mod 4;end;10:end;{:85}{87:}
  274. function getoutput:sixteenbits;label 20,30,31;var a:sixteenbits;
  275. b:eightbits;bal:sixteenbits;k:0..maxbytes;w:0..2;
  276. begin 20:if stackptr=0 then begin a:=0;goto 31;end;
  277. if curstate.bytefield=curstate.endfield then begin curval:=-curstate.
  278. modfield;poplevel;if curval=0 then goto 20;a:=129;goto 31;end;
  279. a:=tokmem[zo,curstate.bytefield];
  280. curstate.bytefield:=curstate.bytefield+1;if a<128 then if a=0 then{92:}
  281. begin pushlevel(nameptr-1);goto 20;end{:92}else goto 31;
  282. a:=(a-128)*256+tokmem[zo,curstate.bytefield];
  283. curstate.bytefield:=curstate.bytefield+1;if a<10240 then{89:}
  284. begin case ilk[a]of 0:begin curval:=a;a:=130;end;
  285. 1:begin curval:=equiv[a]-32768;a:=128;end;2:begin pushlevel(a);goto 20;
  286. end;3:begin{90:}
  287. while(curstate.bytefield=curstate.endfield)and(stackptr>0)do poplevel;
  288. if(stackptr=0)or(tokmem[zo,curstate.bytefield]<>40)then begin begin
  289. writeln(stdout);write(stdout,'! No parameter given for ');end;
  290. printid(a);error;goto 20;end;{93:}bal:=1;
  291. curstate.bytefield:=curstate.bytefield+1;
  292. while true do begin b:=tokmem[zo,curstate.bytefield];
  293. curstate.bytefield:=curstate.bytefield+1;
  294. if b=0 then storetwobytes(nameptr+32767)else begin if b>=128 then begin
  295. begin if tokptr[z]=maxtoks then begin writeln(stdout);
  296. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  297. uexit(1);end;tokmem[z,tokptr[z]]:=b;tokptr[z]:=tokptr[z]+1;end;
  298. b:=tokmem[zo,curstate.bytefield];
  299. curstate.bytefield:=curstate.bytefield+1;
  300. end else case b of 40:bal:=bal+1;41:begin bal:=bal-1;
  301. if bal=0 then goto 30;end;
  302. 39:repeat begin if tokptr[z]=maxtoks then begin writeln(stdout);
  303. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  304. uexit(1);end;tokmem[z,tokptr[z]]:=b;tokptr[z]:=tokptr[z]+1;end;
  305. b:=tokmem[zo,curstate.bytefield];
  306. curstate.bytefield:=curstate.bytefield+1;until b=39;others:end;
  307. begin if tokptr[z]=maxtoks then begin writeln(stdout);
  308. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  309. uexit(1);end;tokmem[z,tokptr[z]]:=b;tokptr[z]:=tokptr[z]+1;end;end;end;
  310. 30:{:93};equiv[nameptr]:=textptr;ilk[nameptr]:=2;w:=nameptr mod 3;
  311. k:=byteptr[w];{if k=maxbytes then begin writeln(stdout);
  312. write(stdout,'! Sorry, ','byte memory',' capacity exceeded');error;
  313. history:=3;uexit(1);end;bytemem[w,k]:=35;k:=k+1;byteptr[w]:=k;}
  314. if nameptr>maxnames-3 then begin writeln(stdout);
  315. write(stdout,'! Sorry, ','name',' capacity exceeded');error;history:=3;
  316. uexit(1);end;bytestart[nameptr+3]:=k;nameptr:=nameptr+1;
  317. if textptr>maxtexts-4 then begin writeln(stdout);
  318. write(stdout,'! Sorry, ','text',' capacity exceeded');error;history:=3;
  319. uexit(1);end;textlink[textptr]:=0;tokstart[textptr+4]:=tokptr[z];
  320. textptr:=textptr+1;z:=textptr mod 4{:90};pushlevel(a);goto 20;end;
  321. others:begin writeln(stdout);
  322. write(stdout,'! This can''t happen (','output',')');error;history:=3;
  323. uexit(1);end end;goto 31;end{:89};if a<20480 then{88:}begin a:=a-10240;
  324. if equiv[a]<>0 then pushlevel(a)else if a<>0 then begin begin writeln(
  325. stdout);write(stdout,'! Not present: <');end;printid(a);
  326. write(stdout,'>');error;end;goto 20;end{:88};curval:=a-20480;a:=129;
  327. curstate.modfield:=curval;31:{if troubleshooting then debughelp;}
  328. getoutput:=a;end;{:87}{97:}procedure flushbuffer;var k:0..outbufsize;
  329. b:0..outbufsize;begin b:=breakptr;
  330. if(semiptr<>0)and(outptr-semiptr<=linelength)then breakptr:=semiptr;
  331. for k:=1 to breakptr do write(Pascalfile,xchr[outbuf[k-1]]);
  332. writeln(Pascalfile);line:=line+1;
  333. if line mod 100=0 then begin write(stdout,'.');
  334. if line mod 500=0 then write(stdout,line:1);flush(stdout);end;
  335. if breakptr<outptr then begin if outbuf[breakptr]=32 then begin breakptr
  336. :=breakptr+1;if breakptr>b then b:=breakptr;end;
  337. for k:=breakptr to outptr-1 do outbuf[k-breakptr]:=outbuf[k];end;
  338. outptr:=outptr-breakptr;breakptr:=b-breakptr;semiptr:=0;
  339. if outptr>linelength then begin begin writeln(stdout);
  340. write(stdout,'! Long line must be truncated');error;end;
  341. outptr:=linelength;end;end;{:97}{99:}procedure appval(v:integer);
  342. var k:0..outbufsize;begin k:=outbufsize;repeat outbuf[k]:=v mod 10;
  343. v:=v div 10;k:=k-1;until v=0;repeat k:=k+1;
  344. begin outbuf[outptr]:=outbuf[k]+48;outptr:=outptr+1;end;
  345. until k=outbufsize;end;{:99}{101:}procedure sendout(t:eightbits;
  346. v:sixteenbits);label 20;var k:0..linelength;begin{102:}
  347. 20:case outstate of 1:if t<>3 then begin breakptr:=outptr;
  348. if t=2 then begin outbuf[outptr]:=32;outptr:=outptr+1;end;end;
  349. 2:begin begin outbuf[outptr]:=44-outapp;outptr:=outptr+1;end;
  350. if outptr>linelength then flushbuffer;breakptr:=outptr;end;
  351. 3,4:begin{103:}
  352. if(outval<0)or((outval=0)and(lastsign<0))then begin outbuf[outptr]:=45;
  353. outptr:=outptr+1;
  354. end else if outsign>0 then begin outbuf[outptr]:=outsign;
  355. outptr:=outptr+1;end;appval(abs(outval));
  356. if outptr>linelength then flushbuffer;{:103};outstate:=outstate-2;
  357. goto 20;end;5:{104:}begin if(t=3)or({105:}
  358. ((t=2)and(v=3)and(((outcontrib[1]=68)and(outcontrib[2]=73)and(outcontrib
  359. [3]=86))or((outcontrib[1]=100)and(outcontrib[2]=105)and(outcontrib[3]=
  360. 118))or((outcontrib[1]=77)and(outcontrib[2]=79)and(outcontrib[3]=68))or(
  361. (outcontrib[1]=109)and(outcontrib[2]=111)and(outcontrib[3]=100))))or((t=
  362. 0)and((v=42)or(v=47))){:105})then begin{103:}
  363. if(outval<0)or((outval=0)and(lastsign<0))then begin outbuf[outptr]:=45;
  364. outptr:=outptr+1;
  365. end else if outsign>0 then begin outbuf[outptr]:=outsign;
  366. outptr:=outptr+1;end;appval(abs(outval));
  367. if outptr>linelength then flushbuffer;{:103};outsign:=43;outval:=outapp;
  368. end else outval:=outval+outapp;outstate:=3;goto 20;end{:104};
  369. 0:if t<>3 then breakptr:=outptr;others:end{:102};
  370. if t<>0 then for k:=1 to v do begin outbuf[outptr]:=outcontrib[k];
  371. outptr:=outptr+1;end else begin outbuf[outptr]:=v;outptr:=outptr+1;end;
  372. if outptr>linelength then flushbuffer;
  373. if(t=0)and((v=59)or(v=125))then begin semiptr:=outptr;breakptr:=outptr;
  374. end;if t>=2 then outstate:=1 else outstate:=0 end;{:101}{106:}
  375. procedure sendsign(v:integer);
  376. begin case outstate of 2,4:outapp:=outapp*v;3:begin outapp:=v;
  377. outstate:=4;end;5:begin outval:=outval+outapp;outapp:=v;outstate:=4;end;
  378. others:begin breakptr:=outptr;outapp:=v;outstate:=2;end end;
  379. lastsign:=outapp;end;{:106}{107:}procedure sendval(v:integer);
  380. label 666,10;begin case outstate of 1:begin{110:}
  381. if(outptr=breakptr+3)or((outptr=breakptr+4)and(outbuf[breakptr]=32))then
  382. if((outbuf[outptr-3]=68)and(outbuf[outptr-2]=73)and(outbuf[outptr-1]=86)
  383. )or((outbuf[outptr-3]=100)and(outbuf[outptr-2]=105)and(outbuf[outptr-1]=
  384. 118))or((outbuf[outptr-3]=77)and(outbuf[outptr-2]=79)and(outbuf[outptr-1
  385. ]=68))or((outbuf[outptr-3]=109)and(outbuf[outptr-2]=111)and(outbuf[
  386. outptr-1]=100))then goto 666{:110};outsign:=32;outstate:=3;outval:=v;
  387. breakptr:=outptr;lastsign:=+1;end;0:begin{109:}
  388. if(outptr=breakptr+1)and((outbuf[breakptr]=42)or(outbuf[breakptr]=47))
  389. then goto 666{:109};outsign:=0;outstate:=3;outval:=v;breakptr:=outptr;
  390. lastsign:=+1;end;{108:}2:begin outsign:=43;outstate:=3;outval:=outapp*v;
  391. end;3:begin outstate:=5;outapp:=v;begin writeln(stdout);
  392. write(stdout,'! Two numbers occurred without a sign between them');
  393. error;end;end;4:begin outstate:=5;outapp:=outapp*v;end;
  394. 5:begin outval:=outval+outapp;outapp:=v;begin writeln(stdout);
  395. write(stdout,'! Two numbers occurred without a sign between them');
  396. error;end;end;{:108}others:goto 666 end;goto 10;666:{111:}
  397. if v>=0 then begin if outstate=1 then begin breakptr:=outptr;
  398. begin outbuf[outptr]:=32;outptr:=outptr+1;end;end;appval(v);
  399. if outptr>linelength then flushbuffer;outstate:=1;
  400. end else begin begin outbuf[outptr]:=40;outptr:=outptr+1;end;
  401. begin outbuf[outptr]:=45;outptr:=outptr+1;end;appval(-v);
  402. begin outbuf[outptr]:=41;outptr:=outptr+1;end;
  403. if outptr>linelength then flushbuffer;outstate:=0;end{:111};10:end;
  404. {:107}{113:}procedure sendtheoutput;label 2,21,22;var curchar:eightbits;
  405. k:0..linelength;j:0..maxbytes;w:0..2;n:integer;
  406. begin while stackptr>0 do begin curchar:=getoutput;
  407. 21:case curchar of 0:;{116:}
  408. 65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,
  409. 89,90,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,
  410. 114,115,116,117,118,119,120,121,122:begin outcontrib[1]:=curchar;
  411. sendout(2,1);end;130:begin k:=0;j:=bytestart[curval];w:=curval mod 3;
  412. while(k<maxidlength)and(j<bytestart[curval+3])do begin k:=k+1;
  413. outcontrib[k]:=bytemem[w,j];j:=j+1;if outcontrib[k]=95 then k:=k-1;end;
  414. sendout(2,k);end;{:116}{119:}48,49,50,51,52,53,54,55,56,57:begin n:=0;
  415. repeat curchar:=curchar-48;if n>=214748364 then begin writeln(stdout);
  416. write(stdout,'! Constant too big');error;end else n:=10*n+curchar;
  417. curchar:=getoutput;until(curchar>57)or(curchar<48);sendval(n);k:=0;
  418. if curchar=101 then curchar:=69;if curchar=69 then goto 2 else goto 21;
  419. end;125:sendval(poolchecksum);12:begin n:=0;curchar:=48;
  420. repeat curchar:=curchar-48;if n>=268435456 then begin writeln(stdout);
  421. write(stdout,'! Constant too big');error;end else n:=8*n+curchar;
  422. curchar:=getoutput;until(curchar>55)or(curchar<48);sendval(n);goto 21;
  423. end;13:begin n:=0;curchar:=48;
  424. repeat if curchar>=65 then curchar:=curchar-55 else curchar:=curchar-48;
  425. if n>=134217728 then begin writeln(stdout);
  426. write(stdout,'! Constant too big');error;end else n:=16*n+curchar;
  427. curchar:=getoutput;
  428. until(curchar>70)or(curchar<48)or((curchar>57)and(curchar<65));
  429. sendval(n);goto 21;end;128:sendval(curval);46:begin k:=1;
  430. outcontrib[1]:=46;curchar:=getoutput;
  431. if curchar=46 then begin outcontrib[2]:=46;sendout(1,2);
  432. end else if(curchar>=48)and(curchar<=57)then goto 2 else begin sendout(0
  433. ,46);goto 21;end;end;{:119}43,45:sendsign(44-curchar);{114:}
  434. 4:begin outcontrib[1]:=97;outcontrib[2]:=110;outcontrib[3]:=100;
  435. sendout(2,3);end;5:begin outcontrib[1]:=110;outcontrib[2]:=111;
  436. outcontrib[3]:=116;sendout(2,3);end;6:begin outcontrib[1]:=105;
  437. outcontrib[2]:=110;sendout(2,2);end;31:begin outcontrib[1]:=111;
  438. outcontrib[2]:=114;sendout(2,2);end;24:begin outcontrib[1]:=58;
  439. outcontrib[2]:=61;sendout(1,2);end;26:begin outcontrib[1]:=60;
  440. outcontrib[2]:=62;sendout(1,2);end;28:begin outcontrib[1]:=60;
  441. outcontrib[2]:=61;sendout(1,2);end;29:begin outcontrib[1]:=62;
  442. outcontrib[2]:=61;sendout(1,2);end;30:begin outcontrib[1]:=61;
  443. outcontrib[2]:=61;sendout(1,2);end;32:begin outcontrib[1]:=46;
  444. outcontrib[2]:=46;sendout(1,2);end;{:114}39:{117:}begin k:=1;
  445. outcontrib[1]:=39;repeat if k<linelength then k:=k+1;
  446. outcontrib[k]:=getoutput;until(outcontrib[k]=39)or(stackptr=0);
  447. if k=linelength then begin writeln(stdout);
  448. write(stdout,'! String too long');error;end;sendout(1,k);
  449. curchar:=getoutput;if curchar=39 then outstate:=6;goto 21;end{:117};
  450. {115:}
  451. 33,34,35,36,37,38,40,41,42,44,47,58,59,60,61,62,63,64,91,92,93,94,95,96,
  452. 123,124{:115}:sendout(0,curchar);{121:}
  453. 9:begin if bracelevel=0 then sendout(0,123)else sendout(0,91);
  454. bracelevel:=bracelevel+1;end;
  455. 10:if bracelevel>0 then begin bracelevel:=bracelevel-1;
  456. if bracelevel=0 then sendout(0,125)else sendout(0,93);
  457. end else begin writeln(stdout);write(stdout,'! Extra @}');error;end;
  458. 129:begin if bracelevel=0 then sendout(0,123)else sendout(0,91);
  459. if curval<0 then begin sendout(0,58);sendval(-curval);
  460. end else begin sendval(curval);sendout(0,58);end;
  461. if bracelevel=0 then sendout(0,125)else sendout(0,93);end;{:121}
  462. 127:begin sendout(3,0);outstate:=6;end;2:{118:}begin k:=0;
  463. repeat if k<linelength then k:=k+1;outcontrib[k]:=getoutput;
  464. until(outcontrib[k]=2)or(stackptr=0);
  465. if k=linelength then begin writeln(stdout);
  466. write(stdout,'! Verbatim string too long');error;end;sendout(1,k-1);
  467. end{:118};3:{122:}begin sendout(1,0);
  468. while outptr>0 do begin if outptr<=linelength then breakptr:=outptr;
  469. flushbuffer;end;outstate:=0;end{:122};others:begin writeln(stdout);
  470. write(stdout,'! Can''t output ASCII code ',curchar:1);error;end end;
  471. goto 22;2:{120:}repeat if k<linelength then k:=k+1;
  472. outcontrib[k]:=curchar;curchar:=getoutput;
  473. if(outcontrib[k]=69)and((curchar=43)or(curchar=45))then begin if k<
  474. linelength then k:=k+1;outcontrib[k]:=curchar;curchar:=getoutput;
  475. end else if curchar=101 then curchar:=69;
  476. until(curchar<>69)and((curchar<48)or(curchar>57));
  477. if k=linelength then begin writeln(stdout);
  478. write(stdout,'! Fraction too long');error;end;sendout(3,k);goto 21{:120}
  479. ;22:end;end;{:113}{127:}function linesdontmatch:boolean;label 10;
  480. var k:0..bufsize;begin linesdontmatch:=true;
  481. if changelimit<>limit then goto 10;
  482. if limit>0 then for k:=0 to limit-1 do if changebuffer[k]<>buffer[k]then
  483. goto 10;linesdontmatch:=false;10:end;{:127}{128:}
  484. procedure primethechangebuffer;label 22,30,10;var k:0..bufsize;
  485. begin changelimit:=0;{129:}while true do begin line:=line+1;
  486. if not inputln(changefile)then goto 10;if limit<2 then goto 22;
  487. if buffer[0]<>64 then goto 22;
  488. if(buffer[1]>=88)and(buffer[1]<=90)then buffer[1]:=buffer[1]+32;
  489. if buffer[1]=120 then goto 30;
  490. if(buffer[1]=121)or(buffer[1]=122)then begin loc:=2;
  491. begin writeln(stdout);write(stdout,'! Where is the matching @x?');error;
  492. end;end;22:end;30:{:129};{130:}repeat line:=line+1;
  493. if not inputln(changefile)then begin begin writeln(stdout);
  494. write(stdout,'! Change file ended after @x');error;end;goto 10;end;
  495. until limit>0;{:130};{131:}begin changelimit:=limit;
  496. if limit>0 then for k:=0 to limit-1 do changebuffer[k]:=buffer[k];
  497. end{:131};10:end;{:128}{132:}procedure checkchange;label 10;
  498. var n:integer;k:0..bufsize;begin if linesdontmatch then goto 10;n:=0;
  499. while true do begin changing:=not changing;templine:=otherline;
  500. otherline:=line;line:=templine;line:=line+1;
  501. if not inputln(changefile)then begin begin writeln(stdout);
  502. write(stdout,'! Change file ended before @y');error;end;changelimit:=0;
  503. changing:=not changing;templine:=otherline;otherline:=line;
  504. line:=templine;goto 10;end;{133:}
  505. if limit>1 then if buffer[0]=64 then begin if(buffer[1]>=88)and(buffer[1
  506. ]<=90)then buffer[1]:=buffer[1]+32;
  507. if(buffer[1]=120)or(buffer[1]=122)then begin loc:=2;
  508. begin writeln(stdout);write(stdout,'! Where is the matching @y?');error;
  509. end;end else if buffer[1]=121 then begin if n>0 then begin loc:=2;
  510. begin writeln(stdout);
  511. write(stdout,'! Hmm... ',n:1,' of the preceding lines failed to match');
  512. error;end;end;goto 10;end;end{:133};{131:}begin changelimit:=limit;
  513. if limit>0 then for k:=0 to limit-1 do changebuffer[k]:=buffer[k];
  514. end{:131};changing:=not changing;templine:=otherline;otherline:=line;
  515. line:=templine;line:=line+1;
  516. if not inputln(webfile)then begin begin writeln(stdout);
  517. write(stdout,'! WEB file ended during a change');error;end;
  518. inputhasended:=true;goto 10;end;if linesdontmatch then n:=n+1;end;
  519. 10:end;{:132}{135:}procedure getline;label 20;
  520. begin 20:if changing then{137:}begin line:=line+1;
  521. if not inputln(changefile)then begin begin writeln(stdout);
  522. write(stdout,'! Change file ended without @z');error;end;buffer[0]:=64;
  523. buffer[1]:=122;limit:=2;end;
  524. if limit>1 then if buffer[0]=64 then begin if(buffer[1]>=88)and(buffer[1
  525. ]<=90)then buffer[1]:=buffer[1]+32;
  526. if(buffer[1]=120)or(buffer[1]=121)then begin loc:=2;
  527. begin writeln(stdout);write(stdout,'! Where is the matching @z?');error;
  528. end;end else if buffer[1]=122 then begin primethechangebuffer;
  529. changing:=not changing;templine:=otherline;otherline:=line;
  530. line:=templine;end;end;end{:137};if not changing then begin{136:}
  531. begin line:=line+1;
  532. if not inputln(webfile)then inputhasended:=true else if limit=
  533. changelimit then if buffer[0]=changebuffer[0]then if changelimit>0 then
  534. checkchange;end{:136};if changing then goto 20;end;loc:=0;
  535. buffer[limit]:=32;end;{:135}{139:}
  536. function controlcode(c:ASCIIcode):eightbits;
  537. begin case c of 64:controlcode:=64;39:controlcode:=12;
  538. 34:controlcode:=13;36:controlcode:=125;32,9:controlcode:=136;
  539. 42:begin write(stdout,'*',modulecount+1:1);flush(stdout);
  540. controlcode:=136;end;68,100:controlcode:=133;70,102:controlcode:=132;
  541. 123:controlcode:=9;125:controlcode:=10;80,112:controlcode:=134;
  542. 84,116,94,46,58:controlcode:=131;38:controlcode:=127;
  543. 60:controlcode:=135;61:controlcode:=2;92:controlcode:=3;
  544. others:controlcode:=0 end;end;{:139}{140:}function skipahead:eightbits;
  545. label 30;var c:eightbits;
  546. begin while true do begin if loc>limit then begin getline;
  547. if inputhasended then begin c:=136;goto 30;end;end;buffer[limit+1]:=64;
  548. while buffer[loc]<>64 do loc:=loc+1;if loc<=limit then begin loc:=loc+2;
  549. c:=controlcode(buffer[loc-1]);if(c<>0)or(buffer[loc-1]=62)then goto 30;
  550. end;end;30:skipahead:=c;end;{:140}{141:}procedure skipcomment;label 10;
  551. var bal:eightbits;c:ASCIIcode;begin bal:=0;
  552. while true do begin if loc>limit then begin getline;
  553. if inputhasended then begin begin writeln(stdout);
  554. write(stdout,'! Input ended in mid-comment');error;end;goto 10;end;end;
  555. c:=buffer[loc];loc:=loc+1;{142:}if c=64 then begin c:=buffer[loc];
  556. if(c<>32)and(c<>9)and(c<>42)and(c<>122)and(c<>90)then loc:=loc+1 else
  557. begin begin writeln(stdout);
  558. write(stdout,'! Section ended in mid-comment');error;end;loc:=loc-1;
  559. goto 10;
  560. end end else if(c=92)and(buffer[loc]<>64)then loc:=loc+1 else if c=123
  561. then bal:=bal+1 else if c=125 then begin if bal=0 then goto 10;
  562. bal:=bal-1;end{:142};end;10:end;{:141}{145:}function getnext:eightbits;
  563. label 20,30,31;var c:eightbits;d:eightbits;j,k:0..longestname;
  564. begin 20:if loc>limit then begin getline;
  565. if inputhasended then begin c:=136;goto 31;end;end;c:=buffer[loc];
  566. loc:=loc+1;if scanninghex then{146:}
  567. if((c>=48)and(c<=57))or((c>=65)and(c<=70))then goto 31 else scanninghex
  568. :=false{:146};
  569. case c of 65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85
  570. ,86,87,88,89,90,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111
  571. ,112,113,114,115,116,117,118,119,120,121,122:{148:}
  572. begin if((c=101)or(c=69))and(loc>1)then if(buffer[loc-2]<=57)and(buffer[
  573. loc-2]>=48)then c:=0;if c<>0 then begin loc:=loc-1;idfirst:=loc;
  574. repeat loc:=loc+1;d:=buffer[loc];
  575. until((d<48)or((d>57)and(d<65))or((d>90)and(d<97))or(d>122))and(d<>95);
  576. if loc>idfirst+1 then begin c:=130;idloc:=loc;end;end else c:=69;
  577. end{:148};34:{149:}begin doublechars:=0;idfirst:=loc-1;
  578. repeat d:=buffer[loc];loc:=loc+1;
  579. if(d=34)or(d=64)then if buffer[loc]=d then begin loc:=loc+1;d:=0;
  580. doublechars:=doublechars+1;
  581. end else begin if d=64 then begin writeln(stdout);
  582. write(stdout,'! Double @ sign missing');error;
  583. end end else if loc>limit then begin begin writeln(stdout);
  584. write(stdout,'! String constant didn''t end');error;end;d:=34;end;
  585. until d=34;idloc:=loc-1;c:=130;end{:149};64:{150:}
  586. begin c:=controlcode(buffer[loc]);loc:=loc+1;
  587. if c=0 then goto 20 else if c=13 then scanninghex:=true else if c=135
  588. then{151:}begin{153:}k:=0;
  589. while true do begin if loc>limit then begin getline;
  590. if inputhasended then begin begin writeln(stdout);
  591. write(stdout,'! Input ended in section name');error;end;goto 30;end;end;
  592. d:=buffer[loc];{154:}if d=64 then begin d:=buffer[loc+1];
  593. if d=62 then begin loc:=loc+2;goto 30;end;
  594. if(d=32)or(d=9)or(d=42)then begin begin writeln(stdout);
  595. write(stdout,'! Section name didn''t end');error;end;goto 30;end;k:=k+1;
  596. modtext[k]:=64;loc:=loc+1;end{:154};loc:=loc+1;
  597. if k<longestname-1 then k:=k+1;if(d=32)or(d=9)then begin d:=32;
  598. if modtext[k-1]=32 then k:=k-1;end;modtext[k]:=d;end;30:{155:}
  599. if k>=longestname-2 then begin begin writeln(stdout);
  600. write(stdout,'! Section name too long: ');end;
  601. for j:=1 to 25 do write(stdout,xchr[modtext[j]]);write(stdout,'...');
  602. if history=0 then history:=1;end{:155};
  603. if(modtext[k]=32)and(k>0)then k:=k-1;{:153};
  604. if k>3 then begin if(modtext[k]=46)and(modtext[k-1]=46)and(modtext[k-2]=
  605. 46)then curmodule:=prefixlookup(k-3)else curmodule:=modlookup(k);
  606. end else curmodule:=modlookup(k);end{:151}
  607. else if c=131 then begin repeat c:=skipahead;until c<>64;
  608. if buffer[loc-1]<>62 then begin writeln(stdout);
  609. write(stdout,'! Improper @ within control text');error;end;goto 20;end;
  610. end{:150};{147:}
  611. 46:if buffer[loc]=46 then begin if loc<=limit then begin c:=32;
  612. loc:=loc+1;end;
  613. end else if buffer[loc]=41 then begin if loc<=limit then begin c:=93;
  614. loc:=loc+1;end;end;
  615. 58:if buffer[loc]=61 then begin if loc<=limit then begin c:=24;
  616. loc:=loc+1;end;end;
  617. 61:if buffer[loc]=61 then begin if loc<=limit then begin c:=30;
  618. loc:=loc+1;end;end;
  619. 62:if buffer[loc]=61 then begin if loc<=limit then begin c:=29;
  620. loc:=loc+1;end;end;
  621. 60:if buffer[loc]=61 then begin if loc<=limit then begin c:=28;
  622. loc:=loc+1;end;
  623. end else if buffer[loc]=62 then begin if loc<=limit then begin c:=26;
  624. loc:=loc+1;end;end;
  625. 40:if buffer[loc]=42 then begin if loc<=limit then begin c:=9;
  626. loc:=loc+1;end;
  627. end else if buffer[loc]=46 then begin if loc<=limit then begin c:=91;
  628. loc:=loc+1;end;end;
  629. 42:if buffer[loc]=41 then begin if loc<=limit then begin c:=10;
  630. loc:=loc+1;end;end;{:147}32,9:goto 20;123:begin skipcomment;goto 20;end;
  631. 125:begin begin writeln(stdout);write(stdout,'! Extra }');error;end;
  632. goto 20;end;others:if c>=128 then goto 20 else end;
  633. 31:{if troubleshooting then debughelp;}getnext:=c;end;{:145}{157:}
  634. procedure scannumeric(p:namepointer);label 21,30;
  635. var accumulator:integer;nextsign:-1..+1;q:namepointer;val:integer;
  636. begin{158:}accumulator:=0;nextsign:=+1;
  637. while true do begin nextcontrol:=getnext;
  638. 21:case nextcontrol of 48,49,50,51,52,53,54,55,56,57:begin{160:}val:=0;
  639. repeat val:=10*val+nextcontrol-48;nextcontrol:=getnext;
  640. until(nextcontrol>57)or(nextcontrol<48){:160};
  641. begin accumulator:=accumulator+nextsign*toint(val);nextsign:=+1;end;
  642. goto 21;end;12:begin{161:}val:=0;nextcontrol:=48;
  643. repeat val:=8*val+nextcontrol-48;nextcontrol:=getnext;
  644. until(nextcontrol>55)or(nextcontrol<48){:161};
  645. begin accumulator:=accumulator+nextsign*toint(val);nextsign:=+1;end;
  646. goto 21;end;13:begin{162:}val:=0;nextcontrol:=48;
  647. repeat if nextcontrol>=65 then nextcontrol:=nextcontrol-7;
  648. val:=16*val+nextcontrol-48;nextcontrol:=getnext;
  649. until(nextcontrol>70)or(nextcontrol<48)or((nextcontrol>57)and(
  650. nextcontrol<65)){:162};
  651. begin accumulator:=accumulator+nextsign*toint(val);nextsign:=+1;end;
  652. goto 21;end;130:begin q:=idlookup(0);
  653. if ilk[q]<>1 then begin nextcontrol:=42;goto 21;end;
  654. begin accumulator:=accumulator+nextsign*toint(equiv[q]-32768);
  655. nextsign:=+1;end;end;43:;45:nextsign:=-nextsign;
  656. 132,133,135,134,136:goto 30;59:begin writeln(stdout);
  657. write(stdout,'! Omit semicolon in numeric definition');error;end;
  658. others:{159:}begin begin writeln(stdout);
  659. write(stdout,'! Improper numeric definition will be flushed');error;end;
  660. repeat nextcontrol:=skipahead until(nextcontrol>=132);
  661. if nextcontrol=135 then begin loc:=loc-2;nextcontrol:=getnext;end;
  662. accumulator:=0;goto 30;end{:159}end;end;30:{:158};
  663. if abs(accumulator)>=32768 then begin begin writeln(stdout);
  664. write(stdout,'! Value too big: ',accumulator:1);error;end;
  665. accumulator:=0;end;equiv[p]:=accumulator+32768;end;{:157}{165:}
  666. procedure scanrepl(t:eightbits);label 22,30,31,21;var a:sixteenbits;
  667. b:ASCIIcode;bal:eightbits;begin bal:=0;
  668. while true do begin 22:a:=getnext;case a of 40:bal:=bal+1;
  669. 41:if bal=0 then begin writeln(stdout);write(stdout,'! Extra )');error;
  670. end else bal:=bal-1;39:{168:}begin b:=39;
  671. while true do begin begin if tokptr[z]=maxtoks then begin writeln(stdout
  672. );write(stdout,'! Sorry, ','token',' capacity exceeded');error;
  673. history:=3;uexit(1);end;tokmem[z,tokptr[z]]:=b;tokptr[z]:=tokptr[z]+1;
  674. end;
  675. if b=64 then if buffer[loc]=64 then loc:=loc+1 else begin writeln(stdout
  676. );write(stdout,'! You should double @ signs in strings');error;end;
  677. if loc=limit then begin begin writeln(stdout);
  678. write(stdout,'! String didn''t end');error;end;buffer[loc]:=39;
  679. buffer[loc+1]:=0;end;b:=buffer[loc];loc:=loc+1;
  680. if b=39 then begin if buffer[loc]<>39 then goto 31 else begin loc:=loc+1
  681. ;begin if tokptr[z]=maxtoks then begin writeln(stdout);
  682. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  683. uexit(1);end;tokmem[z,tokptr[z]]:=39;tokptr[z]:=tokptr[z]+1;end;end;end;
  684. end;31:end{:168};35:if t=3 then a:=0;{167:}130:begin a:=idlookup(0);
  685. begin if tokptr[z]=maxtoks then begin writeln(stdout);
  686. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  687. uexit(1);end;tokmem[z,tokptr[z]]:=(a div 256)+128;
  688. tokptr[z]:=tokptr[z]+1;end;a:=a mod 256;end;
  689. 135:if t<>135 then goto 30 else begin begin if tokptr[z]=maxtoks then
  690. begin writeln(stdout);
  691. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  692. uexit(1);end;tokmem[z,tokptr[z]]:=(curmodule div 256)+168;
  693. tokptr[z]:=tokptr[z]+1;end;a:=curmodule mod 256;end;2:{169:}
  694. begin begin if tokptr[z]=maxtoks then begin writeln(stdout);
  695. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  696. uexit(1);end;tokmem[z,tokptr[z]]:=2;tokptr[z]:=tokptr[z]+1;end;
  697. buffer[limit+1]:=64;
  698. 21:if buffer[loc]=64 then begin if loc<limit then if buffer[loc+1]=64
  699. then begin begin if tokptr[z]=maxtoks then begin writeln(stdout);
  700. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  701. uexit(1);end;tokmem[z,tokptr[z]]:=64;tokptr[z]:=tokptr[z]+1;end;
  702. loc:=loc+2;goto 21;end;
  703. end else begin begin if tokptr[z]=maxtoks then begin writeln(stdout);
  704. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  705. uexit(1);end;tokmem[z,tokptr[z]]:=buffer[loc];tokptr[z]:=tokptr[z]+1;
  706. end;loc:=loc+1;goto 21;end;if loc>=limit then begin writeln(stdout);
  707. write(stdout,'! Verbatim string didn''t end');error;
  708. end else if buffer[loc+1]<>62 then begin writeln(stdout);
  709. write(stdout,'! You should double @ signs in verbatim strings');error;
  710. end;loc:=loc+2;end{:169};
  711. 133,132,134:if t<>135 then goto 30 else begin begin writeln(stdout);
  712. write(stdout,'! @',xchr[buffer[loc-1]],' is ignored in Pascal text');
  713. error;end;goto 22;end;136:goto 30;{:167}others:end;
  714. begin if tokptr[z]=maxtoks then begin writeln(stdout);
  715. write(stdout,'! Sorry, ','token',' capacity exceeded');error;history:=3;
  716. uexit(1);end;tokmem[z,tokptr[z]]:=a;tokptr[z]:=tokptr[z]+1;end;end;
  717. 30:nextcontrol:=a;{166:}
  718. if bal>0 then begin if bal=1 then begin writeln(stdout);
  719. write(stdout,'! Missing )');error;end else begin writeln(stdout);
  720. write(stdout,'! Missing ',bal:1,' )''s');error;end;
  721. while bal>0 do begin begin if tokptr[z]=maxtoks then begin writeln(
  722. stdout);write(stdout,'! Sorry, ','token',' capacity exceeded');error;
  723. history:=3;uexit(1);end;tokmem[z,tokptr[z]]:=41;tokptr[z]:=tokptr[z]+1;
  724. end;bal:=bal-1;end;end{:166};
  725. if textptr>maxtexts-4 then begin writeln(stdout);
  726. write(stdout,'! Sorry, ','text',' capacity exceeded');error;history:=3;
  727. uexit(1);end;currepltext:=textptr;tokstart[textptr+4]:=tokptr[z];
  728. textptr:=textptr+1;if z=3 then z:=0 else z:=z+1;end;{:165}{170:}
  729. procedure definemacro(t:eightbits);var p:namepointer;
  730. begin p:=idlookup(t);scanrepl(t);equiv[p]:=currepltext;
  731. textlink[currepltext]:=0;end;{:170}{172:}procedure scanmodule;
  732. label 22,30,10;var p:namepointer;begin modulecount:=modulecount+1;{173:}
  733. nextcontrol:=0;
  734. while true do begin 22:while nextcontrol<=132 do begin nextcontrol:=
  735. skipahead;if nextcontrol=135 then begin loc:=loc-2;nextcontrol:=getnext;
  736. end;end;if nextcontrol<>133 then goto 30;nextcontrol:=getnext;
  737. if nextcontrol<>130 then begin begin writeln(stdout);
  738. write(stdout,'! Definition flushed, must start with ',
  739. 'identifier of length > 1');error;end;goto 22;end;nextcontrol:=getnext;
  740. if nextcontrol=61 then begin scannumeric(idlookup(1));goto 22;
  741. end else if nextcontrol=30 then begin definemacro(2);goto 22;
  742. end else{174:}if nextcontrol=40 then begin nextcontrol:=getnext;
  743. if nextcontrol=35 then begin nextcontrol:=getnext;
  744. if nextcontrol=41 then begin nextcontrol:=getnext;
  745. if nextcontrol=61 then begin begin writeln(stdout);
  746. write(stdout,'! Use == for macros');error;end;nextcontrol:=30;end;
  747. if nextcontrol=30 then begin definemacro(3);goto 22;end;end;end;end;
  748. {:174};begin writeln(stdout);
  749. write(stdout,'! Definition flushed since it starts badly');error;end;
  750. end;30:{:173};{175:}case nextcontrol of 134:p:=0;135:begin p:=curmodule;
  751. {176:}repeat nextcontrol:=getnext;until nextcontrol<>43;
  752. if(nextcontrol<>61)and(nextcontrol<>30)then begin begin writeln(stdout);
  753. write(stdout,'! Pascal text flushed, = sign is missing');error;end;
  754. repeat nextcontrol:=skipahead;until nextcontrol=136;goto 10;end{:176};
  755. end;others:goto 10 end;{177:}storetwobytes(53248+modulecount);{:177};
  756. scanrepl(135);{178:}
  757. if p=0 then begin textlink[lastunnamed]:=currepltext;
  758. lastunnamed:=currepltext;
  759. end else if equiv[p]=0 then equiv[p]:=currepltext else begin p:=equiv[p]
  760. ;while textlink[p]<maxtexts do p:=textlink[p];textlink[p]:=currepltext;
  761. end;textlink[currepltext]:=maxtexts;{:178};{:175};10:end;{:172}{181:}
  762. {procedure debughelp;label 888,10;var k:integer;
  763. begin debugskipped:=debugskipped+1;
  764. if debugskipped<debugcycle then goto 10;debugskipped:=0;
  765. while true do begin write(stdout,'#');flush(stdout);read(stdin,ddt);
  766. if ddt<0 then goto 10 else if ddt=0 then begin goto 888;
  767. 888:ddt:=0;
  768. end else begin read(stdin,dd);case ddt of 1:printid(dd);2:printrepl(dd);
  769. 3:for k:=1 to dd do write(stdout,xchr[buffer[k]]);
  770. 4:for k:=1 to dd do write(stdout,xchr[modtext[k]]);
  771. 5:for k:=1 to outptr do write(stdout,xchr[outbuf[k]]);
  772. 6:for k:=1 to dd do write(stdout,xchr[outcontrib[k]]);
  773. others:write(stdout,'?')end;end;end;10:end;}{:181}{182:}
  774. begin initialize;{134:}openinput;line:=0;otherline:=0;changing:=true;
  775. primethechangebuffer;changing:=not changing;templine:=otherline;
  776. otherline:=line;line:=templine;limit:=0;loc:=1;buffer[0]:=32;
  777. inputhasended:=false;{:134};write(stdout,'This is TANGLE, Version 4.3');
  778. writeln(stdout,versionstring);{183:}phaseone:=true;modulecount:=0;
  779. repeat nextcontrol:=skipahead;until nextcontrol=136;
  780. while not inputhasended do scanmodule;{138:}
  781. if changelimit<>0 then begin for ii:=0 to changelimit do buffer[ii]:=
  782. changebuffer[ii];limit:=changelimit;changing:=true;line:=otherline;
  783. loc:=changelimit;begin writeln(stdout);
  784. write(stdout,'! Change file entry did not match');error;end;end{:138};
  785. phaseone:=false;{:183};{for ii:=0 to 3 do maxtokptr[ii]:=tokptr[ii];}
  786. {112:}if textlink[0]=0 then begin begin writeln(stdout);
  787. write(stdout,'! No output was specified.');end;
  788. if history=0 then history:=1;end else begin begin writeln(stdout);
  789. write(stdout,'Writing the output file');end;flush(stdout);{83:}
  790. stackptr:=1;bracelevel:=0;curstate.namefield:=0;
  791. curstate.replfield:=textlink[0];zo:=curstate.replfield mod 4;
  792. curstate.bytefield:=tokstart[curstate.replfield];
  793. curstate.endfield:=tokstart[curstate.replfield+4];curstate.modfield:=0;
  794. {:83};{96:}outstate:=0;outptr:=0;breakptr:=0;semiptr:=0;outbuf[0]:=0;
  795. line:=1;{:96};sendtheoutput;{98:}breakptr:=outptr;semiptr:=0;
  796. flushbuffer;if bracelevel<>0 then begin writeln(stdout);
  797. write(stdout,'! Program ended at brace level ',bracelevel:1);error;end;
  798. {:98};begin writeln(stdout);write(stdout,'Done.');end;end{:112};
  799. 9999:if stringptr>256 then{184:}begin begin writeln(stdout);
  800. write(stdout,stringptr-256:1,' strings written to string pool file.');
  801. end;write(pool,'*');
  802. for ii:=1 to 9 do begin outbuf[ii]:=poolchecksum mod 10;
  803. poolchecksum:=poolchecksum div 10;end;
  804. for ii:=9 downto 1 do write(pool,xchr[48+outbuf[ii]]);writeln(pool);
  805. end{:184};{[186:]begin writeln(stdout);
  806. write(stdout,'Memory usage statistics:');end;begin writeln(stdout);
  807. write(stdout,nameptr:1,' names, ',textptr:1,' replacement texts;');end;
  808. begin writeln(stdout);write(stdout,byteptr[0]:1);end;
  809. for wo:=1 to 2 do write(stdout,'+',byteptr[wo]:1);
  810. if phaseone then for ii:=0 to 3 do maxtokptr[ii]:=tokptr[ii];
  811. write(stdout,' bytes, ',maxtokptr[0]:1);
  812. for ii:=1 to 3 do write(stdout,'+',maxtokptr[ii]:1);
  813. write(stdout,' tokens.');[:186];}{187:}
  814. case history of 0:begin writeln(stdout);
  815. write(stdout,'(No errors were found.)');end;1:begin writeln(stdout);
  816. write(stdout,'(Did you see the warning message above?)');end;
  817. 2:begin writeln(stdout);
  818. write(stdout,'(Pardon me, but I think I spotted something wrong.)');end;
  819. 3:begin writeln(stdout);
  820. write(stdout,'(That was a fatal error, my friend.)');end;end{:187};
  821. writeln(stdout);if(history<>0)and(history<>1)then uexit(1)else uexit(0);
  822. end.{:182}
  823.