grammar.y revision 1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1990 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Ed James.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd /*
38 1.1 cgd * Copyright (c) 1987 by Ed James, UC Berkeley. All rights reserved.
39 1.1 cgd *
40 1.1 cgd * Copy permission is hereby granted provided that this notice is
41 1.1 cgd * retained on all partial or complete copies.
42 1.1 cgd *
43 1.1 cgd * For more info on this and all of my stuff, mail edjames (at) berkeley.edu.
44 1.1 cgd */
45 1.1 cgd
46 1.1 cgd %token <ival> HeightOp
47 1.1 cgd %token <ival> WidthOp
48 1.1 cgd %token <ival> UpdateOp
49 1.1 cgd %token <ival> NewplaneOp
50 1.1 cgd %token <cval> DirOp
51 1.1 cgd %token <ival> ConstOp
52 1.1 cgd %token <ival> LineOp
53 1.1 cgd %token <ival> AirportOp
54 1.1 cgd %token <ival> BeaconOp
55 1.1 cgd %token <ival> ExitOp
56 1.1 cgd %union {
57 1.1 cgd int ival;
58 1.1 cgd char cval;
59 1.1 cgd }
60 1.1 cgd
61 1.1 cgd %{
62 1.1 cgd #include "include.h"
63 1.1 cgd
64 1.1 cgd #ifndef lint
65 1.1 cgd static char sccsid[] = "@(#)grammar.y 5.2 (Berkeley) 4/30/90";
66 1.1 cgd #endif /* not lint */
67 1.1 cgd
68 1.1 cgd int errors = 0;
69 1.1 cgd int line = 1;
70 1.1 cgd %}
71 1.1 cgd
72 1.1 cgd %%
73 1.1 cgd file:
74 1.1 cgd bunch_of_defs { if (checkdefs() < 0) return (errors); } bunch_of_lines
75 1.1 cgd {
76 1.1 cgd if (sp->num_exits + sp->num_airports < 2)
77 1.1 cgd yyerror("Need at least 2 airports and/or exits.");
78 1.1 cgd return (errors);
79 1.1 cgd }
80 1.1 cgd ;
81 1.1 cgd
82 1.1 cgd bunch_of_defs:
83 1.1 cgd def bunch_of_defs
84 1.1 cgd | def
85 1.1 cgd ;
86 1.1 cgd
87 1.1 cgd def:
88 1.1 cgd udef
89 1.1 cgd | ndef
90 1.1 cgd | wdef
91 1.1 cgd | hdef
92 1.1 cgd ;
93 1.1 cgd
94 1.1 cgd udef:
95 1.1 cgd UpdateOp '=' ConstOp ';'
96 1.1 cgd {
97 1.1 cgd if (sp->update_secs != 0)
98 1.1 cgd return (yyerror("Redefinition of 'update'."));
99 1.1 cgd else if ($3 < 1)
100 1.1 cgd return (yyerror("'update' is too small."));
101 1.1 cgd else
102 1.1 cgd sp->update_secs = $3;
103 1.1 cgd }
104 1.1 cgd ;
105 1.1 cgd
106 1.1 cgd ndef:
107 1.1 cgd NewplaneOp '=' ConstOp ';'
108 1.1 cgd {
109 1.1 cgd if (sp->newplane_time != 0)
110 1.1 cgd return (yyerror("Redefinition of 'newplane'."));
111 1.1 cgd else if ($3 < 1)
112 1.1 cgd return (yyerror("'newplane' is too small."));
113 1.1 cgd else
114 1.1 cgd sp->newplane_time = $3;
115 1.1 cgd }
116 1.1 cgd ;
117 1.1 cgd
118 1.1 cgd hdef:
119 1.1 cgd HeightOp '=' ConstOp ';'
120 1.1 cgd {
121 1.1 cgd if (sp->height != 0)
122 1.1 cgd return (yyerror("Redefinition of 'height'."));
123 1.1 cgd else if ($3 < 3)
124 1.1 cgd return (yyerror("'height' is too small."));
125 1.1 cgd else
126 1.1 cgd sp->height = $3;
127 1.1 cgd }
128 1.1 cgd ;
129 1.1 cgd
130 1.1 cgd wdef:
131 1.1 cgd WidthOp '=' ConstOp ';'
132 1.1 cgd {
133 1.1 cgd if (sp->height != 0)
134 1.1 cgd return (yyerror("Redefinition of 'width'."));
135 1.1 cgd else if ($3 < 3)
136 1.1 cgd return (yyerror("'width' is too small."));
137 1.1 cgd else
138 1.1 cgd sp->width = $3;
139 1.1 cgd }
140 1.1 cgd ;
141 1.1 cgd
142 1.1 cgd bunch_of_lines:
143 1.1 cgd line bunch_of_lines
144 1.1 cgd {}
145 1.1 cgd | line
146 1.1 cgd {}
147 1.1 cgd ;
148 1.1 cgd
149 1.1 cgd line:
150 1.1 cgd BeaconOp ':' Bpoint_list ';'
151 1.1 cgd {}
152 1.1 cgd | ExitOp ':' Epoint_list ';'
153 1.1 cgd {}
154 1.1 cgd | LineOp ':' Lline_list ';'
155 1.1 cgd {}
156 1.1 cgd | AirportOp ':' Apoint_list ';'
157 1.1 cgd {}
158 1.1 cgd ;
159 1.1 cgd
160 1.1 cgd Bpoint_list:
161 1.1 cgd Bpoint Bpoint_list
162 1.1 cgd {}
163 1.1 cgd | Bpoint
164 1.1 cgd {}
165 1.1 cgd ;
166 1.1 cgd
167 1.1 cgd Bpoint:
168 1.1 cgd '(' ConstOp ConstOp ')'
169 1.1 cgd {
170 1.1 cgd if (sp->num_beacons % REALLOC == 0) {
171 1.1 cgd if (sp->beacon == NULL)
172 1.1 cgd sp->beacon = (BEACON *) malloc((sp->num_beacons
173 1.1 cgd + REALLOC) * sizeof (BEACON));
174 1.1 cgd else
175 1.1 cgd sp->beacon = (BEACON *) realloc(sp->beacon,
176 1.1 cgd (sp->num_beacons + REALLOC) *
177 1.1 cgd sizeof (BEACON));
178 1.1 cgd if (sp->beacon == NULL)
179 1.1 cgd return (yyerror("No memory available."));
180 1.1 cgd }
181 1.1 cgd sp->beacon[sp->num_beacons].x = $2;
182 1.1 cgd sp->beacon[sp->num_beacons].y = $3;
183 1.1 cgd check_point($2, $3);
184 1.1 cgd sp->num_beacons++;
185 1.1 cgd }
186 1.1 cgd ;
187 1.1 cgd
188 1.1 cgd Epoint_list:
189 1.1 cgd Epoint Epoint_list
190 1.1 cgd {}
191 1.1 cgd | Epoint
192 1.1 cgd {}
193 1.1 cgd ;
194 1.1 cgd
195 1.1 cgd Epoint:
196 1.1 cgd '(' ConstOp ConstOp DirOp ')'
197 1.1 cgd {
198 1.1 cgd int dir;
199 1.1 cgd
200 1.1 cgd if (sp->num_exits % REALLOC == 0) {
201 1.1 cgd if (sp->exit == NULL)
202 1.1 cgd sp->exit = (EXIT *) malloc((sp->num_exits +
203 1.1 cgd REALLOC) * sizeof (EXIT));
204 1.1 cgd else
205 1.1 cgd sp->exit = (EXIT *) realloc(sp->exit,
206 1.1 cgd (sp->num_exits + REALLOC) *
207 1.1 cgd sizeof (EXIT));
208 1.1 cgd if (sp->exit == NULL)
209 1.1 cgd return (yyerror("No memory available."));
210 1.1 cgd }
211 1.1 cgd dir = dir_no($4);
212 1.1 cgd sp->exit[sp->num_exits].x = $2;
213 1.1 cgd sp->exit[sp->num_exits].y = $3;
214 1.1 cgd sp->exit[sp->num_exits].dir = dir;
215 1.1 cgd check_edge($2, $3);
216 1.1 cgd check_edir($2, $3, dir);
217 1.1 cgd sp->num_exits++;
218 1.1 cgd }
219 1.1 cgd ;
220 1.1 cgd
221 1.1 cgd Apoint_list:
222 1.1 cgd Apoint Apoint_list
223 1.1 cgd {}
224 1.1 cgd | Apoint
225 1.1 cgd {}
226 1.1 cgd ;
227 1.1 cgd
228 1.1 cgd Apoint:
229 1.1 cgd '(' ConstOp ConstOp DirOp ')'
230 1.1 cgd {
231 1.1 cgd int dir;
232 1.1 cgd
233 1.1 cgd if (sp->num_airports % REALLOC == 0) {
234 1.1 cgd if (sp->airport == NULL)
235 1.1 cgd sp->airport=(AIRPORT *)malloc((sp->num_airports
236 1.1 cgd + REALLOC) * sizeof(AIRPORT));
237 1.1 cgd else
238 1.1 cgd sp->airport = (AIRPORT *) realloc(sp->airport,
239 1.1 cgd (sp->num_airports + REALLOC) *
240 1.1 cgd sizeof(AIRPORT));
241 1.1 cgd if (sp->airport == NULL)
242 1.1 cgd return (yyerror("No memory available."));
243 1.1 cgd }
244 1.1 cgd dir = dir_no($4);
245 1.1 cgd sp->airport[sp->num_airports].x = $2;
246 1.1 cgd sp->airport[sp->num_airports].y = $3;
247 1.1 cgd sp->airport[sp->num_airports].dir = dir;
248 1.1 cgd check_point($2, $3);
249 1.1 cgd check_adir($2, $3, dir);
250 1.1 cgd sp->num_airports++;
251 1.1 cgd }
252 1.1 cgd ;
253 1.1 cgd
254 1.1 cgd Lline_list:
255 1.1 cgd Lline Lline_list
256 1.1 cgd {}
257 1.1 cgd | Lline
258 1.1 cgd {}
259 1.1 cgd ;
260 1.1 cgd
261 1.1 cgd Lline:
262 1.1 cgd '[' '(' ConstOp ConstOp ')' '(' ConstOp ConstOp ')' ']'
263 1.1 cgd {
264 1.1 cgd if (sp->num_lines % REALLOC == 0) {
265 1.1 cgd if (sp->line == NULL)
266 1.1 cgd sp->line = (LINE *) malloc((sp->num_lines +
267 1.1 cgd REALLOC) * sizeof (LINE));
268 1.1 cgd else
269 1.1 cgd sp->line = (LINE *) realloc(sp->line,
270 1.1 cgd (sp->num_lines + REALLOC) *
271 1.1 cgd sizeof (LINE));
272 1.1 cgd if (sp->line == NULL)
273 1.1 cgd return (yyerror("No memory available."));
274 1.1 cgd }
275 1.1 cgd sp->line[sp->num_lines].p1.x = $3;
276 1.1 cgd sp->line[sp->num_lines].p1.y = $4;
277 1.1 cgd sp->line[sp->num_lines].p2.x = $7;
278 1.1 cgd sp->line[sp->num_lines].p2.y = $8;
279 1.1 cgd check_line($3, $4, $7, $8);
280 1.1 cgd sp->num_lines++;
281 1.1 cgd }
282 1.1 cgd ;
283 1.1 cgd %%
284 1.1 cgd
285 1.1 cgd check_edge(x, y)
286 1.1 cgd {
287 1.1 cgd if (!(x == 0) && !(x == sp->width - 1) &&
288 1.1 cgd !(y == 0) && !(y == sp->height - 1))
289 1.1 cgd yyerror("edge value not on edge.");
290 1.1 cgd }
291 1.1 cgd
292 1.1 cgd check_point(x, y)
293 1.1 cgd {
294 1.1 cgd if (x < 1 || x >= sp->width - 1)
295 1.1 cgd yyerror("X value out of range.");
296 1.1 cgd if (y < 1 || y >= sp->height - 1)
297 1.1 cgd yyerror("Y value out of range.");
298 1.1 cgd }
299 1.1 cgd
300 1.1 cgd check_linepoint(x, y)
301 1.1 cgd {
302 1.1 cgd if (x < 0 || x >= sp->width)
303 1.1 cgd yyerror("X value out of range.");
304 1.1 cgd if (y < 0 || y >= sp->height)
305 1.1 cgd yyerror("Y value out of range.");
306 1.1 cgd }
307 1.1 cgd
308 1.1 cgd check_line(x1, y1, x2, y2)
309 1.1 cgd {
310 1.1 cgd int d1, d2;
311 1.1 cgd
312 1.1 cgd check_linepoint(x1, y1);
313 1.1 cgd check_linepoint(x2, y2);
314 1.1 cgd
315 1.1 cgd d1 = ABS(x2 - x1);
316 1.1 cgd d2 = ABS(y2 - y1);
317 1.1 cgd
318 1.1 cgd if (!(d1 == d2) && !(d1 == 0) && !(d2 == 0))
319 1.1 cgd yyerror("Bad line endpoints.");
320 1.1 cgd }
321 1.1 cgd
322 1.1 cgd yyerror(s)
323 1.1 cgd {
324 1.1 cgd fprintf(stderr, "\"%s\": line %d: %s\n", file, line, s);
325 1.1 cgd errors++;
326 1.1 cgd
327 1.1 cgd return (errors);
328 1.1 cgd }
329 1.1 cgd
330 1.1 cgd check_edir(x, y, dir)
331 1.1 cgd {
332 1.1 cgd int bad = 0;
333 1.1 cgd
334 1.1 cgd if (x == sp->width - 1)
335 1.1 cgd x = 2;
336 1.1 cgd else if (x != 0)
337 1.1 cgd x = 1;
338 1.1 cgd if (y == sp->height - 1)
339 1.1 cgd y = 2;
340 1.1 cgd else if (y != 0)
341 1.1 cgd y = 1;
342 1.1 cgd
343 1.1 cgd switch (x * 10 + y) {
344 1.1 cgd case 00: if (dir != 3) bad++; break;
345 1.1 cgd case 01: if (dir < 1 || dir > 3) bad++; break;
346 1.1 cgd case 02: if (dir != 1) bad++; break;
347 1.1 cgd case 10: if (dir < 3 || dir > 5) bad++; break;
348 1.1 cgd case 11: break;
349 1.1 cgd case 12: if (dir > 1 && dir < 7) bad++; break;
350 1.1 cgd case 20: if (dir != 5) bad++; break;
351 1.1 cgd case 21: if (dir < 5) bad++; break;
352 1.1 cgd case 22: if (dir != 7) bad++; break;
353 1.1 cgd default:
354 1.1 cgd yyerror("Unknown value in checkdir! Get help!");
355 1.1 cgd break;
356 1.1 cgd }
357 1.1 cgd if (bad)
358 1.1 cgd yyerror("Bad direction for entrance at exit.");
359 1.1 cgd }
360 1.1 cgd
361 1.1 cgd check_adir(x, y, dir)
362 1.1 cgd {
363 1.1 cgd }
364 1.1 cgd
365 1.1 cgd checkdefs()
366 1.1 cgd {
367 1.1 cgd int err = 0;
368 1.1 cgd
369 1.1 cgd if (sp->width == 0) {
370 1.1 cgd yyerror("'width' undefined.");
371 1.1 cgd err++;
372 1.1 cgd }
373 1.1 cgd if (sp->height == 0) {
374 1.1 cgd yyerror("'height' undefined.");
375 1.1 cgd err++;
376 1.1 cgd }
377 1.1 cgd if (sp->update_secs == 0) {
378 1.1 cgd yyerror("'update' undefined.");
379 1.1 cgd err++;
380 1.1 cgd }
381 1.1 cgd if (sp->newplane_time == 0) {
382 1.1 cgd yyerror("'newplane' undefined.");
383 1.1 cgd err++;
384 1.1 cgd }
385 1.1 cgd if (err)
386 1.1 cgd return (-1);
387 1.1 cgd else
388 1.1 cgd return (0);
389 1.1 cgd }
390