gdb/m2-exp.y

   1 /* YACC grammar for Modula-2 expressions, for GDB.
   2    Copyright (C) 1986-2017 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 3 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, see <http://www.gnu.org/licenses/>.  */
  20
  21 /* Parse a Modula-2 expression from text in a string,
  22    and return the result as a  struct expression  pointer.
  23    That structure contains arithmetic operations in reverse polish,
  24    with constants represented by operations that are followed by special data.
  25    See expression.h for the details of the format.
  26    What is important here is that it can be built up sequentially
  27    during the process of parsing; the lower levels of the tree always
  28    come first in the result.
  29
  30    Note that malloc's and realloc's in this file are transformed to
  31    xmalloc and xrealloc respectively by the same sed command in the
  32    makefile that remaps any other malloc/realloc inserted by the parser
  33    generator.  Doing this with #defines and trying to control the interaction
  34    with include files (<malloc.h> and <stdlib.h> for example) just became
  35    too messy, particularly when such includes can be inserted at random
  36    times by the parser generator.  */
  37
  38 %{
  39
  40 #include "defs.h"
  41 #include "expression.h"
  42 #include "language.h"
  43 #include "value.h"
  44 #include "parser-defs.h"
  45 #include "m2-lang.h"
  46 #include "bfd.h" /* Required by objfiles.h.  */
  47 #include "symfile.h" /* Required by objfiles.h.  */
  48 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
  49 #include "block.h"
  50
  51 #define parse_type(ps) builtin_type (parse_gdbarch (ps))
  52 #define parse_m2_type(ps) builtin_m2_type (parse_gdbarch (ps))
  53
  54 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
  55    etc).  */
  56 #define GDB_YY_REMAP_PREFIX m2_
  57 #include "yy-remap.h"
  58
  59 /* The state of the parser, used internally when we are parsing the
  60    expression.  */
  61
  62 static struct parser_state *pstate = NULL;
  63
  64 int yyparse (void);
  65
  66 static int yylex (void);
  67
  68 void yyerror (char *);
  69
  70 static int parse_number (int);
  71
  72 /* The sign of the number being parsed.  */
  73 static int number_sign = 1;
  74
  75 %}
  76
  77 /* Although the yacc "value" of an expression is not used,
  78    since the result is stored in the structure being created,
  79    other node types do have values.  */
  80
  81 %union
  82   {
  83     LONGEST lval;
  84     ULONGEST ulval;
  85     DOUBLEST dval;
  86     struct symbol *sym;
  87     struct type *tval;
  88     struct stoken sval;
  89     int voidval;
  90     const struct block *bval;
  91     enum exp_opcode opcode;
  92     struct internalvar *ivar;
  93
  94     struct type **tvec;
  95     int *ivec;
  96   }
  97
  98 %type <voidval> exp type_exp start set
  99 %type <voidval> variable
 100 %type <tval> type
 101 %type <bval> block
 102 %type <sym> fblock
 103
 104 %token <lval> INT HEX ERROR
 105 %token <ulval> UINT M2_TRUE M2_FALSE CHAR
 106 %token <dval> FLOAT
 107
 108 /* Both NAME and TYPENAME tokens represent symbols in the input,
 109    and both convey their data as strings.
 110    But a TYPENAME is a string that happens to be defined as a typedef
 111    or builtin type name (such as int or char)
 112    and a NAME is any other symbol.
 113
 114    Contexts where this distinction is not important can use the
 115    nonterminal "name", which matches either NAME or TYPENAME.  */
 116
 117 %token <sval> STRING
 118 %token <sval> NAME BLOCKNAME IDENT VARNAME
 119 %token <sval> TYPENAME
 120
 121 %token SIZE CAP ORD HIGH ABS MIN_FUNC MAX_FUNC FLOAT_FUNC VAL CHR ODD TRUNC
 122 %token TSIZE
 123 %token INC DEC INCL EXCL
 124
 125 /* The GDB scope operator */
 126 %token COLONCOLON
 127
 128 %token <voidval> INTERNAL_VAR
 129
 130 /* M2 tokens */
 131 %left ','
 132 %left ABOVE_COMMA
 133 %nonassoc ASSIGN
 134 %left '<' '>' LEQ GEQ '=' NOTEQUAL '#' IN
 135 %left OROR
 136 %left LOGICAL_AND '&'
 137 %left '@'
 138 %left '+' '-'
 139 %left '*' '/' DIV MOD
 140 %right UNARY
 141 %right '^' DOT '[' '('
 142 %right NOT '~'
 143 %left COLONCOLON QID
 144 /* This is not an actual token ; it is used for precedence.
 145 %right QID
 146 */
 147
 148 \f
 149 %%
 150
 151 start   :       exp
 152         |       type_exp
 153         ;
 154
 155 type_exp:       type
 156                 { write_exp_elt_opcode (pstate, OP_TYPE);
 157                   write_exp_elt_type (pstate, $1);
 158                   write_exp_elt_opcode (pstate, OP_TYPE);
 159                 }
 160         ;
 161
 162 /* Expressions */
 163
 164 exp     :       exp '^'   %prec UNARY
 165                         { write_exp_elt_opcode (pstate, UNOP_IND); }
 166         ;
 167
 168 exp     :       '-'
 169                         { number_sign = -1; }
 170                 exp    %prec UNARY
 171                         { number_sign = 1;
 172                           write_exp_elt_opcode (pstate, UNOP_NEG); }
 173         ;
 174
 175 exp     :       '+' exp    %prec UNARY
 176                 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
 177         ;
 178
 179 exp     :       not_exp exp %prec UNARY
 180                         { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
 181         ;
 182
 183 not_exp :       NOT
 184         |       '~'
 185         ;
 186
 187 exp     :       CAP '(' exp ')'
 188                         { write_exp_elt_opcode (pstate, UNOP_CAP); }
 189         ;
 190
 191 exp     :       ORD '(' exp ')'
 192                         { write_exp_elt_opcode (pstate, UNOP_ORD); }
 193         ;
 194
 195 exp     :       ABS '(' exp ')'
 196                         { write_exp_elt_opcode (pstate, UNOP_ABS); }
 197         ;
 198
 199 exp     :       HIGH '(' exp ')'
 200                         { write_exp_elt_opcode (pstate, UNOP_HIGH); }
 201         ;
 202
 203 exp     :       MIN_FUNC '(' type ')'
 204                         { write_exp_elt_opcode (pstate, UNOP_MIN);
 205                           write_exp_elt_type (pstate, $3);
 206                           write_exp_elt_opcode (pstate, UNOP_MIN); }
 207         ;
 208
 209 exp     :       MAX_FUNC '(' type ')'
 210                         { write_exp_elt_opcode (pstate, UNOP_MAX);
 211                           write_exp_elt_type (pstate, $3);
 212                           write_exp_elt_opcode (pstate, UNOP_MAX); }
 213         ;
 214
 215 exp     :       FLOAT_FUNC '(' exp ')'
 216                         { write_exp_elt_opcode (pstate, UNOP_FLOAT); }
 217         ;
 218
 219 exp     :       VAL '(' type ',' exp ')'
 220                         { write_exp_elt_opcode (pstate, BINOP_VAL);
 221                           write_exp_elt_type (pstate, $3);
 222                           write_exp_elt_opcode (pstate, BINOP_VAL); }
 223         ;
 224
 225 exp     :       CHR '(' exp ')'
 226                         { write_exp_elt_opcode (pstate, UNOP_CHR); }
 227         ;
 228
 229 exp     :       ODD '(' exp ')'
 230                         { write_exp_elt_opcode (pstate, UNOP_ODD); }
 231         ;
 232
 233 exp     :       TRUNC '(' exp ')'
 234                         { write_exp_elt_opcode (pstate, UNOP_TRUNC); }
 235         ;
 236
 237 exp     :       TSIZE '(' exp ')'
 238                         { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
 239         ;
 240
 241 exp     :       SIZE exp       %prec UNARY
 242                         { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
 243         ;
 244
 245
 246 exp     :       INC '(' exp ')'
 247                         { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
 248         ;
 249
 250 exp     :       INC '(' exp ',' exp ')'
 251                         { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
 252                           write_exp_elt_opcode (pstate, BINOP_ADD);
 253                           write_exp_elt_opcode (pstate,
 254                                                 BINOP_ASSIGN_MODIFY); }
 255         ;
 256
 257 exp     :       DEC '(' exp ')'
 258                         { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT);}
 259         ;
 260
 261 exp     :       DEC '(' exp ',' exp ')'
 262                         { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
 263                           write_exp_elt_opcode (pstate, BINOP_SUB);
 264                           write_exp_elt_opcode (pstate,
 265                                                 BINOP_ASSIGN_MODIFY); }
 266         ;
 267
 268 exp     :       exp DOT NAME
 269                         { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
 270                           write_exp_string (pstate, $3);
 271                           write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
 272         ;
 273
 274 exp     :       set
 275         ;
 276
 277 exp     :       exp IN set
 278                         { error (_("Sets are not implemented."));}
 279         ;
 280
 281 exp     :       INCL '(' exp ',' exp ')'
 282                         { error (_("Sets are not implemented."));}
 283         ;
 284
 285 exp     :       EXCL '(' exp ',' exp ')'
 286                         { error (_("Sets are not implemented."));}
 287         ;
 288
 289 set     :       '{' arglist '}'
 290                         { error (_("Sets are not implemented."));}
 291         |       type '{' arglist '}'
 292                         { error (_("Sets are not implemented."));}
 293         ;
 294
 295
 296 /* Modula-2 array subscript notation [a,b,c...] */
 297 exp     :       exp '['
 298                         /* This function just saves the number of arguments
 299                            that follow in the list.  It is *not* specific to
 300                            function types */
 301                         { start_arglist(); }
 302                 non_empty_arglist ']'  %prec DOT
 303                         { write_exp_elt_opcode (pstate, MULTI_SUBSCRIPT);
 304                           write_exp_elt_longcst (pstate,
 305                                                  (LONGEST) end_arglist());
 306                           write_exp_elt_opcode (pstate, MULTI_SUBSCRIPT); }
 307         ;
 308
 309 exp     :       exp '[' exp ']'
 310                         { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
 311         ;
 312
 313 exp     :       exp '('
 314                         /* This is to save the value of arglist_len
 315                            being accumulated by an outer function call.  */
 316                         { start_arglist (); }
 317                 arglist ')'     %prec DOT
 318                         { write_exp_elt_opcode (pstate, OP_FUNCALL);
 319                           write_exp_elt_longcst (pstate,
 320                                                  (LONGEST) end_arglist ());
 321                           write_exp_elt_opcode (pstate, OP_FUNCALL); }
 322         ;
 323
 324 arglist :
 325         ;
 326
 327 arglist :       exp
 328                         { arglist_len = 1; }
 329         ;
 330
 331 arglist :       arglist ',' exp   %prec ABOVE_COMMA
 332                         { arglist_len++; }
 333         ;
 334
 335 non_empty_arglist
 336         :       exp
 337                         { arglist_len = 1; }
 338         ;
 339
 340 non_empty_arglist
 341         :       non_empty_arglist ',' exp %prec ABOVE_COMMA
 342                         { arglist_len++; }
 343         ;
 344
 345 /* GDB construct */
 346 exp     :       '{' type '}' exp  %prec UNARY
 347                         { write_exp_elt_opcode (pstate, UNOP_MEMVAL);
 348                           write_exp_elt_type (pstate, $2);
 349                           write_exp_elt_opcode (pstate, UNOP_MEMVAL); }
 350         ;
 351
 352 exp     :       type '(' exp ')' %prec UNARY
 353                         { write_exp_elt_opcode (pstate, UNOP_CAST);
 354                           write_exp_elt_type (pstate, $1);
 355                           write_exp_elt_opcode (pstate, UNOP_CAST); }
 356         ;
 357
 358 exp     :       '(' exp ')'
 359                         { }
 360         ;
 361
 362 /* Binary operators in order of decreasing precedence.  Note that some
 363    of these operators are overloaded!  (ie. sets) */
 364
 365 /* GDB construct */
 366 exp     :       exp '@' exp
 367                         { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
 368         ;
 369
 370 exp     :       exp '*' exp
 371                         { write_exp_elt_opcode (pstate, BINOP_MUL); }
 372         ;
 373
 374 exp     :       exp '/' exp
 375                         { write_exp_elt_opcode (pstate, BINOP_DIV); }
 376         ;
 377
 378 exp     :       exp DIV exp
 379                         { write_exp_elt_opcode (pstate, BINOP_INTDIV); }
 380         ;
 381
 382 exp     :       exp MOD exp
 383                         { write_exp_elt_opcode (pstate, BINOP_REM); }
 384         ;
 385
 386 exp     :       exp '+' exp
 387                         { write_exp_elt_opcode (pstate, BINOP_ADD); }
 388         ;
 389
 390 exp     :       exp '-' exp
 391                         { write_exp_elt_opcode (pstate, BINOP_SUB); }
 392         ;
 393
 394 exp     :       exp '=' exp
 395                         { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
 396         ;
 397
 398 exp     :       exp NOTEQUAL exp
 399                         { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
 400         |       exp '#' exp
 401                         { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
 402         ;
 403
 404 exp     :       exp LEQ exp
 405                         { write_exp_elt_opcode (pstate, BINOP_LEQ); }
 406         ;
 407
 408 exp     :       exp GEQ exp
 409                         { write_exp_elt_opcode (pstate, BINOP_GEQ); }
 410         ;
 411
 412 exp     :       exp '<' exp
 413                         { write_exp_elt_opcode (pstate, BINOP_LESS); }
 414         ;
 415
 416 exp     :       exp '>' exp
 417                         { write_exp_elt_opcode (pstate, BINOP_GTR); }
 418         ;
 419
 420 exp     :       exp LOGICAL_AND exp
 421                         { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
 422         ;
 423
 424 exp     :       exp OROR exp
 425                         { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
 426         ;
 427
 428 exp     :       exp ASSIGN exp
 429                         { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
 430         ;
 431
 432
 433 /* Constants */
 434
 435 exp     :       M2_TRUE
 436                         { write_exp_elt_opcode (pstate, OP_BOOL);
 437                           write_exp_elt_longcst (pstate, (LONGEST) $1);
 438                           write_exp_elt_opcode (pstate, OP_BOOL); }
 439         ;
 440
 441 exp     :       M2_FALSE
 442                         { write_exp_elt_opcode (pstate, OP_BOOL);
 443                           write_exp_elt_longcst (pstate, (LONGEST) $1);
 444                           write_exp_elt_opcode (pstate, OP_BOOL); }
 445         ;
 446
 447 exp     :       INT
 448                         { write_exp_elt_opcode (pstate, OP_LONG);
 449                           write_exp_elt_type (pstate,
 450                                         parse_m2_type (pstate)->builtin_int);
 451                           write_exp_elt_longcst (pstate, (LONGEST) $1);
 452                           write_exp_elt_opcode (pstate, OP_LONG); }
 453         ;
 454
 455 exp     :       UINT
 456                         {
 457                           write_exp_elt_opcode (pstate, OP_LONG);
 458                           write_exp_elt_type (pstate,
 459                                               parse_m2_type (pstate)
 460                                               ->builtin_card);
 461                           write_exp_elt_longcst (pstate, (LONGEST) $1);
 462                           write_exp_elt_opcode (pstate, OP_LONG);
 463                         }
 464         ;
 465
 466 exp     :       CHAR
 467                         { write_exp_elt_opcode (pstate, OP_LONG);
 468                           write_exp_elt_type (pstate,
 469                                               parse_m2_type (pstate)
 470                                               ->builtin_char);
 471                           write_exp_elt_longcst (pstate, (LONGEST) $1);
 472                           write_exp_elt_opcode (pstate, OP_LONG); }
 473         ;
 474
 475
 476 exp     :       FLOAT
 477                         { write_exp_elt_opcode (pstate, OP_DOUBLE);
 478                           write_exp_elt_type (pstate,
 479                                               parse_m2_type (pstate)
 480                                               ->builtin_real);
 481                           write_exp_elt_dblcst (pstate, $1);
 482                           write_exp_elt_opcode (pstate, OP_DOUBLE); }
 483         ;
 484
 485 exp     :       variable
 486         ;
 487
 488 exp     :       SIZE '(' type ')'       %prec UNARY
 489                         { write_exp_elt_opcode (pstate, OP_LONG);
 490                           write_exp_elt_type (pstate,
 491                                             parse_type (pstate)->builtin_int);
 492                           write_exp_elt_longcst (pstate,
 493                                                  (LONGEST) TYPE_LENGTH ($3));
 494                           write_exp_elt_opcode (pstate, OP_LONG); }
 495         ;
 496
 497 exp     :       STRING
 498                         { write_exp_elt_opcode (pstate, OP_M2_STRING);
 499                           write_exp_string (pstate, $1);
 500                           write_exp_elt_opcode (pstate, OP_M2_STRING); }
 501         ;
 502
 503 /* This will be used for extensions later.  Like adding modules.  */
 504 block   :       fblock
 505                         { $$ = SYMBOL_BLOCK_VALUE($1); }
 506         ;
 507
 508 fblock  :       BLOCKNAME
 509                         { struct symbol *sym
 510                             = lookup_symbol (copy_name ($1),
 511                                              expression_context_block,
 512                                              VAR_DOMAIN, 0).symbol;
 513                           $$ = sym;}
 514         ;
 515
 516
 517 /* GDB scope operator */
 518 fblock  :       block COLONCOLON BLOCKNAME
 519                         { struct symbol *tem
 520                             = lookup_symbol (copy_name ($3), $1,
 521                                              VAR_DOMAIN, 0).symbol;
 522                           if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
 523                             error (_("No function \"%s\" in specified context."),
 524                                    copy_name ($3));
 525                           $$ = tem;
 526                         }
 527         ;
 528
 529 /* Useful for assigning to PROCEDURE variables */
 530 variable:       fblock
 531                         { write_exp_elt_opcode (pstate, OP_VAR_VALUE);
 532                           write_exp_elt_block (pstate, NULL);
 533                           write_exp_elt_sym (pstate, $1);
 534                           write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
 535         ;
 536
 537 /* GDB internal ($foo) variable */
 538 variable:       INTERNAL_VAR
 539         ;
 540
 541 /* GDB scope operator */
 542 variable:       block COLONCOLON NAME
 543                         { struct block_symbol sym
 544                             = lookup_symbol (copy_name ($3), $1,
 545                                              VAR_DOMAIN, 0);
 546
 547                           if (sym.symbol == 0)
 548                             error (_("No symbol \"%s\" in specified context."),
 549                                    copy_name ($3));
 550                           if (symbol_read_needs_frame (sym.symbol))
 551                             {
 552                               if (innermost_block == 0
 553                                   || contained_in (sym.block,
 554                                                    innermost_block))
 555                                 innermost_block = sym.block;
 556                             }
 557
 558                           write_exp_elt_opcode (pstate, OP_VAR_VALUE);
 559                           write_exp_elt_block (pstate, sym.block);
 560                           write_exp_elt_sym (pstate, sym.symbol);
 561                           write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
 562         ;
 563
 564 /* Base case for variables.  */
 565 variable:       NAME
 566                         { struct block_symbol sym;
 567                           struct field_of_this_result is_a_field_of_this;
 568
 569                           sym = lookup_symbol (copy_name ($1),
 570                                                expression_context_block,
 571                                                VAR_DOMAIN,
 572                                                &is_a_field_of_this);
 573
 574                           if (sym.symbol)
 575                             {
 576                               if (symbol_read_needs_frame (sym.symbol))
 577                                 {
 578                                   if (innermost_block == 0 ||
 579                                       contained_in (sym.block,
 580                                                     innermost_block))
 581                                     innermost_block = sym.block;
 582                                 }
 583
 584                               write_exp_elt_opcode (pstate, OP_VAR_VALUE);
 585                               write_exp_elt_block (pstate, sym.block);
 586                               write_exp_elt_sym (pstate, sym.symbol);
 587                               write_exp_elt_opcode (pstate, OP_VAR_VALUE);
 588                             }
 589                           else
 590                             {
 591                               struct bound_minimal_symbol msymbol;
 592                               char *arg = copy_name ($1);
 593
 594                               msymbol =
 595                                 lookup_bound_minimal_symbol (arg);
 596                               if (msymbol.minsym != NULL)
 597                                 write_exp_msymbol (pstate, msymbol);
 598                               else if (!have_full_symbols () && !have_partial_symbols ())
 599                                 error (_("No symbol table is loaded.  Use the \"symbol-file\" command."));
 600                               else
 601                                 error (_("No symbol \"%s\" in current context."),
 602                                        copy_name ($1));
 603                             }
 604                         }
 605         ;
 606
 607 type
 608         :       TYPENAME
 609                         { $$ = lookup_typename (parse_language (pstate),
 610                                                 parse_gdbarch (pstate),
 611                                                 copy_name ($1),
 612                                                 expression_context_block, 0); }
 613
 614         ;
 615
 616 %%
 617
 618 /* Take care of parsing a number (anything that starts with a digit).
 619    Set yylval and return the token type; update lexptr.
 620    LEN is the number of characters in it.  */
 621
 622 /*** Needs some error checking for the float case ***/
 623
 624 static int
 625 parse_number (int olen)
 626 {
 627   const char *p = lexptr;
 628   LONGEST n = 0;
 629   LONGEST prevn = 0;
 630   int c,i,ischar=0;
 631   int base = input_radix;
 632   int len = olen;
 633   int unsigned_p = number_sign == 1 ? 1 : 0;
 634
 635   if(p[len-1] == 'H')
 636   {
 637      base = 16;
 638      len--;
 639   }
 640   else if(p[len-1] == 'C' || p[len-1] == 'B')
 641   {
 642      base = 8;
 643      ischar = p[len-1] == 'C';
 644      len--;
 645   }
 646
 647   /* Scan the number */
 648   for (c = 0; c < len; c++)
 649   {
 650     if (p[c] == '.' && base == 10)
 651       {
 652         /* It's a float since it contains a point.  */
 653         yylval.dval = atof (p);
 654         lexptr += len;
 655         return FLOAT;
 656       }
 657     if (p[c] == '.' && base != 10)
 658        error (_("Floating point numbers must be base 10."));
 659     if (base == 10 && (p[c] < '0' || p[c] > '9'))
 660        error (_("Invalid digit \'%c\' in number."),p[c]);
 661  }
 662
 663   while (len-- > 0)
 664     {
 665       c = *p++;
 666       n *= base;
 667       if( base == 8 && (c == '8' || c == '9'))
 668          error (_("Invalid digit \'%c\' in octal number."),c);
 669       if (c >= '0' && c <= '9')
 670         i = c - '0';
 671       else
 672         {
 673           if (base == 16 && c >= 'A' && c <= 'F')
 674             i = c - 'A' + 10;
 675           else
 676              return ERROR;
 677         }
 678       n+=i;
 679       if(i >= base)
 680          return ERROR;
 681       if(!unsigned_p && number_sign == 1 && (prevn >= n))
 682          unsigned_p=1;          /* Try something unsigned */
 683       /* Don't do the range check if n==i and i==0, since that special
 684          case will give an overflow error.  */
 685       if(RANGE_CHECK && n!=i && i)
 686       {
 687          if((unsigned_p && (unsigned)prevn >= (unsigned)n) ||
 688             ((!unsigned_p && number_sign==-1) && -prevn <= -n))
 689             range_error (_("Overflow on numeric constant."));
 690       }
 691          prevn=n;
 692     }
 693
 694   lexptr = p;
 695   if(*p == 'B' || *p == 'C' || *p == 'H')
 696      lexptr++;                  /* Advance past B,C or H */
 697
 698   if (ischar)
 699   {
 700      yylval.ulval = n;
 701      return CHAR;
 702   }
 703   else if ( unsigned_p && number_sign == 1)
 704   {
 705      yylval.ulval = n;
 706      return UINT;
 707   }
 708   else if((unsigned_p && (n<0))) {
 709      range_error (_("Overflow on numeric constant -- number too large."));
 710      /* But, this can return if range_check == range_warn.  */
 711   }
 712   yylval.lval = n;
 713   return INT;
 714 }
 715
 716
 717 /* Some tokens */
 718
 719 static struct
 720 {
 721    char name[2];
 722    int token;
 723 } tokentab2[] =
 724 {
 725     { {'<', '>'},    NOTEQUAL   },
 726     { {':', '='},    ASSIGN     },
 727     { {'<', '='},    LEQ        },
 728     { {'>', '='},    GEQ        },
 729     { {':', ':'},    COLONCOLON },
 730
 731 };
 732
 733 /* Some specific keywords */
 734
 735 struct keyword {
 736    char keyw[10];
 737    int token;
 738 };
 739
 740 static struct keyword keytab[] =
 741 {
 742     {"OR" ,   OROR       },
 743     {"IN",    IN         },/* Note space after IN */
 744     {"AND",   LOGICAL_AND},
 745     {"ABS",   ABS        },
 746     {"CHR",   CHR        },
 747     {"DEC",   DEC        },
 748     {"NOT",   NOT        },
 749     {"DIV",   DIV        },
 750     {"INC",   INC        },
 751     {"MAX",   MAX_FUNC   },
 752     {"MIN",   MIN_FUNC   },
 753     {"MOD",   MOD        },
 754     {"ODD",   ODD        },
 755     {"CAP",   CAP        },
 756     {"ORD",   ORD        },
 757     {"VAL",   VAL        },
 758     {"EXCL",  EXCL       },
 759     {"HIGH",  HIGH       },
 760     {"INCL",  INCL       },
 761     {"SIZE",  SIZE       },
 762     {"FLOAT", FLOAT_FUNC },
 763     {"TRUNC", TRUNC      },
 764     {"TSIZE", SIZE       },
 765 };
 766
 767
 768 /* Read one token, getting characters through lexptr.  */
 769
 770 /* This is where we will check to make sure that the language and the
 771    operators used are compatible  */
 772
 773 static int
 774 yylex (void)
 775 {
 776   int c;
 777   int namelen;
 778   int i;
 779   const char *tokstart;
 780   char quote;
 781
 782  retry:
 783
 784   prev_lexptr = lexptr;
 785
 786   tokstart = lexptr;
 787
 788
 789   /* See if it is a special token of length 2 */
 790   for( i = 0 ; i < (int) (sizeof tokentab2 / sizeof tokentab2[0]) ; i++)
 791      if (strncmp (tokentab2[i].name, tokstart, 2) == 0)
 792      {
 793         lexptr += 2;
 794         return tokentab2[i].token;
 795      }
 796
 797   switch (c = *tokstart)
 798     {
 799     case 0:
 800       return 0;
 801
 802     case ' ':
 803     case '\t':
 804     case '\n':
 805       lexptr++;
 806       goto retry;
 807
 808     case '(':
 809       paren_depth++;
 810       lexptr++;
 811       return c;
 812
 813     case ')':
 814       if (paren_depth == 0)
 815         return 0;
 816       paren_depth--;
 817       lexptr++;
 818       return c;
 819
 820     case ',':
 821       if (comma_terminates && paren_depth == 0)
 822         return 0;
 823       lexptr++;
 824       return c;
 825
 826     case '.':
 827       /* Might be a floating point number.  */
 828       if (lexptr[1] >= '0' && lexptr[1] <= '9')
 829         break;                  /* Falls into number code.  */
 830       else
 831       {
 832          lexptr++;
 833          return DOT;
 834       }
 835
 836 /* These are character tokens that appear as-is in the YACC grammar */
 837     case '+':
 838     case '-':
 839     case '*':
 840     case '/':
 841     case '^':
 842     case '<':
 843     case '>':
 844     case '[':
 845     case ']':
 846     case '=':
 847     case '{':
 848     case '}':
 849     case '#':
 850     case '@':
 851     case '~':
 852     case '&':
 853       lexptr++;
 854       return c;
 855
 856     case '\'' :
 857     case '"':
 858       quote = c;
 859       for (namelen = 1; (c = tokstart[namelen]) != quote && c != '\0'; namelen++)
 860         if (c == '\\')
 861           {
 862             c = tokstart[++namelen];
 863             if (c >= '0' && c <= '9')
 864               {
 865                 c = tokstart[++namelen];
 866                 if (c >= '0' && c <= '9')
 867                   c = tokstart[++namelen];
 868               }
 869           }
 870       if(c != quote)
 871          error (_("Unterminated string or character constant."));
 872       yylval.sval.ptr = tokstart + 1;
 873       yylval.sval.length = namelen - 1;
 874       lexptr += namelen + 1;
 875
 876       if(namelen == 2)          /* Single character */
 877       {
 878            yylval.ulval = tokstart[1];
 879            return CHAR;
 880       }
 881       else
 882          return STRING;
 883     }
 884
 885   /* Is it a number?  */
 886   /* Note:  We have already dealt with the case of the token '.'.
 887      See case '.' above.  */
 888   if ((c >= '0' && c <= '9'))
 889     {
 890       /* It's a number.  */
 891       int got_dot = 0, got_e = 0;
 892       const char *p = tokstart;
 893       int toktype;
 894
 895       for (++p ;; ++p)
 896         {
 897           if (!got_e && (*p == 'e' || *p == 'E'))
 898             got_dot = got_e = 1;
 899           else if (!got_dot && *p == '.')
 900             got_dot = 1;
 901           else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
 902                    && (*p == '-' || *p == '+'))
 903             /* This is the sign of the exponent, not the end of the
 904                number.  */
 905             continue;
 906           else if ((*p < '0' || *p > '9') &&
 907                    (*p < 'A' || *p > 'F') &&
 908                    (*p != 'H'))  /* Modula-2 hexadecimal number */
 909             break;
 910         }
 911         toktype = parse_number (p - tokstart);
 912         if (toktype == ERROR)
 913           {
 914             char *err_copy = (char *) alloca (p - tokstart + 1);
 915
 916             memcpy (err_copy, tokstart, p - tokstart);
 917             err_copy[p - tokstart] = 0;
 918             error (_("Invalid number \"%s\"."), err_copy);
 919           }
 920         lexptr = p;
 921         return toktype;
 922     }
 923
 924   if (!(c == '_' || c == '$'
 925         || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
 926     /* We must have come across a bad character (e.g. ';').  */
 927     error (_("Invalid character '%c' in expression."), c);
 928
 929   /* It's a name.  See how long it is.  */
 930   namelen = 0;
 931   for (c = tokstart[namelen];
 932        (c == '_' || c == '$' || (c >= '0' && c <= '9')
 933         || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));
 934        c = tokstart[++namelen])
 935     ;
 936
 937   /* The token "if" terminates the expression and is NOT
 938      removed from the input stream.  */
 939   if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
 940     {
 941       return 0;
 942     }
 943
 944   lexptr += namelen;
 945
 946   /*  Lookup special keywords */
 947   for(i = 0 ; i < (int) (sizeof(keytab) / sizeof(keytab[0])) ; i++)
 948      if (namelen == strlen (keytab[i].keyw)
 949          && strncmp (tokstart, keytab[i].keyw, namelen) == 0)
 950            return keytab[i].token;
 951
 952   yylval.sval.ptr = tokstart;
 953   yylval.sval.length = namelen;
 954
 955   if (*tokstart == '$')
 956     {
 957       write_dollar_variable (pstate, yylval.sval);
 958       return INTERNAL_VAR;
 959     }
 960
 961   /* Use token-type BLOCKNAME for symbols that happen to be defined as
 962      functions.  If this is not so, then ...
 963      Use token-type TYPENAME for symbols that happen to be defined
 964      currently as names of types; NAME for other symbols.
 965      The caller is not constrained to care about the distinction.  */
 966  {
 967
 968
 969     char *tmp = copy_name (yylval.sval);
 970     struct symbol *sym;
 971
 972     if (lookup_symtab (tmp))
 973       return BLOCKNAME;
 974     sym = lookup_symbol (tmp, expression_context_block, VAR_DOMAIN, 0).symbol;
 975     if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
 976       return BLOCKNAME;
 977     if (lookup_typename (parse_language (pstate), parse_gdbarch (pstate),
 978                          copy_name (yylval.sval),
 979                          expression_context_block, 1))
 980       return TYPENAME;
 981
 982     if(sym)
 983     {
 984       switch(SYMBOL_CLASS (sym))
 985        {
 986        case LOC_STATIC:
 987        case LOC_REGISTER:
 988        case LOC_ARG:
 989        case LOC_REF_ARG:
 990        case LOC_REGPARM_ADDR:
 991        case LOC_LOCAL:
 992        case LOC_CONST:
 993        case LOC_CONST_BYTES:
 994        case LOC_OPTIMIZED_OUT:
 995        case LOC_COMPUTED:
 996           return NAME;
 997
 998        case LOC_TYPEDEF:
 999           return TYPENAME;
1000
1001        case LOC_BLOCK:
1002           return BLOCKNAME;
1003
1004        case LOC_UNDEF:
1005           error (_("internal:  Undefined class in m2lex()"));
1006
1007        case LOC_LABEL:
1008        case LOC_UNRESOLVED:
1009           error (_("internal:  Unforseen case in m2lex()"));
1010
1011        default:
1012           error (_("unhandled token in m2lex()"));
1013           break;
1014        }
1015     }
1016     else
1017     {
1018        /* Built-in BOOLEAN type.  This is sort of a hack.  */
1019        if (strncmp (tokstart, "TRUE", 4) == 0)
1020        {
1021           yylval.ulval = 1;
1022           return M2_TRUE;
1023        }
1024        else if (strncmp (tokstart, "FALSE", 5) == 0)
1025        {
1026           yylval.ulval = 0;
1027           return M2_FALSE;
1028        }
1029     }
1030
1031     /* Must be another type of name...  */
1032     return NAME;
1033  }
1034 }
1035
1036 int
1037 m2_parse (struct parser_state *par_state)
1038 {
1039   int result;
1040   struct cleanup *c = make_cleanup_clear_parser_state (&pstate);
1041
1042   /* Setting up the parser state.  */
1043   gdb_assert (par_state != NULL);
1044   pstate = par_state;
1045
1046   result = yyparse ();
1047   do_cleanups (c);
1048
1049   return result;
1050 }
1051
1052 void
1053 yyerror (char *msg)
1054 {
1055   if (prev_lexptr)
1056     lexptr = prev_lexptr;
1057
1058   error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);
1059 }