2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)grammar.y 8.1 (Berkeley) 5/31/93
40 * Copyright (c) 1987 by Ed James, UC Berkeley. All rights reserved.
42 * Copy permission is hereby granted provided that this notice is
43 * retained on all partial or complete copies.
45 * For more info on this and all of my stuff, mail edjames@berkeley.edu.
48 %token
<ival
> HeightOp
50 %token
<ival
> UpdateOp
51 %token
<ival
> NewplaneOp
55 %token
<ival
> AirportOp
56 %token
<ival
> BeaconOp
72 bunch_of_defs
{ if
(checkdefs
() < 0) return
(errors
); } bunch_of_lines
74 if
(sp
->num_exits
+ sp
->num_airports
< 2)
75 yyerror("Need at least 2 airports and/or exits.");
93 UpdateOp
'=' ConstOp
';'
95 if
(sp
->update_secs
!= 0)
96 return
(yyerror("Redefinition of 'update'."));
98 return
(yyerror("'update' is too small."));
100 sp
->update_secs
= $3;
105 NewplaneOp
'=' ConstOp
';'
107 if
(sp
->newplane_time
!= 0)
108 return
(yyerror("Redefinition of 'newplane'."));
110 return
(yyerror("'newplane' is too small."));
112 sp
->newplane_time
= $3;
117 HeightOp
'=' ConstOp
';'
120 return
(yyerror("Redefinition of 'height'."));
122 return
(yyerror("'height' is too small."));
129 WidthOp
'=' ConstOp
';'
132 return
(yyerror("Redefinition of 'width'."));
134 return
(yyerror("'width' is too small."));
148 BeaconOp
':' Bpoint_list
';'
150 | ExitOp
':' Epoint_list
';'
152 | LineOp
':' Lline_list
';'
154 | AirportOp
':' Apoint_list
';'
166 '(' ConstOp ConstOp
')'
168 if
(sp
->num_beacons % REALLOC
== 0) {
169 if
(sp
->beacon
== NULL
)
170 sp
->beacon
= (BEACON
*) malloc
((sp
->num_beacons
171 + REALLOC
) * sizeof
(BEACON
));
173 sp
->beacon
= (BEACON
*) realloc
(sp
->beacon
,
174 (sp
->num_beacons
+ REALLOC
) *
176 if
(sp
->beacon
== NULL
)
177 return
(yyerror("No memory available."));
179 sp
->beacon
[sp
->num_beacons
].x
= $2;
180 sp
->beacon
[sp
->num_beacons
].y
= $3;
194 '(' ConstOp ConstOp DirOp
')'
198 if
(sp
->num_exits % REALLOC
== 0) {
199 if
(sp
->exit
== NULL
)
200 sp
->exit
= (EXIT
*) malloc
((sp
->num_exits
+
201 REALLOC
) * sizeof
(EXIT
));
203 sp
->exit
= (EXIT
*) realloc
(sp
->exit
,
204 (sp
->num_exits
+ REALLOC
) *
206 if
(sp
->exit
== NULL
)
207 return
(yyerror("No memory available."));
210 sp
->exit
[sp
->num_exits
].x
= $2;
211 sp
->exit
[sp
->num_exits
].y
= $3;
212 sp
->exit
[sp
->num_exits
].dir
= dir
;
214 check_edir
($2, $3, dir
);
227 '(' ConstOp ConstOp DirOp
')'
231 if
(sp
->num_airports % REALLOC
== 0) {
232 if
(sp
->airport
== NULL
)
233 sp
->airport
=(AIRPORT
*)malloc
((sp
->num_airports
234 + REALLOC
) * sizeof
(AIRPORT
));
236 sp
->airport
= (AIRPORT
*) realloc
(sp
->airport
,
237 (sp
->num_airports
+ REALLOC
) *
239 if
(sp
->airport
== NULL
)
240 return
(yyerror("No memory available."));
243 sp
->airport
[sp
->num_airports
].x
= $2;
244 sp
->airport
[sp
->num_airports
].y
= $3;
245 sp
->airport
[sp
->num_airports
].dir
= dir
;
247 check_adir
($2, $3, dir
);
260 '[' '(' ConstOp ConstOp
')' '(' ConstOp ConstOp
')' ']'
262 if
(sp
->num_lines % REALLOC
== 0) {
263 if
(sp
->line
== NULL
)
264 sp
->line
= (LINE
*) malloc
((sp
->num_lines
+
265 REALLOC
) * sizeof
(LINE
));
267 sp
->line
= (LINE
*) realloc
(sp
->line
,
268 (sp
->num_lines
+ REALLOC
) *
270 if
(sp
->line
== NULL
)
271 return
(yyerror("No memory available."));
273 sp
->line
[sp
->num_lines
].p1.x
= $3;
274 sp
->line
[sp
->num_lines
].p1.y
= $4;
275 sp
->line
[sp
->num_lines
].p2.x
= $7;
276 sp
->line
[sp
->num_lines
].p2.y
= $8;
277 check_line
($3, $4, $7, $8);
285 if
(!(x
== 0) && !(x
== sp
->width
- 1) &&
286 !(y
== 0) && !(y
== sp
->height
- 1))
287 yyerror("edge value not on edge.");
292 if
(x
< 1 || x
>= sp
->width
- 1)
293 yyerror("X value out of range.");
294 if
(y
< 1 || y
>= sp
->height
- 1)
295 yyerror("Y value out of range.");
298 check_linepoint
(x
, y
)
300 if
(x
< 0 || x
>= sp
->width
)
301 yyerror("X value out of range.");
302 if
(y
< 0 || y
>= sp
->height
)
303 yyerror("Y value out of range.");
306 check_line
(x1
, y1
, x2
, y2
)
310 check_linepoint
(x1
, y1
);
311 check_linepoint
(x2
, y2
);
316 if
(!(d1
== d2
) && !(d1
== 0) && !(d2
== 0))
317 yyerror("Bad line endpoints.");
323 fprintf
(stderr
, "\"%s\": line %d: %s\n", file
, line
, s
);
329 check_edir
(x
, y
, dir
)
333 if
(x
== sp
->width
- 1)
337 if
(y
== sp
->height
- 1)
342 switch
(x
* 10 + y
) {
343 case
00: if
(dir
!= 3) bad
++; break
;
344 case
01: if
(dir
< 1 || dir
> 3) bad
++; break
;
345 case
02: if
(dir
!= 1) bad
++; break
;
346 case
10: if
(dir
< 3 || dir
> 5) bad
++; break
;
348 case
12: if
(dir
> 1 && dir
< 7) bad
++; break
;
349 case
20: if
(dir
!= 5) bad
++; break
;
350 case
21: if
(dir
< 5) bad
++; break
;
351 case
22: if
(dir
!= 7) bad
++; break
;
353 yyerror("Unknown value in checkdir! Get help!");
357 yyerror("Bad direction for entrance at exit.");
360 check_adir
(x
, y
, dir
)
368 if
(sp
->width
== 0) {
369 yyerror("'width' undefined.");
372 if
(sp
->height
== 0) {
373 yyerror("'height' undefined.");
376 if
(sp
->update_secs
== 0) {
377 yyerror("'update' undefined.");
380 if
(sp
->newplane_time
== 0) {
381 yyerror("'newplane' undefined.");