aboutsummaryrefslogtreecommitdiff
path: root/gcc/m2/gm2-compiler/M2StateCheck.mod
blob: 789cd4f27c38465cf905ce9ce2e75cbf5100dbe0 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
(* M2StateCheck.mod provide state check tracking for declarations.

Copyright (C) 2024-2025 Free Software Foundation, Inc.
Contributed by Gaius Mulley <gaiusmod2@gmail.com>.

This file is part of GNU Modula-2.

GNU Modula-2 is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.

GNU Modula-2 is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Modula-2; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  *)

IMPLEMENTATION MODULE M2StateCheck ;

FROM Storage IMPORT ALLOCATE ;
FROM M2MetaError IMPORT MetaErrorStringT1 ;
FROM DynamicStrings IMPORT String, InitString, ConCat, Mark ;
FROM SymbolTable IMPORT NulSym, IsType, IsVar, IsConst ;


TYPE
   StateCheck = POINTER TO RECORD
                              state: StateSet ;
                              stack,
                              next : StateCheck ;
                           END ;

   State = (const, var, type, constfunc, varparam, constructor) ;

   StateSet = SET OF State ;

VAR
   FreeList: StateCheck ;


(*
   InitState - returns a new initialized StateCheck.
*)

PROCEDURE InitState () : StateCheck ;
VAR
   s: StateCheck ;
BEGIN
   s := New () ;
   WITH s^ DO
      state := StateSet {} ;
      stack := NIL ;
      next := NIL
   END ;
   RETURN s
END InitState ;


(*
   New - returns an uninitialized StateCheck.
*)

PROCEDURE New () : StateCheck ;
VAR
   s: StateCheck ;
BEGIN
   IF FreeList = NIL
   THEN
      NEW (s)
   ELSE
      s := FreeList ;
      FreeList := FreeList^.next
   END ;
   RETURN s
END New ;


(*
   PushState - duplicates the StateCheck s and chains the new copy to s.
               Return the copy.
*)

PROCEDURE PushState (VAR s: StateCheck) ;
VAR
   copy: StateCheck ;
BEGIN
   copy := InitState () ;
   copy^.state := s^.state ;
   copy^.stack := s ;
   s := copy
END PushState ;


(*
   KillState - destructor for StateCheck.
*)

PROCEDURE KillState (VAR s: StateCheck) ;
VAR
   t: StateCheck ;
BEGIN
   WHILE s^.stack # NIL DO
      t := s^.stack ;
      s^.stack := t^.stack ;
      Dispose (t)
   END ;
   Dispose (s)
END KillState ;


(*
   Dispose - place s onto the FreeList and set s to NIL.
*)

PROCEDURE Dispose (VAR s: StateCheck) ;
BEGIN
   s^.next := FreeList ;
   FreeList := s
END Dispose ;


(*
   InclVar - s := s + {var}.
*)

PROCEDURE InclVar (s: StateCheck) ;
BEGIN
   INCL (s^.state, var)
END InclVar ;


(*
   InclConst - s := s + {const}.
*)

PROCEDURE InclConst (s: StateCheck) ;
BEGIN
   INCL (s^.state, const)
END InclConst ;


(*
   InclType - s := s + {type}.
*)

PROCEDURE InclType (s: StateCheck) ;
BEGIN
   INCL (s^.state, type)
END InclType ;


(*
   InclConstFunc - s := s + {constfunc}.
*)

PROCEDURE InclConstFunc (s: StateCheck) ;
BEGIN
   INCL (s^.state, constfunc)
END InclConstFunc ;


(*
   InclVarParam - s := s + {varparam}.
*)

PROCEDURE InclVarParam (s: StateCheck) ;
BEGIN
   INCL (s^.state, varparam)
END InclVarParam ;


(*
   InclConstructor - s := s + {constructor}.
*)

PROCEDURE InclConstructor (s: StateCheck) ;
BEGIN
   INCL (s^.state, constructor)
END InclConstructor ;


(*
   ExclVar - s := s - {var}.
*)

PROCEDURE ExclVar (s: StateCheck) ;
BEGIN
   EXCL (s^.state, var)
END ExclVar ;


(*
   ExclConst - s := s - {const}.
*)

PROCEDURE ExclConst (s: StateCheck) ;
BEGIN
   EXCL (s^.state, const)
END ExclConst ;


(*
   ExclType - s := s - {type}.
*)

PROCEDURE ExclType (s: StateCheck) ;
BEGIN
   EXCL (s^.state, type)
END ExclType ;


(*
   ExclConstFunc - s := s - {constfunc}.
*)

PROCEDURE ExclConstFunc (s: StateCheck) ;
BEGIN
   EXCL (s^.state, constfunc)
END ExclConstFunc ;


(*
   ExclVarParam - s := s - {varparam}.
*)

PROCEDURE ExclVarParam (s: StateCheck) ;
BEGIN
   EXCL (s^.state, varparam)
END ExclVarParam ;


(*
   ExclConstructor - s := s - {varparam}.
*)

PROCEDURE ExclConstructor (s: StateCheck) ;
BEGIN
   EXCL (s^.state, constructor)
END ExclConstructor ;


(*
   PopState - pops the current state.
*)

PROCEDURE PopState (VAR s: StateCheck) ;
VAR
   t: StateCheck ;
BEGIN
   t := s ;
   s := s^.stack ;
   t^.stack := NIL ;
   Dispose (t)
END PopState ;


(*
   CheckQualident - checks to see that qualident sym is allowed in the state s.
*)

PROCEDURE CheckQualident (tok: CARDINAL; s: StateCheck; sym: CARDINAL) ;
BEGIN
   IF sym = NulSym
   THEN
      (* Ignore.  *)
   ELSIF IsType (sym)
   THEN
      IF (constfunc IN s^.state) OR (constructor IN s^.state)
      THEN
         (* Ok.  *)
      ELSIF const IN s^.state
      THEN
         GenerateError (tok, s, sym)
      END
   ELSIF IsConst (sym)
   THEN
      IF (constfunc IN s^.state) OR (constructor IN s^.state)
      THEN
         (* Ok.  *)
      ELSIF (var IN s^.state) OR (type IN s^.state)
      THEN
         GenerateError (tok, s, sym)
      END
   ELSIF IsVar (sym)
   THEN
      IF constfunc IN s^.state
      THEN
         (* Ok.  *)
      ELSIF (const IN s^.state) OR (type IN s^.state) OR (var IN s^.state)
      THEN
         GenerateError (tok, s, sym)
      END
   END
END CheckQualident ;


(*
   GenerateError - generates an unrecoverable error string based on the state and sym.
*)

PROCEDURE GenerateError (tok: CARDINAL; s: StateCheck; sym: CARDINAL) ;
VAR
   str: String ;
BEGIN
   str := InitString ('not expecting the {%1Ad} {%1a} in a ') ;
   IF const IN s^.state
   THEN
      str := ConCat (str, Mark (InitString ('{%kCONST} block')))
   ELSIF type IN s^.state
   THEN
      str := ConCat (str, Mark (InitString ('{%kTYPE} block')))
   ELSIF var IN s^.state
   THEN
      str := ConCat (str, Mark (InitString ('{%kVAR} block')))
   END ;
   IF constfunc IN s^.state
   THEN
      str := ConCat (str, Mark (InitString (' and within a constant procedure function actual parameter')))
   END ;
   IF constructor IN s^.state
   THEN
      str := ConCat (str, Mark (InitString (' and within a constructor')))
   END ;
   MetaErrorStringT1 (tok, str, sym)
END GenerateError ;


(*
   init - initialize the global variables in the module.
*)

PROCEDURE init ;
BEGIN
   FreeList := NIL
END init ;


BEGIN
   init
END M2StateCheck.