FoxScanner.Mod 50 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548
  1. MODULE FoxScanner; (** AUTHOR "fof & fn"; PURPOSE "Oberon Compiler: Scanner"; **)
  2. (* (c) fof ETH Zürich, 2009 *)
  3. IMPORT Streams, Strings, Diagnostics, Basic := FoxBasic, D := Debugging, Commands, StringPool;
  4. CONST
  5. Trace = FALSE; (* debugging output *)
  6. (* overal scanner limitation *)
  7. MaxIdentifierLength* = 128;
  8. (* parametrization of numeric scanner: *)
  9. MaxHexDigits* = 8; (* maximal hexadecimal longint length *)
  10. MaxHugeHexDigits* = 16; (* maximal hexadecimal hugeint length *)
  11. MaxRealExponent* = 38; (* maximal real exponent *)
  12. MaxLongrealExponent* = 308; (* maximal longreal exponent *)
  13. (* scanner constants *)
  14. EOT* = 0X; LF* = 0AX; CR* = 0DX; TAB* = 09X;
  15. TYPE
  16. StringType* = Strings.String;
  17. IdentifierType *= StringPool.Index;
  18. IdentifierString*= ARRAY MaxIdentifierLength+1 OF CHAR;
  19. CONST
  20. (** tokens *)
  21. (*
  22. note: order of tokens is important for the parser, do not modify without looking it up
  23. FoxProgTools.Enum --export --linefeed=6
  24. None
  25. (* RelationOps: Equal ... Is *)
  26. Equal DotEqual Unequal DotUnequal
  27. Less DotLess LessEqual DotLessEqual Greater DotGreater GreaterEqual DotGreaterEqual
  28. LessLessQ GreaterGreaterQ Questionmarks ExclamationMarks
  29. In Is
  30. (* MulOps: Times ... And *)
  31. Times TimesTimes DotTimes PlusTimes Slash Backslash DotSlash Div Mod And
  32. (* AddOps: Or ... Minus *)
  33. Or Plus Minus
  34. (* Prefix Unary Operators Plus ... Not *)
  35. Not
  36. (* expressions may start with Plus ... Identifier *)
  37. LeftParenthesis LeftBracket LeftBrace Number Character String Nil Imag True False Self Result Identifier
  38. (* statementy may start with Self ... Begin *)
  39. If Case While Repeat For Loop With Exit Await Return Begin
  40. (* symbols, expressions and statements cannot start with *)
  41. Semicolon Transpose RightBrace RightBracket RightParenthesis
  42. Questionmark ExclamationMark
  43. LessLess GreaterGreater
  44. Upto Arrow Period Comma Colon Of Then Do To By Becomes Bar End Else Elsif Until Finally
  45. (* declaration elements *)
  46. Code Const Type Var Out Procedure Operator Import Definition Module Cell CellNet Extern
  47. (* composite type symbols *)
  48. Array Object Record Pointer Enum Port Address Size Alias
  49. (* assembler constants *)
  50. Ln PC PCOffset
  51. (* number types *)
  52. Shortint Integer Longint Hugeint Real Longreal
  53. Comment EndOfText
  54. ~
  55. *)
  56. None*= 0;
  57. (* RelationOps: Equal ... Is *)
  58. Equal*= 1; DotEqual*= 2; Unequal*= 3; DotUnequal*= 4; Less*= 5; DotLess*= 6;
  59. LessEqual*= 7; DotLessEqual*= 8; Greater*= 9; DotGreater*= 10; GreaterEqual*= 11; DotGreaterEqual*= 12;
  60. LessLessQ*= 13; GreaterGreaterQ*= 14; Questionmarks*= 15; ExclamationMarks*= 16; In*= 17; Is*= 18;
  61. (* MulOps: Times ... And *)
  62. Times*= 19; TimesTimes*= 20; DotTimes*= 21; PlusTimes*= 22; Slash*= 23; Backslash*= 24;
  63. DotSlash*= 25; Div*= 26; Mod*= 27; And*= 28;
  64. (* AddOps: Or ... Minus *)
  65. Or*= 29; Plus*= 30; Minus*= 31;
  66. (* Prefix Unary Operators Plus ... Not *)
  67. Not*= 32;
  68. (* expressions may start with Plus ... Identifier *)
  69. LeftParenthesis*= 33; LeftBracket*= 34; LeftBrace*= 35; Number*= 36; Character*= 37; String*= 38;
  70. Nil*= 39; Imag*= 40; True*= 41; False*= 42; Self*= 43; Result*= 44;
  71. Identifier*= 45;
  72. (* statementy may start with Self ... Begin *)
  73. If*= 46; Case*= 47; While*= 48; Repeat*= 49; For*= 50; Loop*= 51;
  74. With*= 52; Exit*= 53; Await*= 54; Return*= 55; Begin*= 56;
  75. (* symbols, expressions and statements cannot start with *)
  76. Semicolon*= 57; Transpose*= 58; RightBrace*= 59; RightBracket*= 60; RightParenthesis*= 61; Questionmark*= 62;
  77. ExclamationMark*= 63; LessLess*= 64; GreaterGreater*= 65; Upto*= 66; Arrow*= 67; Period*= 68;
  78. Comma*= 69; Colon*= 70; Of*= 71; Then*= 72; Do*= 73; To*= 74;
  79. By*= 75; Becomes*= 76; Bar*= 77; End*= 78; Else*= 79; Elsif*= 80;
  80. Until*= 81; Finally*= 82;
  81. (* declaration elements *)
  82. Code*= 83; Const*= 84; Type*= 85; Var*= 86; Out*= 87; Procedure*= 88;
  83. Operator*= 89; Import*= 90; Definition*= 91; Module*= 92; Cell*= 93; CellNet*= 94;
  84. Extern*= 95;
  85. (* composite type symbols *)
  86. Array*= 96; Object*= 97; Record*= 98; Pointer*= 99; Enum*= 100; Port*= 101;
  87. Address*= 102; Size*= 103; Alias*= 104;
  88. (* assembler constants *)
  89. Ln*= 105; PC*= 106; PCOffset*= 107;
  90. (* number types *)
  91. Shortint*= 108; Integer*= 109; Longint*= 110; Hugeint*= 111; Real*= 112; Longreal*= 113;
  92. Comment*= 114; EndOfText*= 115;
  93. SingleQuote = 27X; DoubleQuote* = 22X;
  94. Ellipsis = 7FX; (* used in Scanner.GetNumber to return with ".." when reading an interval like 3..5 *)
  95. Uppercase*=0;
  96. Lowercase*=1;
  97. Unknown*=2;
  98. TYPE
  99. (* keywords book keeping *)
  100. Keyword* = ARRAY 32 OF CHAR;
  101. KeywordTable* = OBJECT(Basic.HashTableInt); (* string -> index *)
  102. VAR table: POINTER TO ARRAY OF LONGINT;
  103. PROCEDURE &InitTable*(size: LONGINT);
  104. VAR i: LONGINT;
  105. BEGIN
  106. Init(size); NEW(table,size); FOR i := 0 TO size-1 DO table[i] := -1; END;
  107. END InitTable;
  108. PROCEDURE IndexByIdentifier*(identifier: IdentifierType): LONGINT;
  109. VAR stringPoolIndex: LONGINT;
  110. BEGIN
  111. IF Has(identifier) THEN
  112. RETURN GetInt(identifier)
  113. ELSE (* do not modify index *)
  114. RETURN -1
  115. END;
  116. END IndexByIdentifier;
  117. PROCEDURE IndexByString*(CONST name: ARRAY OF CHAR): LONGINT;
  118. VAR stringPoolIndex: LONGINT;
  119. BEGIN
  120. StringPool.GetIndex(name,stringPoolIndex);
  121. IF Has(stringPoolIndex) THEN
  122. RETURN GetInt(stringPoolIndex)
  123. ELSE (* do not modify index *)
  124. RETURN -1
  125. END;
  126. END IndexByString;
  127. PROCEDURE IdentifierByIndex*(index: LONGINT; VAR identifier: IdentifierType);
  128. BEGIN
  129. identifier := table[index]
  130. END IdentifierByIndex;
  131. PROCEDURE StringByIndex*(index: LONGINT; VAR name: ARRAY OF CHAR);
  132. VAR stringPoolIndex: LONGINT;
  133. BEGIN
  134. stringPoolIndex := table[index];
  135. IF stringPoolIndex < 0 THEN
  136. name := ""
  137. ELSE
  138. StringPool.GetString(stringPoolIndex,name);
  139. END;
  140. END StringByIndex;
  141. PROCEDURE PutString*(CONST name: ARRAY OF CHAR; index: LONGINT);
  142. VAR stringPoolIndex: LONGINT;
  143. BEGIN
  144. StringPool.GetIndex(name,stringPoolIndex);
  145. table[index] := stringPoolIndex;
  146. PutInt(stringPoolIndex,index);
  147. END PutString;
  148. END KeywordTable;
  149. TYPE
  150. Token*=LONGINT;
  151. (**
  152. symbol: data structure for the data transfer of the last read input from the scanner to the parser
  153. **)
  154. Symbol*= RECORD
  155. start*,end*,line-: LONGINT; (* start and end position of symbol *)
  156. token*: Token; (* token of symbol *)
  157. identifier*: IdentifierType; (* identifier *)
  158. identifierString*: IdentifierString; (* cache of identifier's string *)
  159. string*: StringType; (* string or identifier *)
  160. stringLength*: LONGINT; (* length of string, if stringLength = 2 then this may be interpreted as character and integer = ORD(ch) *)
  161. numberType*: LONGINT; (* Integer, HugeInteger, Real or Longreal *)
  162. integer*: LONGINT;
  163. hugeint*: HUGEINT; (*! unify longint and hugeint *)
  164. character*: CHAR;
  165. real*: LONGREAL;
  166. END;
  167. StringMaker* = OBJECT (* taken from TF's scanner *)
  168. VAR length : LONGINT;
  169. data : StringType;
  170. PROCEDURE &Init*(initialSize : LONGINT);
  171. BEGIN
  172. IF initialSize < 256 THEN initialSize := 256 END;
  173. NEW(data, initialSize); length := 0;
  174. END Init;
  175. PROCEDURE Add*(CONST buf: ARRAY OF CHAR; ofs, len: LONGINT; propagate: BOOLEAN; VAR res: LONGINT);
  176. VAR i : LONGINT; n: StringType;
  177. BEGIN
  178. IF length + len + 1 >= LEN(data) THEN
  179. NEW(n, LEN(data) + len + 1); FOR i := 0 TO length - 1 DO n[i] := data[i] END;
  180. data := n
  181. END;
  182. WHILE len > 0 DO
  183. data[length] := buf[ofs];
  184. INC(ofs); INC(length); DEC(len)
  185. END;
  186. data[length] := 0X;
  187. END Add;
  188. (* remove last n characters *)
  189. PROCEDURE Shorten*(n : LONGINT);
  190. BEGIN
  191. DEC(length, n);
  192. IF length < 0 THEN length := 0 END;
  193. IF length > 0 THEN data[length - 1] := 0X ELSE data[length] := 0X END
  194. END Shorten;
  195. PROCEDURE Clear*;
  196. BEGIN
  197. data[0] := 0X;
  198. length := 0
  199. END Clear;
  200. PROCEDURE GetWriter*() : Streams.Writer;
  201. VAR w : Streams.Writer;
  202. BEGIN
  203. NEW(w, SELF.Add, 256);
  204. RETURN w
  205. END GetWriter;
  206. PROCEDURE GetReader*(): Streams.Reader;
  207. VAR r: Streams.StringReader;
  208. BEGIN
  209. NEW(r, 256);
  210. r.Set(data^);
  211. RETURN r
  212. END GetReader;
  213. PROCEDURE GetString*(VAR len: LONGINT) : StringType;
  214. BEGIN
  215. len := length;
  216. RETURN data
  217. END GetString;
  218. PROCEDURE GetStringCopy*(VAR len: LONGINT): StringType;
  219. VAR new: StringType;
  220. BEGIN
  221. len := length;
  222. NEW(new,len+1);
  223. COPY(data^,new^);
  224. RETURN new
  225. END GetStringCopy;
  226. END StringMaker;
  227. (** scanner reflects the following EBNF
  228. Identifier = Letter {Letter | Digit | '_'}.
  229. Letter = 'A' | 'B' | .. | 'Z' | 'a' | 'b' | .. | 'z'.
  230. Digit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' .
  231. String = '"' {Character} '"' | "'" {Character} "'".
  232. Number = Integer | Real.
  233. Character = Digit [HexDigit] 'X'.
  234. Integer = Digit {Digit} | Digit {HexDigit} 'H'.
  235. Real = Digit {Digit} '.' {Digit} [ScaleFactor].
  236. ScaleFactor = ('E' | 'D') ['+' | '-'] digit {digit}.
  237. HexDigit = Digit | 'A' | 'B' | 'C' | 'D' | 'E' | 'F'.
  238. **)
  239. Scanner* = OBJECT
  240. VAR
  241. (* helper state information *)
  242. source-: StringType;
  243. reader-: Streams.Reader; (* source *)
  244. diagnostics: Diagnostics.Diagnostics; (* error logging *)
  245. ch-: CHAR; (* look-ahead character *)
  246. position-: LONGINT; (* current position *)
  247. line-: LONGINT;
  248. error-: BOOLEAN; (* if error occured during scanning *)
  249. firstIdentifier: BOOLEAN; (* support of lower vs. upper case keywords *)
  250. case-: LONGINT;
  251. stringWriter: Streams.Writer;
  252. stringMaker: StringMaker;
  253. (*
  254. source: name of the source code for reference in error outputs
  255. reader: input stream
  256. position: reference position (offset) of the input stream , for error output
  257. diagnostics: error output object
  258. *)
  259. PROCEDURE & InitializeScanner*( CONST source: ARRAY OF CHAR; reader: Streams.Reader; position: LONGINT; diagnostics: Diagnostics.Diagnostics );
  260. BEGIN
  261. NEW(stringMaker,1024);
  262. stringWriter := stringMaker.GetWriter();
  263. error := FALSE;
  264. NEW(SELF.source, Strings.Length(source)+1);
  265. COPY (source, SELF.source^);
  266. SELF.reader := reader;
  267. SELF.diagnostics := diagnostics;
  268. ch := " ";
  269. case := Unknown;
  270. firstIdentifier := TRUE;
  271. IF reader = NIL THEN ch := EOT ELSE GetNextCharacter END;
  272. IF Trace THEN D.Str( "New scanner " ); D.Ln; END;
  273. SELF.position := position;
  274. line := 0;
  275. END InitializeScanner;
  276. PROCEDURE ResetCase*; (*! needs a better naming ! *)
  277. BEGIN
  278. firstIdentifier := TRUE; case := Unknown;
  279. END ResetCase;
  280. (** report an error occured during scanning **)
  281. PROCEDURE ErrorS(CONST msg: ARRAY OF CHAR);
  282. BEGIN
  283. IF diagnostics # NIL THEN
  284. diagnostics.Error(source^, position, Diagnostics.Invalid, msg)
  285. END;
  286. error := TRUE;
  287. END ErrorS;
  288. (** report an error occured during scanning **)
  289. PROCEDURE Error( code: INTEGER );
  290. VAR errorMessage: ARRAY 256 OF CHAR;
  291. BEGIN
  292. IF diagnostics # NIL THEN
  293. Basic.GetErrorMessage(code,"",errorMessage);
  294. diagnostics.Error(source^, position, code, errorMessage)
  295. END;
  296. error := TRUE;
  297. END Error;
  298. (** get next character, end of text results in ch = EOT **)
  299. PROCEDURE GetNextCharacter*;
  300. BEGIN
  301. reader.Char(ch); INC(position);
  302. IF ch = LF THEN INC(line) END;
  303. (*
  304. (* not necessary, as Streams returns 0X if reading failed, but in case Streams.Reader.Char is modified ... *)
  305. IF reader.res # Streams.Ok THEN ch := EOT END;
  306. *)
  307. END GetNextCharacter;
  308. (*
  309. The following is an implementation of the KMP algorithm used in order to traverse strings until some pattern occurs.
  310. It is not necessary for our implementation of string escape sequences, because the first character of the pattern does not occur in the pattern elsewhere
  311. I found the code useful and keep it here for the time being....
  312. (* generate a table to be able to quickly search for string containing overlaps - KMP algorithm *)
  313. PROCEDURE MakeOverlapTable*(CONST pattern: ARRAY OF CHAR; VAR table: ARRAY OF LONGINT);
  314. VAR i, cnd: LONGINT;
  315. BEGIN
  316. ASSERT(pattern[0] # 0X);
  317. (* if first character did not match: reset search *)
  318. table[0] := -1;
  319. (* if second character did not match: compare to first *)
  320. IF pattern[1] # 0X THEN
  321. table[1] := 0;
  322. END;
  323. (* for all other characters: switch back to previous overlay in pattern *)
  324. i := 2; cnd := 0;
  325. WHILE(pattern[i] # 0X) DO
  326. (* do patterns [i-cnd, i-1] match with pattern[0.. cnd] ? *)
  327. IF pattern[i-1] = pattern[cnd] THEN
  328. INC(cnd); table[i] := cnd; INC(i);
  329. (* no, switch back to last overlap, if possible *)
  330. ELSIF cnd > 0 THEN cnd := table[cnd]
  331. (* not possible: restart at beginning *)
  332. ELSE table[i] := 0; INC(i)
  333. END;
  334. END;
  335. END MakeOverlapTable;
  336. (* using KMP substring search algorithm consume and reproduce all characters of a string until endString *)
  337. PROCEDURE GetString(CONST endString: ARRAY OF CHAR);
  338. VAR escapePos: LONGINT; ech: CHAR; i: LONGINT; table: ARRAY 16 OF LONGINT;
  339. next: LONGINT;
  340. PROCEDURE Append(ch :CHAR);
  341. BEGIN
  342. IF ch = 0X THEN
  343. ErrorS("Unexpected end of text in string"); error := TRUE
  344. ELSE
  345. stringWriter.Char(ch)
  346. END;
  347. END Append;
  348. BEGIN
  349. MakeOverlapTable(endString, table);
  350. (* traverse *)
  351. escapePos := 0; ech := endString[0];
  352. GetNextCharacter;
  353. REPEAT
  354. IF ch = ech THEN
  355. INC(escapePos); ech := endString[escapePos];
  356. GetNextCharacter;
  357. ELSIF escapePos = 0 THEN (* frequent case *)
  358. Append(ch); GetNextCharacter;
  359. ELSE
  360. (* overlaps ? *)
  361. next := table[escapePos];
  362. IF next < 0 THEN next := 0 END;
  363. (* account for "forgotten" characters *)
  364. FOR i := 0 TO escapePos-1-next DO
  365. Append(endString[i]);
  366. END;
  367. (* to next overlapping ? *)
  368. escapePos := table[escapePos];
  369. (* no overlapping *)
  370. IF escapePos < 0 THEN
  371. Append(ch);
  372. escapePos := 0;
  373. GetNextCharacter;
  374. END;
  375. ech := endString[escapePos];
  376. END;
  377. UNTIL (ch = EOT) OR (ech = 0X);
  378. END GetString;
  379. *)
  380. (* simple case can be utilized when endString does not contain first character, which is the case for our string convention *)
  381. PROCEDURE ConsumeStringUntil(CONST endString: ARRAY OF CHAR; useControl: BOOLEAN);
  382. VAR escapePos: LONGINT; ech: CHAR; i: LONGINT; startPosition: LONGINT;
  383. CONST
  384. Control = '\';
  385. Delimiter = '"';
  386. PROCEDURE Append(ch :CHAR);
  387. BEGIN
  388. IF ch = 0X THEN
  389. ErrorS("Unexpected end of text in string"); error := TRUE;
  390. ELSE
  391. stringWriter.Char(ch)
  392. END;
  393. END Append;
  394. BEGIN
  395. (* traverse *)
  396. escapePos := 0; ech := endString[0]; startPosition := position;
  397. GetNextCharacter;
  398. REPEAT
  399. IF ch = ech THEN
  400. INC(escapePos); ech := endString[escapePos];
  401. GetNextCharacter;
  402. ELSIF useControl & (ch = Control) THEN
  403. GetNextCharacter;
  404. IF (ch = Control) OR (ch = Delimiter) THEN
  405. Append(ch)
  406. ELSIF ch = 'n' THEN
  407. Append(CR); Append(LF);
  408. ELSIF ch = 't' THEN
  409. Append(TAB)
  410. ELSE
  411. ErrorS("Unknown control sequence")
  412. END;
  413. GetNextCharacter
  414. ELSIF escapePos = 0 THEN (* frequent case *)
  415. Append(ch); GetNextCharacter;
  416. ELSE
  417. (* account for "forgotten" characters *)
  418. FOR i := 0 TO escapePos-1 DO
  419. Append(endString[i]);
  420. END;
  421. (* restart *)
  422. ech := endString[0]; escapePos := 0;
  423. END;
  424. UNTIL (ch = EOT) OR (ech = 0X) OR error;
  425. IF ch = EOT THEN position := startPosition; ErrorS("Unexpected end of text in string") END;
  426. END ConsumeStringUntil;
  427. PROCEDURE GetEscapedString(VAR symbol: Symbol);
  428. VAR endString: ARRAY 4 OF CHAR; escape: CHAR;
  429. BEGIN
  430. (* backslash already consumed *)
  431. stringMaker.Clear;
  432. IF ch = '"' THEN
  433. escape := 0X;
  434. ELSE
  435. escape := ch; GetNextCharacter;
  436. END;
  437. ASSERT((ch = '"') OR (ch = "'"));
  438. REPEAT
  439. IF escape # 0X THEN
  440. endString[0] := ch;
  441. endString[1] := escape;
  442. endString[2] := '\';
  443. endString[3] := 0X;
  444. ELSE
  445. endString[0] := ch;
  446. endString[1] := '\';
  447. endString[2] := 0X;
  448. END;
  449. ConsumeStringUntil(endString, escape = 0X);
  450. UNTIL TRUE;
  451. stringWriter.Char(0X);
  452. stringWriter.Update;
  453. symbol.string := stringMaker.GetStringCopy(symbol.stringLength);
  454. END GetEscapedString;
  455. (** get a string starting at current position
  456. string = '"' {Character} '"' | "'" {Character} "'".
  457. **)
  458. (* multiline indicates that a string may occupy more than one lines, either concatenated or via multi-strings " " " "
  459. *)
  460. PROCEDURE GetString(VAR symbol: Symbol; multiLine, multiString, useControl: BOOLEAN);
  461. VAR och: CHAR; error: BOOLEAN; done: BOOLEAN;
  462. CONST control = '\';
  463. PROCEDURE Append(ch :CHAR);
  464. BEGIN
  465. IF ch = 0X THEN
  466. ErrorS("Unexpected end of text in string"); error := TRUE
  467. ELSE
  468. stringWriter.Char(ch)
  469. END;
  470. END Append;
  471. BEGIN
  472. stringMaker.Clear;
  473. och := ch; error := FALSE;
  474. REPEAT
  475. LOOP
  476. IF error THEN EXIT END;
  477. GetNextCharacter;
  478. IF (ch = och) OR (ch = EOT) THEN EXIT END;
  479. IF useControl & (ch = control) THEN
  480. GetNextCharacter;
  481. IF (ch = control) OR (ch = och) THEN
  482. Append(ch)
  483. ELSIF ch = 'n' THEN
  484. Append(CR); Append(LF);
  485. ELSIF ch = 't' THEN
  486. Append(TAB)
  487. ELSE
  488. ErrorS("Unknown control sequence")
  489. END;
  490. ELSE
  491. IF ~multiLine & (ch < " ") THEN Error( Basic.StringIllegalCharacter ); EXIT END;
  492. Append(ch)
  493. END;
  494. END;
  495. IF ch = EOT THEN
  496. ErrorS("Unexpected end of text in string")
  497. ELSE
  498. GetNextCharacter;
  499. IF multiString THEN SkipBlanks END;
  500. END;
  501. UNTIL ~multiString OR (ch # och);
  502. stringWriter.Char(0X);
  503. stringWriter.Update;
  504. symbol.string := stringMaker.GetStringCopy(symbol.stringLength);
  505. END GetString;
  506. (**
  507. Identifier = Letter {Letter | Digit | '_'} .
  508. Letter = 'A' | 'B' | .. | 'Z' | 'a' | 'b' | .. | 'z' .
  509. Digit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'.
  510. '_' is the underscore character
  511. **)
  512. PROCEDURE GetIdentifier( VAR symbol: Symbol );
  513. VAR i: LONGINT;
  514. BEGIN
  515. i := 0;
  516. REPEAT symbol.identifierString[i] := ch; INC( i ); GetNextCharacter UNTIL reservedCharacter[ORD( ch )] OR (i = MaxIdentifierLength);
  517. IF i = MaxIdentifierLength THEN Error( Basic.IdentifierTooLong ); DEC( i ) END;
  518. symbol.identifierString[i] := 0X;
  519. StringPool.GetIndex(symbol.identifierString, symbol.identifier);
  520. END GetIdentifier;
  521. (**
  522. Number = Integer | Real.
  523. Integer = Digit {Digit} | Digit {HexDigit} 'H'.
  524. Real = Digit {Digit} '.' {Digit} [ScaleFactor].
  525. ScaleFactor = ('E' | 'D') ['+' | '-'] digit {digit}.
  526. HexDigit = Digit | 'A' | 'B' | 'C' | 'D' | 'E' | 'F'.
  527. Digit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' .
  528. **)
  529. PROCEDURE GetNumber(VAR symbol: Symbol): Token;
  530. VAR i, nextInt, m, n, d, e, si: LONGINT;
  531. dig: ARRAY 24 OF CHAR;
  532. f: LONGREAL; expCh: CHAR; neg, long: BOOLEAN;
  533. result: Token;
  534. hugeint, tenh, number: HUGEINT;
  535. digits: LONGINT;
  536. (** 10^e **)
  537. PROCEDURE Ten( e: LONGINT ): LONGREAL;
  538. VAR x, p: LONGREAL;
  539. BEGIN
  540. x := 1; p := 10;
  541. WHILE e > 0 DO
  542. IF ODD( e ) THEN x := x * p END;
  543. e := e DIV 2;
  544. IF e > 0 THEN p := p * p END (* prevent overflow *)
  545. END;
  546. RETURN x
  547. END Ten;
  548. (** return decimal number associated to character ch , error if none **)
  549. PROCEDURE Decimal( ch: CHAR ): LONGINT;
  550. BEGIN (* ("0" <= ch) & (ch <= "9") OR ("A" <= ch) & (ch <= "F") *)
  551. IF ch <= "9" THEN RETURN ORD( ch ) - ORD( "0" ) ELSE Error( Basic.NumberIllegalCharacter ); RETURN 0 END
  552. END Decimal;
  553. (** return hexadecimal number associated to character ch, error if none **)
  554. PROCEDURE Hexadecimal( ch: CHAR ): LONGINT;
  555. BEGIN
  556. IF ch <= "9" THEN RETURN ORD( ch ) - ORD( "0" )
  557. ELSIF ch <= "F" THEN RETURN ORD( ch ) - ORD( "A" ) + 10
  558. ELSIF ch <= "f" THEN RETURN ORD( ch ) - ORD( "a" ) + 10
  559. ELSE Error( Basic.NumberIllegalCharacter ); RETURN 0
  560. END
  561. END Hexadecimal;
  562. BEGIN (* ("0" <= ch) & (ch <= "9") *)
  563. result := Number;
  564. i := 0; m := 0; n := 0; d := 0; si := 0; long := FALSE;
  565. IF (ch = "0") & (reader.Peek() = "x") THEN (* hex number *)
  566. digits := 0;
  567. GetNextCharacter; GetNextCharacter;
  568. WHILE (ch >= "0") & (ch <= "9") OR (ch >= "a") & (ch <="f") OR (ch >= "A") & (ch <= "F") DO
  569. number := number * 10H + Hexadecimal(ch);
  570. INC(digits);
  571. GetNextCharacter;
  572. END;
  573. symbol.hugeint := number;
  574. symbol.integer := SHORT(number);
  575. IF digits > MaxHexDigits THEN
  576. symbol.numberType := Hugeint
  577. ELSE
  578. symbol.numberType := Integer
  579. END;
  580. RETURN result;
  581. END;
  582. LOOP (* read mantissa *)
  583. IF ("0" <= ch) & (ch <= "9") OR (d = 0) & ("A" <= ch) & (ch <= "F") THEN
  584. IF (m > 0) OR (ch # "0") THEN (* ignore leading zeros *)
  585. IF n < LEN( dig ) THEN dig[n] := ch; INC( n ) END;
  586. INC( m )
  587. END;
  588. symbol.identifierString[si] := ch; INC( si ); GetNextCharacter; INC( i )
  589. ELSIF ch = "." THEN
  590. symbol.identifierString[si] := ch; INC( si ); GetNextCharacter;
  591. IF ch = "." THEN ch := Ellipsis; EXIT
  592. ELSIF d = 0 THEN (* i > 0 *) d := i
  593. ELSE Error( Basic.NumberIllegalCharacter )
  594. END
  595. ELSE EXIT
  596. END
  597. END; (* 0 <= n <= m <= i, 0 <= d <= i *)
  598. IF d = 0 THEN (* integer *)
  599. IF n = m THEN
  600. symbol.integer := 0; i := 0; symbol.hugeint := 0;
  601. IF ch = "X" THEN (* character *)
  602. symbol.identifierString[si] := ch; INC( si ); GetNextCharacter; result := Character;
  603. IF (n <= 2) THEN
  604. WHILE i < n DO symbol.integer := symbol.integer * 10H + Hexadecimal( dig[i] ); INC( i ) END;
  605. symbol.character := CHR(symbol.integer);
  606. ELSE Error( Basic.NumberTooLarge )
  607. END
  608. ELSIF ch = "H" THEN (* hexadecimal *)
  609. symbol.identifierString[si] := ch; INC( si ); GetNextCharacter;
  610. IF (n < MaxHexDigits) OR (n=MaxHexDigits) & (dig[0] <= "7") THEN (* otherwise the positive (!) number is not in the range of longints *)
  611. symbol.numberType := Integer;
  612. (* IF (n = MaxHexDigits) & (dig[0] > "7") THEN (* prevent overflow *) symbol.integer := -1 END; *)
  613. WHILE i < n DO symbol.integer := symbol.integer * 10H + Hexadecimal( dig[i] ); INC( i ) END;
  614. symbol.hugeint := symbol.integer;
  615. ELSIF n <= MaxHugeHexDigits THEN
  616. symbol.numberType := Hugeint;
  617. IF (n = MaxHugeHexDigits) & (dig[0] > "7") THEN (* prevent overflow *) symbol.hugeint := -1 END;
  618. WHILE i < n DO symbol.hugeint := Hexadecimal( dig[i] ) + symbol.hugeint * 10H; INC( i ) END;
  619. symbol.integer :=SHORT(symbol.hugeint);
  620. ELSE
  621. symbol.numberType := Hugeint; (* to make parser able to go on *)
  622. Error( Basic.NumberTooLarge )
  623. END
  624. ELSE (* decimal *)
  625. symbol.numberType := Integer;
  626. WHILE (i < n) & ~long DO
  627. d := Decimal( dig[i] ); INC( i );
  628. IF symbol.integer >= MAX(LONGINT) DIV 10 THEN (* multiplication overflow *)long := TRUE END;
  629. nextInt := symbol.integer*10+d;
  630. IF nextInt >=0 THEN symbol.integer := nextInt ELSE (* overflow *) long := TRUE END;
  631. END;
  632. IF long THEN
  633. i := 0; (* restart computation , artificial limit because of compiler problems with hugeint *)
  634. hugeint := 0;
  635. tenh := 10; (* compiler does not like constants here ! *)
  636. symbol.numberType := Hugeint;
  637. WHILE i < n DO
  638. d := Decimal( dig[i] ); INC( i );
  639. IF hugeint >= MAX(HUGEINT) DIV 10 THEN Error( Basic.NumberTooLarge) END;
  640. hugeint := hugeint * tenh + d;
  641. IF hugeint < 0 THEN Error( Basic.NumberTooLarge ) END
  642. END;
  643. symbol.hugeint := hugeint;
  644. symbol.integer := SHORT(symbol.hugeint);
  645. ELSE
  646. symbol.hugeint := symbol.integer;
  647. END
  648. END
  649. ELSE
  650. symbol.numberType := Hugeint;
  651. Error( Basic.NumberTooLarge )
  652. END
  653. ELSE (* fraction *)
  654. f := 0; e := 0; expCh := "E";
  655. WHILE n > 0 DO (* 0 <= f < 1 *) DEC( n ); f := (Decimal( dig[n] ) + f) / 10 END;
  656. IF (ch = "E") OR (ch = "D") THEN
  657. expCh := ch; symbol.identifierString[si] := ch; INC( si ); GetNextCharacter; neg := FALSE;
  658. IF ch = "-" THEN neg := TRUE; symbol.identifierString[si] := ch; INC( si ); GetNextCharacter
  659. ELSIF ch = "+" THEN symbol.identifierString[si] := ch; INC( si ); GetNextCharacter
  660. END;
  661. IF ("0" <= ch) & (ch <= "9") THEN
  662. REPEAT
  663. n := Decimal( ch ); symbol.identifierString[si] := ch; INC( si ); GetNextCharacter;
  664. IF e <= (MAX( INTEGER ) - n) DIV 10 THEN e := e * 10 + n ELSE Error( Basic.NumberTooLarge ) END
  665. UNTIL (ch < "0") OR ("9" < ch);
  666. IF neg THEN e := -e END
  667. ELSE Error( Basic.NumberIllegalCharacter )
  668. END
  669. END;
  670. DEC( e, i - d - m ); (* decimal point shift *)
  671. IF expCh = "E" THEN
  672. symbol.numberType := Real;
  673. IF (1 - MaxRealExponent < e) & (e <= MaxRealExponent) THEN
  674. IF e < 0 THEN symbol.real := f / Ten( -e ) ELSE symbol.real := f * Ten( e ) END
  675. ELSE Error( Basic.NumberTooLarge )
  676. END
  677. ELSE
  678. symbol.numberType := Longreal;
  679. IF (1 - MaxLongrealExponent < e) & (e <= MaxLongrealExponent) THEN
  680. IF e < 0 THEN symbol.real := f / Ten( -e ) ELSE symbol.real := f * Ten( e ) END
  681. ELSE Error( Basic.NumberTooLarge )
  682. END
  683. END
  684. END;
  685. symbol.identifierString[si] := 0X;
  686. RETURN result;
  687. END GetNumber;
  688. (** read / skip a comment **)
  689. PROCEDURE ReadComment(VAR symbol: Symbol);
  690. VAR level: LONGINT;
  691. BEGIN
  692. stringMaker.Clear;
  693. level := 1;
  694. WHILE (level > 0) & (ch # EOT) DO
  695. IF ch = "(" THEN
  696. stringWriter.Char(ch);
  697. GetNextCharacter;
  698. IF ch = "*" THEN INC(level); stringWriter.Char(ch); GetNextCharacter; END;
  699. ELSIF ch = "*" THEN
  700. stringWriter.Char(ch);
  701. GetNextCharacter;
  702. IF ch =")" THEN DEC(level); stringWriter.Char(ch); GetNextCharacter; END;
  703. ELSE
  704. stringWriter.Char(ch);
  705. GetNextCharacter;
  706. END;
  707. END;
  708. IF level > 0 THEN
  709. Error(Basic.CommentNotClosed)
  710. END;
  711. stringWriter.Char(0X);
  712. stringWriter.Update;
  713. stringMaker.Shorten(2); (* remove comment closing *)
  714. symbol.token := Comment;
  715. symbol.string := stringMaker.GetString(symbol.stringLength);
  716. END ReadComment;
  717. PROCEDURE SkipToEndOfCode*(VAR startPos,endPos: LONGINT; VAR symbol: Symbol): Token;
  718. VAR s: LONGINT;
  719. BEGIN
  720. ASSERT(case # Unknown);
  721. stringMaker.Clear;
  722. startPos := symbol.end;
  723. s := symbol.token;
  724. WHILE (s # EndOfText) & (s # End) & (s # With) DO
  725. symbol.start := position;
  726. endPos := position;
  727. CASE ch OF
  728. 'A' .. 'Z','a'..'z': s := Identifier;
  729. GetIdentifier(symbol);
  730. IF (case=Uppercase) & (symbol.identifierString = "END") OR (case=Lowercase) & (symbol.identifierString = "end") THEN
  731. s := End
  732. ELSIF (case = Uppercase) & (symbol.identifierString = "WITH") OR (case = Lowercase) & (symbol.identifierString = "with") THEN
  733. s := With
  734. ELSE
  735. stringWriter.String(symbol.identifierString);
  736. END;
  737. ELSE
  738. stringWriter.Char(ch);
  739. GetNextCharacter;
  740. END;
  741. symbol.end := position;
  742. END;
  743. stringWriter.Update;
  744. symbol.string := stringMaker.GetStringCopy(symbol.stringLength);
  745. symbol.token := s;
  746. IF Trace THEN
  747. D.String("skip to end: "); D.Int(startPos,1); D.String(","); D.Int(endPos,1); D.Ln;
  748. OutSymbol(D.Log,symbol); D.Ln;
  749. END;
  750. RETURN s
  751. END SkipToEndOfCode;
  752. PROCEDURE SkipBlanks;
  753. BEGIN
  754. WHILE ch <= " " DO (*ignore control characters*)
  755. IF ch = EOT THEN
  756. IF Trace THEN D.String("EOT"); D.Ln; END;
  757. RETURN
  758. ELSE GetNextCharacter
  759. END
  760. END;
  761. END SkipBlanks;
  762. (** get next symbol **)
  763. PROCEDURE GetNextSymbol*(VAR symbol: Symbol ): BOOLEAN;
  764. VAR s,token: LONGINT;
  765. BEGIN
  766. SkipBlanks;
  767. symbol.start := position; symbol.line := line;
  768. stringMaker.Clear;
  769. CASE ch OF (* ch > " " *)
  770. EOT: s := EndOfText
  771. | DoubleQuote:
  772. s := String; GetString(symbol,TRUE, TRUE, FALSE);
  773. | SingleQuote:
  774. s := String; GetString(symbol,FALSE, FALSE,FALSE);
  775. (* to be replaced by:
  776. s := Character; GetString(symbol);
  777. IF symbol.stringLength #2 THEN (* stringlength = 1 for empty string '' *)
  778. Error(Basic.IllegalCharacterValue)
  779. END;
  780. *)
  781. | '#': s := Unequal; GetNextCharacter
  782. | '&': s := And; GetNextCharacter
  783. | '(': GetNextCharacter;
  784. IF ch = '*' THEN GetNextCharacter; ReadComment(symbol); s := Comment; ELSE s := LeftParenthesis END
  785. | ')': s := RightParenthesis; GetNextCharacter
  786. | '*': GetNextCharacter; IF ch = '*' THEN GetNextCharacter; s := TimesTimes ELSE s := Times END
  787. | '+': GetNextCharacter; IF ch = '*' THEN GetNextCharacter; s := PlusTimes ELSE s := Plus END
  788. | ',': s := Comma; GetNextCharacter
  789. | '-': s := Minus; GetNextCharacter
  790. | '.': GetNextCharacter;
  791. IF ch = '.' THEN GetNextCharacter; s := Upto;
  792. ELSIF ch = '*' THEN GetNextCharacter; s := DotTimes;
  793. ELSIF ch = '/' THEN GetNextCharacter; s := DotSlash;
  794. ELSIF ch='=' THEN GetNextCharacter; s := DotEqual;
  795. ELSIF ch='#' THEN GetNextCharacter; s := DotUnequal;
  796. ELSIF ch='>' THEN GetNextCharacter;
  797. IF ch='=' THEN s := DotGreaterEqual; GetNextCharacter
  798. ELSE s := DotGreater;
  799. END
  800. ELSIF ch='<' THEN GetNextCharacter;
  801. IF ch='=' THEN s := DotLessEqual; GetNextCharacter
  802. ELSE s := DotLess;
  803. END
  804. ELSE s := Period END
  805. | '/': s := Slash; GetNextCharacter
  806. | '0'..'9': s := GetNumber(symbol);
  807. | ':': GetNextCharacter;
  808. IF ch = '=' THEN GetNextCharacter; s := Becomes ELSE s := Colon END
  809. | ';': s := Semicolon; GetNextCharacter
  810. | '<': GetNextCharacter;
  811. IF ch = '=' THEN GetNextCharacter; s := LessEqual
  812. ELSIF ch ='<' THEN GetNextCharacter;
  813. IF ch ='?' THEN GetNextCharacter; s := LessLessQ
  814. ELSE s := LessLess
  815. END;
  816. ELSE s := Less;
  817. END
  818. | '=': s := Equal; GetNextCharacter
  819. | '>': GetNextCharacter;
  820. IF ch = '=' THEN GetNextCharacter; s := GreaterEqual
  821. ELSIF ch ='>' THEN GetNextCharacter;
  822. IF ch ='?' THEN GetNextCharacter; s := GreaterGreaterQ
  823. ELSE s := GreaterGreater
  824. END;
  825. ELSE s := Greater; END
  826. | '[': s := LeftBracket; GetNextCharacter
  827. | ']': s := RightBracket; GetNextCharacter
  828. | '^': s := Arrow; GetNextCharacter
  829. | '{': s := LeftBrace; GetNextCharacter
  830. | '|': s := Bar; GetNextCharacter
  831. | '}': s := RightBrace; GetNextCharacter
  832. | '~': s := Not; GetNextCharacter
  833. | '\': s := Backslash; GetNextCharacter;
  834. IF ch = DoubleQuote THEN
  835. s := String;
  836. GetEscapedString(symbol);
  837. (*
  838. GetString(symbol, TRUE, TRUE, TRUE)
  839. *)
  840. ELSIF (ch > " ") & (reader.Peek() = DoubleQuote) THEN
  841. s := String;
  842. GetEscapedString(symbol);
  843. END;
  844. | '`': s := Transpose; GetNextCharacter
  845. | '?': s := Questionmark; GetNextCharacter; IF ch = '?' THEN s := Questionmarks; GetNextCharacter END;
  846. | '!': s := ExclamationMark; GetNextCharacter; IF ch = '!' THEN s := ExclamationMarks; GetNextCharacter END;
  847. | Ellipsis:
  848. s := Upto; GetNextCharacter
  849. | 'A'..'Z': s := Identifier; GetIdentifier( symbol );
  850. IF (case=Uppercase) OR (case=Unknown) THEN
  851. token := keywordsUpper.IndexByIdentifier(symbol.identifier);
  852. IF (token >= 0) THEN s := token END;
  853. IF (s = Module) OR (s=CellNet) THEN case := Uppercase END;
  854. END;
  855. | 'a'..'z': s := Identifier; GetIdentifier( symbol);
  856. IF (case = Lowercase) OR (case=Unknown) THEN
  857. token := keywordsLower.IndexByIdentifier(symbol.identifier);
  858. IF (token >= 0) THEN s := token END;
  859. IF (s = Module) OR (s=CellNet) THEN case := Lowercase END;
  860. END;
  861. IF firstIdentifier & (s # Module) & (s # CellNet) THEN case := Uppercase; s := Identifier END;
  862. ELSE s := Identifier; GetIdentifier( symbol );
  863. END;
  864. firstIdentifier := FALSE;
  865. symbol.token := s;
  866. symbol.end := position;
  867. IF Trace THEN OutSymbol(D.Log,symbol); D.Ln; END;
  868. RETURN ~error
  869. END GetNextSymbol;
  870. PROCEDURE ResetError*();
  871. BEGIN error := FALSE
  872. END ResetError;
  873. (** set the diagnostics mode of the scanner (diagnostics = NIL ==> no report) and reset the error state
  874. intended for silent symbol peeeking after the end of a module *)
  875. PROCEDURE ResetErrorDiagnostics*(VAR diagnostics: Diagnostics.Diagnostics);
  876. VAR b: BOOLEAN; d: Diagnostics.Diagnostics;
  877. BEGIN
  878. error := FALSE;
  879. d := SELF.diagnostics; SELF.diagnostics := diagnostics; diagnostics := d;
  880. END ResetErrorDiagnostics;
  881. END Scanner;
  882. Context*=RECORD
  883. position, readerPosition : LONGINT;
  884. ch: CHAR;
  885. END;
  886. AssemblerScanner* = OBJECT (Scanner) (*! move to different module? unify with compiler scanner? *)
  887. VAR
  888. startContext-: Context;
  889. PROCEDURE &InitAssemblerScanner*( CONST source: ARRAY OF CHAR; reader: Streams.Reader; position: LONGINT; diagnostics: Diagnostics.Diagnostics );
  890. BEGIN
  891. InitializeScanner(source,reader,position,diagnostics);
  892. GetContext(startContext);
  893. END InitAssemblerScanner;
  894. PROCEDURE GetContext*(VAR context: Context);
  895. BEGIN
  896. context.ch := ch;
  897. context.position := position;
  898. context.readerPosition := reader.Pos();
  899. END GetContext;
  900. PROCEDURE SetContext*(CONST context: Context);
  901. BEGIN
  902. reader.SetPos(context.readerPosition);
  903. ch := context.ch;
  904. position := context.position;
  905. END SetContext;
  906. PROCEDURE SkipToEndOfLine*;
  907. BEGIN
  908. WHILE (ch # EOT) & (ch # CR) & (ch # LF) DO
  909. GetNextCharacter
  910. END;
  911. END SkipToEndOfLine;
  912. (**
  913. note: in contrast to a regular identifier, an assembler scanner identifier may also contain periods and the '@'-symbol
  914. Identifier = '@' | Letter {'@' | '.' | Letter | Digit | '_'} .
  915. Letter = 'A' | 'B' | .. | 'Z' | 'a' | 'b' | .. | 'z' .
  916. Digit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'.
  917. '_' is the underscore character
  918. **)
  919. PROCEDURE GetIdentifier( VAR symbol: Symbol );
  920. VAR
  921. i: LONGINT;
  922. PROCEDURE CharacterIsAllowed(character: CHAR): BOOLEAN;
  923. BEGIN
  924. CASE character OF
  925. | 'a' .. 'z', 'A' .. 'Z', '0' .. '9', '@', '.', '_': RETURN TRUE
  926. ELSE RETURN FALSE
  927. END;
  928. END CharacterIsAllowed;
  929. BEGIN
  930. i := 0;
  931. REPEAT
  932. symbol.identifierString[i] := ch; INC( i ); GetNextCharacter
  933. UNTIL ~CharacterIsAllowed(ch) OR (i = MaxIdentifierLength);
  934. IF i = MaxIdentifierLength THEN Error( Basic.IdentifierTooLong ); DEC( i ) END;
  935. symbol.identifierString[i] := 0X;
  936. END GetIdentifier;
  937. PROCEDURE GetNumber(VAR symbol: Symbol): Token;
  938. VAR number: HUGEINT; result: Token; digits: LONGINT;
  939. (** return hexadecimal number associated to character ch, error if none **)
  940. PROCEDURE Hexadecimal( ch: CHAR ): LONGINT;
  941. BEGIN
  942. IF (ch >= "0") & (ch <= "9") THEN RETURN ORD( ch ) - ORD( "0" )
  943. ELSIF (ch >= "a") & (ch <= "f") THEN RETURN ORD( ch ) - ORD( "a" ) + 10
  944. ELSE Error( Basic.NumberIllegalCharacter ); RETURN 0
  945. END
  946. END Hexadecimal;
  947. BEGIN
  948. result := Number;
  949. IF (ch = "0") THEN
  950. IF reader.Peek() = "x" THEN (* hex number *)
  951. digits := 0;
  952. GetNextCharacter; GetNextCharacter;
  953. WHILE (ch >= "0") & (ch <= "9") OR (ch >= "a") & (ch <="f") DO
  954. number := number * 10H + Hexadecimal(ch);
  955. INC(digits);
  956. GetNextCharacter;
  957. END;
  958. symbol.hugeint := number;
  959. symbol.integer := SHORT(number);
  960. IF digits > MaxHexDigits THEN
  961. symbol.numberType := Hugeint
  962. ELSE
  963. symbol.numberType := Integer
  964. END;
  965. ELSIF reader.Peek() = "b" THEN (* binary number *)
  966. digits := 0;
  967. GetNextCharacter; GetNextCharacter;
  968. WHILE (ch >= "0") & (ch <= "1") DO
  969. number := number * 2;
  970. INC(digits);
  971. IF ch = "1" THEN INC(number) END;
  972. GetNextCharacter;
  973. END;
  974. symbol.hugeint := number;
  975. symbol.integer := SHORT(number);
  976. IF digits > 32 THEN
  977. symbol.numberType := Hugeint
  978. ELSE
  979. symbol.numberType := Integer
  980. END;
  981. ELSE RETURN GetNumber^(symbol)
  982. END;
  983. ELSE RETURN GetNumber^(symbol)
  984. END;
  985. RETURN result
  986. END GetNumber;
  987. (** get next symbol **)
  988. PROCEDURE GetNextSymbol*(VAR symbol: Symbol ): BOOLEAN;
  989. VAR s: LONGINT;
  990. PROCEDURE SkipBlanks;
  991. BEGIN
  992. WHILE (ch <= ' ') & (ch # CR) & (ch # LF) & (ch # EOT) DO (* ignore control characters except line feeds *)
  993. GetNextCharacter
  994. END;
  995. END SkipBlanks;
  996. BEGIN
  997. REPEAT
  998. SkipBlanks;
  999. symbol.start := position; symbol.line := line;
  1000. CASE ch OF (* ch > ' ' *)
  1001. | EOT: s := EndOfText;
  1002. | DoubleQuote:
  1003. s := String; GetString(symbol, TRUE, FALSE, TRUE);
  1004. | SingleQuote:
  1005. s := Character; GetString(symbol, FALSE, FALSE, FALSE); symbol.character := symbol.string[0];
  1006. IF symbol.stringLength #2 THEN (* stringlength = 1 for empty string '' *)
  1007. Error(Basic.IllegalCharacterValue)
  1008. END;
  1009. | '\': s := Backslash; GetNextCharacter;
  1010. IF ch = DoubleQuote THEN s := String; GetString(symbol, FALSE, FALSE, TRUE) END;
  1011. | '#': s := Unequal; GetNextCharacter; (* for the ARM assembler *)
  1012. | '(': GetNextCharacter;
  1013. IF ch = '*' THEN GetNextCharacter; ReadComment(symbol); s := Comment; ELSE s := LeftParenthesis END
  1014. | ')': s := RightParenthesis; GetNextCharacter
  1015. | CR: GetNextCharacter; s := Ln;IF ch = LF THEN GetNextCharacter END;
  1016. | LF: GetNextCharacter; s := Ln;
  1017. | '*': s := Times; GetNextCharacter;
  1018. | '+': s := Plus ; GetNextCharacter;
  1019. | ',': s := Comma; GetNextCharacter
  1020. | '-': s := Minus; GetNextCharacter
  1021. | '~': s := Not; GetNextCharacter
  1022. | '.': s:= Period; GetNextCharacter
  1023. | '/': s := Div; GetNextCharacter
  1024. | '%': s := Mod; GetNextCharacter
  1025. | '0'..'9': s := GetNumber(symbol);
  1026. | ':': s := Colon; GetNextCharacter;
  1027. | ';': s := Comment; SkipToEndOfLine;
  1028. | '=': s := Equal; GetNextCharacter
  1029. | '[': s := LeftBracket; GetNextCharacter
  1030. | ']': s := RightBracket; GetNextCharacter
  1031. | '{': s := LeftBrace; GetNextCharacter
  1032. | '}': s := RightBrace; GetNextCharacter
  1033. | '!': s := ExclamationMark; GetNextCharacter;
  1034. | '^': s := Arrow; GetNextCharacter;
  1035. | 'A'..'Z': s := Identifier; GetIdentifier( symbol );
  1036. | 'a'..'z': s := Identifier; GetIdentifier( symbol);
  1037. | '@': s := Identifier; GetIdentifier( symbol); (* the '@'-symbol initiates an assembly scanner identifier *)
  1038. | '$': GetNextCharacter;
  1039. IF ch = '$' THEN s := PCOffset; GetNextCharacter ELSE s := PC; END
  1040. ELSE s := None; GetNextCharacter;
  1041. END;
  1042. symbol.end := position;
  1043. UNTIL s # Comment;
  1044. symbol.token := s;
  1045. IF Trace THEN D.Ln; D.Str( "Scan at " ); D.Int( symbol.start,1 ); D.Str( ": " ); OutSymbol(D.Log,symbol); D.Update; END;
  1046. RETURN ~error
  1047. END GetNextSymbol;
  1048. END AssemblerScanner;
  1049. VAR
  1050. reservedCharacter: ARRAY 256 OF BOOLEAN;
  1051. tokens-: ARRAY EndOfText+1 OF Keyword;
  1052. keywordsLower, keywordsUpper: KeywordTable;
  1053. (** return a new scanner on a stream, error output via diagnostics **)
  1054. PROCEDURE NewScanner*( CONST source: ARRAY OF CHAR; reader: Streams.Reader; position: LONGINT; diagnostics: Diagnostics.Diagnostics ): Scanner;
  1055. VAR s: Scanner;
  1056. BEGIN
  1057. NEW( s, source, reader, position, diagnostics ); RETURN s;
  1058. END NewScanner;
  1059. PROCEDURE NewAssemblerScanner*( CONST source: ARRAY OF CHAR; reader: Streams.Reader; position: LONGINT; diagnostics: Diagnostics.Diagnostics ): AssemblerScanner;
  1060. VAR s: AssemblerScanner;
  1061. BEGIN
  1062. NEW( s, source, reader, position, diagnostics ); RETURN s;
  1063. END NewAssemblerScanner;
  1064. PROCEDURE SymbolToString*(CONST symbol: Symbol; case: LONGINT; VAR str: ARRAY OF CHAR);
  1065. VAR id: StringPool.Index;
  1066. BEGIN
  1067. CASE symbol.token OF
  1068. Identifier, Number: COPY(symbol.identifierString, str)
  1069. | String, Comment: ASSERT(LEN(str) >= LEN(symbol.string^)); COPY(symbol.string^, str);
  1070. ELSE
  1071. GetKeyword(case, symbol.token, id);
  1072. IF id < 0 THEN str := "" ELSE StringPool.GetString(id, str) END;
  1073. END;
  1074. END SymbolToString;
  1075. (** debugging output **)
  1076. PROCEDURE OutSymbol*(w: Streams.Writer; CONST symbol: Symbol);
  1077. VAR str: ARRAY 256 OF CHAR;
  1078. BEGIN
  1079. w.Int(symbol.start,1); w.String("-");w.Int(symbol.end,1); w.String(":");
  1080. w.String(tokens[symbol.token]);
  1081. IF symbol.token= Number THEN
  1082. CASE symbol.numberType OF
  1083. Integer: w.String("(integer)")
  1084. |Hugeint: w.String("(hugeint)")
  1085. |Real: w.String("(real)")
  1086. |Longreal: w.String("(longreal)")
  1087. END;
  1088. END;
  1089. IF symbol.token = String THEN
  1090. w.String(":"); w.Char('"'); w.String(symbol.string^); w.Char('"');
  1091. ELSIF symbol.token = Comment THEN
  1092. w.String("(*"); w.String(symbol.string^); w.String("*)");
  1093. ELSE
  1094. SymbolToString(symbol, Uppercase, str); w.String(": "); w.String(str);
  1095. END
  1096. END OutSymbol;
  1097. (** reserved characters are the characters that may not occur within an identifier **)
  1098. PROCEDURE InitReservedCharacters;
  1099. VAR i: LONGINT;
  1100. BEGIN
  1101. FOR i := 0 TO LEN( reservedCharacter ) - 1 DO
  1102. CASE CHR(i) OF
  1103. | 'a' .. 'z', 'A' .. 'Z': reservedCharacter[i] := FALSE;
  1104. | '0'..'9': reservedCharacter[i] := FALSE;
  1105. | '_': reservedCharacter[i] := FALSE
  1106. ELSE
  1107. reservedCharacter[i] := TRUE
  1108. END;
  1109. END;
  1110. END InitReservedCharacters;
  1111. (* get keyword by token *)
  1112. PROCEDURE GetKeyword*(case:LONGINT; token: LONGINT; VAR identifier: IdentifierType);
  1113. BEGIN
  1114. IF case = Uppercase THEN
  1115. keywordsUpper.IdentifierByIndex(token,identifier);
  1116. ELSE ASSERT(case=Lowercase);
  1117. keywordsLower.IdentifierByIndex(token,identifier);
  1118. END;
  1119. END GetKeyword;
  1120. PROCEDURE InitTokens;
  1121. VAR i: LONGINT;
  1122. BEGIN
  1123. tokens[None] := "None";
  1124. tokens[Equal] := "Equal";
  1125. tokens[DotEqual] := "DotEqual";
  1126. tokens[Unequal] := "Unequal";
  1127. tokens[DotUnequal] := "DotUnequal";
  1128. tokens[Less] := "Less";
  1129. tokens[DotLess] := "DotLess";
  1130. tokens[LessEqual] := "LessEqual";
  1131. tokens[DotLessEqual] := "DotLessEqual";
  1132. tokens[Greater] := "Greater";
  1133. tokens[DotGreater] := "DotGreater";
  1134. tokens[GreaterEqual] := "GreaterEqual";
  1135. tokens[DotGreaterEqual] := "DotGreaterEqual";
  1136. tokens[LessLessQ] := "LessLessQ";
  1137. tokens[GreaterGreaterQ] := "GreaterGreaterQ";
  1138. tokens[In] := "In";
  1139. tokens[Is] := "Is";
  1140. tokens[Times] := "Times";
  1141. tokens[TimesTimes] := "TimesTimes";
  1142. tokens[DotTimes] := "DotTimes";
  1143. tokens[PlusTimes] := "PlusTimes";
  1144. tokens[Slash] := "Slash";
  1145. tokens[Backslash] := "Backslash";
  1146. tokens[DotSlash] := "DotSlash";
  1147. tokens[Div] := "Div";
  1148. tokens[Mod] := "Mod";
  1149. tokens[And] := "And";
  1150. tokens[Or] := "Or";
  1151. tokens[Plus] := "Plus";
  1152. tokens[Minus] := "Minus";
  1153. tokens[Not] := "Not";
  1154. tokens[LeftParenthesis] := "LeftParenthesis";
  1155. tokens[LeftBracket] := "LeftBracket";
  1156. tokens[LeftBrace] := "LeftBrace";
  1157. tokens[Number] := "Number";
  1158. tokens[Character] := "Character";
  1159. tokens[String] := "String";
  1160. tokens[Nil] := "Nil";
  1161. tokens[Imag] := "Imag";
  1162. tokens[True] := "True";
  1163. tokens[False] := "False";
  1164. tokens[Self] := "Self";
  1165. tokens[Result] := "Result";
  1166. tokens[Identifier] := "Identifier";
  1167. tokens[If] := "If";
  1168. tokens[Case] := "Case";
  1169. tokens[While] := "While";
  1170. tokens[Repeat] := "Repeat";
  1171. tokens[For] := "For";
  1172. tokens[Loop] := "Loop";
  1173. tokens[With] := "With";
  1174. tokens[Exit] := "Exit";
  1175. tokens[Await] := "Await";
  1176. tokens[Return] := "Return";
  1177. tokens[Begin] := "Begin";
  1178. tokens[Semicolon] := "Semicolon";
  1179. tokens[Transpose] := "Transpose";
  1180. tokens[RightBrace] := "RightBrace";
  1181. tokens[RightBracket] := "RightBracket";
  1182. tokens[RightParenthesis] := "RightParenthesis";
  1183. tokens[Questionmark] := "Questionmark";
  1184. tokens[ExclamationMark] := "ExclamationMark";
  1185. tokens[Questionmarks] := "Questionmarks";
  1186. tokens[ExclamationMarks] := "ExclamationMarks";
  1187. tokens[LessLess] := "LessLess";
  1188. tokens[GreaterGreater] := "GreaterGreater";
  1189. tokens[Upto] := "Upto";
  1190. tokens[Arrow] := "Arrow";
  1191. tokens[Period] := "Period";
  1192. tokens[Comma] := "Comma";
  1193. tokens[Colon] := "Colon";
  1194. tokens[Of] := "Of";
  1195. tokens[Then] := "Then";
  1196. tokens[Do] := "Do";
  1197. tokens[To] := "To";
  1198. tokens[By] := "By";
  1199. tokens[Becomes] := "Becomes";
  1200. tokens[Bar] := "Bar";
  1201. tokens[End] := "End";
  1202. tokens[Else] := "Else";
  1203. tokens[Elsif] := "Elsif";
  1204. tokens[Extern] := "Extern";
  1205. tokens[Until] := "Until";
  1206. tokens[Finally] := "Finally";
  1207. tokens[Code] := "Code";
  1208. tokens[Const] := "Const";
  1209. tokens[Type] := "Type";
  1210. tokens[Var] := "Var";
  1211. tokens[Out] := "Out";
  1212. tokens[Procedure] := "Procedure";
  1213. tokens[Operator] := "Operator";
  1214. tokens[Import] := "Import";
  1215. tokens[Definition] := "Definition";
  1216. tokens[Module] := "Module";
  1217. tokens[Cell] := "Cell";
  1218. tokens[CellNet] := "CellNet";
  1219. tokens[Array] := "Array";
  1220. tokens[Object] := "Object";
  1221. tokens[Record] := "Record";
  1222. tokens[Pointer] := "Pointer";
  1223. tokens[Enum] := "Enum";
  1224. tokens[Port] := "Port";
  1225. tokens[Address] := "Address";
  1226. tokens[Alias] := "Alias";
  1227. tokens[Size] := "Size";
  1228. tokens[Ln] := "Ln";
  1229. tokens[PC] := "PC";
  1230. tokens[PCOffset] := "PCOffset";
  1231. tokens[Shortint] := "Shortint";
  1232. tokens[Integer] := "Integer";
  1233. tokens[Longint] := "Longint";
  1234. tokens[Hugeint] := "Hugeint";
  1235. tokens[Real] := "Real";
  1236. tokens[Longreal] := "Longreal";
  1237. tokens[Comment] := "Comment";
  1238. tokens[EndOfText] := "EndOfText";
  1239. FOR i := 0 TO EndOfText DO ASSERT(tokens[i] # "") END;
  1240. END InitTokens;
  1241. (** enter keywords in the list of keywords (both upper- and lowercase) **)
  1242. PROCEDURE InitKeywords;
  1243. PROCEDURE Upper(CONST source: ARRAY OF CHAR; VAR dest: ARRAY OF CHAR);
  1244. VAR c: CHAR; i: LONGINT;
  1245. BEGIN
  1246. i := 0;
  1247. REPEAT
  1248. c := source[i];
  1249. IF (c >= 'a') & (c<= 'z') THEN c := CHR(ORD(c)-ORD('a')+ORD('A')) END;
  1250. dest[i] := c; INC(i);
  1251. UNTIL c = 0X;
  1252. END Upper;
  1253. PROCEDURE Enter1(CONST name: ARRAY OF CHAR; token: LONGINT; case: SET);
  1254. BEGIN
  1255. IF Lowercase IN case THEN keywordsLower.PutString(name,token) END;
  1256. IF Uppercase IN case THEN keywordsUpper.PutString(name,token) END;
  1257. Basic.SetErrorExpected(token,name);
  1258. END Enter1;
  1259. PROCEDURE Enter(CONST name: ARRAY OF CHAR; token: LONGINT);
  1260. VAR upper: Keyword;
  1261. BEGIN
  1262. Enter1(name,token,{Lowercase});
  1263. Upper(name,upper);
  1264. Enter1(upper,token,{Uppercase});
  1265. END Enter;
  1266. PROCEDURE EnterSymbol(CONST name: ARRAY OF CHAR; token: LONGINT);
  1267. BEGIN
  1268. Enter1(name,token,{Lowercase,Uppercase});
  1269. END EnterSymbol;
  1270. BEGIN
  1271. NEW(keywordsUpper,EndOfText+1);
  1272. NEW(keywordsLower,EndOfText+1);
  1273. (* constructs and statements *)
  1274. Enter( "cell", Cell );
  1275. Enter( "cellnet", CellNet);
  1276. Enter( "await" , Await);
  1277. Enter( "begin" , Begin);
  1278. Enter( "by" , By);
  1279. Enter( "const" , Const);
  1280. Enter( "case" , Case);
  1281. Enter( "code" , Code);
  1282. Enter( "definition", Definition);
  1283. Enter( "do" , Do);
  1284. Enter( "div" , Div);
  1285. Enter( "end" , End);
  1286. Enter( "enum", Enum);
  1287. Enter( "else" , Else);
  1288. Enter( "elsif" , Elsif);
  1289. Enter( "exit" , Exit);
  1290. Enter( "extern" , Extern);
  1291. Enter( "false" , False);
  1292. Enter( "for" , For);
  1293. Enter( "finally" , Finally);
  1294. Enter( "if" , If);
  1295. Enter( "imag" , Imag);
  1296. Enter( "in" , In);
  1297. Enter( "is" , Is);
  1298. Enter( "import" , Import);
  1299. Enter( "loop" , Loop);
  1300. Enter( "module", Module);
  1301. Enter( "mod" , Mod);
  1302. Enter( "nil" , Nil );
  1303. Enter( "of" , Of);
  1304. Enter( "or" , Or);
  1305. Enter( "out", Out);
  1306. Enter( "operator" , Operator);
  1307. Enter( "procedure" , Procedure);
  1308. Enter( "port", Port);
  1309. Enter( "repeat" , Repeat);
  1310. Enter( "return" , Return);
  1311. Enter( "self", Self);
  1312. Enter( "result", Result);
  1313. Enter( "then" , Then);
  1314. Enter( "true" , True);
  1315. Enter( "to" , To);
  1316. Enter( "type" , Type);
  1317. Enter( "until" , Until );
  1318. Enter( "var" , Var );
  1319. Enter( "while" , While);
  1320. Enter( "with" , With);
  1321. (* types *)
  1322. Enter( "array" , Array );
  1323. Enter( "object" , Object);
  1324. Enter( "pointer" , Pointer);
  1325. Enter( "record" , Record);
  1326. Enter( "address" , Address);
  1327. Enter( "size" , Size);
  1328. Enter( "alias" , Alias);
  1329. (* symbols *)
  1330. EnterSymbol( "#", Unequal);
  1331. EnterSymbol( "&", And);
  1332. EnterSymbol( "(", LeftParenthesis);
  1333. EnterSymbol( ")", RightParenthesis);
  1334. EnterSymbol( "*", Times);
  1335. EnterSymbol( "**",TimesTimes);
  1336. EnterSymbol( "+", Plus);
  1337. EnterSymbol( "+*", PlusTimes);
  1338. EnterSymbol( ",", Comma);
  1339. EnterSymbol( "-", Minus);
  1340. EnterSymbol(".",Period );
  1341. EnterSymbol("..",Upto );
  1342. EnterSymbol(".*",DotTimes );
  1343. EnterSymbol("./",DotSlash );
  1344. EnterSymbol(".=",DotEqual );
  1345. EnterSymbol(".#",DotUnequal );
  1346. EnterSymbol(".>",DotGreater );
  1347. EnterSymbol(".>=",DotGreaterEqual );
  1348. EnterSymbol(".<", DotLess);
  1349. EnterSymbol(".<=",DotLessEqual );
  1350. EnterSymbol( "/", Slash);
  1351. EnterSymbol( ":", Colon);
  1352. EnterSymbol( ":=",Becomes);
  1353. EnterSymbol( ";", Semicolon);
  1354. EnterSymbol( "<", Less);
  1355. EnterSymbol( "<=", LessEqual);
  1356. EnterSymbol( "=", Equal);
  1357. EnterSymbol( ">", Greater);
  1358. EnterSymbol( ">=", GreaterEqual);
  1359. EnterSymbol( "[", LeftBracket);
  1360. EnterSymbol( "]", RightBracket);
  1361. EnterSymbol( "^", Arrow);
  1362. EnterSymbol( "{", LeftBrace);
  1363. EnterSymbol( "|",Bar);
  1364. EnterSymbol( "}", RightBrace);
  1365. EnterSymbol( "~", Not);
  1366. EnterSymbol( "\", Backslash);
  1367. EnterSymbol( "`", Transpose);
  1368. EnterSymbol( "?",Questionmark);
  1369. EnterSymbol( "??",Questionmarks);
  1370. EnterSymbol( "!",ExclamationMark);
  1371. EnterSymbol( "!!",ExclamationMarks);
  1372. EnterSymbol( "<<",LessLess);
  1373. EnterSymbol( "<<?",LessLessQ);
  1374. EnterSymbol( ">>",GreaterGreater);
  1375. EnterSymbol( ">>?",GreaterGreaterQ);
  1376. Basic.SetErrorMessage(Number,"missing number");
  1377. Basic.SetErrorMessage(String,"missing string");
  1378. Basic.SetErrorMessage(Character,"missing character");
  1379. Basic.SetErrorMessage(Identifier,"missing identifier");
  1380. Basic.SetErrorMessage(EndOfText,"unexpected symbol before end");
  1381. END InitKeywords;
  1382. (** debugging / reporting **)
  1383. PROCEDURE ReportKeywords*(context: Commands.Context);
  1384. VAR i: LONGINT; name: Keyword;
  1385. BEGIN
  1386. FOR i := 0 TO EndOfText DO
  1387. context.out.Int(i,1); context.out.String(": ");
  1388. context.out.Char('"');
  1389. keywordsLower.StringByIndex(i,name);
  1390. context.out.String(name);
  1391. context.out.Char('"');
  1392. context.out.String(", ");
  1393. context.out.Char('"');
  1394. keywordsUpper.StringByIndex(i,name);
  1395. context.out.String(name);
  1396. context.out.Char('"');
  1397. context.out.Ln;
  1398. END;
  1399. END ReportKeywords;
  1400. (*
  1401. PROCEDURE TestScanner*(context: Commands.Context);
  1402. VAR filename: ARRAY 256 OF CHAR; reader: Streams.Reader; scanner: Scanner;sym: Symbol;
  1403. BEGIN
  1404. context.arg.SkipWhitespace; context.arg.String(filename);
  1405. reader := TextUtilities.GetTextReader(filename);
  1406. scanner := NewScanner(filename,reader,0,NIL);
  1407. REPEAT
  1408. IF scanner.GetNextSymbol(sym) THEN
  1409. OutSymbol(context.out,sym);context.out.Ln;
  1410. END;
  1411. UNTIL scanner.error OR (sym.token=EndOfText)
  1412. END TestScanner;
  1413. *)
  1414. BEGIN
  1415. InitReservedCharacters; InitTokens; InitKeywords
  1416. END FoxScanner.
  1417. FoxScanner.ReportKeywords
  1418. FoxScanner.TestScanner Test.Mod ~