M2c.atg 49 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901
  1. COMPILER M2c
  2. (* Modula-2 program modules without procedures, with an MC64 backend
  3. (see MGen for details).
  4. - program module only, no DEFINITION / IMPLEMENTATION split
  5. - no local modules, no EXPORT, no PRIORITY
  6. - no ProcedureDeclaration, FormalParameters, ProcedureType,
  7. ProcedureCall, ActualParameters, FORWARD, RETURN
  8. - statements: assignment, IF, CASE, WHILE, REPEAT, LOOP/EXIT, FOR, WITH
  9. - symbol table (SymTab) with static type checking: error codes
  10. 200/201/202 and 210-224, same lenient rules as the reference
  11. implementation (single pass, declare-before-use; INTEGER,
  12. CARDINAL and subranges form one integer family; no mixed
  13. INTEGER/REAL arithmetic; INTEGER assigns to REAL; 1-character
  14. literal is CHAR; InvalidType suppresses follow-on errors)
  15. - backend (MGen): emits a single-module MC64 image <ModName>.MCD
  16. (current directory), runnable with mcint. Lowered: scalar
  17. globals, CONST literals (startup stores), SET OF ordinals
  18. (bit masks) with literals, IN, = and #; full scalar
  19. expressions on the stack machine; control flow via E0/E1 jumps.
  20. Everything else parses and type-checks but gets error 230
  21. (not supported in this phase): ARRAY/RECORD/POINTER variables,
  22. string variables, WITH, non-literal CONST expressions and BY
  23. steps, EXIT outside LOOP, imported names used as values.
  24. - test convention (the language has no I/O): a global
  25. VAR ExitCode : INTEGER;
  26. is printed as decimal + CRLF through an embedded helper;
  27. without it the program just ends.
  28. - known semantic edges: INTEGER DIV/MOD truncate toward zero
  29. (not Modula-2 floor); CARDINAL values past MAXINT compare as
  30. signed; AND/OR are eager (no short-circuit); REAL widens to
  31. binary64; assignment targets cost one dead load. *)
  32. IMPORT SymTab, MGen;
  33. CHARACTERS
  34. eol = CHR(13) .
  35. letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .
  36. digit = "0123456789" .
  37. hexDigit = digit + "ABCDEF" .
  38. noQuote1 = ANY - "'" - eol .
  39. noQuote2 = ANY - '"' - eol .
  40. IGNORE CHR(9) .. CHR(13)
  41. COMMENTS
  42. FROM "(*" TO "*)" NESTED
  43. TOKENS
  44. ident = letter { letter | digit } .
  45. integer = digit { digit }
  46. | digit { digit } CONTEXT("..")
  47. | digit { hexDigit } "H" .
  48. real = digit { digit } "." { digit }
  49. [ "E" [ "+" | "-" ] digit { digit } ] .
  50. string = "'" { noQuote1 } "'"
  51. | '"' { noQuote2 } '"' .
  52. PRODUCTIONS
  53. M2c (. VAR m1, m2: SymTab.Name; .)
  54. = "MODULE"
  55. GetIdent<m1> (. SymTab.Init; MGen.OpenModule(m1);
  56. IF ~SymTab.Enter(m1, SymTab.KindModule)
  57. THEN SemError(200) END .)
  58. ";"
  59. { Import } Block GetIdent<m2> (. IF ~SymTab.Equal(m1, m2)
  60. THEN SemError(202) END .)
  61. "." (. MGen.EndModule;
  62. SymTab.PrintTable; .) .
  63. Import (. VAR n: SymTab.Name; .)
  64. = "FROM"
  65. GetIdent<n> (. IF ~SymTab.Enter(n, SymTab.KindImport)
  66. THEN SemError(200) END .)
  67. "IMPORT"
  68. ImportList ";"
  69. | "IMPORT"
  70. ImportList ";" .
  71. ImportList (. VAR n: SymTab.Name; .)
  72. = GetIdent<n> (. IF ~SymTab.Enter(n, SymTab.KindImport)
  73. THEN SemError(200) END .)
  74. { ","
  75. GetIdent<n> (. IF ~SymTab.Enter(n, SymTab.KindImport)
  76. THEN SemError(200) END .) } .
  77. Block = { Declaration }
  78. [ "BEGIN" (. MGen.BeginBody; .)
  79. StatSeq ]
  80. "END" .
  81. Declaration = "CONST"
  82. {
  83. ConstDecl ";" }
  84. | "TYPE"
  85. {
  86. TypeDecl ";" }
  87. | "VAR"
  88. {
  89. VarDecl ";" } .
  90. ConstDecl (. VAR n: SymTab.Name;
  91. t: SymTab.TypeIndex;
  92. lx: MGen.LitStr;
  93. cls: INTEGER; .)
  94. = GetIdent<n> (. IF ~SymTab.Enter(n, SymTab.KindConst)
  95. THEN SemError(200) END .)
  96. "=" (. MGen.NoEmitEnter; .)
  97. ConstExpr<t, lx> (. SymTab.SetSymType(n, t);
  98. cls := SymTab.ClassOf(t);
  99. IF cls = SymTab.ClStr THEN
  100. SemError(230)
  101. ELSIF ~MGen.IsLit(lx) THEN
  102. SemError(230)
  103. END;
  104. MGen.DeclConst(n, lx, t);
  105. MGen.NoEmitExit; .) .
  106. ConstExpr <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr>
  107. = Expr<t, lx> .
  108. TypeDecl (. VAR n: SymTab.Name;
  109. t0, t1: SymTab.TypeIndex; .)
  110. = GetIdent<n> (. IF ~SymTab.Enter(n, SymTab.KindType)
  111. THEN SemError(200) END;
  112. t0 := SymTab.NewAlias();
  113. SymTab.SetSymType(n, t0); .)
  114. "="
  115. Type<t1> (. IF t1 = t0 THEN SemError(223);
  116. SymTab.SetTarget(t0,
  117. SymTab.InvalidType)
  118. ELSE SymTab.SetTarget(t0, t1) END; .) .
  119. VarDecl (. VAR t: SymTab.TypeIndex;
  120. i: CARDINAL;
  121. nm: SymTab.Name;
  122. cls: INTEGER; .)
  123. = VarIdents ":"
  124. Type<t> (. cls := SymTab.ClassOf(t);
  125. IF (cls # SymTab.ClInt)
  126. & (cls # SymTab.ClReal)
  127. & (cls # SymTab.ClBool)
  128. & (cls # SymTab.ClChar)
  129. & (cls # SymTab.ClEnum)
  130. & (cls # SymTab.ClSet) THEN
  131. SemError(230)
  132. END;
  133. i := 0;
  134. WHILE i < SymTab.PendCount() DO
  135. SymTab.PendName(i, nm);
  136. MGen.DeclVar(nm);
  137. INC(i)
  138. END;
  139. SymTab.FixPending(t); .) .
  140. VarIdents (. VAR n: SymTab.Name; .)
  141. = GetIdent<n> (. IF ~SymTab.EnterPending(n,
  142. SymTab.KindVar)
  143. THEN SemError(200) END .)
  144. { ","
  145. GetIdent<n> (. IF ~SymTab.EnterPending(n,
  146. SymTab.KindVar)
  147. THEN SemError(200) END .) } .
  148. QualIdent <VAR t: SymTab.TypeIndex>
  149. (. VAR n, m: SymTab.Name; .)
  150. = GetIdent<n> (. IF ~SymTab.Lookup(n) THEN
  151. SemError(201);
  152. t := SymTab.InvalidType
  153. ELSIF (SymTab.SymKind(n) #
  154. SymTab.KindType)
  155. & (SymTab.SymKind(n) #
  156. SymTab.KindPredef)
  157. & (SymTab.SymKind(n) #
  158. SymTab.KindImport) THEN
  159. SemError(221);
  160. t := SymTab.InvalidType
  161. ELSE t := SymTab.SymType(n) END; .)
  162. { "."
  163. GetIdent<m> (. t := SymTab.InvalidType; .) } .
  164. (* Types: ProcedureType removed; subrange factored for LL(1) *)
  165. Type <VAR t: SymTab.TypeIndex>
  166. = SimpleType<t> | ArrayType<t> | RecordType<t>
  167. | SetType<t> | PointerType<t> .
  168. SimpleType <VAR t: SymTab.TypeIndex>
  169. (. VAR t1, t2: SymTab.TypeIndex;
  170. lx1, lx2: MGen.LitStr; .)
  171. = QualIdent<t> [ "["
  172. (. MGen.NoEmitEnter; .)
  173. ConstExpr<t1, lx1> (. IF (t1 # SymTab.InvalidType)
  174. & (SymTab.ClassOf(t1) #
  175. SymTab.ClInt)
  176. & (SymTab.ClassOf(t1) #
  177. SymTab.ClChar)
  178. & (SymTab.ClassOf(t1) #
  179. SymTab.ClEnum) THEN
  180. SemError(224) END; .)
  181. ".."
  182. ConstExpr<t2, lx2> (. IF (t2 # SymTab.InvalidType)
  183. & (SymTab.ClassOf(t2) #
  184. SymTab.ClInt)
  185. & (SymTab.ClassOf(t2) #
  186. SymTab.ClChar)
  187. & (SymTab.ClassOf(t2) #
  188. SymTab.ClEnum) THEN
  189. SemError(224) END; .)
  190. "]"
  191. (. t := SymTab.NewSub(t1);
  192. MGen.NoEmitExit; .) ]
  193. | "[" (. MGen.NoEmitEnter; .)
  194. ConstExpr<t1, lx1> (. IF (t1 # SymTab.InvalidType)
  195. & (SymTab.ClassOf(t1) #
  196. SymTab.ClInt)
  197. & (SymTab.ClassOf(t1) #
  198. SymTab.ClChar)
  199. & (SymTab.ClassOf(t1) #
  200. SymTab.ClEnum) THEN
  201. SemError(224) END; .)
  202. ".."
  203. ConstExpr<t2, lx2> (. IF (t2 # SymTab.InvalidType)
  204. & (SymTab.ClassOf(t2) #
  205. SymTab.ClInt)
  206. & (SymTab.ClassOf(t2) #
  207. SymTab.ClChar)
  208. & (SymTab.ClassOf(t2) #
  209. SymTab.ClEnum) THEN
  210. SemError(224) END; .)
  211. "]" (. t := SymTab.NewSub(t1);
  212. MGen.NoEmitExit; .)
  213. | Enum<t> .
  214. Enum <VAR t: SymTab.TypeIndex>
  215. (. VAR n: SymTab.Name;
  216. ord: INTEGER; .)
  217. = "(" (. t := SymTab.NewEnum();
  218. ord := 0; .)
  219. GetIdent<n> (. IF ~SymTab.Enter(n,
  220. SymTab.KindConst)
  221. THEN SemError(200) END;
  222. SymTab.SetSymType(n, t);
  223. MGen.DeclConstInt(n, ord);
  224. INC(ord); .)
  225. { ","
  226. GetIdent<n> (. IF ~SymTab.Enter(n,
  227. SymTab.KindConst)
  228. THEN SemError(200) END;
  229. SymTab.SetSymType(n, t);
  230. MGen.DeclConstInt(n, ord);
  231. INC(ord); .) }
  232. ")" .
  233. ArrayType <VAR t: SymTab.TypeIndex>
  234. (. VAR s, s2, e: SymTab.TypeIndex; .)
  235. = "ARRAY"
  236. SimpleType<s> (. IF (s # SymTab.InvalidType)
  237. & (SymTab.ClassOf(s) #
  238. SymTab.ClInt)
  239. & (SymTab.ClassOf(s) #
  240. SymTab.ClChar)
  241. & (SymTab.ClassOf(s) #
  242. SymTab.ClEnum) THEN
  243. SemError(224) END; .)
  244. { ","
  245. SimpleType<s2> (. IF (s2 # SymTab.InvalidType)
  246. & (SymTab.ClassOf(s2) #
  247. SymTab.ClInt)
  248. & (SymTab.ClassOf(s2) #
  249. SymTab.ClChar)
  250. & (SymTab.ClassOf(s2) #
  251. SymTab.ClEnum) THEN
  252. SemError(224) END; .) }
  253. "OF"
  254. Type<e> (. t := SymTab.NewArray(e); .) .
  255. RecordType <VAR t: SymTab.TypeIndex>
  256. = "RECORD" (. t := SymTab.NewRecord(); .)
  257. FieldSeq<t>
  258. "END" .
  259. FieldSeq <rt: SymTab.TypeIndex>
  260. = Field<rt> { ";"
  261. Field<rt> } .
  262. Field <rt: SymTab.TypeIndex>
  263. (. VAR et: SymTab.TypeIndex; .)
  264. = [ FieldIdents<rt> ":"
  265. Type<et> (. SymTab.FixPendingF(rt, et); .) ] .
  266. FieldIdents <rt: SymTab.TypeIndex>
  267. (. VAR n: SymTab.Name; .)
  268. = GetIdent<n> (. IF ~SymTab.FieldPending(rt, n)
  269. THEN SemError(200) END .)
  270. { ","
  271. GetIdent<n> (. IF ~SymTab.FieldPending(rt, n)
  272. THEN SemError(200) END .) } .
  273. SetType <VAR t: SymTab.TypeIndex>
  274. (. VAR s: SymTab.TypeIndex; .)
  275. = "SET"
  276. "OF"
  277. SimpleType<s> (. IF (s # SymTab.InvalidType)
  278. & (SymTab.ClassOf(s) #
  279. SymTab.ClInt)
  280. & (SymTab.ClassOf(s) #
  281. SymTab.ClChar)
  282. & (SymTab.ClassOf(s) #
  283. SymTab.ClEnum) THEN
  284. SemError(224) END;
  285. t := SymTab.NewSet(s); .) .
  286. PointerType <VAR t: SymTab.TypeIndex>
  287. (. VAR b: SymTab.TypeIndex; .)
  288. = "POINTER"
  289. "TO"
  290. Type<b> (. t := SymTab.NewPtr(b); .) .
  291. (* Statements: ProcedureCall and RETURN removed *)
  292. StatSeq = Stat { ";"
  293. Stat } .
  294. Stat (. VAR lx: INTEGER; .)
  295. = [ Assign | IfStat | CaseStat | WhileStat
  296. | RepeatStat | LoopStat | ForStat | WithStat
  297. | "EXIT" (. IF MGen.TopLoop(lx) THEN
  298. MGen.Jmp(lx)
  299. ELSE SemError(230) END; .) ] .
  300. Assign (. VAR dt, et: SymTab.TypeIndex;
  301. dk: INTEGER;
  302. bn: SymTab.Name;
  303. lxe, lxD: MGen.LitStr;
  304. isR, conv: BOOLEAN; .)
  305. = Design<dt, dk, bn, FALSE, lxD> ":="
  306. Expr<et, lxe> (. IF (dt # SymTab.InvalidType)
  307. & (dk # SymTab.KindVar)
  308. & (dk # SymTab.KindField)
  309. & (dk # SymTab.KindImport) THEN
  310. SemError(210)
  311. ELSIF ~SymTab.Assignable(et, dt) THEN
  312. SemError(210) END;
  313. IF dk = SymTab.KindImport THEN
  314. SemError(230)
  315. END;
  316. isR := (dt # SymTab.InvalidType)
  317. & (SymTab.ClassOf(dt)
  318. = SymTab.ClReal);
  319. conv := isR
  320. & SymTab.IsIntFamily(et);
  321. IF dk = SymTab.KindVar THEN
  322. IF conv THEN
  323. MGen.IntToReal;
  324. END;
  325. MGen.StoreVar(bn)
  326. ELSE MGen.Drop
  327. END; .) .
  328. IfStat (. VAR t: SymTab.TypeIndex;
  329. lxC: MGen.LitStr;
  330. elseL, endL: INTEGER;
  331. hasElse: BOOLEAN; .)
  332. = "IF"
  333. Expr<t, lxC> (. IF ~SymTab.BoolCheck(t) THEN
  334. SemError(214) END;
  335. elseL := MGen.NewLabel();
  336. endL := MGen.NewLabel();
  337. MGen.Jz(elseL);
  338. hasElse := FALSE; .)
  339. "THEN"
  340. StatSeq
  341. { "ELSIF" (. MGen.Jmp(endL);
  342. MGen.DefLabel(elseL); .)
  343. Expr<t, lxC> (. IF ~SymTab.BoolCheck(t) THEN
  344. SemError(214) END;
  345. elseL := MGen.NewLabel();
  346. MGen.Jz(elseL); .)
  347. "THEN"
  348. StatSeq }
  349. [ "ELSE" (. MGen.Jmp(endL);
  350. MGen.DefLabel(elseL);
  351. hasElse := TRUE; .)
  352. StatSeq ]
  353. "END" (. IF ~hasElse THEN
  354. MGen.DefLabel(elseL)
  355. END;
  356. MGen.DefLabel(endL); .) .
  357. CaseStat (. VAR st: SymTab.TypeIndex;
  358. lxS: MGen.LitStr;
  359. tmp, endL: INTEGER; .)
  360. = "CASE"
  361. Expr<st, lxS> (. tmp := MGen.TempGlobal();
  362. MGen.StoreTemp(tmp);
  363. endL := MGen.NewLabel(); .)
  364. "OF"
  365. Case<st, tmp, endL> { "|"
  366. Case<st, tmp, endL> }
  367. [ "ELSE"
  368. StatSeq ]
  369. "END" (. MGen.DefLabel(endL); .) .
  370. Case <sel: SymTab.TypeIndex; tmp: INTEGER; endL: INTEGER>
  371. (. VAR lB, lN: INTEGER; .)
  372. = [ LabelList<sel, tmp, lB, lN> ":" (. MGen.DefLabel(lB); .)
  373. StatSeq (. MGen.Jmp(endL);
  374. MGen.DefLabel(lN); .) ] .
  375. LabelList <sel: SymTab.TypeIndex; tmp: INTEGER;
  376. VAR lB: INTEGER; VAR lN: INTEGER>
  377. = (. lB := MGen.NewLabel();
  378. lN := MGen.NewLabel(); .)
  379. Labels<sel, tmp, lB> { ","
  380. Labels<sel, tmp, lB> }
  381. (. MGen.Jmp(lN); .) .
  382. Labels <sel: SymTab.TypeIndex; tmp: INTEGER; bodyL: INTEGER>
  383. (. VAR t, t2: SymTab.TypeIndex;
  384. lx1, lx2: MGen.LitStr;
  385. ta, tb, chunk: INTEGER;
  386. r, hasRange: BOOLEAN; .)
  387. = ConstExpr<t, lx1> (. IF ~SymTab.EqCheck(t, sel) THEN
  388. SemError(213) END;
  389. r := (SymTab.ClassOf(sel)
  390. = SymTab.ClReal)
  391. & (SymTab.ClassOf(t)
  392. = SymTab.ClReal);
  393. ta := MGen.TempGlobal();
  394. MGen.StoreTemp(ta);
  395. hasRange := FALSE; .)
  396. [ ".."
  397. ConstExpr<t2, lx2> (. IF ~SymTab.EqCheck(t2, sel) THEN
  398. SemError(213) END;
  399. tb := MGen.TempGlobal();
  400. MGen.StoreTemp(tb);
  401. hasRange := TRUE; .) ]
  402. (. IF hasRange THEN
  403. MGen.LoadTemp(tmp);
  404. MGen.LoadTemp(ta);
  405. IF r THEN MGen.RealGe
  406. ELSE MGen.IGe END;
  407. MGen.LoadTemp(tmp);
  408. MGen.LoadTemp(tb);
  409. IF r THEN MGen.RealLe
  410. ELSE MGen.ILe END;
  411. MGen.And
  412. ELSE
  413. MGen.LoadTemp(tmp);
  414. MGen.LoadTemp(ta);
  415. IF r THEN MGen.RealEq
  416. ELSE MGen.Eq END
  417. END;
  418. chunk := MGen.NewLabel();
  419. MGen.Jz(chunk);
  420. MGen.Jmp(bodyL);
  421. MGen.DefLabel(chunk); .) .
  422. WhileStat (. VAR t: SymTab.TypeIndex;
  423. lxC: MGen.LitStr;
  424. topL, endL: INTEGER; .)
  425. = "WHILE" (. topL := MGen.NewLabel();
  426. endL := MGen.NewLabel();
  427. MGen.DefLabel(topL); .)
  428. Expr<t, lxC> (. IF ~SymTab.BoolCheck(t) THEN
  429. SemError(214) END;
  430. MGen.Jz(endL); .)
  431. "DO"
  432. StatSeq
  433. "END" (. MGen.Jmp(topL);
  434. MGen.DefLabel(endL); .) .
  435. RepeatStat (. VAR t: SymTab.TypeIndex;
  436. lxC: MGen.LitStr;
  437. topL: INTEGER; .)
  438. = "REPEAT" (. topL := MGen.NewLabel();
  439. MGen.DefLabel(topL); .)
  440. StatSeq
  441. "UNTIL"
  442. Expr<t, lxC> (. IF ~SymTab.BoolCheck(t) THEN
  443. SemError(214) END;
  444. MGen.Jz(topL); .) .
  445. LoopStat (. VAR topL, exitL: INTEGER; .)
  446. = "LOOP" (. topL := MGen.NewLabel();
  447. exitL := MGen.NewLabel();
  448. MGen.DefLabel(topL);
  449. MGen.PushLoop(exitL); .)
  450. StatSeq
  451. "END" (. MGen.Jmp(topL);
  452. MGen.DefLabel(exitL);
  453. MGen.PopLoop; .) .
  454. ForStat (. VAR n, lv: SymTab.Name;
  455. lo, hi: SymTab.TypeIndex;
  456. lxLo, lxHi: MGen.LitStr;
  457. byV, ht: INTEGER;
  458. lTop, lChk, lEnd: INTEGER;
  459. neg: BOOLEAN; .)
  460. = "FOR"
  461. GetIdent<n> (. IF ~SymTab.Lookup(n) THEN
  462. SemError(201)
  463. ELSIF (SymTab.SymKind(n) #
  464. SymTab.KindVar)
  465. & (SymTab.SymKind(n) #
  466. SymTab.KindField) THEN
  467. SemError(220)
  468. ELSIF (SymTab.SymType(n) #
  469. SymTab.InvalidType)
  470. & ~SymTab.IsIntFamily(
  471. SymTab.SymType(n)) THEN
  472. SemError(220) END;
  473. MGen.CopyName(n, lv); .)
  474. ":="
  475. Expr<lo, lxLo> (. IF (lo # SymTab.InvalidType)
  476. & ~SymTab.IsIntFamily(lo) THEN
  477. SemError(220) END;
  478. MGen.StoreVar(lv); .)
  479. "TO"
  480. Expr<hi, lxHi> (. IF (hi # SymTab.InvalidType)
  481. & ~SymTab.IsIntFamily(hi) THEN
  482. SemError(220) END;
  483. ht := MGen.TempGlobal();
  484. MGen.StoreTemp(ht);
  485. byV := 1; neg := FALSE; .)
  486. [ "BY"
  487. ByLit<byV> (. neg := byV < 0; .) ]
  488. "DO" (. lTop := MGen.NewLabel();
  489. lChk := MGen.NewLabel();
  490. lEnd := MGen.NewLabel();
  491. MGen.Jmp(lChk);
  492. MGen.DefLabel(lTop); .)
  493. StatSeq
  494. "END" (. MGen.LoadVar(lv);
  495. MGen.PushInt(byV);
  496. MGen.Add;
  497. MGen.StoreVar(lv);
  498. MGen.DefLabel(lChk);
  499. MGen.LoadVar(lv);
  500. MGen.LoadTemp(ht);
  501. IF neg THEN MGen.IGe
  502. ELSE MGen.ILe END;
  503. MGen.Jz(lEnd);
  504. MGen.Jmp(lTop);
  505. MGen.DefLabel(lEnd); .) .
  506. ByLit <VAR v: INTEGER> (. VAR s: ARRAY [0 .. 255] OF CHAR; .)
  507. = integer (. LexString(s);
  508. IF ~MGen.ParseInt(s, v) THEN
  509. v := 1
  510. END; .)
  511. | "-" integer (. LexString(s);
  512. IF MGen.ParseInt(s, v) THEN
  513. v := -v
  514. ELSE v := -1
  515. END; .) .
  516. WithStat (. VAR dt: SymTab.TypeIndex;
  517. dk: INTEGER;
  518. bnW: SymTab.Name;
  519. lxW: MGen.LitStr;
  520. pushed: BOOLEAN; .)
  521. = "WITH"
  522. Design<dt, dk, bnW, FALSE, lxW> (. pushed := FALSE;
  523. IF dt # SymTab.InvalidType THEN
  524. pushed :=
  525. SymTab.PushRecord(dt);
  526. IF ~pushed THEN
  527. SemError(215)
  528. END
  529. END;
  530. IF pushed THEN
  531. MGen.NoSupEnter;
  532. SemError(230)
  533. END; .)
  534. "DO"
  535. StatSeq
  536. "END" (. IF pushed THEN
  537. SymTab.PopScope;
  538. MGen.NoSupExit
  539. END; .) .
  540. (* Expressions: Designator without ActualParameters.
  541. Only record fields resolve qualified access; WITH pushes an
  542. inner scope so field names also work unqualified in its body.
  543. Each expression synthesizes its SymTab type in t and, for
  544. single literals, the source text in lx ("" otherwise, used for
  545. CONST validation). Values travel on the MC64 stack. *)
  546. Design <VAR t: SymTab.TypeIndex; VAR k: INTEGER;
  547. VAR bn: SymTab.Name; doLoad: BOOLEAN; VAR lx: MGen.LitStr>
  548. (. VAR n, m: SymTab.Name;
  549. it: SymTab.TypeIndex;
  550. lxI: MGen.LitStr;
  551. cls: INTEGER; .)
  552. = GetIdent<n> (. MGen.CopyName(n, bn);
  553. lx[0] := 0C;
  554. IF ~SymTab.Lookup(n) THEN
  555. SemError(201);
  556. t := SymTab.InvalidType; k := -1;
  557. IF doLoad THEN
  558. MGen.PushInt(0)
  559. END
  560. ELSE
  561. t := SymTab.SymType(n);
  562. k := SymTab.SymKind(n);
  563. IF k = SymTab.KindConst THEN
  564. IF SymTab.Equal(n, "TRUE") THEN
  565. t := SymTab.BoolType();
  566. MGen.CopyName("TRUE", lx);
  567. IF doLoad THEN
  568. MGen.PushInt(1)
  569. END
  570. ELSIF SymTab.Equal(n,
  571. "FALSE") THEN
  572. t := SymTab.BoolType();
  573. MGen.CopyName("FALSE", lx);
  574. IF doLoad THEN
  575. MGen.PushInt(0)
  576. END
  577. ELSE
  578. cls :=
  579. SymTab.ClassOf(t);
  580. IF (t #
  581. SymTab.InvalidType)
  582. & (cls # SymTab.ClStr)
  583. & ((cls = SymTab.ClInt)
  584. OR (cls = SymTab.ClReal)
  585. OR (cls = SymTab.ClBool)
  586. OR (cls = SymTab.ClChar)
  587. OR (cls
  588. = SymTab.ClEnum)) THEN
  589. IF doLoad THEN
  590. MGen.LoadVar(n)
  591. END
  592. ELSIF doLoad THEN
  593. MGen.PushInt(0)
  594. END
  595. END
  596. ELSIF k = SymTab.KindVar THEN
  597. cls := SymTab.ClassOf(t);
  598. IF (cls = SymTab.ClInt)
  599. OR (cls = SymTab.ClReal)
  600. OR (cls = SymTab.ClBool)
  601. OR (cls = SymTab.ClChar)
  602. OR (cls
  603. = SymTab.ClEnum)
  604. OR (cls
  605. = SymTab.ClSet) THEN
  606. IF doLoad THEN
  607. MGen.LoadVar(n)
  608. END
  609. ELSE SemError(230);
  610. IF doLoad THEN
  611. MGen.PushInt(0)
  612. END
  613. END
  614. ELSE
  615. IF doLoad THEN
  616. MGen.PushInt(0)
  617. END;
  618. IF k = SymTab.KindField THEN
  619. IF ~MGen.NoSup() THEN
  620. SemError(230)
  621. END
  622. ELSIF k
  623. = SymTab.KindImport THEN
  624. SemError(230)
  625. END
  626. END
  627. END; .)
  628. { "." (. lx[0] := 0C; .)
  629. GetIdent<m> (. IF t = SymTab.InvalidType THEN
  630. ELSIF SymTab.ClassOf(t) #
  631. SymTab.ClRecord THEN
  632. SemError(215);
  633. t := SymTab.InvalidType
  634. ELSIF ~SymTab.FieldExists(t, m) THEN
  635. SemError(216);
  636. t := SymTab.InvalidType
  637. ELSE t := SymTab.FieldType(t, m);
  638. SemError(230)
  639. END;
  640. IF doLoad THEN
  641. MGen.Drop; MGen.PushInt(0)
  642. END; .)
  643. | "["
  644. Expr<it, lxI> (. MGen.Drop;
  645. IF t = SymTab.InvalidType THEN
  646. ELSIF SymTab.ClassOf(t) #
  647. SymTab.ClArray THEN
  648. SemError(217);
  649. t := SymTab.InvalidType
  650. ELSIF (it #
  651. SymTab.InvalidType)
  652. & ~SymTab.IsIntFamily(it) THEN
  653. SemError(218);
  654. t := SymTab.InvalidType
  655. ELSE t :=
  656. SymTab.ArrayElem(t);
  657. SemError(230)
  658. END;
  659. IF doLoad THEN
  660. MGen.Drop; MGen.PushInt(0)
  661. END; .)
  662. { ","
  663. Expr<it, lxI> (. MGen.Drop;
  664. IF (it # SymTab.InvalidType)
  665. & ~SymTab.IsIntFamily(it) THEN
  666. SemError(218) END; .) }
  667. "]"
  668. | "^" (. lx[0] := 0C;
  669. IF t = SymTab.InvalidType THEN
  670. ELSIF SymTab.ClassOf(t) #
  671. SymTab.ClPtr THEN
  672. SemError(219);
  673. t := SymTab.InvalidType
  674. ELSE t := SymTab.PtrBase(t);
  675. SemError(230)
  676. END;
  677. IF doLoad THEN
  678. MGen.Drop; MGen.PushInt(0)
  679. END; .) } .
  680. Expr <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr>
  681. (. VAR t2: SymTab.TypeIndex;
  682. tc, op: INTEGER;
  683. lx2: MGen.LitStr;
  684. r: BOOLEAN; .)
  685. = SimExpr<t, lx> [ Rel<op> SimExpr<t2, lx2>
  686. (. lx[0] := 0C;
  687. IF op = SymTab.OpIn THEN
  688. IF SymTab.InCheck(t, t2) THEN
  689. t := SymTab.BoolType();
  690. MGen.BitIn
  691. ELSE SemError(222);
  692. t := SymTab.InvalidType;
  693. MGen.Drop; MGen.Drop; MGen.PushInt(0)
  694. END
  695. ELSE
  696. tc := SymTab.ClassOf(t);
  697. IF SymTab.RelCheck(t, t2, op) THEN
  698. t := SymTab.BoolType()
  699. ELSE SemError(213); t := SymTab.InvalidType END;
  700. IF t # SymTab.InvalidType THEN
  701. r := tc = SymTab.ClReal;
  702. IF r THEN
  703. IF op = SymTab.OpEq THEN MGen.RealEq
  704. ELSIF (op = SymTab.OpNeq1)
  705. OR (op = SymTab.OpNeq2) THEN MGen.RealNe
  706. ELSIF op = SymTab.OpLt THEN MGen.RealLt
  707. ELSIF op = SymTab.OpLe THEN MGen.RealLe
  708. ELSIF op = SymTab.OpGt THEN MGen.RealGt
  709. ELSE MGen.RealGe END
  710. ELSE
  711. IF op = SymTab.OpEq THEN MGen.Eq
  712. ELSIF (op = SymTab.OpNeq1)
  713. OR (op = SymTab.OpNeq2) THEN MGen.Neq
  714. ELSIF op = SymTab.OpLt THEN MGen.ILt
  715. ELSIF op = SymTab.OpLe THEN MGen.ILe
  716. ELSIF op = SymTab.OpGt THEN MGen.IGt
  717. ELSE MGen.IGe END
  718. END
  719. ELSE MGen.Drop; MGen.Drop; MGen.PushInt(0)
  720. END
  721. END; .) ] .
  722. Rel <VAR op: INTEGER>
  723. = "=" (. op := SymTab.OpEq; .)
  724. | "#" (. op := SymTab.OpNeq1; .)
  725. | "<>" (. op := SymTab.OpNeq2; .)
  726. | "<" (. op := SymTab.OpLt; .)
  727. | "<=" (. op := SymTab.OpLe; .)
  728. | ">" (. op := SymTab.OpGt; .)
  729. | ">=" (. op := SymTab.OpGe; .)
  730. | "IN" (. op := SymTab.OpIn; .) .
  731. SimExpr <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr>
  732. (. VAR t2, res2: SymTab.TypeIndex;
  733. op: INTEGER;
  734. lx2: MGen.LitStr;
  735. neg, isR: BOOLEAN; .)
  736. = (. neg := FALSE; .)
  737. [ "+" | "-" (. neg := TRUE; .) ]
  738. Term<t, lx> (. IF neg THEN
  739. IF MGen.IsLit(lx) THEN
  740. MGen.NegFold(lx, lx)
  741. ELSE lx[0] := 0C
  742. END;
  743. IF SymTab.ClassOf(t)
  744. = SymTab.ClReal THEN
  745. MGen.NegReal
  746. ELSE MGen.NegInt
  747. END
  748. END; .)
  749. { AddOp<op> Term<t2, lx2>
  750. (. lx[0] := 0C;
  751. IF op = SymTab.OpOr THEN
  752. IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
  753. t := SymTab.BoolType()
  754. ELSE SemError(212); t := SymTab.InvalidType END;
  755. MGen.Or
  756. ELSE
  757. IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN t := res2
  758. ELSE SemError(211); t := SymTab.InvalidType END;
  759. isR := (t # SymTab.InvalidType)
  760. & (SymTab.ClassOf(t) = SymTab.ClReal);
  761. IF op = SymTab.OpAdd THEN
  762. IF isR THEN MGen.RealAdd ELSE MGen.Add END
  763. ELSE
  764. IF isR THEN MGen.RealSub ELSE MGen.Sub END
  765. END
  766. END; .) } .
  767. AddOp <VAR op: INTEGER>
  768. = "+" (. op := SymTab.OpAdd; .)
  769. | "-" (. op := SymTab.OpSub; .)
  770. | "OR" (. op := SymTab.OpOr; .) .
  771. Term <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr>
  772. (. VAR t2, res2: SymTab.TypeIndex;
  773. op: INTEGER;
  774. lx2: MGen.LitStr;
  775. isR: BOOLEAN;
  776. mt: INTEGER; .)
  777. = Fact<t, lx> { MulOp<op> Fact<t2, lx2>
  778. (. lx[0] := 0C;
  779. IF op = SymTab.OpAnd THEN
  780. IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
  781. t := SymTab.BoolType()
  782. ELSE SemError(212); t := SymTab.InvalidType END;
  783. MGen.And
  784. ELSE
  785. IF SymTab.ArithCheck(t, t2,
  786. (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
  787. res2) THEN t := res2
  788. ELSE SemError(211); t := SymTab.InvalidType END;
  789. isR := (t # SymTab.InvalidType)
  790. & (SymTab.ClassOf(t) = SymTab.ClReal);
  791. IF op = SymTab.OpTimes THEN
  792. IF isR THEN MGen.RealMul ELSE MGen.MulU END
  793. ELSIF op = SymTab.OpSlash THEN
  794. IF isR THEN MGen.RealDiv ELSE MGen.DivI END
  795. ELSIF op = SymTab.OpDiv THEN
  796. MGen.DivI
  797. ELSE
  798. mt := MGen.TempGlobal();
  799. MGen.ModI(mt)
  800. END
  801. END; .) } .
  802. MulOp <VAR op: INTEGER>
  803. = "*" (. op := SymTab.OpTimes; .)
  804. | "/" (. op := SymTab.OpSlash; .)
  805. | "DIV" (. op := SymTab.OpDiv; .)
  806. | "MOD" (. op := SymTab.OpMod; .)
  807. | "AND" (. op := SymTab.OpAnd; .)
  808. | "&" (. op := SymTab.OpAnd; .) .
  809. Fact <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr>
  810. (. VAR s: ARRAY [0 .. 255] OF CHAR;
  811. t2, et, dt, st: SymTab.TypeIndex;
  812. dk: INTEGER;
  813. bnF: SymTab.Name;
  814. lxD, lx2: MGen.LitStr;
  815. v: INTEGER;
  816. c: CARDINAL;
  817. b: LONGCARD; .)
  818. = integer (. LexString(s);
  819. MGen.CopyName(s, lx);
  820. IF MGen.ParseInt(s, v) THEN
  821. MGen.PushInt(v)
  822. ELSIF MGen.ParseCard(s, c) THEN
  823. MGen.PushBits(
  824. VAL(LONGCARD, c))
  825. ELSE MGen.PushInt(0)
  826. END;
  827. t := SymTab.IntType(); .)
  828. | real (. LexString(s);
  829. MGen.CopyName(s, lx);
  830. IF MGen.ParseReal(s, b) THEN
  831. MGen.PushBits(b)
  832. ELSE MGen.PushBits(0H)
  833. END;
  834. t := SymTab.RealType(); .)
  835. | string (. LexString(s);
  836. IF SymTab.StrLen(s) <= 3 THEN
  837. t := SymTab.CharType();
  838. MGen.CopyName(s, lx);
  839. MGen.PushInt(
  840. MGen.CharOrd(s))
  841. ELSE t := SymTab.NewStr();
  842. SemError(230);
  843. lx[0] := 0C;
  844. MGen.PushInt(0)
  845. END; .)
  846. | Design<dt, dk, bnF, TRUE, lxD> (. t := dt;
  847. MGen.CopyName(lxD, lx); .)
  848. | "("
  849. Expr<et, lx> ")" (. t := et; .)
  850. | ( "NOT" | "~" )
  851. Fact<t2, lx2> (. lx[0] := 0C;
  852. IF SymTab.BoolCheck(t2) THEN
  853. t := SymTab.BoolType()
  854. ELSE SemError(212);
  855. t := SymTab.InvalidType END;
  856. MGen.Not; .)
  857. | SetLit<st> (. lx[0] := 0C;
  858. t := st; .) .
  859. SetLit <VAR t: SymTab.TypeIndex>
  860. (. VAR first, et: SymTab.TypeIndex;
  861. lxE, lxE2: MGen.LitStr;
  862. hasR: BOOLEAN; .)
  863. = "{"
  864. (. MGen.PushInt(0);
  865. t := SymTab.SetFor(SymTab.IntType()); .)
  866. [ Elem<et, lxE, lxE2, hasR> (. first := et;
  867. t := SymTab.SetFor(et);
  868. IF hasR THEN MGen.FieldMask
  869. ELSE MGen.Power2 END;
  870. MGen.Or; .)
  871. { ","
  872. Elem<et, lxE, lxE2, hasR> (. IF ~SymTab.SetElemCheck(first, et) THEN
  873. SemError(222) END;
  874. IF hasR THEN MGen.FieldMask
  875. ELSE MGen.Power2 END;
  876. MGen.Or; .) } ]
  877. "}" .
  878. Elem <VAR t: SymTab.TypeIndex; VAR lx: MGen.LitStr;
  879. VAR lx2: MGen.LitStr; VAR hasR: BOOLEAN>
  880. (. VAR t2: SymTab.TypeIndex; .)
  881. = Expr<t, lx> (. hasR := FALSE;
  882. lx2[0] := 0C; .)
  883. [ ".."
  884. Expr<t2, lx2> (. IF ~SymTab.SetElemCheck(t, t2) THEN
  885. SemError(222) END;
  886. hasR := TRUE; .) ] .
  887. GetIdent <VAR n: SymTab.Name>
  888. = ident (. LexName(n); .) .
  889. END M2c.