b00af97d503c7a40eebadd9c21eabf5915cffbf7
[binutils-gdb.git] / gdb / m2-exp.y
1 /* YACC grammar for Modula-2 expressions, for GDB.
2 Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc.
3 Generated from expread.y (now c-exp.y) and contributed by the Department
4 of Computer Science at the State University of New York at Buffalo, 1991.
5
6 This file is part of GDB.
7
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
12
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
21
22 /* Parse a Modula-2 expression from text in a string,
23 and return the result as a struct expression pointer.
24 That structure contains arithmetic operations in reverse polish,
25 with constants represented by operations that are followed by special data.
26 See expression.h for the details of the format.
27 What is important here is that it can be built up sequentially
28 during the process of parsing; the lower levels of the tree always
29 come first in the result.
30
31 Note that malloc's and realloc's in this file are transformed to
32 xmalloc and xrealloc respectively by the same sed command in the
33 makefile that remaps any other malloc/realloc inserted by the parser
34 generator. Doing this with #defines and trying to control the interaction
35 with include files (<malloc.h> and <stdlib.h> for example) just became
36 too messy, particularly when such includes can be inserted at random
37 times by the parser generator. */
38
39 %{
40
41 #include "defs.h"
42 #include "expression.h"
43 #include "language.h"
44 #include "value.h"
45 #include "parser-defs.h"
46 #include "m2-lang.h"
47
48 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
49 as well as gratuitiously global symbol names, so we can have multiple
50 yacc generated parsers in gdb. Note that these are only the variables
51 produced by yacc. If other parser generators (bison, byacc, etc) produce
52 additional global names that conflict at link time, then those parser
53 generators need to be fixed instead of adding those names to this list. */
54
55 #define yymaxdepth m2_maxdepth
56 #define yyparse m2_parse
57 #define yylex m2_lex
58 #define yyerror m2_error
59 #define yylval m2_lval
60 #define yychar m2_char
61 #define yydebug m2_debug
62 #define yypact m2_pact
63 #define yyr1 m2_r1
64 #define yyr2 m2_r2
65 #define yydef m2_def
66 #define yychk m2_chk
67 #define yypgo m2_pgo
68 #define yyact m2_act
69 #define yyexca m2_exca
70 #define yyerrflag m2_errflag
71 #define yynerrs m2_nerrs
72 #define yyps m2_ps
73 #define yypv m2_pv
74 #define yys m2_s
75 #define yy_yys m2_yys
76 #define yystate m2_state
77 #define yytmp m2_tmp
78 #define yyv m2_v
79 #define yy_yyv m2_yyv
80 #define yyval m2_val
81 #define yylloc m2_lloc
82 #define yyreds m2_reds /* With YYDEBUG defined */
83 #define yytoks m2_toks /* With YYDEBUG defined */
84
85 #ifndef YYDEBUG
86 #define YYDEBUG 0 /* Default to no yydebug support */
87 #endif
88
89 int
90 yyparse PARAMS ((void));
91
92 static int
93 yylex PARAMS ((void));
94
95 void
96 yyerror PARAMS ((char *));
97
98 #if 0
99 static char *
100 make_qualname PARAMS ((char *, char *));
101 #endif
102
103 static int
104 parse_number PARAMS ((int));
105
106 /* The sign of the number being parsed. */
107 static int number_sign = 1;
108
109 /* The block that the module specified by the qualifer on an identifer is
110 contained in, */
111 #if 0
112 static struct block *modblock=0;
113 #endif
114
115 %}
116
117 /* Although the yacc "value" of an expression is not used,
118 since the result is stored in the structure being created,
119 other node types do have values. */
120
121 %union
122 {
123 LONGEST lval;
124 unsigned LONGEST ulval;
125 double dval;
126 struct symbol *sym;
127 struct type *tval;
128 struct stoken sval;
129 int voidval;
130 struct block *bval;
131 enum exp_opcode opcode;
132 struct internalvar *ivar;
133
134 struct type **tvec;
135 int *ivec;
136 }
137
138 %type <voidval> exp type_exp start set
139 %type <voidval> variable
140 %type <tval> type
141 %type <bval> block
142 %type <sym> fblock
143
144 %token <lval> INT HEX ERROR
145 %token <ulval> UINT M2_TRUE M2_FALSE CHAR
146 %token <dval> FLOAT
147
148 /* Both NAME and TYPENAME tokens represent symbols in the input,
149 and both convey their data as strings.
150 But a TYPENAME is a string that happens to be defined as a typedef
151 or builtin type name (such as int or char)
152 and a NAME is any other symbol.
153
154 Contexts where this distinction is not important can use the
155 nonterminal "name", which matches either NAME or TYPENAME. */
156
157 %token <sval> STRING
158 %token <sval> NAME BLOCKNAME IDENT VARNAME
159 %token <sval> TYPENAME
160
161 %token SIZE CAP ORD HIGH ABS MIN_FUNC MAX_FUNC FLOAT_FUNC VAL CHR ODD TRUNC
162 %token INC DEC INCL EXCL
163
164 /* The GDB scope operator */
165 %token COLONCOLON
166
167 %token <lval> LAST REGNAME
168
169 %token <ivar> INTERNAL_VAR
170
171 /* M2 tokens */
172 %left ','
173 %left ABOVE_COMMA
174 %nonassoc ASSIGN
175 %left '<' '>' LEQ GEQ '=' NOTEQUAL '#' IN
176 %left OROR
177 %left LOGICAL_AND '&'
178 %left '@'
179 %left '+' '-'
180 %left '*' '/' DIV MOD
181 %right UNARY
182 %right '^' DOT '[' '('
183 %right NOT '~'
184 %left COLONCOLON QID
185 /* This is not an actual token ; it is used for precedence.
186 %right QID
187 */
188
189 \f
190 %%
191
192 start : exp
193 | type_exp
194 ;
195
196 type_exp: type
197 { write_exp_elt_opcode(OP_TYPE);
198 write_exp_elt_type($1);
199 write_exp_elt_opcode(OP_TYPE);
200 }
201 ;
202
203 /* Expressions */
204
205 exp : exp '^' %prec UNARY
206 { write_exp_elt_opcode (UNOP_IND); }
207
208 exp : '-'
209 { number_sign = -1; }
210 exp %prec UNARY
211 { number_sign = 1;
212 write_exp_elt_opcode (UNOP_NEG); }
213 ;
214
215 exp : '+' exp %prec UNARY
216 { write_exp_elt_opcode(UNOP_PLUS); }
217 ;
218
219 exp : not_exp exp %prec UNARY
220 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
221 ;
222
223 not_exp : NOT
224 | '~'
225 ;
226
227 exp : CAP '(' exp ')'
228 { write_exp_elt_opcode (UNOP_CAP); }
229 ;
230
231 exp : ORD '(' exp ')'
232 { write_exp_elt_opcode (UNOP_ORD); }
233 ;
234
235 exp : ABS '(' exp ')'
236 { write_exp_elt_opcode (UNOP_ABS); }
237 ;
238
239 exp : HIGH '(' exp ')'
240 { write_exp_elt_opcode (UNOP_HIGH); }
241 ;
242
243 exp : MIN_FUNC '(' type ')'
244 { write_exp_elt_opcode (UNOP_MIN);
245 write_exp_elt_type ($3);
246 write_exp_elt_opcode (UNOP_MIN); }
247 ;
248
249 exp : MAX_FUNC '(' type ')'
250 { write_exp_elt_opcode (UNOP_MAX);
251 write_exp_elt_type ($3);
252 write_exp_elt_opcode (UNOP_MIN); }
253 ;
254
255 exp : FLOAT_FUNC '(' exp ')'
256 { write_exp_elt_opcode (UNOP_FLOAT); }
257 ;
258
259 exp : VAL '(' type ',' exp ')'
260 { write_exp_elt_opcode (BINOP_VAL);
261 write_exp_elt_type ($3);
262 write_exp_elt_opcode (BINOP_VAL); }
263 ;
264
265 exp : CHR '(' exp ')'
266 { write_exp_elt_opcode (UNOP_CHR); }
267 ;
268
269 exp : ODD '(' exp ')'
270 { write_exp_elt_opcode (UNOP_ODD); }
271 ;
272
273 exp : TRUNC '(' exp ')'
274 { write_exp_elt_opcode (UNOP_TRUNC); }
275 ;
276
277 exp : SIZE exp %prec UNARY
278 { write_exp_elt_opcode (UNOP_SIZEOF); }
279 ;
280
281
282 exp : INC '(' exp ')'
283 { write_exp_elt_opcode(UNOP_PREINCREMENT); }
284 ;
285
286 exp : INC '(' exp ',' exp ')'
287 { write_exp_elt_opcode(BINOP_ASSIGN_MODIFY);
288 write_exp_elt_opcode(BINOP_ADD);
289 write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); }
290 ;
291
292 exp : DEC '(' exp ')'
293 { write_exp_elt_opcode(UNOP_PREDECREMENT);}
294 ;
295
296 exp : DEC '(' exp ',' exp ')'
297 { write_exp_elt_opcode(BINOP_ASSIGN_MODIFY);
298 write_exp_elt_opcode(BINOP_SUB);
299 write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); }
300 ;
301
302 exp : exp DOT NAME
303 { write_exp_elt_opcode (STRUCTOP_STRUCT);
304 write_exp_string ($3);
305 write_exp_elt_opcode (STRUCTOP_STRUCT); }
306 ;
307
308 exp : set
309 ;
310
311 exp : exp IN set
312 { error("Sets are not implemented.");}
313 ;
314
315 exp : INCL '(' exp ',' exp ')'
316 { error("Sets are not implemented.");}
317 ;
318
319 exp : EXCL '(' exp ',' exp ')'
320 { error("Sets are not implemented.");}
321
322 set : '{' arglist '}'
323 { error("Sets are not implemented.");}
324 | type '{' arglist '}'
325 { error("Sets are not implemented.");}
326 ;
327
328
329 /* Modula-2 array subscript notation [a,b,c...] */
330 exp : exp '['
331 /* This function just saves the number of arguments
332 that follow in the list. It is *not* specific to
333 function types */
334 { start_arglist(); }
335 non_empty_arglist ']' %prec DOT
336 { write_exp_elt_opcode (MULTI_SUBSCRIPT);
337 write_exp_elt_longcst ((LONGEST) end_arglist());
338 write_exp_elt_opcode (MULTI_SUBSCRIPT); }
339 ;
340
341 exp : exp '('
342 /* This is to save the value of arglist_len
343 being accumulated by an outer function call. */
344 { start_arglist (); }
345 arglist ')' %prec DOT
346 { write_exp_elt_opcode (OP_FUNCALL);
347 write_exp_elt_longcst ((LONGEST) end_arglist ());
348 write_exp_elt_opcode (OP_FUNCALL); }
349 ;
350
351 arglist :
352 ;
353
354 arglist : exp
355 { arglist_len = 1; }
356 ;
357
358 arglist : arglist ',' exp %prec ABOVE_COMMA
359 { arglist_len++; }
360 ;
361
362 non_empty_arglist
363 : exp
364 { arglist_len = 1; }
365 ;
366
367 non_empty_arglist
368 : non_empty_arglist ',' exp %prec ABOVE_COMMA
369 { arglist_len++; }
370 ;
371
372 /* GDB construct */
373 exp : '{' type '}' exp %prec UNARY
374 { write_exp_elt_opcode (UNOP_MEMVAL);
375 write_exp_elt_type ($2);
376 write_exp_elt_opcode (UNOP_MEMVAL); }
377 ;
378
379 exp : type '(' exp ')' %prec UNARY
380 { write_exp_elt_opcode (UNOP_CAST);
381 write_exp_elt_type ($1);
382 write_exp_elt_opcode (UNOP_CAST); }
383 ;
384
385 exp : '(' exp ')'
386 { }
387 ;
388
389 /* Binary operators in order of decreasing precedence. Note that some
390 of these operators are overloaded! (ie. sets) */
391
392 /* GDB construct */
393 exp : exp '@' exp
394 { write_exp_elt_opcode (BINOP_REPEAT); }
395 ;
396
397 exp : exp '*' exp
398 { write_exp_elt_opcode (BINOP_MUL); }
399 ;
400
401 exp : exp '/' exp
402 { write_exp_elt_opcode (BINOP_DIV); }
403 ;
404
405 exp : exp DIV exp
406 { write_exp_elt_opcode (BINOP_INTDIV); }
407 ;
408
409 exp : exp MOD exp
410 { write_exp_elt_opcode (BINOP_REM); }
411 ;
412
413 exp : exp '+' exp
414 { write_exp_elt_opcode (BINOP_ADD); }
415 ;
416
417 exp : exp '-' exp
418 { write_exp_elt_opcode (BINOP_SUB); }
419 ;
420
421 exp : exp '=' exp
422 { write_exp_elt_opcode (BINOP_EQUAL); }
423 ;
424
425 exp : exp NOTEQUAL exp
426 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
427 | exp '#' exp
428 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
429 ;
430
431 exp : exp LEQ exp
432 { write_exp_elt_opcode (BINOP_LEQ); }
433 ;
434
435 exp : exp GEQ exp
436 { write_exp_elt_opcode (BINOP_GEQ); }
437 ;
438
439 exp : exp '<' exp
440 { write_exp_elt_opcode (BINOP_LESS); }
441 ;
442
443 exp : exp '>' exp
444 { write_exp_elt_opcode (BINOP_GTR); }
445 ;
446
447 exp : exp LOGICAL_AND exp
448 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
449 ;
450
451 exp : exp OROR exp
452 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
453 ;
454
455 exp : exp ASSIGN exp
456 { write_exp_elt_opcode (BINOP_ASSIGN); }
457 ;
458
459
460 /* Constants */
461
462 exp : M2_TRUE
463 { write_exp_elt_opcode (OP_BOOL);
464 write_exp_elt_longcst ((LONGEST) $1);
465 write_exp_elt_opcode (OP_BOOL); }
466 ;
467
468 exp : M2_FALSE
469 { write_exp_elt_opcode (OP_BOOL);
470 write_exp_elt_longcst ((LONGEST) $1);
471 write_exp_elt_opcode (OP_BOOL); }
472 ;
473
474 exp : INT
475 { write_exp_elt_opcode (OP_LONG);
476 write_exp_elt_type (builtin_type_m2_int);
477 write_exp_elt_longcst ((LONGEST) $1);
478 write_exp_elt_opcode (OP_LONG); }
479 ;
480
481 exp : UINT
482 {
483 write_exp_elt_opcode (OP_LONG);
484 write_exp_elt_type (builtin_type_m2_card);
485 write_exp_elt_longcst ((LONGEST) $1);
486 write_exp_elt_opcode (OP_LONG);
487 }
488 ;
489
490 exp : CHAR
491 { write_exp_elt_opcode (OP_LONG);
492 write_exp_elt_type (builtin_type_m2_char);
493 write_exp_elt_longcst ((LONGEST) $1);
494 write_exp_elt_opcode (OP_LONG); }
495 ;
496
497
498 exp : FLOAT
499 { write_exp_elt_opcode (OP_DOUBLE);
500 write_exp_elt_type (builtin_type_m2_real);
501 write_exp_elt_dblcst ($1);
502 write_exp_elt_opcode (OP_DOUBLE); }
503 ;
504
505 exp : variable
506 ;
507
508 /* The GDB internal variable $$, et al. */
509 exp : LAST
510 { write_exp_elt_opcode (OP_LAST);
511 write_exp_elt_longcst ((LONGEST) $1);
512 write_exp_elt_opcode (OP_LAST); }
513 ;
514
515 exp : REGNAME
516 { write_exp_elt_opcode (OP_REGISTER);
517 write_exp_elt_longcst ((LONGEST) $1);
518 write_exp_elt_opcode (OP_REGISTER); }
519 ;
520
521 exp : SIZE '(' type ')' %prec UNARY
522 { write_exp_elt_opcode (OP_LONG);
523 write_exp_elt_type (builtin_type_int);
524 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
525 write_exp_elt_opcode (OP_LONG); }
526 ;
527
528 exp : STRING
529 { write_exp_elt_opcode (OP_M2_STRING);
530 write_exp_string ($1);
531 write_exp_elt_opcode (OP_M2_STRING); }
532 ;
533
534 /* This will be used for extensions later. Like adding modules. */
535 block : fblock
536 { $$ = SYMBOL_BLOCK_VALUE($1); }
537 ;
538
539 fblock : BLOCKNAME
540 { struct symbol *sym
541 = lookup_symbol (copy_name ($1), expression_context_block,
542 VAR_NAMESPACE, 0, NULL);
543 $$ = sym;}
544 ;
545
546
547 /* GDB scope operator */
548 fblock : block COLONCOLON BLOCKNAME
549 { struct symbol *tem
550 = lookup_symbol (copy_name ($3), $1,
551 VAR_NAMESPACE, 0, NULL);
552 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
553 error ("No function \"%s\" in specified context.",
554 copy_name ($3));
555 $$ = tem;
556 }
557 ;
558
559 /* Useful for assigning to PROCEDURE variables */
560 variable: fblock
561 { write_exp_elt_opcode(OP_VAR_VALUE);
562 write_exp_elt_block (NULL);
563 write_exp_elt_sym ($1);
564 write_exp_elt_opcode (OP_VAR_VALUE); }
565 ;
566
567 /* GDB internal ($foo) variable */
568 variable: INTERNAL_VAR
569 { write_exp_elt_opcode (OP_INTERNALVAR);
570 write_exp_elt_intern ($1);
571 write_exp_elt_opcode (OP_INTERNALVAR); }
572 ;
573
574 /* GDB scope operator */
575 variable: block COLONCOLON NAME
576 { struct symbol *sym;
577 sym = lookup_symbol (copy_name ($3), $1,
578 VAR_NAMESPACE, 0, NULL);
579 if (sym == 0)
580 error ("No symbol \"%s\" in specified context.",
581 copy_name ($3));
582
583 write_exp_elt_opcode (OP_VAR_VALUE);
584 /* block_found is set by lookup_symbol. */
585 write_exp_elt_block (block_found);
586 write_exp_elt_sym (sym);
587 write_exp_elt_opcode (OP_VAR_VALUE); }
588 ;
589
590 /* Base case for variables. */
591 variable: NAME
592 { struct symbol *sym;
593 int is_a_field_of_this;
594
595 sym = lookup_symbol (copy_name ($1),
596 expression_context_block,
597 VAR_NAMESPACE,
598 &is_a_field_of_this,
599 NULL);
600 if (sym)
601 {
602 switch (sym->class)
603 {
604 case LOC_REGISTER:
605 case LOC_ARG:
606 case LOC_LOCAL:
607 case LOC_REF_ARG:
608 case LOC_REGPARM:
609 case LOC_LOCAL_ARG:
610 if (innermost_block == 0 ||
611 contained_in (block_found,
612 innermost_block))
613 innermost_block = block_found;
614 break;
615
616 case LOC_UNDEF:
617 case LOC_CONST:
618 case LOC_STATIC:
619 case LOC_TYPEDEF:
620 case LOC_LABEL: /* maybe should go above? */
621 case LOC_BLOCK:
622 case LOC_CONST_BYTES:
623 case LOC_OPTIMIZED_OUT:
624 /* These are listed so gcc -Wall will reveal
625 un-handled cases. */
626 break;
627 }
628 write_exp_elt_opcode (OP_VAR_VALUE);
629 /* We want to use the selected frame, not
630 another more inner frame which happens to
631 be in the same block. */
632 write_exp_elt_block (NULL);
633 write_exp_elt_sym (sym);
634 write_exp_elt_opcode (OP_VAR_VALUE);
635 }
636 else
637 {
638 struct minimal_symbol *msymbol;
639 register char *arg = copy_name ($1);
640
641 msymbol = lookup_minimal_symbol (arg,
642 (struct objfile *) NULL);
643 if (msymbol != NULL)
644 {
645 write_exp_elt_opcode (OP_LONG);
646 write_exp_elt_type (builtin_type_int);
647 write_exp_elt_longcst ((LONGEST) SYMBOL_VALUE_ADDRESS (msymbol));
648 write_exp_elt_opcode (OP_LONG);
649 write_exp_elt_opcode (UNOP_MEMVAL);
650 if (msymbol -> type == mst_data ||
651 msymbol -> type == mst_bss)
652 write_exp_elt_type (builtin_type_int);
653 else if (msymbol -> type == mst_text)
654 write_exp_elt_type (lookup_function_type (builtin_type_int));
655 else
656 write_exp_elt_type (builtin_type_char);
657 write_exp_elt_opcode (UNOP_MEMVAL);
658 }
659 else if (!have_full_symbols () && !have_partial_symbols ())
660 error ("No symbol table is loaded. Use the \"symbol-file\" command.");
661 else
662 error ("No symbol \"%s\" in current context.",
663 copy_name ($1));
664 }
665 }
666 ;
667
668 type
669 : TYPENAME
670 { $$ = lookup_typename (copy_name ($1),
671 expression_context_block, 0); }
672
673 ;
674
675 %%
676
677 #if 0 /* FIXME! */
678 int
679 overflow(a,b)
680 long a,b;
681 {
682 return (MAX_OF_TYPE(builtin_type_m2_int) - b) < a;
683 }
684
685 int
686 uoverflow(a,b)
687 unsigned long a,b;
688 {
689 return (MAX_OF_TYPE(builtin_type_m2_card) - b) < a;
690 }
691 #endif /* FIXME */
692
693 /* Take care of parsing a number (anything that starts with a digit).
694 Set yylval and return the token type; update lexptr.
695 LEN is the number of characters in it. */
696
697 /*** Needs some error checking for the float case ***/
698
699 static int
700 parse_number (olen)
701 int olen;
702 {
703 register char *p = lexptr;
704 register LONGEST n = 0;
705 register LONGEST prevn = 0;
706 register int c,i,ischar=0;
707 register int base = input_radix;
708 register int len = olen;
709 int unsigned_p = number_sign == 1 ? 1 : 0;
710
711 if(p[len-1] == 'H')
712 {
713 base = 16;
714 len--;
715 }
716 else if(p[len-1] == 'C' || p[len-1] == 'B')
717 {
718 base = 8;
719 ischar = p[len-1] == 'C';
720 len--;
721 }
722
723 /* Scan the number */
724 for (c = 0; c < len; c++)
725 {
726 if (p[c] == '.' && base == 10)
727 {
728 /* It's a float since it contains a point. */
729 yylval.dval = atof (p);
730 lexptr += len;
731 return FLOAT;
732 }
733 if (p[c] == '.' && base != 10)
734 error("Floating point numbers must be base 10.");
735 if (base == 10 && (p[c] < '0' || p[c] > '9'))
736 error("Invalid digit \'%c\' in number.",p[c]);
737 }
738
739 while (len-- > 0)
740 {
741 c = *p++;
742 n *= base;
743 if( base == 8 && (c == '8' || c == '9'))
744 error("Invalid digit \'%c\' in octal number.",c);
745 if (c >= '0' && c <= '9')
746 i = c - '0';
747 else
748 {
749 if (base == 16 && c >= 'A' && c <= 'F')
750 i = c - 'A' + 10;
751 else
752 return ERROR;
753 }
754 n+=i;
755 if(i >= base)
756 return ERROR;
757 if(!unsigned_p && number_sign == 1 && (prevn >= n))
758 unsigned_p=1; /* Try something unsigned */
759 /* Don't do the range check if n==i and i==0, since that special
760 case will give an overflow error. */
761 if(RANGE_CHECK && n!=i && i)
762 {
763 if((unsigned_p && (unsigned)prevn >= (unsigned)n) ||
764 ((!unsigned_p && number_sign==-1) && -prevn <= -n))
765 range_error("Overflow on numeric constant.");
766 }
767 prevn=n;
768 }
769
770 lexptr = p;
771 if(*p == 'B' || *p == 'C' || *p == 'H')
772 lexptr++; /* Advance past B,C or H */
773
774 if (ischar)
775 {
776 yylval.ulval = n;
777 return CHAR;
778 }
779 else if ( unsigned_p && number_sign == 1)
780 {
781 yylval.ulval = n;
782 return UINT;
783 }
784 else if((unsigned_p && (n<0))) {
785 range_error("Overflow on numeric constant -- number too large.");
786 /* But, this can return if range_check == range_warn. */
787 }
788 yylval.lval = n;
789 return INT;
790 }
791
792
793 /* Some tokens */
794
795 static struct
796 {
797 char name[2];
798 int token;
799 } tokentab2[] =
800 {
801 { {'<', '>'}, NOTEQUAL },
802 { {':', '='}, ASSIGN },
803 { {'<', '='}, LEQ },
804 { {'>', '='}, GEQ },
805 { {':', ':'}, COLONCOLON },
806
807 };
808
809 /* Some specific keywords */
810
811 struct keyword {
812 char keyw[10];
813 int token;
814 };
815
816 static struct keyword keytab[] =
817 {
818 {"OR" , OROR },
819 {"IN", IN },/* Note space after IN */
820 {"AND", LOGICAL_AND},
821 {"ABS", ABS },
822 {"CHR", CHR },
823 {"DEC", DEC },
824 {"NOT", NOT },
825 {"DIV", DIV },
826 {"INC", INC },
827 {"MAX", MAX_FUNC },
828 {"MIN", MIN_FUNC },
829 {"MOD", MOD },
830 {"ODD", ODD },
831 {"CAP", CAP },
832 {"ORD", ORD },
833 {"VAL", VAL },
834 {"EXCL", EXCL },
835 {"HIGH", HIGH },
836 {"INCL", INCL },
837 {"SIZE", SIZE },
838 {"FLOAT", FLOAT_FUNC },
839 {"TRUNC", TRUNC },
840 };
841
842
843 /* Read one token, getting characters through lexptr. */
844
845 /* This is where we will check to make sure that the language and the operators used are
846 compatible */
847
848 static int
849 yylex ()
850 {
851 register int c;
852 register int namelen;
853 register int i;
854 register char *tokstart;
855 register char quote;
856
857 retry:
858
859 tokstart = lexptr;
860
861
862 /* See if it is a special token of length 2 */
863 for( i = 0 ; i < sizeof tokentab2 / sizeof tokentab2[0] ; i++)
864 if(STREQN(tokentab2[i].name, tokstart, 2))
865 {
866 lexptr += 2;
867 return tokentab2[i].token;
868 }
869
870 switch (c = *tokstart)
871 {
872 case 0:
873 return 0;
874
875 case ' ':
876 case '\t':
877 case '\n':
878 lexptr++;
879 goto retry;
880
881 case '(':
882 paren_depth++;
883 lexptr++;
884 return c;
885
886 case ')':
887 if (paren_depth == 0)
888 return 0;
889 paren_depth--;
890 lexptr++;
891 return c;
892
893 case ',':
894 if (comma_terminates && paren_depth == 0)
895 return 0;
896 lexptr++;
897 return c;
898
899 case '.':
900 /* Might be a floating point number. */
901 if (lexptr[1] >= '0' && lexptr[1] <= '9')
902 break; /* Falls into number code. */
903 else
904 {
905 lexptr++;
906 return DOT;
907 }
908
909 /* These are character tokens that appear as-is in the YACC grammar */
910 case '+':
911 case '-':
912 case '*':
913 case '/':
914 case '^':
915 case '<':
916 case '>':
917 case '[':
918 case ']':
919 case '=':
920 case '{':
921 case '}':
922 case '#':
923 case '@':
924 case '~':
925 case '&':
926 lexptr++;
927 return c;
928
929 case '\'' :
930 case '"':
931 quote = c;
932 for (namelen = 1; (c = tokstart[namelen]) != quote && c != '\0'; namelen++)
933 if (c == '\\')
934 {
935 c = tokstart[++namelen];
936 if (c >= '0' && c <= '9')
937 {
938 c = tokstart[++namelen];
939 if (c >= '0' && c <= '9')
940 c = tokstart[++namelen];
941 }
942 }
943 if(c != quote)
944 error("Unterminated string or character constant.");
945 yylval.sval.ptr = tokstart + 1;
946 yylval.sval.length = namelen - 1;
947 lexptr += namelen + 1;
948
949 if(namelen == 2) /* Single character */
950 {
951 yylval.ulval = tokstart[1];
952 return CHAR;
953 }
954 else
955 return STRING;
956 }
957
958 /* Is it a number? */
959 /* Note: We have already dealt with the case of the token '.'.
960 See case '.' above. */
961 if ((c >= '0' && c <= '9'))
962 {
963 /* It's a number. */
964 int got_dot = 0, got_e = 0;
965 register char *p = tokstart;
966 int toktype;
967
968 for (++p ;; ++p)
969 {
970 if (!got_e && (*p == 'e' || *p == 'E'))
971 got_dot = got_e = 1;
972 else if (!got_dot && *p == '.')
973 got_dot = 1;
974 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
975 && (*p == '-' || *p == '+'))
976 /* This is the sign of the exponent, not the end of the
977 number. */
978 continue;
979 else if ((*p < '0' || *p > '9') &&
980 (*p < 'A' || *p > 'F') &&
981 (*p != 'H')) /* Modula-2 hexadecimal number */
982 break;
983 }
984 toktype = parse_number (p - tokstart);
985 if (toktype == ERROR)
986 {
987 char *err_copy = (char *) alloca (p - tokstart + 1);
988
989 memcpy (err_copy, tokstart, p - tokstart);
990 err_copy[p - tokstart] = 0;
991 error ("Invalid number \"%s\".", err_copy);
992 }
993 lexptr = p;
994 return toktype;
995 }
996
997 if (!(c == '_' || c == '$'
998 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
999 /* We must have come across a bad character (e.g. ';'). */
1000 error ("Invalid character '%c' in expression.", c);
1001
1002 /* It's a name. See how long it is. */
1003 namelen = 0;
1004 for (c = tokstart[namelen];
1005 (c == '_' || c == '$' || (c >= '0' && c <= '9')
1006 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));
1007 c = tokstart[++namelen])
1008 ;
1009
1010 /* The token "if" terminates the expression and is NOT
1011 removed from the input stream. */
1012 if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
1013 {
1014 return 0;
1015 }
1016
1017 lexptr += namelen;
1018
1019 /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1)
1020 and $$digits (equivalent to $<-digits> if you could type that).
1021 Make token type LAST, and put the number (the digits) in yylval. */
1022
1023 if (*tokstart == '$')
1024 {
1025 register int negate = 0;
1026 c = 1;
1027 /* Double dollar means negate the number and add -1 as well.
1028 Thus $$ alone means -1. */
1029 if (namelen >= 2 && tokstart[1] == '$')
1030 {
1031 negate = 1;
1032 c = 2;
1033 }
1034 if (c == namelen)
1035 {
1036 /* Just dollars (one or two) */
1037 yylval.lval = - negate;
1038 return LAST;
1039 }
1040 /* Is the rest of the token digits? */
1041 for (; c < namelen; c++)
1042 if (!(tokstart[c] >= '0' && tokstart[c] <= '9'))
1043 break;
1044 if (c == namelen)
1045 {
1046 yylval.lval = atoi (tokstart + 1 + negate);
1047 if (negate)
1048 yylval.lval = - yylval.lval;
1049 return LAST;
1050 }
1051 }
1052
1053 /* Handle tokens that refer to machine registers:
1054 $ followed by a register name. */
1055
1056 if (*tokstart == '$') {
1057 for (c = 0; c < NUM_REGS; c++)
1058 if (namelen - 1 == strlen (reg_names[c])
1059 && STREQN (tokstart + 1, reg_names[c], namelen - 1))
1060 {
1061 yylval.lval = c;
1062 return REGNAME;
1063 }
1064 for (c = 0; c < num_std_regs; c++)
1065 if (namelen - 1 == strlen (std_regs[c].name)
1066 && STREQN (tokstart + 1, std_regs[c].name, namelen - 1))
1067 {
1068 yylval.lval = std_regs[c].regnum;
1069 return REGNAME;
1070 }
1071 }
1072
1073
1074 /* Lookup special keywords */
1075 for(i = 0 ; i < sizeof(keytab) / sizeof(keytab[0]) ; i++)
1076 if(namelen == strlen(keytab[i].keyw) && STREQN(tokstart,keytab[i].keyw,namelen))
1077 return keytab[i].token;
1078
1079 yylval.sval.ptr = tokstart;
1080 yylval.sval.length = namelen;
1081
1082 /* Any other names starting in $ are debugger internal variables. */
1083
1084 if (*tokstart == '$')
1085 {
1086 yylval.ivar = (struct internalvar *) lookup_internalvar (copy_name (yylval.sval) + 1);
1087 return INTERNAL_VAR;
1088 }
1089
1090
1091 /* Use token-type BLOCKNAME for symbols that happen to be defined as
1092 functions. If this is not so, then ...
1093 Use token-type TYPENAME for symbols that happen to be defined
1094 currently as names of types; NAME for other symbols.
1095 The caller is not constrained to care about the distinction. */
1096 {
1097
1098
1099 char *tmp = copy_name (yylval.sval);
1100 struct symbol *sym;
1101
1102 if (lookup_partial_symtab (tmp))
1103 return BLOCKNAME;
1104 sym = lookup_symbol (tmp, expression_context_block,
1105 VAR_NAMESPACE, 0, NULL);
1106 if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
1107 return BLOCKNAME;
1108 if (lookup_typename (copy_name (yylval.sval), expression_context_block, 1))
1109 return TYPENAME;
1110
1111 if(sym)
1112 {
1113 switch(sym->class)
1114 {
1115 case LOC_STATIC:
1116 case LOC_REGISTER:
1117 case LOC_ARG:
1118 case LOC_REF_ARG:
1119 case LOC_REGPARM:
1120 case LOC_LOCAL:
1121 case LOC_LOCAL_ARG:
1122 case LOC_CONST:
1123 case LOC_CONST_BYTES:
1124 return NAME;
1125
1126 case LOC_TYPEDEF:
1127 return TYPENAME;
1128
1129 case LOC_BLOCK:
1130 return BLOCKNAME;
1131
1132 case LOC_UNDEF:
1133 error("internal: Undefined class in m2lex()");
1134
1135 case LOC_LABEL:
1136 error("internal: Unforseen case in m2lex()");
1137 }
1138 }
1139 else
1140 {
1141 /* Built-in BOOLEAN type. This is sort of a hack. */
1142 if(STREQN(tokstart,"TRUE",4))
1143 {
1144 yylval.ulval = 1;
1145 return M2_TRUE;
1146 }
1147 else if(STREQN(tokstart,"FALSE",5))
1148 {
1149 yylval.ulval = 0;
1150 return M2_FALSE;
1151 }
1152 }
1153
1154 /* Must be another type of name... */
1155 return NAME;
1156 }
1157 }
1158
1159 #if 0 /* Unused */
1160 static char *
1161 make_qualname(mod,ident)
1162 char *mod, *ident;
1163 {
1164 char *new = malloc(strlen(mod)+strlen(ident)+2);
1165
1166 strcpy(new,mod);
1167 strcat(new,".");
1168 strcat(new,ident);
1169 return new;
1170 }
1171 #endif /* 0 */
1172
1173 void
1174 yyerror(msg)
1175 char *msg; /* unused */
1176 {
1177 printf("Parsing: %s\n",lexptr);
1178 if (yychar < 256)
1179 error("Invalid syntax in expression near character '%c'.",yychar);
1180 else
1181 error("Invalid syntax in expression");
1182 }
1183