FoxScanner.Mod 51 KB

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