expr.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1989 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 * Ozan Yigit.
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 #ifndef lint
38 1.1 cgd static char sccsid[] = "@(#)expr.c 5.3 (Berkeley) 2/26/91";
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include <setjmp.h>
42 1.1 cgd #include <stdio.h>
43 1.1 cgd
44 1.1 cgd /*
45 1.1 cgd * expression evaluator: performs a standard recursive
46 1.1 cgd * descent parse to evaluate any expression permissible
47 1.1 cgd * within the following grammar:
48 1.1 cgd *
49 1.1 cgd * expr : query EOS
50 1.1 cgd * query : lor
51 1.1 cgd * | lor "?" query ":" query
52 1.1 cgd * lor : land { "||" land }
53 1.1 cgd * land : bor { "&&" bor }
54 1.1 cgd * bor : bxor { "|" bxor }
55 1.1 cgd * bxor : band { "^" band }
56 1.1 cgd * band : eql { "&" eql }
57 1.1 cgd * eql : relat { eqrel relat }
58 1.1 cgd * relat : shift { rel shift }
59 1.1 cgd * shift : primary { shop primary }
60 1.1 cgd * primary : term { addop term }
61 1.1 cgd * term : unary { mulop unary }
62 1.1 cgd * unary : factor
63 1.1 cgd * | unop unary
64 1.1 cgd * factor : constant
65 1.1 cgd * | "(" query ")"
66 1.1 cgd * constant: num
67 1.1 cgd * | "'" CHAR "'"
68 1.1 cgd * num : DIGIT
69 1.1 cgd * | DIGIT num
70 1.1 cgd * shop : "<<"
71 1.1 cgd * | ">>"
72 1.1 cgd * eqlrel : "="
73 1.1 cgd * | "=="
74 1.1 cgd * | "!="
75 1.1 cgd * rel : "<"
76 1.1 cgd * | ">"
77 1.1 cgd * | "<="
78 1.1 cgd * | ">="
79 1.1 cgd *
80 1.1 cgd *
81 1.1 cgd * This expression evaluator is lifted from a public-domain
82 1.1 cgd * C Pre-Processor included with the DECUS C Compiler distribution.
83 1.1 cgd * It is hacked somewhat to be suitable for m4.
84 1.1 cgd *
85 1.1 cgd * Originally by: Mike Lutz
86 1.1 cgd * Bob Harper
87 1.1 cgd */
88 1.1 cgd
89 1.1 cgd #define TRUE 1
90 1.1 cgd #define FALSE 0
91 1.1 cgd #define EOS (char) 0
92 1.1 cgd #define EQL 0
93 1.1 cgd #define NEQ 1
94 1.1 cgd #define LSS 2
95 1.1 cgd #define LEQ 3
96 1.1 cgd #define GTR 4
97 1.1 cgd #define GEQ 5
98 1.1 cgd #define OCTAL 8
99 1.1 cgd #define DECIMAL 10
100 1.1 cgd
101 1.1 cgd static char *nxtch; /* Parser scan pointer */
102 1.1 cgd
103 1.1 cgd /*
104 1.1 cgd * For longjmp
105 1.1 cgd */
106 1.1 cgd static jmp_buf expjump;
107 1.1 cgd
108 1.1 cgd /*
109 1.1 cgd * macros:
110 1.1 cgd *
111 1.1 cgd * ungetch - Put back the last character examined.
112 1.1 cgd * getch - return the next character from expr string.
113 1.1 cgd */
114 1.1 cgd #define ungetch() nxtch--
115 1.1 cgd #define getch() *nxtch++
116 1.1 cgd
117 1.1 cgd expr(expbuf)
118 1.1 cgd char *expbuf;
119 1.1 cgd {
120 1.1 cgd register int rval;
121 1.1 cgd
122 1.1 cgd nxtch = expbuf;
123 1.1 cgd if (setjmp(expjump) != 0)
124 1.1 cgd return (FALSE);
125 1.1 cgd rval = query();
126 1.1 cgd if (skipws() == EOS)
127 1.1 cgd return(rval);
128 1.1 cgd experr("Ill-formed expression");
129 1.1 cgd }
130 1.1 cgd
131 1.1 cgd /*
132 1.1 cgd * query : lor | lor '?' query ':' query
133 1.1 cgd *
134 1.1 cgd */
135 1.1 cgd query()
136 1.1 cgd {
137 1.1 cgd register int bool, true_val, false_val;
138 1.1 cgd
139 1.1 cgd bool = lor();
140 1.1 cgd if (skipws() != '?') {
141 1.1 cgd ungetch();
142 1.1 cgd return(bool);
143 1.1 cgd }
144 1.1 cgd
145 1.1 cgd true_val = query();
146 1.1 cgd if (skipws() != ':')
147 1.1 cgd experr("Bad query");
148 1.1 cgd
149 1.1 cgd false_val = query();
150 1.1 cgd return(bool ? true_val : false_val);
151 1.1 cgd }
152 1.1 cgd
153 1.1 cgd /*
154 1.1 cgd * lor : land { '||' land }
155 1.1 cgd *
156 1.1 cgd */
157 1.1 cgd lor()
158 1.1 cgd {
159 1.1 cgd register int c, vl, vr;
160 1.1 cgd
161 1.1 cgd vl = land();
162 1.1 cgd while ((c = skipws()) == '|' && getch() == '|') {
163 1.1 cgd vr = land();
164 1.1 cgd vl = vl || vr;
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd if (c == '|')
168 1.1 cgd ungetch();
169 1.1 cgd ungetch();
170 1.1 cgd return(vl);
171 1.1 cgd }
172 1.1 cgd
173 1.1 cgd /*
174 1.1 cgd * land : bor { '&&' bor }
175 1.1 cgd *
176 1.1 cgd */
177 1.1 cgd land()
178 1.1 cgd {
179 1.1 cgd register int c, vl, vr;
180 1.1 cgd
181 1.1 cgd vl = bor();
182 1.1 cgd while ((c = skipws()) == '&' && getch() == '&') {
183 1.1 cgd vr = bor();
184 1.1 cgd vl = vl && vr;
185 1.1 cgd }
186 1.1 cgd
187 1.1 cgd if (c == '&')
188 1.1 cgd ungetch();
189 1.1 cgd ungetch();
190 1.1 cgd return(vl);
191 1.1 cgd }
192 1.1 cgd
193 1.1 cgd /*
194 1.1 cgd * bor : bxor { '|' bxor }
195 1.1 cgd *
196 1.1 cgd */
197 1.1 cgd bor()
198 1.1 cgd {
199 1.1 cgd register int vl, vr, c;
200 1.1 cgd
201 1.1 cgd vl = bxor();
202 1.1 cgd while ((c = skipws()) == '|' && getch() != '|') {
203 1.1 cgd ungetch();
204 1.1 cgd vr = bxor();
205 1.1 cgd vl |= vr;
206 1.1 cgd }
207 1.1 cgd
208 1.1 cgd if (c == '|')
209 1.1 cgd ungetch();
210 1.1 cgd ungetch();
211 1.1 cgd return(vl);
212 1.1 cgd }
213 1.1 cgd
214 1.1 cgd /*
215 1.1 cgd * bxor : band { '^' band }
216 1.1 cgd *
217 1.1 cgd */
218 1.1 cgd bxor()
219 1.1 cgd {
220 1.1 cgd register int vl, vr;
221 1.1 cgd
222 1.1 cgd vl = band();
223 1.1 cgd while (skipws() == '^') {
224 1.1 cgd vr = band();
225 1.1 cgd vl ^= vr;
226 1.1 cgd }
227 1.1 cgd
228 1.1 cgd ungetch();
229 1.1 cgd return(vl);
230 1.1 cgd }
231 1.1 cgd
232 1.1 cgd /*
233 1.1 cgd * band : eql { '&' eql }
234 1.1 cgd *
235 1.1 cgd */
236 1.1 cgd band()
237 1.1 cgd {
238 1.1 cgd register int vl, vr, c;
239 1.1 cgd
240 1.1 cgd vl = eql();
241 1.1 cgd while ((c = skipws()) == '&' && getch() != '&') {
242 1.1 cgd ungetch();
243 1.1 cgd vr = eql();
244 1.1 cgd vl &= vr;
245 1.1 cgd }
246 1.1 cgd
247 1.1 cgd if (c == '&')
248 1.1 cgd ungetch();
249 1.1 cgd ungetch();
250 1.1 cgd return(vl);
251 1.1 cgd }
252 1.1 cgd
253 1.1 cgd /*
254 1.1 cgd * eql : relat { eqrel relat }
255 1.1 cgd *
256 1.1 cgd */
257 1.1 cgd eql()
258 1.1 cgd {
259 1.1 cgd register int vl, vr, rel;
260 1.1 cgd
261 1.1 cgd vl = relat();
262 1.1 cgd while ((rel = geteql()) != -1) {
263 1.1 cgd vr = relat();
264 1.1 cgd
265 1.1 cgd switch (rel) {
266 1.1 cgd
267 1.1 cgd case EQL:
268 1.1 cgd vl = (vl == vr);
269 1.1 cgd break;
270 1.1 cgd case NEQ:
271 1.1 cgd vl = (vl != vr);
272 1.1 cgd break;
273 1.1 cgd }
274 1.1 cgd }
275 1.1 cgd return(vl);
276 1.1 cgd }
277 1.1 cgd
278 1.1 cgd /*
279 1.1 cgd * relat : shift { rel shift }
280 1.1 cgd *
281 1.1 cgd */
282 1.1 cgd relat()
283 1.1 cgd {
284 1.1 cgd register int vl, vr, rel;
285 1.1 cgd
286 1.1 cgd vl = shift();
287 1.1 cgd while ((rel = getrel()) != -1) {
288 1.1 cgd
289 1.1 cgd vr = shift();
290 1.1 cgd switch (rel) {
291 1.1 cgd
292 1.1 cgd case LEQ:
293 1.1 cgd vl = (vl <= vr);
294 1.1 cgd break;
295 1.1 cgd case LSS:
296 1.1 cgd vl = (vl < vr);
297 1.1 cgd break;
298 1.1 cgd case GTR:
299 1.1 cgd vl = (vl > vr);
300 1.1 cgd break;
301 1.1 cgd case GEQ:
302 1.1 cgd vl = (vl >= vr);
303 1.1 cgd break;
304 1.1 cgd }
305 1.1 cgd }
306 1.1 cgd return(vl);
307 1.1 cgd }
308 1.1 cgd
309 1.1 cgd /*
310 1.1 cgd * shift : primary { shop primary }
311 1.1 cgd *
312 1.1 cgd */
313 1.1 cgd shift()
314 1.1 cgd {
315 1.1 cgd register int vl, vr, c;
316 1.1 cgd
317 1.1 cgd vl = primary();
318 1.1 cgd while (((c = skipws()) == '<' || c == '>') && c == getch()) {
319 1.1 cgd vr = primary();
320 1.1 cgd
321 1.1 cgd if (c == '<')
322 1.1 cgd vl <<= vr;
323 1.1 cgd else
324 1.1 cgd vl >>= vr;
325 1.1 cgd }
326 1.1 cgd
327 1.1 cgd if (c == '<' || c == '>')
328 1.1 cgd ungetch();
329 1.1 cgd ungetch();
330 1.1 cgd return(vl);
331 1.1 cgd }
332 1.1 cgd
333 1.1 cgd /*
334 1.1 cgd * primary : term { addop term }
335 1.1 cgd *
336 1.1 cgd */
337 1.1 cgd primary()
338 1.1 cgd {
339 1.1 cgd register int c, vl, vr;
340 1.1 cgd
341 1.1 cgd vl = term();
342 1.1 cgd while ((c = skipws()) == '+' || c == '-') {
343 1.1 cgd vr = term();
344 1.1 cgd if (c == '+')
345 1.1 cgd vl += vr;
346 1.1 cgd else
347 1.1 cgd vl -= vr;
348 1.1 cgd }
349 1.1 cgd
350 1.1 cgd ungetch();
351 1.1 cgd return(vl);
352 1.1 cgd }
353 1.1 cgd
354 1.1 cgd /*
355 1.1 cgd * <term> := <unary> { <mulop> <unary> }
356 1.1 cgd *
357 1.1 cgd */
358 1.1 cgd term()
359 1.1 cgd {
360 1.1 cgd register int c, vl, vr;
361 1.1 cgd
362 1.1 cgd vl = unary();
363 1.1 cgd while ((c = skipws()) == '*' || c == '/' || c == '%') {
364 1.1 cgd vr = unary();
365 1.1 cgd
366 1.1 cgd switch (c) {
367 1.1 cgd case '*':
368 1.1 cgd vl *= vr;
369 1.1 cgd break;
370 1.1 cgd case '/':
371 1.1 cgd vl /= vr;
372 1.1 cgd break;
373 1.1 cgd case '%':
374 1.1 cgd vl %= vr;
375 1.1 cgd break;
376 1.1 cgd }
377 1.1 cgd }
378 1.1 cgd ungetch();
379 1.1 cgd return(vl);
380 1.1 cgd }
381 1.1 cgd
382 1.1 cgd /*
383 1.1 cgd * unary : factor | unop unary
384 1.1 cgd *
385 1.1 cgd */
386 1.1 cgd unary()
387 1.1 cgd {
388 1.1 cgd register int val, c;
389 1.1 cgd
390 1.1 cgd if ((c = skipws()) == '!' || c == '~' || c == '-') {
391 1.1 cgd val = unary();
392 1.1 cgd
393 1.1 cgd switch (c) {
394 1.1 cgd case '!':
395 1.1 cgd return(! val);
396 1.1 cgd case '~':
397 1.1 cgd return(~ val);
398 1.1 cgd case '-':
399 1.1 cgd return(- val);
400 1.1 cgd }
401 1.1 cgd }
402 1.1 cgd
403 1.1 cgd ungetch();
404 1.1 cgd return(factor());
405 1.1 cgd }
406 1.1 cgd
407 1.1 cgd /*
408 1.1 cgd * factor : constant | '(' query ')'
409 1.1 cgd *
410 1.1 cgd */
411 1.1 cgd factor()
412 1.1 cgd {
413 1.1 cgd register int val;
414 1.1 cgd
415 1.1 cgd if (skipws() == '(') {
416 1.1 cgd val = query();
417 1.1 cgd if (skipws() != ')')
418 1.1 cgd experr("Bad factor");
419 1.1 cgd return(val);
420 1.1 cgd }
421 1.1 cgd
422 1.1 cgd ungetch();
423 1.1 cgd return(constant());
424 1.1 cgd }
425 1.1 cgd
426 1.1 cgd /*
427 1.1 cgd * constant: num | 'char'
428 1.1 cgd *
429 1.1 cgd */
430 1.1 cgd constant()
431 1.1 cgd {
432 1.1 cgd /*
433 1.1 cgd * Note: constant() handles multi-byte constants
434 1.1 cgd */
435 1.1 cgd
436 1.1 cgd register int i;
437 1.1 cgd register int value;
438 1.1 cgd register char c;
439 1.1 cgd int v[sizeof (int)];
440 1.1 cgd
441 1.1 cgd if (skipws() != '\'') {
442 1.1 cgd ungetch();
443 1.1 cgd return(num());
444 1.1 cgd }
445 1.1 cgd for (i = 0; i < sizeof(int); i++) {
446 1.1 cgd if ((c = getch()) == '\'') {
447 1.1 cgd ungetch();
448 1.1 cgd break;
449 1.1 cgd }
450 1.1 cgd if (c == '\\') {
451 1.1 cgd switch (c = getch()) {
452 1.1 cgd case '0':
453 1.1 cgd case '1':
454 1.1 cgd case '2':
455 1.1 cgd case '3':
456 1.1 cgd case '4':
457 1.1 cgd case '5':
458 1.1 cgd case '6':
459 1.1 cgd case '7':
460 1.1 cgd ungetch();
461 1.1 cgd c = num();
462 1.1 cgd break;
463 1.1 cgd case 'n':
464 1.1 cgd c = 012;
465 1.1 cgd break;
466 1.1 cgd case 'r':
467 1.1 cgd c = 015;
468 1.1 cgd break;
469 1.1 cgd case 't':
470 1.1 cgd c = 011;
471 1.1 cgd break;
472 1.1 cgd case 'b':
473 1.1 cgd c = 010;
474 1.1 cgd break;
475 1.1 cgd case 'f':
476 1.1 cgd c = 014;
477 1.1 cgd break;
478 1.1 cgd }
479 1.1 cgd }
480 1.1 cgd v[i] = c;
481 1.1 cgd }
482 1.1 cgd if (i == 0 || getch() != '\'')
483 1.1 cgd experr("Illegal character constant");
484 1.1 cgd for (value = 0; --i >= 0;) {
485 1.1 cgd value <<= 8;
486 1.1 cgd value += v[i];
487 1.1 cgd }
488 1.1 cgd return(value);
489 1.1 cgd }
490 1.1 cgd
491 1.1 cgd /*
492 1.1 cgd * num : digit | num digit
493 1.1 cgd *
494 1.1 cgd */
495 1.1 cgd num()
496 1.1 cgd {
497 1.1 cgd register int rval, c, base;
498 1.1 cgd int ndig;
499 1.1 cgd
500 1.1 cgd base = ((c = skipws()) == '0') ? OCTAL : DECIMAL;
501 1.1 cgd rval = 0;
502 1.1 cgd ndig = 0;
503 1.1 cgd while (c >= '0' && c <= (base == OCTAL ? '7' : '9')) {
504 1.1 cgd rval *= base;
505 1.1 cgd rval += (c - '0');
506 1.1 cgd c = getch();
507 1.1 cgd ndig++;
508 1.1 cgd }
509 1.1 cgd ungetch();
510 1.1 cgd if (ndig)
511 1.1 cgd return(rval);
512 1.1 cgd experr("Bad constant");
513 1.1 cgd }
514 1.1 cgd
515 1.1 cgd /*
516 1.1 cgd * eqlrel : '=' | '==' | '!='
517 1.1 cgd *
518 1.1 cgd */
519 1.1 cgd geteql()
520 1.1 cgd {
521 1.1 cgd register int c1, c2;
522 1.1 cgd
523 1.1 cgd c1 = skipws();
524 1.1 cgd c2 = getch();
525 1.1 cgd
526 1.1 cgd switch (c1) {
527 1.1 cgd
528 1.1 cgd case '=':
529 1.1 cgd if (c2 != '=')
530 1.1 cgd ungetch();
531 1.1 cgd return(EQL);
532 1.1 cgd
533 1.1 cgd case '!':
534 1.1 cgd if (c2 == '=')
535 1.1 cgd return(NEQ);
536 1.1 cgd ungetch();
537 1.1 cgd ungetch();
538 1.1 cgd return(-1);
539 1.1 cgd
540 1.1 cgd default:
541 1.1 cgd ungetch();
542 1.1 cgd ungetch();
543 1.1 cgd return(-1);
544 1.1 cgd }
545 1.1 cgd }
546 1.1 cgd
547 1.1 cgd /*
548 1.1 cgd * rel : '<' | '>' | '<=' | '>='
549 1.1 cgd *
550 1.1 cgd */
551 1.1 cgd getrel()
552 1.1 cgd {
553 1.1 cgd register int c1, c2;
554 1.1 cgd
555 1.1 cgd c1 = skipws();
556 1.1 cgd c2 = getch();
557 1.1 cgd
558 1.1 cgd switch (c1) {
559 1.1 cgd
560 1.1 cgd case '<':
561 1.1 cgd if (c2 == '=')
562 1.1 cgd return(LEQ);
563 1.1 cgd ungetch();
564 1.1 cgd return(LSS);
565 1.1 cgd
566 1.1 cgd case '>':
567 1.1 cgd if (c2 == '=')
568 1.1 cgd return(GEQ);
569 1.1 cgd ungetch();
570 1.1 cgd return(GTR);
571 1.1 cgd
572 1.1 cgd default:
573 1.1 cgd ungetch();
574 1.1 cgd ungetch();
575 1.1 cgd return(-1);
576 1.1 cgd }
577 1.1 cgd }
578 1.1 cgd
579 1.1 cgd /*
580 1.1 cgd * Skip over any white space and return terminating char.
581 1.1 cgd */
582 1.1 cgd skipws()
583 1.1 cgd {
584 1.1 cgd register char c;
585 1.1 cgd
586 1.1 cgd while ((c = getch()) <= ' ' && c > EOS)
587 1.1 cgd ;
588 1.1 cgd return(c);
589 1.1 cgd }
590 1.1 cgd
591 1.1 cgd /*
592 1.1 cgd * Error handler - resets environment to eval(), prints an error,
593 1.1 cgd * and returns FALSE.
594 1.1 cgd */
595 1.1 cgd experr(msg)
596 1.1 cgd char *msg;
597 1.1 cgd {
598 1.1 cgd printf("mp: %s\n",msg);
599 1.1 cgd longjmp(expjump, -1); /* Force eval() to return FALSE */
600 1.1 cgd }
601