|
|
@@ -140,3225 +140,3278 @@ Listing:
|
|
|
121 nLab, nGot: CARDINAL;
|
|
|
122 labNm, gotNm: ARRAY [0 .. 255] OF SymTab.Name;
|
|
|
123
|
|
|
- 124 PROCEDURE CopyNm (src: ARRAY OF CHAR; VAR dst: SymTab.Name);
|
|
|
- 125 VAR i: CARDINAL;
|
|
|
- 126 BEGIN
|
|
|
- 127 i := 0;
|
|
|
- 128 WHILE (i <= HIGH(dst)) AND (i <= HIGH(src)) AND (src[i] # CHR(0)) DO
|
|
|
- 129 dst[i] := src[i]; INC(i)
|
|
|
- 130 END;
|
|
|
- 131 IF i <= HIGH(dst) THEN dst[i] := CHR(0) END
|
|
|
- 132 END CopyNm;
|
|
|
- 133
|
|
|
- 134 PROCEDURE NoteLabel (nm: ARRAY OF CHAR);
|
|
|
- 135 (* Record a statement label; duplicate is 200. *)
|
|
|
- 136 VAR i: CARDINAL;
|
|
|
- 137 BEGIN
|
|
|
- 138 i := 0;
|
|
|
- 139 WHILE i < nLab DO
|
|
|
- 140 IF SymTab.Equal(labNm[i], nm) THEN SemError(200); RETURN END;
|
|
|
- 141 INC(i)
|
|
|
- 142 END;
|
|
|
- 143 IF nLab <= HIGH(labNm) THEN
|
|
|
- 144 CopyNm(nm, labNm[nLab]); INC(nLab)
|
|
|
- 145 END
|
|
|
- 146 END NoteLabel;
|
|
|
- 147
|
|
|
- 148 PROCEDURE NoteGoto (nm: ARRAY OF CHAR);
|
|
|
- 149 VAR i: CARDINAL;
|
|
|
- 150 BEGIN
|
|
|
- 151 i := 0;
|
|
|
- 152 WHILE i < nGot DO
|
|
|
- 153 IF SymTab.Equal(gotNm[i], nm) THEN RETURN END;
|
|
|
- 154 INC(i)
|
|
|
- 155 END;
|
|
|
- 156 IF nGot <= HIGH(gotNm) THEN
|
|
|
- 157 CopyNm(nm, gotNm[nGot]); INC(nGot)
|
|
|
- 158 END
|
|
|
- 159 END NoteGoto;
|
|
|
- 160
|
|
|
- 161 PROCEDURE CheckGotos;
|
|
|
- 162 (* At a procedure's END: every GOTO must name a label in that procedure. *)
|
|
|
- 163 VAR i, j: CARDINAL; found: BOOLEAN;
|
|
|
- 164 BEGIN
|
|
|
- 165 i := 0;
|
|
|
- 166 WHILE i < nGot DO
|
|
|
- 167 found := FALSE; j := 0;
|
|
|
- 168 WHILE (j < nLab) AND NOT found DO
|
|
|
- 169 IF SymTab.Equal(labNm[j], gotNm[i]) THEN found := TRUE END;
|
|
|
- 170 INC(j)
|
|
|
- 171 END;
|
|
|
- 172 IF NOT found THEN SemError(201) END;
|
|
|
- 173 INC(i)
|
|
|
- 174 END
|
|
|
- 175 END CheckGotos;
|
|
|
- 176
|
|
|
- 177 PROCEDURE FlushPend;
|
|
|
- 178 (* Emit module-level globals whose forward type is now resolved. *)
|
|
|
- 179 VAR k: CARDINAL;
|
|
|
- 180 BEGIN
|
|
|
- 181 k := 0;
|
|
|
- 182 WHILE k < nPendVar DO
|
|
|
- 183 INC(k)
|
|
|
- 184 END;
|
|
|
- 185 nPendVar := 0
|
|
|
- 186 END FlushPend;
|
|
|
- 187
|
|
|
- 188 PROCEDURE FwdVarNote (id, slot: INTEGER);
|
|
|
- 189 BEGIN
|
|
|
- 190 IF nFvarRefs <= HIGH(fvarId) THEN
|
|
|
- 191 fvarId[nFvarRefs] := id;
|
|
|
- 192 fvarSlot[nFvarRefs] := slot;
|
|
|
- 193 INC(nFvarRefs)
|
|
|
- 194 END
|
|
|
- 195 END FwdVarNote;
|
|
|
- 196
|
|
|
- 197 PROCEDURE FwdVarFlush;
|
|
|
- 198 (* At module end: resolve every forward reference against the declared
|
|
|
- 199 names (an unresolved one is 201) and patch its placeholder symbol. *)
|
|
|
- 200 VAR k: CARDINAL; nm, g: SymTab.Name; cls: INTEGER; oper: CHAR;
|
|
|
- 201 t: SymTab.TypeIndex; ok: BOOLEAN;
|
|
|
- 202 BEGIN
|
|
|
- 203 k := 0;
|
|
|
- 204 WHILE k < nFvarRefs DO
|
|
|
- 205 SymTab.FwdVarName(fvarId[k], nm);
|
|
|
- 206 IF nm[0] # CHR(0) THEN
|
|
|
- 207 IF NOT SymTab.FwdVarResolve(fvarId[k]) THEN
|
|
|
- 208 SemError(201)
|
|
|
- 209 ELSE
|
|
|
- 210 t := SymTab.FwdVarType(fvarId[k]);
|
|
|
- 211 cls := SymTab.ClassOf(t);
|
|
|
- 212 IF cls = SymTab.ClReal THEN oper := "d"
|
|
|
- 213 ELSIF SymTab.IsLongFamily(t) THEN oper := "l"
|
|
|
- 214 ELSE oper := "w"
|
|
|
- 215 END;
|
|
|
- 216 ok := SymTab.GlobalRef(nm, g);
|
|
|
- 217 END
|
|
|
- 218 END;
|
|
|
- 219 INC(k)
|
|
|
- 220 END;
|
|
|
- 221 nFvarRefs := 0
|
|
|
- 222 END FwdVarFlush;
|
|
|
- 223
|
|
|
- 224 PROCEDURE AstAppend (kind: INTEGER; VAR head, tail: AST.Node;
|
|
|
- 225 item: AST.Node);
|
|
|
- 226 (* Appends `item` to a chunked sequence: each node holds up to
|
|
|
- 227 AST.MaxChild-1 items; child[MaxChild-1] continues into the next
|
|
|
- 228 chunk. Unbounded, so blocks/decl sequences are not capped at 8. *)
|
|
|
- 229 VAR n: AST.Node;
|
|
|
- 230 BEGIN
|
|
|
- 231 IF item = AST.NoNode THEN RETURN END;
|
|
|
- 232 IF head = AST.NoNode THEN
|
|
|
- 233 head := AST.MakeNode(kind); tail := head
|
|
|
- 234 END;
|
|
|
- 235 IF AST.NChild(tail) >= AST.MaxChild - 1 THEN
|
|
|
- 236 n := AST.MakeNode(kind);
|
|
|
- 237 AST.SetChild(tail, AST.MaxChild - 1, n);
|
|
|
- 238 tail := n
|
|
|
- 239 END;
|
|
|
- 240 AST.SetChild(tail, AST.NChild(tail), item)
|
|
|
- 241 END AstAppend;
|
|
|
- 242
|
|
|
- 243 PROCEDURE AstCallNode (callee: AST.Node) : AST.Node;
|
|
|
- 244 (* Builds NkCall(callee, actuals...) from astArgs/astNArgs. The actuals
|
|
|
- 245 are a chunked sequence (AstAppend): a call can have more than
|
|
|
- 246 MaxChild-1 arguments (the generic ArgList has 9), and SetChild would
|
|
|
- 247 silently drop the tail. NkBlock marks the continuation chunks. *)
|
|
|
- 248 VAR n, tail: AST.Node; j: CARDINAL;
|
|
|
- 249 BEGIN
|
|
|
- 250 n := AST.MakeNode(AST.NkCall);
|
|
|
- 251 AST.SetChild(n, 0, callee);
|
|
|
- 252 tail := n;
|
|
|
- 253 j := 0;
|
|
|
- 254 WHILE j < astNArgs DO
|
|
|
- 255 AstAppend(AST.NkBlock, n, tail, astArgs[j]);
|
|
|
- 256 INC(j)
|
|
|
- 257 END;
|
|
|
- 258 RETURN n
|
|
|
- 259 END AstCallNode;
|
|
|
- 260
|
|
|
- 261
|
|
|
- 262
|
|
|
- 263 PROCEDURE GetUnit (): AST.Node;
|
|
|
- 264 (* The most recently parsed unit's AST root (for the Lower comparison). *)
|
|
|
- 265 BEGIN
|
|
|
- 266 RETURN astUnit
|
|
|
- 267 END GetUnit;
|
|
|
+ 124 (* Generics (Increment 1): the last refining module seen — instance
|
|
|
+ 125 name, generic name, and the actual type parameters. *)
|
|
|
+ 126 refInst, refGen: SymTab.Name;
|
|
|
+ 127 refN: CARDINAL;
|
|
|
+ 128 refActual: ARRAY [0 .. 15] OF SymTab.TypeIndex;
|
|
|
+ 129 isGen: BOOLEAN;
|
|
|
+ 130
|
|
|
+ 131 PROCEDURE CopyNm (src: ARRAY OF CHAR; VAR dst: SymTab.Name);
|
|
|
+ 132 VAR i: CARDINAL;
|
|
|
+ 133 BEGIN
|
|
|
+ 134 i := 0;
|
|
|
+ 135 WHILE (i <= HIGH(dst)) AND (i <= HIGH(src)) AND (src[i] # CHR(0)) DO
|
|
|
+ 136 dst[i] := src[i]; INC(i)
|
|
|
+ 137 END;
|
|
|
+ 138 IF i <= HIGH(dst) THEN dst[i] := CHR(0) END
|
|
|
+ 139 END CopyNm;
|
|
|
+ 140
|
|
|
+ 141 PROCEDURE NoteLabel (nm: ARRAY OF CHAR);
|
|
|
+ 142 (* Record a statement label; duplicate is 200. *)
|
|
|
+ 143 VAR i: CARDINAL;
|
|
|
+ 144 BEGIN
|
|
|
+ 145 i := 0;
|
|
|
+ 146 WHILE i < nLab DO
|
|
|
+ 147 IF SymTab.Equal(labNm[i], nm) THEN SemError(200); RETURN END;
|
|
|
+ 148 INC(i)
|
|
|
+ 149 END;
|
|
|
+ 150 IF nLab <= HIGH(labNm) THEN
|
|
|
+ 151 CopyNm(nm, labNm[nLab]); INC(nLab)
|
|
|
+ 152 END
|
|
|
+ 153 END NoteLabel;
|
|
|
+ 154
|
|
|
+ 155 PROCEDURE NoteGoto (nm: ARRAY OF CHAR);
|
|
|
+ 156 VAR i: CARDINAL;
|
|
|
+ 157 BEGIN
|
|
|
+ 158 i := 0;
|
|
|
+ 159 WHILE i < nGot DO
|
|
|
+ 160 IF SymTab.Equal(gotNm[i], nm) THEN RETURN END;
|
|
|
+ 161 INC(i)
|
|
|
+ 162 END;
|
|
|
+ 163 IF nGot <= HIGH(gotNm) THEN
|
|
|
+ 164 CopyNm(nm, gotNm[nGot]); INC(nGot)
|
|
|
+ 165 END
|
|
|
+ 166 END NoteGoto;
|
|
|
+ 167
|
|
|
+ 168 PROCEDURE CheckGotos;
|
|
|
+ 169 (* At a procedure's END: every GOTO must name a label in that procedure. *)
|
|
|
+ 170 VAR i, j: CARDINAL; found: BOOLEAN;
|
|
|
+ 171 BEGIN
|
|
|
+ 172 i := 0;
|
|
|
+ 173 WHILE i < nGot DO
|
|
|
+ 174 found := FALSE; j := 0;
|
|
|
+ 175 WHILE (j < nLab) AND NOT found DO
|
|
|
+ 176 IF SymTab.Equal(labNm[j], gotNm[i]) THEN found := TRUE END;
|
|
|
+ 177 INC(j)
|
|
|
+ 178 END;
|
|
|
+ 179 IF NOT found THEN SemError(201) END;
|
|
|
+ 180 INC(i)
|
|
|
+ 181 END
|
|
|
+ 182 END CheckGotos;
|
|
|
+ 183
|
|
|
+ 184 PROCEDURE FlushPend;
|
|
|
+ 185 (* Emit module-level globals whose forward type is now resolved. *)
|
|
|
+ 186 VAR k: CARDINAL;
|
|
|
+ 187 BEGIN
|
|
|
+ 188 k := 0;
|
|
|
+ 189 WHILE k < nPendVar DO
|
|
|
+ 190 INC(k)
|
|
|
+ 191 END;
|
|
|
+ 192 nPendVar := 0
|
|
|
+ 193 END FlushPend;
|
|
|
+ 194
|
|
|
+ 195 PROCEDURE FwdVarNote (id, slot: INTEGER);
|
|
|
+ 196 BEGIN
|
|
|
+ 197 IF nFvarRefs <= HIGH(fvarId) THEN
|
|
|
+ 198 fvarId[nFvarRefs] := id;
|
|
|
+ 199 fvarSlot[nFvarRefs] := slot;
|
|
|
+ 200 INC(nFvarRefs)
|
|
|
+ 201 END
|
|
|
+ 202 END FwdVarNote;
|
|
|
+ 203
|
|
|
+ 204 PROCEDURE FwdVarFlush;
|
|
|
+ 205 (* At module end: resolve every forward reference against the declared
|
|
|
+ 206 names (an unresolved one is 201) and patch its placeholder symbol. *)
|
|
|
+ 207 VAR k: CARDINAL; nm, g: SymTab.Name; cls: INTEGER; oper: CHAR;
|
|
|
+ 208 t: SymTab.TypeIndex; ok: BOOLEAN;
|
|
|
+ 209 BEGIN
|
|
|
+ 210 k := 0;
|
|
|
+ 211 WHILE k < nFvarRefs DO
|
|
|
+ 212 SymTab.FwdVarName(fvarId[k], nm);
|
|
|
+ 213 IF nm[0] # CHR(0) THEN
|
|
|
+ 214 IF NOT SymTab.FwdVarResolve(fvarId[k]) THEN
|
|
|
+ 215 SemError(201)
|
|
|
+ 216 ELSE
|
|
|
+ 217 t := SymTab.FwdVarType(fvarId[k]);
|
|
|
+ 218 cls := SymTab.ClassOf(t);
|
|
|
+ 219 IF cls = SymTab.ClReal THEN oper := "d"
|
|
|
+ 220 ELSIF SymTab.IsLongFamily(t) THEN oper := "l"
|
|
|
+ 221 ELSE oper := "w"
|
|
|
+ 222 END;
|
|
|
+ 223 ok := SymTab.GlobalRef(nm, g);
|
|
|
+ 224 END
|
|
|
+ 225 END;
|
|
|
+ 226 INC(k)
|
|
|
+ 227 END;
|
|
|
+ 228 nFvarRefs := 0
|
|
|
+ 229 END FwdVarFlush;
|
|
|
+ 230
|
|
|
+ 231 PROCEDURE AstAppend (kind: INTEGER; VAR head, tail: AST.Node;
|
|
|
+ 232 item: AST.Node);
|
|
|
+ 233 (* Appends `item` to a chunked sequence: each node holds up to
|
|
|
+ 234 AST.MaxChild-1 items; child[MaxChild-1] continues into the next
|
|
|
+ 235 chunk. Unbounded, so blocks/decl sequences are not capped at 8. *)
|
|
|
+ 236 VAR n: AST.Node;
|
|
|
+ 237 BEGIN
|
|
|
+ 238 IF item = AST.NoNode THEN RETURN END;
|
|
|
+ 239 IF head = AST.NoNode THEN
|
|
|
+ 240 head := AST.MakeNode(kind); tail := head
|
|
|
+ 241 END;
|
|
|
+ 242 IF AST.NChild(tail) >= AST.MaxChild - 1 THEN
|
|
|
+ 243 n := AST.MakeNode(kind);
|
|
|
+ 244 AST.SetChild(tail, AST.MaxChild - 1, n);
|
|
|
+ 245 tail := n
|
|
|
+ 246 END;
|
|
|
+ 247 AST.SetChild(tail, AST.NChild(tail), item)
|
|
|
+ 248 END AstAppend;
|
|
|
+ 249
|
|
|
+ 250 PROCEDURE AstCallNode (callee: AST.Node) : AST.Node;
|
|
|
+ 251 (* Builds NkCall(callee, actuals...) from astArgs/astNArgs. The actuals
|
|
|
+ 252 are a chunked sequence (AstAppend): a call can have more than
|
|
|
+ 253 MaxChild-1 arguments (the generic ArgList has 9), and SetChild would
|
|
|
+ 254 silently drop the tail. NkBlock marks the continuation chunks. *)
|
|
|
+ 255 VAR n, tail: AST.Node; j: CARDINAL;
|
|
|
+ 256 BEGIN
|
|
|
+ 257 n := AST.MakeNode(AST.NkCall);
|
|
|
+ 258 AST.SetChild(n, 0, callee);
|
|
|
+ 259 tail := n;
|
|
|
+ 260 j := 0;
|
|
|
+ 261 WHILE j < astNArgs DO
|
|
|
+ 262 AstAppend(AST.NkBlock, n, tail, astArgs[j]);
|
|
|
+ 263 INC(j)
|
|
|
+ 264 END;
|
|
|
+ 265 RETURN n
|
|
|
+ 266 END AstCallNode;
|
|
|
+ 267
|
|
|
268
|
|
|
- 269 CHARACTERS
|
|
|
- 270 eol = CHR(13) .
|
|
|
- 271 lf = CHR(10) .
|
|
|
- 272 letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .
|
|
|
- 273 digit = "0123456789" .
|
|
|
- 274 hexDigit = digit + "ABCDEFabcdef" .
|
|
|
- 275 noQuote1 = ANY - "'" - eol .
|
|
|
- 276 noQuote2 = ANY - '"' - eol .
|
|
|
- 277
|
|
|
- 278 IGNORE CHR(9) .. CHR(13)
|
|
|
- 279
|
|
|
- 280 COMMENTS FROM "(*" TO "*)" NESTED
|
|
|
- 281 COMMENTS FROM "//" TO lf
|
|
|
- 282
|
|
|
- 283 TOKENS
|
|
|
- 284 ident = letter { letter | digit | "_" } .
|
|
|
- 285 integer = digit { digit }
|
|
|
- 286 | digit { digit } CONTEXT("..")
|
|
|
- 287 | "0x" hexDigit { hexDigit }
|
|
|
- 288 | "0X" hexDigit { hexDigit } .
|
|
|
- 289 real = digit { digit } "." { digit }
|
|
|
- 290 [ ( "E" | "e" ) [ "+" | "-" ] digit { digit } ] .
|
|
|
- 291 string = "'" { noQuote1 } "'"
|
|
|
- 292 | '"' { noQuote2 } '"' .
|
|
|
- 293 charConst = digit { digit } ( "C" | "c" ) .
|
|
|
- 294 ustring = ( "U" | "u" ) ( "'" { noQuote1 } "'" | '"' { noQuote2 } '"' ) .
|
|
|
- 295
|
|
|
- 296 PRODUCTIONS
|
|
|
- 297 M2
|
|
|
- 298 = (. twoPhase := TRUE; astCur := AST.NoNode; astStmt := AST.NoNode; astDecl := AST.NoNode; astImp := AST.NoNode; astImpTail := AST.NoNode;
|
|
|
- 299 astImp := AST.NoNode;
|
|
|
- 300 astImpTail := AST.NoNode; .)
|
|
|
- 301 Unit "." .
|
|
|
- 302 (* Units: program modules compile fully; DEFINITION and
|
|
|
- 303 IMPLEMENTATION modules parse + check now but lower in step 4
|
|
|
- 304 (each ends with one 230); same for nested local modules. *)
|
|
|
- 305 Unit
|
|
|
- 306 = DefUnit
|
|
|
- 307 | ImplUnit
|
|
|
- 308 | ProgModule .
|
|
|
- 309 (* Step 4.3: one session compiles DEFINITION, its IMPLEMENTATION
|
|
|
- 310 and one program (last) into one image. Units share the symbol
|
|
|
- 311 table; imports materialize exported names. *)
|
|
|
- 312 DefUnit (. VAR m1, m2, pn: SymTab.Name;
|
|
|
- 313 astSeq, astTail, astProc: AST.Node; .)
|
|
|
- 314 = "DEFINITION" "MODULE"
|
|
|
- 315 GetIdent<m1> (. IF NOT SymTab.BeginDef(m1) THEN
|
|
|
- 316 SemError(200) END;
|
|
|
- 317 QbeGen.SetModule(m1); .)
|
|
|
- 318 ";"
|
|
|
- 319 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
- 320 astImp, astImpTail, astDecl); .) }
|
|
|
- 321 [ "EXPORT" [ "QUALIFIED" ] (. (* definition-module export
|
|
|
- 322 list: parsed, and the
|
|
|
- 323 names are already exported
|
|
|
- 324 by the module scope *) .)
|
|
|
- 325 GetIdent<pn> { "," GetIdent<pn> } ";" ]
|
|
|
- 326 (. astSeq := AST.NoNode;
|
|
|
- 327 astTail := AST.NoNode; .)
|
|
|
- 328 { ConstBlock (. AstAppend(AST.NkDeclSeq,
|
|
|
- 329 astSeq, astTail, astDecl); .)
|
|
|
- 330 | TypeBlock<TRUE> (. AstAppend(AST.NkDeclSeq,
|
|
|
- 331 astSeq, astTail, astDecl); .)
|
|
|
- 332 | VarBlock (. AstAppend(AST.NkDeclSeq,
|
|
|
- 333 astSeq, astTail, astDecl); .)
|
|
|
- 334 | ProcHeading<pn, SymTab.InvalidType> ";"
|
|
|
- 335 (. (* a heading only: record it so
|
|
|
- 336 Lower can replay it *)
|
|
|
- 337 astProc := AST.MakeNode(AST.NkProcDecl);
|
|
|
- 338 AST.SetOp(astProc, 0);
|
|
|
- 339 AST.SetChild(astProc, 0,
|
|
|
- 340 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
- 341 AstAppend(AST.NkDeclSeq,
|
|
|
- 342 astSeq, astTail, astProc);
|
|
|
- 343 Lower.NoteProcNode(astProc);
|
|
|
- 344 Lower.ScopeLeave;
|
|
|
- 345 SymTab.CloseProc;
|
|
|
- 346 QbeGen.AbortFunc; .) }
|
|
|
- 347 (. astUnit := AST.MakeNode(AST.NkUnit);
|
|
|
- 348 AST.SetChild(astUnit, 0,
|
|
|
- 349 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
- 350 AST.SetChild(astUnit, 1, astSeq);
|
|
|
- 351 AST.SetChild(astUnit, 3, astImp);
|
|
|
- 352 astDecl := AST.NoNode;
|
|
|
- 353 astStmt := AST.NoNode; .)
|
|
|
- 354 "END"
|
|
|
- 355 GetIdent<m2> (. IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
- 356 SemError(202) END;
|
|
|
- 357 SymTab.EndUnit; .) .
|
|
|
- 358 ImplUnit (. VAR m1, m2: SymTab.Name;
|
|
|
- 359 k: CARDINAL;
|
|
|
- 360 fname: SymTab.Name;
|
|
|
- 361 unres: BOOLEAN;
|
|
|
- 362 astNode: AST.Node; .)
|
|
|
- 363 = "IMPLEMENTATION" "MODULE"
|
|
|
- 364 GetIdent<m1> (. IF NOT SymTab.BeginImpl(m1) THEN
|
|
|
- 365 SemError(201) END;
|
|
|
- 366 astStmt := AST.NoNode;
|
|
|
- 367 astDecl := AST.NoNode;
|
|
|
- 368 astImp := AST.NoNode;
|
|
|
- 369 astImpTail := AST.NoNode;
|
|
|
- 370 nPendVar := 0;
|
|
|
- 371 QbeGen.SetModule(m1); .)
|
|
|
- 372 ";"
|
|
|
- 373 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
- 374 astImp, astImpTail, astDecl); .) }
|
|
|
- 375 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
- 376 [ "BEGIN" (. FlushPend;
|
|
|
- 377 k := 0;
|
|
|
- 378 WHILE k < SymTab.FwdPending() DO
|
|
|
- 379 SymTab.FwdInfo(k, fname, unres);
|
|
|
- 380 IF unres THEN SemError(201) END;
|
|
|
- 381 INC(k)
|
|
|
- 382 END;
|
|
|
- 383 SymTab.FwdClear;
|
|
|
- 384 FwdVarFlush;
|
|
|
- 385 nLab := 0; nGot := 0; .)
|
|
|
- 386 [ StatSeq ] ]
|
|
|
- 387 "END"
|
|
|
- 388 GetIdent<m2> (. FlushPend;
|
|
|
- 389 k := 0;
|
|
|
- 390 WHILE k < SymTab.FwdPending() DO
|
|
|
- 391 SymTab.FwdInfo(k, fname, unres);
|
|
|
- 392 IF unres THEN SemError(201) END;
|
|
|
- 393 INC(k)
|
|
|
- 394 END;
|
|
|
- 395 SymTab.FwdClear;
|
|
|
- 396 FwdVarFlush;
|
|
|
- 397 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
- 398 AST.SetChild(astNode, 0,
|
|
|
- 399 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
- 400 AST.SetChild(astNode, 1, astDecl);
|
|
|
- 401 AST.SetChild(astNode, 2, astStmt);
|
|
|
- 402 AST.SetChild(astNode, 3, astImp);
|
|
|
- 403 astUnit := astNode;
|
|
|
- 404 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
- 405 SemError(202) END;
|
|
|
- 406 CheckGotos;
|
|
|
- 407 SymTab.EndUnit; .) .
|
|
|
- 408 ProgModule (. VAR m1, m2: SymTab.Name;
|
|
|
- 409 k: CARDINAL;
|
|
|
- 410 fname: SymTab.Name;
|
|
|
- 411 unres: BOOLEAN;
|
|
|
- 412 astNode: AST.Node; .)
|
|
|
- 413 = "MODULE"
|
|
|
- 414 GetIdent<m1> (. IF NOT SymTab.BeginProg(m1) THEN
|
|
|
- 415 SemError(200) END;
|
|
|
- 416 astStmt := AST.NoNode;
|
|
|
- 417 astDecl := AST.NoNode;
|
|
|
- 418 astImp := AST.NoNode;
|
|
|
- 419 astImpTail := AST.NoNode;
|
|
|
- 420 nPendVar := 0;
|
|
|
- 421 QbeGen.SetModule(m1); .)
|
|
|
- 422 [ Priority ]
|
|
|
- 423 ";"
|
|
|
- 424 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
- 425 astImp, astImpTail, astDecl); .) }
|
|
|
- 426 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
- 427 [ "BEGIN" (. FlushPend;
|
|
|
- 428 k := 0;
|
|
|
- 429 WHILE k < SymTab.FwdPending() DO
|
|
|
- 430 SymTab.FwdInfo(k, fname, unres);
|
|
|
- 431 IF unres THEN SemError(201) END;
|
|
|
- 432 INC(k)
|
|
|
- 433 END;
|
|
|
- 434 SymTab.FwdClear;
|
|
|
- 435 FwdVarFlush;
|
|
|
- 436 nLab := 0; nGot := 0; .)
|
|
|
- 437 [ StatSeq ] ]
|
|
|
- 438 "END"
|
|
|
- 439 GetIdent<m2> (. FlushPend;
|
|
|
- 440 k := 0;
|
|
|
- 441 WHILE k < SymTab.FwdPending() DO
|
|
|
- 442 SymTab.FwdInfo(k, fname, unres);
|
|
|
- 443 IF unres THEN SemError(201) END;
|
|
|
- 444 INC(k)
|
|
|
- 445 END;
|
|
|
- 446 SymTab.FwdClear;
|
|
|
- 447 FwdVarFlush;
|
|
|
- 448 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
- 449 SemError(202) END;
|
|
|
- 450 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
- 451 AST.SetChild(astNode, 0,
|
|
|
- 452 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
- 453 AST.SetChild(astNode, 1, astDecl);
|
|
|
- 454 AST.SetChild(astNode, 2, astStmt);
|
|
|
- 455 AST.SetChild(astNode, 3, astImp);
|
|
|
- 456 astUnit := astNode;
|
|
|
- 457 CheckGotos;
|
|
|
- 458 SymTab.EndUnit; .) .
|
|
|
- 459 DeclSeq (. VAR astSeq, astTail: AST.Node; .)
|
|
|
- 460 = (. astSeq := AST.NoNode;
|
|
|
- 461 astTail := AST.NoNode; .)
|
|
|
- 462 { (. astDecl := AST.NoNode; .)
|
|
|
- 463 ( ConstBlock | TypeBlock<FALSE> | VarBlock | ProcDecl ";"
|
|
|
- 464 | NestedModule ";" | ClassItem ";" )
|
|
|
- 465 (. AstAppend(AST.NkDeclSeq,
|
|
|
- 466 astSeq, astTail, astDecl); .) }
|
|
|
- 467 (. astDecl := astSeq; .) .
|
|
|
- 468 (* Local module, Wirth form. Declarations lower like top-level ones
|
|
|
- 469 (same QBE module prefix); a BEGIN body becomes an init function
|
|
|
- 470 that main calls; the EXPORT list is hoisted into the enclosing
|
|
|
- 471 scope at END. *)
|
|
|
- 472 NestedModule (. VAR m1, m2: SymTab.Name;
|
|
|
- 473 expNames: ARRAY [0 .. 63] OF SymTab.Name;
|
|
|
- 474 expCount, k: CARDINAL;
|
|
|
- 475 astNode, nImp, nImpTail:
|
|
|
- 476 AST.Node; .)
|
|
|
- 477 = "MODULE"
|
|
|
- 478 GetIdent<m1> (. IF NOT SymTab.Enter(m1,
|
|
|
- 479 SymTab.KindModule) THEN
|
|
|
- 480 SemError(200) END;
|
|
|
- 481 SymTab.PushScope;
|
|
|
- 482 expCount := 0;
|
|
|
- 483 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
- 484 AST.SetChild(astNode, 0,
|
|
|
- 485 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
- 486 astStmt := AST.NoNode;
|
|
|
- 487 astDecl := AST.NoNode;
|
|
|
- 488 nImp := AST.NoNode;
|
|
|
- 489 nImpTail := AST.NoNode; .)
|
|
|
- 490 [ Priority ]
|
|
|
- 491 ";"
|
|
|
- 492 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
- 493 nImp, nImpTail, astDecl); .) }
|
|
|
- 494 [ "EXPORT" [ "QUALIFIED" ]
|
|
|
- 495 GetIdent<expNames[expCount]> (. INC(expCount); .)
|
|
|
- 496 { "," GetIdent<expNames[expCount]>
|
|
|
- 497 (. INC(expCount); .) }
|
|
|
- 498 ";" ]
|
|
|
- 499 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
- 500 [ "BEGIN" (. astStmt := AST.NoNode;
|
|
|
- 501 .)
|
|
|
- 502 [ StatSeq ] ]
|
|
|
- 503 "END"
|
|
|
- 504 GetIdent<m2> (. AST.SetChild(astNode, 1, astDecl);
|
|
|
- 505 AST.SetChild(astNode, 2, astStmt);
|
|
|
- 506 AST.SetChild(astNode, 3, nImp);
|
|
|
- 507 astDecl := astNode;
|
|
|
- 508 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
- 509 SemError(202) END;
|
|
|
- 510 k := 0;
|
|
|
- 511 WHILE k < expCount DO
|
|
|
- 512 SymTab.ExportUp(expNames[k]);
|
|
|
- 513 INC(k)
|
|
|
- 514 END;
|
|
|
- 515 SymTab.PopScope; .) .
|
|
|
- 516 Priority
|
|
|
- 517 = "[" integer "]" (. SemError(230); .) .
|
|
|
- 518 (* Imports (4.3): FROM materializes the names (unqualified use);
|
|
|
- 519 plain IMPORT only demands the module exists — qualified `L.x`
|
|
|
- 520 materializes on first use (Design). *)
|
|
|
- 521 (* Unknown modules stay unchecked stubs (legacy, so hand-written
|
|
|
- 522 import lines don't fail); a known module's missing export is
|
|
|
- 523 201. *)
|
|
|
- 524 Import (. VAR n: SymTab.Name;
|
|
|
- 525 astImport: AST.Node; .)
|
|
|
- 526 = "FROM"
|
|
|
- 527 GetIdent<n> (. astImport := AST.MakeNode(AST.NkImport);
|
|
|
- 528 AST.SetChild(astImport, 0,
|
|
|
- 529 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
- 530 "IMPORT"
|
|
|
- 531 ImpList<n, astImport> ";" (. astDecl := astImport; .)
|
|
|
- 532 | "IMPORT" (. astImport := AST.MakeNode(AST.NkImport); .)
|
|
|
- 533 ImpModList<astImport> ";" (. astDecl := astImport; .) .
|
|
|
- 534 ImpList<mod: SymTab.Name; node: AST.Node>
|
|
|
- 535 (. VAR n: SymTab.Name; .)
|
|
|
- 536 = ImpName<mod, node>
|
|
|
- 537 { "," ImpName<mod, node> } .
|
|
|
- 538 (* Pervasive built-ins imported from SYSTEM (e.g. TSIZE) are
|
|
|
- 539 accepted and ignored: the built-in applies regardless. *)
|
|
|
- 540 ImpName<mod: SymTab.Name; node: AST.Node>
|
|
|
- 541 (. VAR n: SymTab.Name; .)
|
|
|
- 542 = GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
- 543 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 544 IF SymTab.Equal(mod, "libc") THEN
|
|
|
- 545 (* intrinsic C library:
|
|
|
- 546 permissive external *)
|
|
|
- 547 IF NOT SymTab.DeclareCProc(n) THEN
|
|
|
- 548 SemError(201) END;
|
|
|
- 549 Lower.NoteCProc(n)
|
|
|
- 550 ELSIF SymTab.ModKnown(mod) THEN
|
|
|
- 551 IF NOT SymTab.ImportFrom(mod, n) THEN
|
|
|
- 552 SemError(201)
|
|
|
- 553 ELSE Lower.NoteImportedProc(n)
|
|
|
- 554 END
|
|
|
- 555 END; .)
|
|
|
- 556 | ( "TSIZE" | "SIZE" | "ADR" | "HIGH" | "LEN"
|
|
|
- 557 | "CHR" | "ORD" | "ORDL" | "VAL" | "ABS" | "CAP"
|
|
|
- 558 | "UCHR" | "CHR8" | "UORD"
|
|
|
- 559 | "INC" | "DEC" ) .
|
|
|
- 560 ImpModList<node: AST.Node> (. VAR n: SymTab.Name; .)
|
|
|
- 561 = GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
- 562 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
- 563 { "," GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
- 564 AST.MakeLeaf(AST.NkIdent, n)); .) } .
|
|
|
- 565 (* Opaque TYPE declarations (definition modules). The targetless
|
|
|
- 566 alias resolves to InvalidType until step 4 completes it. *)
|
|
|
- 567 (* Scalar-phase TYPEs: named types, integer subranges, enumerations.
|
|
|
- 568 Opaque "TYPE T;" needs isDef (definition units); elsewhere 231.
|
|
|
- 569 Composite forms (ARRAY/RECORD/SET/POINTER) arrive with step 3. *)
|
|
|
- 570 TypeBlock<isDef: BOOLEAN> (. VAR astSeq, astTail: AST.Node; .)
|
|
|
- 571 = "TYPE" (. SymTab.BeginTypeBlock;
|
|
|
- 572 astSeq := AST.NoNode;
|
|
|
- 573 astTail := AST.NoNode; .)
|
|
|
- 574 { (. astDecl := AST.NoNode; .)
|
|
|
- 575 ( TypeItem<isDef> ";" | ClassItem ";" )
|
|
|
- 576 (. AstAppend(AST.NkDeclSeq,
|
|
|
- 577 astSeq, astTail, astDecl); .) }
|
|
|
- 578 (. SymTab.EndTypeBlock;
|
|
|
- 579 astDecl := astSeq; .) .
|
|
|
- 580 TypeItem<isDef: BOOLEAN> (. VAR n: SymTab.Name;
|
|
|
- 581 t, op: SymTab.TypeIndex;
|
|
|
- 582 astNode: AST.Node; .)
|
|
|
- 583 = GetIdent<n> (. op := SymTab.OpaqueBase(n);
|
|
|
- 584 IF op = SymTab.InvalidType THEN
|
|
|
- 585 IF NOT SymTab.Enter(n,
|
|
|
- 586 SymTab.KindType) THEN
|
|
|
- 587 SemError(200) END
|
|
|
- 588 END; .)
|
|
|
- 589 ( "=" Type<t, FALSE> (. astNode := AST.MakeNode(AST.NkTypeDecl);
|
|
|
- 590 AST.SetChild(astNode, 0,
|
|
|
- 591 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 592 AST.SetTy(astNode, t);
|
|
|
- 593 astDecl := astNode;
|
|
|
- 594 IF op # SymTab.InvalidType THEN
|
|
|
- 595 SymTab.SetTarget(op, t)
|
|
|
- 596 ELSE SymTab.SetSymType(n, t)
|
|
|
- 597 END; .)
|
|
|
- 598 | (. IF op # SymTab.InvalidType THEN
|
|
|
- 599 (* stays opaque *)
|
|
|
- 600 ELSIF NOT isDef THEN
|
|
|
- 601 SemError(231)
|
|
|
- 602 ELSE SymTab.SetSymType(n,
|
|
|
- 603 SymTab.NewAlias()) END; .) ) .
|
|
|
- 604 Type<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
- 605 = TypeIdent<t> [ Subrange<t> ] (* anchored subrange: T[lo..hi] *)
|
|
|
- 606 | Subrange<t>
|
|
|
- 607 | Enum<t>
|
|
|
- 608 | ArrayType<t, allowOpen>
|
|
|
- 609 | SetType<t>
|
|
|
- 610 | RecordType<t>
|
|
|
- 611 | PointerType<t>
|
|
|
- 612 | ProcType<t> .
|
|
|
- 613 PointerType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex; .)
|
|
|
- 614 = "POINTER" "TO" Type<base, FALSE>(. t := SymTab.NewPtr(base); .) .
|
|
|
- 615 (* Procedure types (step 8.5): PROCEDURE (params): result. Values
|
|
|
- 616 are code pointers; params are collected into the descriptor. *)
|
|
|
- 617 ProcType<VAR t: SymTab.TypeIndex> (. VAR res, pt: SymTab.TypeIndex;
|
|
|
- 618 isV: BOOLEAN; .)
|
|
|
- 619 = "PROCEDURE" (. res := SymTab.InvalidType;
|
|
|
- 620 t := SymTab.NewProcType(res); .)
|
|
|
- 621 [ "(" [ ProcTypeSection<t> { ";" ProcTypeSection<t> } ] ")" ]
|
|
|
- 622 [ ":" TypeIdent<res> (. SymTab.SetProcTypeRes(t, res); .) ] .
|
|
|
- 623 ProcTypeSection<t: SymTab.TypeIndex> (. VAR pt: SymTab.TypeIndex;
|
|
|
- 624 isV: BOOLEAN;
|
|
|
- 625 cnt, k: CARDINAL;
|
|
|
- 626 names: ARRAY [0 .. 15] OF SymTab.Name; .)
|
|
|
- 627 = (. isV := FALSE; cnt := 0; .)
|
|
|
- 628 [ "VAR" (. isV := TRUE; .) ]
|
|
|
- 629 ( GetIdent<names[cnt]> (. INC(cnt); .)
|
|
|
- 630 { "," GetIdent<names[cnt]> (. INC(cnt); .) }
|
|
|
- 631 ( ":" Type<pt, TRUE> (. k := 0;
|
|
|
- 632 WHILE k < cnt DO
|
|
|
- 633 SymTab.ProcTypeAdd(t, isV, pt);
|
|
|
- 634 INC(k)
|
|
|
- 635 END; .)
|
|
|
- 636 | (. (* type-only parameter list:
|
|
|
- 637 each name is a type (GNU
|
|
|
- 638 shorthand used by the
|
|
|
- 639 Coco/R scanner frame) *)
|
|
|
- 640 k := 0;
|
|
|
- 641 WHILE k < cnt DO
|
|
|
- 642 IF SymTab.Lookup(names[k])
|
|
|
- 643 AND ((SymTab.SymKind(names[k]) = SymTab.KindType)
|
|
|
- 644 OR (SymTab.SymKind(names[k]) = SymTab.KindPredef)) THEN
|
|
|
- 645 pt := SymTab.SymType(names[k])
|
|
|
- 646 ELSE SemError(201);
|
|
|
- 647 pt := SymTab.InvalidType
|
|
|
- 648 END;
|
|
|
- 649 SymTab.ProcTypeAdd(t, isV, pt);
|
|
|
- 650 INC(k)
|
|
|
- 651 END; .) )
|
|
|
- 652 | Type<pt, TRUE> (. (* unnamed parameter (PIM):
|
|
|
- 653 e.g. PROCEDURE (VAR ARRAY OF REAL) *)
|
|
|
- 654 SymTab.ProcTypeAdd(t, isV, pt); .) ) .
|
|
|
- 655 (* Arrays: "OF" without bounds is an open formal (allowed only
|
|
|
- 656 where allowOpen); "[lo..hi, ...]" nests bounded levels inside
|
|
|
- 657 out. Bounds are folded literals (int/char); anything else 230.
|
|
|
- 658 Bare-type indices ("ARRAY Color OF") wait for enum ordinals. *)
|
|
|
- 659 ArrayType<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
- 660 (. VAR elem: SymTab.TypeIndex;
|
|
|
- 661 ok: BOOLEAN;
|
|
|
- 662 bnds, bndh: ARRAY [0 .. 7] OF INTEGER;
|
|
|
- 663 nb, k: CARDINAL;
|
|
|
- 664 idx: SymTab.TypeIndex;
|
|
|
- 665 ilo, ihi: INTEGER; .)
|
|
|
- 666 = "ARRAY"
|
|
|
- 667 ( "OF" Type<elem, FALSE> (. IF NOT allowOpen THEN
|
|
|
- 668 SemError(230) END;
|
|
|
- 669 t := SymTab.NewOpenArray(elem); .)
|
|
|
- 670 | TypeIdent<idx> [ Subrange<idx> ]
|
|
|
- 671 "OF" Type<elem, FALSE> (. (* index-type array: the index
|
|
|
- 672 type's ordinal bounds give the
|
|
|
- 673 [lo..hi] pair *)
|
|
|
- 674 IF SymTab.TypeBounds(idx, ilo,
|
|
|
- 675 ihi)
|
|
|
- 676 THEN t := SymTab.NewArrayB(elem,
|
|
|
- 677 ilo, ihi)
|
|
|
- 678 ELSE SemError(230);
|
|
|
- 679 t := SymTab.InvalidType
|
|
|
- 680 END; .)
|
|
|
- 681 | "[" (. SymTab.BoundBegin; ok := TRUE; .)
|
|
|
- 682 BoundPair<ok>
|
|
|
- 683 { "," BoundPair<ok> }
|
|
|
- 684 "]" (. (* snapshot before the element
|
|
|
- 685 type, which reuses the bound
|
|
|
- 686 buffer for a nested ARRAY *)
|
|
|
- 687 nb := SymTab.BoundCount();
|
|
|
- 688 k := 0;
|
|
|
- 689 WHILE k < nb DO
|
|
|
- 690 bnds[k] := SymTab.BoundLo(k);
|
|
|
- 691 bndh[k] := SymTab.BoundHi(k);
|
|
|
- 692 INC(k)
|
|
|
- 693 END; .)
|
|
|
- 694 "OF" Type<elem, FALSE>
|
|
|
- 695 (. IF ok THEN
|
|
|
- 696 k := nb;
|
|
|
- 697 WHILE k > 0 DO
|
|
|
- 698 DEC(k);
|
|
|
- 699 elem := SymTab.NewArrayB(
|
|
|
- 700 elem, bnds[k], bndh[k])
|
|
|
+ 269
|
|
|
+ 270 PROCEDURE GetUnit (): AST.Node;
|
|
|
+ 271 (* The most recently parsed unit's AST root (for the Lower comparison). *)
|
|
|
+ 272 BEGIN
|
|
|
+ 273 RETURN astUnit
|
|
|
+ 274 END GetUnit;
|
|
|
+ 275
|
|
|
+ 276 CHARACTERS
|
|
|
+ 277 eol = CHR(13) .
|
|
|
+ 278 lf = CHR(10) .
|
|
|
+ 279 letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .
|
|
|
+ 280 digit = "0123456789" .
|
|
|
+ 281 hexDigit = digit + "ABCDEFabcdef" .
|
|
|
+ 282 noQuote1 = ANY - "'" - eol .
|
|
|
+ 283 noQuote2 = ANY - '"' - eol .
|
|
|
+ 284
|
|
|
+ 285 IGNORE CHR(9) .. CHR(13)
|
|
|
+ 286
|
|
|
+ 287 COMMENTS FROM "(*" TO "*)" NESTED
|
|
|
+ 288 COMMENTS FROM "//" TO lf
|
|
|
+ 289
|
|
|
+ 290 TOKENS
|
|
|
+ 291 ident = letter { letter | digit | "_" } .
|
|
|
+ 292 integer = digit { digit }
|
|
|
+ 293 | digit { digit } CONTEXT("..")
|
|
|
+ 294 | "0x" hexDigit { hexDigit }
|
|
|
+ 295 | "0X" hexDigit { hexDigit } .
|
|
|
+ 296 real = digit { digit } "." { digit }
|
|
|
+ 297 [ ( "E" | "e" ) [ "+" | "-" ] digit { digit } ] .
|
|
|
+ 298 string = "'" { noQuote1 } "'"
|
|
|
+ 299 | '"' { noQuote2 } '"' .
|
|
|
+ 300 charConst = digit { digit } ( "C" | "c" ) .
|
|
|
+ 301 ustring = ( "U" | "u" ) ( "'" { noQuote1 } "'" | '"' { noQuote2 } '"' ) .
|
|
|
+ 302
|
|
|
+ 303 PRODUCTIONS
|
|
|
+ 304 M2
|
|
|
+ 305 = (. twoPhase := TRUE; astCur := AST.NoNode; astStmt := AST.NoNode; astDecl := AST.NoNode; astImp := AST.NoNode; astImpTail := AST.NoNode;
|
|
|
+ 306 astImp := AST.NoNode;
|
|
|
+ 307 astImpTail := AST.NoNode; .)
|
|
|
+ 308 Unit "." .
|
|
|
+ 309 (* Units: program modules compile fully; DEFINITION and
|
|
|
+ 310 IMPLEMENTATION modules parse + check now but lower in step 4
|
|
|
+ 311 (each ends with one 230); same for nested local modules. *)
|
|
|
+ 312 (* Generics (Increment 1): formal and actual parameters. Formals are
|
|
|
+ 313 TYPE parameters only; actuals are type identifiers. *)
|
|
|
+ 314 GenericFormals
|
|
|
+ 315 = "(" GenericFormal { ";" GenericFormal } ")" .
|
|
|
+ 316 GenericFormal (. VAR nm: SymTab.Name; .)
|
|
|
+ 317 = GetIdent<nm> (. IF NOT SymTab.EnterTypeParam(nm) THEN
|
|
|
+ 318 SemError(200) END; .)
|
|
|
+ 319 { "," GetIdent<nm> (. IF NOT SymTab.EnterTypeParam(nm) THEN
|
|
|
+ 320 SemError(200) END; .) }
|
|
|
+ 321 ":" "TYPE" .
|
|
|
+ 322 Actuals
|
|
|
+ 323 = Actual { "," Actual } .
|
|
|
+ 324 Actual (. VAR at: SymTab.TypeIndex; .)
|
|
|
+ 325 = TypeIdent<at> (. IF refN <= HIGH(refActual) THEN
|
|
|
+ 326 refActual[refN] := at; INC(refN)
|
|
|
+ 327 END; .) .
|
|
|
+ 328 Unit
|
|
|
+ 329 = (. isGen := FALSE; .)
|
|
|
+ 330 [ "GENERIC" (. isGen := TRUE; .) ]
|
|
|
+ 331 ( DefUnit | ImplUnit | ProgModule ) .
|
|
|
+ 332 (* Step 4.3: one session compiles DEFINITION, its IMPLEMENTATION
|
|
|
+ 333 and one program (last) into one image. Units share the symbol
|
|
|
+ 334 table; imports materialize exported names. *)
|
|
|
+ 335 DefUnit (. VAR m1, m2, pn: SymTab.Name;
|
|
|
+ 336 g: SymTab.Name;
|
|
|
+ 337 astSeq, astTail, astProc: AST.Node; .)
|
|
|
+ 338 = (. refN := 0; .)
|
|
|
+ 339 "DEFINITION" "MODULE"
|
|
|
+ 340 GetIdent<m1> (. IF NOT SymTab.BeginDef(m1) THEN
|
|
|
+ 341 SemError(200) END;
|
|
|
+ 342 QbeGen.SetModule(m1); .)
|
|
|
+ 343 [ GenericFormals ]
|
|
|
+ 344 ( ";"
|
|
|
+ 345 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 346 astImp, astImpTail, astDecl); .) }
|
|
|
+ 347 [ "EXPORT" [ "QUALIFIED" ] (. (* definition-module export
|
|
|
+ 348 list: parsed, and the
|
|
|
+ 349 names are already exported
|
|
|
+ 350 by the module scope *) .)
|
|
|
+ 351 GetIdent<pn> { "," GetIdent<pn> } ";" ]
|
|
|
+ 352 (. astSeq := AST.NoNode;
|
|
|
+ 353 astTail := AST.NoNode; .)
|
|
|
+ 354 { ConstBlock (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 355 astSeq, astTail, astDecl); .)
|
|
|
+ 356 | TypeBlock<TRUE> (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 357 astSeq, astTail, astDecl); .)
|
|
|
+ 358 | VarBlock (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 359 astSeq, astTail, astDecl); .)
|
|
|
+ 360 | ProcHeading<pn, SymTab.InvalidType> ";"
|
|
|
+ 361 (. (* a heading only: record it so
|
|
|
+ 362 Lower can replay it *)
|
|
|
+ 363 astProc := AST.MakeNode(AST.NkProcDecl);
|
|
|
+ 364 AST.SetOp(astProc, 0);
|
|
|
+ 365 AST.SetChild(astProc, 0,
|
|
|
+ 366 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
+ 367 AstAppend(AST.NkDeclSeq,
|
|
|
+ 368 astSeq, astTail, astProc);
|
|
|
+ 369 Lower.NoteProcNode(astProc);
|
|
|
+ 370 Lower.ScopeLeave;
|
|
|
+ 371 SymTab.CloseProc;
|
|
|
+ 372 QbeGen.AbortFunc; .) }
|
|
|
+ 373 (. astUnit := AST.MakeNode(AST.NkUnit);
|
|
|
+ 374 AST.SetChild(astUnit, 0,
|
|
|
+ 375 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 376 AST.SetChild(astUnit, 1, astSeq);
|
|
|
+ 377 AST.SetChild(astUnit, 3, astImp);
|
|
|
+ 378 astDecl := AST.NoNode;
|
|
|
+ 379 astStmt := AST.NoNode; .)
|
|
|
+ 380 "END"
|
|
|
+ 381 GetIdent<m2> (. IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 382 SemError(202) END;
|
|
|
+ 383 SymTab.EndUnit; .)
|
|
|
+ 384 | "=" GetIdent<g> [ "(" Actuals ")" ] ";"
|
|
|
+ 385 (. CopyNm(m1, refInst);
|
|
|
+ 386 CopyNm(g, refGen);
|
|
|
+ 387 astUnit := AST.MakeNode(AST.NkUnit);
|
|
|
+ 388 AST.SetChild(astUnit, 0,
|
|
|
+ 389 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 390 astDecl := AST.NoNode;
|
|
|
+ 391 astStmt := AST.NoNode; .)
|
|
|
+ 392 "END"
|
|
|
+ 393 GetIdent<m2> (. IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 394 SemError(202) END;
|
|
|
+ 395 SymTab.EndUnit; .) ) .
|
|
|
+ 396 ImplUnit (. VAR m1, m2: SymTab.Name;
|
|
|
+ 397 g: SymTab.Name;
|
|
|
+ 398 k: CARDINAL;
|
|
|
+ 399 fname: SymTab.Name;
|
|
|
+ 400 unres: BOOLEAN;
|
|
|
+ 401 astNode: AST.Node; .)
|
|
|
+ 402 = (. refN := 0; .)
|
|
|
+ 403 "IMPLEMENTATION" "MODULE"
|
|
|
+ 404 GetIdent<m1> (. IF NOT SymTab.BeginImpl(m1) THEN
|
|
|
+ 405 SemError(201) END;
|
|
|
+ 406 astStmt := AST.NoNode;
|
|
|
+ 407 astDecl := AST.NoNode;
|
|
|
+ 408 astImp := AST.NoNode;
|
|
|
+ 409 astImpTail := AST.NoNode;
|
|
|
+ 410 nPendVar := 0;
|
|
|
+ 411 QbeGen.SetModule(m1); .)
|
|
|
+ 412 [ GenericFormals ]
|
|
|
+ 413 ( ";"
|
|
|
+ 414 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 415 astImp, astImpTail, astDecl); .) }
|
|
|
+ 416 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
+ 417 [ "BEGIN" (. FlushPend;
|
|
|
+ 418 k := 0;
|
|
|
+ 419 WHILE k < SymTab.FwdPending() DO
|
|
|
+ 420 SymTab.FwdInfo(k, fname, unres);
|
|
|
+ 421 IF unres THEN SemError(201) END;
|
|
|
+ 422 INC(k)
|
|
|
+ 423 END;
|
|
|
+ 424 SymTab.FwdClear;
|
|
|
+ 425 FwdVarFlush;
|
|
|
+ 426 nLab := 0; nGot := 0; .)
|
|
|
+ 427 [ StatSeq ] ]
|
|
|
+ 428 "END"
|
|
|
+ 429 GetIdent<m2> (. FlushPend;
|
|
|
+ 430 k := 0;
|
|
|
+ 431 WHILE k < SymTab.FwdPending() DO
|
|
|
+ 432 SymTab.FwdInfo(k, fname, unres);
|
|
|
+ 433 IF unres THEN SemError(201) END;
|
|
|
+ 434 INC(k)
|
|
|
+ 435 END;
|
|
|
+ 436 SymTab.FwdClear;
|
|
|
+ 437 FwdVarFlush;
|
|
|
+ 438 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
+ 439 AST.SetChild(astNode, 0,
|
|
|
+ 440 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 441 AST.SetChild(astNode, 1, astDecl);
|
|
|
+ 442 AST.SetChild(astNode, 2, astStmt);
|
|
|
+ 443 AST.SetChild(astNode, 3, astImp);
|
|
|
+ 444 astUnit := astNode;
|
|
|
+ 445 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 446 SemError(202) END;
|
|
|
+ 447 CheckGotos;
|
|
|
+ 448 SymTab.EndUnit; .)
|
|
|
+ 449 | "=" GetIdent<g> [ "(" Actuals ")" ] ";"
|
|
|
+ 450 (. CopyNm(m1, refInst);
|
|
|
+ 451 CopyNm(g, refGen);
|
|
|
+ 452 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
+ 453 AST.SetChild(astNode, 0,
|
|
|
+ 454 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 455 astDecl := AST.NoNode;
|
|
|
+ 456 astStmt := AST.NoNode; .)
|
|
|
+ 457 "END"
|
|
|
+ 458 GetIdent<m2> (. IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 459 SemError(202) END;
|
|
|
+ 460 SymTab.EndUnit; .) ) .
|
|
|
+ 461 ProgModule (. VAR m1, m2: SymTab.Name;
|
|
|
+ 462 k: CARDINAL;
|
|
|
+ 463 fname: SymTab.Name;
|
|
|
+ 464 unres: BOOLEAN;
|
|
|
+ 465 astNode: AST.Node; .)
|
|
|
+ 466 = "MODULE"
|
|
|
+ 467 GetIdent<m1> (. IF NOT SymTab.BeginProg(m1) THEN
|
|
|
+ 468 SemError(200) END;
|
|
|
+ 469 astStmt := AST.NoNode;
|
|
|
+ 470 astDecl := AST.NoNode;
|
|
|
+ 471 astImp := AST.NoNode;
|
|
|
+ 472 astImpTail := AST.NoNode;
|
|
|
+ 473 nPendVar := 0;
|
|
|
+ 474 QbeGen.SetModule(m1); .)
|
|
|
+ 475 [ Priority ]
|
|
|
+ 476 ";"
|
|
|
+ 477 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 478 astImp, astImpTail, astDecl); .) }
|
|
|
+ 479 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
+ 480 [ "BEGIN" (. FlushPend;
|
|
|
+ 481 k := 0;
|
|
|
+ 482 WHILE k < SymTab.FwdPending() DO
|
|
|
+ 483 SymTab.FwdInfo(k, fname, unres);
|
|
|
+ 484 IF unres THEN SemError(201) END;
|
|
|
+ 485 INC(k)
|
|
|
+ 486 END;
|
|
|
+ 487 SymTab.FwdClear;
|
|
|
+ 488 FwdVarFlush;
|
|
|
+ 489 nLab := 0; nGot := 0; .)
|
|
|
+ 490 [ StatSeq ] ]
|
|
|
+ 491 "END"
|
|
|
+ 492 GetIdent<m2> (. FlushPend;
|
|
|
+ 493 k := 0;
|
|
|
+ 494 WHILE k < SymTab.FwdPending() DO
|
|
|
+ 495 SymTab.FwdInfo(k, fname, unres);
|
|
|
+ 496 IF unres THEN SemError(201) END;
|
|
|
+ 497 INC(k)
|
|
|
+ 498 END;
|
|
|
+ 499 SymTab.FwdClear;
|
|
|
+ 500 FwdVarFlush;
|
|
|
+ 501 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 502 SemError(202) END;
|
|
|
+ 503 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
+ 504 AST.SetChild(astNode, 0,
|
|
|
+ 505 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 506 AST.SetChild(astNode, 1, astDecl);
|
|
|
+ 507 AST.SetChild(astNode, 2, astStmt);
|
|
|
+ 508 AST.SetChild(astNode, 3, astImp);
|
|
|
+ 509 astUnit := astNode;
|
|
|
+ 510 CheckGotos;
|
|
|
+ 511 SymTab.EndUnit; .) .
|
|
|
+ 512 DeclSeq (. VAR astSeq, astTail: AST.Node; .)
|
|
|
+ 513 = (. astSeq := AST.NoNode;
|
|
|
+ 514 astTail := AST.NoNode; .)
|
|
|
+ 515 { (. astDecl := AST.NoNode; .)
|
|
|
+ 516 ( ConstBlock | TypeBlock<FALSE> | VarBlock | ProcDecl ";"
|
|
|
+ 517 | NestedModule ";" | ClassItem ";" )
|
|
|
+ 518 (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 519 astSeq, astTail, astDecl); .) }
|
|
|
+ 520 (. astDecl := astSeq; .) .
|
|
|
+ 521 (* Local module, Wirth form. Declarations lower like top-level ones
|
|
|
+ 522 (same QBE module prefix); a BEGIN body becomes an init function
|
|
|
+ 523 that main calls; the EXPORT list is hoisted into the enclosing
|
|
|
+ 524 scope at END. *)
|
|
|
+ 525 NestedModule (. VAR m1, m2: SymTab.Name;
|
|
|
+ 526 expNames: ARRAY [0 .. 63] OF SymTab.Name;
|
|
|
+ 527 expCount, k: CARDINAL;
|
|
|
+ 528 astNode, nImp, nImpTail:
|
|
|
+ 529 AST.Node; .)
|
|
|
+ 530 = "MODULE"
|
|
|
+ 531 GetIdent<m1> (. IF NOT SymTab.Enter(m1,
|
|
|
+ 532 SymTab.KindModule) THEN
|
|
|
+ 533 SemError(200) END;
|
|
|
+ 534 SymTab.PushScope;
|
|
|
+ 535 expCount := 0;
|
|
|
+ 536 astNode := AST.MakeNode(AST.NkUnit);
|
|
|
+ 537 AST.SetChild(astNode, 0,
|
|
|
+ 538 AST.MakeLeaf(AST.NkIdent, m1));
|
|
|
+ 539 astStmt := AST.NoNode;
|
|
|
+ 540 astDecl := AST.NoNode;
|
|
|
+ 541 nImp := AST.NoNode;
|
|
|
+ 542 nImpTail := AST.NoNode; .)
|
|
|
+ 543 [ Priority ]
|
|
|
+ 544 ";"
|
|
|
+ 545 { Import (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 546 nImp, nImpTail, astDecl); .) }
|
|
|
+ 547 [ "EXPORT" [ "QUALIFIED" ]
|
|
|
+ 548 GetIdent<expNames[expCount]> (. INC(expCount); .)
|
|
|
+ 549 { "," GetIdent<expNames[expCount]>
|
|
|
+ 550 (. INC(expCount); .) }
|
|
|
+ 551 ";" ]
|
|
|
+ 552 DeclSeq (. astStmt := AST.NoNode; .)
|
|
|
+ 553 [ "BEGIN" (. astStmt := AST.NoNode;
|
|
|
+ 554 .)
|
|
|
+ 555 [ StatSeq ] ]
|
|
|
+ 556 "END"
|
|
|
+ 557 GetIdent<m2> (. AST.SetChild(astNode, 1, astDecl);
|
|
|
+ 558 AST.SetChild(astNode, 2, astStmt);
|
|
|
+ 559 AST.SetChild(astNode, 3, nImp);
|
|
|
+ 560 astDecl := astNode;
|
|
|
+ 561 IF NOT SymTab.Equal(m1, m2) THEN
|
|
|
+ 562 SemError(202) END;
|
|
|
+ 563 k := 0;
|
|
|
+ 564 WHILE k < expCount DO
|
|
|
+ 565 SymTab.ExportUp(expNames[k]);
|
|
|
+ 566 INC(k)
|
|
|
+ 567 END;
|
|
|
+ 568 SymTab.PopScope; .) .
|
|
|
+ 569 Priority
|
|
|
+ 570 = "[" integer "]" (. SemError(230); .) .
|
|
|
+ 571 (* Imports (4.3): FROM materializes the names (unqualified use);
|
|
|
+ 572 plain IMPORT only demands the module exists — qualified `L.x`
|
|
|
+ 573 materializes on first use (Design). *)
|
|
|
+ 574 (* Unknown modules stay unchecked stubs (legacy, so hand-written
|
|
|
+ 575 import lines don't fail); a known module's missing export is
|
|
|
+ 576 201. *)
|
|
|
+ 577 Import (. VAR n: SymTab.Name;
|
|
|
+ 578 astImport: AST.Node; .)
|
|
|
+ 579 = "FROM"
|
|
|
+ 580 GetIdent<n> (. astImport := AST.MakeNode(AST.NkImport);
|
|
|
+ 581 AST.SetChild(astImport, 0,
|
|
|
+ 582 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
+ 583 "IMPORT"
|
|
|
+ 584 ImpList<n, astImport> ";" (. astDecl := astImport; .)
|
|
|
+ 585 | "IMPORT" (. astImport := AST.MakeNode(AST.NkImport); .)
|
|
|
+ 586 ImpModList<astImport> ";" (. astDecl := astImport; .) .
|
|
|
+ 587 ImpList<mod: SymTab.Name; node: AST.Node>
|
|
|
+ 588 (. VAR n: SymTab.Name; .)
|
|
|
+ 589 = ImpName<mod, node>
|
|
|
+ 590 { "," ImpName<mod, node> } .
|
|
|
+ 591 (* Pervasive built-ins imported from SYSTEM (e.g. TSIZE) are
|
|
|
+ 592 accepted and ignored: the built-in applies regardless. *)
|
|
|
+ 593 ImpName<mod: SymTab.Name; node: AST.Node>
|
|
|
+ 594 (. VAR n: SymTab.Name; .)
|
|
|
+ 595 = GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
+ 596 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 597 IF SymTab.Equal(mod, "libc") THEN
|
|
|
+ 598 (* intrinsic C library:
|
|
|
+ 599 permissive external *)
|
|
|
+ 600 IF NOT SymTab.DeclareCProc(n) THEN
|
|
|
+ 601 SemError(201) END;
|
|
|
+ 602 Lower.NoteCProc(n)
|
|
|
+ 603 ELSIF SymTab.ModKnown(mod) THEN
|
|
|
+ 604 IF NOT SymTab.ImportFrom(mod, n) THEN
|
|
|
+ 605 SemError(201)
|
|
|
+ 606 ELSE Lower.NoteImportedProc(n)
|
|
|
+ 607 END
|
|
|
+ 608 END; .)
|
|
|
+ 609 | ( "TSIZE" | "SIZE" | "ADR" | "HIGH" | "LEN"
|
|
|
+ 610 | "CHR" | "ORD" | "ORDL" | "VAL" | "ABS" | "CAP"
|
|
|
+ 611 | "UCHR" | "CHR8" | "UORD"
|
|
|
+ 612 | "INC" | "DEC" ) .
|
|
|
+ 613 ImpModList<node: AST.Node> (. VAR n: SymTab.Name; .)
|
|
|
+ 614 = GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
+ 615 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
+ 616 { "," GetIdent<n> (. AST.SetChild(node, AST.NChild(node),
|
|
|
+ 617 AST.MakeLeaf(AST.NkIdent, n)); .) } .
|
|
|
+ 618 (* Opaque TYPE declarations (definition modules). The targetless
|
|
|
+ 619 alias resolves to InvalidType until step 4 completes it. *)
|
|
|
+ 620 (* Scalar-phase TYPEs: named types, integer subranges, enumerations.
|
|
|
+ 621 Opaque "TYPE T;" needs isDef (definition units); elsewhere 231.
|
|
|
+ 622 Composite forms (ARRAY/RECORD/SET/POINTER) arrive with step 3. *)
|
|
|
+ 623 TypeBlock<isDef: BOOLEAN> (. VAR astSeq, astTail: AST.Node; .)
|
|
|
+ 624 = "TYPE" (. SymTab.BeginTypeBlock;
|
|
|
+ 625 astSeq := AST.NoNode;
|
|
|
+ 626 astTail := AST.NoNode; .)
|
|
|
+ 627 { (. astDecl := AST.NoNode; .)
|
|
|
+ 628 ( TypeItem<isDef> ";" | ClassItem ";" )
|
|
|
+ 629 (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 630 astSeq, astTail, astDecl); .) }
|
|
|
+ 631 (. SymTab.EndTypeBlock;
|
|
|
+ 632 astDecl := astSeq; .) .
|
|
|
+ 633 TypeItem<isDef: BOOLEAN> (. VAR n: SymTab.Name;
|
|
|
+ 634 t, op: SymTab.TypeIndex;
|
|
|
+ 635 astNode: AST.Node; .)
|
|
|
+ 636 = GetIdent<n> (. op := SymTab.OpaqueBase(n);
|
|
|
+ 637 IF op = SymTab.InvalidType THEN
|
|
|
+ 638 IF NOT SymTab.Enter(n,
|
|
|
+ 639 SymTab.KindType) THEN
|
|
|
+ 640 SemError(200) END
|
|
|
+ 641 END; .)
|
|
|
+ 642 ( "=" Type<t, FALSE> (. astNode := AST.MakeNode(AST.NkTypeDecl);
|
|
|
+ 643 AST.SetChild(astNode, 0,
|
|
|
+ 644 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 645 AST.SetTy(astNode, t);
|
|
|
+ 646 astDecl := astNode;
|
|
|
+ 647 IF op # SymTab.InvalidType THEN
|
|
|
+ 648 SymTab.SetTarget(op, t)
|
|
|
+ 649 ELSE SymTab.SetSymType(n, t)
|
|
|
+ 650 END; .)
|
|
|
+ 651 | (. IF op # SymTab.InvalidType THEN
|
|
|
+ 652 (* stays opaque *)
|
|
|
+ 653 ELSIF NOT isDef THEN
|
|
|
+ 654 SemError(231)
|
|
|
+ 655 ELSE SymTab.SetSymType(n,
|
|
|
+ 656 SymTab.NewAlias()) END; .) ) .
|
|
|
+ 657 Type<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
+ 658 = TypeIdent<t> [ Subrange<t> ] (* anchored subrange: T[lo..hi] *)
|
|
|
+ 659 | Subrange<t>
|
|
|
+ 660 | Enum<t>
|
|
|
+ 661 | ArrayType<t, allowOpen>
|
|
|
+ 662 | SetType<t>
|
|
|
+ 663 | RecordType<t>
|
|
|
+ 664 | PointerType<t>
|
|
|
+ 665 | ProcType<t> .
|
|
|
+ 666 PointerType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex; .)
|
|
|
+ 667 = "POINTER" "TO" Type<base, FALSE>(. t := SymTab.NewPtr(base); .) .
|
|
|
+ 668 (* Procedure types (step 8.5): PROCEDURE (params): result. Values
|
|
|
+ 669 are code pointers; params are collected into the descriptor. *)
|
|
|
+ 670 ProcType<VAR t: SymTab.TypeIndex> (. VAR res, pt: SymTab.TypeIndex;
|
|
|
+ 671 isV: BOOLEAN; .)
|
|
|
+ 672 = "PROCEDURE" (. res := SymTab.InvalidType;
|
|
|
+ 673 t := SymTab.NewProcType(res); .)
|
|
|
+ 674 [ "(" [ ProcTypeSection<t> { ";" ProcTypeSection<t> } ] ")" ]
|
|
|
+ 675 [ ":" TypeIdent<res> (. SymTab.SetProcTypeRes(t, res); .) ] .
|
|
|
+ 676 ProcTypeSection<t: SymTab.TypeIndex> (. VAR pt: SymTab.TypeIndex;
|
|
|
+ 677 isV: BOOLEAN;
|
|
|
+ 678 cnt, k: CARDINAL;
|
|
|
+ 679 names: ARRAY [0 .. 15] OF SymTab.Name; .)
|
|
|
+ 680 = (. isV := FALSE; cnt := 0; .)
|
|
|
+ 681 [ "VAR" (. isV := TRUE; .) ]
|
|
|
+ 682 ( GetIdent<names[cnt]> (. INC(cnt); .)
|
|
|
+ 683 { "," GetIdent<names[cnt]> (. INC(cnt); .) }
|
|
|
+ 684 ( ":" Type<pt, TRUE> (. k := 0;
|
|
|
+ 685 WHILE k < cnt DO
|
|
|
+ 686 SymTab.ProcTypeAdd(t, isV, pt);
|
|
|
+ 687 INC(k)
|
|
|
+ 688 END; .)
|
|
|
+ 689 | (. (* type-only parameter list:
|
|
|
+ 690 each name is a type (GNU
|
|
|
+ 691 shorthand used by the
|
|
|
+ 692 Coco/R scanner frame) *)
|
|
|
+ 693 k := 0;
|
|
|
+ 694 WHILE k < cnt DO
|
|
|
+ 695 IF SymTab.Lookup(names[k])
|
|
|
+ 696 AND ((SymTab.SymKind(names[k]) = SymTab.KindType)
|
|
|
+ 697 OR (SymTab.SymKind(names[k]) = SymTab.KindPredef)) THEN
|
|
|
+ 698 pt := SymTab.SymType(names[k])
|
|
|
+ 699 ELSE SemError(201);
|
|
|
+ 700 pt := SymTab.InvalidType
|
|
|
701 END;
|
|
|
- 702 t := elem
|
|
|
- 703 ELSE t := SymTab.InvalidType
|
|
|
- 704 END; .) ) .
|
|
|
- 705 BoundPair<VAR ok: BOOLEAN> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
- 706 qlo, qhi: QbeGen.QVal;
|
|
|
- 707 lo, hi: INTEGER;
|
|
|
- 708 cl, cl2: INTEGER; .)
|
|
|
- 709 = Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
- 710 (. IF (tlo = SymTab.InvalidType)
|
|
|
- 711 OR (thi = SymTab.InvalidType) THEN
|
|
|
- 712 ok := FALSE
|
|
|
- 713 ELSE cl := SymTab.ClassOf(tlo);
|
|
|
- 714 cl2 := SymTab.ClassOf(thi);
|
|
|
- 715 IF ((cl # SymTab.ClInt)
|
|
|
- 716 AND (cl # SymTab.ClChar))
|
|
|
- 717 OR ((cl2 # SymTab.ClInt)
|
|
|
- 718 AND (cl2 # SymTab.ClChar)) THEN
|
|
|
- 719 SemError(230); ok := FALSE
|
|
|
- 720 ELSIF NOT SymTab.ConstInt(qlo, lo)
|
|
|
- 721 OR NOT SymTab.ConstInt(qhi, hi)
|
|
|
- 722 OR (lo > hi) THEN
|
|
|
- 723 SemError(230); ok := FALSE
|
|
|
- 724 ELSIF NOT SymTab.BoundAdd(lo, hi) THEN
|
|
|
- 725 SemError(230); ok := FALSE
|
|
|
- 726 END;
|
|
|
- 727 END; .) .
|
|
|
- 728 (* Sets: multi-word masks over bases ≤ 256 values (bool, char,
|
|
|
- 729 bounded subranges; enums wait for ordinals, INTEGER is
|
|
|
- 730 unbounded). Literals are SET OF [0..255]; assignment and
|
|
|
- 731 comparison across suitable bases are lenient (masks over min
|
|
|
- 732 words + zero-check extras), out-of-span literals are 222. *)
|
|
|
- 733 SetType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex;
|
|
|
- 734 blo, bhi, bspan: INTEGER;
|
|
|
- 735 bcls: INTEGER; .)
|
|
|
- 736 = "SET" "OF" Type<base, FALSE>
|
|
|
- 737 (. IF base = SymTab.InvalidType THEN
|
|
|
- 738 t := SymTab.InvalidType
|
|
|
- 739 ELSE bcls :=
|
|
|
- 740 SymTab.ClassOf(base);
|
|
|
- 741 IF bcls = SymTab.ClBool THEN
|
|
|
- 742 blo := 0; bspan := 2
|
|
|
- 743 ELSIF bcls = SymTab.ClChar THEN
|
|
|
- 744 blo := 0; bspan := 256
|
|
|
- 745 ELSIF bcls = SymTab.ClEnum THEN
|
|
|
- 746 blo := 0;
|
|
|
- 747 bspan := VAL(INTEGER,
|
|
|
- 748 SymTab.EnumCount(base))
|
|
|
- 749 ELSIF SymTab.SubBounds(base,
|
|
|
- 750 blo, bhi) THEN
|
|
|
- 751 bspan := bhi - blo + 1
|
|
|
- 752 ELSE bspan := 0 END;
|
|
|
- 753 IF (bspan <= 0)
|
|
|
- 754 OR (bspan > 65536) THEN
|
|
|
- 755 SemError(230);
|
|
|
- 756 t := SymTab.InvalidType
|
|
|
- 757 ELSE t := SymTab.NewSet(base)
|
|
|
- 758 END
|
|
|
- 759 END; .) .
|
|
|
- 760 (* Records: flat blobs; array fields are pointers to static
|
|
|
- 761 descriptors (locked amendment), nested records inline. Field
|
|
|
- 762 offsets static and declaration-ordered. *)
|
|
|
- 763 (* Field list: plain fields and (optionally) one variant part. The
|
|
|
- 764 variant part is a `CASE ... END` item; because it starts with the
|
|
|
- 765 CASE keyword it is unambiguously distinguishable from a field
|
|
|
- 766 (which starts with an identifier). *)
|
|
|
- 767 RecordType<VAR t: SymTab.TypeIndex> (. VAR t2: SymTab.TypeIndex;
|
|
|
- 768 tagOk: BOOLEAN; .)
|
|
|
- 769 = "RECORD" (. t := SymTab.NewRecord(); .)
|
|
|
- 770 [ RecItem<t> { ";" [ RecItem<t> ] } ]
|
|
|
- 771 "END" (. SymTab.LayoutRecord(t); .) .
|
|
|
- 772 RecItem<rec: SymTab.TypeIndex> (. VAR tt: SymTab.TypeIndex; .)
|
|
|
- 773 = RecField<rec>
|
|
|
- 774 | CaseField<rec> (. SymTab.MarkVariant(rec); .) .
|
|
|
- 775 (* A variant part: CASE tag : Type OF variants. The layout overlays
|
|
|
- 776 every branch from the tag slot (see SymTab.ComputeOffsets). *)
|
|
|
- 777 CaseField<rec: SymTab.TypeIndex> (. VAR tagT: SymTab.TypeIndex;
|
|
|
- 778 tagN: SymTab.Name; .)
|
|
|
- 779 = "CASE" (. SymTab.ResetFields(rec); .)
|
|
|
- 780 GetIdent<tagN> (. IF NOT SymTab.FieldPending(rec,
|
|
|
- 781 tagN) THEN
|
|
|
- 782 SemError(200) END; .)
|
|
|
- 783 ":" Type<tagT, FALSE> (. IF (tagT # SymTab.InvalidType)
|
|
|
- 784 AND NOT SymTab.IsOrdinal(tagT) THEN
|
|
|
- 785 SemError(224)
|
|
|
- 786 END;
|
|
|
- 787 SymTab.FixPendingF(rec, tagT);
|
|
|
- 788 SymTab.SetVariantTag(rec, tagN); .)
|
|
|
- 789 "OF"
|
|
|
- 790 RecFieldList<rec>
|
|
|
- 791 { "|" (. SymTab.ResetFields(rec); .)
|
|
|
- 792 RecFieldList<rec> }
|
|
|
- 793 "END" .
|
|
|
- 794 RecFieldList<rec: SymTab.TypeIndex> (. VAR lt, lq: SymTab.TypeIndex;
|
|
|
- 795 lv1, lv2: QbeGen.QVal; .)
|
|
|
- 796 = VarLabel<lt, lv1> [ ".." VarLabel<lq, lv2> ] ":"
|
|
|
- 797 RecField<rec> { ";" [ RecField<rec> ] } .
|
|
|
- 798 (* Variant case label: a constant (or a constant range). Values are
|
|
|
- 799 not interpreted (the layout overlays regardless). *)
|
|
|
- 800 VarLabel<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 801 (. VAR lname: SymTab.Name; .)
|
|
|
- 802 = ( ident (. LexName(lname);
|
|
|
- 803 QbeGen.CopyOp("0", q);
|
|
|
- 804 t := SymTab.IntType(); .)
|
|
|
- 805 | integer (. LexString(lname);
|
|
|
- 806 QbeGen.CopyOp("0", q);
|
|
|
- 807 t := SymTab.IntType(); .)
|
|
|
- 808 | charConst (. LexString(lname);
|
|
|
- 809 QbeGen.CopyOp("0", q);
|
|
|
- 810 t := SymTab.CharType(); .) ) .
|
|
|
- 811 RecField<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
- 812 t2: SymTab.TypeIndex; .)
|
|
|
- 813 = RecIdents<rec> ":" Type<t2, FALSE>(. SymTab.FixPendingF(rec, t2); .) .
|
|
|
- 814 RecIdents<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
- 815 = GetIdent<n> (. IF NOT SymTab.FieldPending(rec,
|
|
|
- 816 n) THEN
|
|
|
- 817 SemError(200) END; .)
|
|
|
- 818 { "," GetIdent<n> (. IF NOT SymTab.FieldPending(rec,
|
|
|
- 819 n) THEN
|
|
|
- 820 SemError(200) END; .) } .
|
|
|
- 821 TypeIdent<VAR t: SymTab.TypeIndex> (. VAR n, qid: SymTab.Name;
|
|
|
- 822 k: INTEGER;
|
|
|
- 823 dotted: BOOLEAN; .)
|
|
|
- 824 = GetIdent<n> (. dotted := FALSE;
|
|
|
- 825 IF NOT SymTab.Lookup(n) THEN
|
|
|
- 826 k := -1;
|
|
|
- 827 t := SymTab.ForwardType(n);
|
|
|
- 828 IF t = SymTab.InvalidType THEN
|
|
|
- 829 SemError(201)
|
|
|
- 830 END
|
|
|
- 831 ELSE k := SymTab.SymKind(n);
|
|
|
- 832 IF (k = SymTab.KindType)
|
|
|
- 833 OR (k = SymTab.KindPredef) THEN
|
|
|
- 834 t := SymTab.SymType(n)
|
|
|
- 835 ELSE t := SymTab.InvalidType
|
|
|
- 836 END
|
|
|
- 837 END; .)
|
|
|
- 838 [ "." GetIdent<qid> (. dotted := TRUE;
|
|
|
- 839 IF k = SymTab.KindModule THEN
|
|
|
- 840 t := SymTab.QualType(n, qid);
|
|
|
- 841 IF t = SymTab.InvalidType THEN
|
|
|
- 842 SemError(201)
|
|
|
- 843 END
|
|
|
- 844 ELSE SemError(221);
|
|
|
- 845 t := SymTab.InvalidType
|
|
|
- 846 END; .) ]
|
|
|
- 847 (. IF NOT dotted THEN
|
|
|
- 848 IF (k = SymTab.KindModule)
|
|
|
- 849 OR ((k # SymTab.KindType)
|
|
|
- 850 AND (k # SymTab.KindPredef)
|
|
|
- 851 AND (k # SymTab.KindImport)
|
|
|
- 852 AND (k # -1)) THEN
|
|
|
- 853 SemError(221)
|
|
|
- 854 END
|
|
|
- 855 END; .) .
|
|
|
- 856 Subrange<VAR t: SymTab.TypeIndex> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
- 857 qlo, qhi: QbeGen.QVal;
|
|
|
- 858 lo, hi: INTEGER; .)
|
|
|
- 859 = "[" Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
- 860 (. IF (tlo = SymTab.InvalidType)
|
|
|
- 861 OR (thi = SymTab.InvalidType) THEN
|
|
|
- 862 t := SymTab.InvalidType
|
|
|
- 863 ELSIF NOT SymTab.IsOrdinal(tlo)
|
|
|
- 864 OR NOT SymTab.IsOrdinal(thi) THEN
|
|
|
- 865 SemError(230);
|
|
|
- 866 t := SymTab.InvalidType
|
|
|
- 867 ELSIF NOT SymTab.ConstInt(qlo, lo)
|
|
|
- 868 OR NOT SymTab.ConstInt(qhi, hi)
|
|
|
- 869 OR (lo > hi) THEN
|
|
|
- 870 SemError(230);
|
|
|
- 871 t := SymTab.InvalidType
|
|
|
- 872 ELSE t := SymTab.NewSubR(lo, hi)
|
|
|
- 873 END; .)
|
|
|
- 874 "]" .
|
|
|
- 875 Enum<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
- 876 ord: INTEGER;
|
|
|
- 877 qv: QbeGen.QVal; .)
|
|
|
- 878 = "(" (. t := SymTab.NewEnum();
|
|
|
- 879 ord := 0; .)
|
|
|
- 880 GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
- 881 SymTab.KindConst) THEN
|
|
|
- 882 SemError(200) END;
|
|
|
- 883 SymTab.SetSymType(n, t);
|
|
|
- 884 QbeGen.IntStr(ord, qv);
|
|
|
- 885 SymTab.SetSymVal(n, qv);
|
|
|
- 886 Lower.NoteVar(n,
|
|
|
- 887 SymTab.KindConst, t);
|
|
|
- 888 Lower.NoteConstVal(qv);
|
|
|
- 889 INC(ord); .)
|
|
|
- 890 { "," GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
- 891 SymTab.KindConst) THEN
|
|
|
- 892 SemError(200) END;
|
|
|
- 893 SymTab.SetSymType(n, t);
|
|
|
- 894 QbeGen.IntStr(ord, qv);
|
|
|
- 895 SymTab.SetSymVal(n, qv);
|
|
|
- 896 Lower.NoteVar(n,
|
|
|
- 897 SymTab.KindConst, t);
|
|
|
- 898 Lower.NoteConstVal(qv);
|
|
|
- 899 INC(ord); .) }
|
|
|
- 900 ")" (. SymTab.SetEnumCount(t,
|
|
|
- 901 VAL(CARDINAL, ord)); .) .
|
|
|
- 902 (* Clarion-form classes (docs/OOP.txt): declaration + single
|
|
|
- 903 inheritance + IMPLEMENTATION blocks. Scopes and member checks
|
|
|
- 904 now; lowering (vtable, dispatch, THIS) later — one 230 per
|
|
|
- 905 class/impl block. Methods end with ";" per the Table example
|
|
|
- 906 (not "," as in the sketch). No underscores in identifiers. *)
|
|
|
- 907 (* Single CLASS item in both loops: separating declaration from
|
|
|
- 908 IMPLEMENTATION at the loop level needs 2-token lookahead
|
|
|
- 909 (CLASS ident vs CLASS IMPLEMENTATION), which LL(1) cannot do.
|
|
|
- 910 The second token decides after CLASS is consumed. A misplaced
|
|
|
- 911 CLASS IMPLEMENTATION inside TYPE still parses (harmless: the
|
|
|
- 912 whole unit ends 230 until lowering). *)
|
|
|
- 913 ClassItem
|
|
|
- 914 = "CLASS" ( "IMPLEMENTATION" ClassImplRest | ClassRest ) .
|
|
|
- 915 ClassRest (. VAR cn, m2, pn: SymTab.Name;
|
|
|
- 916 ct: SymTab.TypeIndex; .)
|
|
|
- 917 = GetIdent<cn> (. IF NOT SymTab.Enter(cn,
|
|
|
- 918 SymTab.KindType) THEN
|
|
|
- 919 SemError(200) END;
|
|
|
- 920 ct := SymTab.NewClass();
|
|
|
- 921 SymTab.SetSymType(cn, ct);
|
|
|
- 922 SymTab.PushClassScope(ct);
|
|
|
- 923 astCls := AST.MakeNode(AST.NkClassDecl);
|
|
|
- 924 AST.SetChild(astCls, 0,
|
|
|
- 925 AST.MakeLeaf(AST.NkIdent, cn));
|
|
|
- 926 astClsP := AST.NoNode;
|
|
|
- 927 astClsPTail := AST.NoNode;
|
|
|
- 928 astClsF := AST.NoNode;
|
|
|
- 929 astClsFTail := AST.NoNode;
|
|
|
- 930 astClsM := AST.NoNode;
|
|
|
- 931 astClsMTail := AST.NoNode; .)
|
|
|
- 932 [ Parents<ct> ]
|
|
|
- 933 ";"
|
|
|
- 934 { ClassField<ct> ";" }
|
|
|
- 935 { MethodHeading<pn, SymTab.InvalidType> ";"
|
|
|
- 936 (. Lower.ScopeLeave;
|
|
|
- 937 SymTab.CloseProc;
|
|
|
- 938 QbeGen.AbortFunc; .) }
|
|
|
- 939 "END"
|
|
|
- 940 GetIdent<m2> (. IF NOT SymTab.Equal(cn, m2) THEN
|
|
|
- 941 SemError(202) END;
|
|
|
- 942 SymTab.LayoutClass(ct);
|
|
|
- 943 SymTab.PopScope;
|
|
|
- 944 AST.SetChild(astCls, 1, astClsP);
|
|
|
- 945 AST.SetChild(astCls, 2, astClsF);
|
|
|
- 946 AST.SetChild(astCls, 3, astClsM);
|
|
|
- 947 astDecl := astCls; .) .
|
|
|
- 948 Parents<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name; .)
|
|
|
- 949 = "(" Parent1<ct>
|
|
|
- 950 { "," GetIdent<p> (. SemError(230); .) }
|
|
|
- 951 ")" .
|
|
|
- 952 Parent1<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name;
|
|
|
- 953 pt: SymTab.TypeIndex; .)
|
|
|
- 954 = GetIdent<p> (. IF NOT SymTab.Lookup(p) THEN
|
|
|
- 955 SemError(201)
|
|
|
- 956 ELSE pt := SymTab.SymType(p);
|
|
|
- 957 IF SymTab.ClassOf(pt) #
|
|
|
- 958 SymTab.ClClass THEN
|
|
|
- 959 SemError(230)
|
|
|
- 960 ELSE SymTab.SetParent(ct, pt)
|
|
|
- 961 END
|
|
|
- 962 END;
|
|
|
- 963 AstAppend(AST.NkFieldDecl,
|
|
|
- 964 astClsP, astClsPTail,
|
|
|
- 965 AST.MakeLeaf(AST.NkIdent, p)); .) .
|
|
|
- 966 ClassField<ct: SymTab.TypeIndex> (. VAR n, rhs: SymTab.Name;
|
|
|
- 967 t: SymTab.TypeIndex;
|
|
|
- 968 astNode: AST.Node; .)
|
|
|
- 969 = GetIdent<n>
|
|
|
- 970 ( "=" GetIdent<rhs> (. IF NOT SymTab.Enter(n,
|
|
|
- 971 SymTab.KindConst) THEN
|
|
|
+ 702 SymTab.ProcTypeAdd(t, isV, pt);
|
|
|
+ 703 INC(k)
|
|
|
+ 704 END; .) )
|
|
|
+ 705 | Type<pt, TRUE> (. (* unnamed parameter (PIM):
|
|
|
+ 706 e.g. PROCEDURE (VAR ARRAY OF REAL) *)
|
|
|
+ 707 SymTab.ProcTypeAdd(t, isV, pt); .) ) .
|
|
|
+ 708 (* Arrays: "OF" without bounds is an open formal (allowed only
|
|
|
+ 709 where allowOpen); "[lo..hi, ...]" nests bounded levels inside
|
|
|
+ 710 out. Bounds are folded literals (int/char); anything else 230.
|
|
|
+ 711 Bare-type indices ("ARRAY Color OF") wait for enum ordinals. *)
|
|
|
+ 712 ArrayType<VAR t: SymTab.TypeIndex; allowOpen: BOOLEAN>
|
|
|
+ 713 (. VAR elem: SymTab.TypeIndex;
|
|
|
+ 714 ok: BOOLEAN;
|
|
|
+ 715 bnds, bndh: ARRAY [0 .. 7] OF INTEGER;
|
|
|
+ 716 nb, k: CARDINAL;
|
|
|
+ 717 idx: SymTab.TypeIndex;
|
|
|
+ 718 ilo, ihi: INTEGER; .)
|
|
|
+ 719 = "ARRAY"
|
|
|
+ 720 ( "OF" Type<elem, FALSE> (. IF NOT allowOpen THEN
|
|
|
+ 721 SemError(230) END;
|
|
|
+ 722 t := SymTab.NewOpenArray(elem); .)
|
|
|
+ 723 | TypeIdent<idx> [ Subrange<idx> ]
|
|
|
+ 724 "OF" Type<elem, FALSE> (. (* index-type array: the index
|
|
|
+ 725 type's ordinal bounds give the
|
|
|
+ 726 [lo..hi] pair *)
|
|
|
+ 727 IF SymTab.TypeBounds(idx, ilo,
|
|
|
+ 728 ihi)
|
|
|
+ 729 THEN t := SymTab.NewArrayB(elem,
|
|
|
+ 730 ilo, ihi)
|
|
|
+ 731 ELSE SemError(230);
|
|
|
+ 732 t := SymTab.InvalidType
|
|
|
+ 733 END; .)
|
|
|
+ 734 | "[" (. SymTab.BoundBegin; ok := TRUE; .)
|
|
|
+ 735 BoundPair<ok>
|
|
|
+ 736 { "," BoundPair<ok> }
|
|
|
+ 737 "]" (. (* snapshot before the element
|
|
|
+ 738 type, which reuses the bound
|
|
|
+ 739 buffer for a nested ARRAY *)
|
|
|
+ 740 nb := SymTab.BoundCount();
|
|
|
+ 741 k := 0;
|
|
|
+ 742 WHILE k < nb DO
|
|
|
+ 743 bnds[k] := SymTab.BoundLo(k);
|
|
|
+ 744 bndh[k] := SymTab.BoundHi(k);
|
|
|
+ 745 INC(k)
|
|
|
+ 746 END; .)
|
|
|
+ 747 "OF" Type<elem, FALSE>
|
|
|
+ 748 (. IF ok THEN
|
|
|
+ 749 k := nb;
|
|
|
+ 750 WHILE k > 0 DO
|
|
|
+ 751 DEC(k);
|
|
|
+ 752 elem := SymTab.NewArrayB(
|
|
|
+ 753 elem, bnds[k], bndh[k])
|
|
|
+ 754 END;
|
|
|
+ 755 t := elem
|
|
|
+ 756 ELSE t := SymTab.InvalidType
|
|
|
+ 757 END; .) ) .
|
|
|
+ 758 BoundPair<VAR ok: BOOLEAN> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
+ 759 qlo, qhi: QbeGen.QVal;
|
|
|
+ 760 lo, hi: INTEGER;
|
|
|
+ 761 cl, cl2: INTEGER; .)
|
|
|
+ 762 = Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
+ 763 (. IF (tlo = SymTab.InvalidType)
|
|
|
+ 764 OR (thi = SymTab.InvalidType) THEN
|
|
|
+ 765 ok := FALSE
|
|
|
+ 766 ELSE cl := SymTab.ClassOf(tlo);
|
|
|
+ 767 cl2 := SymTab.ClassOf(thi);
|
|
|
+ 768 IF ((cl # SymTab.ClInt)
|
|
|
+ 769 AND (cl # SymTab.ClChar))
|
|
|
+ 770 OR ((cl2 # SymTab.ClInt)
|
|
|
+ 771 AND (cl2 # SymTab.ClChar)) THEN
|
|
|
+ 772 SemError(230); ok := FALSE
|
|
|
+ 773 ELSIF NOT SymTab.ConstInt(qlo, lo)
|
|
|
+ 774 OR NOT SymTab.ConstInt(qhi, hi)
|
|
|
+ 775 OR (lo > hi) THEN
|
|
|
+ 776 SemError(230); ok := FALSE
|
|
|
+ 777 ELSIF NOT SymTab.BoundAdd(lo, hi) THEN
|
|
|
+ 778 SemError(230); ok := FALSE
|
|
|
+ 779 END;
|
|
|
+ 780 END; .) .
|
|
|
+ 781 (* Sets: multi-word masks over bases ≤ 256 values (bool, char,
|
|
|
+ 782 bounded subranges; enums wait for ordinals, INTEGER is
|
|
|
+ 783 unbounded). Literals are SET OF [0..255]; assignment and
|
|
|
+ 784 comparison across suitable bases are lenient (masks over min
|
|
|
+ 785 words + zero-check extras), out-of-span literals are 222. *)
|
|
|
+ 786 SetType<VAR t: SymTab.TypeIndex> (. VAR base: SymTab.TypeIndex;
|
|
|
+ 787 blo, bhi, bspan: INTEGER;
|
|
|
+ 788 bcls: INTEGER; .)
|
|
|
+ 789 = "SET" "OF" Type<base, FALSE>
|
|
|
+ 790 (. IF base = SymTab.InvalidType THEN
|
|
|
+ 791 t := SymTab.InvalidType
|
|
|
+ 792 ELSE bcls :=
|
|
|
+ 793 SymTab.ClassOf(base);
|
|
|
+ 794 IF bcls = SymTab.ClBool THEN
|
|
|
+ 795 blo := 0; bspan := 2
|
|
|
+ 796 ELSIF bcls = SymTab.ClChar THEN
|
|
|
+ 797 blo := 0; bspan := 256
|
|
|
+ 798 ELSIF bcls = SymTab.ClEnum THEN
|
|
|
+ 799 blo := 0;
|
|
|
+ 800 bspan := VAL(INTEGER,
|
|
|
+ 801 SymTab.EnumCount(base))
|
|
|
+ 802 ELSIF SymTab.SubBounds(base,
|
|
|
+ 803 blo, bhi) THEN
|
|
|
+ 804 bspan := bhi - blo + 1
|
|
|
+ 805 ELSE bspan := 0 END;
|
|
|
+ 806 IF (bspan <= 0)
|
|
|
+ 807 OR (bspan > 65536) THEN
|
|
|
+ 808 SemError(230);
|
|
|
+ 809 t := SymTab.InvalidType
|
|
|
+ 810 ELSE t := SymTab.NewSet(base)
|
|
|
+ 811 END
|
|
|
+ 812 END; .) .
|
|
|
+ 813 (* Records: flat blobs; array fields are pointers to static
|
|
|
+ 814 descriptors (locked amendment), nested records inline. Field
|
|
|
+ 815 offsets static and declaration-ordered. *)
|
|
|
+ 816 (* Field list: plain fields and (optionally) one variant part. The
|
|
|
+ 817 variant part is a `CASE ... END` item; because it starts with the
|
|
|
+ 818 CASE keyword it is unambiguously distinguishable from a field
|
|
|
+ 819 (which starts with an identifier). *)
|
|
|
+ 820 RecordType<VAR t: SymTab.TypeIndex> (. VAR t2: SymTab.TypeIndex;
|
|
|
+ 821 tagOk: BOOLEAN; .)
|
|
|
+ 822 = "RECORD" (. t := SymTab.NewRecord(); .)
|
|
|
+ 823 [ RecItem<t> { ";" [ RecItem<t> ] } ]
|
|
|
+ 824 "END" (. SymTab.LayoutRecord(t); .) .
|
|
|
+ 825 RecItem<rec: SymTab.TypeIndex> (. VAR tt: SymTab.TypeIndex; .)
|
|
|
+ 826 = RecField<rec>
|
|
|
+ 827 | CaseField<rec> (. SymTab.MarkVariant(rec); .) .
|
|
|
+ 828 (* A variant part: CASE tag : Type OF variants. The layout overlays
|
|
|
+ 829 every branch from the tag slot (see SymTab.ComputeOffsets). *)
|
|
|
+ 830 CaseField<rec: SymTab.TypeIndex> (. VAR tagT: SymTab.TypeIndex;
|
|
|
+ 831 tagN: SymTab.Name; .)
|
|
|
+ 832 = "CASE" (. SymTab.ResetFields(rec); .)
|
|
|
+ 833 GetIdent<tagN> (. IF NOT SymTab.FieldPending(rec,
|
|
|
+ 834 tagN) THEN
|
|
|
+ 835 SemError(200) END; .)
|
|
|
+ 836 ":" Type<tagT, FALSE> (. IF (tagT # SymTab.InvalidType)
|
|
|
+ 837 AND NOT SymTab.IsOrdinal(tagT) THEN
|
|
|
+ 838 SemError(224)
|
|
|
+ 839 END;
|
|
|
+ 840 SymTab.FixPendingF(rec, tagT);
|
|
|
+ 841 SymTab.SetVariantTag(rec, tagN); .)
|
|
|
+ 842 "OF"
|
|
|
+ 843 RecFieldList<rec>
|
|
|
+ 844 { "|" (. SymTab.ResetFields(rec); .)
|
|
|
+ 845 RecFieldList<rec> }
|
|
|
+ 846 "END" .
|
|
|
+ 847 RecFieldList<rec: SymTab.TypeIndex> (. VAR lt, lq: SymTab.TypeIndex;
|
|
|
+ 848 lv1, lv2: QbeGen.QVal; .)
|
|
|
+ 849 = VarLabel<lt, lv1> [ ".." VarLabel<lq, lv2> ] ":"
|
|
|
+ 850 RecField<rec> { ";" [ RecField<rec> ] } .
|
|
|
+ 851 (* Variant case label: a constant (or a constant range). Values are
|
|
|
+ 852 not interpreted (the layout overlays regardless). *)
|
|
|
+ 853 VarLabel<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 854 (. VAR lname: SymTab.Name; .)
|
|
|
+ 855 = ( ident (. LexName(lname);
|
|
|
+ 856 QbeGen.CopyOp("0", q);
|
|
|
+ 857 t := SymTab.IntType(); .)
|
|
|
+ 858 | integer (. LexString(lname);
|
|
|
+ 859 QbeGen.CopyOp("0", q);
|
|
|
+ 860 t := SymTab.IntType(); .)
|
|
|
+ 861 | charConst (. LexString(lname);
|
|
|
+ 862 QbeGen.CopyOp("0", q);
|
|
|
+ 863 t := SymTab.CharType(); .) ) .
|
|
|
+ 864 RecField<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
+ 865 t2: SymTab.TypeIndex; .)
|
|
|
+ 866 = RecIdents<rec> ":" Type<t2, FALSE>(. SymTab.FixPendingF(rec, t2); .) .
|
|
|
+ 867 RecIdents<rec: SymTab.TypeIndex> (. VAR n: SymTab.Name; .)
|
|
|
+ 868 = GetIdent<n> (. IF NOT SymTab.FieldPending(rec,
|
|
|
+ 869 n) THEN
|
|
|
+ 870 SemError(200) END; .)
|
|
|
+ 871 { "," GetIdent<n> (. IF NOT SymTab.FieldPending(rec,
|
|
|
+ 872 n) THEN
|
|
|
+ 873 SemError(200) END; .) } .
|
|
|
+ 874 TypeIdent<VAR t: SymTab.TypeIndex> (. VAR n, qid: SymTab.Name;
|
|
|
+ 875 k: INTEGER;
|
|
|
+ 876 dotted: BOOLEAN; .)
|
|
|
+ 877 = GetIdent<n> (. dotted := FALSE;
|
|
|
+ 878 IF NOT SymTab.Lookup(n) THEN
|
|
|
+ 879 k := -1;
|
|
|
+ 880 t := SymTab.ForwardType(n);
|
|
|
+ 881 IF t = SymTab.InvalidType THEN
|
|
|
+ 882 SemError(201)
|
|
|
+ 883 END
|
|
|
+ 884 ELSE k := SymTab.SymKind(n);
|
|
|
+ 885 IF (k = SymTab.KindType)
|
|
|
+ 886 OR (k = SymTab.KindPredef) THEN
|
|
|
+ 887 t := SymTab.SymType(n)
|
|
|
+ 888 ELSE t := SymTab.InvalidType
|
|
|
+ 889 END
|
|
|
+ 890 END; .)
|
|
|
+ 891 [ "." GetIdent<qid> (. dotted := TRUE;
|
|
|
+ 892 IF k = SymTab.KindModule THEN
|
|
|
+ 893 t := SymTab.QualType(n, qid);
|
|
|
+ 894 IF t = SymTab.InvalidType THEN
|
|
|
+ 895 SemError(201)
|
|
|
+ 896 END
|
|
|
+ 897 ELSE SemError(221);
|
|
|
+ 898 t := SymTab.InvalidType
|
|
|
+ 899 END; .) ]
|
|
|
+ 900 (. IF NOT dotted THEN
|
|
|
+ 901 IF (k = SymTab.KindModule)
|
|
|
+ 902 OR ((k # SymTab.KindType)
|
|
|
+ 903 AND (k # SymTab.KindPredef)
|
|
|
+ 904 AND (k # SymTab.KindImport)
|
|
|
+ 905 AND (k # -1)) THEN
|
|
|
+ 906 SemError(221)
|
|
|
+ 907 END
|
|
|
+ 908 END; .) .
|
|
|
+ 909 Subrange<VAR t: SymTab.TypeIndex> (. VAR tlo, thi: SymTab.TypeIndex;
|
|
|
+ 910 qlo, qhi: QbeGen.QVal;
|
|
|
+ 911 lo, hi: INTEGER; .)
|
|
|
+ 912 = "[" Expr<tlo, qlo> ".." Expr<thi, qhi>
|
|
|
+ 913 (. IF (tlo = SymTab.InvalidType)
|
|
|
+ 914 OR (thi = SymTab.InvalidType) THEN
|
|
|
+ 915 t := SymTab.InvalidType
|
|
|
+ 916 ELSIF NOT SymTab.IsOrdinal(tlo)
|
|
|
+ 917 OR NOT SymTab.IsOrdinal(thi) THEN
|
|
|
+ 918 SemError(230);
|
|
|
+ 919 t := SymTab.InvalidType
|
|
|
+ 920 ELSIF NOT SymTab.ConstInt(qlo, lo)
|
|
|
+ 921 OR NOT SymTab.ConstInt(qhi, hi)
|
|
|
+ 922 OR (lo > hi) THEN
|
|
|
+ 923 SemError(230);
|
|
|
+ 924 t := SymTab.InvalidType
|
|
|
+ 925 ELSE t := SymTab.NewSubR(lo, hi)
|
|
|
+ 926 END; .)
|
|
|
+ 927 "]" .
|
|
|
+ 928 Enum<VAR t: SymTab.TypeIndex> (. VAR n: SymTab.Name;
|
|
|
+ 929 ord: INTEGER;
|
|
|
+ 930 qv: QbeGen.QVal; .)
|
|
|
+ 931 = "(" (. t := SymTab.NewEnum();
|
|
|
+ 932 ord := 0; .)
|
|
|
+ 933 GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
+ 934 SymTab.KindConst) THEN
|
|
|
+ 935 SemError(200) END;
|
|
|
+ 936 SymTab.SetSymType(n, t);
|
|
|
+ 937 QbeGen.IntStr(ord, qv);
|
|
|
+ 938 SymTab.SetSymVal(n, qv);
|
|
|
+ 939 Lower.NoteVar(n,
|
|
|
+ 940 SymTab.KindConst, t);
|
|
|
+ 941 Lower.NoteConstVal(qv);
|
|
|
+ 942 INC(ord); .)
|
|
|
+ 943 { "," GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
+ 944 SymTab.KindConst) THEN
|
|
|
+ 945 SemError(200) END;
|
|
|
+ 946 SymTab.SetSymType(n, t);
|
|
|
+ 947 QbeGen.IntStr(ord, qv);
|
|
|
+ 948 SymTab.SetSymVal(n, qv);
|
|
|
+ 949 Lower.NoteVar(n,
|
|
|
+ 950 SymTab.KindConst, t);
|
|
|
+ 951 Lower.NoteConstVal(qv);
|
|
|
+ 952 INC(ord); .) }
|
|
|
+ 953 ")" (. SymTab.SetEnumCount(t,
|
|
|
+ 954 VAL(CARDINAL, ord)); .) .
|
|
|
+ 955 (* Clarion-form classes (docs/OOP.txt): declaration + single
|
|
|
+ 956 inheritance + IMPLEMENTATION blocks. Scopes and member checks
|
|
|
+ 957 now; lowering (vtable, dispatch, THIS) later — one 230 per
|
|
|
+ 958 class/impl block. Methods end with ";" per the Table example
|
|
|
+ 959 (not "," as in the sketch). No underscores in identifiers. *)
|
|
|
+ 960 (* Single CLASS item in both loops: separating declaration from
|
|
|
+ 961 IMPLEMENTATION at the loop level needs 2-token lookahead
|
|
|
+ 962 (CLASS ident vs CLASS IMPLEMENTATION), which LL(1) cannot do.
|
|
|
+ 963 The second token decides after CLASS is consumed. A misplaced
|
|
|
+ 964 CLASS IMPLEMENTATION inside TYPE still parses (harmless: the
|
|
|
+ 965 whole unit ends 230 until lowering). *)
|
|
|
+ 966 ClassItem
|
|
|
+ 967 = "CLASS" ( "IMPLEMENTATION" ClassImplRest | ClassRest ) .
|
|
|
+ 968 ClassRest (. VAR cn, m2, pn: SymTab.Name;
|
|
|
+ 969 ct: SymTab.TypeIndex; .)
|
|
|
+ 970 = GetIdent<cn> (. IF NOT SymTab.Enter(cn,
|
|
|
+ 971 SymTab.KindType) THEN
|
|
|
972 SemError(200) END;
|
|
|
- 973 astNode := AST.MakeNode(AST.NkConstDecl);
|
|
|
- 974 AST.SetChild(astNode, 0,
|
|
|
- 975 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 976 AST.SetChild(astNode, 1,
|
|
|
- 977 AST.MakeLeaf(AST.NkIdent, rhs));
|
|
|
- 978 AstAppend(AST.NkFieldDecl,
|
|
|
- 979 astClsF, astClsFTail, astNode);
|
|
|
- 980 IF SymTab.Lookup(rhs) THEN
|
|
|
- 981 SymTab.SetSymType(n,
|
|
|
- 982 SymTab.SymType(rhs))
|
|
|
- 983 END; .)
|
|
|
- 984 | (. IF NOT SymTab.FieldPending(ct,
|
|
|
- 985 n) THEN
|
|
|
- 986 SemError(200) END;
|
|
|
- 987 astNode := AST.MakeNode(AST.NkVarDecl);
|
|
|
- 988 AST.SetChild(astNode, 0,
|
|
|
- 989 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
- 990 { "," GetIdent<n> (. IF NOT SymTab.FieldPending(ct,
|
|
|
- 991 n) THEN
|
|
|
- 992 SemError(200) END;
|
|
|
- 993 AST.SetChild(astNode,
|
|
|
- 994 AST.NChild(astNode),
|
|
|
- 995 AST.MakeLeaf(AST.NkIdent, n)); .) }
|
|
|
- 996 ":" Type<t, FALSE> (. SymTab.FixPendingF(ct, t);
|
|
|
- 997 AST.SetTy(astNode, t);
|
|
|
- 998 AstAppend(AST.NkFieldDecl,
|
|
|
- 999 astClsF, astClsFTail, astNode); .) ) .
|
|
|
- 1000 MethodHeading<VAR pn: SymTab.Name; ct: SymTab.TypeIndex>
|
|
|
- 1001 (. VAR wantVirt: BOOLEAN; .)
|
|
|
- 1002 = (. wantVirt := FALSE; .)
|
|
|
- 1003 [ "VIRTUAL" (. wantVirt := TRUE; .) ]
|
|
|
- 1004 ProcHeading<pn, ct> (. IF wantVirt THEN
|
|
|
- 1005 SymTab.MarkVirtual END;
|
|
|
- 1006 astMethod := AST.MakeNode(AST.NkProcDecl);
|
|
|
- 1007 AST.SetChild(astMethod, 0,
|
|
|
- 1008 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
- 1009 IF wantVirt THEN
|
|
|
- 1010 AST.SetOp(astMethod, 3)
|
|
|
- 1011 ELSE AST.SetOp(astMethod, 0)
|
|
|
- 1012 END;
|
|
|
- 1013 AstAppend(AST.NkFieldDecl,
|
|
|
- 1014 astClsM, astClsMTail, astMethod); .) .
|
|
|
- 1015 ClassImplRest (. VAR cn, m2: SymTab.Name;
|
|
|
- 1016 ct: SymTab.TypeIndex; .)
|
|
|
- 1017 = GetIdent<cn> (. IF NOT SymTab.Lookup(cn) THEN
|
|
|
- 1018 SemError(201);
|
|
|
- 1019 ct := SymTab.InvalidType
|
|
|
- 1020 ELSE ct := SymTab.SymType(cn);
|
|
|
- 1021 IF SymTab.ClassOf(ct) #
|
|
|
- 1022 SymTab.ClClass THEN
|
|
|
- 1023 SemError(230);
|
|
|
- 1024 ct := SymTab.InvalidType
|
|
|
- 1025 END
|
|
|
- 1026 END;
|
|
|
- 1027 astCls := AST.MakeNode(AST.NkClassDecl);
|
|
|
- 1028 AST.SetOp(astCls, 1);
|
|
|
- 1029 AST.SetChild(astCls, 0,
|
|
|
- 1030 AST.MakeLeaf(AST.NkIdent, cn));
|
|
|
- 1031 astClsM := AST.NoNode;
|
|
|
- 1032 astClsMTail := AST.NoNode;
|
|
|
- 1033 astStmt := AST.NoNode;
|
|
|
- 1034 IF ct #
|
|
|
- 1035 SymTab.InvalidType THEN
|
|
|
- 1036 IF NOT SymTab.PushClassMembers(
|
|
|
- 1037 ct) THEN
|
|
|
- 1038 SemError(230) END;
|
|
|
- 1039 SymTab.PushImplClass(ct)
|
|
|
- 1040 END; .)
|
|
|
- 1041 ";" { MethodImpl<ct> ";" }
|
|
|
- 1042 (. astStmt := AST.NoNode; .)
|
|
|
- 1043 [ "BEGIN" (. astStmt := AST.MakeNode(AST.NkBlock);
|
|
|
- 1044 .)
|
|
|
- 1045 [ StatSeq ] ]
|
|
|
- 1046 "END"
|
|
|
- 1047 GetIdent<m2> (. IF NOT SymTab.Equal(cn, m2) THEN
|
|
|
- 1048 SemError(202) END;
|
|
|
- 1049 SymTab.PopImplClass;
|
|
|
- 1050 SymTab.PopScope;
|
|
|
- 1051 AST.SetChild(astCls, 1, AST.NoNode);
|
|
|
- 1052 AST.SetChild(astCls, 2, astStmt);
|
|
|
- 1053 AST.SetChild(astCls, 3, astClsM);
|
|
|
- 1054 astDecl := astCls; .) .
|
|
|
- 1055 MethodImpl<ct: SymTab.TypeIndex> (. VAR pn: SymTab.Name;
|
|
|
- 1056 thisQ: QbeGen.QVal;
|
|
|
- 1057 methRes: SymTab.TypeIndex; .)
|
|
|
- 1058 = MethodHeading<pn, ct> ";"
|
|
|
- 1059 (. IF (ct #
|
|
|
- 1060 SymTab.InvalidType)
|
|
|
- 1061 AND NOT SymTab.MethodExists(ct,
|
|
|
- 1062 pn) THEN
|
|
|
- 1063 SemError(201) END; .)
|
|
|
- 1064 ( "FORWARD" (. AST.SetOp(astMethod, 1);
|
|
|
- 1065 SymTab.MarkFwd;
|
|
|
- 1066 QbeGen.AbortFunc;
|
|
|
- 1067 Lower.ScopeLeave;
|
|
|
- 1068 SymTab.CloseProc; .)
|
|
|
- 1069 | (.
|
|
|
- 1070 (* bind the receiver: bare
|
|
|
- 1071 field names resolve
|
|
|
- 1072 against THIS *)
|
|
|
- 1073 QbeGen.CopyOp("@", thisQ);
|
|
|
- 1074 QbeGen.PushWith(thisQ); .)
|
|
|
- 1075 Block<pn> (. AST.SetChild(astMethod, 1, astStmt);
|
|
|
- 1076 AST.SetChild(astMethod, 2, astBlkDecls);
|
|
|
- 1077 QbeGen.PopWith;
|
|
|
- 1078 methRes := SymTab.CurRes();
|
|
|
- 1079 Lower.ScopeLeave;
|
|
|
- 1080 SymTab.CloseProc;
|
|
|
- 1081 QbeGen.EndFunc(methRes); .) ) .
|
|
|
- 1082 ConstBlock (. VAR astSeq, astTail: AST.Node; .)
|
|
|
- 1083 = "CONST" (. astSeq := AST.NoNode;
|
|
|
- 1084 astTail := AST.NoNode; .)
|
|
|
- 1085 { ConstDecl ";" (. AstAppend(AST.NkDeclSeq,
|
|
|
- 1086 astSeq, astTail, astDecl); .) }
|
|
|
- 1087 (. astDecl := astSeq; .) .
|
|
|
- 1088 ConstDecl (. VAR n: SymTab.Name;
|
|
|
- 1089 t: SymTab.TypeIndex;
|
|
|
- 1090 qv: QbeGen.QVal;
|
|
|
- 1091 cls: INTEGER;
|
|
|
- 1092 astNode: AST.Node; .)
|
|
|
- 1093 = GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
- 1094 SymTab.KindConst) THEN
|
|
|
- 1095 SemError(200) END; .)
|
|
|
- 1096 "="
|
|
|
- 1097 Expr<t, qv> (. astNode := AST.MakeNode(AST.NkConstDecl);
|
|
|
- 1098 AST.SetChild(astNode, 0,
|
|
|
- 1099 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 1100 AST.SetChild(astNode, 1, astCur);
|
|
|
- 1101 AST.SetTy(astNode, t);
|
|
|
- 1102 astDecl := astNode;
|
|
|
- 1103 Lower.NoteVar(n, SymTab.KindConst, t);
|
|
|
- 1104 Lower.NoteConstVal(qv);
|
|
|
- 1105 SymTab.SetSymType(n, t);
|
|
|
- 1106 cls := SymTab.ClassOf(t);
|
|
|
- 1107 IF (cls = SymTab.ClArray)
|
|
|
- 1108 OR (cls = SymTab.ClRecord)
|
|
|
- 1109 OR (cls = SymTab.ClClass)
|
|
|
- 1110 OR (cls = SymTab.ClStr)
|
|
|
- 1111 OR (cls = SymTab.ClUStr) THEN
|
|
|
- 1112 (* an aggregate/string
|
|
|
- 1113 constant: qv is its
|
|
|
- 1114 descriptor address; no
|
|
|
- 1115 scalar data *)
|
|
|
- 1116 SymTab.SetSymVal(n, qv)
|
|
|
- 1117 ELSIF NOT QbeGen.IsImm(qv) THEN
|
|
|
- 1118 SemError(230)
|
|
|
- 1119 ELSE
|
|
|
- 1120 SymTab.SetSymVal(n, qv);
|
|
|
- 1121 END; .) .
|
|
|
- 1122 VarBlock (. VAR astSeq, astTail: AST.Node; .)
|
|
|
- 1123 = "VAR" (. astSeq := AST.NoNode;
|
|
|
- 1124 astTail := AST.NoNode; .)
|
|
|
- 1125 { VarDecl ";" (. AstAppend(AST.NkDeclSeq,
|
|
|
- 1126 astSeq, astTail, astDecl); .) }
|
|
|
- 1127 (. astDecl := astSeq; .) .
|
|
|
- 1128 VarDecl (. VAR nm: SymTab.Name;
|
|
|
- 1129 t: SymTab.TypeIndex;
|
|
|
- 1130 i: CARDINAL;
|
|
|
- 1131 cls: INTEGER;
|
|
|
- 1132 astNode, astTail: AST.Node; .)
|
|
|
- 1133 = VarIdents ":"
|
|
|
- 1134 Type<t, FALSE> (. astNode := AST.MakeNode(AST.NkVarDecl);
|
|
|
- 1135 astTail := astNode;
|
|
|
- 1136 i := 0;
|
|
|
- 1137 WHILE i < SymTab.PendCount() DO
|
|
|
- 1138 SymTab.PendName(i, nm);
|
|
|
- 1139 Lower.NoteVar(nm, SymTab.KindVar, t);
|
|
|
- 1140 (* chunked: a VAR list can
|
|
|
- 1141 exceed AST.MaxChild *)
|
|
|
- 1142 AstAppend(AST.NkBlock,
|
|
|
- 1143 astNode, astTail,
|
|
|
- 1144 AST.MakeLeaf(AST.NkIdent, nm));
|
|
|
- 1145 INC(i)
|
|
|
- 1146 END;
|
|
|
- 1147 AST.SetTy(astNode, t);
|
|
|
- 1148 astDecl := astNode;
|
|
|
- 1149 cls := SymTab.ClassOf(t);
|
|
|
- 1150 IF (t # SymTab.InvalidType)
|
|
|
- 1151 AND NOT SymTab.IsUnresolved(t)
|
|
|
- 1152 AND (cls # SymTab.ClInt)
|
|
|
- 1153 AND (cls # SymTab.ClBool)
|
|
|
- 1154 AND (cls # SymTab.ClChar)
|
|
|
- 1155 AND (cls # SymTab.ClReal)
|
|
|
- 1156 AND (cls # SymTab.ClArray)
|
|
|
- 1157 AND (cls # SymTab.ClSet)
|
|
|
- 1158 AND (cls # SymTab.ClRecord)
|
|
|
- 1159 AND (cls # SymTab.ClPtr)
|
|
|
- 1160 AND (cls # SymTab.ClLong)
|
|
|
- 1161 AND (cls # SymTab.ClProc)
|
|
|
- 1162 AND (cls # SymTab.ClUChar)
|
|
|
- 1163 AND (cls # SymTab.ClUStr)
|
|
|
- 1164 AND (cls # SymTab.ClEnum)
|
|
|
- 1165 AND (cls # SymTab.ClClass) THEN
|
|
|
- 1166 SemError(230) END;
|
|
|
- 1167 IF QbeGen.LocFull() THEN
|
|
|
- 1168 SemError(233) END;
|
|
|
- 1169 i := 0;
|
|
|
- 1170 IF SymTab.IsUnresolved(t)
|
|
|
- 1171 AND NOT SymTab.InProc() THEN
|
|
|
- 1172 (* a forward-typed global:
|
|
|
- 1173 defer emission until the
|
|
|
- 1174 TYPE block completes *)
|
|
|
- 1175 AST.SetOp(astNode, 1);
|
|
|
- 1176 WHILE i < SymTab.PendCount() DO
|
|
|
- 1177 SymTab.PendName(i, nm);
|
|
|
- 1178 IF nPendVar <=
|
|
|
- 1179 HIGH(pendVarName) THEN
|
|
|
- 1180 pendVarName[nPendVar] := nm;
|
|
|
- 1181 pendVarT[nPendVar] := t;
|
|
|
- 1182 INC(nPendVar)
|
|
|
- 1183 END;
|
|
|
- 1184 INC(i)
|
|
|
- 1185 END
|
|
|
- 1186 ELSE
|
|
|
- 1187 WHILE i < SymTab.PendCount() DO
|
|
|
- 1188 SymTab.PendName(i, nm);
|
|
|
- 1189 INC(i)
|
|
|
- 1190 END
|
|
|
- 1191 END;
|
|
|
- 1192 (* a plain VAR list, not a
|
|
|
- 1193 heading: the signature
|
|
|
- 1194 result is discarded *)
|
|
|
- 1195 IF NOT SymTab.FixPending(t) THEN
|
|
|
- 1196 END; .) .
|
|
|
- 1197 VarIdents (. VAR n: SymTab.Name; .)
|
|
|
- 1198 = GetIdent<n> (. IF NOT SymTab.EnterPending(n,
|
|
|
- 1199 SymTab.KindVar) THEN
|
|
|
- 1200 SemError(200) END; .)
|
|
|
- 1201 { ","
|
|
|
- 1202 GetIdent<n> (. IF NOT SymTab.EnterPending(n,
|
|
|
- 1203 SymTab.KindVar) THEN
|
|
|
- 1204 SemError(200) END; .) } .
|
|
|
- 1205 ParIdents<isV: BOOLEAN> (. VAR n: SymTab.Name; .)
|
|
|
- 1206 = GetIdent<n> (. IF NOT SymTab.EnterParam(n, isV) THEN
|
|
|
- 1207 SemError(200) END; .)
|
|
|
- 1208 { "," GetIdent<n> (. IF NOT SymTab.EnterParam(n, isV) THEN
|
|
|
- 1209 SemError(200) END; .) } .
|
|
|
- 1210 (* Procedure headings enter scopes/params/result and buffer the
|
|
|
- 1211 QBE header; bodies lower to functions (4.1, module level only).
|
|
|
- 1212 FORWARD marks; the body heading re-enters (signature compare
|
|
|
- 1213 deferred). Nested procedures parse + check, lowering = 4.2. *)
|
|
|
- 1214 ProcHeading<VAR pn: SymTab.Name; methCls: SymTab.TypeIndex>
|
|
|
- 1215 (. VAR t: SymTab.TypeIndex;
|
|
|
- 1216 mg: QbeGen.QVal; .)
|
|
|
- 1217 = "PROCEDURE"
|
|
|
- 1218 GetIdent<pn> (. IF methCls #
|
|
|
- 1219 SymTab.InvalidType THEN
|
|
|
- 1220 (* a method: resume the
|
|
|
- 1221 declared symbol (reuse
|
|
|
- 1222 its uid) *)
|
|
|
- 1223 IF NOT SymTab.ResumeMethod(
|
|
|
- 1224 methCls, pn) THEN
|
|
|
- 1225 SemError(200) END
|
|
|
- 1226 ELSIF NOT SymTab.EnterProc(pn) THEN
|
|
|
- 1227 IF NOT SymTab.ReenterProc(pn) THEN
|
|
|
- 1228 IF NOT SymTab.ResumeProc(pn) THEN
|
|
|
- 1229 SemError(200) END
|
|
|
- 1230 END
|
|
|
- 1231 END;
|
|
|
- 1232 Lower.ScopeEnter;
|
|
|
- 1233 Lower.NoteProc(pn,
|
|
|
- 1234 SymTab.ProcUid(pn),
|
|
|
- 1235 SymTab.InvalidType,
|
|
|
- 1236 SymTab.ProcDepthOf(pn),
|
|
|
- 1237 FALSE);
|
|
|
- 1238 QbeGen.BeginFunc("");
|
|
|
- 1239 IF methCls #
|
|
|
- 1240 SymTab.InvalidType THEN
|
|
|
- 1241 (* hidden THIS receiver:
|
|
|
- 1242 a VAR param of the
|
|
|
- 1243 class type, pushed as
|
|
|
- 1244 the WITH base *)
|
|
|
- 1245 IF NOT SymTab.EnterThisParam(
|
|
|
- 1246 methCls) THEN
|
|
|
- 1247 SemError(200) END;
|
|
|
- 1248 IF NOT QbeGen.FuncParam(
|
|
|
- 1249 "THIS", TRUE,
|
|
|
- 1250 methCls) THEN
|
|
|
- 1251 SemError(233) END
|
|
|
- 1252 END; .)
|
|
|
- 1253 [ FormalParams ]
|
|
|
- 1254 [ ":" TypeIdent<t> (. IF NOT SymTab.SetProcRes(t) THEN
|
|
|
- 1255 SemError(235) END;
|
|
|
- 1256 Lower.SetProcRes(t); .) ] .
|
|
|
- 1257 FormalParams
|
|
|
- 1258 = "(" [ ParamSection { ";" ParamSection } ] ")" .
|
|
|
- 1259 ParamSection (. VAR t: SymTab.TypeIndex;
|
|
|
- 1260 nm: SymTab.Name;
|
|
|
- 1261 i: CARDINAL;
|
|
|
- 1262 isV: BOOLEAN; .)
|
|
|
- 1263 = (. isV := FALSE; .)
|
|
|
- 1264 [ "VAR" (. isV := TRUE; .) ]
|
|
|
- 1265 ParIdents<isV> ":" Type<t, TRUE> (. i := 0;
|
|
|
- 1266 WHILE i < SymTab.PendCount() DO
|
|
|
- 1267 SymTab.PendName(i, nm);
|
|
|
- 1268 Lower.NoteParam(nm, t, isV);
|
|
|
- 1269 Lower.NoteVar(nm, SymTab.KindParam, t);
|
|
|
- 1270 (* value open arrays are
|
|
|
- 1271 passed as descriptor
|
|
|
- 1272 addresses (no copy):
|
|
|
- 1273 same representation as
|
|
|
- 1274 VAR formals *)
|
|
|
- 1275 IF NOT QbeGen.FuncParam(nm,
|
|
|
- 1276 isV
|
|
|
- 1277 OR SymTab.IsOpenArray(t),
|
|
|
- 1278 t) THEN
|
|
|
- 1279 SemError(233) END;
|
|
|
- 1280 INC(i)
|
|
|
- 1281 END;
|
|
|
- 1282 IF NOT SymTab.FixPending(t) THEN
|
|
|
- 1283 SemError(235) END; .) .
|
|
|
- 1284 (* Nested procedures lower like top-level ones (4.2): the
|
|
|
- 1285 static link gives them their parent's frame. Methods keep
|
|
|
- 1286 parse-now/230-later. *)
|
|
|
- 1287 ProcDecl (. VAR pn: SymTab.Name;
|
|
|
- 1288 astNode: AST.Node; .)
|
|
|
- 1289 = ProcHeading<pn, SymTab.InvalidType> ";"
|
|
|
- 1290 (. astNode := AST.MakeNode(AST.NkProcDecl);
|
|
|
- 1291 AST.SetOp(astNode, 0);
|
|
|
- 1292 AST.SetChild(astNode, 0,
|
|
|
- 1293 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
- 1294 Lower.NoteProcNode(astNode); .)
|
|
|
- 1295 ( "FORWARD" (. AST.SetOp(astNode, 1);
|
|
|
- 1296 astDecl := astNode;
|
|
|
- 1297 Lower.ScopeLeave;
|
|
|
- 1298 SymTab.MarkFwd;
|
|
|
- 1299 SymTab.CloseProc;
|
|
|
- 1300 QbeGen.AbortFunc; .)
|
|
|
- 1301 | "EXTERNAL" (. AST.SetOp(astNode, 2);
|
|
|
- 1302 astDecl := astNode;
|
|
|
- 1303 Lower.MarkProcExternal;
|
|
|
- 1304 Lower.ScopeLeave;
|
|
|
- 1305 SymTab.MarkExternal("");
|
|
|
- 1306 SymTab.CloseProc;
|
|
|
- 1307 QbeGen.AbortFunc; .)
|
|
|
- 1308 |
|
|
|
- 1309 Block<pn> (. AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1310 AST.SetChild(astNode, 2, astBlkDecls);
|
|
|
- 1311 astDecl := astNode;
|
|
|
- 1312 Lower.ScopeLeave;
|
|
|
- 1313 SymTab.CloseProc;
|
|
|
- 1314 QbeGen.EndFunc(
|
|
|
- 1315 SymTab.ProcRes(pn)); .) ) .
|
|
|
- 1316 Block<pn: SymTab.Name> (. VAR m2: SymTab.Name; .)
|
|
|
- 1317 = DeclSeq (. astBlkDecls := astDecl;
|
|
|
- 1318 astStmt := AST.NoNode;
|
|
|
- 1319 nLab := 0; nGot := 0; .)
|
|
|
- 1320 [ "BEGIN" (. (* an empty body is still a
|
|
|
- 1321 body: mark it so Lower
|
|
|
- 1322 does not read it as a
|
|
|
- 1323 definition heading *)
|
|
|
- 1324 IF astStmt = AST.NoNode THEN
|
|
|
- 1325 astStmt :=
|
|
|
- 1326 AST.MakeNode(AST.NkBlock)
|
|
|
- 1327 END; .)
|
|
|
- 1328 [ StatSeq ] ]
|
|
|
- 1329 "END"
|
|
|
- 1330 GetIdent<m2> (. IF NOT SymTab.Equal(pn, m2) THEN
|
|
|
- 1331 SemError(202) END;
|
|
|
- 1332 CheckGotos; .) .
|
|
|
- 1333 StatSeq (. VAR astSeq, astTail: AST.Node; .)
|
|
|
- 1334 = (. astSeq := AST.NoNode;
|
|
|
- 1335 astTail := AST.NoNode; .)
|
|
|
- 1336 Statement (. AstAppend(AST.NkBlock,
|
|
|
- 1337 astSeq, astTail, astStmt); .)
|
|
|
- 1338 { ";" [ Statement (. AstAppend(AST.NkBlock,
|
|
|
- 1339 astSeq, astTail, astStmt); .) ] }
|
|
|
- 1340 (. astStmt := astSeq; .) .
|
|
|
- 1341 (* Trailing/empty statements (`a; ; b`, Coco/R's generated `;;`)
|
|
|
- 1342 are accepted: the statement after ';' is optional. *)
|
|
|
- 1343 Statement (. VAR lx: QbeGen.QVal; lxnm: SymTab.Name; .)
|
|
|
- 1344 = (. astStmt := AST.NoNode; .)
|
|
|
- 1345 ( AssOrCall
|
|
|
- 1346 | IfStat
|
|
|
- 1347 | WhileStat
|
|
|
- 1348 | RepeatStat
|
|
|
- 1349 | LoopStat
|
|
|
- 1350 | ForStat
|
|
|
- 1351 | CaseStat
|
|
|
- 1352 | WithStat
|
|
|
- 1353 | ReturnStat
|
|
|
- 1354 | HaltStat
|
|
|
- 1355 | NewStat
|
|
|
- 1356 | DisposeStat
|
|
|
- 1357 | IncDecStat
|
|
|
- 1358 | InclExclStat
|
|
|
- 1359 | "EXIT" (. IF NOT QbeGen.TopLoop(lx) THEN
|
|
|
- 1360 SemError(230) END;
|
|
|
- 1361 astStmt := AST.MakeNode(AST.NkExit); .)
|
|
|
- 1362 | "GOTO" GetIdent<lxnm> (. NoteGoto(lxnm);
|
|
|
- 1363 astStmt := AST.MakeNode(AST.NkGoto);
|
|
|
- 1364 AST.SetChild(astStmt, 0,
|
|
|
- 1365 AST.MakeLeaf(AST.NkIdent, lxnm)); .) ) .
|
|
|
- 1366 (* INCL(set, elem) / EXCL(set, elem): PIM set-element builtins. *)
|
|
|
- 1367 InclExclStat (. VAR at, et2: SymTab.TypeIndex;
|
|
|
- 1368 dk: INTEGER;
|
|
|
- 1369 qd, qe: QbeGen.QVal;
|
|
|
- 1370 qn: SymTab.Name;
|
|
|
- 1371 sfx, isInc: BOOLEAN;
|
|
|
- 1372 astNode, astD: AST.Node; .)
|
|
|
- 1373 = ( "INCL" (. isInc := TRUE; .)
|
|
|
- 1374 | "EXCL" (. isInc := FALSE; .) )
|
|
|
- 1375 "(" Design<at, dk, qd, qn, sfx> (. astD := astCur; .) ","
|
|
|
- 1376 Expr<et2, qe> ")"
|
|
|
- 1377 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 1378 IF isInc THEN
|
|
|
- 1379 AST.SetChild(astNode, 0,
|
|
|
- 1380 AST.MakeLeaf(AST.NkIdent, "INCL"))
|
|
|
- 1381 ELSE AST.SetChild(astNode, 0,
|
|
|
- 1382 AST.MakeLeaf(AST.NkIdent, "EXCL"))
|
|
|
- 1383 END;
|
|
|
- 1384 IF astD # AST.NoNode THEN
|
|
|
- 1385 AST.SetChild(astNode, 1, astD) END;
|
|
|
- 1386 IF astCur # AST.NoNode THEN
|
|
|
- 1387 AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 1388 astStmt := astNode; .)
|
|
|
- 1389 (. IF (at # SymTab.InvalidType)
|
|
|
- 1390 AND (SymTab.ClassOf(at) # SymTab.ClSet) THEN
|
|
|
- 1391 SemError(222)
|
|
|
- 1392 END; .) .
|
|
|
- 1393 (* INC(v [,step]) / DEC(v [,step]) as builtin statements over an
|
|
|
- 1394 integer designator. *)
|
|
|
- 1395 IncDecStat (. VAR dt, et2: SymTab.TypeIndex;
|
|
|
- 1396 dk: INTEGER;
|
|
|
- 1397 qd, qv, qn2, qstep:
|
|
|
- 1398 QbeGen.QVal;
|
|
|
- 1399 qn: SymTab.Name;
|
|
|
- 1400 sfx, isInc: BOOLEAN;
|
|
|
- 1401 astNode, astD, astStep:
|
|
|
- 1402 AST.Node; .)
|
|
|
- 1403 = (. isInc := TRUE; .)
|
|
|
- 1404 ( "INC" (. isInc := TRUE; .)
|
|
|
- 1405 | "DEC" (. isInc := FALSE; .) )
|
|
|
- 1406 "(" (. astStep := AST.NoNode; .)
|
|
|
- 1407 Design<dt, dk, qd, qn, sfx> (. astD := astCur; .)
|
|
|
- 1408 [ "," Expr<et2, qstep> (. astStep := astCur; .) ]
|
|
|
- 1409 ")" (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 1410 IF isInc THEN
|
|
|
- 1411 AST.SetChild(astNode, 0,
|
|
|
- 1412 AST.MakeLeaf(AST.NkIdent, "INC"))
|
|
|
- 1413 ELSE AST.SetChild(astNode, 0,
|
|
|
- 1414 AST.MakeLeaf(AST.NkIdent, "DEC"))
|
|
|
- 1415 END;
|
|
|
- 1416 IF astD # AST.NoNode THEN
|
|
|
- 1417 AST.SetChild(astNode, 1, astD) END;
|
|
|
- 1418 IF astStep # AST.NoNode THEN
|
|
|
- 1419 AST.SetChild(astNode, 2, astStep) END;
|
|
|
- 1420 astStmt := astNode; .) (. IF dt = SymTab.InvalidType THEN
|
|
|
- 1421 ELSIF (dk # SymTab.KindVar)
|
|
|
- 1422 AND (dk # SymTab.KindParam)
|
|
|
- 1423 AND (dk # SymTab.KindField) THEN
|
|
|
- 1424 SemError(210)
|
|
|
- 1425 ELSIF NOT SymTab.IsIntFamily(dt) THEN
|
|
|
- 1426 SemError(211)
|
|
|
- 1427 END; .) .
|
|
|
- 1428 (* NEW/DISPOSE as builtin statements (no call syntax until step 4).
|
|
|
- 1429 Targets are pointer designators; DISPOSE nils afterwards (safer
|
|
|
- 1430 than Wirth-undefined; documented). DISPOSE is shallow. *)
|
|
|
- 1431 NewStat (. VAR dt: SymTab.TypeIndex;
|
|
|
- 1432 dk: INTEGER;
|
|
|
- 1433 qd, qm: QbeGen.QVal;
|
|
|
- 1434 qn: SymTab.Name;
|
|
|
- 1435 sfx: BOOLEAN;
|
|
|
- 1436 bt: SymTab.TypeIndex;
|
|
|
- 1437 astNode, astD: AST.Node; .)
|
|
|
- 1438 = "NEW" "(" Design<dt, dk, qd, qn, sfx> (. astD := astCur; .) ")"
|
|
|
- 1439 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 1440 AST.SetChild(astNode, 0,
|
|
|
- 1441 AST.MakeLeaf(AST.NkIdent, "NEW"));
|
|
|
- 1442 IF astD # AST.NoNode THEN
|
|
|
- 1443 AST.SetChild(astNode, 1, astD) END;
|
|
|
- 1444 astStmt := astNode; .)
|
|
|
- 1445 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 1446 ELSIF (dk # SymTab.KindVar)
|
|
|
- 1447 AND (dk # SymTab.KindParam)
|
|
|
- 1448 AND (dk # SymTab.KindField) THEN
|
|
|
- 1449 SemError(210)
|
|
|
- 1450 ELSIF SymTab.ClassOf(dt) #
|
|
|
- 1451 SymTab.ClPtr THEN
|
|
|
- 1452 SemError(219)
|
|
|
- 1453 END; .) .
|
|
|
- 1454 DisposeStat (. VAR dt: SymTab.TypeIndex;
|
|
|
- 1455 dk: INTEGER;
|
|
|
- 1456 qd, qv: QbeGen.QVal;
|
|
|
- 1457 qn: SymTab.Name;
|
|
|
- 1458 sfx: BOOLEAN;
|
|
|
- 1459 astNode, astD: AST.Node; .)
|
|
|
- 1460 = "DISPOSE" "(" Design<dt, dk, qd, qn, sfx> (. astD := astCur; .) ")"
|
|
|
- 1461 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 1462 AST.SetChild(astNode, 0,
|
|
|
- 1463 AST.MakeLeaf(AST.NkIdent, "DISPOSE"));
|
|
|
- 1464 IF astD # AST.NoNode THEN
|
|
|
- 1465 AST.SetChild(astNode, 1, astD) END;
|
|
|
- 1466 astStmt := astNode; .)
|
|
|
- 1467 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 1468 ELSIF (dk # SymTab.KindVar)
|
|
|
- 1469 AND (dk # SymTab.KindParam)
|
|
|
- 1470 AND (dk # SymTab.KindField) THEN
|
|
|
- 1471 SemError(210)
|
|
|
- 1472 ELSIF SymTab.ClassOf(dt) #
|
|
|
- 1473 SymTab.ClPtr THEN
|
|
|
- 1474 SemError(219)
|
|
|
- 1475 END; .) .
|
|
|
- 1476 (* WITH pushes each record's fields (inner wins) plus its base
|
|
|
- 1477 address; field designators resolve through both stacks. *)
|
|
|
- 1478 WithStat (. VAR nW: CARDINAL;
|
|
|
- 1479 astNode: AST.Node; .)
|
|
|
- 1480 = "WITH" (. nW := 0;
|
|
|
- 1481 astNode := AST.MakeNode(AST.NkWith); .)
|
|
|
- 1482 WithItem<nW, astNode> { "," WithItem<nW, astNode> }
|
|
|
- 1483 "DO" (. astStmt := AST.NoNode; .)
|
|
|
- 1484 [ StatSeq ] "END" (. AST.SetChild(astNode,
|
|
|
- 1485 AST.NChild(astNode), astStmt);
|
|
|
- 1486 astStmt := astNode;
|
|
|
- 1487 WHILE nW > 0 DO
|
|
|
- 1488 SymTab.PopScope;
|
|
|
- 1489 QbeGen.PopWith;
|
|
|
- 1490 DEC(nW)
|
|
|
- 1491 END; .) .
|
|
|
- 1492 WithItem<VAR nW: CARDINAL; wnode: AST.Node>
|
|
|
- 1493 (. VAR dt: SymTab.TypeIndex;
|
|
|
- 1494 dk: INTEGER;
|
|
|
- 1495 qd, qe: QbeGen.QVal;
|
|
|
- 1496 qn: SymTab.Name;
|
|
|
- 1497 sfx: BOOLEAN; .)
|
|
|
- 1498 = Design<dt, dk, qd, qn, sfx>
|
|
|
- 1499 (. IF astCur # AST.NoNode THEN
|
|
|
- 1500 AST.SetChild(wnode,
|
|
|
- 1501 AST.NChild(wnode), astCur) END;
|
|
|
- 1502 IF dt = SymTab.InvalidType THEN
|
|
|
- 1503 ELSIF (SymTab.ClassOf(dt) #
|
|
|
- 1504 SymTab.ClRecord)
|
|
|
- 1505 AND (SymTab.ClassOf(dt) #
|
|
|
- 1506 SymTab.ClClass) THEN
|
|
|
- 1507 SemError(215)
|
|
|
- 1508 ELSIF SymTab.PushRecord(dt) THEN
|
|
|
- 1509 QbeGen.PushWith(qd);
|
|
|
- 1510 INC(nW)
|
|
|
- 1511 END; .) .
|
|
|
- 1512 (* Assignment or procedure-statement call (4.1, module level).
|
|
|
- 1513 Bare `P;` is a syntax error; function-as-statement is 233. *)
|
|
|
- 1514 AssOrCall (. VAR dt, et: SymTab.TypeIndex;
|
|
|
- 1515 dk: INTEGER;
|
|
|
- 1516 qd, qe, qt, ql: QbeGen.QVal;
|
|
|
- 1517 qn: SymTab.Name;
|
|
|
- 1518 ct2, res0: SymTab.TypeIndex;
|
|
|
- 1519 q2, mg0: QbeGen.QVal;
|
|
|
- 1520 isR, conv, wconv: BOOLEAN;
|
|
|
- 1521 called, sfx: BOOLEAN;
|
|
|
- 1522 astLhs, astRes: AST.Node; mname: SymTab.Name; isM: BOOLEAN;
|
|
|
- 1523 n: SymTab.Name; astLab, astNode: AST.Node; .)
|
|
|
- 1524 = GetIdent<n>
|
|
|
- 1525 ( ":" (. NoteLabel(n);
|
|
|
- 1526 astNode := AST.MakeNode(AST.NkLabel);
|
|
|
- 1527 AST.SetChild(astNode, 0,
|
|
|
- 1528 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 1529 astLab := AST.MakeNode(AST.NkBlock);
|
|
|
- 1530 AST.SetChild(astLab, 0, astNode); .)
|
|
|
- 1531 Statement (. IF astStmt # AST.NoNode THEN
|
|
|
- 1532 AST.SetChild(astLab, 1, astStmt) END;
|
|
|
- 1533 astStmt := astLab; .)
|
|
|
- 1534 | DesignTail<n, dt, dk, qd, qn, sfx>
|
|
|
- 1535 (. astLhs := astCur; astNArgs := 0; .)
|
|
|
- 1536 ( ":="
|
|
|
- 1537 Expr<et, qe> (. astStmt := AST.MakeBin(
|
|
|
- 1538 AST.NkAssign, 0, astLhs, astCur);
|
|
|
- 1539 IF (dt # SymTab.InvalidType)
|
|
|
- 1540 AND (dk # SymTab.KindVar)
|
|
|
- 1541 AND (dk # SymTab.KindParam)
|
|
|
- 1542 AND (dk # SymTab.KindField) THEN
|
|
|
- 1543 SemError(210)
|
|
|
- 1544 ELSIF NOT SymTab.Assignable(et,
|
|
|
- 1545 dt) THEN
|
|
|
- 1546 SemError(210)
|
|
|
- 1547 ELSIF (dt # SymTab.InvalidType)
|
|
|
- 1548 AND (SymTab.ClassOf(dt) =
|
|
|
- 1549 SymTab.ClClass) THEN
|
|
|
- 1550 SemError(230) END;
|
|
|
- 1551 isR := (dt #
|
|
|
- 1552 SymTab.InvalidType)
|
|
|
- 1553 AND (SymTab.ClassOf(dt)
|
|
|
- 1554 = SymTab.ClReal);
|
|
|
- 1555 conv := isR
|
|
|
- 1556 AND SymTab.IsIntFamily(et);
|
|
|
- 1557 wconv := (dt #
|
|
|
- 1558 SymTab.InvalidType)
|
|
|
- 1559 AND SymTab.IsLongFamily(dt)
|
|
|
- 1560 AND SymTab.IsIntFamily(et);
|
|
|
- 1561 IF ((dk = SymTab.KindVar)
|
|
|
- 1562 OR (dk = SymTab.KindParam)
|
|
|
- 1563 OR (dk = SymTab.KindField))
|
|
|
- 1564 AND (dt # SymTab.InvalidType)
|
|
|
- 1565 AND (et # SymTab.InvalidType)
|
|
|
- 1566 AND (SymTab.ClassOf(dt) #
|
|
|
- 1567 SymTab.ClClass) THEN
|
|
|
- 1568 END; .)
|
|
|
- 1569 | ArgList<qn, dt, qd, TRUE, TRUE, methCls, ct2, q2, called>
|
|
|
- 1570 (. astRes := AstCallNode(astLhs);
|
|
|
- 1571 sfx := FALSE; .)
|
|
|
- 1572 ( { ResultComp<ct2, q2, sfx, astRes, mname, methCls, isM> }
|
|
|
- 1573 ":=" Expr<et, qe> (. astStmt := AST.MakeBin(
|
|
|
- 1574 AST.NkAssign, 0, astRes, astCur);
|
|
|
- 1575 IF NOT sfx THEN
|
|
|
- 1576 SemError(233)
|
|
|
- 1577 ELSIF (ct2 # SymTab.InvalidType)
|
|
|
- 1578 AND NOT SymTab.Assignable(et, ct2) THEN
|
|
|
- 1579 SemError(210)
|
|
|
- 1580 END; .)
|
|
|
- 1581 | (. IF ct2 #
|
|
|
- 1582 SymTab.InvalidType THEN
|
|
|
- 1583 SemError(233) END;
|
|
|
- 1584 astStmt := astRes; .) )
|
|
|
- 1585 | (* bare `P;`: proper parameterless
|
|
|
- 1586 procedure call; anything else
|
|
|
- 1587 here is 233 (was a bare syntax
|
|
|
- 1588 error before 4.2) *)
|
|
|
- 1589 (. astStmt := AstCallNode(astLhs);
|
|
|
- 1590 IF (dk = SymTab.KindProc)
|
|
|
- 1591 AND NOT sfx THEN
|
|
|
- 1592 res0 := SymTab.ProcRes(qn);
|
|
|
- 1593 IF res0 #
|
|
|
- 1594 SymTab.InvalidType THEN
|
|
|
- 1595 SemError(233)
|
|
|
- 1596 ELSIF SymTab.ProcNPar(qn) #
|
|
|
- 1597 0 THEN
|
|
|
- 1598 SemError(233)
|
|
|
- 1599 END
|
|
|
- 1600 ELSE SemError(233)
|
|
|
- 1601 END; .) ) ) .
|
|
|
- 1602 (* Actual-parameter list shared by statement and expression calls.
|
|
|
- 1603 want selects CallEnd's result handling; t/q carry the call
|
|
|
- 1604 value (statement calls discard). Arity/type failures are 233;
|
|
|
- 1605 evaluation code still emits so the .ssa stays assembleable. *)
|
|
|
- 1606 ArgList<pn: SymTab.Name; pt: SymTab.TypeIndex; callee: QbeGen.QVal;
|
|
|
- 1607 want: BOOLEAN; soft: BOOLEAN; methCls: SymTab.TypeIndex;
|
|
|
- 1608 VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
- 1609 VAR called: BOOLEAN> (. VAR i, np: CARDINAL;
|
|
|
- 1610 vs: INTEGER;
|
|
|
- 1611 res: SymTab.TypeIndex;
|
|
|
- 1612 mg: QbeGen.QVal;
|
|
|
- 1613 ok, ind, isMeth, va: BOOLEAN; .)
|
|
|
- 1614 = "(" (. called := TRUE;
|
|
|
- 1615 ok := TRUE;
|
|
|
- 1616 ind := FALSE;
|
|
|
- 1617 isMeth := methCls #
|
|
|
- 1618 SymTab.InvalidType;
|
|
|
- 1619 IF isMeth THEN
|
|
|
- 1620 res := SymTab.ClassMethodRes(methCls, pn)
|
|
|
- 1621 ELSIF SymTab.SymKind(pn) = SymTab.KindProc THEN
|
|
|
- 1622 res := SymTab.ProcRes(pn)
|
|
|
- 1623 ELSIF (pt # SymTab.InvalidType)
|
|
|
- 1624 AND (SymTab.ClassOf(pt) = SymTab.ClProc) THEN
|
|
|
- 1625 ind := TRUE;
|
|
|
- 1626 res := SymTab.ProcTypeRes(pt)
|
|
|
- 1627 ELSE SemError(233);
|
|
|
- 1628 ok := FALSE;
|
|
|
- 1629 res := SymTab.InvalidType
|
|
|
- 1630 END;
|
|
|
- 1631 i := 0; .)
|
|
|
- 1632 [ ActParam<pn, pt, ind, methCls, i> (. INC(i); .)
|
|
|
- 1633 { "," ActParam<pn, pt, ind, methCls, i> (. INC(i); .) } ]
|
|
|
- 1634 ")" (. IF ok THEN
|
|
|
- 1635 IF isMeth THEN
|
|
|
- 1636 np := SymTab.ClassMethodNPar(
|
|
|
- 1637 methCls, pn)
|
|
|
- 1638 ELSIF ind THEN
|
|
|
- 1639 np := SymTab.ProcTypeNPar(pt)
|
|
|
- 1640 ELSE np := SymTab.ProcNPar(pn)
|
|
|
- 1641 END;
|
|
|
- 1642 va := (NOT isMeth) AND (NOT ind)
|
|
|
- 1643 AND (SymTab.SymKind(pn) =
|
|
|
- 1644 SymTab.KindProc)
|
|
|
- 1645 AND SymTab.Varargs(pn);
|
|
|
- 1646 IF (i # np) AND NOT va THEN
|
|
|
- 1647 SemError(233); ok := FALSE
|
|
|
- 1648 END
|
|
|
- 1649 END;
|
|
|
- 1650 IF NOT ok THEN
|
|
|
- 1651 t := SymTab.InvalidType;
|
|
|
- 1652 QbeGen.CopyOp("0", q)
|
|
|
- 1653 ELSIF want THEN
|
|
|
- 1654 IF res =
|
|
|
- 1655 SymTab.InvalidType THEN
|
|
|
- 1656 IF NOT soft THEN SemError(233) END;
|
|
|
- 1657 t := SymTab.InvalidType;
|
|
|
- 1658 QbeGen.CopyOp("0", q)
|
|
|
- 1659 ELSE t := res;
|
|
|
- 1660 QbeGen.CopyOp("@", q)
|
|
|
- 1661 END
|
|
|
- 1662 ELSE
|
|
|
- 1663 IF res #
|
|
|
- 1664 SymTab.InvalidType THEN
|
|
|
- 1665 SemError(233)
|
|
|
- 1666 END;
|
|
|
- 1667 t := SymTab.InvalidType;
|
|
|
- 1668 QbeGen.CopyOp("0", q);
|
|
|
- 1669 END; .) .
|
|
|
- 1670 (* One actual: VAR formals take recorded designator addresses
|
|
|
- 1671 (233 otherwise); value formals take converted expressions. *)
|
|
|
- 1672 ActParam<pn: SymTab.Name; pt: SymTab.TypeIndex; ind: BOOLEAN;
|
|
|
- 1673 methCls: SymTab.TypeIndex; i: CARDINAL>
|
|
|
- 1674 (. VAR at, ft: SymTab.TypeIndex;
|
|
|
- 1675 qe, qa, qt: QbeGen.QVal;
|
|
|
- 1676 isV, conv, va: BOOLEAN;
|
|
|
- 1677 cl: CHAR;
|
|
|
- 1678 savedN, aj: CARDINAL;
|
|
|
- 1679 savedArgs: ARRAY [0 .. 31]
|
|
|
- 1680 OF AST.Node;
|
|
|
- 1681 astActual: AST.Node; .)
|
|
|
- 1682 = (. (* Parsing the actual can clobber
|
|
|
- 1683 the enclosing call's argument
|
|
|
- 1684 list (Factor resets astNArgs),
|
|
|
- 1685 so save/restore it. *)
|
|
|
- 1686 savedN := astNArgs; aj := 0;
|
|
|
- 1687 WHILE aj <= HIGH(astArgs) DO
|
|
|
- 1688 savedArgs[aj] := astArgs[aj];
|
|
|
- 1689 INC(aj)
|
|
|
- 1690 END; .)
|
|
|
- 1691 Expr<at, qe> (. astActual := astCur;
|
|
|
- 1692 astNArgs := savedN; aj := 0;
|
|
|
- 1693 WHILE aj <= HIGH(astArgs) DO
|
|
|
- 1694 astArgs[aj] := savedArgs[aj];
|
|
|
- 1695 INC(aj)
|
|
|
- 1696 END;
|
|
|
- 1697 IF astNArgs <= HIGH(astArgs) THEN
|
|
|
- 1698 astArgs[astNArgs] := astCur;
|
|
|
- 1699 INC(astNArgs)
|
|
|
- 1700 END;
|
|
|
- 1701 va := (NOT ind)
|
|
|
- 1702 AND (methCls =
|
|
|
- 1703 SymTab.InvalidType)
|
|
|
- 1704 AND (SymTab.SymKind(pn) =
|
|
|
- 1705 SymTab.KindProc)
|
|
|
- 1706 AND SymTab.Varargs(pn);
|
|
|
- 1707 IF ind THEN
|
|
|
- 1708 ft :=
|
|
|
- 1709 SymTab.ProcTypeParamType(pt,
|
|
|
- 1710 i);
|
|
|
- 1711 isV :=
|
|
|
- 1712 SymTab.ProcTypeParamIsVar(pt,
|
|
|
- 1713 i)
|
|
|
- 1714 ELSIF methCls #
|
|
|
- 1715 SymTab.InvalidType THEN
|
|
|
- 1716 ft :=
|
|
|
- 1717 SymTab.ClassMethodParamType(
|
|
|
- 1718 methCls, pn, i);
|
|
|
- 1719 isV :=
|
|
|
- 1720 SymTab.ClassMethodParamIsVar(
|
|
|
- 1721 methCls, pn, i)
|
|
|
- 1722 ELSE
|
|
|
- 1723 ft := SymTab.ParamType(pn, i);
|
|
|
- 1724 isV := SymTab.ParamIsVar(pn, i)
|
|
|
- 1725 END;
|
|
|
- 1726 IF (at = SymTab.InvalidType) THEN
|
|
|
- 1727 ELSIF ft = SymTab.InvalidType THEN
|
|
|
- 1728 ELSIF isV THEN
|
|
|
- 1729 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
- 1730 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
- 1731 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
- 1732 AND QbeGen.IsImm(qe) THEN
|
|
|
- 1733 ELSIF (AST.Kind(astActual) #
|
|
|
- 1734 AST.NkDesignator)
|
|
|
- 1735 AND (AST.Kind(astActual) # AST.NkStrLit) THEN
|
|
|
- 1736 SemError(233)
|
|
|
- 1737 ELSIF NOT SymTab.VarParamOk(at, ft) THEN
|
|
|
- 1738 SemError(233)
|
|
|
- 1739 END
|
|
|
- 1740 ELSE
|
|
|
- 1741 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
- 1742 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
- 1743 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
- 1744 AND QbeGen.IsImm(qe) THEN
|
|
|
- 1745 ELSIF NOT SymTab.Assignable(at, ft) THEN
|
|
|
- 1746 SemError(233)
|
|
|
- 1747 END
|
|
|
- 1748 END; .) .
|
|
|
- 1749 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1750 q: QbeGen.QVal;
|
|
|
- 1751 hasElse: BOOLEAN;
|
|
|
- 1752 astCond, astIf, astLast,
|
|
|
- 1753 astNode: AST.Node; .)
|
|
|
- 1754 = "IF" (. hasElse := FALSE; .)
|
|
|
- 1755 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
- 1756 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1757 SemError(214) END; .)
|
|
|
- 1758 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
- 1759 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1760 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1761 astIf := astNode;
|
|
|
- 1762 astLast := astNode; .)
|
|
|
- 1763 { "ELSIF"
|
|
|
- 1764 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
- 1765 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1766 SemError(214) END; .)
|
|
|
- 1767 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
- 1768 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1769 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1770 AST.SetChild(astLast, 2, astNode);
|
|
|
- 1771 astLast := astNode; .) }
|
|
|
- 1772 [ "ELSE" (. hasElse := TRUE;
|
|
|
- 1773 astStmt := AST.NoNode; .)
|
|
|
- 1774 [ StatSeq ] (. AST.SetChild(astLast, 2, astStmt); .) ]
|
|
|
- 1775 "END" (. astStmt := astIf; .) .
|
|
|
- 1776 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1777 q: QbeGen.QVal;
|
|
|
- 1778 astCond, astNode: AST.Node; .)
|
|
|
- 1779 = "WHILE" (. astStmt := AST.NoNode; .)
|
|
|
- 1780 Expr<t, q> (. astCond := astCur;
|
|
|
- 1781 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1782 SemError(214) END; .)
|
|
|
- 1783 "DO" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkWhile);
|
|
|
- 1784 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1785 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1786 astStmt := astNode; .)
|
|
|
- 1787 "END" .
|
|
|
- 1788 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1789 q: QbeGen.QVal;
|
|
|
- 1790 astCond, astBody, astNode:
|
|
|
- 1791 AST.Node; .)
|
|
|
- 1792 = "REPEAT" (. astStmt := AST.NoNode; .)
|
|
|
- 1793 [ StatSeq ] (. astBody := astStmt; .)
|
|
|
- 1794 "UNTIL" Expr<t, q> (. astCond := astCur;
|
|
|
- 1795 astNode := AST.MakeNode(AST.NkRepeat);
|
|
|
- 1796 AST.SetChild(astNode, 0, astBody);
|
|
|
- 1797 AST.SetChild(astNode, 1, astCond);
|
|
|
- 1798 astStmt := astNode;
|
|
|
- 1799 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1800 SemError(214) END; .) .
|
|
|
- 1801 LoopStat (. VAR lEnd: QbeGen.QVal; astNode: AST.Node; .)
|
|
|
- 1802 = "LOOP" (. astStmt := AST.NoNode;
|
|
|
- 1803 QbeGen.NewLabel(lEnd);
|
|
|
- 1804 QbeGen.PushLoop(lEnd); .)
|
|
|
- 1805 [ StatSeq ]
|
|
|
- 1806 "END" (. astNode := AST.MakeNode(AST.NkLoop);
|
|
|
- 1807 AST.SetChild(astNode, 0, astStmt);
|
|
|
- 1808 astStmt := astNode;
|
|
|
- 1809 QbeGen.PopLoop; .) .
|
|
|
- 1810 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
- 1811 Runtime direction would need a compare-select; the literal
|
|
|
- 1812 sign picks cslew/csegew at "DO" time. *)
|
|
|
- 1813 ForStat (. VAR lv: SymTab.Name;
|
|
|
- 1814 tlo, thi, tby:
|
|
|
- 1815 SymTab.TypeIndex;
|
|
|
- 1816 qlo, qhi, qby, qt, qk, qb:
|
|
|
- 1817 QbeGen.QVal;
|
|
|
- 1818 lTop, lBody, lEnd:
|
|
|
- 1819 QbeGen.QVal;
|
|
|
- 1820 by: INTEGER;
|
|
|
- 1821 ok: BOOLEAN;
|
|
|
- 1822 astVar, astLo, astHi, astBy,
|
|
|
- 1823 astNode: AST.Node; .)
|
|
|
- 1824 = "FOR" (. by := 1; .)
|
|
|
- 1825 GetIdent<lv> (. astVar := AST.MakeLeaf(AST.NkIdent, lv);
|
|
|
- 1826 astStmt := AST.NoNode;
|
|
|
- 1827 astBy := AST.NoNode;
|
|
|
- 1828 ok := SymTab.Lookup(lv);
|
|
|
- 1829 IF NOT ok THEN
|
|
|
- 1830 SemError(201)
|
|
|
- 1831 ELSIF (SymTab.SymKind(lv) #
|
|
|
- 1832 SymTab.KindVar)
|
|
|
- 1833 AND (SymTab.SymKind(lv) #
|
|
|
- 1834 SymTab.KindParam) THEN
|
|
|
- 1835 SemError(220); ok := FALSE
|
|
|
- 1836 ELSIF NOT SymTab.IsIntFamily(
|
|
|
- 1837 SymTab.SymType(lv)) THEN
|
|
|
- 1838 SemError(220); ok := FALSE
|
|
|
- 1839 END; .)
|
|
|
- 1840 ":=" Expr<tlo, qlo> (. astLo := astCur;
|
|
|
- 1841 IF NOT SymTab.IsIntFamily(tlo) THEN
|
|
|
- 1842 SemError(220); ok := FALSE
|
|
|
- 1843 END; .)
|
|
|
- 1844 "TO" Expr<thi, qhi> (. astHi := astCur;
|
|
|
- 1845 IF NOT SymTab.IsIntFamily(thi) THEN
|
|
|
- 1846 SemError(220); ok := FALSE
|
|
|
- 1847 END; .)
|
|
|
- 1848 [ "BY" Expr<tby, qby> (. astBy := astCur;
|
|
|
- 1849 IF (tby #
|
|
|
- 1850 SymTab.InvalidType)
|
|
|
- 1851 AND NOT SymTab.IsIntFamily(tby) THEN
|
|
|
- 1852 SemError(220); ok := FALSE
|
|
|
- 1853 END;
|
|
|
- 1854 IF NOT SymTab.ConstInt(qby, by) THEN
|
|
|
- 1855 SemError(230); by := 1
|
|
|
- 1856 ELSIF by = 0 THEN
|
|
|
- 1857 SemError(220); by := 1
|
|
|
- 1858 END; .) ]
|
|
|
- 1859 "DO"
|
|
|
- 1860 [ StatSeq ]
|
|
|
- 1861 "END" (. astNode := AST.MakeNode(AST.NkFor);
|
|
|
- 1862 AST.SetChild(astNode, 0, astVar);
|
|
|
- 1863 AST.SetChild(astNode, 1, astLo);
|
|
|
- 1864 AST.SetChild(astNode, 2, astHi);
|
|
|
- 1865 AST.SetChild(astNode, 3, astBy);
|
|
|
- 1866 AST.SetChild(astNode, 4, astStmt);
|
|
|
- 1867 astStmt := astNode;
|
|
|
- 1868 .) .
|
|
|
- 1869 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
- 1870 qsel, lEnd: QbeGen.QVal;
|
|
|
- 1871 arm, astNode, astArms,
|
|
|
- 1872 astArmsTail: AST.Node; .)
|
|
|
- 1873 = "CASE" Expr<tsel, qsel> (. astNode := AST.MakeNode(AST.NkCase);
|
|
|
- 1874 AST.SetChild(astNode, 0, astCur);
|
|
|
- 1875 astArms := AST.NoNode;
|
|
|
- 1876 astArmsTail := AST.NoNode;
|
|
|
- 1877 .)
|
|
|
- 1878 "OF" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail>
|
|
|
- 1879 { "|" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail> }
|
|
|
- 1880 [ "ELSE" (. astStmt := AST.NoNode; .)
|
|
|
- 1881 [ StatSeq ] (. arm := AST.MakeNode(AST.NkCaseArm);
|
|
|
- 1882 AST.SetOp(arm, 1);
|
|
|
- 1883 AST.SetChild(arm, 0, astStmt);
|
|
|
- 1884 AstAppend(AST.NkBlock,
|
|
|
- 1885 astArms, astArmsTail, arm); .) ]
|
|
|
- 1886 "END" (. AST.SetChild(astNode, 1, astArms);
|
|
|
- 1887 astStmt := astNode;
|
|
|
- 1888 .) .
|
|
|
- 1889 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
- 1890 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
- 1891 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
- 1892 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
- 1893 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 1894 lEnd: QbeGen.QVal; VAR arms, armsTail: AST.Node>
|
|
|
- 1895 (. VAR arm: AST.Node; .)
|
|
|
- 1896 = (. arm := AST.MakeNode(AST.NkCaseArm); .)
|
|
|
- 1897 CaseLabel<tsel, qsel, arm>
|
|
|
- 1898 { "," CaseLabel<tsel, qsel, arm> }
|
|
|
- 1899 ":" (. astStmt := AST.NoNode; .)
|
|
|
- 1900 [ StatSeq ] (. AST.SetChild(arm, AST.NChild(arm),
|
|
|
- 1901 astStmt);
|
|
|
- 1902 AstAppend(AST.NkBlock,
|
|
|
- 1903 arms, armsTail, arm);
|
|
|
- 1904 .) .
|
|
|
- 1905 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 1906 arm: AST.Node>
|
|
|
- 1907 (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
- 1908 q2, q3, qc, qd, qe:
|
|
|
- 1909 QbeGen.QVal;
|
|
|
- 1910 astLab: AST.Node;
|
|
|
- 1911 lNext: QbeGen.QVal; .)
|
|
|
- 1912 = Expr<t2, q2> (. astLab := astCur;
|
|
|
- 1913 IF (t2 #
|
|
|
- 1914 SymTab.InvalidType)
|
|
|
- 1915 AND (tsel #
|
|
|
- 1916 SymTab.InvalidType)
|
|
|
- 1917 AND ((SymTab.ClassOf(t2) =
|
|
|
- 1918 SymTab.ClSet)
|
|
|
- 1919 OR (SymTab.ClassOf(tsel) =
|
|
|
- 1920 SymTab.ClSet)) THEN
|
|
|
- 1921 SemError(230)
|
|
|
- 1922 ELSIF (t2 #
|
|
|
- 1923 SymTab.InvalidType)
|
|
|
- 1924 AND (tsel #
|
|
|
- 1925 SymTab.InvalidType)
|
|
|
- 1926 AND NOT SymTab.EqCheck(t2,
|
|
|
- 1927 tsel) THEN
|
|
|
- 1928 SemError(213) END;
|
|
|
- 1929 IF NOT QbeGen.IsImm(q2) THEN
|
|
|
- 1930 SemError(230)
|
|
|
- 1931 END; .)
|
|
|
- 1932 [ ".." Expr<t3, q3> (. astLab := AST.MakeBin(
|
|
|
- 1933 AST.NkSubrange, 0, astLab, astCur);
|
|
|
- 1934 IF (t3 #
|
|
|
- 1935 SymTab.InvalidType)
|
|
|
- 1936 AND (tsel #
|
|
|
- 1937 SymTab.InvalidType)
|
|
|
- 1938 AND NOT SymTab.EqCheck(t3,
|
|
|
- 1939 tsel) THEN
|
|
|
- 1940 SemError(213) END;
|
|
|
- 1941 IF NOT QbeGen.IsImm(q3) THEN
|
|
|
- 1942 SemError(230)
|
|
|
- 1943 END; .) ]
|
|
|
- 1944 (. AST.SetChild(arm,
|
|
|
- 1945 AST.NChild(arm), astLab); .) .
|
|
|
- 1946 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1947 q, qt: QbeGen.QVal;
|
|
|
- 1948 res: SymTab.TypeIndex;
|
|
|
- 1949 hadE, conv: BOOLEAN;
|
|
|
- 1950 astVal, astNode: AST.Node; .)
|
|
|
- 1951 = "RETURN" (. hadE := FALSE; astStmt := AST.NoNode; .)
|
|
|
- 1952 [ Expr<t, q> (. hadE := TRUE; astVal := astCur; .) ]
|
|
|
- 1953 (. astNode := AST.MakeNode(AST.NkReturn);
|
|
|
- 1954 IF hadE THEN
|
|
|
- 1955 AST.SetChild(astNode, 0, astVal)
|
|
|
- 1956 END;
|
|
|
- 1957 astStmt := astNode;
|
|
|
- 1958 conv := FALSE;
|
|
|
- 1959 IF NOT SymTab.InProc() THEN
|
|
|
- 1960 SemError(232)
|
|
|
- 1961 ELSE res := SymTab.CurRes();
|
|
|
- 1962 IF NOT hadE THEN
|
|
|
- 1963 IF res #
|
|
|
- 1964 SymTab.InvalidType THEN
|
|
|
- 1965 SemError(232)
|
|
|
- 1966 END
|
|
|
- 1967 ELSIF (res =
|
|
|
- 1968 SymTab.InvalidType)
|
|
|
- 1969 OR (t #
|
|
|
- 1970 SymTab.InvalidType)
|
|
|
- 1971 AND NOT SymTab.Assignable(t,
|
|
|
- 1972 res) THEN
|
|
|
- 1973 SemError(232)
|
|
|
- 1974 END
|
|
|
- 1975 END; .) .
|
|
|
- 1976 HaltStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1977 q: QbeGen.QVal;
|
|
|
- 1978 astVal, astNode: AST.Node; .)
|
|
|
- 1979 = "HALT" (. astVal := AST.NoNode; .)
|
|
|
- 1980 [ "(" Expr<t, q> (. astVal := astCur; .) ")" ]
|
|
|
- 1981 (. astNode := AST.MakeNode(AST.NkHalt);
|
|
|
- 1982 IF astVal # AST.NoNode THEN
|
|
|
- 1983 AST.SetChild(astNode, 0, astVal)
|
|
|
- 1984 END;
|
|
|
- 1985 astStmt := astNode;
|
|
|
- 1986 .) .
|
|
|
- 1987 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
- 1988 Each index descends one level (bounds-checked, trap on breach);
|
|
|
- 1989 nested levels reload the inner descriptor address. q ends as the
|
|
|
- 1990 value (scalars), the descriptor address (plain arrays), or the
|
|
|
- 1991 element address (indexed); sfx marks the indexed form. *)
|
|
|
- 1992 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
- 1993 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
- 1994 (. VAR n: SymTab.Name; .)
|
|
|
- 1995 = GetIdent<n> DesignTail<n, t, k, q, qn, sfx> .
|
|
|
- 1996 (* The part of Design after the identifier: resolve it and walk the
|
|
|
- 1997 selectors. Split out so a statement can decide between a label
|
|
|
- 1998 (`ident :`) and a designator (`ident := ...`) with one token. *)
|
|
|
- 1999 DesignTail<VAR n: SymTab.Name; VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
- 2000 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
- 2001 (. VAR fn, mal: SymTab.Name;
|
|
|
- 2002 cls: INTEGER;
|
|
|
- 2003 ic: SymTab.TypeIndex;
|
|
|
- 2004 curT, it, eT, bt:
|
|
|
- 2005 SymTab.TypeIndex;
|
|
|
- 2006 iq, ql, qlo, qhi, qe:
|
|
|
- 2007 QbeGen.QVal;
|
|
|
- 2008 lo, hi: INTEGER;
|
|
|
- 2009 fo: INTEGER;
|
|
|
- 2010 isOpen: BOOLEAN;
|
|
|
- 2011 qb, cv: QbeGen.QVal;
|
|
|
- 2012 fid, fref, slot: INTEGER;
|
|
|
- 2013 r: BOOLEAN;
|
|
|
- 2014 astDes, astSel: AST.Node;
|
|
|
- 2015 fwd: BOOLEAN; .)
|
|
|
- 2016 = (. methCls := SymTab.InvalidType;
|
|
|
- 2017 QbeGen.CopyOp(n, qn);
|
|
|
- 2018 sfx := FALSE; fwd := FALSE;
|
|
|
- 2019 fid := 0; fref := 0; slot := 0;
|
|
|
- 2020 IF NOT SymTab.Lookup(n) THEN
|
|
|
- 2021 (* a bare method name inside
|
|
|
- 2022 a CLASS IMPLEMENTATION
|
|
|
- 2023 is a sibling call on
|
|
|
- 2024 THIS *)
|
|
|
- 2025 ic := SymTab.CurImplClass();
|
|
|
- 2026 IF (ic #
|
|
|
- 2027 SymTab.InvalidType)
|
|
|
- 2028 AND SymTab.MethodExists(ic, n) THEN
|
|
|
- 2029 sfx := FALSE;
|
|
|
- 2030 QbeGen.CopyOp("@", q);
|
|
|
- 2031 methCls := ic;
|
|
|
- 2032 k := SymTab.KindProc;
|
|
|
- 2033 t := SymTab.InvalidType
|
|
|
- 2034 ELSIF SymTab.InProc() THEN
|
|
|
- 2035 (* not declared yet: a
|
|
|
- 2036 forward reference to a
|
|
|
- 2037 module-level variable
|
|
|
- 2038 declared further down. *)
|
|
|
- 2039 k := SymTab.KindVar;
|
|
|
- 2040 r := SymTab.FwdVarRef(n, k,
|
|
|
- 2041 fref, t);
|
|
|
- 2042 FwdVarNote(fref, 0);
|
|
|
- 2043 QbeGen.CopyOp("@", q);
|
|
|
- 2044 sfx := TRUE; fwd := TRUE
|
|
|
- 2045 ELSE
|
|
|
- 2046 SemError(201);
|
|
|
- 2047 t :=
|
|
|
- 2048 SymTab.InvalidType;
|
|
|
- 2049 k := -1;
|
|
|
- 2050 QbeGen.CopyOp("0", q)
|
|
|
- 2051 END
|
|
|
- 2052 ELSE
|
|
|
- 2053 t := SymTab.SymType(n);
|
|
|
- 2054 k := SymTab.SymKind(n);
|
|
|
- 2055 IF k = SymTab.KindConst THEN
|
|
|
- 2056 IF SymTab.Equal(n,
|
|
|
- 2057 "TRUE") THEN
|
|
|
- 2058 t := SymTab.BoolType();
|
|
|
- 2059 QbeGen.CopyOp("1", q)
|
|
|
- 2060 ELSIF SymTab.Equal(n,
|
|
|
- 2061 "FALSE") THEN
|
|
|
- 2062 t := SymTab.BoolType();
|
|
|
- 2063 QbeGen.CopyOp("0", q)
|
|
|
- 2064 ELSIF SymTab.Equal(n,
|
|
|
- 2065 "NIL") THEN
|
|
|
- 2066 QbeGen.CopyOp("0", q)
|
|
|
- 2067 ELSE
|
|
|
- 2068 cls :=
|
|
|
- 2069 SymTab.ClassOf(t);
|
|
|
- 2070 IF (t #
|
|
|
- 2071 SymTab.InvalidType)
|
|
|
- 2072 AND ((cls = SymTab.ClInt)
|
|
|
- 2073 OR (cls
|
|
|
- 2074 = SymTab.ClChar)
|
|
|
- 2075 OR (cls
|
|
|
- 2076 = SymTab.ClEnum)
|
|
|
- 2077 OR (cls
|
|
|
- 2078 = SymTab.ClReal)
|
|
|
- 2079 OR (cls
|
|
|
- 2080 = SymTab.ClLong)
|
|
|
- 2081 OR (cls
|
|
|
- 2082 = SymTab.ClNil)) THEN
|
|
|
- 2083 IF cls = SymTab.ClNil THEN
|
|
|
- 2084 QbeGen.CopyOp("0", q)
|
|
|
- 2085 ELSIF ((cls
|
|
|
- 2086 = SymTab.ClInt)
|
|
|
- 2087 OR (cls
|
|
|
- 2088 = SymTab.ClChar)
|
|
|
- 2089 OR (cls
|
|
|
- 2090 = SymTab.ClEnum)
|
|
|
- 2091 OR (cls
|
|
|
- 2092 = SymTab.ClLong))
|
|
|
- 2093 AND SymTab.GetSymVal(n, cv)
|
|
|
- 2094 AND QbeGen.IsImm(cv) THEN
|
|
|
- 2095 QbeGen.CopyOp(cv, q)
|
|
|
- 2096 ELSE
|
|
|
- 2097 QbeGen.LoadVar(n,
|
|
|
- 2098 cls = SymTab.ClReal,
|
|
|
- 2099 q)
|
|
|
- 2100 END
|
|
|
- 2101 ELSIF (cls = SymTab.ClArray)
|
|
|
- 2102 OR (cls = SymTab.ClRecord)
|
|
|
- 2103 OR (cls = SymTab.ClClass)
|
|
|
- 2104 OR (cls = SymTab.ClStr)
|
|
|
- 2105 OR (cls = SymTab.ClUStr) THEN
|
|
|
- 2106 (* aggregate constant:
|
|
|
- 2107 its value IS the
|
|
|
- 2108 descriptor address *)
|
|
|
- 2109 IF SymTab.GetSymVal(n, cv) THEN
|
|
|
- 2110 QbeGen.CopyOp(cv, q)
|
|
|
- 2111 ELSE
|
|
|
- 2112 QbeGen.CopyOp("0", q)
|
|
|
- 2113 END
|
|
|
- 2114 ELSE
|
|
|
- 2115 IF t #
|
|
|
- 2116 SymTab.InvalidType THEN
|
|
|
- 2117 SemError(230)
|
|
|
- 2118 END;
|
|
|
- 2119 QbeGen.CopyOp("0", q)
|
|
|
- 2120 END
|
|
|
- 2121 END
|
|
|
- 2122 ELSIF (k = SymTab.KindVar)
|
|
|
- 2123 OR (k = SymTab.KindParam) THEN
|
|
|
- 2124 cls := SymTab.ClassOf(t);
|
|
|
- 2125 IF (cls # SymTab.ClInt)
|
|
|
- 2126 AND (cls # SymTab.ClBool)
|
|
|
- 2127 AND (cls # SymTab.ClChar)
|
|
|
- 2128 AND (cls # SymTab.ClUChar)
|
|
|
- 2129 AND (cls # SymTab.ClEnum)
|
|
|
- 2130 AND (cls # SymTab.ClReal)
|
|
|
- 2131 AND (cls # SymTab.ClPtr)
|
|
|
- 2132 AND (cls # SymTab.ClProc)
|
|
|
- 2133 AND (cls # SymTab.ClLong)
|
|
|
- 2134 AND (cls # SymTab.ClArray)
|
|
|
- 2135 AND (cls # SymTab.ClSet)
|
|
|
- 2136 AND (cls # SymTab.ClRecord)
|
|
|
- 2137 AND (cls # SymTab.ClUStr)
|
|
|
- 2138 AND (cls # SymTab.ClClass) THEN
|
|
|
- 2139 SemError(230);
|
|
|
- 2140 QbeGen.CopyOp("0", q)
|
|
|
- 2141 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2142 END
|
|
|
- 2143 ELSE QbeGen.CopyOp("0", q);
|
|
|
- 2144 IF k = SymTab.KindImport THEN
|
|
|
- 2145 SemError(230)
|
|
|
- 2146 ELSIF k =
|
|
|
- 2147 SymTab.KindProc THEN
|
|
|
- 2148 (* bare procedure name:
|
|
|
- 2149 a following ArgList
|
|
|
- 2150 makes it a call;
|
|
|
- 2151 otherwise Fact
|
|
|
- 2152 reports 230 *)
|
|
|
- 2153 ELSE
|
|
|
- 2154 IF k = SymTab.KindField THEN
|
|
|
- 2155 IF QbeGen.TopWith(qb) THEN
|
|
|
- 2156 sfx := TRUE
|
|
|
- 2157 ELSE SemError(230);
|
|
|
- 2158 QbeGen.CopyOp("0", q)
|
|
|
- 2159 END
|
|
|
- 2160 END
|
|
|
- 2161 END
|
|
|
- 2162 END
|
|
|
- 2163 END; .)
|
|
|
- 2164 (. astDes := AST.MakeNode(AST.NkDesignator);
|
|
|
- 2165 AST.SetChild(astDes, AST.NChild(astDes), AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 2166 IF fwd THEN AST.SetOp(astDes, 1) END; .)
|
|
|
- 2167 { "[" Expr<it, iq>
|
|
|
- 2168 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
- 2169 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2170 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2171 SymTab.ClArray THEN
|
|
|
- 2172 SemError(217);
|
|
|
- 2173 t := SymTab.InvalidType
|
|
|
- 2174 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2175 AND (SymTab.ClassOf(it) #
|
|
|
- 2176 SymTab.ClChar)
|
|
|
- 2177 AND (SymTab.ClassOf(it) #
|
|
|
- 2178 SymTab.ClEnum) THEN
|
|
|
- 2179 SemError(218);
|
|
|
- 2180 t := SymTab.InvalidType
|
|
|
- 2181 ELSE
|
|
|
- 2182 eT := SymTab.ArrayElem(t);
|
|
|
- 2183 t := eT; sfx := TRUE
|
|
|
- 2184 END; .)
|
|
|
- 2185 { "," Expr<it, iq>
|
|
|
- 2186 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
- 2187 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2188 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2189 SymTab.ClArray THEN
|
|
|
- 2190 SemError(217);
|
|
|
- 2191 t := SymTab.InvalidType
|
|
|
- 2192 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2193 AND (SymTab.ClassOf(it) #
|
|
|
- 2194 SymTab.ClChar)
|
|
|
- 2195 AND (SymTab.ClassOf(it) #
|
|
|
- 2196 SymTab.ClEnum) THEN
|
|
|
- 2197 SemError(218);
|
|
|
- 2198 t := SymTab.InvalidType
|
|
|
- 2199 ELSE
|
|
|
- 2200 eT := SymTab.ArrayElem(t);
|
|
|
- 2201 t := eT; sfx := TRUE
|
|
|
- 2202 END; .) }
|
|
|
- 2203 "]"
|
|
|
- 2204 | "." GetIdent<fn>
|
|
|
- 2205 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2206 AST.SetOp(astSel, AST.SelField);
|
|
|
- 2207 AST.SetChild(astSel, 0, AST.MakeLeaf(AST.NkIdent, fn));
|
|
|
- 2208 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF k = SymTab.KindModule THEN
|
|
|
- 2209 (* qualified L.x: materialize
|
|
|
- 2210 the export, then load it *)
|
|
|
- 2211 IF NOT SymTab.MaterializeAlias(n,
|
|
|
- 2212 fn, mal) THEN
|
|
|
- 2213 SemError(201);
|
|
|
- 2214 t := SymTab.InvalidType;
|
|
|
- 2215 QbeGen.CopyOp("0", q)
|
|
|
- 2216 ELSE
|
|
|
- 2217 QbeGen.CopyOp(mal, qn);
|
|
|
- 2218 t := SymTab.SymType(mal);
|
|
|
- 2219 k := SymTab.SymKind(mal);
|
|
|
- 2220 sfx := FALSE;
|
|
|
- 2221 IF k = SymTab.KindProc THEN
|
|
|
- 2222 (* call: ArgList supplies
|
|
|
- 2223 the value *)
|
|
|
- 2224 QbeGen.CopyOp("0", q)
|
|
|
- 2225 END
|
|
|
- 2226 END
|
|
|
- 2227 ELSIF t = SymTab.InvalidType THEN
|
|
|
- 2228 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2229 SymTab.ClRecord)
|
|
|
- 2230 AND (SymTab.ClassOf(t) #
|
|
|
- 2231 SymTab.ClClass) THEN
|
|
|
- 2232 SemError(215);
|
|
|
+ 973 ct := SymTab.NewClass();
|
|
|
+ 974 SymTab.SetSymType(cn, ct);
|
|
|
+ 975 SymTab.PushClassScope(ct);
|
|
|
+ 976 astCls := AST.MakeNode(AST.NkClassDecl);
|
|
|
+ 977 AST.SetChild(astCls, 0,
|
|
|
+ 978 AST.MakeLeaf(AST.NkIdent, cn));
|
|
|
+ 979 astClsP := AST.NoNode;
|
|
|
+ 980 astClsPTail := AST.NoNode;
|
|
|
+ 981 astClsF := AST.NoNode;
|
|
|
+ 982 astClsFTail := AST.NoNode;
|
|
|
+ 983 astClsM := AST.NoNode;
|
|
|
+ 984 astClsMTail := AST.NoNode; .)
|
|
|
+ 985 [ Parents<ct> ]
|
|
|
+ 986 ";"
|
|
|
+ 987 { ClassField<ct> ";" }
|
|
|
+ 988 { MethodHeading<pn, SymTab.InvalidType> ";"
|
|
|
+ 989 (. Lower.ScopeLeave;
|
|
|
+ 990 SymTab.CloseProc;
|
|
|
+ 991 QbeGen.AbortFunc; .) }
|
|
|
+ 992 "END"
|
|
|
+ 993 GetIdent<m2> (. IF NOT SymTab.Equal(cn, m2) THEN
|
|
|
+ 994 SemError(202) END;
|
|
|
+ 995 SymTab.LayoutClass(ct);
|
|
|
+ 996 SymTab.PopScope;
|
|
|
+ 997 AST.SetChild(astCls, 1, astClsP);
|
|
|
+ 998 AST.SetChild(astCls, 2, astClsF);
|
|
|
+ 999 AST.SetChild(astCls, 3, astClsM);
|
|
|
+ 1000 astDecl := astCls; .) .
|
|
|
+ 1001 Parents<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name; .)
|
|
|
+ 1002 = "(" Parent1<ct>
|
|
|
+ 1003 { "," GetIdent<p> (. SemError(230); .) }
|
|
|
+ 1004 ")" .
|
|
|
+ 1005 Parent1<ct: SymTab.TypeIndex> (. VAR p: SymTab.Name;
|
|
|
+ 1006 pt: SymTab.TypeIndex; .)
|
|
|
+ 1007 = GetIdent<p> (. IF NOT SymTab.Lookup(p) THEN
|
|
|
+ 1008 SemError(201)
|
|
|
+ 1009 ELSE pt := SymTab.SymType(p);
|
|
|
+ 1010 IF SymTab.ClassOf(pt) #
|
|
|
+ 1011 SymTab.ClClass THEN
|
|
|
+ 1012 SemError(230)
|
|
|
+ 1013 ELSE SymTab.SetParent(ct, pt)
|
|
|
+ 1014 END
|
|
|
+ 1015 END;
|
|
|
+ 1016 AstAppend(AST.NkFieldDecl,
|
|
|
+ 1017 astClsP, astClsPTail,
|
|
|
+ 1018 AST.MakeLeaf(AST.NkIdent, p)); .) .
|
|
|
+ 1019 ClassField<ct: SymTab.TypeIndex> (. VAR n, rhs: SymTab.Name;
|
|
|
+ 1020 t: SymTab.TypeIndex;
|
|
|
+ 1021 astNode: AST.Node; .)
|
|
|
+ 1022 = GetIdent<n>
|
|
|
+ 1023 ( "=" GetIdent<rhs> (. IF NOT SymTab.Enter(n,
|
|
|
+ 1024 SymTab.KindConst) THEN
|
|
|
+ 1025 SemError(200) END;
|
|
|
+ 1026 astNode := AST.MakeNode(AST.NkConstDecl);
|
|
|
+ 1027 AST.SetChild(astNode, 0,
|
|
|
+ 1028 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 1029 AST.SetChild(astNode, 1,
|
|
|
+ 1030 AST.MakeLeaf(AST.NkIdent, rhs));
|
|
|
+ 1031 AstAppend(AST.NkFieldDecl,
|
|
|
+ 1032 astClsF, astClsFTail, astNode);
|
|
|
+ 1033 IF SymTab.Lookup(rhs) THEN
|
|
|
+ 1034 SymTab.SetSymType(n,
|
|
|
+ 1035 SymTab.SymType(rhs))
|
|
|
+ 1036 END; .)
|
|
|
+ 1037 | (. IF NOT SymTab.FieldPending(ct,
|
|
|
+ 1038 n) THEN
|
|
|
+ 1039 SemError(200) END;
|
|
|
+ 1040 astNode := AST.MakeNode(AST.NkVarDecl);
|
|
|
+ 1041 AST.SetChild(astNode, 0,
|
|
|
+ 1042 AST.MakeLeaf(AST.NkIdent, n)); .)
|
|
|
+ 1043 { "," GetIdent<n> (. IF NOT SymTab.FieldPending(ct,
|
|
|
+ 1044 n) THEN
|
|
|
+ 1045 SemError(200) END;
|
|
|
+ 1046 AST.SetChild(astNode,
|
|
|
+ 1047 AST.NChild(astNode),
|
|
|
+ 1048 AST.MakeLeaf(AST.NkIdent, n)); .) }
|
|
|
+ 1049 ":" Type<t, FALSE> (. SymTab.FixPendingF(ct, t);
|
|
|
+ 1050 AST.SetTy(astNode, t);
|
|
|
+ 1051 AstAppend(AST.NkFieldDecl,
|
|
|
+ 1052 astClsF, astClsFTail, astNode); .) ) .
|
|
|
+ 1053 MethodHeading<VAR pn: SymTab.Name; ct: SymTab.TypeIndex>
|
|
|
+ 1054 (. VAR wantVirt: BOOLEAN; .)
|
|
|
+ 1055 = (. wantVirt := FALSE; .)
|
|
|
+ 1056 [ "VIRTUAL" (. wantVirt := TRUE; .) ]
|
|
|
+ 1057 ProcHeading<pn, ct> (. IF wantVirt THEN
|
|
|
+ 1058 SymTab.MarkVirtual END;
|
|
|
+ 1059 astMethod := AST.MakeNode(AST.NkProcDecl);
|
|
|
+ 1060 AST.SetChild(astMethod, 0,
|
|
|
+ 1061 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
+ 1062 IF wantVirt THEN
|
|
|
+ 1063 AST.SetOp(astMethod, 3)
|
|
|
+ 1064 ELSE AST.SetOp(astMethod, 0)
|
|
|
+ 1065 END;
|
|
|
+ 1066 AstAppend(AST.NkFieldDecl,
|
|
|
+ 1067 astClsM, astClsMTail, astMethod); .) .
|
|
|
+ 1068 ClassImplRest (. VAR cn, m2: SymTab.Name;
|
|
|
+ 1069 ct: SymTab.TypeIndex; .)
|
|
|
+ 1070 = GetIdent<cn> (. IF NOT SymTab.Lookup(cn) THEN
|
|
|
+ 1071 SemError(201);
|
|
|
+ 1072 ct := SymTab.InvalidType
|
|
|
+ 1073 ELSE ct := SymTab.SymType(cn);
|
|
|
+ 1074 IF SymTab.ClassOf(ct) #
|
|
|
+ 1075 SymTab.ClClass THEN
|
|
|
+ 1076 SemError(230);
|
|
|
+ 1077 ct := SymTab.InvalidType
|
|
|
+ 1078 END
|
|
|
+ 1079 END;
|
|
|
+ 1080 astCls := AST.MakeNode(AST.NkClassDecl);
|
|
|
+ 1081 AST.SetOp(astCls, 1);
|
|
|
+ 1082 AST.SetChild(astCls, 0,
|
|
|
+ 1083 AST.MakeLeaf(AST.NkIdent, cn));
|
|
|
+ 1084 astClsM := AST.NoNode;
|
|
|
+ 1085 astClsMTail := AST.NoNode;
|
|
|
+ 1086 astStmt := AST.NoNode;
|
|
|
+ 1087 IF ct #
|
|
|
+ 1088 SymTab.InvalidType THEN
|
|
|
+ 1089 IF NOT SymTab.PushClassMembers(
|
|
|
+ 1090 ct) THEN
|
|
|
+ 1091 SemError(230) END;
|
|
|
+ 1092 SymTab.PushImplClass(ct)
|
|
|
+ 1093 END; .)
|
|
|
+ 1094 ";" { MethodImpl<ct> ";" }
|
|
|
+ 1095 (. astStmt := AST.NoNode; .)
|
|
|
+ 1096 [ "BEGIN" (. astStmt := AST.MakeNode(AST.NkBlock);
|
|
|
+ 1097 .)
|
|
|
+ 1098 [ StatSeq ] ]
|
|
|
+ 1099 "END"
|
|
|
+ 1100 GetIdent<m2> (. IF NOT SymTab.Equal(cn, m2) THEN
|
|
|
+ 1101 SemError(202) END;
|
|
|
+ 1102 SymTab.PopImplClass;
|
|
|
+ 1103 SymTab.PopScope;
|
|
|
+ 1104 AST.SetChild(astCls, 1, AST.NoNode);
|
|
|
+ 1105 AST.SetChild(astCls, 2, astStmt);
|
|
|
+ 1106 AST.SetChild(astCls, 3, astClsM);
|
|
|
+ 1107 astDecl := astCls; .) .
|
|
|
+ 1108 MethodImpl<ct: SymTab.TypeIndex> (. VAR pn: SymTab.Name;
|
|
|
+ 1109 thisQ: QbeGen.QVal;
|
|
|
+ 1110 methRes: SymTab.TypeIndex; .)
|
|
|
+ 1111 = MethodHeading<pn, ct> ";"
|
|
|
+ 1112 (. IF (ct #
|
|
|
+ 1113 SymTab.InvalidType)
|
|
|
+ 1114 AND NOT SymTab.MethodExists(ct,
|
|
|
+ 1115 pn) THEN
|
|
|
+ 1116 SemError(201) END; .)
|
|
|
+ 1117 ( "FORWARD" (. AST.SetOp(astMethod, 1);
|
|
|
+ 1118 SymTab.MarkFwd;
|
|
|
+ 1119 QbeGen.AbortFunc;
|
|
|
+ 1120 Lower.ScopeLeave;
|
|
|
+ 1121 SymTab.CloseProc; .)
|
|
|
+ 1122 | (.
|
|
|
+ 1123 (* bind the receiver: bare
|
|
|
+ 1124 field names resolve
|
|
|
+ 1125 against THIS *)
|
|
|
+ 1126 QbeGen.CopyOp("@", thisQ);
|
|
|
+ 1127 QbeGen.PushWith(thisQ); .)
|
|
|
+ 1128 Block<pn> (. AST.SetChild(astMethod, 1, astStmt);
|
|
|
+ 1129 AST.SetChild(astMethod, 2, astBlkDecls);
|
|
|
+ 1130 QbeGen.PopWith;
|
|
|
+ 1131 methRes := SymTab.CurRes();
|
|
|
+ 1132 Lower.ScopeLeave;
|
|
|
+ 1133 SymTab.CloseProc;
|
|
|
+ 1134 QbeGen.EndFunc(methRes); .) ) .
|
|
|
+ 1135 ConstBlock (. VAR astSeq, astTail: AST.Node; .)
|
|
|
+ 1136 = "CONST" (. astSeq := AST.NoNode;
|
|
|
+ 1137 astTail := AST.NoNode; .)
|
|
|
+ 1138 { ConstDecl ";" (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 1139 astSeq, astTail, astDecl); .) }
|
|
|
+ 1140 (. astDecl := astSeq; .) .
|
|
|
+ 1141 ConstDecl (. VAR n: SymTab.Name;
|
|
|
+ 1142 t: SymTab.TypeIndex;
|
|
|
+ 1143 qv: QbeGen.QVal;
|
|
|
+ 1144 cls: INTEGER;
|
|
|
+ 1145 astNode: AST.Node; .)
|
|
|
+ 1146 = GetIdent<n> (. IF NOT SymTab.Enter(n,
|
|
|
+ 1147 SymTab.KindConst) THEN
|
|
|
+ 1148 SemError(200) END; .)
|
|
|
+ 1149 "="
|
|
|
+ 1150 Expr<t, qv> (. astNode := AST.MakeNode(AST.NkConstDecl);
|
|
|
+ 1151 AST.SetChild(astNode, 0,
|
|
|
+ 1152 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 1153 AST.SetChild(astNode, 1, astCur);
|
|
|
+ 1154 AST.SetTy(astNode, t);
|
|
|
+ 1155 astDecl := astNode;
|
|
|
+ 1156 Lower.NoteVar(n, SymTab.KindConst, t);
|
|
|
+ 1157 Lower.NoteConstVal(qv);
|
|
|
+ 1158 SymTab.SetSymType(n, t);
|
|
|
+ 1159 cls := SymTab.ClassOf(t);
|
|
|
+ 1160 IF (cls = SymTab.ClArray)
|
|
|
+ 1161 OR (cls = SymTab.ClRecord)
|
|
|
+ 1162 OR (cls = SymTab.ClClass)
|
|
|
+ 1163 OR (cls = SymTab.ClStr)
|
|
|
+ 1164 OR (cls = SymTab.ClUStr) THEN
|
|
|
+ 1165 (* an aggregate/string
|
|
|
+ 1166 constant: qv is its
|
|
|
+ 1167 descriptor address; no
|
|
|
+ 1168 scalar data *)
|
|
|
+ 1169 SymTab.SetSymVal(n, qv)
|
|
|
+ 1170 ELSIF NOT QbeGen.IsImm(qv) THEN
|
|
|
+ 1171 SemError(230)
|
|
|
+ 1172 ELSE
|
|
|
+ 1173 SymTab.SetSymVal(n, qv);
|
|
|
+ 1174 END; .) .
|
|
|
+ 1175 VarBlock (. VAR astSeq, astTail: AST.Node; .)
|
|
|
+ 1176 = "VAR" (. astSeq := AST.NoNode;
|
|
|
+ 1177 astTail := AST.NoNode; .)
|
|
|
+ 1178 { VarDecl ";" (. AstAppend(AST.NkDeclSeq,
|
|
|
+ 1179 astSeq, astTail, astDecl); .) }
|
|
|
+ 1180 (. astDecl := astSeq; .) .
|
|
|
+ 1181 VarDecl (. VAR nm: SymTab.Name;
|
|
|
+ 1182 t: SymTab.TypeIndex;
|
|
|
+ 1183 i: CARDINAL;
|
|
|
+ 1184 cls: INTEGER;
|
|
|
+ 1185 astNode, astTail: AST.Node; .)
|
|
|
+ 1186 = VarIdents ":"
|
|
|
+ 1187 Type<t, FALSE> (. astNode := AST.MakeNode(AST.NkVarDecl);
|
|
|
+ 1188 astTail := astNode;
|
|
|
+ 1189 i := 0;
|
|
|
+ 1190 WHILE i < SymTab.PendCount() DO
|
|
|
+ 1191 SymTab.PendName(i, nm);
|
|
|
+ 1192 Lower.NoteVar(nm, SymTab.KindVar, t);
|
|
|
+ 1193 (* chunked: a VAR list can
|
|
|
+ 1194 exceed AST.MaxChild *)
|
|
|
+ 1195 AstAppend(AST.NkBlock,
|
|
|
+ 1196 astNode, astTail,
|
|
|
+ 1197 AST.MakeLeaf(AST.NkIdent, nm));
|
|
|
+ 1198 INC(i)
|
|
|
+ 1199 END;
|
|
|
+ 1200 AST.SetTy(astNode, t);
|
|
|
+ 1201 astDecl := astNode;
|
|
|
+ 1202 cls := SymTab.ClassOf(t);
|
|
|
+ 1203 IF (t # SymTab.InvalidType)
|
|
|
+ 1204 AND NOT SymTab.IsUnresolved(t)
|
|
|
+ 1205 AND (cls # SymTab.ClInt)
|
|
|
+ 1206 AND (cls # SymTab.ClBool)
|
|
|
+ 1207 AND (cls # SymTab.ClChar)
|
|
|
+ 1208 AND (cls # SymTab.ClReal)
|
|
|
+ 1209 AND (cls # SymTab.ClArray)
|
|
|
+ 1210 AND (cls # SymTab.ClSet)
|
|
|
+ 1211 AND (cls # SymTab.ClRecord)
|
|
|
+ 1212 AND (cls # SymTab.ClPtr)
|
|
|
+ 1213 AND (cls # SymTab.ClLong)
|
|
|
+ 1214 AND (cls # SymTab.ClProc)
|
|
|
+ 1215 AND (cls # SymTab.ClUChar)
|
|
|
+ 1216 AND (cls # SymTab.ClUStr)
|
|
|
+ 1217 AND (cls # SymTab.ClEnum)
|
|
|
+ 1218 AND (cls # SymTab.ClClass) THEN
|
|
|
+ 1219 SemError(230) END;
|
|
|
+ 1220 IF QbeGen.LocFull() THEN
|
|
|
+ 1221 SemError(233) END;
|
|
|
+ 1222 i := 0;
|
|
|
+ 1223 IF SymTab.IsUnresolved(t)
|
|
|
+ 1224 AND NOT SymTab.InProc() THEN
|
|
|
+ 1225 (* a forward-typed global:
|
|
|
+ 1226 defer emission until the
|
|
|
+ 1227 TYPE block completes *)
|
|
|
+ 1228 AST.SetOp(astNode, 1);
|
|
|
+ 1229 WHILE i < SymTab.PendCount() DO
|
|
|
+ 1230 SymTab.PendName(i, nm);
|
|
|
+ 1231 IF nPendVar <=
|
|
|
+ 1232 HIGH(pendVarName) THEN
|
|
|
+ 1233 pendVarName[nPendVar] := nm;
|
|
|
+ 1234 pendVarT[nPendVar] := t;
|
|
|
+ 1235 INC(nPendVar)
|
|
|
+ 1236 END;
|
|
|
+ 1237 INC(i)
|
|
|
+ 1238 END
|
|
|
+ 1239 ELSE
|
|
|
+ 1240 WHILE i < SymTab.PendCount() DO
|
|
|
+ 1241 SymTab.PendName(i, nm);
|
|
|
+ 1242 INC(i)
|
|
|
+ 1243 END
|
|
|
+ 1244 END;
|
|
|
+ 1245 (* a plain VAR list, not a
|
|
|
+ 1246 heading: the signature
|
|
|
+ 1247 result is discarded *)
|
|
|
+ 1248 IF NOT SymTab.FixPending(t) THEN
|
|
|
+ 1249 END; .) .
|
|
|
+ 1250 VarIdents (. VAR n: SymTab.Name; .)
|
|
|
+ 1251 = GetIdent<n> (. IF NOT SymTab.EnterPending(n,
|
|
|
+ 1252 SymTab.KindVar) THEN
|
|
|
+ 1253 SemError(200) END; .)
|
|
|
+ 1254 { ","
|
|
|
+ 1255 GetIdent<n> (. IF NOT SymTab.EnterPending(n,
|
|
|
+ 1256 SymTab.KindVar) THEN
|
|
|
+ 1257 SemError(200) END; .) } .
|
|
|
+ 1258 ParIdents<isV: BOOLEAN> (. VAR n: SymTab.Name; .)
|
|
|
+ 1259 = GetIdent<n> (. IF NOT SymTab.EnterParam(n, isV) THEN
|
|
|
+ 1260 SemError(200) END; .)
|
|
|
+ 1261 { "," GetIdent<n> (. IF NOT SymTab.EnterParam(n, isV) THEN
|
|
|
+ 1262 SemError(200) END; .) } .
|
|
|
+ 1263 (* Procedure headings enter scopes/params/result and buffer the
|
|
|
+ 1264 QBE header; bodies lower to functions (4.1, module level only).
|
|
|
+ 1265 FORWARD marks; the body heading re-enters (signature compare
|
|
|
+ 1266 deferred). Nested procedures parse + check, lowering = 4.2. *)
|
|
|
+ 1267 ProcHeading<VAR pn: SymTab.Name; methCls: SymTab.TypeIndex>
|
|
|
+ 1268 (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1269 mg: QbeGen.QVal; .)
|
|
|
+ 1270 = "PROCEDURE"
|
|
|
+ 1271 GetIdent<pn> (. IF methCls #
|
|
|
+ 1272 SymTab.InvalidType THEN
|
|
|
+ 1273 (* a method: resume the
|
|
|
+ 1274 declared symbol (reuse
|
|
|
+ 1275 its uid) *)
|
|
|
+ 1276 IF NOT SymTab.ResumeMethod(
|
|
|
+ 1277 methCls, pn) THEN
|
|
|
+ 1278 SemError(200) END
|
|
|
+ 1279 ELSIF NOT SymTab.EnterProc(pn) THEN
|
|
|
+ 1280 IF NOT SymTab.ReenterProc(pn) THEN
|
|
|
+ 1281 IF NOT SymTab.ResumeProc(pn) THEN
|
|
|
+ 1282 SemError(200) END
|
|
|
+ 1283 END
|
|
|
+ 1284 END;
|
|
|
+ 1285 Lower.ScopeEnter;
|
|
|
+ 1286 Lower.NoteProc(pn,
|
|
|
+ 1287 SymTab.ProcUid(pn),
|
|
|
+ 1288 SymTab.InvalidType,
|
|
|
+ 1289 SymTab.ProcDepthOf(pn),
|
|
|
+ 1290 FALSE);
|
|
|
+ 1291 QbeGen.BeginFunc("");
|
|
|
+ 1292 IF methCls #
|
|
|
+ 1293 SymTab.InvalidType THEN
|
|
|
+ 1294 (* hidden THIS receiver:
|
|
|
+ 1295 a VAR param of the
|
|
|
+ 1296 class type, pushed as
|
|
|
+ 1297 the WITH base *)
|
|
|
+ 1298 IF NOT SymTab.EnterThisParam(
|
|
|
+ 1299 methCls) THEN
|
|
|
+ 1300 SemError(200) END;
|
|
|
+ 1301 IF NOT QbeGen.FuncParam(
|
|
|
+ 1302 "THIS", TRUE,
|
|
|
+ 1303 methCls) THEN
|
|
|
+ 1304 SemError(233) END
|
|
|
+ 1305 END; .)
|
|
|
+ 1306 [ FormalParams ]
|
|
|
+ 1307 [ ":" TypeIdent<t> (. IF NOT SymTab.SetProcRes(t) THEN
|
|
|
+ 1308 SemError(235) END;
|
|
|
+ 1309 Lower.SetProcRes(t); .) ] .
|
|
|
+ 1310 FormalParams
|
|
|
+ 1311 = "(" [ ParamSection { ";" ParamSection } ] ")" .
|
|
|
+ 1312 ParamSection (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1313 nm: SymTab.Name;
|
|
|
+ 1314 i: CARDINAL;
|
|
|
+ 1315 isV: BOOLEAN; .)
|
|
|
+ 1316 = (. isV := FALSE; .)
|
|
|
+ 1317 [ "VAR" (. isV := TRUE; .) ]
|
|
|
+ 1318 ParIdents<isV> ":" Type<t, TRUE> (. i := 0;
|
|
|
+ 1319 WHILE i < SymTab.PendCount() DO
|
|
|
+ 1320 SymTab.PendName(i, nm);
|
|
|
+ 1321 Lower.NoteParam(nm, t, isV);
|
|
|
+ 1322 Lower.NoteVar(nm, SymTab.KindParam, t);
|
|
|
+ 1323 (* value open arrays are
|
|
|
+ 1324 passed as descriptor
|
|
|
+ 1325 addresses (no copy):
|
|
|
+ 1326 same representation as
|
|
|
+ 1327 VAR formals *)
|
|
|
+ 1328 IF NOT QbeGen.FuncParam(nm,
|
|
|
+ 1329 isV
|
|
|
+ 1330 OR SymTab.IsOpenArray(t),
|
|
|
+ 1331 t) THEN
|
|
|
+ 1332 SemError(233) END;
|
|
|
+ 1333 INC(i)
|
|
|
+ 1334 END;
|
|
|
+ 1335 IF NOT SymTab.FixPending(t) THEN
|
|
|
+ 1336 SemError(235) END; .) .
|
|
|
+ 1337 (* Nested procedures lower like top-level ones (4.2): the
|
|
|
+ 1338 static link gives them their parent's frame. Methods keep
|
|
|
+ 1339 parse-now/230-later. *)
|
|
|
+ 1340 ProcDecl (. VAR pn: SymTab.Name;
|
|
|
+ 1341 astNode: AST.Node; .)
|
|
|
+ 1342 = ProcHeading<pn, SymTab.InvalidType> ";"
|
|
|
+ 1343 (. astNode := AST.MakeNode(AST.NkProcDecl);
|
|
|
+ 1344 AST.SetOp(astNode, 0);
|
|
|
+ 1345 AST.SetChild(astNode, 0,
|
|
|
+ 1346 AST.MakeLeaf(AST.NkIdent, pn));
|
|
|
+ 1347 Lower.NoteProcNode(astNode); .)
|
|
|
+ 1348 ( "FORWARD" (. AST.SetOp(astNode, 1);
|
|
|
+ 1349 astDecl := astNode;
|
|
|
+ 1350 Lower.ScopeLeave;
|
|
|
+ 1351 SymTab.MarkFwd;
|
|
|
+ 1352 SymTab.CloseProc;
|
|
|
+ 1353 QbeGen.AbortFunc; .)
|
|
|
+ 1354 | "EXTERNAL" (. AST.SetOp(astNode, 2);
|
|
|
+ 1355 astDecl := astNode;
|
|
|
+ 1356 Lower.MarkProcExternal;
|
|
|
+ 1357 Lower.ScopeLeave;
|
|
|
+ 1358 SymTab.MarkExternal("");
|
|
|
+ 1359 SymTab.CloseProc;
|
|
|
+ 1360 QbeGen.AbortFunc; .)
|
|
|
+ 1361 |
|
|
|
+ 1362 Block<pn> (. AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1363 AST.SetChild(astNode, 2, astBlkDecls);
|
|
|
+ 1364 astDecl := astNode;
|
|
|
+ 1365 Lower.ScopeLeave;
|
|
|
+ 1366 SymTab.CloseProc;
|
|
|
+ 1367 QbeGen.EndFunc(
|
|
|
+ 1368 SymTab.ProcRes(pn)); .) ) .
|
|
|
+ 1369 Block<pn: SymTab.Name> (. VAR m2: SymTab.Name; .)
|
|
|
+ 1370 = DeclSeq (. astBlkDecls := astDecl;
|
|
|
+ 1371 astStmt := AST.NoNode;
|
|
|
+ 1372 nLab := 0; nGot := 0; .)
|
|
|
+ 1373 [ "BEGIN" (. (* an empty body is still a
|
|
|
+ 1374 body: mark it so Lower
|
|
|
+ 1375 does not read it as a
|
|
|
+ 1376 definition heading *)
|
|
|
+ 1377 IF astStmt = AST.NoNode THEN
|
|
|
+ 1378 astStmt :=
|
|
|
+ 1379 AST.MakeNode(AST.NkBlock)
|
|
|
+ 1380 END; .)
|
|
|
+ 1381 [ StatSeq ] ]
|
|
|
+ 1382 "END"
|
|
|
+ 1383 GetIdent<m2> (. IF NOT SymTab.Equal(pn, m2) THEN
|
|
|
+ 1384 SemError(202) END;
|
|
|
+ 1385 CheckGotos; .) .
|
|
|
+ 1386 StatSeq (. VAR astSeq, astTail: AST.Node; .)
|
|
|
+ 1387 = (. astSeq := AST.NoNode;
|
|
|
+ 1388 astTail := AST.NoNode; .)
|
|
|
+ 1389 Statement (. AstAppend(AST.NkBlock,
|
|
|
+ 1390 astSeq, astTail, astStmt); .)
|
|
|
+ 1391 { ";" [ Statement (. AstAppend(AST.NkBlock,
|
|
|
+ 1392 astSeq, astTail, astStmt); .) ] }
|
|
|
+ 1393 (. astStmt := astSeq; .) .
|
|
|
+ 1394 (* Trailing/empty statements (`a; ; b`, Coco/R's generated `;;`)
|
|
|
+ 1395 are accepted: the statement after ';' is optional. *)
|
|
|
+ 1396 Statement (. VAR lx: QbeGen.QVal; lxnm: SymTab.Name; .)
|
|
|
+ 1397 = (. astStmt := AST.NoNode; .)
|
|
|
+ 1398 ( AssOrCall
|
|
|
+ 1399 | IfStat
|
|
|
+ 1400 | WhileStat
|
|
|
+ 1401 | RepeatStat
|
|
|
+ 1402 | LoopStat
|
|
|
+ 1403 | ForStat
|
|
|
+ 1404 | CaseStat
|
|
|
+ 1405 | WithStat
|
|
|
+ 1406 | ReturnStat
|
|
|
+ 1407 | HaltStat
|
|
|
+ 1408 | NewStat
|
|
|
+ 1409 | DisposeStat
|
|
|
+ 1410 | IncDecStat
|
|
|
+ 1411 | InclExclStat
|
|
|
+ 1412 | "EXIT" (. IF NOT QbeGen.TopLoop(lx) THEN
|
|
|
+ 1413 SemError(230) END;
|
|
|
+ 1414 astStmt := AST.MakeNode(AST.NkExit); .)
|
|
|
+ 1415 | "GOTO" GetIdent<lxnm> (. NoteGoto(lxnm);
|
|
|
+ 1416 astStmt := AST.MakeNode(AST.NkGoto);
|
|
|
+ 1417 AST.SetChild(astStmt, 0,
|
|
|
+ 1418 AST.MakeLeaf(AST.NkIdent, lxnm)); .) ) .
|
|
|
+ 1419 (* INCL(set, elem) / EXCL(set, elem): PIM set-element builtins. *)
|
|
|
+ 1420 InclExclStat (. VAR at, et2: SymTab.TypeIndex;
|
|
|
+ 1421 dk: INTEGER;
|
|
|
+ 1422 qd, qe: QbeGen.QVal;
|
|
|
+ 1423 qn: SymTab.Name;
|
|
|
+ 1424 sfx, isInc: BOOLEAN;
|
|
|
+ 1425 astNode, astD: AST.Node; .)
|
|
|
+ 1426 = ( "INCL" (. isInc := TRUE; .)
|
|
|
+ 1427 | "EXCL" (. isInc := FALSE; .) )
|
|
|
+ 1428 "(" Design<at, dk, qd, qn, sfx> (. astD := astCur; .) ","
|
|
|
+ 1429 Expr<et2, qe> ")"
|
|
|
+ 1430 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 1431 IF isInc THEN
|
|
|
+ 1432 AST.SetChild(astNode, 0,
|
|
|
+ 1433 AST.MakeLeaf(AST.NkIdent, "INCL"))
|
|
|
+ 1434 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 1435 AST.MakeLeaf(AST.NkIdent, "EXCL"))
|
|
|
+ 1436 END;
|
|
|
+ 1437 IF astD # AST.NoNode THEN
|
|
|
+ 1438 AST.SetChild(astNode, 1, astD) END;
|
|
|
+ 1439 IF astCur # AST.NoNode THEN
|
|
|
+ 1440 AST.SetChild(astNode, 2, astCur) END;
|
|
|
+ 1441 astStmt := astNode; .)
|
|
|
+ 1442 (. IF (at # SymTab.InvalidType)
|
|
|
+ 1443 AND (SymTab.ClassOf(at) # SymTab.ClSet) THEN
|
|
|
+ 1444 SemError(222)
|
|
|
+ 1445 END; .) .
|
|
|
+ 1446 (* INC(v [,step]) / DEC(v [,step]) as builtin statements over an
|
|
|
+ 1447 integer designator. *)
|
|
|
+ 1448 IncDecStat (. VAR dt, et2: SymTab.TypeIndex;
|
|
|
+ 1449 dk: INTEGER;
|
|
|
+ 1450 qd, qv, qn2, qstep:
|
|
|
+ 1451 QbeGen.QVal;
|
|
|
+ 1452 qn: SymTab.Name;
|
|
|
+ 1453 sfx, isInc: BOOLEAN;
|
|
|
+ 1454 astNode, astD, astStep:
|
|
|
+ 1455 AST.Node; .)
|
|
|
+ 1456 = (. isInc := TRUE; .)
|
|
|
+ 1457 ( "INC" (. isInc := TRUE; .)
|
|
|
+ 1458 | "DEC" (. isInc := FALSE; .) )
|
|
|
+ 1459 "(" (. astStep := AST.NoNode; .)
|
|
|
+ 1460 Design<dt, dk, qd, qn, sfx> (. astD := astCur; .)
|
|
|
+ 1461 [ "," Expr<et2, qstep> (. astStep := astCur; .) ]
|
|
|
+ 1462 ")" (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 1463 IF isInc THEN
|
|
|
+ 1464 AST.SetChild(astNode, 0,
|
|
|
+ 1465 AST.MakeLeaf(AST.NkIdent, "INC"))
|
|
|
+ 1466 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 1467 AST.MakeLeaf(AST.NkIdent, "DEC"))
|
|
|
+ 1468 END;
|
|
|
+ 1469 IF astD # AST.NoNode THEN
|
|
|
+ 1470 AST.SetChild(astNode, 1, astD) END;
|
|
|
+ 1471 IF astStep # AST.NoNode THEN
|
|
|
+ 1472 AST.SetChild(astNode, 2, astStep) END;
|
|
|
+ 1473 astStmt := astNode; .) (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 1474 ELSIF (dk # SymTab.KindVar)
|
|
|
+ 1475 AND (dk # SymTab.KindParam)
|
|
|
+ 1476 AND (dk # SymTab.KindField) THEN
|
|
|
+ 1477 SemError(210)
|
|
|
+ 1478 ELSIF NOT SymTab.IsIntFamily(dt) THEN
|
|
|
+ 1479 SemError(211)
|
|
|
+ 1480 END; .) .
|
|
|
+ 1481 (* NEW/DISPOSE as builtin statements (no call syntax until step 4).
|
|
|
+ 1482 Targets are pointer designators; DISPOSE nils afterwards (safer
|
|
|
+ 1483 than Wirth-undefined; documented). DISPOSE is shallow. *)
|
|
|
+ 1484 NewStat (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 1485 dk: INTEGER;
|
|
|
+ 1486 qd, qm: QbeGen.QVal;
|
|
|
+ 1487 qn: SymTab.Name;
|
|
|
+ 1488 sfx: BOOLEAN;
|
|
|
+ 1489 bt: SymTab.TypeIndex;
|
|
|
+ 1490 astNode, astD: AST.Node; .)
|
|
|
+ 1491 = "NEW" "(" Design<dt, dk, qd, qn, sfx> (. astD := astCur; .) ")"
|
|
|
+ 1492 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 1493 AST.SetChild(astNode, 0,
|
|
|
+ 1494 AST.MakeLeaf(AST.NkIdent, "NEW"));
|
|
|
+ 1495 IF astD # AST.NoNode THEN
|
|
|
+ 1496 AST.SetChild(astNode, 1, astD) END;
|
|
|
+ 1497 astStmt := astNode; .)
|
|
|
+ 1498 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 1499 ELSIF (dk # SymTab.KindVar)
|
|
|
+ 1500 AND (dk # SymTab.KindParam)
|
|
|
+ 1501 AND (dk # SymTab.KindField) THEN
|
|
|
+ 1502 SemError(210)
|
|
|
+ 1503 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 1504 SymTab.ClPtr THEN
|
|
|
+ 1505 SemError(219)
|
|
|
+ 1506 END; .) .
|
|
|
+ 1507 DisposeStat (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 1508 dk: INTEGER;
|
|
|
+ 1509 qd, qv: QbeGen.QVal;
|
|
|
+ 1510 qn: SymTab.Name;
|
|
|
+ 1511 sfx: BOOLEAN;
|
|
|
+ 1512 astNode, astD: AST.Node; .)
|
|
|
+ 1513 = "DISPOSE" "(" Design<dt, dk, qd, qn, sfx> (. astD := astCur; .) ")"
|
|
|
+ 1514 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 1515 AST.SetChild(astNode, 0,
|
|
|
+ 1516 AST.MakeLeaf(AST.NkIdent, "DISPOSE"));
|
|
|
+ 1517 IF astD # AST.NoNode THEN
|
|
|
+ 1518 AST.SetChild(astNode, 1, astD) END;
|
|
|
+ 1519 astStmt := astNode; .)
|
|
|
+ 1520 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 1521 ELSIF (dk # SymTab.KindVar)
|
|
|
+ 1522 AND (dk # SymTab.KindParam)
|
|
|
+ 1523 AND (dk # SymTab.KindField) THEN
|
|
|
+ 1524 SemError(210)
|
|
|
+ 1525 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 1526 SymTab.ClPtr THEN
|
|
|
+ 1527 SemError(219)
|
|
|
+ 1528 END; .) .
|
|
|
+ 1529 (* WITH pushes each record's fields (inner wins) plus its base
|
|
|
+ 1530 address; field designators resolve through both stacks. *)
|
|
|
+ 1531 WithStat (. VAR nW: CARDINAL;
|
|
|
+ 1532 astNode: AST.Node; .)
|
|
|
+ 1533 = "WITH" (. nW := 0;
|
|
|
+ 1534 astNode := AST.MakeNode(AST.NkWith); .)
|
|
|
+ 1535 WithItem<nW, astNode> { "," WithItem<nW, astNode> }
|
|
|
+ 1536 "DO" (. astStmt := AST.NoNode; .)
|
|
|
+ 1537 [ StatSeq ] "END" (. AST.SetChild(astNode,
|
|
|
+ 1538 AST.NChild(astNode), astStmt);
|
|
|
+ 1539 astStmt := astNode;
|
|
|
+ 1540 WHILE nW > 0 DO
|
|
|
+ 1541 SymTab.PopScope;
|
|
|
+ 1542 QbeGen.PopWith;
|
|
|
+ 1543 DEC(nW)
|
|
|
+ 1544 END; .) .
|
|
|
+ 1545 WithItem<VAR nW: CARDINAL; wnode: AST.Node>
|
|
|
+ 1546 (. VAR dt: SymTab.TypeIndex;
|
|
|
+ 1547 dk: INTEGER;
|
|
|
+ 1548 qd, qe: QbeGen.QVal;
|
|
|
+ 1549 qn: SymTab.Name;
|
|
|
+ 1550 sfx: BOOLEAN; .)
|
|
|
+ 1551 = Design<dt, dk, qd, qn, sfx>
|
|
|
+ 1552 (. IF astCur # AST.NoNode THEN
|
|
|
+ 1553 AST.SetChild(wnode,
|
|
|
+ 1554 AST.NChild(wnode), astCur) END;
|
|
|
+ 1555 IF dt = SymTab.InvalidType THEN
|
|
|
+ 1556 ELSIF (SymTab.ClassOf(dt) #
|
|
|
+ 1557 SymTab.ClRecord)
|
|
|
+ 1558 AND (SymTab.ClassOf(dt) #
|
|
|
+ 1559 SymTab.ClClass) THEN
|
|
|
+ 1560 SemError(215)
|
|
|
+ 1561 ELSIF SymTab.PushRecord(dt) THEN
|
|
|
+ 1562 QbeGen.PushWith(qd);
|
|
|
+ 1563 INC(nW)
|
|
|
+ 1564 END; .) .
|
|
|
+ 1565 (* Assignment or procedure-statement call (4.1, module level).
|
|
|
+ 1566 Bare `P;` is a syntax error; function-as-statement is 233. *)
|
|
|
+ 1567 AssOrCall (. VAR dt, et: SymTab.TypeIndex;
|
|
|
+ 1568 dk: INTEGER;
|
|
|
+ 1569 qd, qe, qt, ql: QbeGen.QVal;
|
|
|
+ 1570 qn: SymTab.Name;
|
|
|
+ 1571 ct2, res0: SymTab.TypeIndex;
|
|
|
+ 1572 q2, mg0: QbeGen.QVal;
|
|
|
+ 1573 isR, conv, wconv: BOOLEAN;
|
|
|
+ 1574 called, sfx: BOOLEAN;
|
|
|
+ 1575 astLhs, astRes: AST.Node; mname: SymTab.Name; isM: BOOLEAN;
|
|
|
+ 1576 n: SymTab.Name; astLab, astNode: AST.Node; .)
|
|
|
+ 1577 = GetIdent<n>
|
|
|
+ 1578 ( ":" (. NoteLabel(n);
|
|
|
+ 1579 astNode := AST.MakeNode(AST.NkLabel);
|
|
|
+ 1580 AST.SetChild(astNode, 0,
|
|
|
+ 1581 AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 1582 astLab := AST.MakeNode(AST.NkBlock);
|
|
|
+ 1583 AST.SetChild(astLab, 0, astNode); .)
|
|
|
+ 1584 Statement (. IF astStmt # AST.NoNode THEN
|
|
|
+ 1585 AST.SetChild(astLab, 1, astStmt) END;
|
|
|
+ 1586 astStmt := astLab; .)
|
|
|
+ 1587 | DesignTail<n, dt, dk, qd, qn, sfx>
|
|
|
+ 1588 (. astLhs := astCur; astNArgs := 0; .)
|
|
|
+ 1589 ( ":="
|
|
|
+ 1590 Expr<et, qe> (. astStmt := AST.MakeBin(
|
|
|
+ 1591 AST.NkAssign, 0, astLhs, astCur);
|
|
|
+ 1592 IF (dt # SymTab.InvalidType)
|
|
|
+ 1593 AND (dk # SymTab.KindVar)
|
|
|
+ 1594 AND (dk # SymTab.KindParam)
|
|
|
+ 1595 AND (dk # SymTab.KindField) THEN
|
|
|
+ 1596 SemError(210)
|
|
|
+ 1597 ELSIF NOT SymTab.Assignable(et,
|
|
|
+ 1598 dt) THEN
|
|
|
+ 1599 SemError(210)
|
|
|
+ 1600 ELSIF (dt # SymTab.InvalidType)
|
|
|
+ 1601 AND (SymTab.ClassOf(dt) =
|
|
|
+ 1602 SymTab.ClClass) THEN
|
|
|
+ 1603 SemError(230) END;
|
|
|
+ 1604 isR := (dt #
|
|
|
+ 1605 SymTab.InvalidType)
|
|
|
+ 1606 AND (SymTab.ClassOf(dt)
|
|
|
+ 1607 = SymTab.ClReal);
|
|
|
+ 1608 conv := isR
|
|
|
+ 1609 AND SymTab.IsIntFamily(et);
|
|
|
+ 1610 wconv := (dt #
|
|
|
+ 1611 SymTab.InvalidType)
|
|
|
+ 1612 AND SymTab.IsLongFamily(dt)
|
|
|
+ 1613 AND SymTab.IsIntFamily(et);
|
|
|
+ 1614 IF ((dk = SymTab.KindVar)
|
|
|
+ 1615 OR (dk = SymTab.KindParam)
|
|
|
+ 1616 OR (dk = SymTab.KindField))
|
|
|
+ 1617 AND (dt # SymTab.InvalidType)
|
|
|
+ 1618 AND (et # SymTab.InvalidType)
|
|
|
+ 1619 AND (SymTab.ClassOf(dt) #
|
|
|
+ 1620 SymTab.ClClass) THEN
|
|
|
+ 1621 END; .)
|
|
|
+ 1622 | ArgList<qn, dt, qd, TRUE, TRUE, methCls, ct2, q2, called>
|
|
|
+ 1623 (. astRes := AstCallNode(astLhs);
|
|
|
+ 1624 sfx := FALSE; .)
|
|
|
+ 1625 ( { ResultComp<ct2, q2, sfx, astRes, mname, methCls, isM> }
|
|
|
+ 1626 ":=" Expr<et, qe> (. astStmt := AST.MakeBin(
|
|
|
+ 1627 AST.NkAssign, 0, astRes, astCur);
|
|
|
+ 1628 IF NOT sfx THEN
|
|
|
+ 1629 SemError(233)
|
|
|
+ 1630 ELSIF (ct2 # SymTab.InvalidType)
|
|
|
+ 1631 AND NOT SymTab.Assignable(et, ct2) THEN
|
|
|
+ 1632 SemError(210)
|
|
|
+ 1633 END; .)
|
|
|
+ 1634 | (. IF ct2 #
|
|
|
+ 1635 SymTab.InvalidType THEN
|
|
|
+ 1636 SemError(233) END;
|
|
|
+ 1637 astStmt := astRes; .) )
|
|
|
+ 1638 | (* bare `P;`: proper parameterless
|
|
|
+ 1639 procedure call; anything else
|
|
|
+ 1640 here is 233 (was a bare syntax
|
|
|
+ 1641 error before 4.2) *)
|
|
|
+ 1642 (. astStmt := AstCallNode(astLhs);
|
|
|
+ 1643 IF (dk = SymTab.KindProc)
|
|
|
+ 1644 AND NOT sfx THEN
|
|
|
+ 1645 res0 := SymTab.ProcRes(qn);
|
|
|
+ 1646 IF res0 #
|
|
|
+ 1647 SymTab.InvalidType THEN
|
|
|
+ 1648 SemError(233)
|
|
|
+ 1649 ELSIF SymTab.ProcNPar(qn) #
|
|
|
+ 1650 0 THEN
|
|
|
+ 1651 SemError(233)
|
|
|
+ 1652 END
|
|
|
+ 1653 ELSE SemError(233)
|
|
|
+ 1654 END; .) ) ) .
|
|
|
+ 1655 (* Actual-parameter list shared by statement and expression calls.
|
|
|
+ 1656 want selects CallEnd's result handling; t/q carry the call
|
|
|
+ 1657 value (statement calls discard). Arity/type failures are 233;
|
|
|
+ 1658 evaluation code still emits so the .ssa stays assembleable. *)
|
|
|
+ 1659 ArgList<pn: SymTab.Name; pt: SymTab.TypeIndex; callee: QbeGen.QVal;
|
|
|
+ 1660 want: BOOLEAN; soft: BOOLEAN; methCls: SymTab.TypeIndex;
|
|
|
+ 1661 VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
+ 1662 VAR called: BOOLEAN> (. VAR i, np: CARDINAL;
|
|
|
+ 1663 vs: INTEGER;
|
|
|
+ 1664 res: SymTab.TypeIndex;
|
|
|
+ 1665 mg: QbeGen.QVal;
|
|
|
+ 1666 ok, ind, isMeth, va: BOOLEAN; .)
|
|
|
+ 1667 = "(" (. called := TRUE;
|
|
|
+ 1668 ok := TRUE;
|
|
|
+ 1669 ind := FALSE;
|
|
|
+ 1670 isMeth := methCls #
|
|
|
+ 1671 SymTab.InvalidType;
|
|
|
+ 1672 IF isMeth THEN
|
|
|
+ 1673 res := SymTab.ClassMethodRes(methCls, pn)
|
|
|
+ 1674 ELSIF SymTab.SymKind(pn) = SymTab.KindProc THEN
|
|
|
+ 1675 res := SymTab.ProcRes(pn)
|
|
|
+ 1676 ELSIF (pt # SymTab.InvalidType)
|
|
|
+ 1677 AND (SymTab.ClassOf(pt) = SymTab.ClProc) THEN
|
|
|
+ 1678 ind := TRUE;
|
|
|
+ 1679 res := SymTab.ProcTypeRes(pt)
|
|
|
+ 1680 ELSE SemError(233);
|
|
|
+ 1681 ok := FALSE;
|
|
|
+ 1682 res := SymTab.InvalidType
|
|
|
+ 1683 END;
|
|
|
+ 1684 i := 0; .)
|
|
|
+ 1685 [ ActParam<pn, pt, ind, methCls, i> (. INC(i); .)
|
|
|
+ 1686 { "," ActParam<pn, pt, ind, methCls, i> (. INC(i); .) } ]
|
|
|
+ 1687 ")" (. IF ok THEN
|
|
|
+ 1688 IF isMeth THEN
|
|
|
+ 1689 np := SymTab.ClassMethodNPar(
|
|
|
+ 1690 methCls, pn)
|
|
|
+ 1691 ELSIF ind THEN
|
|
|
+ 1692 np := SymTab.ProcTypeNPar(pt)
|
|
|
+ 1693 ELSE np := SymTab.ProcNPar(pn)
|
|
|
+ 1694 END;
|
|
|
+ 1695 va := (NOT isMeth) AND (NOT ind)
|
|
|
+ 1696 AND (SymTab.SymKind(pn) =
|
|
|
+ 1697 SymTab.KindProc)
|
|
|
+ 1698 AND SymTab.Varargs(pn);
|
|
|
+ 1699 IF (i # np) AND NOT va THEN
|
|
|
+ 1700 SemError(233); ok := FALSE
|
|
|
+ 1701 END
|
|
|
+ 1702 END;
|
|
|
+ 1703 IF NOT ok THEN
|
|
|
+ 1704 t := SymTab.InvalidType;
|
|
|
+ 1705 QbeGen.CopyOp("0", q)
|
|
|
+ 1706 ELSIF want THEN
|
|
|
+ 1707 IF res =
|
|
|
+ 1708 SymTab.InvalidType THEN
|
|
|
+ 1709 IF NOT soft THEN SemError(233) END;
|
|
|
+ 1710 t := SymTab.InvalidType;
|
|
|
+ 1711 QbeGen.CopyOp("0", q)
|
|
|
+ 1712 ELSE t := res;
|
|
|
+ 1713 QbeGen.CopyOp("@", q)
|
|
|
+ 1714 END
|
|
|
+ 1715 ELSE
|
|
|
+ 1716 IF res #
|
|
|
+ 1717 SymTab.InvalidType THEN
|
|
|
+ 1718 SemError(233)
|
|
|
+ 1719 END;
|
|
|
+ 1720 t := SymTab.InvalidType;
|
|
|
+ 1721 QbeGen.CopyOp("0", q);
|
|
|
+ 1722 END; .) .
|
|
|
+ 1723 (* One actual: VAR formals take recorded designator addresses
|
|
|
+ 1724 (233 otherwise); value formals take converted expressions. *)
|
|
|
+ 1725 ActParam<pn: SymTab.Name; pt: SymTab.TypeIndex; ind: BOOLEAN;
|
|
|
+ 1726 methCls: SymTab.TypeIndex; i: CARDINAL>
|
|
|
+ 1727 (. VAR at, ft: SymTab.TypeIndex;
|
|
|
+ 1728 qe, qa, qt: QbeGen.QVal;
|
|
|
+ 1729 isV, conv, va: BOOLEAN;
|
|
|
+ 1730 cl: CHAR;
|
|
|
+ 1731 savedN, aj: CARDINAL;
|
|
|
+ 1732 savedArgs: ARRAY [0 .. 31]
|
|
|
+ 1733 OF AST.Node;
|
|
|
+ 1734 astActual: AST.Node; .)
|
|
|
+ 1735 = (. (* Parsing the actual can clobber
|
|
|
+ 1736 the enclosing call's argument
|
|
|
+ 1737 list (Factor resets astNArgs),
|
|
|
+ 1738 so save/restore it. *)
|
|
|
+ 1739 savedN := astNArgs; aj := 0;
|
|
|
+ 1740 WHILE aj <= HIGH(astArgs) DO
|
|
|
+ 1741 savedArgs[aj] := astArgs[aj];
|
|
|
+ 1742 INC(aj)
|
|
|
+ 1743 END; .)
|
|
|
+ 1744 Expr<at, qe> (. astActual := astCur;
|
|
|
+ 1745 astNArgs := savedN; aj := 0;
|
|
|
+ 1746 WHILE aj <= HIGH(astArgs) DO
|
|
|
+ 1747 astArgs[aj] := savedArgs[aj];
|
|
|
+ 1748 INC(aj)
|
|
|
+ 1749 END;
|
|
|
+ 1750 IF astNArgs <= HIGH(astArgs) THEN
|
|
|
+ 1751 astArgs[astNArgs] := astCur;
|
|
|
+ 1752 INC(astNArgs)
|
|
|
+ 1753 END;
|
|
|
+ 1754 va := (NOT ind)
|
|
|
+ 1755 AND (methCls =
|
|
|
+ 1756 SymTab.InvalidType)
|
|
|
+ 1757 AND (SymTab.SymKind(pn) =
|
|
|
+ 1758 SymTab.KindProc)
|
|
|
+ 1759 AND SymTab.Varargs(pn);
|
|
|
+ 1760 IF ind THEN
|
|
|
+ 1761 ft :=
|
|
|
+ 1762 SymTab.ProcTypeParamType(pt,
|
|
|
+ 1763 i);
|
|
|
+ 1764 isV :=
|
|
|
+ 1765 SymTab.ProcTypeParamIsVar(pt,
|
|
|
+ 1766 i)
|
|
|
+ 1767 ELSIF methCls #
|
|
|
+ 1768 SymTab.InvalidType THEN
|
|
|
+ 1769 ft :=
|
|
|
+ 1770 SymTab.ClassMethodParamType(
|
|
|
+ 1771 methCls, pn, i);
|
|
|
+ 1772 isV :=
|
|
|
+ 1773 SymTab.ClassMethodParamIsVar(
|
|
|
+ 1774 methCls, pn, i)
|
|
|
+ 1775 ELSE
|
|
|
+ 1776 ft := SymTab.ParamType(pn, i);
|
|
|
+ 1777 isV := SymTab.ParamIsVar(pn, i)
|
|
|
+ 1778 END;
|
|
|
+ 1779 IF (at = SymTab.InvalidType) THEN
|
|
|
+ 1780 ELSIF ft = SymTab.InvalidType THEN
|
|
|
+ 1781 ELSIF isV THEN
|
|
|
+ 1782 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
+ 1783 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
+ 1784 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
+ 1785 AND QbeGen.IsImm(qe) THEN
|
|
|
+ 1786 ELSIF (AST.Kind(astActual) #
|
|
|
+ 1787 AST.NkDesignator)
|
|
|
+ 1788 AND (AST.Kind(astActual) # AST.NkStrLit) THEN
|
|
|
+ 1789 SemError(233)
|
|
|
+ 1790 ELSIF NOT SymTab.VarParamOk(at, ft) THEN
|
|
|
+ 1791 SemError(233)
|
|
|
+ 1792 END
|
|
|
+ 1793 ELSE
|
|
|
+ 1794 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
+ 1795 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
+ 1796 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
+ 1797 AND QbeGen.IsImm(qe) THEN
|
|
|
+ 1798 ELSIF NOT SymTab.Assignable(at, ft) THEN
|
|
|
+ 1799 SemError(233)
|
|
|
+ 1800 END
|
|
|
+ 1801 END; .) .
|
|
|
+ 1802 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1803 q: QbeGen.QVal;
|
|
|
+ 1804 hasElse: BOOLEAN;
|
|
|
+ 1805 astCond, astIf, astLast,
|
|
|
+ 1806 astNode: AST.Node; .)
|
|
|
+ 1807 = "IF" (. hasElse := FALSE; .)
|
|
|
+ 1808 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
+ 1809 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1810 SemError(214) END; .)
|
|
|
+ 1811 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
+ 1812 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1813 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1814 astIf := astNode;
|
|
|
+ 1815 astLast := astNode; .)
|
|
|
+ 1816 { "ELSIF"
|
|
|
+ 1817 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
+ 1818 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1819 SemError(214) END; .)
|
|
|
+ 1820 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
+ 1821 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1822 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1823 AST.SetChild(astLast, 2, astNode);
|
|
|
+ 1824 astLast := astNode; .) }
|
|
|
+ 1825 [ "ELSE" (. hasElse := TRUE;
|
|
|
+ 1826 astStmt := AST.NoNode; .)
|
|
|
+ 1827 [ StatSeq ] (. AST.SetChild(astLast, 2, astStmt); .) ]
|
|
|
+ 1828 "END" (. astStmt := astIf; .) .
|
|
|
+ 1829 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1830 q: QbeGen.QVal;
|
|
|
+ 1831 astCond, astNode: AST.Node; .)
|
|
|
+ 1832 = "WHILE" (. astStmt := AST.NoNode; .)
|
|
|
+ 1833 Expr<t, q> (. astCond := astCur;
|
|
|
+ 1834 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1835 SemError(214) END; .)
|
|
|
+ 1836 "DO" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkWhile);
|
|
|
+ 1837 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1838 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1839 astStmt := astNode; .)
|
|
|
+ 1840 "END" .
|
|
|
+ 1841 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1842 q: QbeGen.QVal;
|
|
|
+ 1843 astCond, astBody, astNode:
|
|
|
+ 1844 AST.Node; .)
|
|
|
+ 1845 = "REPEAT" (. astStmt := AST.NoNode; .)
|
|
|
+ 1846 [ StatSeq ] (. astBody := astStmt; .)
|
|
|
+ 1847 "UNTIL" Expr<t, q> (. astCond := astCur;
|
|
|
+ 1848 astNode := AST.MakeNode(AST.NkRepeat);
|
|
|
+ 1849 AST.SetChild(astNode, 0, astBody);
|
|
|
+ 1850 AST.SetChild(astNode, 1, astCond);
|
|
|
+ 1851 astStmt := astNode;
|
|
|
+ 1852 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1853 SemError(214) END; .) .
|
|
|
+ 1854 LoopStat (. VAR lEnd: QbeGen.QVal; astNode: AST.Node; .)
|
|
|
+ 1855 = "LOOP" (. astStmt := AST.NoNode;
|
|
|
+ 1856 QbeGen.NewLabel(lEnd);
|
|
|
+ 1857 QbeGen.PushLoop(lEnd); .)
|
|
|
+ 1858 [ StatSeq ]
|
|
|
+ 1859 "END" (. astNode := AST.MakeNode(AST.NkLoop);
|
|
|
+ 1860 AST.SetChild(astNode, 0, astStmt);
|
|
|
+ 1861 astStmt := astNode;
|
|
|
+ 1862 QbeGen.PopLoop; .) .
|
|
|
+ 1863 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
+ 1864 Runtime direction would need a compare-select; the literal
|
|
|
+ 1865 sign picks cslew/csegew at "DO" time. *)
|
|
|
+ 1866 ForStat (. VAR lv: SymTab.Name;
|
|
|
+ 1867 tlo, thi, tby:
|
|
|
+ 1868 SymTab.TypeIndex;
|
|
|
+ 1869 qlo, qhi, qby, qt, qk, qb:
|
|
|
+ 1870 QbeGen.QVal;
|
|
|
+ 1871 lTop, lBody, lEnd:
|
|
|
+ 1872 QbeGen.QVal;
|
|
|
+ 1873 by: INTEGER;
|
|
|
+ 1874 ok: BOOLEAN;
|
|
|
+ 1875 astVar, astLo, astHi, astBy,
|
|
|
+ 1876 astNode: AST.Node; .)
|
|
|
+ 1877 = "FOR" (. by := 1; .)
|
|
|
+ 1878 GetIdent<lv> (. astVar := AST.MakeLeaf(AST.NkIdent, lv);
|
|
|
+ 1879 astStmt := AST.NoNode;
|
|
|
+ 1880 astBy := AST.NoNode;
|
|
|
+ 1881 ok := SymTab.Lookup(lv);
|
|
|
+ 1882 IF NOT ok THEN
|
|
|
+ 1883 SemError(201)
|
|
|
+ 1884 ELSIF (SymTab.SymKind(lv) #
|
|
|
+ 1885 SymTab.KindVar)
|
|
|
+ 1886 AND (SymTab.SymKind(lv) #
|
|
|
+ 1887 SymTab.KindParam) THEN
|
|
|
+ 1888 SemError(220); ok := FALSE
|
|
|
+ 1889 ELSIF NOT SymTab.IsIntFamily(
|
|
|
+ 1890 SymTab.SymType(lv)) THEN
|
|
|
+ 1891 SemError(220); ok := FALSE
|
|
|
+ 1892 END; .)
|
|
|
+ 1893 ":=" Expr<tlo, qlo> (. astLo := astCur;
|
|
|
+ 1894 IF NOT SymTab.IsIntFamily(tlo) THEN
|
|
|
+ 1895 SemError(220); ok := FALSE
|
|
|
+ 1896 END; .)
|
|
|
+ 1897 "TO" Expr<thi, qhi> (. astHi := astCur;
|
|
|
+ 1898 IF NOT SymTab.IsIntFamily(thi) THEN
|
|
|
+ 1899 SemError(220); ok := FALSE
|
|
|
+ 1900 END; .)
|
|
|
+ 1901 [ "BY" Expr<tby, qby> (. astBy := astCur;
|
|
|
+ 1902 IF (tby #
|
|
|
+ 1903 SymTab.InvalidType)
|
|
|
+ 1904 AND NOT SymTab.IsIntFamily(tby) THEN
|
|
|
+ 1905 SemError(220); ok := FALSE
|
|
|
+ 1906 END;
|
|
|
+ 1907 IF NOT SymTab.ConstInt(qby, by) THEN
|
|
|
+ 1908 SemError(230); by := 1
|
|
|
+ 1909 ELSIF by = 0 THEN
|
|
|
+ 1910 SemError(220); by := 1
|
|
|
+ 1911 END; .) ]
|
|
|
+ 1912 "DO"
|
|
|
+ 1913 [ StatSeq ]
|
|
|
+ 1914 "END" (. astNode := AST.MakeNode(AST.NkFor);
|
|
|
+ 1915 AST.SetChild(astNode, 0, astVar);
|
|
|
+ 1916 AST.SetChild(astNode, 1, astLo);
|
|
|
+ 1917 AST.SetChild(astNode, 2, astHi);
|
|
|
+ 1918 AST.SetChild(astNode, 3, astBy);
|
|
|
+ 1919 AST.SetChild(astNode, 4, astStmt);
|
|
|
+ 1920 astStmt := astNode;
|
|
|
+ 1921 .) .
|
|
|
+ 1922 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
+ 1923 qsel, lEnd: QbeGen.QVal;
|
|
|
+ 1924 arm, astNode, astArms,
|
|
|
+ 1925 astArmsTail: AST.Node; .)
|
|
|
+ 1926 = "CASE" Expr<tsel, qsel> (. astNode := AST.MakeNode(AST.NkCase);
|
|
|
+ 1927 AST.SetChild(astNode, 0, astCur);
|
|
|
+ 1928 astArms := AST.NoNode;
|
|
|
+ 1929 astArmsTail := AST.NoNode;
|
|
|
+ 1930 .)
|
|
|
+ 1931 "OF" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail>
|
|
|
+ 1932 { "|" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail> }
|
|
|
+ 1933 [ "ELSE" (. astStmt := AST.NoNode; .)
|
|
|
+ 1934 [ StatSeq ] (. arm := AST.MakeNode(AST.NkCaseArm);
|
|
|
+ 1935 AST.SetOp(arm, 1);
|
|
|
+ 1936 AST.SetChild(arm, 0, astStmt);
|
|
|
+ 1937 AstAppend(AST.NkBlock,
|
|
|
+ 1938 astArms, astArmsTail, arm); .) ]
|
|
|
+ 1939 "END" (. AST.SetChild(astNode, 1, astArms);
|
|
|
+ 1940 astStmt := astNode;
|
|
|
+ 1941 .) .
|
|
|
+ 1942 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
+ 1943 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
+ 1944 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
+ 1945 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
+ 1946 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 1947 lEnd: QbeGen.QVal; VAR arms, armsTail: AST.Node>
|
|
|
+ 1948 (. VAR arm: AST.Node; .)
|
|
|
+ 1949 = (. arm := AST.MakeNode(AST.NkCaseArm); .)
|
|
|
+ 1950 CaseLabel<tsel, qsel, arm>
|
|
|
+ 1951 { "," CaseLabel<tsel, qsel, arm> }
|
|
|
+ 1952 ":" (. astStmt := AST.NoNode; .)
|
|
|
+ 1953 [ StatSeq ] (. AST.SetChild(arm, AST.NChild(arm),
|
|
|
+ 1954 astStmt);
|
|
|
+ 1955 AstAppend(AST.NkBlock,
|
|
|
+ 1956 arms, armsTail, arm);
|
|
|
+ 1957 .) .
|
|
|
+ 1958 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 1959 arm: AST.Node>
|
|
|
+ 1960 (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
+ 1961 q2, q3, qc, qd, qe:
|
|
|
+ 1962 QbeGen.QVal;
|
|
|
+ 1963 astLab: AST.Node;
|
|
|
+ 1964 lNext: QbeGen.QVal; .)
|
|
|
+ 1965 = Expr<t2, q2> (. astLab := astCur;
|
|
|
+ 1966 IF (t2 #
|
|
|
+ 1967 SymTab.InvalidType)
|
|
|
+ 1968 AND (tsel #
|
|
|
+ 1969 SymTab.InvalidType)
|
|
|
+ 1970 AND ((SymTab.ClassOf(t2) =
|
|
|
+ 1971 SymTab.ClSet)
|
|
|
+ 1972 OR (SymTab.ClassOf(tsel) =
|
|
|
+ 1973 SymTab.ClSet)) THEN
|
|
|
+ 1974 SemError(230)
|
|
|
+ 1975 ELSIF (t2 #
|
|
|
+ 1976 SymTab.InvalidType)
|
|
|
+ 1977 AND (tsel #
|
|
|
+ 1978 SymTab.InvalidType)
|
|
|
+ 1979 AND NOT SymTab.EqCheck(t2,
|
|
|
+ 1980 tsel) THEN
|
|
|
+ 1981 SemError(213) END;
|
|
|
+ 1982 IF NOT QbeGen.IsImm(q2) THEN
|
|
|
+ 1983 SemError(230)
|
|
|
+ 1984 END; .)
|
|
|
+ 1985 [ ".." Expr<t3, q3> (. astLab := AST.MakeBin(
|
|
|
+ 1986 AST.NkSubrange, 0, astLab, astCur);
|
|
|
+ 1987 IF (t3 #
|
|
|
+ 1988 SymTab.InvalidType)
|
|
|
+ 1989 AND (tsel #
|
|
|
+ 1990 SymTab.InvalidType)
|
|
|
+ 1991 AND NOT SymTab.EqCheck(t3,
|
|
|
+ 1992 tsel) THEN
|
|
|
+ 1993 SemError(213) END;
|
|
|
+ 1994 IF NOT QbeGen.IsImm(q3) THEN
|
|
|
+ 1995 SemError(230)
|
|
|
+ 1996 END; .) ]
|
|
|
+ 1997 (. AST.SetChild(arm,
|
|
|
+ 1998 AST.NChild(arm), astLab); .) .
|
|
|
+ 1999 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 2000 q, qt: QbeGen.QVal;
|
|
|
+ 2001 res: SymTab.TypeIndex;
|
|
|
+ 2002 hadE, conv: BOOLEAN;
|
|
|
+ 2003 astVal, astNode: AST.Node; .)
|
|
|
+ 2004 = "RETURN" (. hadE := FALSE; astStmt := AST.NoNode; .)
|
|
|
+ 2005 [ Expr<t, q> (. hadE := TRUE; astVal := astCur; .) ]
|
|
|
+ 2006 (. astNode := AST.MakeNode(AST.NkReturn);
|
|
|
+ 2007 IF hadE THEN
|
|
|
+ 2008 AST.SetChild(astNode, 0, astVal)
|
|
|
+ 2009 END;
|
|
|
+ 2010 astStmt := astNode;
|
|
|
+ 2011 conv := FALSE;
|
|
|
+ 2012 IF NOT SymTab.InProc() THEN
|
|
|
+ 2013 SemError(232)
|
|
|
+ 2014 ELSE res := SymTab.CurRes();
|
|
|
+ 2015 IF NOT hadE THEN
|
|
|
+ 2016 IF res #
|
|
|
+ 2017 SymTab.InvalidType THEN
|
|
|
+ 2018 SemError(232)
|
|
|
+ 2019 END
|
|
|
+ 2020 ELSIF (res =
|
|
|
+ 2021 SymTab.InvalidType)
|
|
|
+ 2022 OR (t #
|
|
|
+ 2023 SymTab.InvalidType)
|
|
|
+ 2024 AND NOT SymTab.Assignable(t,
|
|
|
+ 2025 res) THEN
|
|
|
+ 2026 SemError(232)
|
|
|
+ 2027 END
|
|
|
+ 2028 END; .) .
|
|
|
+ 2029 HaltStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 2030 q: QbeGen.QVal;
|
|
|
+ 2031 astVal, astNode: AST.Node; .)
|
|
|
+ 2032 = "HALT" (. astVal := AST.NoNode; .)
|
|
|
+ 2033 [ "(" Expr<t, q> (. astVal := astCur; .) ")" ]
|
|
|
+ 2034 (. astNode := AST.MakeNode(AST.NkHalt);
|
|
|
+ 2035 IF astVal # AST.NoNode THEN
|
|
|
+ 2036 AST.SetChild(astNode, 0, astVal)
|
|
|
+ 2037 END;
|
|
|
+ 2038 astStmt := astNode;
|
|
|
+ 2039 .) .
|
|
|
+ 2040 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
+ 2041 Each index descends one level (bounds-checked, trap on breach);
|
|
|
+ 2042 nested levels reload the inner descriptor address. q ends as the
|
|
|
+ 2043 value (scalars), the descriptor address (plain arrays), or the
|
|
|
+ 2044 element address (indexed); sfx marks the indexed form. *)
|
|
|
+ 2045 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
+ 2046 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
+ 2047 (. VAR n: SymTab.Name; .)
|
|
|
+ 2048 = GetIdent<n> DesignTail<n, t, k, q, qn, sfx> .
|
|
|
+ 2049 (* The part of Design after the identifier: resolve it and walk the
|
|
|
+ 2050 selectors. Split out so a statement can decide between a label
|
|
|
+ 2051 (`ident :`) and a designator (`ident := ...`) with one token. *)
|
|
|
+ 2052 DesignTail<VAR n: SymTab.Name; VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
+ 2053 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
+ 2054 (. VAR fn, mal: SymTab.Name;
|
|
|
+ 2055 cls: INTEGER;
|
|
|
+ 2056 ic: SymTab.TypeIndex;
|
|
|
+ 2057 curT, it, eT, bt:
|
|
|
+ 2058 SymTab.TypeIndex;
|
|
|
+ 2059 iq, ql, qlo, qhi, qe:
|
|
|
+ 2060 QbeGen.QVal;
|
|
|
+ 2061 lo, hi: INTEGER;
|
|
|
+ 2062 fo: INTEGER;
|
|
|
+ 2063 isOpen: BOOLEAN;
|
|
|
+ 2064 qb, cv: QbeGen.QVal;
|
|
|
+ 2065 fid, fref, slot: INTEGER;
|
|
|
+ 2066 r: BOOLEAN;
|
|
|
+ 2067 astDes, astSel: AST.Node;
|
|
|
+ 2068 fwd: BOOLEAN; .)
|
|
|
+ 2069 = (. methCls := SymTab.InvalidType;
|
|
|
+ 2070 QbeGen.CopyOp(n, qn);
|
|
|
+ 2071 sfx := FALSE; fwd := FALSE;
|
|
|
+ 2072 fid := 0; fref := 0; slot := 0;
|
|
|
+ 2073 IF NOT SymTab.Lookup(n) THEN
|
|
|
+ 2074 (* a bare method name inside
|
|
|
+ 2075 a CLASS IMPLEMENTATION
|
|
|
+ 2076 is a sibling call on
|
|
|
+ 2077 THIS *)
|
|
|
+ 2078 ic := SymTab.CurImplClass();
|
|
|
+ 2079 IF (ic #
|
|
|
+ 2080 SymTab.InvalidType)
|
|
|
+ 2081 AND SymTab.MethodExists(ic, n) THEN
|
|
|
+ 2082 sfx := FALSE;
|
|
|
+ 2083 QbeGen.CopyOp("@", q);
|
|
|
+ 2084 methCls := ic;
|
|
|
+ 2085 k := SymTab.KindProc;
|
|
|
+ 2086 t := SymTab.InvalidType
|
|
|
+ 2087 ELSIF SymTab.InProc() THEN
|
|
|
+ 2088 (* not declared yet: a
|
|
|
+ 2089 forward reference to a
|
|
|
+ 2090 module-level variable
|
|
|
+ 2091 declared further down. *)
|
|
|
+ 2092 k := SymTab.KindVar;
|
|
|
+ 2093 r := SymTab.FwdVarRef(n, k,
|
|
|
+ 2094 fref, t);
|
|
|
+ 2095 FwdVarNote(fref, 0);
|
|
|
+ 2096 QbeGen.CopyOp("@", q);
|
|
|
+ 2097 sfx := TRUE; fwd := TRUE
|
|
|
+ 2098 ELSE
|
|
|
+ 2099 SemError(201);
|
|
|
+ 2100 t :=
|
|
|
+ 2101 SymTab.InvalidType;
|
|
|
+ 2102 k := -1;
|
|
|
+ 2103 QbeGen.CopyOp("0", q)
|
|
|
+ 2104 END
|
|
|
+ 2105 ELSE
|
|
|
+ 2106 t := SymTab.SymType(n);
|
|
|
+ 2107 k := SymTab.SymKind(n);
|
|
|
+ 2108 IF k = SymTab.KindConst THEN
|
|
|
+ 2109 IF SymTab.Equal(n,
|
|
|
+ 2110 "TRUE") THEN
|
|
|
+ 2111 t := SymTab.BoolType();
|
|
|
+ 2112 QbeGen.CopyOp("1", q)
|
|
|
+ 2113 ELSIF SymTab.Equal(n,
|
|
|
+ 2114 "FALSE") THEN
|
|
|
+ 2115 t := SymTab.BoolType();
|
|
|
+ 2116 QbeGen.CopyOp("0", q)
|
|
|
+ 2117 ELSIF SymTab.Equal(n,
|
|
|
+ 2118 "NIL") THEN
|
|
|
+ 2119 QbeGen.CopyOp("0", q)
|
|
|
+ 2120 ELSE
|
|
|
+ 2121 cls :=
|
|
|
+ 2122 SymTab.ClassOf(t);
|
|
|
+ 2123 IF (t #
|
|
|
+ 2124 SymTab.InvalidType)
|
|
|
+ 2125 AND ((cls = SymTab.ClInt)
|
|
|
+ 2126 OR (cls
|
|
|
+ 2127 = SymTab.ClChar)
|
|
|
+ 2128 OR (cls
|
|
|
+ 2129 = SymTab.ClEnum)
|
|
|
+ 2130 OR (cls
|
|
|
+ 2131 = SymTab.ClReal)
|
|
|
+ 2132 OR (cls
|
|
|
+ 2133 = SymTab.ClLong)
|
|
|
+ 2134 OR (cls
|
|
|
+ 2135 = SymTab.ClNil)) THEN
|
|
|
+ 2136 IF cls = SymTab.ClNil THEN
|
|
|
+ 2137 QbeGen.CopyOp("0", q)
|
|
|
+ 2138 ELSIF ((cls
|
|
|
+ 2139 = SymTab.ClInt)
|
|
|
+ 2140 OR (cls
|
|
|
+ 2141 = SymTab.ClChar)
|
|
|
+ 2142 OR (cls
|
|
|
+ 2143 = SymTab.ClEnum)
|
|
|
+ 2144 OR (cls
|
|
|
+ 2145 = SymTab.ClLong))
|
|
|
+ 2146 AND SymTab.GetSymVal(n, cv)
|
|
|
+ 2147 AND QbeGen.IsImm(cv) THEN
|
|
|
+ 2148 QbeGen.CopyOp(cv, q)
|
|
|
+ 2149 ELSE
|
|
|
+ 2150 QbeGen.LoadVar(n,
|
|
|
+ 2151 cls = SymTab.ClReal,
|
|
|
+ 2152 q)
|
|
|
+ 2153 END
|
|
|
+ 2154 ELSIF (cls = SymTab.ClArray)
|
|
|
+ 2155 OR (cls = SymTab.ClRecord)
|
|
|
+ 2156 OR (cls = SymTab.ClClass)
|
|
|
+ 2157 OR (cls = SymTab.ClStr)
|
|
|
+ 2158 OR (cls = SymTab.ClUStr) THEN
|
|
|
+ 2159 (* aggregate constant:
|
|
|
+ 2160 its value IS the
|
|
|
+ 2161 descriptor address *)
|
|
|
+ 2162 IF SymTab.GetSymVal(n, cv) THEN
|
|
|
+ 2163 QbeGen.CopyOp(cv, q)
|
|
|
+ 2164 ELSE
|
|
|
+ 2165 QbeGen.CopyOp("0", q)
|
|
|
+ 2166 END
|
|
|
+ 2167 ELSE
|
|
|
+ 2168 IF t #
|
|
|
+ 2169 SymTab.InvalidType THEN
|
|
|
+ 2170 SemError(230)
|
|
|
+ 2171 END;
|
|
|
+ 2172 QbeGen.CopyOp("0", q)
|
|
|
+ 2173 END
|
|
|
+ 2174 END
|
|
|
+ 2175 ELSIF (k = SymTab.KindVar)
|
|
|
+ 2176 OR (k = SymTab.KindParam) THEN
|
|
|
+ 2177 cls := SymTab.ClassOf(t);
|
|
|
+ 2178 IF (cls # SymTab.ClInt)
|
|
|
+ 2179 AND (cls # SymTab.ClBool)
|
|
|
+ 2180 AND (cls # SymTab.ClChar)
|
|
|
+ 2181 AND (cls # SymTab.ClUChar)
|
|
|
+ 2182 AND (cls # SymTab.ClEnum)
|
|
|
+ 2183 AND (cls # SymTab.ClReal)
|
|
|
+ 2184 AND (cls # SymTab.ClPtr)
|
|
|
+ 2185 AND (cls # SymTab.ClProc)
|
|
|
+ 2186 AND (cls # SymTab.ClLong)
|
|
|
+ 2187 AND (cls # SymTab.ClArray)
|
|
|
+ 2188 AND (cls # SymTab.ClSet)
|
|
|
+ 2189 AND (cls # SymTab.ClRecord)
|
|
|
+ 2190 AND (cls # SymTab.ClUStr)
|
|
|
+ 2191 AND (cls # SymTab.ClClass) THEN
|
|
|
+ 2192 SemError(230);
|
|
|
+ 2193 QbeGen.CopyOp("0", q)
|
|
|
+ 2194 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 2195 END
|
|
|
+ 2196 ELSE QbeGen.CopyOp("0", q);
|
|
|
+ 2197 IF k = SymTab.KindImport THEN
|
|
|
+ 2198 SemError(230)
|
|
|
+ 2199 ELSIF k =
|
|
|
+ 2200 SymTab.KindProc THEN
|
|
|
+ 2201 (* bare procedure name:
|
|
|
+ 2202 a following ArgList
|
|
|
+ 2203 makes it a call;
|
|
|
+ 2204 otherwise Fact
|
|
|
+ 2205 reports 230 *)
|
|
|
+ 2206 ELSE
|
|
|
+ 2207 IF k = SymTab.KindField THEN
|
|
|
+ 2208 IF QbeGen.TopWith(qb) THEN
|
|
|
+ 2209 sfx := TRUE
|
|
|
+ 2210 ELSE SemError(230);
|
|
|
+ 2211 QbeGen.CopyOp("0", q)
|
|
|
+ 2212 END
|
|
|
+ 2213 END
|
|
|
+ 2214 END
|
|
|
+ 2215 END
|
|
|
+ 2216 END; .)
|
|
|
+ 2217 (. astDes := AST.MakeNode(AST.NkDesignator);
|
|
|
+ 2218 AST.SetChild(astDes, AST.NChild(astDes), AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 2219 IF fwd THEN AST.SetOp(astDes, 1) END; .)
|
|
|
+ 2220 { "[" Expr<it, iq>
|
|
|
+ 2221 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
+ 2222 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2223 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2224 SymTab.ClArray THEN
|
|
|
+ 2225 SemError(217);
|
|
|
+ 2226 t := SymTab.InvalidType
|
|
|
+ 2227 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2228 AND (SymTab.ClassOf(it) #
|
|
|
+ 2229 SymTab.ClChar)
|
|
|
+ 2230 AND (SymTab.ClassOf(it) #
|
|
|
+ 2231 SymTab.ClEnum) THEN
|
|
|
+ 2232 SemError(218);
|
|
|
2233 t := SymTab.InvalidType
|
|
|
- 2234 ELSIF (SymTab.ClassOf(t) =
|
|
|
- 2235 SymTab.ClClass)
|
|
|
- 2236 AND SymTab.MethodExists(t, fn) THEN
|
|
|
- 2237 (* obj.Method: bind the
|
|
|
- 2238 method and pass obj as
|
|
|
- 2239 the hidden receiver; q
|
|
|
- 2240 already holds the
|
|
|
- 2241 object's address *)
|
|
|
- 2242 QbeGen.CopyOp(fn, n);
|
|
|
- 2243 QbeGen.CopyOp(fn, qn);
|
|
|
- 2244 methCls := t;
|
|
|
- 2245 k := SymTab.KindProc;
|
|
|
- 2246 t := SymTab.InvalidType
|
|
|
- 2247 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2248 fn) THEN
|
|
|
- 2249 SemError(216);
|
|
|
- 2250 t := SymTab.InvalidType
|
|
|
- 2251 ELSE
|
|
|
- 2252 t := SymTab.FieldType(t, fn);
|
|
|
- 2253 sfx := TRUE
|
|
|
- 2254 END; .)
|
|
|
- 2255 | "^"
|
|
|
- 2256 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2257 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2258 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2259 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2260 SymTab.ClPtr THEN
|
|
|
- 2261 SemError(219);
|
|
|
- 2262 t := SymTab.InvalidType
|
|
|
- 2263 ELSE
|
|
|
- 2264 bt := SymTab.PtrBase(t);
|
|
|
- 2265 IF bt = SymTab.InvalidType THEN
|
|
|
- 2266 ELSE
|
|
|
- 2267 t := bt;
|
|
|
- 2268 sfx := TRUE
|
|
|
- 2269 END
|
|
|
- 2270 END; .) } (. astCur := astDes; .) .
|
|
|
- 2271 (* Result suffix (ISO component after a function call): `F()^`,
|
|
|
- 2272 `F()[i]`, `F().field`. The call result is in t/q with sfx FALSE
|
|
|
- 2273 (a value, or a descriptor address for aggregates); each component
|
|
|
- 2274 descends one level exactly like the Design components. *)
|
|
|
- 2275 ResultComp<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
- 2276 VAR sfx: BOOLEAN; VAR node: AST.Node;
|
|
|
- 2277 VAR mname: SymTab.Name; VAR methCls: SymTab.TypeIndex;
|
|
|
- 2278 VAR isM: BOOLEAN> (. VAR it, eT, bt: SymTab.TypeIndex;
|
|
|
- 2279 iq, ql, qlo, qhi, qe, qb:
|
|
|
- 2280 QbeGen.QVal;
|
|
|
- 2281 lo, hi, fo: INTEGER;
|
|
|
- 2282 isOpen: BOOLEAN;
|
|
|
- 2283 fname: SymTab.Name;
|
|
|
- 2284 astWrap, astSel: AST.Node; .)
|
|
|
- 2285 = "[" Expr<it, iq>
|
|
|
- 2286 (. isM := FALSE;
|
|
|
- 2287 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2288 astWrap := AST.MakeNode(
|
|
|
- 2289 AST.NkDesignator);
|
|
|
- 2290 AST.SetChild(astWrap, 0, node);
|
|
|
- 2291 node := astWrap
|
|
|
- 2292 END;
|
|
|
- 2293 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2294 AST.MakeUn(AST.NkSelector,
|
|
|
- 2295 AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2296 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2297 SymTab.ClArray THEN
|
|
|
- 2298 SemError(217);
|
|
|
+ 2234 ELSE
|
|
|
+ 2235 eT := SymTab.ArrayElem(t);
|
|
|
+ 2236 t := eT; sfx := TRUE
|
|
|
+ 2237 END; .)
|
|
|
+ 2238 { "," Expr<it, iq>
|
|
|
+ 2239 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
+ 2240 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2241 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2242 SymTab.ClArray THEN
|
|
|
+ 2243 SemError(217);
|
|
|
+ 2244 t := SymTab.InvalidType
|
|
|
+ 2245 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2246 AND (SymTab.ClassOf(it) #
|
|
|
+ 2247 SymTab.ClChar)
|
|
|
+ 2248 AND (SymTab.ClassOf(it) #
|
|
|
+ 2249 SymTab.ClEnum) THEN
|
|
|
+ 2250 SemError(218);
|
|
|
+ 2251 t := SymTab.InvalidType
|
|
|
+ 2252 ELSE
|
|
|
+ 2253 eT := SymTab.ArrayElem(t);
|
|
|
+ 2254 t := eT; sfx := TRUE
|
|
|
+ 2255 END; .) }
|
|
|
+ 2256 "]"
|
|
|
+ 2257 | "." GetIdent<fn>
|
|
|
+ 2258 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2259 AST.SetOp(astSel, AST.SelField);
|
|
|
+ 2260 AST.SetChild(astSel, 0, AST.MakeLeaf(AST.NkIdent, fn));
|
|
|
+ 2261 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF k = SymTab.KindModule THEN
|
|
|
+ 2262 (* qualified L.x: materialize
|
|
|
+ 2263 the export, then load it *)
|
|
|
+ 2264 IF NOT SymTab.MaterializeAlias(n,
|
|
|
+ 2265 fn, mal) THEN
|
|
|
+ 2266 SemError(201);
|
|
|
+ 2267 t := SymTab.InvalidType;
|
|
|
+ 2268 QbeGen.CopyOp("0", q)
|
|
|
+ 2269 ELSE
|
|
|
+ 2270 QbeGen.CopyOp(mal, qn);
|
|
|
+ 2271 t := SymTab.SymType(mal);
|
|
|
+ 2272 k := SymTab.SymKind(mal);
|
|
|
+ 2273 sfx := FALSE;
|
|
|
+ 2274 IF k = SymTab.KindProc THEN
|
|
|
+ 2275 (* call: ArgList supplies
|
|
|
+ 2276 the value *)
|
|
|
+ 2277 QbeGen.CopyOp("0", q)
|
|
|
+ 2278 END
|
|
|
+ 2279 END
|
|
|
+ 2280 ELSIF t = SymTab.InvalidType THEN
|
|
|
+ 2281 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2282 SymTab.ClRecord)
|
|
|
+ 2283 AND (SymTab.ClassOf(t) #
|
|
|
+ 2284 SymTab.ClClass) THEN
|
|
|
+ 2285 SemError(215);
|
|
|
+ 2286 t := SymTab.InvalidType
|
|
|
+ 2287 ELSIF (SymTab.ClassOf(t) =
|
|
|
+ 2288 SymTab.ClClass)
|
|
|
+ 2289 AND SymTab.MethodExists(t, fn) THEN
|
|
|
+ 2290 (* obj.Method: bind the
|
|
|
+ 2291 method and pass obj as
|
|
|
+ 2292 the hidden receiver; q
|
|
|
+ 2293 already holds the
|
|
|
+ 2294 object's address *)
|
|
|
+ 2295 QbeGen.CopyOp(fn, n);
|
|
|
+ 2296 QbeGen.CopyOp(fn, qn);
|
|
|
+ 2297 methCls := t;
|
|
|
+ 2298 k := SymTab.KindProc;
|
|
|
2299 t := SymTab.InvalidType
|
|
|
- 2300 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2301 AND (SymTab.ClassOf(it) # SymTab.ClChar)
|
|
|
- 2302 AND (SymTab.ClassOf(it) # SymTab.ClEnum) THEN
|
|
|
- 2303 SemError(218);
|
|
|
- 2304 t := SymTab.InvalidType
|
|
|
- 2305 ELSE
|
|
|
- 2306 eT := SymTab.ArrayElem(t);
|
|
|
- 2307 t := eT; sfx := TRUE
|
|
|
- 2308 END; .)
|
|
|
- 2309 "]"
|
|
|
- 2310 | "." GetIdent<fname>
|
|
|
- 2311 (. isM := FALSE;
|
|
|
- 2312 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2313 astWrap := AST.MakeNode(
|
|
|
- 2314 AST.NkDesignator);
|
|
|
- 2315 AST.SetChild(astWrap, 0, node);
|
|
|
- 2316 node := astWrap
|
|
|
- 2317 END;
|
|
|
- 2318 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2319 AST.MakeUn(AST.NkSelector,
|
|
|
- 2320 AST.SelField,
|
|
|
- 2321 AST.MakeLeaf(AST.NkIdent,
|
|
|
- 2322 fname))); IF t = SymTab.InvalidType THEN
|
|
|
- 2323 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2324 SymTab.ClRecord)
|
|
|
- 2325 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2326 SemError(215);
|
|
|
- 2327 t := SymTab.InvalidType
|
|
|
- 2328 ELSIF (SymTab.ClassOf(t) =
|
|
|
- 2329 SymTab.ClClass)
|
|
|
- 2330 AND SymTab.MethodExists(t, fname) THEN
|
|
|
- 2331 (* a method on the call result:
|
|
|
- 2332 a following ArgList makes
|
|
|
- 2333 the call *)
|
|
|
- 2334 mname := fname;
|
|
|
- 2335 methCls := t; isM := TRUE;
|
|
|
- 2336 t := SymTab.InvalidType
|
|
|
- 2337 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2338 fname) THEN
|
|
|
- 2339 SemError(216);
|
|
|
- 2340 t := SymTab.InvalidType
|
|
|
- 2341 ELSE
|
|
|
- 2342 t := SymTab.FieldType(t, fname);
|
|
|
- 2343 sfx := TRUE
|
|
|
- 2344 END; .)
|
|
|
- 2345 | "^" (. isM := FALSE;
|
|
|
- 2346 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2347 astWrap := AST.MakeNode(
|
|
|
- 2348 AST.NkDesignator);
|
|
|
- 2349 AST.SetChild(astWrap, 0, node);
|
|
|
- 2350 node := astWrap
|
|
|
- 2351 END;
|
|
|
- 2352 astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2353 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2354 AST.SetChild(node,
|
|
|
- 2355 AST.NChild(node), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2356 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2357 SymTab.ClPtr THEN
|
|
|
- 2358 SemError(219);
|
|
|
- 2359 t := SymTab.InvalidType
|
|
|
- 2360 ELSE
|
|
|
- 2361 bt := SymTab.PtrBase(t);
|
|
|
- 2362 IF bt # SymTab.InvalidType THEN
|
|
|
- 2363 t := bt; sfx := TRUE
|
|
|
- 2364 END
|
|
|
- 2365 END; .) .
|
|
|
- 2366 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2367 (. VAR t2: SymTab.TypeIndex;
|
|
|
- 2368 op: INTEGER;
|
|
|
- 2369 q2, qt, wl: QbeGen.QVal;
|
|
|
- 2370 astA, astB: AST.Node;
|
|
|
- 2371 astOp: INTEGER;
|
|
|
- 2372 astMade: BOOLEAN;
|
|
|
- 2373 isR: BOOLEAN; .)
|
|
|
- 2374 = SimExpr<t, q> (. astA := astCur; astMade := FALSE; .)
|
|
|
- 2375 [ Rel<op> SimExpr<t2, q2>
|
|
|
- 2376 (. astB := astCur; astMade := TRUE;
|
|
|
- 2377 astOp := AST.OpEq;
|
|
|
- 2378 IF op = SymTab.OpNeq1 THEN astOp := AST.OpNe
|
|
|
- 2379 ELSIF op = SymTab.OpNeq2 THEN astOp := AST.OpNe
|
|
|
- 2380 ELSIF op = SymTab.OpLt THEN astOp := AST.OpLt
|
|
|
- 2381 ELSIF op = SymTab.OpLe THEN astOp := AST.OpLe
|
|
|
- 2382 ELSIF op = SymTab.OpGt THEN astOp := AST.OpGt
|
|
|
- 2383 ELSIF op = SymTab.OpGe THEN astOp := AST.OpGe
|
|
|
- 2384 ELSIF op = SymTab.OpIn THEN astOp := AST.OpIn
|
|
|
- 2385 END;
|
|
|
- 2386 IF op = SymTab.OpIn THEN
|
|
|
- 2387 IF SymTab.InCheck(t, t2) THEN
|
|
|
- 2388 IF (t = SymTab.InvalidType)
|
|
|
- 2389 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2390 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2391 ELSE
|
|
|
- 2392 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2393 END
|
|
|
- 2394 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
- 2395 QbeGen.CopyOp("0", q)
|
|
|
- 2396 END
|
|
|
- 2397 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
- 2398 IF (t = SymTab.InvalidType)
|
|
|
- 2399 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2400 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2401 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
- 2402 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
- 2403 IF SymTab.IsFwdVar(t) OR SymTab.IsFwdVar(t2) THEN
|
|
|
- 2404 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2405 ELSIF (op # SymTab.OpEq) AND (op # SymTab.OpNeq1)
|
|
|
- 2406 AND (op # SymTab.OpNeq2) THEN
|
|
|
- 2407 SemError(213); t := SymTab.InvalidType;
|
|
|
- 2408 QbeGen.CopyOp("0", q)
|
|
|
- 2409 ELSE
|
|
|
- 2410 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2411 END
|
|
|
- 2412 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2413 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2414 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2415 ELSIF SymTab.StrCompat(t, t2) THEN
|
|
|
- 2416 QbeGen.StrEq(op, q, q2, qt);
|
|
|
- 2417 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
- 2418 ELSIF SymTab.IsLongFamily(t)
|
|
|
- 2419 OR SymTab.IsLongFamily(t2) THEN
|
|
|
- 2420 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2421 ELSE
|
|
|
- 2422 t := SymTab.BoolType();
|
|
|
- 2423 QbeGen.CopyOp("@", q)
|
|
|
- 2424 END
|
|
|
- 2425 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
- 2426 QbeGen.CopyOp("0", q)
|
|
|
- 2427 END;
|
|
|
- 2428 astCur := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB); .) ]
|
|
|
- 2429 (. IF NOT astMade THEN astCur := astA END; .) .
|
|
|
- 2430 Rel<VAR op: INTEGER>
|
|
|
- 2431 = "=" (. op := SymTab.OpEq; .)
|
|
|
- 2432 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
- 2433 | "<" (. op := SymTab.OpLt; .)
|
|
|
- 2434 | "<=" (. op := SymTab.OpLe; .)
|
|
|
- 2435 | ">" (. op := SymTab.OpGt; .)
|
|
|
- 2436 | ">=" (. op := SymTab.OpGe; .)
|
|
|
- 2437 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
- 2438 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2439 (. VAR t2, res2, lt, rt:
|
|
|
- 2440 SymTab.TypeIndex;
|
|
|
- 2441 op: INTEGER;
|
|
|
- 2442 q2, qt, wq, qf, q2a, q2b:
|
|
|
- 2443 QbeGen.QVal;
|
|
|
- 2444 neg, isR, isL, folded:
|
|
|
- 2445 BOOLEAN;
|
|
|
- 2446 fok: BOOLEAN;
|
|
|
- 2447 lw, rw, mw: CARDINAL;
|
|
|
- 2448 lTrue, lNext, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2449 astA, astB: AST.Node;
|
|
|
- 2450 astSign, astOp: INTEGER; .)
|
|
|
- 2451 = (. neg := FALSE; astSign := 0; .)
|
|
|
- 2452 [ "+" (. neg := TRUE; astSign := 1; .)
|
|
|
- 2453 | "-" (. neg := TRUE; astSign := -1; .) ]
|
|
|
- 2454 Term<t, q> (. astA := astCur;
|
|
|
- 2455 IF neg AND QbeGen.IsImm(q) THEN
|
|
|
- 2456 QbeGen.NegFold(q, q)
|
|
|
- 2457 END;
|
|
|
- 2458 IF astSign < 0 THEN
|
|
|
- 2459 astCur := AST.MakeUn(
|
|
|
- 2460 AST.NkUnary, AST.OpSub, astA);
|
|
|
- 2461 astA := astCur
|
|
|
- 2462 END; .)
|
|
|
- 2463 { AddOp<op>
|
|
|
- 2464 Term<t2, q2> (. astB := astCur; .)
|
|
|
- 2465 (. astOp := AST.OpAdd;
|
|
|
- 2466 IF op = SymTab.OpSub THEN astOp := AST.OpSub
|
|
|
- 2467 ELSIF op = SymTab.OpOr THEN astOp := AST.OpOr END;
|
|
|
- 2468 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2469 astCur := astA;
|
|
|
- 2470 IF op = SymTab.OpOr THEN
|
|
|
- 2471 (* short-circuit: if q is true the RHS is skipped *)
|
|
|
- 2472 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2473 t := SymTab.BoolType()
|
|
|
- 2474 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2475 IF t # SymTab.InvalidType THEN
|
|
|
+ 2300 ELSIF NOT SymTab.FieldExists(t,
|
|
|
+ 2301 fn) THEN
|
|
|
+ 2302 SemError(216);
|
|
|
+ 2303 t := SymTab.InvalidType
|
|
|
+ 2304 ELSE
|
|
|
+ 2305 t := SymTab.FieldType(t, fn);
|
|
|
+ 2306 sfx := TRUE
|
|
|
+ 2307 END; .)
|
|
|
+ 2308 | "^"
|
|
|
+ 2309 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2310 AST.SetOp(astSel, AST.SelDeref);
|
|
|
+ 2311 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF t = SymTab.InvalidType THEN
|
|
|
+ 2312 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2313 SymTab.ClPtr THEN
|
|
|
+ 2314 SemError(219);
|
|
|
+ 2315 t := SymTab.InvalidType
|
|
|
+ 2316 ELSE
|
|
|
+ 2317 bt := SymTab.PtrBase(t);
|
|
|
+ 2318 IF bt = SymTab.InvalidType THEN
|
|
|
+ 2319 ELSE
|
|
|
+ 2320 t := bt;
|
|
|
+ 2321 sfx := TRUE
|
|
|
+ 2322 END
|
|
|
+ 2323 END; .) } (. astCur := astDes; .) .
|
|
|
+ 2324 (* Result suffix (ISO component after a function call): `F()^`,
|
|
|
+ 2325 `F()[i]`, `F().field`. The call result is in t/q with sfx FALSE
|
|
|
+ 2326 (a value, or a descriptor address for aggregates); each component
|
|
|
+ 2327 descends one level exactly like the Design components. *)
|
|
|
+ 2328 ResultComp<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
+ 2329 VAR sfx: BOOLEAN; VAR node: AST.Node;
|
|
|
+ 2330 VAR mname: SymTab.Name; VAR methCls: SymTab.TypeIndex;
|
|
|
+ 2331 VAR isM: BOOLEAN> (. VAR it, eT, bt: SymTab.TypeIndex;
|
|
|
+ 2332 iq, ql, qlo, qhi, qe, qb:
|
|
|
+ 2333 QbeGen.QVal;
|
|
|
+ 2334 lo, hi, fo: INTEGER;
|
|
|
+ 2335 isOpen: BOOLEAN;
|
|
|
+ 2336 fname: SymTab.Name;
|
|
|
+ 2337 astWrap, astSel: AST.Node; .)
|
|
|
+ 2338 = "[" Expr<it, iq>
|
|
|
+ 2339 (. isM := FALSE;
|
|
|
+ 2340 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2341 astWrap := AST.MakeNode(
|
|
|
+ 2342 AST.NkDesignator);
|
|
|
+ 2343 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2344 node := astWrap
|
|
|
+ 2345 END;
|
|
|
+ 2346 AST.SetChild(node, AST.NChild(node),
|
|
|
+ 2347 AST.MakeUn(AST.NkSelector,
|
|
|
+ 2348 AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2349 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2350 SymTab.ClArray THEN
|
|
|
+ 2351 SemError(217);
|
|
|
+ 2352 t := SymTab.InvalidType
|
|
|
+ 2353 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2354 AND (SymTab.ClassOf(it) # SymTab.ClChar)
|
|
|
+ 2355 AND (SymTab.ClassOf(it) # SymTab.ClEnum) THEN
|
|
|
+ 2356 SemError(218);
|
|
|
+ 2357 t := SymTab.InvalidType
|
|
|
+ 2358 ELSE
|
|
|
+ 2359 eT := SymTab.ArrayElem(t);
|
|
|
+ 2360 t := eT; sfx := TRUE
|
|
|
+ 2361 END; .)
|
|
|
+ 2362 "]"
|
|
|
+ 2363 | "." GetIdent<fname>
|
|
|
+ 2364 (. isM := FALSE;
|
|
|
+ 2365 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2366 astWrap := AST.MakeNode(
|
|
|
+ 2367 AST.NkDesignator);
|
|
|
+ 2368 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2369 node := astWrap
|
|
|
+ 2370 END;
|
|
|
+ 2371 AST.SetChild(node, AST.NChild(node),
|
|
|
+ 2372 AST.MakeUn(AST.NkSelector,
|
|
|
+ 2373 AST.SelField,
|
|
|
+ 2374 AST.MakeLeaf(AST.NkIdent,
|
|
|
+ 2375 fname))); IF t = SymTab.InvalidType THEN
|
|
|
+ 2376 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2377 SymTab.ClRecord)
|
|
|
+ 2378 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
+ 2379 SemError(215);
|
|
|
+ 2380 t := SymTab.InvalidType
|
|
|
+ 2381 ELSIF (SymTab.ClassOf(t) =
|
|
|
+ 2382 SymTab.ClClass)
|
|
|
+ 2383 AND SymTab.MethodExists(t, fname) THEN
|
|
|
+ 2384 (* a method on the call result:
|
|
|
+ 2385 a following ArgList makes
|
|
|
+ 2386 the call *)
|
|
|
+ 2387 mname := fname;
|
|
|
+ 2388 methCls := t; isM := TRUE;
|
|
|
+ 2389 t := SymTab.InvalidType
|
|
|
+ 2390 ELSIF NOT SymTab.FieldExists(t,
|
|
|
+ 2391 fname) THEN
|
|
|
+ 2392 SemError(216);
|
|
|
+ 2393 t := SymTab.InvalidType
|
|
|
+ 2394 ELSE
|
|
|
+ 2395 t := SymTab.FieldType(t, fname);
|
|
|
+ 2396 sfx := TRUE
|
|
|
+ 2397 END; .)
|
|
|
+ 2398 | "^" (. isM := FALSE;
|
|
|
+ 2399 IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2400 astWrap := AST.MakeNode(
|
|
|
+ 2401 AST.NkDesignator);
|
|
|
+ 2402 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2403 node := astWrap
|
|
|
+ 2404 END;
|
|
|
+ 2405 astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2406 AST.SetOp(astSel, AST.SelDeref);
|
|
|
+ 2407 AST.SetChild(node,
|
|
|
+ 2408 AST.NChild(node), astSel); IF t = SymTab.InvalidType THEN
|
|
|
+ 2409 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2410 SymTab.ClPtr THEN
|
|
|
+ 2411 SemError(219);
|
|
|
+ 2412 t := SymTab.InvalidType
|
|
|
+ 2413 ELSE
|
|
|
+ 2414 bt := SymTab.PtrBase(t);
|
|
|
+ 2415 IF bt # SymTab.InvalidType THEN
|
|
|
+ 2416 t := bt; sfx := TRUE
|
|
|
+ 2417 END
|
|
|
+ 2418 END; .) .
|
|
|
+ 2419 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2420 (. VAR t2: SymTab.TypeIndex;
|
|
|
+ 2421 op: INTEGER;
|
|
|
+ 2422 q2, qt, wl: QbeGen.QVal;
|
|
|
+ 2423 astA, astB: AST.Node;
|
|
|
+ 2424 astOp: INTEGER;
|
|
|
+ 2425 astMade: BOOLEAN;
|
|
|
+ 2426 isR: BOOLEAN; .)
|
|
|
+ 2427 = SimExpr<t, q> (. astA := astCur; astMade := FALSE; .)
|
|
|
+ 2428 [ Rel<op> SimExpr<t2, q2>
|
|
|
+ 2429 (. astB := astCur; astMade := TRUE;
|
|
|
+ 2430 astOp := AST.OpEq;
|
|
|
+ 2431 IF op = SymTab.OpNeq1 THEN astOp := AST.OpNe
|
|
|
+ 2432 ELSIF op = SymTab.OpNeq2 THEN astOp := AST.OpNe
|
|
|
+ 2433 ELSIF op = SymTab.OpLt THEN astOp := AST.OpLt
|
|
|
+ 2434 ELSIF op = SymTab.OpLe THEN astOp := AST.OpLe
|
|
|
+ 2435 ELSIF op = SymTab.OpGt THEN astOp := AST.OpGt
|
|
|
+ 2436 ELSIF op = SymTab.OpGe THEN astOp := AST.OpGe
|
|
|
+ 2437 ELSIF op = SymTab.OpIn THEN astOp := AST.OpIn
|
|
|
+ 2438 END;
|
|
|
+ 2439 IF op = SymTab.OpIn THEN
|
|
|
+ 2440 IF SymTab.InCheck(t, t2) THEN
|
|
|
+ 2441 IF (t = SymTab.InvalidType)
|
|
|
+ 2442 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 2443 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 2444 ELSE
|
|
|
+ 2445 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2446 END
|
|
|
+ 2447 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
+ 2448 QbeGen.CopyOp("0", q)
|
|
|
+ 2449 END
|
|
|
+ 2450 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
+ 2451 IF (t = SymTab.InvalidType)
|
|
|
+ 2452 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 2453 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 2454 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
+ 2455 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
+ 2456 IF SymTab.IsFwdVar(t) OR SymTab.IsFwdVar(t2) THEN
|
|
|
+ 2457 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2458 ELSIF (op # SymTab.OpEq) AND (op # SymTab.OpNeq1)
|
|
|
+ 2459 AND (op # SymTab.OpNeq2) THEN
|
|
|
+ 2460 SemError(213); t := SymTab.InvalidType;
|
|
|
+ 2461 QbeGen.CopyOp("0", q)
|
|
|
+ 2462 ELSE
|
|
|
+ 2463 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2464 END
|
|
|
+ 2465 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2466 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2467 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2468 ELSIF SymTab.StrCompat(t, t2) THEN
|
|
|
+ 2469 QbeGen.StrEq(op, q, q2, qt);
|
|
|
+ 2470 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
+ 2471 ELSIF SymTab.IsLongFamily(t)
|
|
|
+ 2472 OR SymTab.IsLongFamily(t2) THEN
|
|
|
+ 2473 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2474 ELSE
|
|
|
+ 2475 t := SymTab.BoolType();
|
|
|
2476 QbeGen.CopyOp("@", q)
|
|
|
- 2477 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2478 END
|
|
|
- 2479 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2480 AND (SymTab.UStrCompat(t, t2)
|
|
|
- 2481 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2482 AND (SymTab.ClassOf(t2) = SymTab.ClUStr))
|
|
|
- 2483 OR ((SymTab.ClassOf(t) = SymTab.ClUStr)
|
|
|
- 2484 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))
|
|
|
- 2485 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2486 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))) THEN
|
|
|
- 2487 (* UString concatenation: a UCHAR operand becomes a
|
|
|
- 2488 1-codepoint UString; the result is a descriptor in the
|
|
|
- 2489 shim's concat buffer. Work on copies so neither
|
|
|
- 2490 operand is clobbered. *)
|
|
|
- 2491 t := SymTab.NewUStr();
|
|
|
- 2492 QbeGen.CopyOp("@", q)
|
|
|
- 2493 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2494 AND (SymTab.StrCompat(t, t2)
|
|
|
- 2495 OR (SymTab.IsStrType(t)
|
|
|
- 2496 AND (SymTab.ClassOf(t2) = SymTab.ClChar))
|
|
|
- 2497 OR ((SymTab.ClassOf(t) = SymTab.ClChar)
|
|
|
- 2498 AND SymTab.IsStrType(t2))) THEN
|
|
|
- 2499 (* string concatenation; a CHAR operand becomes a
|
|
|
- 2500 1-character string literal. When both operands are
|
|
|
- 2501 constants, fold to a single string literal so a
|
|
|
- 2502 constructor element stays compile-time. *)
|
|
|
- 2503 QbeGen.StrFold(q, q2, SymTab.ClassOf(t), SymTab.ClassOf(t2),
|
|
|
- 2504 qt, fok);
|
|
|
- 2505 IF fok THEN QbeGen.CopyOp(qt, q)
|
|
|
- 2506 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2507 END;
|
|
|
- 2508 t := SymTab.NewStr()
|
|
|
- 2509 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2510 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2511 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2512 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2513 mw := lw;
|
|
|
- 2514 IF rw > mw THEN mw := rw END;
|
|
|
- 2515 t := SymTab.NewSet(
|
|
|
- 2516 SymTab.NewSubR(0,
|
|
|
- 2517 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2518 QbeGen.CopyOp("@", q)
|
|
|
- 2519 ELSE
|
|
|
- 2520 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
- 2521 lt := t; rt := t2; t := res2
|
|
|
- 2522 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2523 IF t # SymTab.InvalidType THEN
|
|
|
- 2524 isL := SymTab.IsLongFamily(t);
|
|
|
- 2525 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2526 folded := FALSE;
|
|
|
- 2527 IF (NOT isL) AND (NOT isR)
|
|
|
- 2528 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2529 IF op = SymTab.OpAdd THEN
|
|
|
- 2530 folded := QbeGen.Fold2(0, q, q2, qf)
|
|
|
- 2531 ELSE
|
|
|
- 2532 folded := QbeGen.Fold2(1, q, q2, qf)
|
|
|
- 2533 END
|
|
|
- 2534 END;
|
|
|
- 2535 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2536 ELSE
|
|
|
- 2537 QbeGen.CopyOp("@", q)
|
|
|
- 2538 END
|
|
|
- 2539 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2540 END
|
|
|
- 2541 END; .) } .
|
|
|
- 2542 AddOp<VAR op: INTEGER>
|
|
|
- 2543 = "+" (. op := SymTab.OpAdd; .)
|
|
|
- 2544 | "-" (. op := SymTab.OpSub; .)
|
|
|
- 2545 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
- 2546 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2547 (. VAR t2, res2, lt, rt:
|
|
|
- 2548 SymTab.TypeIndex;
|
|
|
- 2549 op: INTEGER;
|
|
|
- 2550 q2, qt, wq, qf:
|
|
|
- 2551 QbeGen.QVal;
|
|
|
- 2552 isR, isL, folded: BOOLEAN;
|
|
|
- 2553 lw, rw, mw: CARDINAL;
|
|
|
- 2554 lNext, lFalse, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2555 astA, astB: AST.Node;
|
|
|
- 2556 astOp: INTEGER; .)
|
|
|
- 2557 = Fact<t, q> (. astA := astCur; .) { MulOp<op>
|
|
|
- 2558 Fact<t2, q2> (. astB := astCur; .)
|
|
|
- 2559 (. astOp := AST.OpMul;
|
|
|
- 2560 IF op = SymTab.OpSlash THEN astOp := AST.OpDiv
|
|
|
- 2561 ELSIF op = SymTab.OpDiv THEN astOp := AST.OpDiv
|
|
|
- 2562 ELSIF op = SymTab.OpMod THEN astOp := AST.OpMod
|
|
|
- 2563 ELSIF op = SymTab.OpAnd THEN astOp := AST.OpAnd END;
|
|
|
- 2564 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2565 astCur := astA;
|
|
|
- 2566 IF op = SymTab.OpAnd THEN
|
|
|
- 2567 (* short-circuit: if q is false the RHS is skipped *)
|
|
|
- 2568 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2569 t := SymTab.BoolType()
|
|
|
- 2570 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2571 IF t # SymTab.InvalidType THEN QbeGen.CopyOp("@", q)
|
|
|
- 2572 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2573 END
|
|
|
- 2574 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2575 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2576 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2577 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2578 mw := lw;
|
|
|
- 2579 IF rw > mw THEN mw := rw END;
|
|
|
- 2580 t := SymTab.NewSet(
|
|
|
- 2581 SymTab.NewSubR(0,
|
|
|
- 2582 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2583 QbeGen.CopyOp("@", q)
|
|
|
- 2584 ELSE
|
|
|
- 2585 IF SymTab.ArithCheck(t, t2,
|
|
|
- 2586 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
- 2587 res2) THEN
|
|
|
- 2588 lt := t; rt := t2; t := res2
|
|
|
- 2589 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2590 IF t # SymTab.InvalidType THEN
|
|
|
- 2591 isL := SymTab.IsLongFamily(t);
|
|
|
- 2592 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2593 folded := FALSE;
|
|
|
- 2594 IF (NOT isL) AND (NOT isR)
|
|
|
- 2595 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2596 IF op = SymTab.OpTimes THEN
|
|
|
- 2597 folded := QbeGen.Fold2(2, q, q2, qf)
|
|
|
- 2598 ELSIF op = SymTab.OpDiv THEN
|
|
|
- 2599 folded := QbeGen.Fold2(3, q, q2, qf)
|
|
|
- 2600 ELSIF op = SymTab.OpMod THEN
|
|
|
- 2601 folded := QbeGen.Fold2(4, q, q2, qf)
|
|
|
- 2602 END
|
|
|
- 2603 END;
|
|
|
- 2604 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2605 ELSE
|
|
|
- 2606 QbeGen.CopyOp("@", q)
|
|
|
- 2607 END
|
|
|
- 2608 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2609 END
|
|
|
- 2610 END; .) } .
|
|
|
- 2611 MulOp<VAR op: INTEGER>
|
|
|
- 2612 = "*" (. op := SymTab.OpTimes; .)
|
|
|
- 2613 | "/" (. op := SymTab.OpSlash; .)
|
|
|
- 2614 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
- 2615 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
- 2616 | ( "AND" | "&" ) (. op := SymTab.OpAnd; .) .
|
|
|
- 2617 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2618 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
- 2619 et, dt, t2, st, ct2, et2:
|
|
|
- 2620 SymTab.TypeIndex;
|
|
|
- 2621 dk: INTEGER;
|
|
|
- 2622 qd, q2, sq, qa, qm0, qr, qt:
|
|
|
- 2623 QbeGen.QVal;
|
|
|
- 2624 qn, vn: SymTab.Name;
|
|
|
- 2625 vt: SymTab.TypeIndex;
|
|
|
- 2626 c1, c2: INTEGER;
|
|
|
- 2627 lo, hi: INTEGER;
|
|
|
- 2628 isMax: BOOLEAN;
|
|
|
- 2629 called, isHigh, sfx, isCh,
|
|
|
- 2630 isU, uok, isStr: BOOLEAN;
|
|
|
- 2631 ucp: INTEGER; astIsLit: BOOLEAN;
|
|
|
- 2632 astD: AST.Node;
|
|
|
- 2633 astCall: BOOLEAN;
|
|
|
- 2634 astNode, astNot: AST.Node;
|
|
|
- 2635 j: CARDINAL;
|
|
|
- 2636 astArg2: AST.Node;
|
|
|
- 2637 astBrace: AST.Node;
|
|
|
- 2638 astRes: AST.Node; mname: SymTab.Name; isM: BOOLEAN; .)
|
|
|
- 2639 = (. astIsLit := FALSE; .)
|
|
|
- 2640 ( integer (. LexString(s);
|
|
|
- 2641 QbeGen.NormInt(s, q); IF twoPhase THEN astIsLit := TRUE; astCur := AST.MakeLeaf(AST.NkIntLit, s) END;
|
|
|
- 2642 t := SymTab.IntType(); .)
|
|
|
- 2643 | charConst (. LexString(s);
|
|
|
- 2644 QbeGen.NormLit(s, q, isCh);
|
|
|
- 2645 IF twoPhase THEN
|
|
|
- 2646 astIsLit := TRUE;
|
|
|
- 2647 astCur := AST.MakeLeaf(
|
|
|
- 2648 AST.NkCharLit, s)
|
|
|
- 2649 END;
|
|
|
- 2650 t := SymTab.CharType(); .)
|
|
|
- 2651 | real (. LexString(s);
|
|
|
- 2652 QbeGen.NormReal(s, q);
|
|
|
- 2653 IF twoPhase THEN
|
|
|
- 2654 astIsLit := TRUE;
|
|
|
- 2655 astCur := AST.MakeLeaf(
|
|
|
- 2656 AST.NkRealLit, s)
|
|
|
- 2657 END;
|
|
|
- 2658 t := SymTab.RealType(); .)
|
|
|
- 2659 | string (. LexString(s);
|
|
|
- 2660 IF twoPhase THEN
|
|
|
- 2661 astIsLit := TRUE;
|
|
|
- 2662 astCur := AST.MakeLeaf(
|
|
|
- 2663 AST.NkStrLit, s)
|
|
|
- 2664 END;
|
|
|
- 2665 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2666 t := SymTab.CharType();
|
|
|
- 2667 QbeGen.IntStr(
|
|
|
- 2668 QbeGen.CharVal(s), q)
|
|
|
- 2669 ELSE t := SymTab.NewStr();
|
|
|
- 2670 QbeGen.DeclStr(s, q);
|
|
|
- 2671 (* a literal's value IS its
|
|
|
- 2672 static descriptor address *)
|
|
|
- 2673 END; .)
|
|
|
- 2674 | ustring (. LexString(s);
|
|
|
- 2675 IF twoPhase THEN
|
|
|
- 2676 astIsLit := TRUE;
|
|
|
- 2677 astCur := AST.MakeLeaf(
|
|
|
- 2678 AST.NkStrLit, s)
|
|
|
- 2679 END;
|
|
|
- 2680 QbeGen.DeclUStr(s, q, isU, ucp,
|
|
|
- 2681 uok);
|
|
|
- 2682 IF NOT uok THEN
|
|
|
- 2683 SemError(234);
|
|
|
- 2684 t := SymTab.InvalidType
|
|
|
- 2685 ELSIF isU THEN
|
|
|
- 2686 t := SymTab.UCharType();
|
|
|
- 2687 QbeGen.IntStr(ucp, q)
|
|
|
- 2688 ELSE
|
|
|
- 2689 t := SymTab.NewUStr();
|
|
|
- 2690 END; .)
|
|
|
- 2691 | Design<dt, dk, qd, qn, sfx> (. astD := astCur; astCall := FALSE; astBrace := AST.NoNode;
|
|
|
- 2692 astNArgs := 0; called := FALSE;
|
|
|
- 2693 t := dt;
|
|
|
- 2694 IF dk = SymTab.KindConst THEN
|
|
|
- 2695 QbeGen.CopyOp(qd, q)
|
|
|
- 2696 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2697 END; .)
|
|
|
- 2698 [ TypedBraceLit<dt, q> (. t := dt; astCall := TRUE;
|
|
|
- 2699 astBrace := astCur; .) ]
|
|
|
- 2700 [ ArgList<qn, dt, qd, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
- 2701 (. astCall := TRUE;
|
|
|
- 2702 astNode := AstCallNode(astD);
|
|
|
- 2703 astRes := astNode;
|
|
|
- 2704 t := ct2;
|
|
|
- 2705 QbeGen.CopyOp(q2, q);
|
|
|
- 2706 sfx := FALSE; .)
|
|
|
- 2707 { ResultComp<t, q, sfx, astRes, mname, methCls, isM>
|
|
|
- 2708 [ (. astNArgs := 0; .)
|
|
|
- 2709 ArgList<mname, t, q, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
- 2710 (. astNode := AstCallNode(astRes);
|
|
|
- 2711 astRes := astNode;
|
|
|
- 2712 t := ct2;
|
|
|
- 2713 QbeGen.CopyOp(q2, q);
|
|
|
- 2714 sfx := FALSE; .) ] }
|
|
|
- 2715 (. IF sfx THEN
|
|
|
- 2716 IF t = SymTab.InvalidType THEN
|
|
|
- 2717 QbeGen.CopyOp("0", q)
|
|
|
- 2718 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2719 SymTab.ClRecord)
|
|
|
- 2720 AND (SymTab.ClassOf(t) # SymTab.ClSet)
|
|
|
- 2721 AND (SymTab.ClassOf(t) # SymTab.ClArray)
|
|
|
- 2722 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2723 QbeGen.CopyOp("@", q)
|
|
|
- 2724 END
|
|
|
- 2725 END; .) ]
|
|
|
- 2726 (. IF called THEN
|
|
|
- 2727 astCur := astRes
|
|
|
- 2728 ELSIF astCall THEN
|
|
|
- 2729 astCur := astBrace
|
|
|
- 2730 ELSE astCur := astD
|
|
|
- 2731 END;
|
|
|
- 2732 astIsLit := TRUE;
|
|
|
- 2733 IF NOT called
|
|
|
- 2734 AND (dk = SymTab.KindProc) THEN
|
|
|
- 2735 (* bare zero-arg function
|
|
|
- 2736 call (parentheses may be
|
|
|
- 2737 omitted); a proper or
|
|
|
- 2738 parameterised proc here
|
|
|
- 2739 is 230 *)
|
|
|
- 2740 IF (SymTab.ProcNPar(qn) = 0)
|
|
|
- 2741 AND (SymTab.ProcRes(qn) # SymTab.InvalidType) THEN
|
|
|
- 2742 t := SymTab.ProcRes(qn);
|
|
|
- 2743 QbeGen.CopyOp("@", q);
|
|
|
- 2744 astCur := AST.MakeNode(AST.NkCall);
|
|
|
- 2745 AST.SetChild(astCur, 0, astD)
|
|
|
- 2746 ELSE
|
|
|
- 2747 t := SymTab.ProcTypeOf(qn);
|
|
|
- 2748 QbeGen.CopyOp("@", q)
|
|
|
- 2749 END
|
|
|
+ 2477 END
|
|
|
+ 2478 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
+ 2479 QbeGen.CopyOp("0", q)
|
|
|
+ 2480 END;
|
|
|
+ 2481 astCur := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB); .) ]
|
|
|
+ 2482 (. IF NOT astMade THEN astCur := astA END; .) .
|
|
|
+ 2483 Rel<VAR op: INTEGER>
|
|
|
+ 2484 = "=" (. op := SymTab.OpEq; .)
|
|
|
+ 2485 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
+ 2486 | "<" (. op := SymTab.OpLt; .)
|
|
|
+ 2487 | "<=" (. op := SymTab.OpLe; .)
|
|
|
+ 2488 | ">" (. op := SymTab.OpGt; .)
|
|
|
+ 2489 | ">=" (. op := SymTab.OpGe; .)
|
|
|
+ 2490 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
+ 2491 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2492 (. VAR t2, res2, lt, rt:
|
|
|
+ 2493 SymTab.TypeIndex;
|
|
|
+ 2494 op: INTEGER;
|
|
|
+ 2495 q2, qt, wq, qf, q2a, q2b:
|
|
|
+ 2496 QbeGen.QVal;
|
|
|
+ 2497 neg, isR, isL, folded:
|
|
|
+ 2498 BOOLEAN;
|
|
|
+ 2499 fok: BOOLEAN;
|
|
|
+ 2500 lw, rw, mw: CARDINAL;
|
|
|
+ 2501 lTrue, lNext, lDone, qr, qs: QbeGen.QVal;
|
|
|
+ 2502 astA, astB: AST.Node;
|
|
|
+ 2503 astSign, astOp: INTEGER; .)
|
|
|
+ 2504 = (. neg := FALSE; astSign := 0; .)
|
|
|
+ 2505 [ "+" (. neg := TRUE; astSign := 1; .)
|
|
|
+ 2506 | "-" (. neg := TRUE; astSign := -1; .) ]
|
|
|
+ 2507 Term<t, q> (. astA := astCur;
|
|
|
+ 2508 IF neg AND QbeGen.IsImm(q) THEN
|
|
|
+ 2509 QbeGen.NegFold(q, q)
|
|
|
+ 2510 END;
|
|
|
+ 2511 IF astSign < 0 THEN
|
|
|
+ 2512 astCur := AST.MakeUn(
|
|
|
+ 2513 AST.NkUnary, AST.OpSub, astA);
|
|
|
+ 2514 astA := astCur
|
|
|
+ 2515 END; .)
|
|
|
+ 2516 { AddOp<op>
|
|
|
+ 2517 Term<t2, q2> (. astB := astCur; .)
|
|
|
+ 2518 (. astOp := AST.OpAdd;
|
|
|
+ 2519 IF op = SymTab.OpSub THEN astOp := AST.OpSub
|
|
|
+ 2520 ELSIF op = SymTab.OpOr THEN astOp := AST.OpOr END;
|
|
|
+ 2521 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
+ 2522 astCur := astA;
|
|
|
+ 2523 IF op = SymTab.OpOr THEN
|
|
|
+ 2524 (* short-circuit: if q is true the RHS is skipped *)
|
|
|
+ 2525 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
+ 2526 t := SymTab.BoolType()
|
|
|
+ 2527 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 2528 IF t # SymTab.InvalidType THEN
|
|
|
+ 2529 QbeGen.CopyOp("@", q)
|
|
|
+ 2530 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2531 END
|
|
|
+ 2532 ELSIF (op = SymTab.OpAdd)
|
|
|
+ 2533 AND (SymTab.UStrCompat(t, t2)
|
|
|
+ 2534 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
+ 2535 AND (SymTab.ClassOf(t2) = SymTab.ClUStr))
|
|
|
+ 2536 OR ((SymTab.ClassOf(t) = SymTab.ClUStr)
|
|
|
+ 2537 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))
|
|
|
+ 2538 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
+ 2539 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))) THEN
|
|
|
+ 2540 (* UString concatenation: a UCHAR operand becomes a
|
|
|
+ 2541 1-codepoint UString; the result is a descriptor in the
|
|
|
+ 2542 shim's concat buffer. Work on copies so neither
|
|
|
+ 2543 operand is clobbered. *)
|
|
|
+ 2544 t := SymTab.NewUStr();
|
|
|
+ 2545 QbeGen.CopyOp("@", q)
|
|
|
+ 2546 ELSIF (op = SymTab.OpAdd)
|
|
|
+ 2547 AND (SymTab.StrCompat(t, t2)
|
|
|
+ 2548 OR (SymTab.IsStrType(t)
|
|
|
+ 2549 AND (SymTab.ClassOf(t2) = SymTab.ClChar))
|
|
|
+ 2550 OR ((SymTab.ClassOf(t) = SymTab.ClChar)
|
|
|
+ 2551 AND SymTab.IsStrType(t2))) THEN
|
|
|
+ 2552 (* string concatenation; a CHAR operand becomes a
|
|
|
+ 2553 1-character string literal. When both operands are
|
|
|
+ 2554 constants, fold to a single string literal so a
|
|
|
+ 2555 constructor element stays compile-time. *)
|
|
|
+ 2556 QbeGen.StrFold(q, q2, SymTab.ClassOf(t), SymTab.ClassOf(t2),
|
|
|
+ 2557 qt, fok);
|
|
|
+ 2558 IF fok THEN QbeGen.CopyOp(qt, q)
|
|
|
+ 2559 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 2560 END;
|
|
|
+ 2561 t := SymTab.NewStr()
|
|
|
+ 2562 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
+ 2563 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2564 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2565 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 2566 mw := lw;
|
|
|
+ 2567 IF rw > mw THEN mw := rw END;
|
|
|
+ 2568 t := SymTab.NewSet(
|
|
|
+ 2569 SymTab.NewSubR(0,
|
|
|
+ 2570 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 2571 QbeGen.CopyOp("@", q)
|
|
|
+ 2572 ELSE
|
|
|
+ 2573 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
+ 2574 lt := t; rt := t2; t := res2
|
|
|
+ 2575 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 2576 IF t # SymTab.InvalidType THEN
|
|
|
+ 2577 isL := SymTab.IsLongFamily(t);
|
|
|
+ 2578 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 2579 folded := FALSE;
|
|
|
+ 2580 IF (NOT isL) AND (NOT isR)
|
|
|
+ 2581 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
+ 2582 IF op = SymTab.OpAdd THEN
|
|
|
+ 2583 folded := QbeGen.Fold2(0, q, q2, qf)
|
|
|
+ 2584 ELSE
|
|
|
+ 2585 folded := QbeGen.Fold2(1, q, q2, qf)
|
|
|
+ 2586 END
|
|
|
+ 2587 END;
|
|
|
+ 2588 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
+ 2589 ELSE
|
|
|
+ 2590 QbeGen.CopyOp("@", q)
|
|
|
+ 2591 END
|
|
|
+ 2592 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2593 END
|
|
|
+ 2594 END; .) } .
|
|
|
+ 2595 AddOp<VAR op: INTEGER>
|
|
|
+ 2596 = "+" (. op := SymTab.OpAdd; .)
|
|
|
+ 2597 | "-" (. op := SymTab.OpSub; .)
|
|
|
+ 2598 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
+ 2599 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2600 (. VAR t2, res2, lt, rt:
|
|
|
+ 2601 SymTab.TypeIndex;
|
|
|
+ 2602 op: INTEGER;
|
|
|
+ 2603 q2, qt, wq, qf:
|
|
|
+ 2604 QbeGen.QVal;
|
|
|
+ 2605 isR, isL, folded: BOOLEAN;
|
|
|
+ 2606 lw, rw, mw: CARDINAL;
|
|
|
+ 2607 lNext, lFalse, lDone, qr, qs: QbeGen.QVal;
|
|
|
+ 2608 astA, astB: AST.Node;
|
|
|
+ 2609 astOp: INTEGER; .)
|
|
|
+ 2610 = Fact<t, q> (. astA := astCur; .) { MulOp<op>
|
|
|
+ 2611 Fact<t2, q2> (. astB := astCur; .)
|
|
|
+ 2612 (. astOp := AST.OpMul;
|
|
|
+ 2613 IF op = SymTab.OpSlash THEN astOp := AST.OpDiv
|
|
|
+ 2614 ELSIF op = SymTab.OpDiv THEN astOp := AST.OpDiv
|
|
|
+ 2615 ELSIF op = SymTab.OpMod THEN astOp := AST.OpMod
|
|
|
+ 2616 ELSIF op = SymTab.OpAnd THEN astOp := AST.OpAnd END;
|
|
|
+ 2617 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
+ 2618 astCur := astA;
|
|
|
+ 2619 IF op = SymTab.OpAnd THEN
|
|
|
+ 2620 (* short-circuit: if q is false the RHS is skipped *)
|
|
|
+ 2621 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
+ 2622 t := SymTab.BoolType()
|
|
|
+ 2623 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 2624 IF t # SymTab.InvalidType THEN QbeGen.CopyOp("@", q)
|
|
|
+ 2625 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2626 END
|
|
|
+ 2627 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
+ 2628 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2629 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2630 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 2631 mw := lw;
|
|
|
+ 2632 IF rw > mw THEN mw := rw END;
|
|
|
+ 2633 t := SymTab.NewSet(
|
|
|
+ 2634 SymTab.NewSubR(0,
|
|
|
+ 2635 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 2636 QbeGen.CopyOp("@", q)
|
|
|
+ 2637 ELSE
|
|
|
+ 2638 IF SymTab.ArithCheck(t, t2,
|
|
|
+ 2639 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
+ 2640 res2) THEN
|
|
|
+ 2641 lt := t; rt := t2; t := res2
|
|
|
+ 2642 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 2643 IF t # SymTab.InvalidType THEN
|
|
|
+ 2644 isL := SymTab.IsLongFamily(t);
|
|
|
+ 2645 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 2646 folded := FALSE;
|
|
|
+ 2647 IF (NOT isL) AND (NOT isR)
|
|
|
+ 2648 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
+ 2649 IF op = SymTab.OpTimes THEN
|
|
|
+ 2650 folded := QbeGen.Fold2(2, q, q2, qf)
|
|
|
+ 2651 ELSIF op = SymTab.OpDiv THEN
|
|
|
+ 2652 folded := QbeGen.Fold2(3, q, q2, qf)
|
|
|
+ 2653 ELSIF op = SymTab.OpMod THEN
|
|
|
+ 2654 folded := QbeGen.Fold2(4, q, q2, qf)
|
|
|
+ 2655 END
|
|
|
+ 2656 END;
|
|
|
+ 2657 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
+ 2658 ELSE
|
|
|
+ 2659 QbeGen.CopyOp("@", q)
|
|
|
+ 2660 END
|
|
|
+ 2661 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2662 END
|
|
|
+ 2663 END; .) } .
|
|
|
+ 2664 MulOp<VAR op: INTEGER>
|
|
|
+ 2665 = "*" (. op := SymTab.OpTimes; .)
|
|
|
+ 2666 | "/" (. op := SymTab.OpSlash; .)
|
|
|
+ 2667 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
+ 2668 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
+ 2669 | ( "AND" | "&" ) (. op := SymTab.OpAnd; .) .
|
|
|
+ 2670 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2671 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
+ 2672 et, dt, t2, st, ct2, et2:
|
|
|
+ 2673 SymTab.TypeIndex;
|
|
|
+ 2674 dk: INTEGER;
|
|
|
+ 2675 qd, q2, sq, qa, qm0, qr, qt:
|
|
|
+ 2676 QbeGen.QVal;
|
|
|
+ 2677 qn, vn: SymTab.Name;
|
|
|
+ 2678 vt: SymTab.TypeIndex;
|
|
|
+ 2679 c1, c2: INTEGER;
|
|
|
+ 2680 lo, hi: INTEGER;
|
|
|
+ 2681 isMax: BOOLEAN;
|
|
|
+ 2682 called, isHigh, sfx, isCh,
|
|
|
+ 2683 isU, uok, isStr: BOOLEAN;
|
|
|
+ 2684 ucp: INTEGER; astIsLit: BOOLEAN;
|
|
|
+ 2685 astD: AST.Node;
|
|
|
+ 2686 astCall: BOOLEAN;
|
|
|
+ 2687 astNode, astNot: AST.Node;
|
|
|
+ 2688 j: CARDINAL;
|
|
|
+ 2689 astArg2: AST.Node;
|
|
|
+ 2690 astBrace: AST.Node;
|
|
|
+ 2691 astRes: AST.Node; mname: SymTab.Name; isM: BOOLEAN; .)
|
|
|
+ 2692 = (. astIsLit := FALSE; .)
|
|
|
+ 2693 ( integer (. LexString(s);
|
|
|
+ 2694 QbeGen.NormInt(s, q); IF twoPhase THEN astIsLit := TRUE; astCur := AST.MakeLeaf(AST.NkIntLit, s) END;
|
|
|
+ 2695 t := SymTab.IntType(); .)
|
|
|
+ 2696 | charConst (. LexString(s);
|
|
|
+ 2697 QbeGen.NormLit(s, q, isCh);
|
|
|
+ 2698 IF twoPhase THEN
|
|
|
+ 2699 astIsLit := TRUE;
|
|
|
+ 2700 astCur := AST.MakeLeaf(
|
|
|
+ 2701 AST.NkCharLit, s)
|
|
|
+ 2702 END;
|
|
|
+ 2703 t := SymTab.CharType(); .)
|
|
|
+ 2704 | real (. LexString(s);
|
|
|
+ 2705 QbeGen.NormReal(s, q);
|
|
|
+ 2706 IF twoPhase THEN
|
|
|
+ 2707 astIsLit := TRUE;
|
|
|
+ 2708 astCur := AST.MakeLeaf(
|
|
|
+ 2709 AST.NkRealLit, s)
|
|
|
+ 2710 END;
|
|
|
+ 2711 t := SymTab.RealType(); .)
|
|
|
+ 2712 | string (. LexString(s);
|
|
|
+ 2713 IF twoPhase THEN
|
|
|
+ 2714 astIsLit := TRUE;
|
|
|
+ 2715 astCur := AST.MakeLeaf(
|
|
|
+ 2716 AST.NkStrLit, s)
|
|
|
+ 2717 END;
|
|
|
+ 2718 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2719 t := SymTab.CharType();
|
|
|
+ 2720 QbeGen.IntStr(
|
|
|
+ 2721 QbeGen.CharVal(s), q)
|
|
|
+ 2722 ELSE t := SymTab.NewStr();
|
|
|
+ 2723 QbeGen.DeclStr(s, q);
|
|
|
+ 2724 (* a literal's value IS its
|
|
|
+ 2725 static descriptor address *)
|
|
|
+ 2726 END; .)
|
|
|
+ 2727 | ustring (. LexString(s);
|
|
|
+ 2728 IF twoPhase THEN
|
|
|
+ 2729 astIsLit := TRUE;
|
|
|
+ 2730 astCur := AST.MakeLeaf(
|
|
|
+ 2731 AST.NkStrLit, s)
|
|
|
+ 2732 END;
|
|
|
+ 2733 QbeGen.DeclUStr(s, q, isU, ucp,
|
|
|
+ 2734 uok);
|
|
|
+ 2735 IF NOT uok THEN
|
|
|
+ 2736 SemError(234);
|
|
|
+ 2737 t := SymTab.InvalidType
|
|
|
+ 2738 ELSIF isU THEN
|
|
|
+ 2739 t := SymTab.UCharType();
|
|
|
+ 2740 QbeGen.IntStr(ucp, q)
|
|
|
+ 2741 ELSE
|
|
|
+ 2742 t := SymTab.NewUStr();
|
|
|
+ 2743 END; .)
|
|
|
+ 2744 | Design<dt, dk, qd, qn, sfx> (. astD := astCur; astCall := FALSE; astBrace := AST.NoNode;
|
|
|
+ 2745 astNArgs := 0; called := FALSE;
|
|
|
+ 2746 t := dt;
|
|
|
+ 2747 IF dk = SymTab.KindConst THEN
|
|
|
+ 2748 QbeGen.CopyOp(qd, q)
|
|
|
+ 2749 ELSE QbeGen.CopyOp("@", q)
|
|
|
2750 END; .)
|
|
|
- 2751 | ( "HIGH" (. isHigh := TRUE; .)
|
|
|
- 2752 | ( "LEN" | "LENGTH" ) (. isHigh := FALSE; .) )
|
|
|
- 2753 "(" ( Design<dt, dk, qd, qn, sfx> (. isStr := FALSE;
|
|
|
- 2754 isU := FALSE; .)
|
|
|
- 2755 | string (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2756 isStr := TRUE;
|
|
|
- 2757 isU := FALSE;
|
|
|
- 2758 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2759 dt := SymTab.CharType();
|
|
|
- 2760 QbeGen.IntStr(QbeGen.CharVal(s),
|
|
|
- 2761 qd)
|
|
|
- 2762 ELSE
|
|
|
- 2763 dt := SymTab.NewStr();
|
|
|
- 2764 QbeGen.DeclStr(s, qd);
|
|
|
- 2765 END;
|
|
|
- 2766 dk := -1;
|
|
|
- 2767 qn[0] := CHR(0); .)
|
|
|
- 2768 | ustring (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2769 QbeGen.DeclUStr(s, qd, isU, ucp,
|
|
|
- 2770 uok);
|
|
|
- 2771 isStr := FALSE;
|
|
|
- 2772 IF NOT uok THEN
|
|
|
- 2773 SemError(234);
|
|
|
- 2774 dt := SymTab.InvalidType
|
|
|
- 2775 ELSIF isU THEN
|
|
|
- 2776 (* one codepoint: a UCHAR;
|
|
|
- 2777 LEN is 1, HIGH is 0 *)
|
|
|
- 2778 dt := SymTab.UCharType();
|
|
|
- 2779 QbeGen.IntStr(ucp, qd)
|
|
|
- 2780 ELSE
|
|
|
- 2781 dt := SymTab.NewUStr();
|
|
|
- 2782 END;
|
|
|
- 2783 dk := -1;
|
|
|
- 2784 qn[0] := CHR(0); .) )
|
|
|
- 2785 ")"
|
|
|
- 2786 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2787 IF isHigh THEN AST.SetChild(astNode, 0,
|
|
|
- 2788 AST.MakeLeaf(AST.NkIdent, "HIGH"))
|
|
|
- 2789 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2790 AST.MakeLeaf(AST.NkIdent, "LEN")) END;
|
|
|
- 2791 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2792 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2793 IF (dt # SymTab.InvalidType)
|
|
|
- 2794 AND (SymTab.ClassOf(dt) = SymTab.ClUStr) THEN
|
|
|
- 2795 (* UString: the count is
|
|
|
- 2796 the descriptor header *)
|
|
|
- 2797 t := SymTab.IntType();
|
|
|
- 2798 QbeGen.CopyOp("@", q)
|
|
|
- 2799 ELSIF (dt # SymTab.InvalidType)
|
|
|
- 2800 AND (SymTab.ClassOf(dt) = SymTab.ClUChar) THEN
|
|
|
- 2801 (* single UCHAR codepoint *)
|
|
|
- 2802 IF isHigh THEN
|
|
|
- 2803 QbeGen.CopyOp("0", qr)
|
|
|
- 2804 ELSE
|
|
|
- 2805 QbeGen.CopyOp("1", qr)
|
|
|
- 2806 END;
|
|
|
- 2807 t := SymTab.IntType();
|
|
|
- 2808 QbeGen.CopyOp(qr, q)
|
|
|
- 2809 ELSIF isStr THEN
|
|
|
- 2810 (* fold: content length at
|
|
|
- 2811 compile time *)
|
|
|
- 2812 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2813 c1 := 1
|
|
|
- 2814 ELSE
|
|
|
- 2815 c1 :=
|
|
|
- 2816 SymTab.StrLen(s) - 2
|
|
|
- 2817 END;
|
|
|
- 2818 IF isHigh THEN
|
|
|
- 2819 DEC(c1)
|
|
|
- 2820 END;
|
|
|
- 2821 QbeGen.IntStr(c1, qr);
|
|
|
- 2822 t := SymTab.IntType();
|
|
|
- 2823 QbeGen.CopyOp(qr, q)
|
|
|
- 2824 ELSIF dt = SymTab.InvalidType THEN
|
|
|
- 2825 t := SymTab.InvalidType;
|
|
|
- 2826 QbeGen.CopyOp("0", q)
|
|
|
- 2827 ELSIF SymTab.ClassOf(dt) #
|
|
|
- 2828 SymTab.ClArray THEN
|
|
|
- 2829 SemError(217);
|
|
|
- 2830 t := SymTab.InvalidType;
|
|
|
- 2831 QbeGen.CopyOp("0", q)
|
|
|
- 2832 ELSE
|
|
|
- 2833 IF SymTab.IsOpenArray(dt) THEN
|
|
|
- 2834 t := SymTab.IntType();
|
|
|
- 2835 QbeGen.CopyOp("@", q)
|
|
|
- 2836 ELSE
|
|
|
- 2837 IF isHigh THEN
|
|
|
- 2838 QbeGen.IntStr(
|
|
|
- 2839 SymTab.ArrayHi(dt), qr)
|
|
|
- 2840 ELSE
|
|
|
- 2841 QbeGen.IntStr(VAL(
|
|
|
- 2842 INTEGER,
|
|
|
- 2843 SymTab.ArrayLen(dt)),
|
|
|
- 2844 qr)
|
|
|
- 2845 END;
|
|
|
- 2846 t := SymTab.IntType();
|
|
|
- 2847 QbeGen.CopyOp(qr, q)
|
|
|
- 2848 END
|
|
|
- 2849 END; .)
|
|
|
- 2850 | ( "SIZE" | "TSIZE" ) "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2851 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2852 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "SIZE"));
|
|
|
- 2853 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2854 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2855 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 2856 t := SymTab.InvalidType;
|
|
|
- 2857 QbeGen.CopyOp("0", q)
|
|
|
- 2858 ELSE
|
|
|
- 2859 QbeGen.IntStr(VAL(INTEGER,
|
|
|
- 2860 SymTab.ObjectSize(dt)), q);
|
|
|
- 2861 t := SymTab.IntType()
|
|
|
- 2862 END; .)
|
|
|
- 2863 | ( "SHIFT" (. isMax := FALSE; .)
|
|
|
- 2864 | "ROTATE" (. isMax := TRUE; .) )
|
|
|
- 2865 "(" Expr<et, q> (. astArg2 := astCur; .) "," Expr<et2, q2> ")"
|
|
|
- 2866 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2867 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 2868 AST.MakeLeaf(AST.NkIdent, "ROTATE"))
|
|
|
- 2869 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2870 AST.MakeLeaf(AST.NkIdent, "SHIFT")) END;
|
|
|
- 2871 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 2872 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 2873 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2874 (* set shift/rotate: isMax
|
|
|
- 2875 doubles as "rotate" *)
|
|
|
- 2876 IF (et # SymTab.InvalidType)
|
|
|
- 2877 AND (SymTab.ClassOf(et) =
|
|
|
- 2878 SymTab.ClSet) THEN
|
|
|
- 2879 t := et;
|
|
|
- 2880 QbeGen.CopyOp("@", q)
|
|
|
- 2881 ELSE SemError(230);
|
|
|
- 2882 t := SymTab.InvalidType;
|
|
|
- 2883 QbeGen.CopyOp("0", q)
|
|
|
- 2884 END; .)
|
|
|
- 2885 | ( "MIN" (. isMax := FALSE; .)
|
|
|
- 2886 | "MAX" (. isMax := TRUE; .) )
|
|
|
- 2887 "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2888 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2889 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 2890 AST.MakeLeaf(AST.NkIdent, "MAX"))
|
|
|
- 2891 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2892 AST.MakeLeaf(AST.NkIdent, "MIN")) END;
|
|
|
- 2893 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2894 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2895 IF (dt # SymTab.InvalidType)
|
|
|
- 2896 AND (SymTab.ClassOf(dt) = SymTab.ClReal) THEN
|
|
|
- 2897 (* REAL/LONGREAL: the
|
|
|
- 2898 implementation bounds *)
|
|
|
- 2899 IF isMax THEN
|
|
|
- 2900 QbeGen.NormReal(
|
|
|
- 2901 "3.402823e38", q)
|
|
|
- 2902 ELSE QbeGen.NormReal(
|
|
|
- 2903 "-3.402823e38", q)
|
|
|
- 2904 END;
|
|
|
- 2905 t := SymTab.RealType()
|
|
|
- 2906 ELSIF (dt #
|
|
|
- 2907 SymTab.InvalidType)
|
|
|
- 2908 AND (SymTab.ClassOf(dt) =
|
|
|
- 2909 SymTab.ClLong) THEN
|
|
|
- 2910 IF isMax THEN
|
|
|
- 2911 QbeGen.CopyOp(
|
|
|
- 2912 "9223372036854775807", q)
|
|
|
- 2913 ELSE QbeGen.CopyOp(
|
|
|
- 2914 "-9223372036854775808", q)
|
|
|
- 2915 END;
|
|
|
- 2916 t := SymTab.LongType()
|
|
|
- 2917 ELSIF SymTab.TypeBounds(dt, lo,
|
|
|
- 2918 hi) THEN
|
|
|
- 2919 IF isMax THEN
|
|
|
- 2920 QbeGen.IntStr(hi, q)
|
|
|
- 2921 ELSE QbeGen.IntStr(lo, q)
|
|
|
- 2922 END;
|
|
|
- 2923 t := SymTab.IntType()
|
|
|
- 2924 ELSE SemError(230);
|
|
|
- 2925 t := SymTab.InvalidType;
|
|
|
- 2926 QbeGen.CopyOp("0", q)
|
|
|
- 2927 END; .)
|
|
|
- 2928 | "ADR" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2929 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2930 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ADR"));
|
|
|
- 2931 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2932 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2933 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 2934 t := SymTab.InvalidType;
|
|
|
- 2935 QbeGen.CopyOp("0", q)
|
|
|
- 2936 ELSE
|
|
|
- 2937 IF sfx
|
|
|
- 2938 OR (dk = SymTab.KindVar)
|
|
|
- 2939 OR (dk = SymTab.KindParam) THEN
|
|
|
- 2940 QbeGen.CopyOp("@", q)
|
|
|
- 2941 ELSE SemError(230);
|
|
|
- 2942 QbeGen.CopyOp("0", q)
|
|
|
- 2943 END;
|
|
|
- 2944 t := SymTab.AddrType()
|
|
|
- 2945 END; .)
|
|
|
- 2946 | "CHR" "(" Expr<et, q> ")"
|
|
|
- 2947 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2948 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR"));
|
|
|
- 2949 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2950 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2951 (. IF (et # SymTab.InvalidType)
|
|
|
- 2952 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2953 SemError(211) END;
|
|
|
- 2954 t := SymTab.CharType(); .)
|
|
|
- 2955 | ( "ORD" | "ORDL" ) "(" Expr<et, q> ")"
|
|
|
- 2956 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2957 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ORD"));
|
|
|
- 2958 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2959 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2960 (. IF et # SymTab.InvalidType THEN
|
|
|
- 2961 IF (SymTab.ClassOf(et) #
|
|
|
- 2962 SymTab.ClChar)
|
|
|
- 2963 AND (SymTab.ClassOf(et) #
|
|
|
- 2964 SymTab.ClBool)
|
|
|
- 2965 AND (SymTab.ClassOf(et) #
|
|
|
- 2966 SymTab.ClEnum)
|
|
|
- 2967 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2968 SemError(211) END
|
|
|
- 2969 END;
|
|
|
- 2970 t := SymTab.IntType(); .)
|
|
|
- 2971 | "CAP" "(" Expr<et, q> ")"
|
|
|
- 2972 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2973 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CAP"));
|
|
|
- 2974 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2975 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2976 (. QbeGen.CopyOp("@", q);
|
|
|
- 2977 t := SymTab.CharType(); .)
|
|
|
- 2978 | "UCHR" "(" Expr<et, q> ")"
|
|
|
- 2979 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2980 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UCHR"));
|
|
|
- 2981 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2982 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2983 (. (* UCHR: the UCHAR constructor.
|
|
|
- 2984 CHAR -> UCHAR (identity);
|
|
|
- 2985 INTEGER familly -> UCHAR
|
|
|
- 2986 (codepoint value). *)
|
|
|
- 2987 IF (et # SymTab.InvalidType)
|
|
|
- 2988 AND (SymTab.ClassOf(et) # SymTab.ClChar)
|
|
|
- 2989 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2990 SemError(211) END;
|
|
|
- 2991 t := SymTab.UCharType(); .)
|
|
|
- 2992 | "CHR8" "(" Expr<et, q> ")"
|
|
|
- 2993 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2994 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR8"));
|
|
|
- 2995 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2996 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2997 (. IF (et # SymTab.InvalidType)
|
|
|
- 2998 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 2999 SemError(211) END;
|
|
|
- 3000 t := SymTab.CharType(); .)
|
|
|
- 3001 | "UORD" "(" Expr<et, q> ")"
|
|
|
- 3002 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3003 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UORD"));
|
|
|
- 3004 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3005 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3006 (. (* UORD(u): the codepoint as a
|
|
|
- 3007 32-bit ordinal (INTEGER),
|
|
|
- 3008 cf. ORD for CHAR. *)
|
|
|
- 3009 IF (et # SymTab.InvalidType)
|
|
|
- 3010 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 3011 SemError(211) END;
|
|
|
- 3012 t := SymTab.IntType(); .)
|
|
|
- 3013 | "ABS" "(" Expr<et, q> ")"
|
|
|
- 3014 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3015 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ABS"));
|
|
|
- 3016 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3017 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3018 (. IF (et # SymTab.InvalidType)
|
|
|
- 3019 AND NOT SymTab.IsIntFamily(et)
|
|
|
- 3020 AND (SymTab.ClassOf(et) #
|
|
|
- 3021 SymTab.ClReal) THEN
|
|
|
- 3022 SemError(211)
|
|
|
- 3023 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 3024 END;
|
|
|
- 3025 t := et; .)
|
|
|
- 3026 | "VAL" "(" GetIdent<vn> (. astArg2 := AST.MakeLeaf(AST.NkIdent, vn); .) "," Expr<et, q> ")"
|
|
|
- 3027 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3028 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "VAL"));
|
|
|
- 3029 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 3030 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 3031 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3032 (. IF NOT SymTab.Lookup(vn) THEN
|
|
|
- 3033 SemError(201);
|
|
|
- 3034 t := SymTab.InvalidType
|
|
|
- 3035 ELSE vt := SymTab.SymType(vn);
|
|
|
- 3036 IF vt = SymTab.InvalidType THEN
|
|
|
- 3037 t := SymTab.InvalidType
|
|
|
- 3038 ELSIF et =
|
|
|
- 3039 SymTab.InvalidType THEN
|
|
|
- 3040 t := vt
|
|
|
- 3041 ELSE
|
|
|
- 3042 c1 := SymTab.ClassOf(et);
|
|
|
- 3043 c2 := SymTab.ClassOf(vt);
|
|
|
- 3044 IF (c1 = SymTab.ClInt)
|
|
|
- 3045 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3046 QbeGen.WidenLong(q, qa);
|
|
|
- 3047 QbeGen.CopyOp(qa, q);
|
|
|
- 3048 t := vt
|
|
|
- 3049 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3050 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3051 QbeGen.NarrowLong(q, qa);
|
|
|
- 3052 QbeGen.CopyOp(qa, q);
|
|
|
- 3053 t := vt
|
|
|
- 3054 ELSIF (c1 = SymTab.ClInt)
|
|
|
- 3055 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3056 QbeGen.ConvIR(q, qa);
|
|
|
- 3057 QbeGen.CopyOp(qa, q);
|
|
|
- 3058 t := vt
|
|
|
- 3059 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3060 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3061 QbeGen.ConvLR(q, qa);
|
|
|
- 3062 QbeGen.CopyOp(qa, q);
|
|
|
- 3063 t := vt
|
|
|
- 3064 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3065 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3066 QbeGen.ConvRI(q, qa);
|
|
|
- 3067 QbeGen.CopyOp(qa, q);
|
|
|
- 3068 t := vt
|
|
|
- 3069 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3070 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3071 QbeGen.ConvRL(q, qa);
|
|
|
- 3072 QbeGen.CopyOp(qa, q);
|
|
|
- 3073 t := vt
|
|
|
- 3074 ELSIF ((c1 = SymTab.ClInt)
|
|
|
- 3075 OR (c1 =
|
|
|
- 3076 SymTab.ClChar)
|
|
|
- 3077 OR (c1 =
|
|
|
- 3078 SymTab.ClBool)
|
|
|
- 3079 OR (c1 =
|
|
|
- 3080 SymTab.ClEnum))
|
|
|
- 3081 AND ((c2 = SymTab.ClInt)
|
|
|
- 3082 OR (c2 =
|
|
|
- 3083 SymTab.ClChar)
|
|
|
- 3084 OR (c2 =
|
|
|
- 3085 SymTab.ClBool)
|
|
|
- 3086 OR (c2 =
|
|
|
- 3087 SymTab.ClEnum)) THEN
|
|
|
- 3088 t := vt
|
|
|
- 3089 ELSIF (c1 = SymTab.ClPtr)
|
|
|
- 3090 AND (c2 = SymTab.ClPtr) THEN
|
|
|
- 3091 t := vt
|
|
|
- 3092 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3093 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3094 t := vt
|
|
|
- 3095 ELSE SemError(230);
|
|
|
- 3096 t := SymTab.InvalidType
|
|
|
- 3097 END
|
|
|
- 3098 END
|
|
|
- 3099 END; .)
|
|
|
- 3100 | "(" Expr<et, q> ")" (. t := et; astIsLit := TRUE; .)
|
|
|
- 3101 | SetLit<st, sq> (. astIsLit := TRUE; t := st;
|
|
|
- 3102 QbeGen.CopyOp(sq, q); .)
|
|
|
- 3103 | ( "NOT" | "~" ) Fact<t2, q2> (. astNot := astCur;
|
|
|
- 3104 IF SymTab.BoolCheck(t2) THEN
|
|
|
- 3105 t := SymTab.BoolType()
|
|
|
- 3106 ELSE SemError(212);
|
|
|
- 3107 t := SymTab.InvalidType END;
|
|
|
- 3108 IF t # SymTab.InvalidType THEN
|
|
|
- 3109 QbeGen.CopyOp("@", q)
|
|
|
- 3110 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 3111 END;
|
|
|
- 3112 astIsLit := TRUE;
|
|
|
- 3113 astCur := AST.MakeUn(
|
|
|
- 3114 AST.NkUnary, AST.OpNot, astNot); .)
|
|
|
- 3115 )
|
|
|
- 3116 (. IF NOT astIsLit THEN astCur := AST.NoNode END; .) .
|
|
|
- 3117 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
- 3118 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
- 3119 for computed elements. Ranges always lower via SetRange. *)
|
|
|
- 3120 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3121 (. VAR astNode: AST.Node; .)
|
|
|
- 3122 = "{" (. t := SymTab.NewSet(
|
|
|
- 3123 SymTab.NewSubR(0, 255));
|
|
|
- 3124 astNode := AST.MakeNode(AST.NkSetLit);
|
|
|
- 3125 QbeGen.NewSetTemp(8, q);
|
|
|
- 3126 QbeGen.SetZero(q, 8); .)
|
|
|
- 3127 [ SetElem<t, q, astNode> { "," SetElem<t, q, astNode> } ]
|
|
|
- 3128 "}" (. astCur := astNode; .) .
|
|
|
- 3129 (* Typed brace constructor: TypeName{ elems } — BITSET{0} (a set)
|
|
|
- 3130 or ArrayName{...} (an array constructor, GNU Modula-2). The
|
|
|
- 3131 declared type sets the width (set) or element type (array). *)
|
|
|
- 3132 TypedBraceLit<vt: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3133 (. VAR nw: CARDINAL;
|
|
|
- 3134 astNode, astTail: AST.Node;
|
|
|
- 3135 savedCls: INTEGER; .)
|
|
|
- 3136 = "{" (. savedCls := braceCls;
|
|
|
- 3137 astNode := AST.MakeNode(AST.NkBraceLit);
|
|
|
- 3138 AST.SetTy(astNode, vt);
|
|
|
- 3139 astTail := astNode;
|
|
|
- 3140 IF vt = SymTab.InvalidType THEN
|
|
|
- 3141 braceCls := -1
|
|
|
- 3142 ELSE braceCls :=
|
|
|
- 3143 SymTab.ClassOf(vt)
|
|
|
- 3144 END;
|
|
|
- 3145 IF braceCls = SymTab.ClSet THEN
|
|
|
- 3146 IF vt = SymTab.InvalidType THEN
|
|
|
- 3147 nw := 8
|
|
|
- 3148 ELSE nw := SymTab.SetWords(vt);
|
|
|
- 3149 IF nw = 0 THEN nw := 8 END
|
|
|
- 3150 END;
|
|
|
- 3151 QbeGen.NewSetTemp(nw, q);
|
|
|
- 3152 QbeGen.SetZero(q, nw)
|
|
|
- 3153 ELSIF (braceCls =
|
|
|
- 3154 SymTab.ClArray)
|
|
|
- 3155 OR (braceCls =
|
|
|
- 3156 SymTab.ClRecord)
|
|
|
- 3157 OR (braceCls =
|
|
|
- 3158 SymTab.ClClass) THEN
|
|
|
- 3159 QbeGen.CtorBegin(vt)
|
|
|
- 3160 ELSE
|
|
|
- 3161 IF vt # SymTab.InvalidType THEN
|
|
|
- 3162 SemError(230) END;
|
|
|
- 3163 braceCls := -1
|
|
|
- 3164 END; .)
|
|
|
- 3165 [ BraceElem<vt, q, astNode, astTail>
|
|
|
- 3166 { "," BraceElem<vt, q, astNode, astTail> } ]
|
|
|
- 3167 "}" (. IF (braceCls = SymTab.ClArray)
|
|
|
- 3168 OR (braceCls =
|
|
|
- 3169 SymTab.ClRecord)
|
|
|
- 3170 OR (braceCls =
|
|
|
- 3171 SymTab.ClClass) THEN
|
|
|
- 3172 QbeGen.CtorEnd(q)
|
|
|
- 3173 ELSIF braceCls # SymTab.ClSet THEN
|
|
|
- 3174 QbeGen.CopyOp("0", q)
|
|
|
- 3175 END;
|
|
|
- 3176 braceCls := savedCls; .)
|
|
|
- 3177 (. astCur := astNode; .) .
|
|
|
- 3178 BraceElem<vt: SymTab.TypeIndex; VAR sq: QbeGen.QVal;
|
|
|
- 3179 VAR node, tail: AST.Node>
|
|
|
- 3180 (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3181 qe, q2: QbeGen.QVal;
|
|
|
- 3182 v, v2, reps, k: INTEGER;
|
|
|
- 3183 elem: SymTab.TypeIndex;
|
|
|
- 3184 lo: INTEGER;
|
|
|
- 3185 span: CARDINAL;
|
|
|
- 3186 cl, cl2: INTEGER;
|
|
|
- 3187 hasR, hasB: BOOLEAN;
|
|
|
- 3188 astEl: AST.Node; .)
|
|
|
- 3189 = (. hasR := FALSE; hasB := FALSE;
|
|
|
- 3190 reps := 1; .)
|
|
|
- 3191 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3192 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3193 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3194 hasR := TRUE; .) ]
|
|
|
- 3195 [ "BY" Expr<et2, q2> (. hasB := TRUE; .) ]
|
|
|
- 3196 (. IF braceCls = SymTab.ClSet THEN
|
|
|
- 3197 IF hasB THEN SemError(230) END;
|
|
|
- 3198 lo := SymTab.SetBaseLo(vt);
|
|
|
- 3199 span := SymTab.SetCount(vt);
|
|
|
- 3200 IF (et = SymTab.InvalidType)
|
|
|
- 3201 OR (hasR AND (et2 =
|
|
|
- 3202 SymTab.InvalidType)) THEN
|
|
|
- 3203 ELSE cl :=
|
|
|
- 3204 SymTab.ClassOf(et);
|
|
|
- 3205 IF hasR THEN
|
|
|
- 3206 cl2 :=
|
|
|
- 3207 SymTab.ClassOf(et2)
|
|
|
- 3208 ELSE cl2 := SymTab.ClInt
|
|
|
- 3209 END;
|
|
|
- 3210 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3211 OR (hasR AND NOT
|
|
|
- 3212 SymTab.SetElemClassOk(cl2))
|
|
|
- 3213 THEN
|
|
|
- 3214 SemError(222)
|
|
|
- 3215 ELSIF hasR
|
|
|
- 3216 AND SymTab.ConstInt(qe, v)
|
|
|
- 3217 AND SymTab.ConstInt(q2,
|
|
|
- 3218 v2)
|
|
|
- 3219 AND ((v < lo)
|
|
|
- 3220 OR (v2 < lo)
|
|
|
- 3221 OR (v >= lo +
|
|
|
- 3222 VAL(INTEGER, span))
|
|
|
- 3223 OR (v2 >= lo +
|
|
|
- 3224 VAL(INTEGER, span))
|
|
|
- 3225 OR (v > v2)) THEN
|
|
|
- 3226 SemError(222)
|
|
|
- 3227 ELSIF hasR THEN
|
|
|
- 3228 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3229 lo, span)
|
|
|
- 3230 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3231 v)
|
|
|
- 3232 AND ((v < lo)
|
|
|
- 3233 OR (v >= lo +
|
|
|
- 3234 VAL(INTEGER,
|
|
|
- 3235 span))) THEN
|
|
|
- 3236 SemError(222)
|
|
|
- 3237 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3238 lo, span)
|
|
|
- 3239 END
|
|
|
- 3240 END
|
|
|
- 3241 ELSIF (braceCls = SymTab.ClArray)
|
|
|
- 3242 OR (braceCls =
|
|
|
- 3243 SymTab.ClRecord)
|
|
|
- 3244 OR (braceCls =
|
|
|
- 3245 SymTab.ClClass) THEN
|
|
|
- 3246 IF hasR THEN SemError(230) END;
|
|
|
- 3247 reps := 1;
|
|
|
- 3248 IF hasB THEN
|
|
|
- 3249 IF SymTab.ConstInt(q2, v2)
|
|
|
- 3250 AND (v2 >= 1) THEN
|
|
|
- 3251 reps := v2
|
|
|
- 3252 ELSE SemError(230)
|
|
|
- 3253 END
|
|
|
- 3254 END;
|
|
|
- 3255 k := 0;
|
|
|
- 3256 WHILE k < reps DO
|
|
|
- 3257 QbeGen.CtorElem(qe);
|
|
|
- 3258 INC(k)
|
|
|
- 3259 END
|
|
|
- 3260 END; .)
|
|
|
- 3261 (. (* the BY form repeats the
|
|
|
- 3262 element; keep the AST in
|
|
|
- 3263 step with CtorElem *)
|
|
|
- 3264 k := 0;
|
|
|
- 3265 WHILE k < reps DO
|
|
|
- 3266 AstAppend(AST.NkBlock,
|
|
|
- 3267 node, tail, astEl);
|
|
|
- 3268 INC(k)
|
|
|
- 3269 END; .) .
|
|
|
- 3270 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal; node: AST.Node> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3271 qe, q2: QbeGen.QVal;
|
|
|
- 3272 v, v2: INTEGER;
|
|
|
- 3273 lo: INTEGER;
|
|
|
- 3274 span: CARDINAL;
|
|
|
- 3275 cl, cl2: INTEGER;
|
|
|
- 3276 hasR: BOOLEAN;
|
|
|
- 3277 astEl: AST.Node; .)
|
|
|
- 3278 = (. hasR := FALSE; .)
|
|
|
- 3279 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3280 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3281 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3282 hasR := TRUE; .) ]
|
|
|
- 3283 (. lo := SymTab.SetBaseLo(st);
|
|
|
- 3284 span := SymTab.SetCount(st);
|
|
|
- 3285 IF (et = SymTab.InvalidType)
|
|
|
- 3286 OR (hasR AND (et2 =
|
|
|
- 3287 SymTab.InvalidType)) THEN
|
|
|
- 3288 ELSE cl :=
|
|
|
- 3289 SymTab.ClassOf(et);
|
|
|
- 3290 IF hasR THEN
|
|
|
- 3291 cl2 :=
|
|
|
- 3292 SymTab.ClassOf(et2)
|
|
|
- 3293 ELSE cl2 := SymTab.ClInt
|
|
|
- 3294 END;
|
|
|
- 3295 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3296 OR (hasR AND NOT
|
|
|
- 3297 SymTab.SetElemClassOk(cl2))
|
|
|
- 3298 THEN
|
|
|
- 3299 SemError(222)
|
|
|
- 3300 ELSIF hasR
|
|
|
- 3301 AND SymTab.ConstInt(qe, v)
|
|
|
- 3302 AND SymTab.ConstInt(q2,
|
|
|
- 3303 v2)
|
|
|
- 3304 AND ((v < lo)
|
|
|
- 3305 OR (v2 < lo)
|
|
|
- 3306 OR (v >= lo +
|
|
|
- 3307 VAL(INTEGER, span))
|
|
|
- 3308 OR (v2 >= lo +
|
|
|
- 3309 VAL(INTEGER, span))
|
|
|
- 3310 OR (v > v2)) THEN
|
|
|
- 3311 SemError(222)
|
|
|
- 3312 ELSIF hasR THEN
|
|
|
- 3313 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3314 lo, span)
|
|
|
- 3315 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3316 v)
|
|
|
- 3317 AND ((v < lo)
|
|
|
- 3318 OR (v >= lo +
|
|
|
- 3319 VAL(INTEGER,
|
|
|
- 3320 span))) THEN
|
|
|
- 3321 SemError(222)
|
|
|
- 3322 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3323 lo, span)
|
|
|
- 3324 END
|
|
|
- 3325 END; .)
|
|
|
- 3326 (. AST.SetChild(node,
|
|
|
- 3327 AST.NChild(node), astEl); .) .
|
|
|
- 3328 GetIdent<VAR n: SymTab.Name>
|
|
|
- 3329 = ident (. LexName(n); .) .
|
|
|
- 3330
|
|
|
- 3331 END M2.
|
|
|
+ 2751 [ TypedBraceLit<dt, q> (. t := dt; astCall := TRUE;
|
|
|
+ 2752 astBrace := astCur; .) ]
|
|
|
+ 2753 [ ArgList<qn, dt, qd, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
+ 2754 (. astCall := TRUE;
|
|
|
+ 2755 astNode := AstCallNode(astD);
|
|
|
+ 2756 astRes := astNode;
|
|
|
+ 2757 t := ct2;
|
|
|
+ 2758 QbeGen.CopyOp(q2, q);
|
|
|
+ 2759 sfx := FALSE; .)
|
|
|
+ 2760 { ResultComp<t, q, sfx, astRes, mname, methCls, isM>
|
|
|
+ 2761 [ (. astNArgs := 0; .)
|
|
|
+ 2762 ArgList<mname, t, q, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
+ 2763 (. astNode := AstCallNode(astRes);
|
|
|
+ 2764 astRes := astNode;
|
|
|
+ 2765 t := ct2;
|
|
|
+ 2766 QbeGen.CopyOp(q2, q);
|
|
|
+ 2767 sfx := FALSE; .) ] }
|
|
|
+ 2768 (. IF sfx THEN
|
|
|
+ 2769 IF t = SymTab.InvalidType THEN
|
|
|
+ 2770 QbeGen.CopyOp("0", q)
|
|
|
+ 2771 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2772 SymTab.ClRecord)
|
|
|
+ 2773 AND (SymTab.ClassOf(t) # SymTab.ClSet)
|
|
|
+ 2774 AND (SymTab.ClassOf(t) # SymTab.ClArray)
|
|
|
+ 2775 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
+ 2776 QbeGen.CopyOp("@", q)
|
|
|
+ 2777 END
|
|
|
+ 2778 END; .) ]
|
|
|
+ 2779 (. IF called THEN
|
|
|
+ 2780 astCur := astRes
|
|
|
+ 2781 ELSIF astCall THEN
|
|
|
+ 2782 astCur := astBrace
|
|
|
+ 2783 ELSE astCur := astD
|
|
|
+ 2784 END;
|
|
|
+ 2785 astIsLit := TRUE;
|
|
|
+ 2786 IF NOT called
|
|
|
+ 2787 AND (dk = SymTab.KindProc) THEN
|
|
|
+ 2788 (* bare zero-arg function
|
|
|
+ 2789 call (parentheses may be
|
|
|
+ 2790 omitted); a proper or
|
|
|
+ 2791 parameterised proc here
|
|
|
+ 2792 is 230 *)
|
|
|
+ 2793 IF (SymTab.ProcNPar(qn) = 0)
|
|
|
+ 2794 AND (SymTab.ProcRes(qn) # SymTab.InvalidType) THEN
|
|
|
+ 2795 t := SymTab.ProcRes(qn);
|
|
|
+ 2796 QbeGen.CopyOp("@", q);
|
|
|
+ 2797 astCur := AST.MakeNode(AST.NkCall);
|
|
|
+ 2798 AST.SetChild(astCur, 0, astD)
|
|
|
+ 2799 ELSE
|
|
|
+ 2800 t := SymTab.ProcTypeOf(qn);
|
|
|
+ 2801 QbeGen.CopyOp("@", q)
|
|
|
+ 2802 END
|
|
|
+ 2803 END; .)
|
|
|
+ 2804 | ( "HIGH" (. isHigh := TRUE; .)
|
|
|
+ 2805 | ( "LEN" | "LENGTH" ) (. isHigh := FALSE; .) )
|
|
|
+ 2806 "(" ( Design<dt, dk, qd, qn, sfx> (. isStr := FALSE;
|
|
|
+ 2807 isU := FALSE; .)
|
|
|
+ 2808 | string (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
+ 2809 isStr := TRUE;
|
|
|
+ 2810 isU := FALSE;
|
|
|
+ 2811 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2812 dt := SymTab.CharType();
|
|
|
+ 2813 QbeGen.IntStr(QbeGen.CharVal(s),
|
|
|
+ 2814 qd)
|
|
|
+ 2815 ELSE
|
|
|
+ 2816 dt := SymTab.NewStr();
|
|
|
+ 2817 QbeGen.DeclStr(s, qd);
|
|
|
+ 2818 END;
|
|
|
+ 2819 dk := -1;
|
|
|
+ 2820 qn[0] := CHR(0); .)
|
|
|
+ 2821 | ustring (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
+ 2822 QbeGen.DeclUStr(s, qd, isU, ucp,
|
|
|
+ 2823 uok);
|
|
|
+ 2824 isStr := FALSE;
|
|
|
+ 2825 IF NOT uok THEN
|
|
|
+ 2826 SemError(234);
|
|
|
+ 2827 dt := SymTab.InvalidType
|
|
|
+ 2828 ELSIF isU THEN
|
|
|
+ 2829 (* one codepoint: a UCHAR;
|
|
|
+ 2830 LEN is 1, HIGH is 0 *)
|
|
|
+ 2831 dt := SymTab.UCharType();
|
|
|
+ 2832 QbeGen.IntStr(ucp, qd)
|
|
|
+ 2833 ELSE
|
|
|
+ 2834 dt := SymTab.NewUStr();
|
|
|
+ 2835 END;
|
|
|
+ 2836 dk := -1;
|
|
|
+ 2837 qn[0] := CHR(0); .) )
|
|
|
+ 2838 ")"
|
|
|
+ 2839 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2840 IF isHigh THEN AST.SetChild(astNode, 0,
|
|
|
+ 2841 AST.MakeLeaf(AST.NkIdent, "HIGH"))
|
|
|
+ 2842 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2843 AST.MakeLeaf(AST.NkIdent, "LEN")) END;
|
|
|
+ 2844 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2845 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2846 IF (dt # SymTab.InvalidType)
|
|
|
+ 2847 AND (SymTab.ClassOf(dt) = SymTab.ClUStr) THEN
|
|
|
+ 2848 (* UString: the count is
|
|
|
+ 2849 the descriptor header *)
|
|
|
+ 2850 t := SymTab.IntType();
|
|
|
+ 2851 QbeGen.CopyOp("@", q)
|
|
|
+ 2852 ELSIF (dt # SymTab.InvalidType)
|
|
|
+ 2853 AND (SymTab.ClassOf(dt) = SymTab.ClUChar) THEN
|
|
|
+ 2854 (* single UCHAR codepoint *)
|
|
|
+ 2855 IF isHigh THEN
|
|
|
+ 2856 QbeGen.CopyOp("0", qr)
|
|
|
+ 2857 ELSE
|
|
|
+ 2858 QbeGen.CopyOp("1", qr)
|
|
|
+ 2859 END;
|
|
|
+ 2860 t := SymTab.IntType();
|
|
|
+ 2861 QbeGen.CopyOp(qr, q)
|
|
|
+ 2862 ELSIF isStr THEN
|
|
|
+ 2863 (* fold: content length at
|
|
|
+ 2864 compile time *)
|
|
|
+ 2865 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2866 c1 := 1
|
|
|
+ 2867 ELSE
|
|
|
+ 2868 c1 :=
|
|
|
+ 2869 SymTab.StrLen(s) - 2
|
|
|
+ 2870 END;
|
|
|
+ 2871 IF isHigh THEN
|
|
|
+ 2872 DEC(c1)
|
|
|
+ 2873 END;
|
|
|
+ 2874 QbeGen.IntStr(c1, qr);
|
|
|
+ 2875 t := SymTab.IntType();
|
|
|
+ 2876 QbeGen.CopyOp(qr, q)
|
|
|
+ 2877 ELSIF dt = SymTab.InvalidType THEN
|
|
|
+ 2878 t := SymTab.InvalidType;
|
|
|
+ 2879 QbeGen.CopyOp("0", q)
|
|
|
+ 2880 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 2881 SymTab.ClArray THEN
|
|
|
+ 2882 SemError(217);
|
|
|
+ 2883 t := SymTab.InvalidType;
|
|
|
+ 2884 QbeGen.CopyOp("0", q)
|
|
|
+ 2885 ELSE
|
|
|
+ 2886 IF SymTab.IsOpenArray(dt) THEN
|
|
|
+ 2887 t := SymTab.IntType();
|
|
|
+ 2888 QbeGen.CopyOp("@", q)
|
|
|
+ 2889 ELSE
|
|
|
+ 2890 IF isHigh THEN
|
|
|
+ 2891 QbeGen.IntStr(
|
|
|
+ 2892 SymTab.ArrayHi(dt), qr)
|
|
|
+ 2893 ELSE
|
|
|
+ 2894 QbeGen.IntStr(VAL(
|
|
|
+ 2895 INTEGER,
|
|
|
+ 2896 SymTab.ArrayLen(dt)),
|
|
|
+ 2897 qr)
|
|
|
+ 2898 END;
|
|
|
+ 2899 t := SymTab.IntType();
|
|
|
+ 2900 QbeGen.CopyOp(qr, q)
|
|
|
+ 2901 END
|
|
|
+ 2902 END; .)
|
|
|
+ 2903 | ( "SIZE" | "TSIZE" ) "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2904 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2905 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "SIZE"));
|
|
|
+ 2906 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2907 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2908 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 2909 t := SymTab.InvalidType;
|
|
|
+ 2910 QbeGen.CopyOp("0", q)
|
|
|
+ 2911 ELSE
|
|
|
+ 2912 QbeGen.IntStr(VAL(INTEGER,
|
|
|
+ 2913 SymTab.ObjectSize(dt)), q);
|
|
|
+ 2914 t := SymTab.IntType()
|
|
|
+ 2915 END; .)
|
|
|
+ 2916 | ( "SHIFT" (. isMax := FALSE; .)
|
|
|
+ 2917 | "ROTATE" (. isMax := TRUE; .) )
|
|
|
+ 2918 "(" Expr<et, q> (. astArg2 := astCur; .) "," Expr<et2, q2> ")"
|
|
|
+ 2919 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2920 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
+ 2921 AST.MakeLeaf(AST.NkIdent, "ROTATE"))
|
|
|
+ 2922 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2923 AST.MakeLeaf(AST.NkIdent, "SHIFT")) END;
|
|
|
+ 2924 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
+ 2925 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
+ 2926 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2927 (* set shift/rotate: isMax
|
|
|
+ 2928 doubles as "rotate" *)
|
|
|
+ 2929 IF (et # SymTab.InvalidType)
|
|
|
+ 2930 AND (SymTab.ClassOf(et) =
|
|
|
+ 2931 SymTab.ClSet) THEN
|
|
|
+ 2932 t := et;
|
|
|
+ 2933 QbeGen.CopyOp("@", q)
|
|
|
+ 2934 ELSE SemError(230);
|
|
|
+ 2935 t := SymTab.InvalidType;
|
|
|
+ 2936 QbeGen.CopyOp("0", q)
|
|
|
+ 2937 END; .)
|
|
|
+ 2938 | ( "MIN" (. isMax := FALSE; .)
|
|
|
+ 2939 | "MAX" (. isMax := TRUE; .) )
|
|
|
+ 2940 "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2941 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2942 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
+ 2943 AST.MakeLeaf(AST.NkIdent, "MAX"))
|
|
|
+ 2944 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2945 AST.MakeLeaf(AST.NkIdent, "MIN")) END;
|
|
|
+ 2946 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2947 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2948 IF (dt # SymTab.InvalidType)
|
|
|
+ 2949 AND (SymTab.ClassOf(dt) = SymTab.ClReal) THEN
|
|
|
+ 2950 (* REAL/LONGREAL: the
|
|
|
+ 2951 implementation bounds *)
|
|
|
+ 2952 IF isMax THEN
|
|
|
+ 2953 QbeGen.NormReal(
|
|
|
+ 2954 "3.402823e38", q)
|
|
|
+ 2955 ELSE QbeGen.NormReal(
|
|
|
+ 2956 "-3.402823e38", q)
|
|
|
+ 2957 END;
|
|
|
+ 2958 t := SymTab.RealType()
|
|
|
+ 2959 ELSIF (dt #
|
|
|
+ 2960 SymTab.InvalidType)
|
|
|
+ 2961 AND (SymTab.ClassOf(dt) =
|
|
|
+ 2962 SymTab.ClLong) THEN
|
|
|
+ 2963 IF isMax THEN
|
|
|
+ 2964 QbeGen.CopyOp(
|
|
|
+ 2965 "9223372036854775807", q)
|
|
|
+ 2966 ELSE QbeGen.CopyOp(
|
|
|
+ 2967 "-9223372036854775808", q)
|
|
|
+ 2968 END;
|
|
|
+ 2969 t := SymTab.LongType()
|
|
|
+ 2970 ELSIF SymTab.TypeBounds(dt, lo,
|
|
|
+ 2971 hi) THEN
|
|
|
+ 2972 IF isMax THEN
|
|
|
+ 2973 QbeGen.IntStr(hi, q)
|
|
|
+ 2974 ELSE QbeGen.IntStr(lo, q)
|
|
|
+ 2975 END;
|
|
|
+ 2976 t := SymTab.IntType()
|
|
|
+ 2977 ELSE SemError(230);
|
|
|
+ 2978 t := SymTab.InvalidType;
|
|
|
+ 2979 QbeGen.CopyOp("0", q)
|
|
|
+ 2980 END; .)
|
|
|
+ 2981 | "ADR" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2982 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2983 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ADR"));
|
|
|
+ 2984 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2985 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2986 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 2987 t := SymTab.InvalidType;
|
|
|
+ 2988 QbeGen.CopyOp("0", q)
|
|
|
+ 2989 ELSE
|
|
|
+ 2990 IF sfx
|
|
|
+ 2991 OR (dk = SymTab.KindVar)
|
|
|
+ 2992 OR (dk = SymTab.KindParam) THEN
|
|
|
+ 2993 QbeGen.CopyOp("@", q)
|
|
|
+ 2994 ELSE SemError(230);
|
|
|
+ 2995 QbeGen.CopyOp("0", q)
|
|
|
+ 2996 END;
|
|
|
+ 2997 t := SymTab.AddrType()
|
|
|
+ 2998 END; .)
|
|
|
+ 2999 | "CHR" "(" Expr<et, q> ")"
|
|
|
+ 3000 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3001 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR"));
|
|
|
+ 3002 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3003 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3004 (. IF (et # SymTab.InvalidType)
|
|
|
+ 3005 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 3006 SemError(211) END;
|
|
|
+ 3007 t := SymTab.CharType(); .)
|
|
|
+ 3008 | ( "ORD" | "ORDL" ) "(" Expr<et, q> ")"
|
|
|
+ 3009 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3010 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ORD"));
|
|
|
+ 3011 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3012 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3013 (. IF et # SymTab.InvalidType THEN
|
|
|
+ 3014 IF (SymTab.ClassOf(et) #
|
|
|
+ 3015 SymTab.ClChar)
|
|
|
+ 3016 AND (SymTab.ClassOf(et) #
|
|
|
+ 3017 SymTab.ClBool)
|
|
|
+ 3018 AND (SymTab.ClassOf(et) #
|
|
|
+ 3019 SymTab.ClEnum)
|
|
|
+ 3020 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 3021 SemError(211) END
|
|
|
+ 3022 END;
|
|
|
+ 3023 t := SymTab.IntType(); .)
|
|
|
+ 3024 | "CAP" "(" Expr<et, q> ")"
|
|
|
+ 3025 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3026 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CAP"));
|
|
|
+ 3027 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3028 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3029 (. QbeGen.CopyOp("@", q);
|
|
|
+ 3030 t := SymTab.CharType(); .)
|
|
|
+ 3031 | "UCHR" "(" Expr<et, q> ")"
|
|
|
+ 3032 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3033 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UCHR"));
|
|
|
+ 3034 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3035 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3036 (. (* UCHR: the UCHAR constructor.
|
|
|
+ 3037 CHAR -> UCHAR (identity);
|
|
|
+ 3038 INTEGER familly -> UCHAR
|
|
|
+ 3039 (codepoint value). *)
|
|
|
+ 3040 IF (et # SymTab.InvalidType)
|
|
|
+ 3041 AND (SymTab.ClassOf(et) # SymTab.ClChar)
|
|
|
+ 3042 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 3043 SemError(211) END;
|
|
|
+ 3044 t := SymTab.UCharType(); .)
|
|
|
+ 3045 | "CHR8" "(" Expr<et, q> ")"
|
|
|
+ 3046 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3047 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR8"));
|
|
|
+ 3048 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3049 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3050 (. IF (et # SymTab.InvalidType)
|
|
|
+ 3051 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
+ 3052 SemError(211) END;
|
|
|
+ 3053 t := SymTab.CharType(); .)
|
|
|
+ 3054 | "UORD" "(" Expr<et, q> ")"
|
|
|
+ 3055 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3056 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UORD"));
|
|
|
+ 3057 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3058 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3059 (. (* UORD(u): the codepoint as a
|
|
|
+ 3060 32-bit ordinal (INTEGER),
|
|
|
+ 3061 cf. ORD for CHAR. *)
|
|
|
+ 3062 IF (et # SymTab.InvalidType)
|
|
|
+ 3063 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
+ 3064 SemError(211) END;
|
|
|
+ 3065 t := SymTab.IntType(); .)
|
|
|
+ 3066 | "ABS" "(" Expr<et, q> ")"
|
|
|
+ 3067 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3068 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ABS"));
|
|
|
+ 3069 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 3070 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3071 (. IF (et # SymTab.InvalidType)
|
|
|
+ 3072 AND NOT SymTab.IsIntFamily(et)
|
|
|
+ 3073 AND (SymTab.ClassOf(et) #
|
|
|
+ 3074 SymTab.ClReal) THEN
|
|
|
+ 3075 SemError(211)
|
|
|
+ 3076 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 3077 END;
|
|
|
+ 3078 t := et; .)
|
|
|
+ 3079 | "VAL" "(" GetIdent<vn> (. astArg2 := AST.MakeLeaf(AST.NkIdent, vn); .) "," Expr<et, q> ")"
|
|
|
+ 3080 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 3081 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "VAL"));
|
|
|
+ 3082 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
+ 3083 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
+ 3084 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 3085 (. IF NOT SymTab.Lookup(vn) THEN
|
|
|
+ 3086 SemError(201);
|
|
|
+ 3087 t := SymTab.InvalidType
|
|
|
+ 3088 ELSE vt := SymTab.SymType(vn);
|
|
|
+ 3089 IF vt = SymTab.InvalidType THEN
|
|
|
+ 3090 t := SymTab.InvalidType
|
|
|
+ 3091 ELSIF et =
|
|
|
+ 3092 SymTab.InvalidType THEN
|
|
|
+ 3093 t := vt
|
|
|
+ 3094 ELSE
|
|
|
+ 3095 c1 := SymTab.ClassOf(et);
|
|
|
+ 3096 c2 := SymTab.ClassOf(vt);
|
|
|
+ 3097 IF (c1 = SymTab.ClInt)
|
|
|
+ 3098 AND (c2 = SymTab.ClLong) THEN
|
|
|
+ 3099 QbeGen.WidenLong(q, qa);
|
|
|
+ 3100 QbeGen.CopyOp(qa, q);
|
|
|
+ 3101 t := vt
|
|
|
+ 3102 ELSIF (c1 = SymTab.ClLong)
|
|
|
+ 3103 AND (c2 = SymTab.ClInt) THEN
|
|
|
+ 3104 QbeGen.NarrowLong(q, qa);
|
|
|
+ 3105 QbeGen.CopyOp(qa, q);
|
|
|
+ 3106 t := vt
|
|
|
+ 3107 ELSIF (c1 = SymTab.ClInt)
|
|
|
+ 3108 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 3109 QbeGen.ConvIR(q, qa);
|
|
|
+ 3110 QbeGen.CopyOp(qa, q);
|
|
|
+ 3111 t := vt
|
|
|
+ 3112 ELSIF (c1 = SymTab.ClLong)
|
|
|
+ 3113 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 3114 QbeGen.ConvLR(q, qa);
|
|
|
+ 3115 QbeGen.CopyOp(qa, q);
|
|
|
+ 3116 t := vt
|
|
|
+ 3117 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 3118 AND (c2 = SymTab.ClInt) THEN
|
|
|
+ 3119 QbeGen.ConvRI(q, qa);
|
|
|
+ 3120 QbeGen.CopyOp(qa, q);
|
|
|
+ 3121 t := vt
|
|
|
+ 3122 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 3123 AND (c2 = SymTab.ClLong) THEN
|
|
|
+ 3124 QbeGen.ConvRL(q, qa);
|
|
|
+ 3125 QbeGen.CopyOp(qa, q);
|
|
|
+ 3126 t := vt
|
|
|
+ 3127 ELSIF ((c1 = SymTab.ClInt)
|
|
|
+ 3128 OR (c1 =
|
|
|
+ 3129 SymTab.ClChar)
|
|
|
+ 3130 OR (c1 =
|
|
|
+ 3131 SymTab.ClBool)
|
|
|
+ 3132 OR (c1 =
|
|
|
+ 3133 SymTab.ClEnum))
|
|
|
+ 3134 AND ((c2 = SymTab.ClInt)
|
|
|
+ 3135 OR (c2 =
|
|
|
+ 3136 SymTab.ClChar)
|
|
|
+ 3137 OR (c2 =
|
|
|
+ 3138 SymTab.ClBool)
|
|
|
+ 3139 OR (c2 =
|
|
|
+ 3140 SymTab.ClEnum)) THEN
|
|
|
+ 3141 t := vt
|
|
|
+ 3142 ELSIF (c1 = SymTab.ClPtr)
|
|
|
+ 3143 AND (c2 = SymTab.ClPtr) THEN
|
|
|
+ 3144 t := vt
|
|
|
+ 3145 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 3146 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 3147 t := vt
|
|
|
+ 3148 ELSE SemError(230);
|
|
|
+ 3149 t := SymTab.InvalidType
|
|
|
+ 3150 END
|
|
|
+ 3151 END
|
|
|
+ 3152 END; .)
|
|
|
+ 3153 | "(" Expr<et, q> ")" (. t := et; astIsLit := TRUE; .)
|
|
|
+ 3154 | SetLit<st, sq> (. astIsLit := TRUE; t := st;
|
|
|
+ 3155 QbeGen.CopyOp(sq, q); .)
|
|
|
+ 3156 | ( "NOT" | "~" ) Fact<t2, q2> (. astNot := astCur;
|
|
|
+ 3157 IF SymTab.BoolCheck(t2) THEN
|
|
|
+ 3158 t := SymTab.BoolType()
|
|
|
+ 3159 ELSE SemError(212);
|
|
|
+ 3160 t := SymTab.InvalidType END;
|
|
|
+ 3161 IF t # SymTab.InvalidType THEN
|
|
|
+ 3162 QbeGen.CopyOp("@", q)
|
|
|
+ 3163 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 3164 END;
|
|
|
+ 3165 astIsLit := TRUE;
|
|
|
+ 3166 astCur := AST.MakeUn(
|
|
|
+ 3167 AST.NkUnary, AST.OpNot, astNot); .)
|
|
|
+ 3168 )
|
|
|
+ 3169 (. IF NOT astIsLit THEN astCur := AST.NoNode END; .) .
|
|
|
+ 3170 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
+ 3171 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
+ 3172 for computed elements. Ranges always lower via SetRange. *)
|
|
|
+ 3173 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 3174 (. VAR astNode: AST.Node; .)
|
|
|
+ 3175 = "{" (. t := SymTab.NewSet(
|
|
|
+ 3176 SymTab.NewSubR(0, 255));
|
|
|
+ 3177 astNode := AST.MakeNode(AST.NkSetLit);
|
|
|
+ 3178 QbeGen.NewSetTemp(8, q);
|
|
|
+ 3179 QbeGen.SetZero(q, 8); .)
|
|
|
+ 3180 [ SetElem<t, q, astNode> { "," SetElem<t, q, astNode> } ]
|
|
|
+ 3181 "}" (. astCur := astNode; .) .
|
|
|
+ 3182 (* Typed brace constructor: TypeName{ elems } — BITSET{0} (a set)
|
|
|
+ 3183 or ArrayName{...} (an array constructor, GNU Modula-2). The
|
|
|
+ 3184 declared type sets the width (set) or element type (array). *)
|
|
|
+ 3185 TypedBraceLit<vt: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 3186 (. VAR nw: CARDINAL;
|
|
|
+ 3187 astNode, astTail: AST.Node;
|
|
|
+ 3188 savedCls: INTEGER; .)
|
|
|
+ 3189 = "{" (. savedCls := braceCls;
|
|
|
+ 3190 astNode := AST.MakeNode(AST.NkBraceLit);
|
|
|
+ 3191 AST.SetTy(astNode, vt);
|
|
|
+ 3192 astTail := astNode;
|
|
|
+ 3193 IF vt = SymTab.InvalidType THEN
|
|
|
+ 3194 braceCls := -1
|
|
|
+ 3195 ELSE braceCls :=
|
|
|
+ 3196 SymTab.ClassOf(vt)
|
|
|
+ 3197 END;
|
|
|
+ 3198 IF braceCls = SymTab.ClSet THEN
|
|
|
+ 3199 IF vt = SymTab.InvalidType THEN
|
|
|
+ 3200 nw := 8
|
|
|
+ 3201 ELSE nw := SymTab.SetWords(vt);
|
|
|
+ 3202 IF nw = 0 THEN nw := 8 END
|
|
|
+ 3203 END;
|
|
|
+ 3204 QbeGen.NewSetTemp(nw, q);
|
|
|
+ 3205 QbeGen.SetZero(q, nw)
|
|
|
+ 3206 ELSIF (braceCls =
|
|
|
+ 3207 SymTab.ClArray)
|
|
|
+ 3208 OR (braceCls =
|
|
|
+ 3209 SymTab.ClRecord)
|
|
|
+ 3210 OR (braceCls =
|
|
|
+ 3211 SymTab.ClClass) THEN
|
|
|
+ 3212 QbeGen.CtorBegin(vt)
|
|
|
+ 3213 ELSE
|
|
|
+ 3214 IF vt # SymTab.InvalidType THEN
|
|
|
+ 3215 SemError(230) END;
|
|
|
+ 3216 braceCls := -1
|
|
|
+ 3217 END; .)
|
|
|
+ 3218 [ BraceElem<vt, q, astNode, astTail>
|
|
|
+ 3219 { "," BraceElem<vt, q, astNode, astTail> } ]
|
|
|
+ 3220 "}" (. IF (braceCls = SymTab.ClArray)
|
|
|
+ 3221 OR (braceCls =
|
|
|
+ 3222 SymTab.ClRecord)
|
|
|
+ 3223 OR (braceCls =
|
|
|
+ 3224 SymTab.ClClass) THEN
|
|
|
+ 3225 QbeGen.CtorEnd(q)
|
|
|
+ 3226 ELSIF braceCls # SymTab.ClSet THEN
|
|
|
+ 3227 QbeGen.CopyOp("0", q)
|
|
|
+ 3228 END;
|
|
|
+ 3229 braceCls := savedCls; .)
|
|
|
+ 3230 (. astCur := astNode; .) .
|
|
|
+ 3231 BraceElem<vt: SymTab.TypeIndex; VAR sq: QbeGen.QVal;
|
|
|
+ 3232 VAR node, tail: AST.Node>
|
|
|
+ 3233 (. VAR et, et2: SymTab.TypeIndex;
|
|
|
+ 3234 qe, q2: QbeGen.QVal;
|
|
|
+ 3235 v, v2, reps, k: INTEGER;
|
|
|
+ 3236 elem: SymTab.TypeIndex;
|
|
|
+ 3237 lo: INTEGER;
|
|
|
+ 3238 span: CARDINAL;
|
|
|
+ 3239 cl, cl2: INTEGER;
|
|
|
+ 3240 hasR, hasB: BOOLEAN;
|
|
|
+ 3241 astEl: AST.Node; .)
|
|
|
+ 3242 = (. hasR := FALSE; hasB := FALSE;
|
|
|
+ 3243 reps := 1; .)
|
|
|
+ 3244 Expr<et, qe> (. astEl := astCur; .)
|
|
|
+ 3245 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
+ 3246 AST.NkSubrange, 0, astEl, astCur);
|
|
|
+ 3247 hasR := TRUE; .) ]
|
|
|
+ 3248 [ "BY" Expr<et2, q2> (. hasB := TRUE; .) ]
|
|
|
+ 3249 (. IF braceCls = SymTab.ClSet THEN
|
|
|
+ 3250 IF hasB THEN SemError(230) END;
|
|
|
+ 3251 lo := SymTab.SetBaseLo(vt);
|
|
|
+ 3252 span := SymTab.SetCount(vt);
|
|
|
+ 3253 IF (et = SymTab.InvalidType)
|
|
|
+ 3254 OR (hasR AND (et2 =
|
|
|
+ 3255 SymTab.InvalidType)) THEN
|
|
|
+ 3256 ELSE cl :=
|
|
|
+ 3257 SymTab.ClassOf(et);
|
|
|
+ 3258 IF hasR THEN
|
|
|
+ 3259 cl2 :=
|
|
|
+ 3260 SymTab.ClassOf(et2)
|
|
|
+ 3261 ELSE cl2 := SymTab.ClInt
|
|
|
+ 3262 END;
|
|
|
+ 3263 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
+ 3264 OR (hasR AND NOT
|
|
|
+ 3265 SymTab.SetElemClassOk(cl2))
|
|
|
+ 3266 THEN
|
|
|
+ 3267 SemError(222)
|
|
|
+ 3268 ELSIF hasR
|
|
|
+ 3269 AND SymTab.ConstInt(qe, v)
|
|
|
+ 3270 AND SymTab.ConstInt(q2,
|
|
|
+ 3271 v2)
|
|
|
+ 3272 AND ((v < lo)
|
|
|
+ 3273 OR (v2 < lo)
|
|
|
+ 3274 OR (v >= lo +
|
|
|
+ 3275 VAL(INTEGER, span))
|
|
|
+ 3276 OR (v2 >= lo +
|
|
|
+ 3277 VAL(INTEGER, span))
|
|
|
+ 3278 OR (v > v2)) THEN
|
|
|
+ 3279 SemError(222)
|
|
|
+ 3280 ELSIF hasR THEN
|
|
|
+ 3281 QbeGen.SetRange(sq, qe, q2,
|
|
|
+ 3282 lo, span)
|
|
|
+ 3283 ELSIF SymTab.ConstInt(qe,
|
|
|
+ 3284 v)
|
|
|
+ 3285 AND ((v < lo)
|
|
|
+ 3286 OR (v >= lo +
|
|
|
+ 3287 VAL(INTEGER,
|
|
|
+ 3288 span))) THEN
|
|
|
+ 3289 SemError(222)
|
|
|
+ 3290 ELSE QbeGen.SetBit(sq, qe,
|
|
|
+ 3291 lo, span)
|
|
|
+ 3292 END
|
|
|
+ 3293 END
|
|
|
+ 3294 ELSIF (braceCls = SymTab.ClArray)
|
|
|
+ 3295 OR (braceCls =
|
|
|
+ 3296 SymTab.ClRecord)
|
|
|
+ 3297 OR (braceCls =
|
|
|
+ 3298 SymTab.ClClass) THEN
|
|
|
+ 3299 IF hasR THEN SemError(230) END;
|
|
|
+ 3300 reps := 1;
|
|
|
+ 3301 IF hasB THEN
|
|
|
+ 3302 IF SymTab.ConstInt(q2, v2)
|
|
|
+ 3303 AND (v2 >= 1) THEN
|
|
|
+ 3304 reps := v2
|
|
|
+ 3305 ELSE SemError(230)
|
|
|
+ 3306 END
|
|
|
+ 3307 END;
|
|
|
+ 3308 k := 0;
|
|
|
+ 3309 WHILE k < reps DO
|
|
|
+ 3310 QbeGen.CtorElem(qe);
|
|
|
+ 3311 INC(k)
|
|
|
+ 3312 END
|
|
|
+ 3313 END; .)
|
|
|
+ 3314 (. (* the BY form repeats the
|
|
|
+ 3315 element; keep the AST in
|
|
|
+ 3316 step with CtorElem *)
|
|
|
+ 3317 k := 0;
|
|
|
+ 3318 WHILE k < reps DO
|
|
|
+ 3319 AstAppend(AST.NkBlock,
|
|
|
+ 3320 node, tail, astEl);
|
|
|
+ 3321 INC(k)
|
|
|
+ 3322 END; .) .
|
|
|
+ 3323 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal; node: AST.Node> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
+ 3324 qe, q2: QbeGen.QVal;
|
|
|
+ 3325 v, v2: INTEGER;
|
|
|
+ 3326 lo: INTEGER;
|
|
|
+ 3327 span: CARDINAL;
|
|
|
+ 3328 cl, cl2: INTEGER;
|
|
|
+ 3329 hasR: BOOLEAN;
|
|
|
+ 3330 astEl: AST.Node; .)
|
|
|
+ 3331 = (. hasR := FALSE; .)
|
|
|
+ 3332 Expr<et, qe> (. astEl := astCur; .)
|
|
|
+ 3333 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
+ 3334 AST.NkSubrange, 0, astEl, astCur);
|
|
|
+ 3335 hasR := TRUE; .) ]
|
|
|
+ 3336 (. lo := SymTab.SetBaseLo(st);
|
|
|
+ 3337 span := SymTab.SetCount(st);
|
|
|
+ 3338 IF (et = SymTab.InvalidType)
|
|
|
+ 3339 OR (hasR AND (et2 =
|
|
|
+ 3340 SymTab.InvalidType)) THEN
|
|
|
+ 3341 ELSE cl :=
|
|
|
+ 3342 SymTab.ClassOf(et);
|
|
|
+ 3343 IF hasR THEN
|
|
|
+ 3344 cl2 :=
|
|
|
+ 3345 SymTab.ClassOf(et2)
|
|
|
+ 3346 ELSE cl2 := SymTab.ClInt
|
|
|
+ 3347 END;
|
|
|
+ 3348 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
+ 3349 OR (hasR AND NOT
|
|
|
+ 3350 SymTab.SetElemClassOk(cl2))
|
|
|
+ 3351 THEN
|
|
|
+ 3352 SemError(222)
|
|
|
+ 3353 ELSIF hasR
|
|
|
+ 3354 AND SymTab.ConstInt(qe, v)
|
|
|
+ 3355 AND SymTab.ConstInt(q2,
|
|
|
+ 3356 v2)
|
|
|
+ 3357 AND ((v < lo)
|
|
|
+ 3358 OR (v2 < lo)
|
|
|
+ 3359 OR (v >= lo +
|
|
|
+ 3360 VAL(INTEGER, span))
|
|
|
+ 3361 OR (v2 >= lo +
|
|
|
+ 3362 VAL(INTEGER, span))
|
|
|
+ 3363 OR (v > v2)) THEN
|
|
|
+ 3364 SemError(222)
|
|
|
+ 3365 ELSIF hasR THEN
|
|
|
+ 3366 QbeGen.SetRange(sq, qe, q2,
|
|
|
+ 3367 lo, span)
|
|
|
+ 3368 ELSIF SymTab.ConstInt(qe,
|
|
|
+ 3369 v)
|
|
|
+ 3370 AND ((v < lo)
|
|
|
+ 3371 OR (v >= lo +
|
|
|
+ 3372 VAL(INTEGER,
|
|
|
+ 3373 span))) THEN
|
|
|
+ 3374 SemError(222)
|
|
|
+ 3375 ELSE QbeGen.SetBit(sq, qe,
|
|
|
+ 3376 lo, span)
|
|
|
+ 3377 END
|
|
|
+ 3378 END; .)
|
|
|
+ 3379 (. AST.SetChild(node,
|
|
|
+ 3380 AST.NChild(node), astEl); .) .
|
|
|
+ 3381 GetIdent<VAR n: SymTab.Name>
|
|
|
+ 3382 = ident (. LexName(n); .) .
|
|
|
+ 3383
|
|
|
+ 3384 END M2.
|
|
|
|
|
|
0 errors
|
|
|
|
|
|
|
|
|
Statistics:
|
|
|
|
|
|
- nr of terminals: 105 (limit 400)
|
|
|
- nr of non-terminals: 86 (limit 210)
|
|
|
- nr of pragmas: 0 (limit 395)
|
|
|
- nr of symbolnodes: 191 (limit 500)
|
|
|
- nr of graphnodes: 1131 (limit 1500)
|
|
|
+ nr of terminals: 106 (limit 400)
|
|
|
+ nr of non-terminals: 90 (limit 210)
|
|
|
+ nr of pragmas: 0 (limit 394)
|
|
|
+ nr of symbolnodes: 196 (limit 500)
|
|
|
+ nr of graphnodes: 1187 (limit 1500)
|
|
|
nr of conditionsets: 12 (limit 100)
|
|
|
nr of charactersets: 16 (limit 250)
|
|
|
|
