-
Notifications
You must be signed in to change notification settings - Fork 2
/
GETCONST.PAS
421 lines (388 loc) · 12.4 KB
/
GETCONST.PAS
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
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
{/////////////////////////////////////////////////////////////////////////
//
// Dos Navigator Version 1.51 Copyright (C) 1991-99 RIT Research Labs
//
// This programs is free for commercial and non-commercial use as long as
// the following conditions are aheared to.
//
// Copyright remains RIT Research Labs, and as such any Copyright notices
// in the code are not to be removed. If this package is used in a
// product, RIT Research Labs should be given attribution as the RIT Research
// Labs of the parts of the library used. This can be in the form of a textual
// message at program startup or in documentation (online or textual)
// provided with the package.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// 3. All advertising materials mentioning features or use of this software
// must display the following acknowledgement:
// "Based on TinyWeb Server by RIT Research Labs."
//
// THIS SOFTWARE IS PROVIDED BY RIT RESEARCH LABS "AS IS" AND ANY EXPRESS
// OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
// GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
// IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// The licence and distribution terms for any publically available
// version or derivative of this code cannot be changed. i.e. this code
// cannot simply be copied and put under another distribution licence
// (including the GNU Public Licence).
//
//////////////////////////////////////////////////////////////////////////}
UNIT
GetConst;
INTERFACE
USES
Objects;
TYPE
PValuesHolder =^TValuesHolder;
PTypeHolder =^TTypeHolder;
PLngWord = ^TLngWord;
TTypeMode = ( tmConst, tmEnum );
{ Collection of PTypeHolders }
TValuesHolder = Object( TCollection )
function GetType( ID: String ): PTypeHolder;
function GetValue( S: String; var Complete: Boolean ): Word;
procedure Show;
end;
{ Collection of PLngWords }
TTypeHolder = object( TSortedCollection )
TypeID: String[ 10 ];
Mode: TTypeMode;
constructor Init( ID: String; AMode: TTypeMode );
function Compare(P1, P2: Pointer): Integer; virtual;
procedure Show;
end;
TLngWord = object(TObject)
Name: String[30];
L: Word;
Mark: Byte;
constructor Init( AL: Word; const AName: String );
end;
PROCEDURE ProcessFile( const FileName: String; Types: PValuesHolder );
IMPLEMENTATION
USES
Dos,
Advance,
Commands;
PROCEDURE Error( S: String );
begin
WriteLn( S );
Halt( 2 );
end;
FUNCTION TValuesHolder.GetType;
function LookForType( P: PTypeHolder ): boolean; far;
begin
LookForType := P^.TypeID = ID;
end;
begin
GetType := FirstThat( @LookForType );
end;
FUNCTION TValuesHolder.GetValue;
function DoScanValue( P: PTypeHolder ): boolean; far;
function DoScan( P: PLngWord ): boolean; far;
begin
If P^.Name = S then begin
GetValue := P^.L;
DoScan := True;
end else
DoScan := False
end;
begin
DoScanValue := P^.FirstThat( @DoScan ) <> NIL;
end;
begin
UpStr( S );
Complete := FirstThat( @DoScanValue ) <> NIL;
end;
PROCEDURE TTypeHolder.Show;
procedure DoScan( P: PLngWord ); far;
begin
WriteLn( P^.Name, '=', P^.L );
end;
begin
ForEach( @DoScan );
end;
FUNCTION TTypeHolder.Compare;
begin
if PLngWord(P1)^.Name > PLngWord(P2)^.Name then Compare := 1 else
if PLngWord(P1)^.Name < PLngWord(P2)^.Name then Compare := -1 else
Compare := 0;
end;
PROCEDURE TValuesHolder.Show;
procedure DoScan( P: PTypeHolder ); far;
begin
WriteLn( 'TYPE ', P^.TypeID );
WriteLn( Strg( 'Ä', 5 + Length( P^.TypeID )));
P^.Show;
end;
begin
ForEach( @DoScan );
end;
CONSTRUCTOR TTypeHolder.Init;
begin
inherited Init( 50, 50 );
TypeID := Copy( ID, 1, 10 );
Mode := AMode;
end;
CONSTRUCTOR TLngWord.Init;
begin
Name := UpStrg( Copy( AName, 1, 30 ));
L := Word( AL );
Mark := 0;
end;
CONST
Alpha = [ 'A'..'Z','a'..'z','_' ];
Digits = [ '0'..'9' ];
Hexs = [ '0'..'9','A'..'F','a'..'f' ];
Blank = [ #0..#32 ];
PROCEDURE ProcessFile;
type
TParseMode = ( pmSkip, pmComment, pmConst, pmStartType, pmSeekType, pmType );
var
F: Text;
US, S, ID: String;
Eq: Integer;
P: PTypeHolder;
CurrentType: PTypeHolder;
TypeCount: Word;
CmtMode, Mode: TParseMode;
CmtB, CmtE: Integer; CmtS: String[ 2 ];
function CalcValue( var S: String ): Word;
var
W: Word; V: String;
ParseMode: ( pmNone, pmAlpha, pmWord, pmHex );
I: Integer;
Complete: Boolean;
label Loop;
begin
I := 0;
W := 0;
ParseMode := pmNone;
While I < Length( S ) do begin
Inc( I );
Loop:
case ParseMode of
pmNone: If S[ I ] in Blank then Continue else
If S[ I ] in Digits then begin
ParseMode := pmWord;
W := 0;
goto Loop
end else If S[ I ] = '$' then begin
ParseMode := pmHex;
W := 0;
end else If S[ I ] in Alpha then begin
ParseMode := pmAlpha;
V := S[ I ];
end else If S[ I ] = '+' then begin
S := Copy( S, I + 1, 255 );
W := W + CalcValue( S );
Break;
end else If S[ I ] = '-' then begin
S := Copy( S, I + 1, 255 );
W := W - CalcValue( S );
Break;
end;
pmWord: If S[ I ] in Digits
then W := W * 10 + Ord( S[ I ] ) - Ord( '0' )
else Break;
pmHex: If S[ I ] in Hexs
then W := W * 16 + Ord( Upcase( S[ I ] )) - Ord( '0' ) - 7 * Byte( S[ I ] > '9' )
else Break;
pmAlpha: If S[ I ] in ( Alpha + Digits )
then V := V + S[ I ]
else begin
W := Types^.GetValue( V, Complete );
If not Complete then begin
WriteLn( 'Undefined variable ', V );
end else
Break;
end;
end{ case };
end{ while };
S := Copy( S, I, 255 );
CalcValue := W;
end;
FUNCTION TruncSpace(S:String): String;
var I: Byte;
begin
I:=Length(S); While S[I]=' ' do DEC(I);
S[0]:=Char(I);
TruncSpace:=S
end;
FUNCTION RemoveLeadSpaces( const S: String ): String;
var I: Integer;
begin
I := 1;
While ( I <= Length( S )) and ( S[ I ] = ' ' ) do Inc( I );
RemoveLeadSpaces := Copy( S, I, 255 );
end;
function Ident( N: Integer ): String;
var R: String; I: Integer;
begin
I := N;
If not ( S[ I ] in Alpha ) then begin
Ident := '';
Exit;
end;
While ( I <= Length( S )) and ( S[ I ] in ( Alpha + Digits )) do Inc( I );
Dec( I );
Ident := Copy( S, N, I - N + 1 );
S := RemoveLeadSpaces( Copy( S, I + 1, 255 ));
US := UpStrg( S );
end;
function LookForType( P: PTypeHolder ): boolean; far;
begin
LookForType := ( Mode = pmConst ) and ( P^.Mode = tmConst ) and
( Pos( Copy( ID, 1, 2 ) + #0, P^.TypeID ) > 0 )
or
( Mode = pmStartType ) and ( P^.Mode = tmEnum ) and
( UpStrg( ID ) = UpStrg( P^.TypeID ));
end;
function DelDblSpc( S: String ): String;
begin
DelDoubles( ' ', S );
DelDblSpc := S;
end;
label
Reparse, StartType;
begin
Mode := pmSkip;
Assign( F, FileName ); Reset( F );
While not EOF( F ) do begin
ReadLn( F, S );
Reparse:
S := RemoveLeadSpaces( TruncSpace( S )); DelDoubles( ' ', S );
If S = '' then Continue;
US := UpStrg( S );
CmtB := Pos( '{', S );
If CmtB > 0 then begin
CmtS := '}';
CmtE := Pos( '}', S );
If CmtE > 0 then begin
Delete( S, CmtB, CmtE - CmtB + 1 );
goto Reparse;
end else begin
Delete( S, CmtB, 1 );
CmtMode := Mode;
Mode := pmComment;
goto Reparse;
end;
end;
CmtB := Pos( '(*', S );
If CmtB > 0 then begin
CmtS := '*)';
CmtE := Pos( '*)', S );
If CmtE > 0 then begin
Delete( S, CmtB, CmtE - CmtB + 2 );
goto Reparse;
end else begin
Delete( S, CmtB, 2 );
CmtMode := Mode;
Mode := pmComment;
goto Reparse;
end;
end;
case Mode of
pmComment: begin
CmtE := Pos( CmtS, S );
If CmtE > 0 then begin
Delete( S, 1, CmtE + Length( CmtS ));
Mode := CmtMode;
goto Reparse;
end;
end;
pmSkip: begin
If Pos( 'CONST', US ) = 1 then begin
Mode := pmConst;
Delete( S, 1, 5 );
goto Reparse;
end else If Pos( 'TYPE', US ) = 1
then goto StartType;
end;
pmConst:If Pos( 'TYPE', US ) = 1 then StartType: begin
Mode := pmStartType;
Delete( S, 1, 4 );
goto Reparse;
end else begin
If Pos( 'CONST', US ) = 1 then begin
Delete( S, 1, 5 );
goto Reparse;
end;
Eq := Pos( '=', S );
If Eq = 0 then begin
Mode := pmSkip;
Continue;
end;
ID := Ident( 1 );
P := Types^.FirstThat( @LookForType );
If P = NIL then Continue;
Eq := Pos( '=', S );
S := RemoveLeadSpaces( Copy( S, Eq + 1, 255 ));
US := RemoveLeadSpaces( Copy( US, Eq + 1, 255 ));
P^.Insert( New( PLngWord, Init( CalcValue( US ), ID )));
US := RemoveLeadSpaces( US );
If US[ 1 ] = ';' then US := Copy( US, 2, 255 );
Delete( S, 1, Length( S ) - Length( US ));
goto Reparse;
end;
pmStartType: begin
ID := Ident( 1 );
CurrentType := Types^.FirstThat( @LookForType );
If CurrentType = NIL then begin
If Pos( ')', S ) > 0 then
While not EOF( F ) do
If Pos( ')', S ) > 0
then Break
else ReadLn( F, S );
Mode := pmSeekType;
end else begin
TypeCount := 0;
Mode := pmType;
Delete( S, 1, Length( ID ));
goto Reparse;
end
end;
pmSeekType: If Pos( 'CONST', US ) = 1 then begin
Mode := pmSkip;
goto Reparse;
end else If Pos( 'TYPE', US ) = 1 then begin
Mode := pmSkip;
goto Reparse;
end else begin
Mode := pmStartType;
goto Reparse;
end;
pmType: begin
ID := Ident( 1 );
If ID <> '' then begin
CurrentType^.Insert( New( PLngWord, Init( TypeCount, ID )));
Inc( TypeCount );
If S[ 1 ] = ',' then begin
Delete( S, 1, 1 );
goto Reparse;
end;
end;
If Pos( ')', S ) > 0
then Mode := pmSeekType
else goto Reparse;
end
end;
end;
Close( F );
end;
END.