|
|
@@ -59,1331 +59,1464 @@ Listing:
|
|
|
42 descriptors (locked amendment — one layout per type); nested
|
|
|
43 records inline; static declaration-order offsets; field chains
|
|
|
44 mix with indexes; WITH pushes fields + bases (215/216);
|
|
|
- 45 whole-record deep copy; record/set/class "=" is 213. *)
|
|
|
- 46
|
|
|
- 47 IMPORT SymTab, QbeGen;
|
|
|
- 48
|
|
|
- 49 CHARACTERS
|
|
|
- 50 eol = CHR(13) .
|
|
|
- 51 lf = CHR(10) .
|
|
|
- 52 letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .
|
|
|
- 53 digit = "0123456789" .
|
|
|
- 54 hexDigit = digit + "ABCDEFabcdef" .
|
|
|
- 55 noQuote1 = ANY - "'" - eol .
|
|
|
- 56 noQuote2 = ANY - '"' - eol .
|
|
|
- 57
|
|
|
- 58 IGNORE CHR(9) .. CHR(13)
|
|
|
- 59
|
|
|
- 60 COMMENTS FROM "(*" TO "*)" NESTED
|
|
|
- 61 COMMENTS FROM "//" TO lf
|
|
|
- 62
|
|
|
- 63 TOKENS
|
|
|
- 64 ident = letter { letter | digit } .
|
|
|
- 65 integer = digit { digit }
|
|
|
- 66 | digit { digit } CONTEXT("..")
|
|
|
- 67 | "0x" hexDigit { hexDigit }
|
|
|
- 68 | "0X" hexDigit { hexDigit } .
|
|
|
- 69 real = digit { digit } "." { digit }
|
|
|
- 70 [ ( "E" | "e" ) [ "+" | "-" ] digit { digit } ] .
|
|
|
- 71 string = "'" { noQuote1 } "'"
|
|
|
- 72 | '"' { noQuote2 } '"' .
|
|
|
- 73
|
|
|
- 74 PRODUCTIONS
|
|
|
- 75 M2
|
|
|
- 76 = Unit "." .
|
|
|
- 77 (* Units: program modules compile fully; DEFINITION and
|
|
|
- 78 IMPLEMENTATION modules parse + check now but lower in step 4
|
|
|
- 79 (each ends with one 230); same for nested local modules. *)
|
|
|
- 80 Unit
|
|
|
- 81 = DefUnit
|
|
|
- 82 | ImplUnit
|
|
|
- 83 | ProgModule .
|
|
|
- 84 DefUnit (. VAR m1, m2, pn: SymTab.Name; .)
|
|
|
- 85 = "DEFINITION" "MODULE"
|
|
|
- 86 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
- 87 IF ~SymTab.Enter(m1,
|
|
|
- 88 SymTab.KindModule) THEN
|
|
|
- 89 SemError(200) END; .)
|
|
|
- 90 ";"
|
|
|
- 91 { Import }
|
|
|
- 92 { ConstBlock | TypeBlock<TRUE> | VarBlock
|
|
|
- 93 | ProcHeading<pn> ";" (. SymTab.CloseProc; .) }
|
|
|
- 94 "END"
|
|
|
- 95 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
- 96 SemError(202) END; .)
|
|
|
- 97 (. QbeGen.CloseModule;
|
|
|
- 98 SemError(230);
|
|
|
- 99 SymTab.PrintTable; .) .
|
|
|
- 100 ImplUnit (. VAR m1, m2: SymTab.Name; .)
|
|
|
- 101 = "IMPLEMENTATION" "MODULE"
|
|
|
- 102 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
- 103 IF ~SymTab.Enter(m1,
|
|
|
- 104 SymTab.KindModule) THEN
|
|
|
- 105 SemError(200) END; .)
|
|
|
- 106 ";"
|
|
|
- 107 { Import }
|
|
|
- 108 DeclSeq
|
|
|
- 109 [ "BEGIN" (. QbeGen.BeginBody; .)
|
|
|
- 110 [ StatSeq ] ]
|
|
|
- 111 "END"
|
|
|
- 112 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
- 113 SemError(202) END; .)
|
|
|
- 114 (. QbeGen.CloseModule;
|
|
|
- 115 SemError(230);
|
|
|
- 116 SymTab.PrintTable; .) .
|
|
|
- 117 ProgModule (. VAR m1, m2: SymTab.Name; .)
|
|
|
- 118 = "MODULE"
|
|
|
- 119 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
- 120 IF ~SymTab.Enter(m1,
|
|
|
- 121 SymTab.KindModule) THEN
|
|
|
- 122 SemError(200) END; .)
|
|
|
- 123 [ Priority ]
|
|
|
- 124 ";"
|
|
|
- 125 { Import }
|
|
|
- 126 DeclSeq
|
|
|
- 127 [ "BEGIN" (. QbeGen.BeginBody; .)
|
|
|
- 128 [ StatSeq ] ]
|
|
|
- 129 "END"
|
|
|
- 130 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
- 131 SemError(202) END; .)
|
|
|
- 132 (. QbeGen.EndModule;
|
|
|
- 133 SymTab.PrintTable; .) .
|
|
|
- 134 DeclSeq
|
|
|
- 135 = { ConstBlock | TypeBlock<FALSE> | VarBlock | ProcDecl ";"
|
|
|
- 136 | NestedModule ";" | ClassItem ";" } .
|
|
|
- 137 (* Local module, Wirth form. Parses + checks fully (own scope);
|
|
|
- 138 lowering waits for step 4, marked by one 230 at END. *)
|
|
|
- 139 NestedModule (. VAR m1, m2: SymTab.Name; .)
|
|
|
- 140 = "MODULE"
|
|
|
- 141 GetIdent<m1> (. IF ~SymTab.Enter(m1,
|
|
|
- 142 SymTab.KindModule) THEN
|
|
|
- 143 SemError(200) END;
|
|
|
- 144 SymTab.PushScope; .)
|
|
|
- 145 [ Priority ]
|
|
|
- 146 ";"
|
|
|
- 147 { Import }
|
|
|
- 148 [ Export ]
|
|
|
- 149 DeclSeq
|
|
|
- 150 [ "BEGIN"
|
|
|
- 151 [ StatSeq ] ]
|
|
|
- 152 "END"
|
|
|
- 153 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
- 154 SemError(202) END;
|
|
|
- 155 SymTab.PopScope;
|
|
|
- 156 SemError(230); .) .
|
|
|
- 157 Priority
|
|
|
- 158 = "[" integer "]" (. SemError(230); .) .
|
|
|
- 159 Export (. VAR nm: SymTab.Name; .)
|
|
|
- 160 = "EXPORT" (* names wire up in step 4 *)
|
|
|
- 161 [ "QUALIFIED" ]
|
|
|
- 162 GetIdent<nm>
|
|
|
- 163 { "," GetIdent<nm> }
|
|
|
- 164 ";" .
|
|
|
- 165 Import (. VAR n: SymTab.Name; .)
|
|
|
- 166 = "FROM"
|
|
|
- 167 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 168 SymTab.KindImport) THEN
|
|
|
- 169 SemError(200) END; .)
|
|
|
- 170 "IMPORT"
|
|
|
- 171 ImpList ";"
|
|
|
- 172 | "IMPORT"
|
|
|
- 173 ImpList ";" .
|
|
|
- 174 ImpList (. VAR n: SymTab.Name; .)
|
|
|
- 175 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 176 SymTab.KindImport) THEN
|
|
|
- 177 SemError(200) END; .)
|
|
|
- 178 { ","
|
|
|
- 179 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 180 SymTab.KindImport) THEN
|
|
|
- 181 SemError(200) END; .) } .
|
|
|
- 182 (* Opaque TYPE declarations (definition modules). The targetless
|
|
|
- 183 alias resolves to InvalidType until step 4 completes it. *)
|
|
|
- 184 (* Scalar-phase TYPEs: named types, integer subranges, enumerations.
|
|
|
- 185 Opaque "TYPE T;" needs isDef (definition units); elsewhere 231.
|
|
|
- 186 Composite forms (ARRAY/RECORD/SET/POINTER) arrive with step 3. *)
|
|
|
- 187 TypeBlock<isDef: BOOLEAN>
|
|
|
- 188 = "TYPE" { TypeItem<isDef> ";" | ClassItem ";" } .
|
|
|
- 189 TypeItem<isDef: BOOLEAN> (. VAR n: SymTab.Name;
|
|
|
- 190 t: SymTab.TypeIndex; .)
|
|
|
- 191 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 192 SymTab.KindType) THEN
|
|
|
- 193 SemError(200) END; .)
|
|
|
- 194 ( "=" Type<t, FALSE> (. SymTab.SetSymType(n, t); .)
|
|
|
- 195 | (. IF ~isDef THEN
|
|
|
- 196 SemError(231) END;
|
|
|
- 197 SymTab.SetSymType(n,
|
|
|
- 198 SymTab.NewAlias()); .) ) .
|
|
|
- 199 Type<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
- 200 = TypeIdent<t>
|
|
|
- 201 | Subrange<t>
|
|
|
- 202 | Enum<t>
|
|
|
- 203 | ArrayType<t, allowOpen>
|
|
|
- 204 | SetType<t>
|
|
|
- 205 | RecordType<t> .
|
|
|
- 206 (* Arrays: "OF" without bounds is an open formal (allowed only
|
|
|
- 207 where allowOpen); "[lo..hi, ...]" nests bounded levels inside
|
|
|
- 208 out. Bounds are folded literals (int/char); anything else 230.
|
|
|
- 209 Bare-type indices ("ARRAY Color OF") wait for enum ordinals. *)
|
|
|
- 210 ArrayType<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
- 211 (. VAR elem: SymTab.TypeIndex;
|
|
|
- 212 ok: BOOLEAN; .)
|
|
|
- 213 = "ARRAY"
|
|
|
- 214 ( "OF" Type<elem, FALSE> (. IF ~allowOpen THEN
|
|
|
- 215 SemError(230) END;
|
|
|
- 216 t := SymTab.NewOpenArray(elem); .)
|
|
|
- 217 | "[" (. SymTab.BoundBegin; ok := TRUE; .)
|
|
|
- 218 BoundPair<ok>
|
|
|
- 219 { "," BoundPair<ok> }
|
|
|
- 220 "]" "OF" Type<elem, FALSE>
|
|
|
- 221 (. IF ok THEN
|
|
|
- 222 t := SymTab.NestArray(elem)
|
|
|
- 223 ELSE t := SymTab.InvalidType
|
|
|
- 224 END; .) ) .
|
|
|
- 225 BoundPair<VAR ok: BOOLEAN> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
- 226 qlo, qhi: QbeGen.QVal;
|
|
|
- 227 lo, hi: INTEGER;
|
|
|
- 228 cl, cl2: INTEGER; .)
|
|
|
- 229 = Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
- 230 (. IF (tlo = SymTab.InvalidType)
|
|
|
- 231 OR (thi = SymTab.InvalidType) THEN
|
|
|
- 232 ok := FALSE
|
|
|
- 233 ELSE cl := SymTab.ClassOf(tlo);
|
|
|
- 234 cl2 := SymTab.ClassOf(thi);
|
|
|
- 235 IF ((cl # SymTab.ClInt)
|
|
|
- 236 & (cl # SymTab.ClChar))
|
|
|
- 237 OR ((cl2 # SymTab.ClInt)
|
|
|
- 238 & (cl2 # SymTab.ClChar)) THEN
|
|
|
- 239 SemError(230); ok := FALSE
|
|
|
- 240 ELSIF ~SymTab.ConstInt(qlo, lo)
|
|
|
- 241 OR ~SymTab.ConstInt(qhi, hi)
|
|
|
- 242 OR (lo > hi) THEN
|
|
|
- 243 SemError(230); ok := FALSE
|
|
|
- 244 ELSIF ~SymTab.BoundAdd(lo, hi) THEN
|
|
|
- 245 SemError(230); ok := FALSE
|
|
|
- 246 END; .) .
|
|
|
- 247 (* Sets: multi-word masks over bases ≤ 256 values (bool, char,
|
|
|
- 248 bounded subranges; enums wait for ordinals, INTEGER is
|
|
|
- 249 unbounded). Literals are SET OF [0..255]; assignment and
|
|
|
- 250 comparison across suitable bases are lenient (masks over min
|
|
|
- 251 words + zero-check extras), out-of-span literals are 222. *)
|
|
|
- 252 SetType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex;
|
|
|
- 253 blo, bhi, bspan: INTEGER;
|
|
|
- 254 bcls: INTEGER; .)
|
|
|
- 255 = "SET" "OF" Type<base, FALSE>
|
|
|
- 256 (. IF base = SymTab.InvalidType THEN
|
|
|
- 257 t := SymTab.InvalidType
|
|
|
- 258 ELSE bcls :=
|
|
|
- 259 SymTab.ClassOf(base);
|
|
|
- 260 IF bcls = SymTab.ClBool THEN
|
|
|
- 261 blo := 0; bspan := 2
|
|
|
- 262 ELSIF bcls = SymTab.ClChar THEN
|
|
|
- 263 blo := 0; bspan := 256
|
|
|
- 264 ELSIF SymTab.SubBounds(base,
|
|
|
- 265 blo, bhi) THEN
|
|
|
- 266 bspan := bhi - blo + 1
|
|
|
- 267 ELSE bspan := 0 END;
|
|
|
- 268 IF (bspan <= 0)
|
|
|
- 269 OR (bspan > 256) THEN
|
|
|
- 270 SemError(230);
|
|
|
- 271 t := SymTab.InvalidType
|
|
|
- 272 ELSE t := SymTab.NewSet(base)
|
|
|
- 273 END
|
|
|
- 274 END; .) .
|
|
|
- 275 (* Records: flat blobs; array fields are pointers to static
|
|
|
- 276 descriptors (locked amendment), nested records inline. Field
|
|
|
- 277 offsets static and declaration-ordered. *)
|
|
|
- 278 RecordType<VAR t: SymTab.TypeIndex> (. VAR t2: SymTab.TypeIndex; .)
|
|
|
- 279 = "RECORD" (. t := SymTab.NewRecord(); .)
|
|
|
- 280 [ RecField<t> { ";" RecField<t> } ]
|
|
|
- 281 "END" .
|
|
|
- 282 RecField<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
- 283 t2: SymTab.TypeIndex; .)
|
|
|
- 284 = RecIdents<rec> ":" Type<t2, FALSE>(. SymTab.FixPendingF(rec, t2); .) .
|
|
|
- 285 RecIdents<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
- 286 = GetIdent<n> (. IF ~SymTab.FieldPending(rec,
|
|
|
- 287 n) THEN
|
|
|
- 288 SemError(200) END; .)
|
|
|
- 289 { "," GetIdent<n> (. IF ~SymTab.FieldPending(rec,
|
|
|
- 290 n) THEN
|
|
|
- 291 SemError(200) END; .) } .
|
|
|
- 292 TypeIdent<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
- 293 k: INTEGER; .)
|
|
|
- 294 = GetIdent<n> (. IF ~SymTab.Lookup(n) THEN
|
|
|
- 295 SemError(201);
|
|
|
- 296 t := SymTab.InvalidType
|
|
|
- 297 ELSE k := SymTab.SymKind(n);
|
|
|
- 298 IF (k = SymTab.KindType)
|
|
|
- 299 OR (k = SymTab.KindPredef) THEN
|
|
|
- 300 t := SymTab.SymType(n)
|
|
|
- 301 ELSIF k = SymTab.KindImport THEN
|
|
|
- 302 t := SymTab.InvalidType
|
|
|
- 303 ELSE SemError(221);
|
|
|
- 304 t := SymTab.InvalidType
|
|
|
- 305 END
|
|
|
- 306 END; .) .
|
|
|
- 307 Subrange<VAR t: SymTab.TypeIndex> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
- 308 qlo, qhi: QbeGen.QVal;
|
|
|
- 309 lo, hi: INTEGER; .)
|
|
|
- 310 = "[" Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
- 311 (. IF (tlo = SymTab.InvalidType)
|
|
|
- 312 OR (thi = SymTab.InvalidType) THEN
|
|
|
- 313 t := SymTab.InvalidType
|
|
|
- 314 ELSIF (SymTab.ClassOf(tlo) #
|
|
|
- 315 SymTab.ClInt)
|
|
|
- 316 OR (SymTab.ClassOf(thi) #
|
|
|
- 317 SymTab.ClInt) THEN
|
|
|
- 318 SemError(230);
|
|
|
- 319 t := SymTab.InvalidType
|
|
|
- 320 ELSIF ~SymTab.ConstInt(qlo, lo)
|
|
|
- 321 OR ~SymTab.ConstInt(qhi, hi)
|
|
|
- 322 OR (lo > hi) THEN
|
|
|
- 323 SemError(230);
|
|
|
- 324 t := SymTab.InvalidType
|
|
|
- 325 ELSE t := SymTab.NewSubR(lo, hi)
|
|
|
- 326 END; .)
|
|
|
- 327 "]" .
|
|
|
- 328 Enum<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
- 329 = "(" (. t := SymTab.NewEnum(); .)
|
|
|
- 330 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 331 SymTab.KindConst) THEN
|
|
|
- 332 SemError(200) END;
|
|
|
- 333 SymTab.SetSymType(n, t); .)
|
|
|
- 334 { "," GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 335 SymTab.KindConst) THEN
|
|
|
- 336 SemError(200) END;
|
|
|
- 337 SymTab.SetSymType(n, t); .) }
|
|
|
- 338 ")" .
|
|
|
- 339 (* Clarion-form classes (docs/OOP.txt): declaration + single
|
|
|
- 340 inheritance + IMPLEMENTATION blocks. Scopes and member checks
|
|
|
- 341 now; lowering (vtable, dispatch, THIS) later — one 230 per
|
|
|
- 342 class/impl block. Methods end with ";" per the Table example
|
|
|
- 343 (not "," as in the sketch). No underscores in identifiers. *)
|
|
|
- 344 (* Single CLASS item in both loops: separating declaration from
|
|
|
- 345 IMPLEMENTATION at the loop level needs 2-token lookahead
|
|
|
- 346 (CLASS ident vs CLASS IMPLEMENTATION), which LL(1) cannot do.
|
|
|
- 347 The second token decides after CLASS is consumed. A misplaced
|
|
|
- 348 CLASS IMPLEMENTATION inside TYPE still parses (harmless: the
|
|
|
- 349 whole unit ends 230 until lowering). *)
|
|
|
- 350 ClassItem
|
|
|
- 351 = "CLASS" ( "IMPLEMENTATION" ClassImplRest | ClassRest ) .
|
|
|
- 352 ClassRest (. VAR cn, m2, pn: SymTab.Name;
|
|
|
- 353 ct: SymTab.TypeIndex; .)
|
|
|
- 354 = GetIdent<cn> (. IF ~SymTab.Enter(cn,
|
|
|
- 355 SymTab.KindType) THEN
|
|
|
- 356 SemError(200) END;
|
|
|
- 357 ct := SymTab.NewClass();
|
|
|
- 358 SymTab.SetSymType(cn, ct);
|
|
|
- 359 SymTab.PushClassScope(ct); .)
|
|
|
- 360 [ Parents<ct> ]
|
|
|
- 361 ";"
|
|
|
- 362 { ClassField<ct> ";" }
|
|
|
- 363 { MethodHeading<pn> ";" (. SymTab.CloseProc; .) }
|
|
|
- 364 "END"
|
|
|
- 365 GetIdent<m2> (. IF ~SymTab.Equal(cn, m2) THEN
|
|
|
- 366 SemError(202) END;
|
|
|
- 367 SymTab.PopScope;
|
|
|
- 368 SemError(230); .) .
|
|
|
- 369 Parents<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name; .)
|
|
|
- 370 = "(" Parent1<ct>
|
|
|
- 371 { "," GetIdent<p> (. SemError(230); .) }
|
|
|
- 372 ")" .
|
|
|
- 373 Parent1<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name;
|
|
|
- 374 pt: SymTab.TypeIndex; .)
|
|
|
- 375 = GetIdent<p> (. IF ~SymTab.Lookup(p) THEN
|
|
|
- 376 SemError(201)
|
|
|
- 377 ELSE pt := SymTab.SymType(p);
|
|
|
- 378 IF SymTab.ClassOf(pt) #
|
|
|
- 379 SymTab.ClClass THEN
|
|
|
- 380 SemError(230)
|
|
|
- 381 ELSE SymTab.SetParent(ct, pt)
|
|
|
- 382 END
|
|
|
- 383 END; .) .
|
|
|
- 384 ClassField<ct: SymTab.TypeIndex> (. VAR n, rhs: SymTab.Name;
|
|
|
- 385 t: SymTab.TypeIndex; .)
|
|
|
- 386 = GetIdent<n>
|
|
|
- 387 ( "=" GetIdent<rhs> (. IF ~SymTab.Enter(n,
|
|
|
- 388 SymTab.KindConst) THEN
|
|
|
- 389 SemError(200) END;
|
|
|
- 390 IF SymTab.Lookup(rhs) THEN
|
|
|
- 391 SymTab.SetSymType(n,
|
|
|
- 392 SymTab.SymType(rhs))
|
|
|
- 393 END; .)
|
|
|
- 394 | (. IF ~SymTab.FieldPending(ct,
|
|
|
- 395 n) THEN
|
|
|
- 396 SemError(200) END; .)
|
|
|
- 397 { "," GetIdent<n> (. IF ~SymTab.FieldPending(ct,
|
|
|
- 398 n) THEN
|
|
|
- 399 SemError(200) END; .) }
|
|
|
- 400 ":" Type<t, FALSE> (. SymTab.FixPendingF(ct, t); .) ) .
|
|
|
- 401 MethodHeading<VAR pn: SymTab.Name> (. VAR wantVirt: BOOLEAN; .)
|
|
|
- 402 = (. wantVirt := FALSE; .)
|
|
|
- 403 [ "VIRTUAL" (. wantVirt := TRUE; .) ]
|
|
|
- 404 ProcHeading<pn> (. IF wantVirt THEN
|
|
|
- 405 SymTab.MarkVirtual END; .) .
|
|
|
- 406 ClassImplRest (. VAR cn, m2: SymTab.Name;
|
|
|
- 407 ct: SymTab.TypeIndex; .)
|
|
|
- 408 = GetIdent<cn> (. IF ~SymTab.Lookup(cn) THEN
|
|
|
- 409 SemError(201);
|
|
|
- 410 ct := SymTab.InvalidType
|
|
|
- 411 ELSE ct := SymTab.SymType(cn);
|
|
|
- 412 IF SymTab.ClassOf(ct) #
|
|
|
- 413 SymTab.ClClass THEN
|
|
|
- 414 SemError(230);
|
|
|
- 415 ct := SymTab.InvalidType
|
|
|
- 416 END
|
|
|
- 417 END;
|
|
|
- 418 IF ct #
|
|
|
- 419 SymTab.InvalidType THEN
|
|
|
- 420 IF ~SymTab.PushClassMembers(
|
|
|
- 421 ct) THEN
|
|
|
- 422 SemError(230) END
|
|
|
- 423 END; .)
|
|
|
- 424 ";" { MethodImpl<ct> ";" }
|
|
|
- 425 [ "BEGIN"
|
|
|
- 426 [ StatSeq ] ]
|
|
|
- 427 "END"
|
|
|
- 428 GetIdent<m2> (. IF ~SymTab.Equal(cn, m2) THEN
|
|
|
- 429 SemError(202) END;
|
|
|
- 430 SymTab.PopScope;
|
|
|
- 431 SemError(230); .) .
|
|
|
- 432 MethodImpl<ct: SymTab.TypeIndex> (. VAR pn: SymTab.Name; .)
|
|
|
- 433 = MethodHeading<pn> ";"
|
|
|
- 434 (. IF (ct #
|
|
|
- 435 SymTab.InvalidType)
|
|
|
- 436 & ~SymTab.MethodExists(ct,
|
|
|
- 437 pn) THEN
|
|
|
- 438 SemError(201) END; .)
|
|
|
- 439 ( "FORWARD" (. SymTab.MarkFwd;
|
|
|
- 440 SymTab.CloseProc; .)
|
|
|
- 441 | Block<pn> (. SymTab.CloseProc;
|
|
|
- 442 SemError(230); .) ) .
|
|
|
- 443 ConstBlock
|
|
|
- 444 = "CONST" { ConstDecl ";" } .
|
|
|
- 445 ConstDecl (. VAR n: SymTab.Name;
|
|
|
- 446 t: SymTab.TypeIndex;
|
|
|
- 447 qv: QbeGen.QVal;
|
|
|
- 448 cls: INTEGER; .)
|
|
|
- 449 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
- 450 SymTab.KindConst) THEN
|
|
|
- 451 SemError(200) END; .)
|
|
|
- 452 "="
|
|
|
- 453 Expr<t, qv> (. SymTab.SetSymType(n, t);
|
|
|
- 454 cls := SymTab.ClassOf(t);
|
|
|
- 455 IF cls = SymTab.ClStr THEN
|
|
|
- 456 SemError(230)
|
|
|
- 457 ELSIF ~QbeGen.IsImm(qv) THEN
|
|
|
- 458 SemError(230) END;
|
|
|
- 459 QbeGen.DeclConst(n, qv, t); .) .
|
|
|
- 460 VarBlock
|
|
|
- 461 = "VAR" { VarDecl ";" } .
|
|
|
- 462 VarDecl (. VAR nm: SymTab.Name;
|
|
|
- 463 t: SymTab.TypeIndex;
|
|
|
- 464 i: CARDINAL;
|
|
|
- 465 cls: INTEGER; .)
|
|
|
- 466 = VarIdents ":"
|
|
|
- 467 Type<t, FALSE> (. cls := SymTab.ClassOf(t);
|
|
|
- 468 IF (t # SymTab.InvalidType)
|
|
|
- 469 & (cls # SymTab.ClInt)
|
|
|
- 470 & (cls # SymTab.ClBool)
|
|
|
- 471 & (cls # SymTab.ClChar)
|
|
|
- 472 & (cls # SymTab.ClReal)
|
|
|
- 473 & (cls # SymTab.ClArray)
|
|
|
- 474 & (cls # SymTab.ClSet)
|
|
|
- 475 & (cls # SymTab.ClRecord) THEN
|
|
|
- 476 SemError(230) END;
|
|
|
- 477 i := 0;
|
|
|
- 478 WHILE i < SymTab.PendCount() DO
|
|
|
- 479 SymTab.PendName(i, nm);
|
|
|
- 480 QbeGen.DeclVar(nm, t);
|
|
|
- 481 INC(i)
|
|
|
- 482 END;
|
|
|
- 483 SymTab.FixPending(t); .) .
|
|
|
- 484 VarIdents (. VAR n: SymTab.Name; .)
|
|
|
- 485 = GetIdent<n> (. IF ~SymTab.EnterPending(n,
|
|
|
- 486 SymTab.KindVar) THEN
|
|
|
- 487 SemError(200) END; .)
|
|
|
- 488 { ","
|
|
|
- 489 GetIdent<n> (. IF ~SymTab.EnterPending(n,
|
|
|
- 490 SymTab.KindVar) THEN
|
|
|
- 491 SemError(200) END; .) } .
|
|
|
- 492 ParIdents<isV: BOOLEAN> (. VAR n: SymTab.Name; .)
|
|
|
- 493 = GetIdent<n> (. IF ~SymTab.EnterParam(n, isV) THEN
|
|
|
- 494 SemError(200) END; .)
|
|
|
- 495 { "," GetIdent<n> (. IF ~SymTab.EnterParam(n, isV) THEN
|
|
|
- 496 SemError(200) END; .) } .
|
|
|
- 497 (* Procedure headings enter now (scopes, params, result); bodies
|
|
|
- 498 parse + check with one 230 at END (lowering = step 4).
|
|
|
- 499 FORWARD marks; the body heading re-enters (signature compare
|
|
|
- 500 tightens in step 4). *)
|
|
|
- 501 ProcHeading<VAR pn: SymTab.Name> (. VAR t: SymTab.TypeIndex; .)
|
|
|
- 502 = "PROCEDURE"
|
|
|
- 503 GetIdent<pn> (. IF ~SymTab.EnterProc(pn) THEN
|
|
|
- 504 IF ~SymTab.ReenterProc(pn) THEN
|
|
|
- 505 SemError(200) END
|
|
|
- 506 END; .)
|
|
|
- 507 [ FormalParams ]
|
|
|
- 508 [ ":" TypeIdent<t> (. SymTab.SetProcRes(t);
|
|
|
- 509 IF (t #
|
|
|
- 510 SymTab.InvalidType)
|
|
|
- 511 & (SymTab.ClassOf(t)
|
|
|
- 512 = SymTab.ClArray) THEN
|
|
|
- 513 SemError(230) END; .) ] .
|
|
|
- 514 FormalParams
|
|
|
- 515 = "(" [ ParamSection { ";" ParamSection } ] ")" .
|
|
|
- 516 ParamSection (. VAR t: SymTab.TypeIndex;
|
|
|
- 517 isV: BOOLEAN; .)
|
|
|
- 518 = (. isV := FALSE; .)
|
|
|
- 519 [ "VAR" (. isV := TRUE; .) ]
|
|
|
- 520 ParIdents<isV> ":" Type<t, TRUE> (. SymTab.FixPending(t); .) .
|
|
|
- 521 ProcDecl (. VAR pn, m2: SymTab.Name; .)
|
|
|
- 522 = ProcHeading<pn> ";"
|
|
|
- 523 ( "FORWARD" (. SymTab.MarkFwd;
|
|
|
- 524 SymTab.CloseProc; .)
|
|
|
- 525 | Block<pn> (. SymTab.CloseProc;
|
|
|
- 526 SemError(230); .) ) .
|
|
|
- 527 Block<pn: SymTab.Name> (. VAR m2: SymTab.Name; .)
|
|
|
- 528 = DeclSeq
|
|
|
- 529 [ "BEGIN"
|
|
|
- 530 [ StatSeq ] ]
|
|
|
- 531 "END"
|
|
|
- 532 GetIdent<m2> (. IF ~SymTab.Equal(pn, m2) THEN
|
|
|
- 533 SemError(202) END; .) .
|
|
|
- 534 StatSeq
|
|
|
- 535 = Statement { ";" Statement } .
|
|
|
- 536 Statement (. VAR lx: QbeGen.QVal; .)
|
|
|
- 537 = Assign
|
|
|
- 538 | IfStat
|
|
|
- 539 | WhileStat
|
|
|
- 540 | RepeatStat
|
|
|
- 541 | LoopStat
|
|
|
- 542 | ForStat
|
|
|
- 543 | CaseStat
|
|
|
- 544 | WithStat
|
|
|
- 545 | ReturnStat
|
|
|
- 546 | "EXIT" (. IF QbeGen.TopLoop(lx) THEN
|
|
|
- 547 QbeGen.Jmp(lx)
|
|
|
- 548 ELSE SemError(230) END; .) .
|
|
|
- 549 (* WITH pushes each record's fields (inner wins) plus its base
|
|
|
- 550 address; field designators resolve through both stacks. *)
|
|
|
- 551 WithStat (. VAR nW: CARDINAL; .)
|
|
|
- 552 = "WITH" (. nW := 0; .)
|
|
|
- 553 WithItem<nW> { "," WithItem<nW> }
|
|
|
- 554 "DO" StatSeq "END"
|
|
|
- 555 (. WHILE nW > 0 DO
|
|
|
- 556 SymTab.PopScope;
|
|
|
- 557 QbeGen.PopWith;
|
|
|
- 558 DEC(nW)
|
|
|
- 559 END; .) .
|
|
|
- 560 WithItem<VAR nW: CARDINAL> (. VAR dt: SymTab.TypeIndex;
|
|
|
- 561 dk: INTEGER;
|
|
|
- 562 qd, qe: QbeGen.QVal;
|
|
|
- 563 qn: SymTab.Name;
|
|
|
- 564 sfx: BOOLEAN; .)
|
|
|
- 565 = Design<dt, dk, qd, qn, sfx>
|
|
|
- 566 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 567 ELSIF (SymTab.ClassOf(dt) #
|
|
|
- 568 SymTab.ClRecord)
|
|
|
- 569 & (SymTab.ClassOf(dt) #
|
|
|
- 570 SymTab.ClClass) THEN
|
|
|
- 571 SemError(215)
|
|
|
- 572 ELSIF SymTab.PushRecord(dt) THEN
|
|
|
- 573 QbeGen.PushWith(qd);
|
|
|
- 574 INC(nW)
|
|
|
- 575 END; .) .
|
|
|
- 576 Assign (. VAR dt, et: SymTab.TypeIndex;
|
|
|
- 577 dk: INTEGER;
|
|
|
- 578 qd, qe, qt: QbeGen.QVal;
|
|
|
- 579 qn: SymTab.Name;
|
|
|
- 580 isR, conv: BOOLEAN;
|
|
|
- 581 sfx: BOOLEAN; .)
|
|
|
- 582 = Design<dt, dk, qd, qn, sfx> ":="
|
|
|
- 583 Expr<et, qe> (. IF (dt # SymTab.InvalidType)
|
|
|
- 584 & (dk # SymTab.KindVar)
|
|
|
- 585 & (dk # SymTab.KindParam)
|
|
|
- 586 & (dk # SymTab.KindField) THEN
|
|
|
- 587 SemError(210)
|
|
|
- 588 ELSIF ~SymTab.Assignable(et,
|
|
|
- 589 dt) THEN
|
|
|
- 590 SemError(210)
|
|
|
- 591 ELSIF (dt # SymTab.InvalidType)
|
|
|
- 592 & (SymTab.ClassOf(dt) =
|
|
|
- 593 SymTab.ClClass) THEN
|
|
|
- 594 SemError(230) END;
|
|
|
- 595 isR := (dt #
|
|
|
- 596 SymTab.InvalidType)
|
|
|
- 597 & (SymTab.ClassOf(dt)
|
|
|
- 598 = SymTab.ClReal);
|
|
|
- 599 conv := isR
|
|
|
- 600 & SymTab.IsIntFamily(et);
|
|
|
- 601 IF ((dk = SymTab.KindVar)
|
|
|
- 602 OR (dk = SymTab.KindParam)
|
|
|
- 603 OR (dk = SymTab.KindField))
|
|
|
- 604 & (dt # SymTab.InvalidType)
|
|
|
- 605 & (et # SymTab.InvalidType)
|
|
|
- 606 & (SymTab.ClassOf(dt) #
|
|
|
- 607 SymTab.ClClass) THEN
|
|
|
- 608 IF sfx
|
|
|
- 609 OR (dk = SymTab.KindField) THEN
|
|
|
- 610 IF SymTab.ClassOf(dt) =
|
|
|
- 611 SymTab.ClArray THEN
|
|
|
- 612 QbeGen.CopyArray(qd, qe,
|
|
|
- 613 dt)
|
|
|
- 614 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 615 SymTab.ClSet THEN
|
|
|
- 616 QbeGen.CopySet(qd, qe,
|
|
|
- 617 SymTab.SetWords(dt),
|
|
|
- 618 SymTab.SetWords(et))
|
|
|
- 619 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 620 SymTab.ClRecord THEN
|
|
|
- 621 QbeGen.CopyRecord(qd, qe,
|
|
|
+ 45 whole-record deep copy; record/set/class "=" is 213.
|
|
|
+ 46 Step 3.6 pointers: vars (l), NIL as a real type (FNil — assignment
|
|
|
+ 47 and =/# work, everything else 210-214/222), ^ deref with sfx
|
|
|
+ 48 discipline (address flows, load at use; chains compose),
|
|
|
+ 49 pointer =/# via ceql/cnel (< > etc. are 213), NEW/DISPOSE as
|
|
|
+ 50 builtin statements via extern malloc/free (recursive skeleton
|
|
|
+ 51 init; DISPOSE shallow and nils, deviating from Wirth-undefined);
|
|
|
+ 52 nil-deref is raw (no check). *)
|
|
|
+ 53
|
|
|
+ 54 IMPORT SymTab, QbeGen;
|
|
|
+ 55
|
|
|
+ 56 CHARACTERS
|
|
|
+ 57 eol = CHR(13) .
|
|
|
+ 58 lf = CHR(10) .
|
|
|
+ 59 letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .
|
|
|
+ 60 digit = "0123456789" .
|
|
|
+ 61 hexDigit = digit + "ABCDEFabcdef" .
|
|
|
+ 62 noQuote1 = ANY - "'" - eol .
|
|
|
+ 63 noQuote2 = ANY - '"' - eol .
|
|
|
+ 64
|
|
|
+ 65 IGNORE CHR(9) .. CHR(13)
|
|
|
+ 66
|
|
|
+ 67 COMMENTS FROM "(*" TO "*)" NESTED
|
|
|
+ 68 COMMENTS FROM "//" TO lf
|
|
|
+ 69
|
|
|
+ 70 TOKENS
|
|
|
+ 71 ident = letter { letter | digit } .
|
|
|
+ 72 integer = digit { digit }
|
|
|
+ 73 | digit { digit } CONTEXT("..")
|
|
|
+ 74 | "0x" hexDigit { hexDigit }
|
|
|
+ 75 | "0X" hexDigit { hexDigit } .
|
|
|
+ 76 real = digit { digit } "." { digit }
|
|
|
+ 77 [ ( "E" | "e" ) [ "+" | "-" ] digit { digit } ] .
|
|
|
+ 78 string = "'" { noQuote1 } "'"
|
|
|
+ 79 | '"' { noQuote2 } '"' .
|
|
|
+ 80
|
|
|
+ 81 PRODUCTIONS
|
|
|
+ 82 M2
|
|
|
+ 83 = Unit "." .
|
|
|
+ 84 (* Units: program modules compile fully; DEFINITION and
|
|
|
+ 85 IMPLEMENTATION modules parse + check now but lower in step 4
|
|
|
+ 86 (each ends with one 230); same for nested local modules. *)
|
|
|
+ 87 Unit
|
|
|
+ 88 = DefUnit
|
|
|
+ 89 | ImplUnit
|
|
|
+ 90 | ProgModule .
|
|
|
+ 91 DefUnit (. VAR m1, m2, pn: SymTab.Name; .)
|
|
|
+ 92 = "DEFINITION" "MODULE"
|
|
|
+ 93 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
+ 94 IF ~SymTab.Enter(m1,
|
|
|
+ 95 SymTab.KindModule) THEN
|
|
|
+ 96 SemError(200) END; .)
|
|
|
+ 97 ";"
|
|
|
+ 98 { Import }
|
|
|
+ 99 { ConstBlock | TypeBlock<TRUE> | VarBlock
|
|
|
+ 100 | ProcHeading<pn> ";" (. SymTab.CloseProc; .) }
|
|
|
+ 101 "END"
|
|
|
+ 102 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
+ 103 SemError(202) END; .)
|
|
|
+ 104 (. QbeGen.CloseModule;
|
|
|
+ 105 SemError(230);
|
|
|
+ 106 SymTab.PrintTable; .) .
|
|
|
+ 107 ImplUnit (. VAR m1, m2: SymTab.Name; .)
|
|
|
+ 108 = "IMPLEMENTATION" "MODULE"
|
|
|
+ 109 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
+ 110 IF ~SymTab.Enter(m1,
|
|
|
+ 111 SymTab.KindModule) THEN
|
|
|
+ 112 SemError(200) END; .)
|
|
|
+ 113 ";"
|
|
|
+ 114 { Import }
|
|
|
+ 115 DeclSeq
|
|
|
+ 116 [ "BEGIN" (. QbeGen.BeginBody; .)
|
|
|
+ 117 [ StatSeq ] ]
|
|
|
+ 118 "END"
|
|
|
+ 119 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
+ 120 SemError(202) END; .)
|
|
|
+ 121 (. QbeGen.CloseModule;
|
|
|
+ 122 SemError(230);
|
|
|
+ 123 SymTab.PrintTable; .) .
|
|
|
+ 124 ProgModule (. VAR m1, m2: SymTab.Name; .)
|
|
|
+ 125 = "MODULE"
|
|
|
+ 126 GetIdent<m1> (. SymTab.Init; QbeGen.OpenModule(m1);
|
|
|
+ 127 IF ~SymTab.Enter(m1,
|
|
|
+ 128 SymTab.KindModule) THEN
|
|
|
+ 129 SemError(200) END; .)
|
|
|
+ 130 [ Priority ]
|
|
|
+ 131 ";"
|
|
|
+ 132 { Import }
|
|
|
+ 133 DeclSeq
|
|
|
+ 134 [ "BEGIN" (. QbeGen.BeginBody; .)
|
|
|
+ 135 [ StatSeq ] ]
|
|
|
+ 136 "END"
|
|
|
+ 137 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
+ 138 SemError(202) END; .)
|
|
|
+ 139 (. QbeGen.EndModule;
|
|
|
+ 140 SymTab.PrintTable; .) .
|
|
|
+ 141 DeclSeq
|
|
|
+ 142 = { ConstBlock | TypeBlock<FALSE> | VarBlock | ProcDecl ";"
|
|
|
+ 143 | NestedModule ";" | ClassItem ";" } .
|
|
|
+ 144 (* Local module, Wirth form. Parses + checks fully (own scope);
|
|
|
+ 145 lowering waits for step 4, marked by one 230 at END. *)
|
|
|
+ 146 NestedModule (. VAR m1, m2: SymTab.Name; .)
|
|
|
+ 147 = "MODULE"
|
|
|
+ 148 GetIdent<m1> (. IF ~SymTab.Enter(m1,
|
|
|
+ 149 SymTab.KindModule) THEN
|
|
|
+ 150 SemError(200) END;
|
|
|
+ 151 SymTab.PushScope; .)
|
|
|
+ 152 [ Priority ]
|
|
|
+ 153 ";"
|
|
|
+ 154 { Import }
|
|
|
+ 155 [ Export ]
|
|
|
+ 156 DeclSeq
|
|
|
+ 157 [ "BEGIN"
|
|
|
+ 158 [ StatSeq ] ]
|
|
|
+ 159 "END"
|
|
|
+ 160 GetIdent<m2> (. IF ~SymTab.Equal(m1, m2) THEN
|
|
|
+ 161 SemError(202) END;
|
|
|
+ 162 SymTab.PopScope;
|
|
|
+ 163 SemError(230); .) .
|
|
|
+ 164 Priority
|
|
|
+ 165 = "[" integer "]" (. SemError(230); .) .
|
|
|
+ 166 Export (. VAR nm: SymTab.Name; .)
|
|
|
+ 167 = "EXPORT" (* names wire up in step 4 *)
|
|
|
+ 168 [ "QUALIFIED" ]
|
|
|
+ 169 GetIdent<nm>
|
|
|
+ 170 { "," GetIdent<nm> }
|
|
|
+ 171 ";" .
|
|
|
+ 172 Import (. VAR n: SymTab.Name; .)
|
|
|
+ 173 = "FROM"
|
|
|
+ 174 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 175 SymTab.KindImport) THEN
|
|
|
+ 176 SemError(200) END; .)
|
|
|
+ 177 "IMPORT"
|
|
|
+ 178 ImpList ";"
|
|
|
+ 179 | "IMPORT"
|
|
|
+ 180 ImpList ";" .
|
|
|
+ 181 ImpList (. VAR n: SymTab.Name; .)
|
|
|
+ 182 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 183 SymTab.KindImport) THEN
|
|
|
+ 184 SemError(200) END; .)
|
|
|
+ 185 { ","
|
|
|
+ 186 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 187 SymTab.KindImport) THEN
|
|
|
+ 188 SemError(200) END; .) } .
|
|
|
+ 189 (* Opaque TYPE declarations (definition modules). The targetless
|
|
|
+ 190 alias resolves to InvalidType until step 4 completes it. *)
|
|
|
+ 191 (* Scalar-phase TYPEs: named types, integer subranges, enumerations.
|
|
|
+ 192 Opaque "TYPE T;" needs isDef (definition units); elsewhere 231.
|
|
|
+ 193 Composite forms (ARRAY/RECORD/SET/POINTER) arrive with step 3. *)
|
|
|
+ 194 TypeBlock<isDef: BOOLEAN>
|
|
|
+ 195 = "TYPE" { TypeItem<isDef> ";" | ClassItem ";" } .
|
|
|
+ 196 TypeItem<isDef: BOOLEAN> (. VAR n: SymTab.Name;
|
|
|
+ 197 t: SymTab.TypeIndex; .)
|
|
|
+ 198 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 199 SymTab.KindType) THEN
|
|
|
+ 200 SemError(200) END; .)
|
|
|
+ 201 ( "=" Type<t, FALSE> (. SymTab.SetSymType(n, t); .)
|
|
|
+ 202 | (. IF ~isDef THEN
|
|
|
+ 203 SemError(231) END;
|
|
|
+ 204 SymTab.SetSymType(n,
|
|
|
+ 205 SymTab.NewAlias()); .) ) .
|
|
|
+ 206 Type<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
+ 207 = TypeIdent<t>
|
|
|
+ 208 | Subrange<t>
|
|
|
+ 209 | Enum<t>
|
|
|
+ 210 | ArrayType<t, allowOpen>
|
|
|
+ 211 | SetType<t>
|
|
|
+ 212 | RecordType<t>
|
|
|
+ 213 | PointerType<t> .
|
|
|
+ 214 PointerType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex; .)
|
|
|
+ 215 = "POINTER" "TO" Type<base, FALSE>(. t := SymTab.NewPtr(base); .) .
|
|
|
+ 216 (* Arrays: "OF" without bounds is an open formal (allowed only
|
|
|
+ 217 where allowOpen); "[lo..hi, ...]" nests bounded levels inside
|
|
|
+ 218 out. Bounds are folded literals (int/char); anything else 230.
|
|
|
+ 219 Bare-type indices ("ARRAY Color OF") wait for enum ordinals. *)
|
|
|
+ 220 ArrayType<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
+ 221 (. VAR elem: SymTab.TypeIndex;
|
|
|
+ 222 ok: BOOLEAN; .)
|
|
|
+ 223 = "ARRAY"
|
|
|
+ 224 ( "OF" Type<elem, FALSE> (. IF ~allowOpen THEN
|
|
|
+ 225 SemError(230) END;
|
|
|
+ 226 t := SymTab.NewOpenArray(elem); .)
|
|
|
+ 227 | "[" (. SymTab.BoundBegin; ok := TRUE; .)
|
|
|
+ 228 BoundPair<ok>
|
|
|
+ 229 { "," BoundPair<ok> }
|
|
|
+ 230 "]" "OF" Type<elem, FALSE>
|
|
|
+ 231 (. IF ok THEN
|
|
|
+ 232 t := SymTab.NestArray(elem)
|
|
|
+ 233 ELSE t := SymTab.InvalidType
|
|
|
+ 234 END; .) ) .
|
|
|
+ 235 BoundPair<VAR ok: BOOLEAN> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
+ 236 qlo, qhi: QbeGen.QVal;
|
|
|
+ 237 lo, hi: INTEGER;
|
|
|
+ 238 cl, cl2: INTEGER; .)
|
|
|
+ 239 = Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
+ 240 (. IF (tlo = SymTab.InvalidType)
|
|
|
+ 241 OR (thi = SymTab.InvalidType) THEN
|
|
|
+ 242 ok := FALSE
|
|
|
+ 243 ELSE cl := SymTab.ClassOf(tlo);
|
|
|
+ 244 cl2 := SymTab.ClassOf(thi);
|
|
|
+ 245 IF ((cl # SymTab.ClInt)
|
|
|
+ 246 & (cl # SymTab.ClChar))
|
|
|
+ 247 OR ((cl2 # SymTab.ClInt)
|
|
|
+ 248 & (cl2 # SymTab.ClChar)) THEN
|
|
|
+ 249 SemError(230); ok := FALSE
|
|
|
+ 250 ELSIF ~SymTab.ConstInt(qlo, lo)
|
|
|
+ 251 OR ~SymTab.ConstInt(qhi, hi)
|
|
|
+ 252 OR (lo > hi) THEN
|
|
|
+ 253 SemError(230); ok := FALSE
|
|
|
+ 254 ELSIF ~SymTab.BoundAdd(lo, hi) THEN
|
|
|
+ 255 SemError(230); ok := FALSE
|
|
|
+ 256 END; .) .
|
|
|
+ 257 (* Sets: multi-word masks over bases ≤ 256 values (bool, char,
|
|
|
+ 258 bounded subranges; enums wait for ordinals, INTEGER is
|
|
|
+ 259 unbounded). Literals are SET OF [0..255]; assignment and
|
|
|
+ 260 comparison across suitable bases are lenient (masks over min
|
|
|
+ 261 words + zero-check extras), out-of-span literals are 222. *)
|
|
|
+ 262 SetType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex;
|
|
|
+ 263 blo, bhi, bspan: INTEGER;
|
|
|
+ 264 bcls: INTEGER; .)
|
|
|
+ 265 = "SET" "OF" Type<base, FALSE>
|
|
|
+ 266 (. IF base = SymTab.InvalidType THEN
|
|
|
+ 267 t := SymTab.InvalidType
|
|
|
+ 268 ELSE bcls :=
|
|
|
+ 269 SymTab.ClassOf(base);
|
|
|
+ 270 IF bcls = SymTab.ClBool THEN
|
|
|
+ 271 blo := 0; bspan := 2
|
|
|
+ 272 ELSIF bcls = SymTab.ClChar THEN
|
|
|
+ 273 blo := 0; bspan := 256
|
|
|
+ 274 ELSIF SymTab.SubBounds(base,
|
|
|
+ 275 blo, bhi) THEN
|
|
|
+ 276 bspan := bhi - blo + 1
|
|
|
+ 277 ELSE bspan := 0 END;
|
|
|
+ 278 IF (bspan <= 0)
|
|
|
+ 279 OR (bspan > 256) THEN
|
|
|
+ 280 SemError(230);
|
|
|
+ 281 t := SymTab.InvalidType
|
|
|
+ 282 ELSE t := SymTab.NewSet(base)
|
|
|
+ 283 END
|
|
|
+ 284 END; .) .
|
|
|
+ 285 (* Records: flat blobs; array fields are pointers to static
|
|
|
+ 286 descriptors (locked amendment), nested records inline. Field
|
|
|
+ 287 offsets static and declaration-ordered. *)
|
|
|
+ 288 RecordType<VAR t: SymTab.TypeIndex> (. VAR t2: SymTab.TypeIndex; .)
|
|
|
+ 289 = "RECORD" (. t := SymTab.NewRecord(); .)
|
|
|
+ 290 [ RecField<t> { ";" RecField<t> } ]
|
|
|
+ 291 "END" .
|
|
|
+ 292 RecField<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
+ 293 t2: SymTab.TypeIndex; .)
|
|
|
+ 294 = RecIdents<rec> ":" Type<t2, FALSE>(. SymTab.FixPendingF(rec, t2); .) .
|
|
|
+ 295 RecIdents<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
+ 296 = GetIdent<n> (. IF ~SymTab.FieldPending(rec,
|
|
|
+ 297 n) THEN
|
|
|
+ 298 SemError(200) END; .)
|
|
|
+ 299 { "," GetIdent<n> (. IF ~SymTab.FieldPending(rec,
|
|
|
+ 300 n) THEN
|
|
|
+ 301 SemError(200) END; .) } .
|
|
|
+ 302 TypeIdent<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
+ 303 k: INTEGER; .)
|
|
|
+ 304 = GetIdent<n> (. IF ~SymTab.Lookup(n) THEN
|
|
|
+ 305 SemError(201);
|
|
|
+ 306 t := SymTab.InvalidType
|
|
|
+ 307 ELSE k := SymTab.SymKind(n);
|
|
|
+ 308 IF (k = SymTab.KindType)
|
|
|
+ 309 OR (k = SymTab.KindPredef) THEN
|
|
|
+ 310 t := SymTab.SymType(n)
|
|
|
+ 311 ELSIF k = SymTab.KindImport THEN
|
|
|
+ 312 t := SymTab.InvalidType
|
|
|
+ 313 ELSE SemError(221);
|
|
|
+ 314 t := SymTab.InvalidType
|
|
|
+ 315 END
|
|
|
+ 316 END; .) .
|
|
|
+ 317 Subrange<VAR t: SymTab.TypeIndex> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
+ 318 qlo, qhi: QbeGen.QVal;
|
|
|
+ 319 lo, hi: INTEGER; .)
|
|
|
+ 320 = "[" Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
+ 321 (. IF (tlo = SymTab.InvalidType)
|
|
|
+ 322 OR (thi = SymTab.InvalidType) THEN
|
|
|
+ 323 t := SymTab.InvalidType
|
|
|
+ 324 ELSIF (SymTab.ClassOf(tlo) #
|
|
|
+ 325 SymTab.ClInt)
|
|
|
+ 326 OR (SymTab.ClassOf(thi) #
|
|
|
+ 327 SymTab.ClInt) THEN
|
|
|
+ 328 SemError(230);
|
|
|
+ 329 t := SymTab.InvalidType
|
|
|
+ 330 ELSIF ~SymTab.ConstInt(qlo, lo)
|
|
|
+ 331 OR ~SymTab.ConstInt(qhi, hi)
|
|
|
+ 332 OR (lo > hi) THEN
|
|
|
+ 333 SemError(230);
|
|
|
+ 334 t := SymTab.InvalidType
|
|
|
+ 335 ELSE t := SymTab.NewSubR(lo, hi)
|
|
|
+ 336 END; .)
|
|
|
+ 337 "]" .
|
|
|
+ 338 Enum<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
+ 339 = "(" (. t := SymTab.NewEnum(); .)
|
|
|
+ 340 GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 341 SymTab.KindConst) THEN
|
|
|
+ 342 SemError(200) END;
|
|
|
+ 343 SymTab.SetSymType(n, t); .)
|
|
|
+ 344 { "," GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 345 SymTab.KindConst) THEN
|
|
|
+ 346 SemError(200) END;
|
|
|
+ 347 SymTab.SetSymType(n, t); .) }
|
|
|
+ 348 ")" .
|
|
|
+ 349 (* Clarion-form classes (docs/OOP.txt): declaration + single
|
|
|
+ 350 inheritance + IMPLEMENTATION blocks. Scopes and member checks
|
|
|
+ 351 now; lowering (vtable, dispatch, THIS) later — one 230 per
|
|
|
+ 352 class/impl block. Methods end with ";" per the Table example
|
|
|
+ 353 (not "," as in the sketch). No underscores in identifiers. *)
|
|
|
+ 354 (* Single CLASS item in both loops: separating declaration from
|
|
|
+ 355 IMPLEMENTATION at the loop level needs 2-token lookahead
|
|
|
+ 356 (CLASS ident vs CLASS IMPLEMENTATION), which LL(1) cannot do.
|
|
|
+ 357 The second token decides after CLASS is consumed. A misplaced
|
|
|
+ 358 CLASS IMPLEMENTATION inside TYPE still parses (harmless: the
|
|
|
+ 359 whole unit ends 230 until lowering). *)
|
|
|
+ 360 ClassItem
|
|
|
+ 361 = "CLASS" ( "IMPLEMENTATION" ClassImplRest | ClassRest ) .
|
|
|
+ 362 ClassRest (. VAR cn, m2, pn: SymTab.Name;
|
|
|
+ 363 ct: SymTab.TypeIndex; .)
|
|
|
+ 364 = GetIdent<cn> (. IF ~SymTab.Enter(cn,
|
|
|
+ 365 SymTab.KindType) THEN
|
|
|
+ 366 SemError(200) END;
|
|
|
+ 367 ct := SymTab.NewClass();
|
|
|
+ 368 SymTab.SetSymType(cn, ct);
|
|
|
+ 369 SymTab.PushClassScope(ct); .)
|
|
|
+ 370 [ Parents<ct> ]
|
|
|
+ 371 ";"
|
|
|
+ 372 { ClassField<ct> ";" }
|
|
|
+ 373 { MethodHeading<pn> ";" (. SymTab.CloseProc; .) }
|
|
|
+ 374 "END"
|
|
|
+ 375 GetIdent<m2> (. IF ~SymTab.Equal(cn, m2) THEN
|
|
|
+ 376 SemError(202) END;
|
|
|
+ 377 SymTab.PopScope;
|
|
|
+ 378 SemError(230); .) .
|
|
|
+ 379 Parents<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name; .)
|
|
|
+ 380 = "(" Parent1<ct>
|
|
|
+ 381 { "," GetIdent<p> (. SemError(230); .) }
|
|
|
+ 382 ")" .
|
|
|
+ 383 Parent1<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name;
|
|
|
+ 384 pt: SymTab.TypeIndex; .)
|
|
|
+ 385 = GetIdent<p> (. IF ~SymTab.Lookup(p) THEN
|
|
|
+ 386 SemError(201)
|
|
|
+ 387 ELSE pt := SymTab.SymType(p);
|
|
|
+ 388 IF SymTab.ClassOf(pt) #
|
|
|
+ 389 SymTab.ClClass THEN
|
|
|
+ 390 SemError(230)
|
|
|
+ 391 ELSE SymTab.SetParent(ct, pt)
|
|
|
+ 392 END
|
|
|
+ 393 END; .) .
|
|
|
+ 394 ClassField<ct: SymTab.TypeIndex> (. VAR n, rhs: SymTab.Name;
|
|
|
+ 395 t: SymTab.TypeIndex; .)
|
|
|
+ 396 = GetIdent<n>
|
|
|
+ 397 ( "=" GetIdent<rhs> (. IF ~SymTab.Enter(n,
|
|
|
+ 398 SymTab.KindConst) THEN
|
|
|
+ 399 SemError(200) END;
|
|
|
+ 400 IF SymTab.Lookup(rhs) THEN
|
|
|
+ 401 SymTab.SetSymType(n,
|
|
|
+ 402 SymTab.SymType(rhs))
|
|
|
+ 403 END; .)
|
|
|
+ 404 | (. IF ~SymTab.FieldPending(ct,
|
|
|
+ 405 n) THEN
|
|
|
+ 406 SemError(200) END; .)
|
|
|
+ 407 { "," GetIdent<n> (. IF ~SymTab.FieldPending(ct,
|
|
|
+ 408 n) THEN
|
|
|
+ 409 SemError(200) END; .) }
|
|
|
+ 410 ":" Type<t, FALSE> (. SymTab.FixPendingF(ct, t); .) ) .
|
|
|
+ 411 MethodHeading<VAR pn: SymTab.Name> (. VAR wantVirt: BOOLEAN; .)
|
|
|
+ 412 = (. wantVirt := FALSE; .)
|
|
|
+ 413 [ "VIRTUAL" (. wantVirt := TRUE; .) ]
|
|
|
+ 414 ProcHeading<pn> (. IF wantVirt THEN
|
|
|
+ 415 SymTab.MarkVirtual END; .) .
|
|
|
+ 416 ClassImplRest (. VAR cn, m2: SymTab.Name;
|
|
|
+ 417 ct: SymTab.TypeIndex; .)
|
|
|
+ 418 = GetIdent<cn> (. IF ~SymTab.Lookup(cn) THEN
|
|
|
+ 419 SemError(201);
|
|
|
+ 420 ct := SymTab.InvalidType
|
|
|
+ 421 ELSE ct := SymTab.SymType(cn);
|
|
|
+ 422 IF SymTab.ClassOf(ct) #
|
|
|
+ 423 SymTab.ClClass THEN
|
|
|
+ 424 SemError(230);
|
|
|
+ 425 ct := SymTab.InvalidType
|
|
|
+ 426 END
|
|
|
+ 427 END;
|
|
|
+ 428 IF ct #
|
|
|
+ 429 SymTab.InvalidType THEN
|
|
|
+ 430 IF ~SymTab.PushClassMembers(
|
|
|
+ 431 ct) THEN
|
|
|
+ 432 SemError(230) END
|
|
|
+ 433 END; .)
|
|
|
+ 434 ";" { MethodImpl<ct> ";" }
|
|
|
+ 435 [ "BEGIN"
|
|
|
+ 436 [ StatSeq ] ]
|
|
|
+ 437 "END"
|
|
|
+ 438 GetIdent<m2> (. IF ~SymTab.Equal(cn, m2) THEN
|
|
|
+ 439 SemError(202) END;
|
|
|
+ 440 SymTab.PopScope;
|
|
|
+ 441 SemError(230); .) .
|
|
|
+ 442 MethodImpl<ct: SymTab.TypeIndex> (. VAR pn: SymTab.Name; .)
|
|
|
+ 443 = MethodHeading<pn> ";"
|
|
|
+ 444 (. IF (ct #
|
|
|
+ 445 SymTab.InvalidType)
|
|
|
+ 446 & ~SymTab.MethodExists(ct,
|
|
|
+ 447 pn) THEN
|
|
|
+ 448 SemError(201) END; .)
|
|
|
+ 449 ( "FORWARD" (. SymTab.MarkFwd;
|
|
|
+ 450 SymTab.CloseProc; .)
|
|
|
+ 451 | Block<pn> (. SymTab.CloseProc;
|
|
|
+ 452 SemError(230); .) ) .
|
|
|
+ 453 ConstBlock
|
|
|
+ 454 = "CONST" { ConstDecl ";" } .
|
|
|
+ 455 ConstDecl (. VAR n: SymTab.Name;
|
|
|
+ 456 t: SymTab.TypeIndex;
|
|
|
+ 457 qv: QbeGen.QVal;
|
|
|
+ 458 cls: INTEGER; .)
|
|
|
+ 459 = GetIdent<n> (. IF ~SymTab.Enter(n,
|
|
|
+ 460 SymTab.KindConst) THEN
|
|
|
+ 461 SemError(200) END; .)
|
|
|
+ 462 "="
|
|
|
+ 463 Expr<t, qv> (. SymTab.SetSymType(n, t);
|
|
|
+ 464 cls := SymTab.ClassOf(t);
|
|
|
+ 465 IF cls = SymTab.ClStr THEN
|
|
|
+ 466 SemError(230)
|
|
|
+ 467 ELSIF ~QbeGen.IsImm(qv) THEN
|
|
|
+ 468 SemError(230) END;
|
|
|
+ 469 QbeGen.DeclConst(n, qv, t); .) .
|
|
|
+ 470 VarBlock
|
|
|
+ 471 = "VAR" { VarDecl ";" } .
|
|
|
+ 472 VarDecl (. VAR nm: SymTab.Name;
|
|
|
+ 473 t: SymTab.TypeIndex;
|
|
|
+ 474 i: CARDINAL;
|
|
|
+ 475 cls: INTEGER; .)
|
|
|
+ 476 = VarIdents ":"
|
|
|
+ 477 Type<t, FALSE> (. cls := SymTab.ClassOf(t);
|
|
|
+ 478 IF (t # SymTab.InvalidType)
|
|
|
+ 479 & (cls # SymTab.ClInt)
|
|
|
+ 480 & (cls # SymTab.ClBool)
|
|
|
+ 481 & (cls # SymTab.ClChar)
|
|
|
+ 482 & (cls # SymTab.ClReal)
|
|
|
+ 483 & (cls # SymTab.ClArray)
|
|
|
+ 484 & (cls # SymTab.ClSet)
|
|
|
+ 485 & (cls # SymTab.ClRecord)
|
|
|
+ 486 & (cls # SymTab.ClPtr) THEN
|
|
|
+ 487 SemError(230) END;
|
|
|
+ 488 i := 0;
|
|
|
+ 489 WHILE i < SymTab.PendCount() DO
|
|
|
+ 490 SymTab.PendName(i, nm);
|
|
|
+ 491 QbeGen.DeclVar(nm, t);
|
|
|
+ 492 INC(i)
|
|
|
+ 493 END;
|
|
|
+ 494 SymTab.FixPending(t); .) .
|
|
|
+ 495 VarIdents (. VAR n: SymTab.Name; .)
|
|
|
+ 496 = GetIdent<n> (. IF ~SymTab.EnterPending(n,
|
|
|
+ 497 SymTab.KindVar) THEN
|
|
|
+ 498 SemError(200) END; .)
|
|
|
+ 499 { ","
|
|
|
+ 500 GetIdent<n> (. IF ~SymTab.EnterPending(n,
|
|
|
+ 501 SymTab.KindVar) THEN
|
|
|
+ 502 SemError(200) END; .) } .
|
|
|
+ 503 ParIdents<isV: BOOLEAN> (. VAR n: SymTab.Name; .)
|
|
|
+ 504 = GetIdent<n> (. IF ~SymTab.EnterParam(n, isV) THEN
|
|
|
+ 505 SemError(200) END; .)
|
|
|
+ 506 { "," GetIdent<n> (. IF ~SymTab.EnterParam(n, isV) THEN
|
|
|
+ 507 SemError(200) END; .) } .
|
|
|
+ 508 (* Procedure headings enter now (scopes, params, result); bodies
|
|
|
+ 509 parse + check with one 230 at END (lowering = step 4).
|
|
|
+ 510 FORWARD marks; the body heading re-enters (signature compare
|
|
|
+ 511 tightens in step 4). *)
|
|
|
+ 512 ProcHeading<VAR pn: SymTab.Name> (. VAR t: SymTab.TypeIndex; .)
|
|
|
+ 513 = "PROCEDURE"
|
|
|
+ 514 GetIdent<pn> (. IF ~SymTab.EnterProc(pn) THEN
|
|
|
+ 515 IF ~SymTab.ReenterProc(pn) THEN
|
|
|
+ 516 SemError(200) END
|
|
|
+ 517 END; .)
|
|
|
+ 518 [ FormalParams ]
|
|
|
+ 519 [ ":" TypeIdent<t> (. SymTab.SetProcRes(t);
|
|
|
+ 520 IF (t #
|
|
|
+ 521 SymTab.InvalidType)
|
|
|
+ 522 & (SymTab.ClassOf(t)
|
|
|
+ 523 = SymTab.ClArray) THEN
|
|
|
+ 524 SemError(230) END; .) ] .
|
|
|
+ 525 FormalParams
|
|
|
+ 526 = "(" [ ParamSection { ";" ParamSection } ] ")" .
|
|
|
+ 527 ParamSection (. VAR t: SymTab.TypeIndex;
|
|
|
+ 528 isV: BOOLEAN; .)
|
|
|
+ 529 = (. isV := FALSE; .)
|
|
|
+ 530 [ "VAR" (. isV := TRUE; .) ]
|
|
|
+ 531 ParIdents<isV> ":" Type<t, TRUE> (. SymTab.FixPending(t); .) .
|
|
|
+ 532 ProcDecl (. VAR pn, m2: SymTab.Name; .)
|
|
|
+ 533 = ProcHeading<pn> ";"
|
|
|
+ 534 ( "FORWARD" (. SymTab.MarkFwd;
|
|
|
+ 535 SymTab.CloseProc; .)
|
|
|
+ 536 | Block<pn> (. SymTab.CloseProc;
|
|
|
+ 537 SemError(230); .) ) .
|
|
|
+ 538 Block<pn: SymTab.Name> (. VAR m2: SymTab.Name; .)
|
|
|
+ 539 = DeclSeq
|
|
|
+ 540 [ "BEGIN"
|
|
|
+ 541 [ StatSeq ] ]
|
|
|
+ 542 "END"
|
|
|
+ 543 GetIdent<m2> (. IF ~SymTab.Equal(pn, m2) THEN
|
|
|
+ 544 SemError(202) END; .) .
|
|
|
+ 545 StatSeq
|
|
|
+ 546 = Statement { ";" Statement } .
|
|
|
+ 547 Statement (. VAR lx: QbeGen.QVal; .)
|
|
|
+ 548 = Assign
|
|
|
+ 549 | IfStat
|
|
|
+ 550 | WhileStat
|
|
|
+ 551 | RepeatStat
|
|
|
+ 552 | LoopStat
|
|
|
+ 553 | ForStat
|
|
|
+ 554 | CaseStat
|
|
|
+ 555 | WithStat
|
|
|
+ 556 | ReturnStat
|
|
|
+ 557 | NewStat
|
|
|
+ 558 | DisposeStat
|
|
|
+ 559 | "EXIT" (. IF QbeGen.TopLoop(lx) THEN
|
|
|
+ 560 QbeGen.Jmp(lx)
|
|
|
+ 561 ELSE SemError(230) END; .) .
|
|
|
+ 562 (* NEW/DISPOSE as builtin statements (no call syntax until step 4).
|
|
|
+ 563 Targets are pointer designators; DISPOSE nils afterwards (safer
|
|
|
+ 564 than Wirth-undefined; documented). DISPOSE is shallow. *)
|
|
|
+ 565 NewStat (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 566 dk: INTEGER;
|
|
|
+ 567 qd, qm: QbeGen.QVal;
|
|
|
+ 568 qn: SymTab.Name;
|
|
|
+ 569 sfx: BOOLEAN;
|
|
|
+ 570 bt: SymTab.TypeIndex; .)
|
|
|
+ 571 = "NEW" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 572 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 573 ELSIF (dk # SymTab.KindVar)
|
|
|
+ 574 & (dk # SymTab.KindParam)
|
|
|
+ 575 & (dk # SymTab.KindField) THEN
|
|
|
+ 576 SemError(210)
|
|
|
+ 577 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 578 SymTab.ClPtr THEN
|
|
|
+ 579 SemError(219)
|
|
|
+ 580 ELSE bt := SymTab.PtrBase(dt);
|
|
|
+ 581 IF bt #
|
|
|
+ 582 SymTab.InvalidType THEN
|
|
|
+ 583 QbeGen.NewHeap(bt, qm);
|
|
|
+ 584 QbeGen.InitHeap(qm, bt);
|
|
|
+ 585 IF sfx
|
|
|
+ 586 OR (dk =
|
|
|
+ 587 SymTab.KindField) THEN
|
|
|
+ 588 QbeGen.ElemStore(qd, qm,
|
|
|
+ 589 dt)
|
|
|
+ 590 ELSE QbeGen.StorePtr(qn,
|
|
|
+ 591 qm)
|
|
|
+ 592 END
|
|
|
+ 593 END
|
|
|
+ 594 END; .) .
|
|
|
+ 595 DisposeStat (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 596 dk: INTEGER;
|
|
|
+ 597 qd, qv: QbeGen.QVal;
|
|
|
+ 598 qn: SymTab.Name;
|
|
|
+ 599 sfx: BOOLEAN; .)
|
|
|
+ 600 = "DISPOSE" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 601 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 602 ELSIF (dk # SymTab.KindVar)
|
|
|
+ 603 & (dk # SymTab.KindParam)
|
|
|
+ 604 & (dk # SymTab.KindField) THEN
|
|
|
+ 605 SemError(210)
|
|
|
+ 606 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 607 SymTab.ClPtr THEN
|
|
|
+ 608 SemError(219)
|
|
|
+ 609 ELSE
|
|
|
+ 610 IF sfx
|
|
|
+ 611 OR (dk =
|
|
|
+ 612 SymTab.KindField) THEN
|
|
|
+ 613 QbeGen.ElemLoad(qd, dt,
|
|
|
+ 614 qv)
|
|
|
+ 615 ELSE QbeGen.LoadPtr(qn, qv)
|
|
|
+ 616 END;
|
|
|
+ 617 QbeGen.FreeHeap(qv);
|
|
|
+ 618 IF sfx
|
|
|
+ 619 OR (dk =
|
|
|
+ 620 SymTab.KindField) THEN
|
|
|
+ 621 QbeGen.ElemStore(qd, "0",
|
|
|
622 dt)
|
|
|
- 623 ELSIF conv THEN
|
|
|
- 624 QbeGen.ConvIR(qe, qt);
|
|
|
- 625 QbeGen.ElemStore(qd, qt,
|
|
|
- 626 dt)
|
|
|
- 627 ELSE QbeGen.ElemStore(qd, qe,
|
|
|
- 628 dt)
|
|
|
- 629 END
|
|
|
- 630 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 631 SymTab.ClArray THEN
|
|
|
- 632 QbeGen.CopyArray(qd, qe, dt)
|
|
|
- 633 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 634 SymTab.ClSet THEN
|
|
|
- 635 QbeGen.CopySet(qd, qe,
|
|
|
- 636 SymTab.SetWords(dt),
|
|
|
- 637 SymTab.SetWords(et))
|
|
|
- 638 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 639 SymTab.ClRecord THEN
|
|
|
- 640 QbeGen.CopyRecord(qd, qe, dt)
|
|
|
- 641 ELSIF conv THEN
|
|
|
- 642 QbeGen.ConvIR(qe, qt);
|
|
|
- 643 QbeGen.StoreVar(qn, qt, TRUE)
|
|
|
- 644 ELSE
|
|
|
- 645 QbeGen.StoreVar(qn, qe, isR)
|
|
|
- 646 END
|
|
|
- 647 END; .) .
|
|
|
- 648 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 649 q, lThen, lElse, lEnd:
|
|
|
- 650 QbeGen.QVal;
|
|
|
- 651 hasElse: BOOLEAN; .)
|
|
|
- 652 = "IF" (. hasElse := FALSE; .)
|
|
|
- 653 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
- 654 SemError(214) END;
|
|
|
- 655 QbeGen.NewLabel(lThen);
|
|
|
- 656 QbeGen.NewLabel(lElse);
|
|
|
- 657 QbeGen.NewLabel(lEnd);
|
|
|
- 658 QbeGen.Jnz(q, lThen, lElse);
|
|
|
- 659 QbeGen.EmitLabel(lThen); .)
|
|
|
- 660 "THEN" StatSeq (. QbeGen.Jmp(lEnd); .)
|
|
|
- 661 { "ELSIF" (. QbeGen.EmitLabel(lElse);
|
|
|
- 662 QbeGen.NewLabel(lElse); .)
|
|
|
- 663 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
- 664 SemError(214) END;
|
|
|
- 665 QbeGen.NewLabel(lThen);
|
|
|
- 666 QbeGen.Jnz(q, lThen, lElse);
|
|
|
- 667 QbeGen.EmitLabel(lThen); .)
|
|
|
- 668 "THEN" StatSeq (. QbeGen.Jmp(lEnd); .) }
|
|
|
- 669 [ "ELSE" (. QbeGen.EmitLabel(lElse);
|
|
|
- 670 hasElse := TRUE; .)
|
|
|
- 671 StatSeq ]
|
|
|
- 672 "END" (. IF hasElse THEN
|
|
|
- 673 QbeGen.EmitLabel(lEnd)
|
|
|
- 674 ELSE QbeGen.EmitLabel(lElse);
|
|
|
- 675 QbeGen.EmitLabel(lEnd)
|
|
|
- 676 END; .) .
|
|
|
- 677 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 678 q, lTop, lBody, lEnd:
|
|
|
- 679 QbeGen.QVal; .)
|
|
|
- 680 = "WHILE" (. QbeGen.NewLabel(lTop);
|
|
|
- 681 QbeGen.NewLabel(lBody);
|
|
|
- 682 QbeGen.NewLabel(lEnd);
|
|
|
- 683 QbeGen.EmitLabel(lTop); .)
|
|
|
- 684 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
- 685 SemError(214) END;
|
|
|
- 686 QbeGen.Jnz(q, lBody, lEnd);
|
|
|
- 687 QbeGen.EmitLabel(lBody); .)
|
|
|
- 688 "DO" StatSeq (. QbeGen.Jmp(lTop); .)
|
|
|
- 689 "END" (. QbeGen.EmitLabel(lEnd); .) .
|
|
|
- 690 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 691 q, lTop, lEnd: QbeGen.QVal; .)
|
|
|
- 692 = "REPEAT" (. QbeGen.NewLabel(lTop);
|
|
|
- 693 QbeGen.NewLabel(lEnd);
|
|
|
- 694 QbeGen.EmitLabel(lTop); .)
|
|
|
- 695 StatSeq
|
|
|
- 696 "UNTIL" Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
- 697 SemError(214) END;
|
|
|
- 698 QbeGen.Jnz(q, lEnd, lTop);
|
|
|
- 699 QbeGen.EmitLabel(lEnd); .) .
|
|
|
- 700 LoopStat (. VAR lTop, lEnd: QbeGen.QVal; .)
|
|
|
- 701 = "LOOP" (. QbeGen.NewLabel(lTop);
|
|
|
- 702 QbeGen.NewLabel(lEnd);
|
|
|
- 703 QbeGen.PushLoop(lEnd);
|
|
|
- 704 QbeGen.EmitLabel(lTop); .)
|
|
|
- 705 StatSeq
|
|
|
- 706 "END" (. QbeGen.Jmp(lTop);
|
|
|
- 707 QbeGen.PopLoop;
|
|
|
- 708 QbeGen.EmitLabel(lEnd); .) .
|
|
|
- 709 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
- 710 Runtime direction would need a compare-select; the literal
|
|
|
- 711 sign picks cslew/csegew at "DO" time. *)
|
|
|
- 712 ForStat (. VAR lv: SymTab.Name;
|
|
|
- 713 tlo, thi, tby:
|
|
|
- 714 SymTab.TypeIndex;
|
|
|
- 715 qlo, qhi, qby, qt, qk, qb:
|
|
|
- 716 QbeGen.QVal;
|
|
|
- 717 lTop, lBody, lEnd:
|
|
|
- 718 QbeGen.QVal;
|
|
|
- 719 by: INTEGER;
|
|
|
- 720 ok: BOOLEAN; .)
|
|
|
- 721 = "FOR" (. by := 1; .)
|
|
|
- 722 GetIdent<lv> (. ok := SymTab.Lookup(lv);
|
|
|
- 723 IF ~ok THEN
|
|
|
- 724 SemError(201)
|
|
|
- 725 ELSIF (SymTab.SymKind(lv) #
|
|
|
- 726 SymTab.KindVar)
|
|
|
- 727 & (SymTab.SymKind(lv) #
|
|
|
- 728 SymTab.KindParam) THEN
|
|
|
- 729 SemError(220); ok := FALSE
|
|
|
- 730 ELSIF ~SymTab.IsIntFamily(
|
|
|
- 731 SymTab.SymType(lv)) THEN
|
|
|
- 732 SemError(220); ok := FALSE
|
|
|
- 733 END; .)
|
|
|
- 734 ":=" Expr<tlo, qlo> (. IF ~SymTab.IsIntFamily(tlo) THEN
|
|
|
- 735 SemError(220); ok := FALSE
|
|
|
- 736 END; .)
|
|
|
- 737 "TO" Expr<thi, qhi> (. IF ~SymTab.IsIntFamily(thi) THEN
|
|
|
- 738 SemError(220); ok := FALSE
|
|
|
- 739 END; .)
|
|
|
- 740 [ "BY" Expr<tby, qby> (. IF (tby #
|
|
|
- 741 SymTab.InvalidType)
|
|
|
- 742 & ~SymTab.IsIntFamily(tby) THEN
|
|
|
- 743 SemError(220); ok := FALSE
|
|
|
- 744 END;
|
|
|
- 745 IF ~SymTab.ConstInt(qby, by) THEN
|
|
|
- 746 SemError(230); by := 1
|
|
|
- 747 ELSIF by = 0 THEN
|
|
|
- 748 SemError(220); by := 1
|
|
|
- 749 END; .) ]
|
|
|
- 750 "DO" (. IF ok THEN
|
|
|
- 751 QbeGen.StoreVar(lv, qlo,
|
|
|
- 752 FALSE) END;
|
|
|
- 753 QbeGen.NewLabel(lTop);
|
|
|
- 754 QbeGen.NewLabel(lBody);
|
|
|
- 755 QbeGen.NewLabel(lEnd);
|
|
|
- 756 QbeGen.EmitLabel(lTop);
|
|
|
- 757 QbeGen.LoadVar(lv, FALSE, qt);
|
|
|
- 758 QbeGen.NewTemp(qk);
|
|
|
- 759 IF by > 0 THEN
|
|
|
- 760 QbeGen.Op3("cslew", qk,
|
|
|
- 761 qt, qhi, FALSE)
|
|
|
- 762 ELSE QbeGen.Op3("csgew", qk,
|
|
|
- 763 qt, qhi, FALSE)
|
|
|
- 764 END;
|
|
|
- 765 QbeGen.Jnz(qk, lBody, lEnd);
|
|
|
- 766 QbeGen.EmitLabel(lBody); .)
|
|
|
- 767 StatSeq
|
|
|
- 768 "END" (. IF ok THEN
|
|
|
- 769 QbeGen.LoadVar(lv, FALSE,
|
|
|
- 770 qt);
|
|
|
- 771 QbeGen.IntStr(by, qb);
|
|
|
- 772 QbeGen.NewTemp(qk);
|
|
|
- 773 QbeGen.Op3("add", qk,
|
|
|
- 774 qt, qb, FALSE);
|
|
|
- 775 QbeGen.StoreVar(lv, qk,
|
|
|
- 776 FALSE) END;
|
|
|
- 777 QbeGen.Jmp(lTop);
|
|
|
- 778 QbeGen.EmitLabel(lEnd); .) .
|
|
|
- 779 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
- 780 qsel, lEnd: QbeGen.QVal; .)
|
|
|
- 781 = "CASE" Expr<tsel, qsel> (. QbeGen.NewLabel(lEnd); .)
|
|
|
- 782 "OF" CaseAlt<tsel, qsel, lEnd>
|
|
|
- 783 { "|" CaseAlt<tsel, qsel, lEnd> }
|
|
|
- 784 [ "ELSE" StatSeq ]
|
|
|
- 785 "END" (. QbeGen.EmitLabel(lEnd); .) .
|
|
|
- 786 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
- 787 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
- 788 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
- 789 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
- 790 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 791 lEnd: QbeGen.QVal> (. VAR lBody, lAfter: QbeGen.QVal; .)
|
|
|
- 792 = (. QbeGen.NewLabel(lBody);
|
|
|
- 793 QbeGen.NewLabel(lAfter); .)
|
|
|
- 794 CaseLabel<tsel, qsel, lBody>
|
|
|
- 795 { "," CaseLabel<tsel, qsel, lBody> }
|
|
|
- 796 ":" (. QbeGen.Jmp(lAfter);
|
|
|
- 797 QbeGen.EmitLabel(lBody); .)
|
|
|
- 798 StatSeq (. QbeGen.Jmp(lEnd);
|
|
|
- 799 QbeGen.EmitLabel(lAfter); .) .
|
|
|
- 800 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 801 lBody: QbeGen.QVal> (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
- 802 q2, q3, qc, qd, qe:
|
|
|
- 803 QbeGen.QVal;
|
|
|
- 804 lNext: QbeGen.QVal; .)
|
|
|
- 805 = Expr<t2, q2> (. IF (t2 #
|
|
|
- 806 SymTab.InvalidType)
|
|
|
- 807 & (tsel #
|
|
|
- 808 SymTab.InvalidType)
|
|
|
- 809 & ((SymTab.ClassOf(t2) =
|
|
|
- 810 SymTab.ClSet)
|
|
|
- 811 OR (SymTab.ClassOf(tsel) =
|
|
|
- 812 SymTab.ClSet)) THEN
|
|
|
- 813 SemError(230)
|
|
|
- 814 ELSIF (t2 #
|
|
|
- 815 SymTab.InvalidType)
|
|
|
- 816 & (tsel #
|
|
|
- 817 SymTab.InvalidType)
|
|
|
- 818 & ~SymTab.EqCheck(t2,
|
|
|
- 819 tsel) THEN
|
|
|
- 820 SemError(213) END;
|
|
|
- 821 IF ~QbeGen.IsImm(q2) THEN
|
|
|
- 822 SemError(230);
|
|
|
- 823 QbeGen.CopyOp("0", q2)
|
|
|
- 824 END;
|
|
|
- 825 QbeGen.NewLabel(lNext);
|
|
|
- 826 QbeGen.Cmp(SymTab.OpEq,
|
|
|
- 827 qsel, q2, qc, FALSE);
|
|
|
- 828 QbeGen.Jnz(qc, lBody, lNext);
|
|
|
- 829 QbeGen.EmitLabel(lNext); .)
|
|
|
- 830 [ ".." Expr<t3, q3> (. IF (t3 #
|
|
|
- 831 SymTab.InvalidType)
|
|
|
- 832 & (tsel #
|
|
|
- 833 SymTab.InvalidType)
|
|
|
- 834 & ~SymTab.EqCheck(t3,
|
|
|
- 835 tsel) THEN
|
|
|
- 836 SemError(213) END;
|
|
|
- 837 IF ~QbeGen.IsImm(q3) THEN
|
|
|
- 838 SemError(230);
|
|
|
- 839 QbeGen.CopyOp("0", q3)
|
|
|
- 840 END;
|
|
|
- 841 QbeGen.Cmp(SymTab.OpGe,
|
|
|
- 842 qsel, q2, qc, FALSE);
|
|
|
- 843 QbeGen.Cmp(SymTab.OpLe,
|
|
|
- 844 qsel, q3, qd, FALSE);
|
|
|
- 845 QbeGen.NewTemp(qe);
|
|
|
- 846 QbeGen.Op3("and", qe, qc, qd,
|
|
|
- 847 FALSE);
|
|
|
- 848 QbeGen.NewLabel(lNext);
|
|
|
- 849 QbeGen.Jnz(qe, lBody, lNext);
|
|
|
- 850 QbeGen.EmitLabel(lNext); .) ] .
|
|
|
- 851 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 852 q: QbeGen.QVal;
|
|
|
- 853 res: SymTab.TypeIndex;
|
|
|
- 854 hadE: BOOLEAN; .)
|
|
|
- 855 = "RETURN" (. hadE := FALSE; .)
|
|
|
- 856 [ Expr<t, q> (. hadE := TRUE; .) ]
|
|
|
- 857 (. IF ~SymTab.InProc() THEN
|
|
|
- 858 SemError(232)
|
|
|
- 859 ELSE res := SymTab.CurRes();
|
|
|
- 860 IF ~hadE THEN
|
|
|
- 861 IF res #
|
|
|
- 862 SymTab.InvalidType THEN
|
|
|
- 863 SemError(232) END
|
|
|
- 864 ELSIF (res =
|
|
|
- 865 SymTab.InvalidType)
|
|
|
- 866 OR (t #
|
|
|
- 867 SymTab.InvalidType)
|
|
|
- 868 & ~SymTab.Assignable(t,
|
|
|
- 869 res) THEN
|
|
|
- 870 SemError(232)
|
|
|
- 871 END
|
|
|
- 872 END; .) .
|
|
|
- 873 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
- 874 Each index descends one level (bounds-checked, trap on breach);
|
|
|
- 875 nested levels reload the inner descriptor address. q ends as the
|
|
|
- 876 value (scalars), the descriptor address (plain arrays), or the
|
|
|
- 877 element address (indexed); sfx marks the indexed form. *)
|
|
|
- 878 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
- 879 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
- 880 (. VAR n, fn: SymTab.Name;
|
|
|
- 881 cls: INTEGER;
|
|
|
- 882 curT, it, eT: SymTab.TypeIndex;
|
|
|
- 883 iq, ql, qlo, qhi, qe:
|
|
|
+ 623 ELSE QbeGen.StorePtr(qn,
|
|
|
+ 624 "0")
|
|
|
+ 625 END
|
|
|
+ 626 END; .) .
|
|
|
+ 627 (* WITH pushes each record's fields (inner wins) plus its base
|
|
|
+ 628 address; field designators resolve through both stacks. *)
|
|
|
+ 629 WithStat (. VAR nW: CARDINAL; .)
|
|
|
+ 630 = "WITH" (. nW := 0; .)
|
|
|
+ 631 WithItem<nW> { "," WithItem<nW> }
|
|
|
+ 632 "DO" StatSeq "END"
|
|
|
+ 633 (. WHILE nW > 0 DO
|
|
|
+ 634 SymTab.PopScope;
|
|
|
+ 635 QbeGen.PopWith;
|
|
|
+ 636 DEC(nW)
|
|
|
+ 637 END; .) .
|
|
|
+ 638 WithItem<VAR nW: CARDINAL> (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 639 dk: INTEGER;
|
|
|
+ 640 qd, qe: QbeGen.QVal;
|
|
|
+ 641 qn: SymTab.Name;
|
|
|
+ 642 sfx: BOOLEAN; .)
|
|
|
+ 643 = Design<dt, dk, qd, qn, sfx>
|
|
|
+ 644 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 645 ELSIF (SymTab.ClassOf(dt) #
|
|
|
+ 646 SymTab.ClRecord)
|
|
|
+ 647 & (SymTab.ClassOf(dt) #
|
|
|
+ 648 SymTab.ClClass) THEN
|
|
|
+ 649 SemError(215)
|
|
|
+ 650 ELSIF SymTab.PushRecord(dt) THEN
|
|
|
+ 651 QbeGen.PushWith(qd);
|
|
|
+ 652 INC(nW)
|
|
|
+ 653 END; .) .
|
|
|
+ 654 Assign (. VAR dt, et: SymTab.TypeIndex;
|
|
|
+ 655 dk: INTEGER;
|
|
|
+ 656 qd, qe, qt: QbeGen.QVal;
|
|
|
+ 657 qn: SymTab.Name;
|
|
|
+ 658 isR, conv: BOOLEAN;
|
|
|
+ 659 sfx: BOOLEAN; .)
|
|
|
+ 660 = Design<dt, dk, qd, qn, sfx> ":="
|
|
|
+ 661 Expr<et, qe> (. IF (dt # SymTab.InvalidType)
|
|
|
+ 662 & (dk # SymTab.KindVar)
|
|
|
+ 663 & (dk # SymTab.KindParam)
|
|
|
+ 664 & (dk # SymTab.KindField) THEN
|
|
|
+ 665 SemError(210)
|
|
|
+ 666 ELSIF ~SymTab.Assignable(et,
|
|
|
+ 667 dt) THEN
|
|
|
+ 668 SemError(210)
|
|
|
+ 669 ELSIF (dt # SymTab.InvalidType)
|
|
|
+ 670 & (SymTab.ClassOf(dt) =
|
|
|
+ 671 SymTab.ClClass) THEN
|
|
|
+ 672 SemError(230) END;
|
|
|
+ 673 isR := (dt #
|
|
|
+ 674 SymTab.InvalidType)
|
|
|
+ 675 & (SymTab.ClassOf(dt)
|
|
|
+ 676 = SymTab.ClReal);
|
|
|
+ 677 conv := isR
|
|
|
+ 678 & SymTab.IsIntFamily(et);
|
|
|
+ 679 IF ((dk = SymTab.KindVar)
|
|
|
+ 680 OR (dk = SymTab.KindParam)
|
|
|
+ 681 OR (dk = SymTab.KindField))
|
|
|
+ 682 & (dt # SymTab.InvalidType)
|
|
|
+ 683 & (et # SymTab.InvalidType)
|
|
|
+ 684 & (SymTab.ClassOf(dt) #
|
|
|
+ 685 SymTab.ClClass) THEN
|
|
|
+ 686 IF sfx
|
|
|
+ 687 OR (dk = SymTab.KindField) THEN
|
|
|
+ 688 IF SymTab.ClassOf(dt) =
|
|
|
+ 689 SymTab.ClArray THEN
|
|
|
+ 690 QbeGen.CopyArray(qd, qe,
|
|
|
+ 691 dt)
|
|
|
+ 692 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 693 SymTab.ClSet THEN
|
|
|
+ 694 QbeGen.CopySet(qd, qe,
|
|
|
+ 695 SymTab.SetWords(dt),
|
|
|
+ 696 SymTab.SetWords(et))
|
|
|
+ 697 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 698 SymTab.ClRecord THEN
|
|
|
+ 699 QbeGen.CopyRecord(qd, qe,
|
|
|
+ 700 dt)
|
|
|
+ 701 ELSIF conv THEN
|
|
|
+ 702 QbeGen.ConvIR(qe, qt);
|
|
|
+ 703 QbeGen.ElemStore(qd, qt,
|
|
|
+ 704 dt)
|
|
|
+ 705 ELSE QbeGen.ElemStore(qd, qe,
|
|
|
+ 706 dt)
|
|
|
+ 707 END
|
|
|
+ 708 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 709 SymTab.ClArray THEN
|
|
|
+ 710 QbeGen.CopyArray(qd, qe, dt)
|
|
|
+ 711 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 712 SymTab.ClSet THEN
|
|
|
+ 713 QbeGen.CopySet(qd, qe,
|
|
|
+ 714 SymTab.SetWords(dt),
|
|
|
+ 715 SymTab.SetWords(et))
|
|
|
+ 716 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 717 SymTab.ClRecord THEN
|
|
|
+ 718 QbeGen.CopyRecord(qd, qe, dt)
|
|
|
+ 719 ELSIF SymTab.ClassOf(dt) =
|
|
|
+ 720 SymTab.ClPtr THEN
|
|
|
+ 721 QbeGen.StorePtr(qn, qe)
|
|
|
+ 722 ELSIF conv THEN
|
|
|
+ 723 QbeGen.ConvIR(qe, qt);
|
|
|
+ 724 QbeGen.StoreVar(qn, qt, TRUE)
|
|
|
+ 725 ELSE
|
|
|
+ 726 QbeGen.StoreVar(qn, qe, isR)
|
|
|
+ 727 END
|
|
|
+ 728 END; .) .
|
|
|
+ 729 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 730 q, lThen, lElse, lEnd:
|
|
|
+ 731 QbeGen.QVal;
|
|
|
+ 732 hasElse: BOOLEAN; .)
|
|
|
+ 733 = "IF" (. hasElse := FALSE; .)
|
|
|
+ 734 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
+ 735 SemError(214) END;
|
|
|
+ 736 QbeGen.NewLabel(lThen);
|
|
|
+ 737 QbeGen.NewLabel(lElse);
|
|
|
+ 738 QbeGen.NewLabel(lEnd);
|
|
|
+ 739 QbeGen.Jnz(q, lThen, lElse);
|
|
|
+ 740 QbeGen.EmitLabel(lThen); .)
|
|
|
+ 741 "THEN" StatSeq (. QbeGen.Jmp(lEnd); .)
|
|
|
+ 742 { "ELSIF" (. QbeGen.EmitLabel(lElse);
|
|
|
+ 743 QbeGen.NewLabel(lElse); .)
|
|
|
+ 744 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
+ 745 SemError(214) END;
|
|
|
+ 746 QbeGen.NewLabel(lThen);
|
|
|
+ 747 QbeGen.Jnz(q, lThen, lElse);
|
|
|
+ 748 QbeGen.EmitLabel(lThen); .)
|
|
|
+ 749 "THEN" StatSeq (. QbeGen.Jmp(lEnd); .) }
|
|
|
+ 750 [ "ELSE" (. QbeGen.EmitLabel(lElse);
|
|
|
+ 751 hasElse := TRUE; .)
|
|
|
+ 752 StatSeq ]
|
|
|
+ 753 "END" (. IF hasElse THEN
|
|
|
+ 754 QbeGen.EmitLabel(lEnd)
|
|
|
+ 755 ELSE QbeGen.EmitLabel(lElse);
|
|
|
+ 756 QbeGen.EmitLabel(lEnd)
|
|
|
+ 757 END; .) .
|
|
|
+ 758 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 759 q, lTop, lBody, lEnd:
|
|
|
+ 760 QbeGen.QVal; .)
|
|
|
+ 761 = "WHILE" (. QbeGen.NewLabel(lTop);
|
|
|
+ 762 QbeGen.NewLabel(lBody);
|
|
|
+ 763 QbeGen.NewLabel(lEnd);
|
|
|
+ 764 QbeGen.EmitLabel(lTop); .)
|
|
|
+ 765 Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
+ 766 SemError(214) END;
|
|
|
+ 767 QbeGen.Jnz(q, lBody, lEnd);
|
|
|
+ 768 QbeGen.EmitLabel(lBody); .)
|
|
|
+ 769 "DO" StatSeq (. QbeGen.Jmp(lTop); .)
|
|
|
+ 770 "END" (. QbeGen.EmitLabel(lEnd); .) .
|
|
|
+ 771 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 772 q, lTop, lEnd: QbeGen.QVal; .)
|
|
|
+ 773 = "REPEAT" (. QbeGen.NewLabel(lTop);
|
|
|
+ 774 QbeGen.NewLabel(lEnd);
|
|
|
+ 775 QbeGen.EmitLabel(lTop); .)
|
|
|
+ 776 StatSeq
|
|
|
+ 777 "UNTIL" Expr<t, q> (. IF ~SymTab.BoolCheck(t) THEN
|
|
|
+ 778 SemError(214) END;
|
|
|
+ 779 QbeGen.Jnz(q, lEnd, lTop);
|
|
|
+ 780 QbeGen.EmitLabel(lEnd); .) .
|
|
|
+ 781 LoopStat (. VAR lTop, lEnd: QbeGen.QVal; .)
|
|
|
+ 782 = "LOOP" (. QbeGen.NewLabel(lTop);
|
|
|
+ 783 QbeGen.NewLabel(lEnd);
|
|
|
+ 784 QbeGen.PushLoop(lEnd);
|
|
|
+ 785 QbeGen.EmitLabel(lTop); .)
|
|
|
+ 786 StatSeq
|
|
|
+ 787 "END" (. QbeGen.Jmp(lTop);
|
|
|
+ 788 QbeGen.PopLoop;
|
|
|
+ 789 QbeGen.EmitLabel(lEnd); .) .
|
|
|
+ 790 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
+ 791 Runtime direction would need a compare-select; the literal
|
|
|
+ 792 sign picks cslew/csegew at "DO" time. *)
|
|
|
+ 793 ForStat (. VAR lv: SymTab.Name;
|
|
|
+ 794 tlo, thi, tby:
|
|
|
+ 795 SymTab.TypeIndex;
|
|
|
+ 796 qlo, qhi, qby, qt, qk, qb:
|
|
|
+ 797 QbeGen.QVal;
|
|
|
+ 798 lTop, lBody, lEnd:
|
|
|
+ 799 QbeGen.QVal;
|
|
|
+ 800 by: INTEGER;
|
|
|
+ 801 ok: BOOLEAN; .)
|
|
|
+ 802 = "FOR" (. by := 1; .)
|
|
|
+ 803 GetIdent<lv> (. ok := SymTab.Lookup(lv);
|
|
|
+ 804 IF ~ok THEN
|
|
|
+ 805 SemError(201)
|
|
|
+ 806 ELSIF (SymTab.SymKind(lv) #
|
|
|
+ 807 SymTab.KindVar)
|
|
|
+ 808 & (SymTab.SymKind(lv) #
|
|
|
+ 809 SymTab.KindParam) THEN
|
|
|
+ 810 SemError(220); ok := FALSE
|
|
|
+ 811 ELSIF ~SymTab.IsIntFamily(
|
|
|
+ 812 SymTab.SymType(lv)) THEN
|
|
|
+ 813 SemError(220); ok := FALSE
|
|
|
+ 814 END; .)
|
|
|
+ 815 ":=" Expr<tlo, qlo> (. IF ~SymTab.IsIntFamily(tlo) THEN
|
|
|
+ 816 SemError(220); ok := FALSE
|
|
|
+ 817 END; .)
|
|
|
+ 818 "TO" Expr<thi, qhi> (. IF ~SymTab.IsIntFamily(thi) THEN
|
|
|
+ 819 SemError(220); ok := FALSE
|
|
|
+ 820 END; .)
|
|
|
+ 821 [ "BY" Expr<tby, qby> (. IF (tby #
|
|
|
+ 822 SymTab.InvalidType)
|
|
|
+ 823 & ~SymTab.IsIntFamily(tby) THEN
|
|
|
+ 824 SemError(220); ok := FALSE
|
|
|
+ 825 END;
|
|
|
+ 826 IF ~SymTab.ConstInt(qby, by) THEN
|
|
|
+ 827 SemError(230); by := 1
|
|
|
+ 828 ELSIF by = 0 THEN
|
|
|
+ 829 SemError(220); by := 1
|
|
|
+ 830 END; .) ]
|
|
|
+ 831 "DO" (. IF ok THEN
|
|
|
+ 832 QbeGen.StoreVar(lv, qlo,
|
|
|
+ 833 FALSE) END;
|
|
|
+ 834 QbeGen.NewLabel(lTop);
|
|
|
+ 835 QbeGen.NewLabel(lBody);
|
|
|
+ 836 QbeGen.NewLabel(lEnd);
|
|
|
+ 837 QbeGen.EmitLabel(lTop);
|
|
|
+ 838 QbeGen.LoadVar(lv, FALSE, qt);
|
|
|
+ 839 QbeGen.NewTemp(qk);
|
|
|
+ 840 IF by > 0 THEN
|
|
|
+ 841 QbeGen.Op3("cslew", qk,
|
|
|
+ 842 qt, qhi, FALSE)
|
|
|
+ 843 ELSE QbeGen.Op3("csgew", qk,
|
|
|
+ 844 qt, qhi, FALSE)
|
|
|
+ 845 END;
|
|
|
+ 846 QbeGen.Jnz(qk, lBody, lEnd);
|
|
|
+ 847 QbeGen.EmitLabel(lBody); .)
|
|
|
+ 848 StatSeq
|
|
|
+ 849 "END" (. IF ok THEN
|
|
|
+ 850 QbeGen.LoadVar(lv, FALSE,
|
|
|
+ 851 qt);
|
|
|
+ 852 QbeGen.IntStr(by, qb);
|
|
|
+ 853 QbeGen.NewTemp(qk);
|
|
|
+ 854 QbeGen.Op3("add", qk,
|
|
|
+ 855 qt, qb, FALSE);
|
|
|
+ 856 QbeGen.StoreVar(lv, qk,
|
|
|
+ 857 FALSE) END;
|
|
|
+ 858 QbeGen.Jmp(lTop);
|
|
|
+ 859 QbeGen.EmitLabel(lEnd); .) .
|
|
|
+ 860 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
+ 861 qsel, lEnd: QbeGen.QVal; .)
|
|
|
+ 862 = "CASE" Expr<tsel, qsel> (. QbeGen.NewLabel(lEnd); .)
|
|
|
+ 863 "OF" CaseAlt<tsel, qsel, lEnd>
|
|
|
+ 864 { "|" CaseAlt<tsel, qsel, lEnd> }
|
|
|
+ 865 [ "ELSE" StatSeq ]
|
|
|
+ 866 "END" (. QbeGen.EmitLabel(lEnd); .) .
|
|
|
+ 867 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
+ 868 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
+ 869 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
+ 870 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
+ 871 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 872 lEnd: QbeGen.QVal> (. VAR lBody, lAfter: QbeGen.QVal; .)
|
|
|
+ 873 = (. QbeGen.NewLabel(lBody);
|
|
|
+ 874 QbeGen.NewLabel(lAfter); .)
|
|
|
+ 875 CaseLabel<tsel, qsel, lBody>
|
|
|
+ 876 { "," CaseLabel<tsel, qsel, lBody> }
|
|
|
+ 877 ":" (. QbeGen.Jmp(lAfter);
|
|
|
+ 878 QbeGen.EmitLabel(lBody); .)
|
|
|
+ 879 StatSeq (. QbeGen.Jmp(lEnd);
|
|
|
+ 880 QbeGen.EmitLabel(lAfter); .) .
|
|
|
+ 881 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 882 lBody: QbeGen.QVal> (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
+ 883 q2, q3, qc, qd, qe:
|
|
|
884 QbeGen.QVal;
|
|
|
- 885 lo, hi: INTEGER;
|
|
|
- 886 fo: INTEGER;
|
|
|
- 887 isOpen: BOOLEAN;
|
|
|
- 888 qb: QbeGen.QVal; .)
|
|
|
- 889 = GetIdent<n> (. QbeGen.CopyOp(n, qn);
|
|
|
- 890 sfx := FALSE;
|
|
|
- 891 IF ~SymTab.Lookup(n) THEN
|
|
|
- 892 SemError(201);
|
|
|
- 893 t := SymTab.InvalidType;
|
|
|
- 894 k := -1;
|
|
|
- 895 QbeGen.CopyOp("0", q)
|
|
|
- 896 ELSE
|
|
|
- 897 t := SymTab.SymType(n);
|
|
|
- 898 k := SymTab.SymKind(n);
|
|
|
- 899 IF k = SymTab.KindConst THEN
|
|
|
- 900 IF SymTab.Equal(n,
|
|
|
- 901 "TRUE") THEN
|
|
|
- 902 t := SymTab.BoolType();
|
|
|
- 903 QbeGen.CopyOp("1", q)
|
|
|
- 904 ELSIF SymTab.Equal(n,
|
|
|
- 905 "FALSE") THEN
|
|
|
- 906 t := SymTab.BoolType();
|
|
|
- 907 QbeGen.CopyOp("0", q)
|
|
|
- 908 ELSE
|
|
|
- 909 cls :=
|
|
|
- 910 SymTab.ClassOf(t);
|
|
|
- 911 IF (t #
|
|
|
- 912 SymTab.InvalidType)
|
|
|
- 913 & ((cls = SymTab.ClInt)
|
|
|
- 914 OR (cls
|
|
|
- 915 = SymTab.ClChar)
|
|
|
- 916 OR (cls
|
|
|
- 917 = SymTab.ClReal)) THEN
|
|
|
- 918 QbeGen.LoadVar(n,
|
|
|
- 919 cls = SymTab.ClReal, q)
|
|
|
- 920 ELSE
|
|
|
- 921 IF t #
|
|
|
- 922 SymTab.InvalidType THEN
|
|
|
- 923 SemError(230)
|
|
|
- 924 END;
|
|
|
- 925 QbeGen.CopyOp("0", q)
|
|
|
- 926 END
|
|
|
- 927 END
|
|
|
- 928 ELSIF (k = SymTab.KindVar)
|
|
|
- 929 OR (k = SymTab.KindParam) THEN
|
|
|
- 930 cls :=
|
|
|
- 931 SymTab.ClassOf(t);
|
|
|
- 932 IF (cls = SymTab.ClInt)
|
|
|
- 933 OR (cls = SymTab.ClBool)
|
|
|
- 934 OR (cls = SymTab.ClChar)
|
|
|
- 935 OR (cls
|
|
|
- 936 = SymTab.ClReal) THEN
|
|
|
- 937 QbeGen.LoadVar(n,
|
|
|
- 938 cls = SymTab.ClReal, q)
|
|
|
- 939 ELSIF (cls
|
|
|
- 940 = SymTab.ClArray)
|
|
|
- 941 OR (cls
|
|
|
- 942 = SymTab.ClSet)
|
|
|
- 943 OR (cls
|
|
|
- 944 = SymTab.ClRecord)
|
|
|
- 945 OR (cls
|
|
|
- 946 = SymTab.ClClass) THEN
|
|
|
- 947 QbeGen.AddrOf(n, q)
|
|
|
- 948 ELSE SemError(230);
|
|
|
- 949 QbeGen.CopyOp("0", q)
|
|
|
- 950 END
|
|
|
- 951 ELSE QbeGen.CopyOp("0", q);
|
|
|
- 952 IF (k = SymTab.KindImport)
|
|
|
- 953 OR (k = SymTab.KindProc) THEN
|
|
|
- 954 SemError(230)
|
|
|
- 955 ELSE
|
|
|
- 956 IF k = SymTab.KindField THEN
|
|
|
- 957 IF QbeGen.TopWith(qb) THEN
|
|
|
- 958 fo :=
|
|
|
- 959 SymTab.FieldOffset(
|
|
|
- 960 SymTab.FieldOwner(n),
|
|
|
- 961 n);
|
|
|
- 962 QbeGen.FieldAddr(qb,
|
|
|
- 963 fo, q);
|
|
|
- 964 sfx := TRUE
|
|
|
- 965 ELSE SemError(230);
|
|
|
- 966 QbeGen.CopyOp("0", q)
|
|
|
- 967 END
|
|
|
- 968 END
|
|
|
- 969 END
|
|
|
- 970 END
|
|
|
- 971 END; .)
|
|
|
- 972 { "[" Expr<it, iq>
|
|
|
- 973 (. IF t = SymTab.InvalidType THEN
|
|
|
- 974 ELSIF SymTab.ClassOf(t) #
|
|
|
- 975 SymTab.ClArray THEN
|
|
|
- 976 SemError(217);
|
|
|
- 977 t := SymTab.InvalidType
|
|
|
- 978 ELSIF ~SymTab.IsIntFamily(it)
|
|
|
- 979 & (SymTab.ClassOf(it) #
|
|
|
- 980 SymTab.ClChar) THEN
|
|
|
- 981 SemError(218);
|
|
|
- 982 t := SymTab.InvalidType
|
|
|
- 983 ELSE
|
|
|
- 984 QbeGen.WidenIndex(iq, ql);
|
|
|
- 985 isOpen :=
|
|
|
- 986 SymTab.IsOpenArray(t);
|
|
|
- 987 IF isOpen THEN
|
|
|
- 988 QbeGen.CopyOp("0", qlo);
|
|
|
- 989 QbeGen.OpenHi(q, qhi)
|
|
|
- 990 ELSE
|
|
|
- 991 lo := SymTab.ArrayLo(t);
|
|
|
- 992 hi := SymTab.ArrayHi(t);
|
|
|
- 993 QbeGen.IntStr(lo, qlo);
|
|
|
- 994 QbeGen.IntStr(hi, qhi)
|
|
|
- 995 END;
|
|
|
- 996 QbeGen.CheckRange(ql, qlo,
|
|
|
- 997 qhi);
|
|
|
- 998 eT := SymTab.ArrayElem(t);
|
|
|
- 999 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
- 1000 t, qe);
|
|
|
- 1001 IF SymTab.ClassOf(eT) =
|
|
|
- 1002 SymTab.ClArray THEN
|
|
|
- 1003 QbeGen.ElemLoad(qe, eT, q)
|
|
|
- 1004 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 1005 END;
|
|
|
- 1006 t := eT; sfx := TRUE
|
|
|
- 1007 END; .)
|
|
|
- 1008 { "," Expr<it, iq>
|
|
|
- 1009 (. IF t = SymTab.InvalidType THEN
|
|
|
- 1010 ELSIF SymTab.ClassOf(t) #
|
|
|
- 1011 SymTab.ClArray THEN
|
|
|
- 1012 SemError(217);
|
|
|
- 1013 t := SymTab.InvalidType
|
|
|
- 1014 ELSIF ~SymTab.IsIntFamily(it)
|
|
|
- 1015 & (SymTab.ClassOf(it) #
|
|
|
- 1016 SymTab.ClChar) THEN
|
|
|
- 1017 SemError(218);
|
|
|
- 1018 t := SymTab.InvalidType
|
|
|
- 1019 ELSE
|
|
|
- 1020 QbeGen.WidenIndex(iq, ql);
|
|
|
- 1021 isOpen :=
|
|
|
- 1022 SymTab.IsOpenArray(t);
|
|
|
- 1023 IF isOpen THEN
|
|
|
- 1024 QbeGen.CopyOp("0", qlo);
|
|
|
- 1025 QbeGen.OpenHi(q, qhi)
|
|
|
- 1026 ELSE
|
|
|
- 1027 lo := SymTab.ArrayLo(t);
|
|
|
- 1028 hi := SymTab.ArrayHi(t);
|
|
|
- 1029 QbeGen.IntStr(lo, qlo);
|
|
|
- 1030 QbeGen.IntStr(hi, qhi)
|
|
|
- 1031 END;
|
|
|
- 1032 QbeGen.CheckRange(ql, qlo,
|
|
|
- 1033 qhi);
|
|
|
- 1034 eT := SymTab.ArrayElem(t);
|
|
|
- 1035 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
- 1036 t, qe);
|
|
|
- 1037 IF SymTab.ClassOf(eT) =
|
|
|
- 1038 SymTab.ClArray THEN
|
|
|
- 1039 QbeGen.ElemLoad(qe, eT, q)
|
|
|
- 1040 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 1041 END;
|
|
|
- 1042 t := eT; sfx := TRUE
|
|
|
- 1043 END; .) }
|
|
|
- 1044 "]"
|
|
|
- 1045 | "." GetIdent<fn>
|
|
|
- 1046 (. IF t = SymTab.InvalidType THEN
|
|
|
- 1047 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 1048 SymTab.ClRecord)
|
|
|
- 1049 & (SymTab.ClassOf(t) #
|
|
|
- 1050 SymTab.ClClass) THEN
|
|
|
- 1051 SemError(215);
|
|
|
- 1052 t := SymTab.InvalidType
|
|
|
- 1053 ELSIF ~SymTab.FieldExists(t,
|
|
|
- 1054 fn) THEN
|
|
|
- 1055 SemError(216);
|
|
|
- 1056 t := SymTab.InvalidType
|
|
|
- 1057 ELSE
|
|
|
- 1058 fo := SymTab.FieldOffset(t,
|
|
|
- 1059 fn);
|
|
|
- 1060 t := SymTab.FieldType(t, fn);
|
|
|
- 1061 QbeGen.FieldAddr(q, fo, qe);
|
|
|
- 1062 IF SymTab.ClassOf(t) =
|
|
|
- 1063 SymTab.ClArray THEN
|
|
|
- 1064 QbeGen.ElemLoad(qe, t, q)
|
|
|
- 1065 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 1066 END;
|
|
|
- 1067 sfx := TRUE
|
|
|
- 1068 END; .) } .
|
|
|
- 1069 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 1070 (. VAR t2: SymTab.TypeIndex;
|
|
|
- 1071 op: INTEGER;
|
|
|
- 1072 q2, qt: QbeGen.QVal;
|
|
|
- 1073 isR: BOOLEAN; .)
|
|
|
- 1074 = SimExpr<t, q>
|
|
|
- 1075 [ Rel<op> SimExpr<t2, q2>
|
|
|
- 1076 (. IF op = SymTab.OpIn THEN
|
|
|
- 1077 IF SymTab.InCheck(t, t2) THEN
|
|
|
- 1078 IF (t = SymTab.InvalidType)
|
|
|
- 1079 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 1080 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 1081 ELSE
|
|
|
- 1082 QbeGen.InSet(q, q2, SymTab.SetBaseLo(t2),
|
|
|
- 1083 SymTab.SetCount(t2), qt);
|
|
|
- 1084 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
- 1085 END
|
|
|
- 1086 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
- 1087 QbeGen.CopyOp("0", q)
|
|
|
- 1088 END
|
|
|
- 1089 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
- 1090 IF (t = SymTab.InvalidType)
|
|
|
- 1091 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 1092 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 1093 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 1094 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 1095 QbeGen.CmpSet(op, q, q2,
|
|
|
- 1096 SymTab.SetWords(t), SymTab.SetWords(t2), qt);
|
|
|
- 1097 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
- 1098 ELSE
|
|
|
- 1099 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 1100 t := SymTab.BoolType();
|
|
|
- 1101 QbeGen.Cmp(op, q, q2, qt, isR);
|
|
|
- 1102 QbeGen.CopyOp(qt, q)
|
|
|
- 1103 END
|
|
|
- 1104 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
- 1105 QbeGen.CopyOp("0", q)
|
|
|
- 1106 END; .) ] .
|
|
|
- 1107 Rel<VAR op: INTEGER>
|
|
|
- 1108 = "=" (. op := SymTab.OpEq; .)
|
|
|
- 1109 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
- 1110 | "<" (. op := SymTab.OpLt; .)
|
|
|
- 1111 | "<=" (. op := SymTab.OpLe; .)
|
|
|
- 1112 | ">" (. op := SymTab.OpGt; .)
|
|
|
- 1113 | ">=" (. op := SymTab.OpGe; .)
|
|
|
- 1114 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
- 1115 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 1116 (. VAR t2, res2: SymTab.TypeIndex;
|
|
|
- 1117 op: INTEGER;
|
|
|
- 1118 q2, qt: QbeGen.QVal;
|
|
|
- 1119 neg, isR: BOOLEAN;
|
|
|
- 1120 lw, rw, mw: CARDINAL; .)
|
|
|
- 1121 = (. neg := FALSE; .)
|
|
|
- 1122 [ "+" | "-" (. neg := TRUE; .) ]
|
|
|
- 1123 Term<t, q> (. IF neg THEN
|
|
|
- 1124 IF QbeGen.IsImm(q) THEN
|
|
|
- 1125 QbeGen.NegFold(q, q)
|
|
|
- 1126 ELSE QbeGen.NewTemp(qt);
|
|
|
- 1127 QbeGen.NegQ(q, qt,
|
|
|
- 1128 SymTab.ClassOf(t)
|
|
|
- 1129 = SymTab.ClReal);
|
|
|
- 1130 QbeGen.CopyOp(qt, q)
|
|
|
- 1131 END
|
|
|
- 1132 END; .)
|
|
|
- 1133 { AddOp<op> Term<t2, q2>
|
|
|
- 1134 (. IF op = SymTab.OpOr THEN
|
|
|
- 1135 IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
|
|
|
- 1136 t := SymTab.BoolType()
|
|
|
- 1137 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 1138 IF t # SymTab.InvalidType THEN
|
|
|
- 1139 QbeGen.NewTemp(qt);
|
|
|
- 1140 QbeGen.Op3("or", qt, q, q2, FALSE);
|
|
|
- 1141 QbeGen.CopyOp(qt, q)
|
|
|
- 1142 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 1143 END
|
|
|
- 1144 ELSIF (t # SymTab.InvalidType) & (t2 # SymTab.InvalidType)
|
|
|
- 1145 & (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 1146 & (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 1147 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 1148 mw := lw;
|
|
|
- 1149 IF rw > mw THEN mw := rw END;
|
|
|
- 1150 IF op = SymTab.OpAdd THEN
|
|
|
- 1151 QbeGen.SetBinOp(0, q, q2, lw, rw, qt)
|
|
|
- 1152 ELSE
|
|
|
- 1153 QbeGen.SetBinOp(2, q, q2, lw, rw, qt)
|
|
|
- 1154 END;
|
|
|
- 1155 t := SymTab.NewSet(
|
|
|
- 1156 SymTab.NewSubR(0,
|
|
|
- 1157 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 1158 QbeGen.CopyOp(qt, q)
|
|
|
- 1159 ELSE
|
|
|
- 1160 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
- 1161 t := res2
|
|
|
- 1162 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 1163 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 1164 IF t # SymTab.InvalidType THEN
|
|
|
- 1165 QbeGen.NewTemp(qt);
|
|
|
- 1166 IF op = SymTab.OpAdd THEN
|
|
|
- 1167 QbeGen.Op3("add", qt, q, q2, isR)
|
|
|
- 1168 ELSE
|
|
|
- 1169 QbeGen.Op3("sub", qt, q, q2, isR)
|
|
|
- 1170 END;
|
|
|
- 1171 QbeGen.CopyOp(qt, q)
|
|
|
- 1172 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 1173 END
|
|
|
- 1174 END; .) } .
|
|
|
- 1175 AddOp<VAR op: INTEGER>
|
|
|
- 1176 = "+" (. op := SymTab.OpAdd; .)
|
|
|
- 1177 | "-" (. op := SymTab.OpSub; .)
|
|
|
- 1178 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
- 1179 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 1180 (. VAR t2, res2: SymTab.TypeIndex;
|
|
|
- 1181 op: INTEGER;
|
|
|
- 1182 q2, qt: QbeGen.QVal;
|
|
|
- 1183 isR: BOOLEAN;
|
|
|
- 1184 lw, rw, mw: CARDINAL; .)
|
|
|
- 1185 = Fact<t, q> { MulOp<op> Fact<t2, q2>
|
|
|
- 1186 (. IF op = SymTab.OpAnd THEN
|
|
|
- 1187 IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
|
|
|
- 1188 t := SymTab.BoolType()
|
|
|
- 1189 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 1190 IF t # SymTab.InvalidType THEN
|
|
|
- 1191 QbeGen.NewTemp(qt);
|
|
|
- 1192 QbeGen.Op3("and", qt, q, q2, FALSE);
|
|
|
- 1193 QbeGen.CopyOp(qt, q)
|
|
|
- 1194 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 1195 END
|
|
|
- 1196 ELSIF (t # SymTab.InvalidType) & (t2 # SymTab.InvalidType)
|
|
|
- 1197 & (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 1198 & (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 1199 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 1200 mw := lw;
|
|
|
- 1201 IF rw > mw THEN mw := rw END;
|
|
|
- 1202 IF op = SymTab.OpTimes THEN
|
|
|
- 1203 QbeGen.SetBinOp(1, q, q2, lw, rw, qt)
|
|
|
- 1204 ELSE
|
|
|
- 1205 QbeGen.SetBinOp(3, q, q2, lw, rw, qt)
|
|
|
- 1206 END;
|
|
|
- 1207 t := SymTab.NewSet(
|
|
|
- 1208 SymTab.NewSubR(0,
|
|
|
- 1209 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 1210 QbeGen.CopyOp(qt, q)
|
|
|
- 1211 ELSE
|
|
|
- 1212 IF SymTab.ArithCheck(t, t2,
|
|
|
- 1213 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
- 1214 res2) THEN t := res2
|
|
|
- 1215 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 1216 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 1217 IF t # SymTab.InvalidType THEN
|
|
|
- 1218 QbeGen.NewTemp(qt);
|
|
|
- 1219 IF op = SymTab.OpTimes THEN
|
|
|
- 1220 QbeGen.Op3("mul", qt, q, q2, isR)
|
|
|
- 1221 ELSIF (op = SymTab.OpDiv)
|
|
|
- 1222 OR (op = SymTab.OpSlash) THEN
|
|
|
- 1223 QbeGen.Op3("div", qt, q, q2, isR)
|
|
|
- 1224 ELSE
|
|
|
- 1225 QbeGen.Op3("rem", qt, q, q2, isR)
|
|
|
- 1226 END;
|
|
|
- 1227 QbeGen.CopyOp(qt, q)
|
|
|
- 1228 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 1229 END
|
|
|
- 1230 END; .) } .
|
|
|
- 1231 MulOp<VAR op: INTEGER>
|
|
|
- 1232 = "*" (. op := SymTab.OpTimes; .)
|
|
|
- 1233 | "/" (. op := SymTab.OpSlash; .)
|
|
|
- 1234 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
- 1235 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
- 1236 | "AND" (. op := SymTab.OpAnd; .) .
|
|
|
- 1237 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 1238 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
- 1239 et, dt, t2, st: SymTab.TypeIndex;
|
|
|
- 1240 dk: INTEGER;
|
|
|
- 1241 qd, q2, sq: QbeGen.QVal;
|
|
|
- 1242 qn: SymTab.Name;
|
|
|
- 1243 sfx: BOOLEAN; .)
|
|
|
- 1244 = integer (. LexString(s);
|
|
|
- 1245 QbeGen.NormInt(s, q);
|
|
|
- 1246 t := SymTab.IntType(); .)
|
|
|
- 1247 | real (. LexString(s);
|
|
|
- 1248 QbeGen.NormReal(s, q);
|
|
|
- 1249 t := SymTab.RealType(); .)
|
|
|
- 1250 | string (. LexString(s);
|
|
|
- 1251 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 1252 t := SymTab.CharType();
|
|
|
- 1253 QbeGen.IntStr(
|
|
|
- 1254 QbeGen.CharVal(s), q)
|
|
|
- 1255 ELSE t := SymTab.NewStr();
|
|
|
- 1256 QbeGen.DeclStr(s, q)
|
|
|
- 1257 END; .)
|
|
|
- 1258 | Design<dt, dk, qd, qn, sfx> (. t := dt;
|
|
|
- 1259 IF sfx THEN
|
|
|
- 1260 IF dt =
|
|
|
- 1261 SymTab.InvalidType THEN
|
|
|
- 1262 QbeGen.CopyOp("0", q)
|
|
|
- 1263 ELSIF (SymTab.ClassOf(dt) =
|
|
|
- 1264 SymTab.ClRecord)
|
|
|
- 1265 OR (SymTab.ClassOf(dt) =
|
|
|
- 1266 SymTab.ClSet)
|
|
|
- 1267 OR (SymTab.ClassOf(dt) =
|
|
|
- 1268 SymTab.ClClass) THEN
|
|
|
- 1269 QbeGen.CopyOp(qd, q)
|
|
|
- 1270 ELSE QbeGen.ElemLoad(qd, dt,
|
|
|
- 1271 q)
|
|
|
- 1272 END
|
|
|
- 1273 ELSE QbeGen.CopyOp(qd, q)
|
|
|
- 1274 END; .)
|
|
|
- 1275 | "(" Expr<et, q> ")" (. t := et; .)
|
|
|
- 1276 | SetLit<st, sq> (. t := st;
|
|
|
- 1277 QbeGen.CopyOp(sq, q); .)
|
|
|
- 1278 | "NOT" Fact<t2, q2> (. IF SymTab.BoolCheck(t2) THEN
|
|
|
- 1279 t := SymTab.BoolType()
|
|
|
- 1280 ELSE SemError(212);
|
|
|
- 1281 t := SymTab.InvalidType END;
|
|
|
- 1282 IF t # SymTab.InvalidType THEN
|
|
|
- 1283 QbeGen.NotQ(q2, q)
|
|
|
- 1284 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 1285 END; .) .
|
|
|
- 1286 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
- 1287 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
- 1288 for computed elements. Ranges always lower via SetRange. *)
|
|
|
- 1289 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 1290 = "{" (. t := SymTab.NewSet(
|
|
|
- 1291 SymTab.NewSubR(0, 255));
|
|
|
- 1292 QbeGen.NewSetTemp(8, q);
|
|
|
- 1293 QbeGen.SetZero(q, 8); .)
|
|
|
- 1294 [ SetElem<t, q> { "," SetElem<t, q> } ]
|
|
|
- 1295 "}" .
|
|
|
- 1296 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 1297 qe, q2: QbeGen.QVal;
|
|
|
- 1298 v, v2: INTEGER;
|
|
|
- 1299 lo: INTEGER;
|
|
|
- 1300 span: CARDINAL;
|
|
|
- 1301 cl, cl2: INTEGER;
|
|
|
- 1302 hasR: BOOLEAN; .)
|
|
|
- 1303 = (. hasR := FALSE; .)
|
|
|
- 1304 Expr<et, qe>
|
|
|
- 1305 [ ".." Expr<et2, q2> (. hasR := TRUE; .) ]
|
|
|
- 1306 (. lo := SymTab.SetBaseLo(st);
|
|
|
- 1307 span := SymTab.SetCount(st);
|
|
|
- 1308 IF (et = SymTab.InvalidType)
|
|
|
- 1309 OR (hasR & (et2 =
|
|
|
- 1310 SymTab.InvalidType)) THEN
|
|
|
- 1311 ELSE cl :=
|
|
|
- 1312 SymTab.ClassOf(et);
|
|
|
- 1313 IF hasR THEN
|
|
|
- 1314 cl2 :=
|
|
|
- 1315 SymTab.ClassOf(et2)
|
|
|
- 1316 ELSE cl2 := SymTab.ClInt
|
|
|
- 1317 END;
|
|
|
- 1318 IF ((cl # SymTab.ClInt)
|
|
|
- 1319 & (cl # SymTab.ClChar)
|
|
|
- 1320 & (cl # SymTab.ClBool))
|
|
|
- 1321 OR (hasR &
|
|
|
- 1322 ((cl2
|
|
|
- 1323 # SymTab.ClInt)
|
|
|
- 1324 & (cl2
|
|
|
- 1325 # SymTab.ClChar)
|
|
|
- 1326 & (cl2
|
|
|
- 1327 # SymTab.ClBool))) THEN
|
|
|
- 1328 SemError(222)
|
|
|
- 1329 ELSIF hasR
|
|
|
- 1330 & SymTab.ConstInt(qe, v)
|
|
|
- 1331 & SymTab.ConstInt(q2,
|
|
|
- 1332 v2)
|
|
|
- 1333 & ((v < lo)
|
|
|
- 1334 OR (v2 < lo)
|
|
|
- 1335 OR (v >= lo +
|
|
|
- 1336 VAL(INTEGER, span))
|
|
|
- 1337 OR (v2 >= lo +
|
|
|
- 1338 VAL(INTEGER, span))
|
|
|
- 1339 OR (v > v2)) THEN
|
|
|
- 1340 SemError(222)
|
|
|
- 1341 ELSIF hasR THEN
|
|
|
- 1342 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 1343 lo, span)
|
|
|
- 1344 ELSIF SymTab.ConstInt(qe,
|
|
|
- 1345 v)
|
|
|
- 1346 & ((v < lo)
|
|
|
- 1347 OR (v >= lo +
|
|
|
- 1348 VAL(INTEGER,
|
|
|
- 1349 span))) THEN
|
|
|
- 1350 SemError(222)
|
|
|
- 1351 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 1352 lo, span)
|
|
|
- 1353 END
|
|
|
- 1354 END; .) .
|
|
|
- 1355 GetIdent<VAR n: SymTab.Name>
|
|
|
- 1356 = ident (. LexName(n); .) .
|
|
|
- 1357
|
|
|
- 1358 END M2.
|
|
|
+ 885 lNext: QbeGen.QVal; .)
|
|
|
+ 886 = Expr<t2, q2> (. IF (t2 #
|
|
|
+ 887 SymTab.InvalidType)
|
|
|
+ 888 & (tsel #
|
|
|
+ 889 SymTab.InvalidType)
|
|
|
+ 890 & ((SymTab.ClassOf(t2) =
|
|
|
+ 891 SymTab.ClSet)
|
|
|
+ 892 OR (SymTab.ClassOf(tsel) =
|
|
|
+ 893 SymTab.ClSet)) THEN
|
|
|
+ 894 SemError(230)
|
|
|
+ 895 ELSIF (t2 #
|
|
|
+ 896 SymTab.InvalidType)
|
|
|
+ 897 & (tsel #
|
|
|
+ 898 SymTab.InvalidType)
|
|
|
+ 899 & ~SymTab.EqCheck(t2,
|
|
|
+ 900 tsel) THEN
|
|
|
+ 901 SemError(213) END;
|
|
|
+ 902 IF ~QbeGen.IsImm(q2) THEN
|
|
|
+ 903 SemError(230);
|
|
|
+ 904 QbeGen.CopyOp("0", q2)
|
|
|
+ 905 END;
|
|
|
+ 906 QbeGen.NewLabel(lNext);
|
|
|
+ 907 QbeGen.Cmp(SymTab.OpEq,
|
|
|
+ 908 qsel, q2, qc, FALSE);
|
|
|
+ 909 QbeGen.Jnz(qc, lBody, lNext);
|
|
|
+ 910 QbeGen.EmitLabel(lNext); .)
|
|
|
+ 911 [ ".." Expr<t3, q3> (. IF (t3 #
|
|
|
+ 912 SymTab.InvalidType)
|
|
|
+ 913 & (tsel #
|
|
|
+ 914 SymTab.InvalidType)
|
|
|
+ 915 & ~SymTab.EqCheck(t3,
|
|
|
+ 916 tsel) THEN
|
|
|
+ 917 SemError(213) END;
|
|
|
+ 918 IF ~QbeGen.IsImm(q3) THEN
|
|
|
+ 919 SemError(230);
|
|
|
+ 920 QbeGen.CopyOp("0", q3)
|
|
|
+ 921 END;
|
|
|
+ 922 QbeGen.Cmp(SymTab.OpGe,
|
|
|
+ 923 qsel, q2, qc, FALSE);
|
|
|
+ 924 QbeGen.Cmp(SymTab.OpLe,
|
|
|
+ 925 qsel, q3, qd, FALSE);
|
|
|
+ 926 QbeGen.NewTemp(qe);
|
|
|
+ 927 QbeGen.Op3("and", qe, qc, qd,
|
|
|
+ 928 FALSE);
|
|
|
+ 929 QbeGen.NewLabel(lNext);
|
|
|
+ 930 QbeGen.Jnz(qe, lBody, lNext);
|
|
|
+ 931 QbeGen.EmitLabel(lNext); .) ] .
|
|
|
+ 932 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 933 q: QbeGen.QVal;
|
|
|
+ 934 res: SymTab.TypeIndex;
|
|
|
+ 935 hadE: BOOLEAN; .)
|
|
|
+ 936 = "RETURN" (. hadE := FALSE; .)
|
|
|
+ 937 [ Expr<t, q> (. hadE := TRUE; .) ]
|
|
|
+ 938 (. IF ~SymTab.InProc() THEN
|
|
|
+ 939 SemError(232)
|
|
|
+ 940 ELSE res := SymTab.CurRes();
|
|
|
+ 941 IF ~hadE THEN
|
|
|
+ 942 IF res #
|
|
|
+ 943 SymTab.InvalidType THEN
|
|
|
+ 944 SemError(232) END
|
|
|
+ 945 ELSIF (res =
|
|
|
+ 946 SymTab.InvalidType)
|
|
|
+ 947 OR (t #
|
|
|
+ 948 SymTab.InvalidType)
|
|
|
+ 949 & ~SymTab.Assignable(t,
|
|
|
+ 950 res) THEN
|
|
|
+ 951 SemError(232)
|
|
|
+ 952 END
|
|
|
+ 953 END; .) .
|
|
|
+ 954 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
+ 955 Each index descends one level (bounds-checked, trap on breach);
|
|
|
+ 956 nested levels reload the inner descriptor address. q ends as the
|
|
|
+ 957 value (scalars), the descriptor address (plain arrays), or the
|
|
|
+ 958 element address (indexed); sfx marks the indexed form. *)
|
|
|
+ 959 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
+ 960 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
+ 961 (. VAR n, fn: SymTab.Name;
|
|
|
+ 962 cls: INTEGER;
|
|
|
+ 963 curT, it, eT, bt:
|
|
|
+ 964 SymTab.TypeIndex;
|
|
|
+ 965 iq, ql, qlo, qhi, qe:
|
|
|
+ 966 QbeGen.QVal;
|
|
|
+ 967 lo, hi: INTEGER;
|
|
|
+ 968 fo: INTEGER;
|
|
|
+ 969 isOpen: BOOLEAN;
|
|
|
+ 970 qb: QbeGen.QVal; .)
|
|
|
+ 971 = GetIdent<n> (. QbeGen.CopyOp(n, qn);
|
|
|
+ 972 sfx := FALSE;
|
|
|
+ 973 IF ~SymTab.Lookup(n) THEN
|
|
|
+ 974 SemError(201);
|
|
|
+ 975 t := SymTab.InvalidType;
|
|
|
+ 976 k := -1;
|
|
|
+ 977 QbeGen.CopyOp("0", q)
|
|
|
+ 978 ELSE
|
|
|
+ 979 t := SymTab.SymType(n);
|
|
|
+ 980 k := SymTab.SymKind(n);
|
|
|
+ 981 IF k = SymTab.KindConst THEN
|
|
|
+ 982 IF SymTab.Equal(n,
|
|
|
+ 983 "TRUE") THEN
|
|
|
+ 984 t := SymTab.BoolType();
|
|
|
+ 985 QbeGen.CopyOp("1", q)
|
|
|
+ 986 ELSIF SymTab.Equal(n,
|
|
|
+ 987 "FALSE") THEN
|
|
|
+ 988 t := SymTab.BoolType();
|
|
|
+ 989 QbeGen.CopyOp("0", q)
|
|
|
+ 990 ELSIF SymTab.Equal(n,
|
|
|
+ 991 "NIL") THEN
|
|
|
+ 992 QbeGen.CopyOp("0", q)
|
|
|
+ 993 ELSE
|
|
|
+ 994 cls :=
|
|
|
+ 995 SymTab.ClassOf(t);
|
|
|
+ 996 IF (t #
|
|
|
+ 997 SymTab.InvalidType)
|
|
|
+ 998 & ((cls = SymTab.ClInt)
|
|
|
+ 999 OR (cls
|
|
|
+ 1000 = SymTab.ClChar)
|
|
|
+ 1001 OR (cls
|
|
|
+ 1002 = SymTab.ClReal)
|
|
|
+ 1003 OR (cls
|
|
|
+ 1004 = SymTab.ClNil)) THEN
|
|
|
+ 1005 IF cls = SymTab.ClNil THEN
|
|
|
+ 1006 QbeGen.CopyOp("0", q)
|
|
|
+ 1007 ELSE
|
|
|
+ 1008 QbeGen.LoadVar(n,
|
|
|
+ 1009 cls = SymTab.ClReal,
|
|
|
+ 1010 q)
|
|
|
+ 1011 END
|
|
|
+ 1012 ELSE
|
|
|
+ 1013 IF t #
|
|
|
+ 1014 SymTab.InvalidType THEN
|
|
|
+ 1015 SemError(230)
|
|
|
+ 1016 END;
|
|
|
+ 1017 QbeGen.CopyOp("0", q)
|
|
|
+ 1018 END
|
|
|
+ 1019 END
|
|
|
+ 1020 ELSIF (k = SymTab.KindVar)
|
|
|
+ 1021 OR (k = SymTab.KindParam) THEN
|
|
|
+ 1022 cls :=
|
|
|
+ 1023 SymTab.ClassOf(t);
|
|
|
+ 1024 IF (cls = SymTab.ClInt)
|
|
|
+ 1025 OR (cls = SymTab.ClBool)
|
|
|
+ 1026 OR (cls = SymTab.ClChar)
|
|
|
+ 1027 OR (cls
|
|
|
+ 1028 = SymTab.ClReal) THEN
|
|
|
+ 1029 QbeGen.LoadVar(n,
|
|
|
+ 1030 cls = SymTab.ClReal, q)
|
|
|
+ 1031 ELSIF cls = SymTab.ClPtr THEN
|
|
|
+ 1032 QbeGen.LoadPtr(n, q)
|
|
|
+ 1033 ELSIF (cls
|
|
|
+ 1034 = SymTab.ClArray)
|
|
|
+ 1035 OR (cls
|
|
|
+ 1036 = SymTab.ClSet)
|
|
|
+ 1037 OR (cls
|
|
|
+ 1038 = SymTab.ClRecord)
|
|
|
+ 1039 OR (cls
|
|
|
+ 1040 = SymTab.ClClass) THEN
|
|
|
+ 1041 QbeGen.AddrOf(n, q)
|
|
|
+ 1042 ELSE SemError(230);
|
|
|
+ 1043 QbeGen.CopyOp("0", q)
|
|
|
+ 1044 END
|
|
|
+ 1045 ELSE QbeGen.CopyOp("0", q);
|
|
|
+ 1046 IF (k = SymTab.KindImport)
|
|
|
+ 1047 OR (k = SymTab.KindProc) THEN
|
|
|
+ 1048 SemError(230)
|
|
|
+ 1049 ELSE
|
|
|
+ 1050 IF k = SymTab.KindField THEN
|
|
|
+ 1051 IF QbeGen.TopWith(qb) THEN
|
|
|
+ 1052 fo :=
|
|
|
+ 1053 SymTab.FieldOffset(
|
|
|
+ 1054 SymTab.FieldOwner(n),
|
|
|
+ 1055 n);
|
|
|
+ 1056 QbeGen.FieldAddr(qb,
|
|
|
+ 1057 fo, q);
|
|
|
+ 1058 sfx := TRUE
|
|
|
+ 1059 ELSE SemError(230);
|
|
|
+ 1060 QbeGen.CopyOp("0", q)
|
|
|
+ 1061 END
|
|
|
+ 1062 END
|
|
|
+ 1063 END
|
|
|
+ 1064 END
|
|
|
+ 1065 END; .)
|
|
|
+ 1066 { "[" Expr<it, iq>
|
|
|
+ 1067 (. IF t = SymTab.InvalidType THEN
|
|
|
+ 1068 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 1069 SymTab.ClArray THEN
|
|
|
+ 1070 SemError(217);
|
|
|
+ 1071 t := SymTab.InvalidType
|
|
|
+ 1072 ELSIF ~SymTab.IsIntFamily(it)
|
|
|
+ 1073 & (SymTab.ClassOf(it) #
|
|
|
+ 1074 SymTab.ClChar) THEN
|
|
|
+ 1075 SemError(218);
|
|
|
+ 1076 t := SymTab.InvalidType
|
|
|
+ 1077 ELSE
|
|
|
+ 1078 QbeGen.WidenIndex(iq, ql);
|
|
|
+ 1079 isOpen :=
|
|
|
+ 1080 SymTab.IsOpenArray(t);
|
|
|
+ 1081 IF isOpen THEN
|
|
|
+ 1082 QbeGen.CopyOp("0", qlo);
|
|
|
+ 1083 QbeGen.OpenHi(q, qhi)
|
|
|
+ 1084 ELSE
|
|
|
+ 1085 lo := SymTab.ArrayLo(t);
|
|
|
+ 1086 hi := SymTab.ArrayHi(t);
|
|
|
+ 1087 QbeGen.IntStr(lo, qlo);
|
|
|
+ 1088 QbeGen.IntStr(hi, qhi)
|
|
|
+ 1089 END;
|
|
|
+ 1090 QbeGen.CheckRange(ql, qlo,
|
|
|
+ 1091 qhi);
|
|
|
+ 1092 eT := SymTab.ArrayElem(t);
|
|
|
+ 1093 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
+ 1094 t, qe);
|
|
|
+ 1095 IF SymTab.ClassOf(eT) =
|
|
|
+ 1096 SymTab.ClArray THEN
|
|
|
+ 1097 QbeGen.ElemLoad(qe, eT, q)
|
|
|
+ 1098 ELSE QbeGen.CopyOp(qe, q)
|
|
|
+ 1099 END;
|
|
|
+ 1100 t := eT; sfx := TRUE
|
|
|
+ 1101 END; .)
|
|
|
+ 1102 { "," Expr<it, iq>
|
|
|
+ 1103 (. IF t = SymTab.InvalidType THEN
|
|
|
+ 1104 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 1105 SymTab.ClArray THEN
|
|
|
+ 1106 SemError(217);
|
|
|
+ 1107 t := SymTab.InvalidType
|
|
|
+ 1108 ELSIF ~SymTab.IsIntFamily(it)
|
|
|
+ 1109 & (SymTab.ClassOf(it) #
|
|
|
+ 1110 SymTab.ClChar) THEN
|
|
|
+ 1111 SemError(218);
|
|
|
+ 1112 t := SymTab.InvalidType
|
|
|
+ 1113 ELSE
|
|
|
+ 1114 QbeGen.WidenIndex(iq, ql);
|
|
|
+ 1115 isOpen :=
|
|
|
+ 1116 SymTab.IsOpenArray(t);
|
|
|
+ 1117 IF isOpen THEN
|
|
|
+ 1118 QbeGen.CopyOp("0", qlo);
|
|
|
+ 1119 QbeGen.OpenHi(q, qhi)
|
|
|
+ 1120 ELSE
|
|
|
+ 1121 lo := SymTab.ArrayLo(t);
|
|
|
+ 1122 hi := SymTab.ArrayHi(t);
|
|
|
+ 1123 QbeGen.IntStr(lo, qlo);
|
|
|
+ 1124 QbeGen.IntStr(hi, qhi)
|
|
|
+ 1125 END;
|
|
|
+ 1126 QbeGen.CheckRange(ql, qlo,
|
|
|
+ 1127 qhi);
|
|
|
+ 1128 eT := SymTab.ArrayElem(t);
|
|
|
+ 1129 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
+ 1130 t, qe);
|
|
|
+ 1131 IF SymTab.ClassOf(eT) =
|
|
|
+ 1132 SymTab.ClArray THEN
|
|
|
+ 1133 QbeGen.ElemLoad(qe, eT, q)
|
|
|
+ 1134 ELSE QbeGen.CopyOp(qe, q)
|
|
|
+ 1135 END;
|
|
|
+ 1136 t := eT; sfx := TRUE
|
|
|
+ 1137 END; .) }
|
|
|
+ 1138 "]"
|
|
|
+ 1139 | "." GetIdent<fn>
|
|
|
+ 1140 (. IF t = SymTab.InvalidType THEN
|
|
|
+ 1141 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 1142 SymTab.ClRecord)
|
|
|
+ 1143 & (SymTab.ClassOf(t) #
|
|
|
+ 1144 SymTab.ClClass) THEN
|
|
|
+ 1145 SemError(215);
|
|
|
+ 1146 t := SymTab.InvalidType
|
|
|
+ 1147 ELSIF ~SymTab.FieldExists(t,
|
|
|
+ 1148 fn) THEN
|
|
|
+ 1149 SemError(216);
|
|
|
+ 1150 t := SymTab.InvalidType
|
|
|
+ 1151 ELSE
|
|
|
+ 1152 fo := SymTab.FieldOffset(t,
|
|
|
+ 1153 fn);
|
|
|
+ 1154 t := SymTab.FieldType(t, fn);
|
|
|
+ 1155 QbeGen.FieldAddr(q, fo, qe);
|
|
|
+ 1156 IF SymTab.ClassOf(t) =
|
|
|
+ 1157 SymTab.ClArray THEN
|
|
|
+ 1158 QbeGen.ElemLoad(qe, t, q)
|
|
|
+ 1159 ELSE QbeGen.CopyOp(qe, q)
|
|
|
+ 1160 END;
|
|
|
+ 1161 sfx := TRUE
|
|
|
+ 1162 END; .)
|
|
|
+ 1163 | "^"
|
|
|
+ 1164 (. IF t = SymTab.InvalidType THEN
|
|
|
+ 1165 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 1166 SymTab.ClPtr THEN
|
|
|
+ 1167 SemError(219);
|
|
|
+ 1168 t := SymTab.InvalidType
|
|
|
+ 1169 ELSE
|
|
|
+ 1170 bt := SymTab.PtrBase(t);
|
|
|
+ 1171 IF bt = SymTab.InvalidType THEN
|
|
|
+ 1172 ELSE
|
|
|
+ 1173 IF sfx THEN
|
|
|
+ 1174 QbeGen.ElemLoad(q, t,
|
|
|
+ 1175 qb);
|
|
|
+ 1176 QbeGen.CopyOp(qb, q)
|
|
|
+ 1177 END;
|
|
|
+ 1178 t := bt;
|
|
|
+ 1179 IF (SymTab.ClassOf(bt) =
|
|
|
+ 1180 SymTab.ClInt)
|
|
|
+ 1181 OR (SymTab.ClassOf(bt) =
|
|
|
+ 1182 SymTab.ClBool)
|
|
|
+ 1183 OR (SymTab.ClassOf(bt) =
|
|
|
+ 1184 SymTab.ClChar)
|
|
|
+ 1185 OR (SymTab.ClassOf(bt) =
|
|
|
+ 1186 SymTab.ClReal) THEN
|
|
|
+ 1187 sfx := TRUE
|
|
|
+ 1188 ELSE sfx := FALSE
|
|
|
+ 1189 END
|
|
|
+ 1190 END
|
|
|
+ 1191 END; .) } .
|
|
|
+ 1192 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 1193 (. VAR t2: SymTab.TypeIndex;
|
|
|
+ 1194 op: INTEGER;
|
|
|
+ 1195 q2, qt: QbeGen.QVal;
|
|
|
+ 1196 isR: BOOLEAN; .)
|
|
|
+ 1197 = SimExpr<t, q>
|
|
|
+ 1198 [ Rel<op> SimExpr<t2, q2>
|
|
|
+ 1199 (. IF op = SymTab.OpIn THEN
|
|
|
+ 1200 IF SymTab.InCheck(t, t2) THEN
|
|
|
+ 1201 IF (t = SymTab.InvalidType)
|
|
|
+ 1202 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 1203 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 1204 ELSE
|
|
|
+ 1205 QbeGen.InSet(q, q2, SymTab.SetBaseLo(t2),
|
|
|
+ 1206 SymTab.SetCount(t2), qt);
|
|
|
+ 1207 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
+ 1208 END
|
|
|
+ 1209 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
+ 1210 QbeGen.CopyOp("0", q)
|
|
|
+ 1211 END
|
|
|
+ 1212 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
+ 1213 IF (t = SymTab.InvalidType)
|
|
|
+ 1214 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 1215 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 1216 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
+ 1217 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
+ 1218 IF (op # SymTab.OpEq) & (op # SymTab.OpNeq1)
|
|
|
+ 1219 & (op # SymTab.OpNeq2) THEN
|
|
|
+ 1220 SemError(213); t := SymTab.InvalidType;
|
|
|
+ 1221 QbeGen.CopyOp("0", q)
|
|
|
+ 1222 ELSE
|
|
|
+ 1223 QbeGen.CmpL(op, q, q2, qt);
|
|
|
+ 1224 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
+ 1225 END
|
|
|
+ 1226 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 1227 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 1228 QbeGen.CmpSet(op, q, q2,
|
|
|
+ 1229 SymTab.SetWords(t), SymTab.SetWords(t2), qt);
|
|
|
+ 1230 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
+ 1231 ELSE
|
|
|
+ 1232 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 1233 t := SymTab.BoolType();
|
|
|
+ 1234 QbeGen.Cmp(op, q, q2, qt, isR);
|
|
|
+ 1235 QbeGen.CopyOp(qt, q)
|
|
|
+ 1236 END
|
|
|
+ 1237 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
+ 1238 QbeGen.CopyOp("0", q)
|
|
|
+ 1239 END; .) ] .
|
|
|
+ 1240 Rel<VAR op: INTEGER>
|
|
|
+ 1241 = "=" (. op := SymTab.OpEq; .)
|
|
|
+ 1242 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
+ 1243 | "<" (. op := SymTab.OpLt; .)
|
|
|
+ 1244 | "<=" (. op := SymTab.OpLe; .)
|
|
|
+ 1245 | ">" (. op := SymTab.OpGt; .)
|
|
|
+ 1246 | ">=" (. op := SymTab.OpGe; .)
|
|
|
+ 1247 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
+ 1248 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 1249 (. VAR t2, res2: SymTab.TypeIndex;
|
|
|
+ 1250 op: INTEGER;
|
|
|
+ 1251 q2, qt: QbeGen.QVal;
|
|
|
+ 1252 neg, isR: BOOLEAN;
|
|
|
+ 1253 lw, rw, mw: CARDINAL; .)
|
|
|
+ 1254 = (. neg := FALSE; .)
|
|
|
+ 1255 [ "+" | "-" (. neg := TRUE; .) ]
|
|
|
+ 1256 Term<t, q> (. IF neg THEN
|
|
|
+ 1257 IF QbeGen.IsImm(q) THEN
|
|
|
+ 1258 QbeGen.NegFold(q, q)
|
|
|
+ 1259 ELSE QbeGen.NewTemp(qt);
|
|
|
+ 1260 QbeGen.NegQ(q, qt,
|
|
|
+ 1261 SymTab.ClassOf(t)
|
|
|
+ 1262 = SymTab.ClReal);
|
|
|
+ 1263 QbeGen.CopyOp(qt, q)
|
|
|
+ 1264 END
|
|
|
+ 1265 END; .)
|
|
|
+ 1266 { AddOp<op> Term<t2, q2>
|
|
|
+ 1267 (. IF op = SymTab.OpOr THEN
|
|
|
+ 1268 IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
|
|
|
+ 1269 t := SymTab.BoolType()
|
|
|
+ 1270 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 1271 IF t # SymTab.InvalidType THEN
|
|
|
+ 1272 QbeGen.NewTemp(qt);
|
|
|
+ 1273 QbeGen.Op3("or", qt, q, q2, FALSE);
|
|
|
+ 1274 QbeGen.CopyOp(qt, q)
|
|
|
+ 1275 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 1276 END
|
|
|
+ 1277 ELSIF (t # SymTab.InvalidType) & (t2 # SymTab.InvalidType)
|
|
|
+ 1278 & (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 1279 & (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 1280 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 1281 mw := lw;
|
|
|
+ 1282 IF rw > mw THEN mw := rw END;
|
|
|
+ 1283 IF op = SymTab.OpAdd THEN
|
|
|
+ 1284 QbeGen.SetBinOp(0, q, q2, lw, rw, qt)
|
|
|
+ 1285 ELSE
|
|
|
+ 1286 QbeGen.SetBinOp(2, q, q2, lw, rw, qt)
|
|
|
+ 1287 END;
|
|
|
+ 1288 t := SymTab.NewSet(
|
|
|
+ 1289 SymTab.NewSubR(0,
|
|
|
+ 1290 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 1291 QbeGen.CopyOp(qt, q)
|
|
|
+ 1292 ELSE
|
|
|
+ 1293 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
+ 1294 t := res2
|
|
|
+ 1295 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 1296 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 1297 IF t # SymTab.InvalidType THEN
|
|
|
+ 1298 QbeGen.NewTemp(qt);
|
|
|
+ 1299 IF op = SymTab.OpAdd THEN
|
|
|
+ 1300 QbeGen.Op3("add", qt, q, q2, isR)
|
|
|
+ 1301 ELSE
|
|
|
+ 1302 QbeGen.Op3("sub", qt, q, q2, isR)
|
|
|
+ 1303 END;
|
|
|
+ 1304 QbeGen.CopyOp(qt, q)
|
|
|
+ 1305 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 1306 END
|
|
|
+ 1307 END; .) } .
|
|
|
+ 1308 AddOp<VAR op: INTEGER>
|
|
|
+ 1309 = "+" (. op := SymTab.OpAdd; .)
|
|
|
+ 1310 | "-" (. op := SymTab.OpSub; .)
|
|
|
+ 1311 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
+ 1312 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 1313 (. VAR t2, res2: SymTab.TypeIndex;
|
|
|
+ 1314 op: INTEGER;
|
|
|
+ 1315 q2, qt: QbeGen.QVal;
|
|
|
+ 1316 isR: BOOLEAN;
|
|
|
+ 1317 lw, rw, mw: CARDINAL; .)
|
|
|
+ 1318 = Fact<t, q> { MulOp<op> Fact<t2, q2>
|
|
|
+ 1319 (. IF op = SymTab.OpAnd THEN
|
|
|
+ 1320 IF SymTab.BoolCheck(t) & SymTab.BoolCheck(t2) THEN
|
|
|
+ 1321 t := SymTab.BoolType()
|
|
|
+ 1322 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 1323 IF t # SymTab.InvalidType THEN
|
|
|
+ 1324 QbeGen.NewTemp(qt);
|
|
|
+ 1325 QbeGen.Op3("and", qt, q, q2, FALSE);
|
|
|
+ 1326 QbeGen.CopyOp(qt, q)
|
|
|
+ 1327 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 1328 END
|
|
|
+ 1329 ELSIF (t # SymTab.InvalidType) & (t2 # SymTab.InvalidType)
|
|
|
+ 1330 & (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 1331 & (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 1332 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 1333 mw := lw;
|
|
|
+ 1334 IF rw > mw THEN mw := rw END;
|
|
|
+ 1335 IF op = SymTab.OpTimes THEN
|
|
|
+ 1336 QbeGen.SetBinOp(1, q, q2, lw, rw, qt)
|
|
|
+ 1337 ELSE
|
|
|
+ 1338 QbeGen.SetBinOp(3, q, q2, lw, rw, qt)
|
|
|
+ 1339 END;
|
|
|
+ 1340 t := SymTab.NewSet(
|
|
|
+ 1341 SymTab.NewSubR(0,
|
|
|
+ 1342 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 1343 QbeGen.CopyOp(qt, q)
|
|
|
+ 1344 ELSE
|
|
|
+ 1345 IF SymTab.ArithCheck(t, t2,
|
|
|
+ 1346 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
+ 1347 res2) THEN t := res2
|
|
|
+ 1348 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 1349 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 1350 IF t # SymTab.InvalidType THEN
|
|
|
+ 1351 QbeGen.NewTemp(qt);
|
|
|
+ 1352 IF op = SymTab.OpTimes THEN
|
|
|
+ 1353 QbeGen.Op3("mul", qt, q, q2, isR)
|
|
|
+ 1354 ELSIF (op = SymTab.OpDiv)
|
|
|
+ 1355 OR (op = SymTab.OpSlash) THEN
|
|
|
+ 1356 QbeGen.Op3("div", qt, q, q2, isR)
|
|
|
+ 1357 ELSE
|
|
|
+ 1358 QbeGen.Op3("rem", qt, q, q2, isR)
|
|
|
+ 1359 END;
|
|
|
+ 1360 QbeGen.CopyOp(qt, q)
|
|
|
+ 1361 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 1362 END
|
|
|
+ 1363 END; .) } .
|
|
|
+ 1364 MulOp<VAR op: INTEGER>
|
|
|
+ 1365 = "*" (. op := SymTab.OpTimes; .)
|
|
|
+ 1366 | "/" (. op := SymTab.OpSlash; .)
|
|
|
+ 1367 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
+ 1368 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
+ 1369 | "AND" (. op := SymTab.OpAnd; .) .
|
|
|
+ 1370 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 1371 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
+ 1372 et, dt, t2, st: SymTab.TypeIndex;
|
|
|
+ 1373 dk: INTEGER;
|
|
|
+ 1374 qd, q2, sq: QbeGen.QVal;
|
|
|
+ 1375 qn: SymTab.Name;
|
|
|
+ 1376 sfx: BOOLEAN; .)
|
|
|
+ 1377 = integer (. LexString(s);
|
|
|
+ 1378 QbeGen.NormInt(s, q);
|
|
|
+ 1379 t := SymTab.IntType(); .)
|
|
|
+ 1380 | real (. LexString(s);
|
|
|
+ 1381 QbeGen.NormReal(s, q);
|
|
|
+ 1382 t := SymTab.RealType(); .)
|
|
|
+ 1383 | string (. LexString(s);
|
|
|
+ 1384 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 1385 t := SymTab.CharType();
|
|
|
+ 1386 QbeGen.IntStr(
|
|
|
+ 1387 QbeGen.CharVal(s), q)
|
|
|
+ 1388 ELSE t := SymTab.NewStr();
|
|
|
+ 1389 QbeGen.DeclStr(s, q)
|
|
|
+ 1390 END; .)
|
|
|
+ 1391 | Design<dt, dk, qd, qn, sfx> (. t := dt;
|
|
|
+ 1392 IF sfx THEN
|
|
|
+ 1393 IF dt =
|
|
|
+ 1394 SymTab.InvalidType THEN
|
|
|
+ 1395 QbeGen.CopyOp("0", q)
|
|
|
+ 1396 ELSIF (SymTab.ClassOf(dt) =
|
|
|
+ 1397 SymTab.ClRecord)
|
|
|
+ 1398 OR (SymTab.ClassOf(dt) =
|
|
|
+ 1399 SymTab.ClSet)
|
|
|
+ 1400 OR (SymTab.ClassOf(dt) =
|
|
|
+ 1401 SymTab.ClClass) THEN
|
|
|
+ 1402 QbeGen.CopyOp(qd, q)
|
|
|
+ 1403 ELSE QbeGen.ElemLoad(qd, dt,
|
|
|
+ 1404 q)
|
|
|
+ 1405 END
|
|
|
+ 1406 ELSE QbeGen.CopyOp(qd, q)
|
|
|
+ 1407 END; .)
|
|
|
+ 1408 | "(" Expr<et, q> ")" (. t := et; .)
|
|
|
+ 1409 | SetLit<st, sq> (. t := st;
|
|
|
+ 1410 QbeGen.CopyOp(sq, q); .)
|
|
|
+ 1411 | "NOT" Fact<t2, q2> (. IF SymTab.BoolCheck(t2) THEN
|
|
|
+ 1412 t := SymTab.BoolType()
|
|
|
+ 1413 ELSE SemError(212);
|
|
|
+ 1414 t := SymTab.InvalidType END;
|
|
|
+ 1415 IF t # SymTab.InvalidType THEN
|
|
|
+ 1416 QbeGen.NotQ(q2, q)
|
|
|
+ 1417 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 1418 END; .) .
|
|
|
+ 1419 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
+ 1420 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
+ 1421 for computed elements. Ranges always lower via SetRange. *)
|
|
|
+ 1422 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 1423 = "{" (. t := SymTab.NewSet(
|
|
|
+ 1424 SymTab.NewSubR(0, 255));
|
|
|
+ 1425 QbeGen.NewSetTemp(8, q);
|
|
|
+ 1426 QbeGen.SetZero(q, 8); .)
|
|
|
+ 1427 [ SetElem<t, q> { "," SetElem<t, q> } ]
|
|
|
+ 1428 "}" .
|
|
|
+ 1429 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
+ 1430 qe, q2: QbeGen.QVal;
|
|
|
+ 1431 v, v2: INTEGER;
|
|
|
+ 1432 lo: INTEGER;
|
|
|
+ 1433 span: CARDINAL;
|
|
|
+ 1434 cl, cl2: INTEGER;
|
|
|
+ 1435 hasR: BOOLEAN; .)
|
|
|
+ 1436 = (. hasR := FALSE; .)
|
|
|
+ 1437 Expr<et, qe>
|
|
|
+ 1438 [ ".." Expr<et2, q2> (. hasR := TRUE; .) ]
|
|
|
+ 1439 (. lo := SymTab.SetBaseLo(st);
|
|
|
+ 1440 span := SymTab.SetCount(st);
|
|
|
+ 1441 IF (et = SymTab.InvalidType)
|
|
|
+ 1442 OR (hasR & (et2 =
|
|
|
+ 1443 SymTab.InvalidType)) THEN
|
|
|
+ 1444 ELSE cl :=
|
|
|
+ 1445 SymTab.ClassOf(et);
|
|
|
+ 1446 IF hasR THEN
|
|
|
+ 1447 cl2 :=
|
|
|
+ 1448 SymTab.ClassOf(et2)
|
|
|
+ 1449 ELSE cl2 := SymTab.ClInt
|
|
|
+ 1450 END;
|
|
|
+ 1451 IF ((cl # SymTab.ClInt)
|
|
|
+ 1452 & (cl # SymTab.ClChar)
|
|
|
+ 1453 & (cl # SymTab.ClBool))
|
|
|
+ 1454 OR (hasR &
|
|
|
+ 1455 ((cl2
|
|
|
+ 1456 # SymTab.ClInt)
|
|
|
+ 1457 & (cl2
|
|
|
+ 1458 # SymTab.ClChar)
|
|
|
+ 1459 & (cl2
|
|
|
+ 1460 # SymTab.ClBool))) THEN
|
|
|
+ 1461 SemError(222)
|
|
|
+ 1462 ELSIF hasR
|
|
|
+ 1463 & SymTab.ConstInt(qe, v)
|
|
|
+ 1464 & SymTab.ConstInt(q2,
|
|
|
+ 1465 v2)
|
|
|
+ 1466 & ((v < lo)
|
|
|
+ 1467 OR (v2 < lo)
|
|
|
+ 1468 OR (v >= lo +
|
|
|
+ 1469 VAL(INTEGER, span))
|
|
|
+ 1470 OR (v2 >= lo +
|
|
|
+ 1471 VAL(INTEGER, span))
|
|
|
+ 1472 OR (v > v2)) THEN
|
|
|
+ 1473 SemError(222)
|
|
|
+ 1474 ELSIF hasR THEN
|
|
|
+ 1475 QbeGen.SetRange(sq, qe, q2,
|
|
|
+ 1476 lo, span)
|
|
|
+ 1477 ELSIF SymTab.ConstInt(qe,
|
|
|
+ 1478 v)
|
|
|
+ 1479 & ((v < lo)
|
|
|
+ 1480 OR (v >= lo +
|
|
|
+ 1481 VAL(INTEGER,
|
|
|
+ 1482 span))) THEN
|
|
|
+ 1483 SemError(222)
|
|
|
+ 1484 ELSE QbeGen.SetBit(sq, qe,
|
|
|
+ 1485 lo, span)
|
|
|
+ 1486 END
|
|
|
+ 1487 END; .) .
|
|
|
+ 1488 GetIdent<VAR n: SymTab.Name>
|
|
|
+ 1489 = ident (. LexName(n); .) .
|
|
|
+ 1490
|
|
|
+ 1491 END M2.
|
|
|
|
|
|
0 errors
|
|
|
|
|
|
|
|
|
Statistics:
|
|
|
|
|
|
- nr of terminals: 71 (limit 400)
|
|
|
- nr of non-terminals: 67 (limit 210)
|
|
|
- nr of pragmas: 0 (limit 429)
|
|
|
- nr of symbolnodes: 138 (limit 500)
|
|
|
- nr of graphnodes: 618 (limit 1500)
|
|
|
+ nr of terminals: 75 (limit 400)
|
|
|
+ nr of non-terminals: 70 (limit 210)
|
|
|
+ nr of pragmas: 0 (limit 425)
|
|
|
+ nr of symbolnodes: 145 (limit 500)
|
|
|
+ nr of graphnodes: 641 (limit 1500)
|
|
|
nr of conditionsets: 6 (limit 100)
|
|
|
nr of charactersets: 11 (limit 250)
|
|
|
|
