FoxScanner.Mod 51 KB

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