| 1 |
% module AdvParse begin |
| 2 |
IMPLEMENTATION MODULE AdvParse ; |
| 3 |
|
| 4 |
(* |
| 5 |
Author : Gaius Mulley |
| 6 |
Title : AdvParse |
| 7 |
Date : 16/7/2005 |
| 8 |
SYSTEM : GNU Modula-2 |
| 9 |
Description: parses maps. |
| 10 |
*) |
| 11 |
|
| 12 |
FROM libc IMPORT printf ; |
| 13 |
FROM SYSTEM IMPORT ADDRESS ; |
| 14 |
FROM DynamicStrings IMPORT String, string, InitStringCharStar, KillString, |
| 15 |
InitString, ConCat, ConCatChar, Mark ; |
| 16 |
FROM StringConvert IMPORT stoi ; |
| 17 |
FROM advflex IMPORT toktype, OpenSource, CloseSource, error, GetToken, |
| 18 |
currenttoken, currentinteger ; |
| 19 |
FROM AdvMap IMPORT Rooms, Line, DoorStatus, Door, Room, Treasure, |
| 20 |
ActualNoOfRooms, MaxNoOfTreasures, MaxNoOfRooms, |
| 21 |
WallsPerRoom, DoorsPerRoom, TreasureKind ; |
| 22 |
FROM AdvUtil IMPORT HideTreasure ; |
| 23 |
|
| 24 |
|
| 25 |
CONST |
| 26 |
Debugging = TRUE ; |
| 27 |
|
| 28 |
TYPE |
| 29 |
BITSET = SET OF toktype ; |
| 30 |
|
| 31 |
VAR |
| 32 |
LastInt, |
| 33 |
ExitValue : INTEGER ; |
| 34 |
|
| 35 |
CurDoor, |
| 36 |
CurWall, |
| 37 |
CurRoom : CARDINAL ; |
| 38 |
|
| 39 |
|
| 40 |
(* |
| 41 |
Min - |
| 42 |
*) |
| 43 |
|
| 44 |
PROCEDURE Min (a, b: INTEGER) : INTEGER ; |
| 45 |
BEGIN |
| 46 |
IF a<b |
| 47 |
THEN |
| 48 |
RETURN( a ) |
| 49 |
ELSE |
| 50 |
RETURN( b ) |
| 51 |
END |
| 52 |
END Min ; |
| 53 |
|
| 54 |
|
| 55 |
(* |
| 56 |
Max - |
| 57 |
*) |
| 58 |
|
| 59 |
PROCEDURE Max (a, b: INTEGER) : INTEGER ; |
| 60 |
BEGIN |
| 61 |
IF a>b |
| 62 |
THEN |
| 63 |
RETURN( a ) |
| 64 |
ELSE |
| 65 |
RETURN( b ) |
| 66 |
END |
| 67 |
END Max ; |
| 68 |
|
| 69 |
|
| 70 |
(* |
| 71 |
OpenFile - attempts to open a file, mapfile. |
| 72 |
*) |
| 73 |
|
| 74 |
PROCEDURE OpenFile (mapfile: ADDRESS) : INTEGER ; |
| 75 |
VAR |
| 76 |
r: INTEGER ; |
| 77 |
BEGIN |
| 78 |
ExitValue := 0 ; |
| 79 |
IF OpenSource(mapfile) |
| 80 |
THEN |
| 81 |
RETURN( 0 ) |
| 82 |
ELSE |
| 83 |
r := printf("cannot open file: %s\n", mapfile) ; |
| 84 |
RETURN( 1 ) |
| 85 |
END ; |
| 86 |
END OpenFile ; |
| 87 |
|
| 88 |
|
| 89 |
(* |
| 90 |
CloseFile - |
| 91 |
*) |
| 92 |
|
| 93 |
PROCEDURE CloseFile ; |
| 94 |
BEGIN |
| 95 |
CloseSource |
| 96 |
END CloseFile ; |
| 97 |
|
| 98 |
% declaration AdvParse begin |
| 99 |
|
| 100 |
|
| 101 |
(* |
| 102 |
ErrorArray - |
| 103 |
*) |
| 104 |
|
| 105 |
PROCEDURE ErrorArray (a: ARRAY OF CHAR) ; |
| 106 |
BEGIN |
| 107 |
ErrorString(InitString(a)) |
| 108 |
END ErrorArray ; |
| 109 |
|
| 110 |
|
| 111 |
(* |
| 112 |
ErrorString - |
| 113 |
*) |
| 114 |
|
| 115 |
PROCEDURE ErrorString (s: String) ; |
| 116 |
BEGIN |
| 117 |
error(string(s)) ; |
| 118 |
ExitValue := 1 |
| 119 |
END ErrorString ; |
| 120 |
|
| 121 |
|
| 122 |
(* |
| 123 |
SyntaxError - after a syntax error we skip all tokens up until we reach |
| 124 |
a stop symbol. |
| 125 |
*) |
| 126 |
|
| 127 |
PROCEDURE SyntaxError (stopset: BITSET) ; |
| 128 |
VAR |
| 129 |
r: INTEGER ; |
| 130 |
BEGIN |
| 131 |
DescribeError(stopset) ; |
| 132 |
IF Debugging |
| 133 |
THEN |
| 134 |
r := printf('\nskipping token *** ') |
| 135 |
END ; |
| 136 |
WHILE NOT (currenttoken IN stopset) |
| 137 |
DO |
| 138 |
GetToken |
| 139 |
END ; |
| 140 |
IF Debugging |
| 141 |
THEN |
| 142 |
r := printf(' ***\n') |
| 143 |
END ; |
| 144 |
ExitValue := 1 |
| 145 |
END SyntaxError ; |
| 146 |
|
| 147 |
|
| 148 |
(* |
| 149 |
SyntaxCheck - |
| 150 |
*) |
| 151 |
|
| 152 |
PROCEDURE SyntaxCheck (stopset: BITSET) ; |
| 153 |
BEGIN |
| 154 |
IF NOT (currenttoken IN stopset) |
| 155 |
THEN |
| 156 |
SyntaxError(stopset) |
| 157 |
END |
| 158 |
END SyntaxCheck ; |
| 159 |
|
| 160 |
|
| 161 |
(* |
| 162 |
WarnMissingToken - generates a warning message about a missing token, t. |
| 163 |
*) |
| 164 |
|
| 165 |
PROCEDURE WarnMissingToken (t: toktype) ; |
| 166 |
VAR |
| 167 |
s : BITSET ; |
| 168 |
str: String ; |
| 169 |
BEGIN |
| 170 |
s := BITSET{t} ; |
| 171 |
str := DescribeStop(s) ; |
| 172 |
|
| 173 |
str := ConCat(InitString('syntax error,'), Mark(str)) ; |
| 174 |
ErrorString(str) |
| 175 |
END WarnMissingToken ; |
| 176 |
|
| 177 |
|
| 178 |
(* |
| 179 |
MissingToken - generates a warning message about a missing token, t. |
| 180 |
*) |
| 181 |
|
| 182 |
PROCEDURE MissingToken (t: toktype) ; |
| 183 |
VAR |
| 184 |
r: INTEGER ; |
| 185 |
BEGIN |
| 186 |
WarnMissingToken(t) |
| 187 |
END MissingToken ; |
| 188 |
|
| 189 |
|
| 190 |
(* |
| 191 |
InStopSet |
| 192 |
*) |
| 193 |
|
| 194 |
PROCEDURE InStopSet (t: toktype; stopset: BITSET) : BOOLEAN ; |
| 195 |
BEGIN |
| 196 |
RETURN t IN stopset |
| 197 |
END InStopSet ; |
| 198 |
|
| 199 |
|
| 200 |
(* |
| 201 |
Expect - |
| 202 |
*) |
| 203 |
|
| 204 |
PROCEDURE Expect (t: toktype; stopset: BITSET) ; |
| 205 |
BEGIN |
| 206 |
IF currenttoken=t |
| 207 |
THEN |
| 208 |
GetToken |
| 209 |
ELSE |
| 210 |
MissingToken(t) |
| 211 |
END ; |
| 212 |
SyntaxCheck(stopset) |
| 213 |
END Expect ; |
| 214 |
|
| 215 |
|
| 216 |
PROCEDURE ParseMap (a: ADDRESS) : INTEGER ; |
| 217 |
VAR |
| 218 |
r: INTEGER ; |
| 219 |
BEGIN |
| 220 |
r := OpenFile(a) ; |
| 221 |
IF r=0 |
| 222 |
THEN |
| 223 |
GetToken ; |
| 224 |
FileUnit(BITSET{eoftok}) ; |
| 225 |
CloseFile ; |
| 226 |
RETURN( ExitValue ) |
| 227 |
ELSE |
| 228 |
RETURN( r ) |
| 229 |
END |
| 230 |
END ParseMap ; |
| 231 |
|
| 232 |
|
| 233 |
(* |
| 234 |
Integer - |
| 235 |
*) |
| 236 |
|
| 237 |
PROCEDURE Integer (stopset: BITSET) ; |
| 238 |
BEGIN |
| 239 |
LastInt := currentinteger ; |
| 240 |
Expect(integertok, stopset) |
| 241 |
END Integer ; |
| 242 |
|
| 243 |
|
| 244 |
% module AdvParse end |
| 245 |
|
| 246 |
|
| 247 |
END AdvParse. |
| 248 |
% rules |
| 249 |
error 'ErrorArray' 'ErrorString' |
| 250 |
tokenfunc 'currenttoken' |
| 251 |
|
| 252 |
token '' eoftok -- internal token |
| 253 |
token 'ROOM' roomtok |
| 254 |
token 'DOOR' doortok |
| 255 |
token 'WALL' walltok |
| 256 |
token 'TREASURE' treasuretok |
| 257 |
token 'AT' attok |
| 258 |
token 'LEADS' leadstok |
| 259 |
token 'TO' totok |
| 260 |
token 'STATUS' statustok |
| 261 |
token "CLOSED" closedtok |
| 262 |
token "OPEN" opentok |
| 263 |
token "SECRET" secrettok |
| 264 |
token 'IS' istok |
| 265 |
token 'END' endtok |
| 266 |
token 'END.' enddottok |
| 267 |
token 'integer number' integertok |
| 268 |
token 'RANDOMIZE' randomizetok |
| 269 |
|
| 270 |
special Integer first { < integertok > } follow { } |
| 271 |
|
| 272 |
BNF |
| 273 |
|
| 274 |
FileUnit := RoomDesc { RoomDesc } [ RandomTreasure ] "END." =: |
| 275 |
|
| 276 |
RoomDesc := 'ROOM' Integer % VAR r: INTEGER ; % |
| 277 |
% CurRoom := LastInt ; |
| 278 |
ActualNoOfRooms := Max(CurRoom, |
| 279 |
ActualNoOfRooms) ; |
| 280 |
WITH Rooms[CurRoom] DO |
| 281 |
NoOfWalls := 0 ; |
| 282 |
NoOfDoors := 0 ; |
| 283 |
Treasures := {} |
| 284 |
END ; |
| 285 |
IF Debugging |
| 286 |
THEN |
| 287 |
r := printf('reading room %d\n', CurRoom) |
| 288 |
END % |
| 289 |
{ WallDesc | DoorDesc | TreasureDesc } 'END' =: |
| 290 |
|
| 291 |
WallDesc := 'WALL' WallCoords { WallCoords } =: |
| 292 |
|
| 293 |
WallCoords := % WITH Rooms[CurRoom] DO |
| 294 |
INC(NoOfWalls) ; |
| 295 |
IF NoOfWalls>WallsPerRoom |
| 296 |
THEN |
| 297 |
ErrorArray('too many walls') ; |
| 298 |
NoOfWalls := WallsPerRoom |
| 299 |
END ; |
| 300 |
CurWall := NoOfWalls |
| 301 |
END % |
| 302 |
Integer % VAR x1, y1, x2, y2: INTEGER ; % |
| 303 |
% x1 := LastInt % |
| 304 |
Integer % y1 := LastInt % |
| 305 |
|
| 306 |
Integer % x2 := LastInt % |
| 307 |
|
| 308 |
Integer % y2 := LastInt ; |
| 309 |
WITH Rooms[CurRoom].Walls[CurWall] DO |
| 310 |
X1 := Min(x1, x2) ; |
| 311 |
Y1 := Min(y1, y2) ; |
| 312 |
X2 := Max(x1, x2) ; |
| 313 |
Y2 := Max(y1, y2) ; |
| 314 |
IF (X1#X2) AND (Y1#Y2) |
| 315 |
THEN |
| 316 |
error(string(InitString("not allowed diagonal wall"))) |
| 317 |
END |
| 318 |
END % |
| 319 |
=: |
| 320 |
|
| 321 |
DoorDesc := 'DOOR' DoorCoords { DoorCoords } =: |
| 322 |
|
| 323 |
DoorCoords := % WITH Rooms[CurRoom] DO |
| 324 |
INC(NoOfDoors) ; |
| 325 |
IF NoOfDoors>DoorsPerRoom |
| 326 |
THEN |
| 327 |
ErrorArray('too many doors') ; |
| 328 |
NoOfDoors := DoorsPerRoom |
| 329 |
END ; |
| 330 |
CurDoor := NoOfDoors |
| 331 |
END % |
| 332 |
Integer % VAR x1, y1, x2, y2: INTEGER ; % |
| 333 |
% x1 := LastInt % |
| 334 |
Integer % y1 := LastInt % |
| 335 |
|
| 336 |
Integer % x2 := LastInt % |
| 337 |
|
| 338 |
Integer % y2 := LastInt ; |
| 339 |
WITH Rooms[CurRoom].Doors[CurDoor].Position DO |
| 340 |
X1 := Min(x1, x2) ; |
| 341 |
Y1 := Min(y1, y2) ; |
| 342 |
X2 := Max(x1, x2) ; |
| 343 |
Y2 := Max(y1, y2) ; |
| 344 |
IF (X1#X2) AND (Y1#Y2) |
| 345 |
THEN |
| 346 |
error(string(InitString("not allowed diagonal door"))) |
| 347 |
END |
| 348 |
|
| 349 |
END % |
| 350 |
|
| 351 |
Status |
| 352 |
'LEADS' 'TO' Integer % Rooms[CurRoom].Doors[CurDoor].LeadsTo := LastInt % |
| 353 |
=: |
| 354 |
|
| 355 |
Status := 'STATUS' ( 'OPEN' % Rooms[CurRoom].Doors[CurDoor].StateOfDoor := Open % |
| 356 |
| 'CLOSED' % Rooms[CurRoom].Doors[CurDoor].StateOfDoor := Closed % |
| 357 |
| 'SECRET' % Rooms[CurRoom].Doors[CurDoor].StateOfDoor := Secret % |
| 358 |
) |
| 359 |
=: |
| 360 |
|
| 361 |
TreasureDesc := 'TREASURE' 'AT' Integer |
| 362 |
% VAR x, y: INTEGER ; % |
| 363 |
% x := LastInt % |
| 364 |
Integer % y := LastInt % |
| 365 |
'IS' Integer % WITH Treasure[LastInt] DO |
| 366 |
Xpos := x ; |
| 367 |
Ypos := y ; |
| 368 |
Rm := CurRoom ; |
| 369 |
kind := onfloor |
| 370 |
END ; |
| 371 |
INCL(Rooms[CurRoom].Treasures, LastInt) % |
| 372 |
=: |
| 373 |
|
| 374 |
RandomTreasure := 'RANDOMIZE' 'TREASURE' Integer % HideTreasure(LastInt) % |
| 375 |
{ Integer % HideTreasure(LastInt) % |
| 376 |
} |
| 377 |
=: |
| 378 |
|
| 379 |
FNB |