FoxScanner.Mod 51 KB

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