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