gdb/ch-exp.y

   1 /* YACC grammar for Chill expressions, for GDB.
   2    Copyright 1992, 1993 Free Software Foundation, Inc.
   3
   4 This file is part of GDB.
   5
   6 This program is free software; you can redistribute it and/or modify
   7 it under the terms of the GNU General Public License as published by
   8 the Free Software Foundation; either version 2 of the License, or
   9 (at your option) any later version.
  10
  11 This program is distributed in the hope that it will be useful,
  12 but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 GNU General Public License for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with this program; if not, write to the Free Software
  18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
  19
  20 /* Parse a Chill expression from text in a string,
  21    and return the result as a  struct expression  pointer.
  22    That structure contains arithmetic operations in reverse polish,
  23    with constants represented by operations that are followed by special data.
  24    See expression.h for the details of the format.
  25    What is important here is that it can be built up sequentially
  26    during the process of parsing; the lower levels of the tree always
  27    come first in the result.
  28
  29    Note that malloc's and realloc's in this file are transformed to
  30    xmalloc and xrealloc respectively by the same sed command in the
  31    makefile that remaps any other malloc/realloc inserted by the parser
  32    generator.  Doing this with #defines and trying to control the interaction
  33    with include files (<malloc.h> and <stdlib.h> for example) just became
  34    too messy, particularly when such includes can be inserted at random
  35    times by the parser generator.
  36
  37    Also note that the language accepted by this parser is more liberal
  38    than the one accepted by an actual Chill compiler.  For example, the
  39    language rule that a simple name string can not be one of the reserved
  40    simple name strings is not enforced (e.g "case" is not treated as a
  41    reserved name).  Another example is that Chill is a strongly typed
  42    language, and certain expressions that violate the type constraints
  43    may still be evaluated if gdb can do so in a meaningful manner, while
  44    such expressions would be rejected by the compiler.  The reason for
  45    this more liberal behavior is the philosophy that the debugger
  46    is intended to be a tool that is used by the programmer when things
  47    go wrong, and as such, it should provide as few artificial barriers
  48    to it's use as possible.  If it can do something meaningful, even
  49    something that violates language contraints that are enforced by the
  50    compiler, it should do so without complaint.
  51
  52  */
  53
  54 %{
  55
  56 #include "defs.h"
  57 #include <ctype.h>
  58 #include "expression.h"
  59 #include "language.h"
  60 #include "value.h"
  61 #include "parser-defs.h"
  62 #include "ch-lang.h"
  63 #include "bfd.h" /* Required by objfiles.h.  */
  64 #include "symfile.h" /* Required by objfiles.h.  */
  65 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
  66
  67 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
  68    as well as gratuitiously global symbol names, so we can have multiple
  69    yacc generated parsers in gdb.  Note that these are only the variables
  70    produced by yacc.  If other parser generators (bison, byacc, etc) produce
  71    additional global names that conflict at link time, then those parser
  72    generators need to be fixed instead of adding those names to this list. */
  73
  74 #define yymaxdepth chill_maxdepth
  75 #define yyparse chill_parse
  76 #define yylex   chill_lex
  77 #define yyerror chill_error
  78 #define yylval  chill_lval
  79 #define yychar  chill_char
  80 #define yydebug chill_debug
  81 #define yypact  chill_pact
  82 #define yyr1    chill_r1
  83 #define yyr2    chill_r2
  84 #define yydef   chill_def
  85 #define yychk   chill_chk
  86 #define yypgo   chill_pgo
  87 #define yyact   chill_act
  88 #define yyexca  chill_exca
  89 #define yyerrflag chill_errflag
  90 #define yynerrs chill_nerrs
  91 #define yyps    chill_ps
  92 #define yypv    chill_pv
  93 #define yys     chill_s
  94 #define yy_yys  chill_yys
  95 #define yystate chill_state
  96 #define yytmp   chill_tmp
  97 #define yyv     chill_v
  98 #define yy_yyv  chill_yyv
  99 #define yyval   chill_val
 100 #define yylloc  chill_lloc
 101 #define yyreds  chill_reds              /* With YYDEBUG defined */
 102 #define yytoks  chill_toks              /* With YYDEBUG defined */
 103
 104 #ifndef YYDEBUG
 105 #define YYDEBUG 0               /* Default to no yydebug support */
 106 #endif
 107
 108 int
 109 yyparse PARAMS ((void));
 110
 111 static int
 112 yylex PARAMS ((void));
 113
 114 void
 115 yyerror PARAMS ((char *));
 116
 117 %}
 118
 119 /* Although the yacc "value" of an expression is not used,
 120    since the result is stored in the structure being created,
 121    other node types do have values.  */
 122
 123 %union
 124   {
 125     LONGEST lval;
 126     unsigned LONGEST ulval;
 127     struct {
 128       LONGEST val;
 129       struct type *type;
 130     } typed_val;
 131     double dval;
 132     struct symbol *sym;
 133     struct type *tval;
 134     struct stoken sval;
 135     struct ttype tsym;
 136     struct symtoken ssym;
 137     int voidval;
 138     struct block *bval;
 139     enum exp_opcode opcode;
 140     struct internalvar *ivar;
 141
 142     struct type **tvec;
 143     int *ivec;
 144   }
 145
 146 %token <voidval> FIXME_01
 147 %token <voidval> FIXME_02
 148 %token <voidval> FIXME_03
 149 %token <voidval> FIXME_04
 150 %token <voidval> FIXME_05
 151 %token <voidval> FIXME_06
 152 %token <voidval> FIXME_07
 153 %token <voidval> FIXME_08
 154 %token <voidval> FIXME_09
 155 %token <voidval> FIXME_10
 156 %token <voidval> FIXME_11
 157 %token <voidval> FIXME_12
 158 %token <voidval> FIXME_13
 159 %token <voidval> FIXME_14
 160 %token <voidval> FIXME_15
 161 %token <voidval> FIXME_16
 162 %token <voidval> FIXME_17
 163 %token <voidval> FIXME_18
 164 %token <voidval> FIXME_19
 165 %token <voidval> FIXME_20
 166 %token <voidval> FIXME_21
 167 %token <voidval> FIXME_22
 168 %token <voidval> FIXME_24
 169 %token <voidval> FIXME_25
 170 %token <voidval> FIXME_26
 171 %token <voidval> FIXME_27
 172 %token <voidval> FIXME_28
 173 %token <voidval> FIXME_29
 174 %token <voidval> FIXME_30
 175
 176 %token <typed_val>      INTEGER_LITERAL
 177 %token <ulval>          BOOLEAN_LITERAL
 178 %token <typed_val>      CHARACTER_LITERAL
 179 %token <dval>           FLOAT_LITERAL
 180 %token <ssym>           GENERAL_PROCEDURE_NAME
 181 %token <ssym>           LOCATION_NAME
 182 %token <voidval>        SET_LITERAL
 183 %token <voidval>        EMPTINESS_LITERAL
 184 %token <sval>           CHARACTER_STRING_LITERAL
 185 %token <sval>           BIT_STRING_LITERAL
 186 %token <tsym>           TYPENAME
 187 %token <sval>           FIELD_NAME
 188
 189 %token <voidval>        '.'
 190 %token <voidval>        ';'
 191 %token <voidval>        ':'
 192 %token <voidval>        CASE
 193 %token <voidval>        OF
 194 %token <voidval>        ESAC
 195 %token <voidval>        LOGIOR
 196 %token <voidval>        ORIF
 197 %token <voidval>        LOGXOR
 198 %token <voidval>        LOGAND
 199 %token <voidval>        ANDIF
 200 %token <voidval>        '='
 201 %token <voidval>        NOTEQUAL
 202 %token <voidval>        '>'
 203 %token <voidval>        GTR
 204 %token <voidval>        '<'
 205 %token <voidval>        LEQ
 206 %token <voidval>        IN
 207 %token <voidval>        '+'
 208 %token <voidval>        '-'
 209 %token <voidval>        '*'
 210 %token <voidval>        '/'
 211 %token <voidval>        SLASH_SLASH
 212 %token <voidval>        MOD
 213 %token <voidval>        REM
 214 %token <voidval>        NOT
 215 %token <voidval>        POINTER
 216 %token <voidval>        RECEIVE
 217 %token <voidval>        '['
 218 %token <voidval>        ']'
 219 %token <voidval>        '('
 220 %token <voidval>        ')'
 221 %token <voidval>        UP
 222 %token <voidval>        IF
 223 %token <voidval>        THEN
 224 %token <voidval>        ELSE
 225 %token <voidval>        FI
 226 %token <voidval>        ELSIF
 227 %token <voidval>        ILLEGAL_TOKEN
 228 %token <voidval>        NUM
 229 %token <voidval>        PRED
 230 %token <voidval>        SUCC
 231 %token <voidval>        ABS
 232 %token <voidval>        CARD
 233 %token <voidval>        MAX_TOKEN
 234 %token <voidval>        MIN_TOKEN
 235 %token <voidval>        SIZE
 236 %token <voidval>        UPPER
 237 %token <voidval>        LOWER
 238 %token <voidval>        LENGTH
 239
 240 /* Tokens which are not Chill tokens used in expressions, but rather GDB
 241    specific things that we recognize in the same context as Chill tokens
 242    (register names for example). */
 243
 244 %token <lval>           GDB_REGNAME     /* Machine register name */
 245 %token <lval>           GDB_LAST        /* Value history */
 246 %token <ivar>           GDB_VARIABLE    /* Convenience variable */
 247 %token <voidval>        GDB_ASSIGNMENT  /* Assign value to somewhere */
 248
 249 %type <voidval>         location
 250 %type <voidval>         access_name
 251 %type <voidval>         primitive_value
 252 %type <voidval>         location_contents
 253 %type <voidval>         value_name
 254 %type <voidval>         literal
 255 %type <voidval>         tuple
 256 %type <voidval>         value_string_element
 257 %type <voidval>         value_string_slice
 258 %type <voidval>         value_array_element
 259 %type <voidval>         value_array_slice
 260 %type <voidval>         value_structure_field
 261 %type <voidval>         expression_conversion
 262 %type <voidval>         value_procedure_call
 263 %type <voidval>         value_built_in_routine_call
 264 %type <voidval>         chill_value_built_in_routine_call
 265 %type <voidval>         start_expression
 266 %type <voidval>         zero_adic_operator
 267 %type <voidval>         parenthesised_expression
 268 %type <voidval>         value
 269 %type <voidval>         undefined_value
 270 %type <voidval>         expression
 271 %type <voidval>         conditional_expression
 272 %type <voidval>         then_alternative
 273 %type <voidval>         else_alternative
 274 %type <voidval>         sub_expression
 275 %type <voidval>         value_case_alternative
 276 %type <voidval>         operand_0
 277 %type <voidval>         operand_1
 278 %type <voidval>         operand_2
 279 %type <voidval>         operand_3
 280 %type <voidval>         operand_4
 281 %type <voidval>         operand_5
 282 %type <voidval>         operand_6
 283 %type <voidval>         synonym_name
 284 %type <voidval>         value_enumeration_name
 285 %type <voidval>         value_do_with_name
 286 %type <voidval>         value_receive_name
 287 %type <voidval>         string_primitive_value
 288 %type <voidval>         start_element
 289 %type <voidval>         left_element
 290 %type <voidval>         right_element
 291 %type <voidval>         slice_size
 292 %type <voidval>         array_primitive_value
 293 %type <voidval>         expression_list
 294 %type <voidval>         lower_element
 295 %type <voidval>         upper_element
 296 %type <voidval>         first_element
 297 %type <voidval>         mode_argument
 298 %type <voidval>         upper_lower_argument
 299 %type <voidval>         length_argument
 300 %type <voidval>         array_mode_name
 301 %type <voidval>         string_mode_name
 302 %type <voidval>         variant_structure_mode_name
 303 %type <voidval>         boolean_expression
 304 %type <voidval>         case_selector_list
 305 %type <voidval>         subexpression
 306 %type <voidval>         case_label_specification
 307 %type <voidval>         buffer_location
 308 %type <voidval>         single_assignment_action
 309 %type <tsym>            mode_name
 310
 311 %%
 312
 313 /* Z.200, 5.3.1 */
 314
 315 start   :       value { }
 316         |       mode_name
 317                         { write_exp_elt_opcode(OP_TYPE);
 318                           write_exp_elt_type($1.type);
 319                           write_exp_elt_opcode(OP_TYPE);}
 320         ;
 321
 322 value           :       expression
 323                         {
 324                           $$ = 0;       /* FIXME */
 325                         }
 326                 |       undefined_value
 327                         {
 328                           $$ = 0;       /* FIXME */
 329                         }
 330                 ;
 331
 332 undefined_value :       FIXME_01
 333                         {
 334                           $$ = 0;       /* FIXME */
 335                         }
 336                 ;
 337
 338 /* Z.200, 4.2.1 */
 339
 340 location        :       access_name
 341                 |       primitive_value POINTER
 342                         {
 343                           write_exp_elt_opcode (UNOP_IND);
 344                         }
 345                 ;
 346
 347 /* Z.200, 4.2.2 */
 348
 349 access_name     :       LOCATION_NAME
 350                         {
 351                           write_exp_elt_opcode (OP_VAR_VALUE);
 352                           write_exp_elt_block (NULL);
 353                           write_exp_elt_sym ($1.sym);
 354                           write_exp_elt_opcode (OP_VAR_VALUE);
 355                         }
 356                 |       GDB_LAST                /* gdb specific */
 357                         {
 358                           write_exp_elt_opcode (OP_LAST);
 359                           write_exp_elt_longcst ($1);
 360                           write_exp_elt_opcode (OP_LAST);
 361                         }
 362                 |       GDB_REGNAME             /* gdb specific */
 363                         {
 364                           write_exp_elt_opcode (OP_REGISTER);
 365                           write_exp_elt_longcst ($1);
 366                           write_exp_elt_opcode (OP_REGISTER);
 367                         }
 368                 |       GDB_VARIABLE    /* gdb specific */
 369                         {
 370                           write_exp_elt_opcode (OP_INTERNALVAR);
 371                           write_exp_elt_intern ($1);
 372                           write_exp_elt_opcode (OP_INTERNALVAR);
 373                         }
 374                 |       FIXME_03
 375                         {
 376                           $$ = 0;       /* FIXME */
 377                         }
 378                 ;
 379
 380 /* Z.200, 4.2.8 */
 381
 382 expression_list :       expression
 383                         {
 384                           arglist_len = 1;
 385                         }
 386                 |       expression_list ',' expression
 387                         {
 388                           arglist_len++;
 389                         }
 390
 391 /* Z.200, 5.2.1 */
 392
 393 primitive_value :       location_contents
 394                         {
 395                           $$ = 0;       /* FIXME */
 396                         }
 397                 |       value_name
 398                         {
 399                           $$ = 0;       /* FIXME */
 400                         }
 401                 |       literal
 402                         {
 403                           $$ = 0;       /* FIXME */
 404                         }
 405                 |       tuple
 406                         {
 407                           $$ = 0;       /* FIXME */
 408                         }
 409                 |       value_string_element
 410                         {
 411                           $$ = 0;       /* FIXME */
 412                         }
 413                 |       value_string_slice
 414                         {
 415                           $$ = 0;       /* FIXME */
 416                         }
 417                 |       value_array_element
 418                         {
 419                           $$ = 0;       /* FIXME */
 420                         }
 421                 |       value_array_slice
 422                         {
 423                           $$ = 0;       /* FIXME */
 424                         }
 425                 |       value_structure_field
 426                         {
 427                           $$ = 0;       /* FIXME */
 428                         }
 429                 |       expression_conversion
 430                         {
 431                           $$ = 0;       /* FIXME */
 432                         }
 433                 |       value_procedure_call
 434                         {
 435                           $$ = 0;       /* FIXME */
 436                         }
 437                 |       value_built_in_routine_call
 438                         {
 439                           $$ = 0;       /* FIXME */
 440                         }
 441                 |       start_expression
 442                         {
 443                           $$ = 0;       /* FIXME */
 444                         }
 445                 |       zero_adic_operator
 446                         {
 447                           $$ = 0;       /* FIXME */
 448                         }
 449                 |       parenthesised_expression
 450                         {
 451                           $$ = 0;       /* FIXME */
 452                         }
 453                 ;
 454
 455 /* Z.200, 5.2.2 */
 456
 457 location_contents:      location
 458                         {
 459                           $$ = 0;       /* FIXME */
 460                         }
 461                 ;
 462
 463 /* Z.200, 5.2.3 */
 464
 465 value_name      :       synonym_name
 466                         {
 467                           $$ = 0;       /* FIXME */
 468                         }
 469                 |       value_enumeration_name
 470                         {
 471                           $$ = 0;       /* FIXME */
 472                         }
 473                 |       value_do_with_name
 474                         {
 475                           $$ = 0;       /* FIXME */
 476                         }
 477                 |       value_receive_name
 478                         {
 479                           $$ = 0;       /* FIXME */
 480                         }
 481                 |       GENERAL_PROCEDURE_NAME
 482                         {
 483                           write_exp_elt_opcode (OP_VAR_VALUE);
 484                           write_exp_elt_block (NULL);
 485                           write_exp_elt_sym ($1.sym);
 486                           write_exp_elt_opcode (OP_VAR_VALUE);
 487                         }
 488                 ;
 489
 490 /* Z.200, 5.2.4.1 */
 491
 492 literal         :       INTEGER_LITERAL
 493                         {
 494                           write_exp_elt_opcode (OP_LONG);
 495                           write_exp_elt_type ($1.type);
 496                           write_exp_elt_longcst ((LONGEST) ($1.val));
 497                           write_exp_elt_opcode (OP_LONG);
 498                         }
 499                 |       BOOLEAN_LITERAL
 500                         {
 501                           write_exp_elt_opcode (OP_BOOL);
 502                           write_exp_elt_longcst ((LONGEST) $1);
 503                           write_exp_elt_opcode (OP_BOOL);
 504                         }
 505                 |       CHARACTER_LITERAL
 506                         {
 507                           write_exp_elt_opcode (OP_LONG);
 508                           write_exp_elt_type ($1.type);
 509                           write_exp_elt_longcst ((LONGEST) ($1.val));
 510                           write_exp_elt_opcode (OP_LONG);
 511                         }
 512                 |       FLOAT_LITERAL
 513                         {
 514                           write_exp_elt_opcode (OP_DOUBLE);
 515                           write_exp_elt_type (builtin_type_double);
 516                           write_exp_elt_dblcst ($1);
 517                           write_exp_elt_opcode (OP_DOUBLE);
 518                         }
 519                 |       SET_LITERAL
 520                         {
 521                           $$ = 0;       /* FIXME */
 522                         }
 523                 |       EMPTINESS_LITERAL
 524                         {
 525                           $$ = 0;       /* FIXME */
 526                         }
 527                 |       CHARACTER_STRING_LITERAL
 528                         {
 529                           write_exp_elt_opcode (OP_STRING);
 530                           write_exp_string ($1);
 531                           write_exp_elt_opcode (OP_STRING);
 532                         }
 533                 |       BIT_STRING_LITERAL
 534                         {
 535                           write_exp_elt_opcode (OP_BITSTRING);
 536                           write_exp_bitstring ($1);
 537                           write_exp_elt_opcode (OP_BITSTRING);
 538                         }
 539                 ;
 540
 541 /* Z.200, 5.2.5 */
 542
 543 tuple           :       FIXME_04
 544                         {
 545                           $$ = 0;       /* FIXME */
 546                         }
 547                 ;
 548
 549
 550 /* Z.200, 5.2.6 */
 551
 552 value_string_element:   string_primitive_value '(' start_element ')'
 553                         {
 554                           $$ = 0;       /* FIXME */
 555                         }
 556                 ;
 557
 558 /* Z.200, 5.2.7 */
 559
 560 value_string_slice:     string_primitive_value '(' left_element ':' right_element ')'
 561                         {
 562                           $$ = 0;       /* FIXME */
 563                         }
 564                 |       string_primitive_value '(' start_element UP slice_size ')'
 565                         {
 566                           $$ = 0;       /* FIXME */
 567                         }
 568                 ;
 569
 570 /* Z.200, 5.2.8 */
 571
 572 value_array_element:    array_primitive_value '('
 573                                 /* This is to save the value of arglist_len
 574                                    being accumulated for each dimension. */
 575                                 { start_arglist (); }
 576                         expression_list ')'
 577                         {
 578                           write_exp_elt_opcode (MULTI_SUBSCRIPT);
 579                           write_exp_elt_longcst ((LONGEST) end_arglist ());
 580                           write_exp_elt_opcode (MULTI_SUBSCRIPT);
 581                         }
 582                 ;
 583
 584 /* Z.200, 5.2.9 */
 585
 586 value_array_slice:      array_primitive_value '(' lower_element ':' upper_element ')'
 587                         {
 588                           $$ = 0;       /* FIXME */
 589                         }
 590                 |       array_primitive_value '(' first_element UP slice_size ')'
 591                         {
 592                           $$ = 0;       /* FIXME */
 593                         }
 594                 ;
 595
 596 /* Z.200, 5.2.10 */
 597
 598 value_structure_field:  primitive_value FIELD_NAME
 599                         { write_exp_elt_opcode (STRUCTOP_STRUCT);
 600                           write_exp_string ($2);
 601                           write_exp_elt_opcode (STRUCTOP_STRUCT);
 602                         }
 603                 ;
 604
 605 /* Z.200, 5.2.11 */
 606
 607 expression_conversion:  mode_name parenthesised_expression
 608                         {
 609                           write_exp_elt_opcode (UNOP_CAST);
 610                           write_exp_elt_type ($1.type);
 611                           write_exp_elt_opcode (UNOP_CAST);
 612                         }
 613                 ;
 614
 615 /* Z.200, 5.2.12 */
 616
 617 value_procedure_call:   FIXME_05
 618                         {
 619                           $$ = 0;       /* FIXME */
 620                         }
 621                 ;
 622
 623 /* Z.200, 5.2.13 */
 624
 625 value_built_in_routine_call:    chill_value_built_in_routine_call
 626                         {
 627                           $$ = 0;       /* FIXME */
 628                         }
 629                 ;
 630
 631 /* Z.200, 5.2.14 */
 632
 633 start_expression:       FIXME_06
 634                         {
 635                           $$ = 0;       /* FIXME */
 636                         }       /* Not in GNU-Chill */
 637                 ;
 638
 639 /* Z.200, 5.2.15 */
 640
 641 zero_adic_operator:     FIXME_07
 642                         {
 643                           $$ = 0;       /* FIXME */
 644                         }
 645                 ;
 646
 647 /* Z.200, 5.2.16 */
 648
 649 parenthesised_expression:       '(' expression ')'
 650                         {
 651                           $$ = 0;       /* FIXME */
 652                         }
 653                 ;
 654
 655 /* Z.200, 5.3.2 */
 656
 657 expression      :       operand_0
 658                         {
 659                           $$ = 0;       /* FIXME */
 660                         }
 661                 |       single_assignment_action
 662                         {
 663                           $$ = 0;       /* FIXME */
 664                         }
 665                 |       conditional_expression
 666                         {
 667                           $$ = 0;       /* FIXME */
 668                         }
 669                 ;
 670
 671 conditional_expression : IF boolean_expression then_alternative else_alternative FI
 672                         {
 673                           $$ = 0;       /* FIXME */
 674                         }
 675                 |       CASE case_selector_list OF value_case_alternative '[' ELSE sub_expression ']' ESAC
 676                         {
 677                           $$ = 0;       /* FIXME */
 678                         }
 679                 ;
 680
 681 then_alternative:       THEN subexpression
 682                         {
 683                           $$ = 0;       /* FIXME */
 684                         }
 685                 ;
 686
 687 else_alternative:       ELSE subexpression
 688                         {
 689                           $$ = 0;       /* FIXME */
 690                         }
 691                 |       ELSIF boolean_expression then_alternative else_alternative
 692                         {
 693                           $$ = 0;       /* FIXME */
 694                         }
 695                 ;
 696
 697 sub_expression  :       expression
 698                         {
 699                           $$ = 0;       /* FIXME */
 700                         }
 701                 ;
 702
 703 value_case_alternative: case_label_specification ':' sub_expression ';'
 704                         {
 705                           $$ = 0;       /* FIXME */
 706                         }
 707                 ;
 708
 709 /* Z.200, 5.3.3 */
 710
 711 operand_0       :       operand_1
 712                         {
 713                           $$ = 0;       /* FIXME */
 714                         }
 715                 |       operand_0 LOGIOR operand_1
 716                         {
 717                           write_exp_elt_opcode (BINOP_BITWISE_IOR);
 718                         }
 719                 |       operand_0 ORIF operand_1
 720                         {
 721                           $$ = 0;       /* FIXME */
 722                         }
 723                 |       operand_0 LOGXOR operand_1
 724                         {
 725                           write_exp_elt_opcode (BINOP_BITWISE_XOR);
 726                         }
 727                 ;
 728
 729 /* Z.200, 5.3.4 */
 730
 731 operand_1       :       operand_2
 732                         {
 733                           $$ = 0;       /* FIXME */
 734                         }
 735                 |       operand_1 LOGAND operand_2
 736                         {
 737                           write_exp_elt_opcode (BINOP_BITWISE_AND);
 738                         }
 739                 |       operand_1 ANDIF operand_2
 740                         {
 741                           $$ = 0;       /* FIXME */
 742                         }
 743                 ;
 744
 745 /* Z.200, 5.3.5 */
 746
 747 operand_2       :       operand_3
 748                         {
 749                           $$ = 0;       /* FIXME */
 750                         }
 751                 |       operand_2 '=' operand_3
 752                         {
 753                           write_exp_elt_opcode (BINOP_EQUAL);
 754                         }
 755                 |       operand_2 NOTEQUAL operand_3
 756                         {
 757                           write_exp_elt_opcode (BINOP_NOTEQUAL);
 758                         }
 759                 |       operand_2 '>' operand_3
 760                         {
 761                           write_exp_elt_opcode (BINOP_GTR);
 762                         }
 763                 |       operand_2 GTR operand_3
 764                         {
 765                           write_exp_elt_opcode (BINOP_GEQ);
 766                         }
 767                 |       operand_2 '<' operand_3
 768                         {
 769                           write_exp_elt_opcode (BINOP_LESS);
 770                         }
 771                 |       operand_2 LEQ operand_3
 772                         {
 773                           write_exp_elt_opcode (BINOP_LEQ);
 774                         }
 775                 |       operand_2 IN operand_3
 776                         {
 777                           $$ = 0;       /* FIXME */
 778                         }
 779                 ;
 780
 781
 782 /* Z.200, 5.3.6 */
 783
 784 operand_3       :       operand_4
 785                         {
 786                           $$ = 0;       /* FIXME */
 787                         }
 788                 |       operand_3 '+' operand_4
 789                         {
 790                           write_exp_elt_opcode (BINOP_ADD);
 791                         }
 792                 |       operand_3 '-' operand_4
 793                         {
 794                           write_exp_elt_opcode (BINOP_SUB);
 795                         }
 796                 |       operand_3 SLASH_SLASH operand_4
 797                         {
 798                           write_exp_elt_opcode (BINOP_CONCAT);
 799                         }
 800                 ;
 801
 802 /* Z.200, 5.3.7 */
 803
 804 operand_4       :       operand_5
 805                         {
 806                           $$ = 0;       /* FIXME */
 807                         }
 808                 |       operand_4 '*' operand_5
 809                         {
 810                           write_exp_elt_opcode (BINOP_MUL);
 811                         }
 812                 |       operand_4 '/' operand_5
 813                         {
 814                           write_exp_elt_opcode (BINOP_DIV);
 815                         }
 816                 |       operand_4 MOD operand_5
 817                         {
 818                           write_exp_elt_opcode (BINOP_MOD);
 819                         }
 820                 |       operand_4 REM operand_5
 821                         {
 822                           write_exp_elt_opcode (BINOP_REM);
 823                         }
 824                 ;
 825
 826 /* Z.200, 5.3.8 */
 827
 828 operand_5       :       operand_6
 829                         {
 830                           $$ = 0;       /* FIXME */
 831                         }
 832                 |       '-' operand_6
 833                         {
 834                           write_exp_elt_opcode (UNOP_NEG);
 835                         }
 836                 |       NOT operand_6
 837                         {
 838                           write_exp_elt_opcode (UNOP_LOGICAL_NOT);
 839                         }
 840                 |       parenthesised_expression literal
 841 /* We require the string operand to be a literal, to avoid some
 842    nasty parsing ambiguities. */
 843                         {
 844                           write_exp_elt_opcode (BINOP_CONCAT);
 845                         }
 846                 ;
 847
 848 /* Z.200, 5.3.9 */
 849
 850 operand_6       :       POINTER location
 851                         {
 852                           write_exp_elt_opcode (UNOP_ADDR);
 853                         }
 854                 |       RECEIVE buffer_location
 855                         {
 856                           $$ = 0;       /* FIXME */
 857                         }
 858                 |       primitive_value
 859                         {
 860                           $$ = 0;       /* FIXME */
 861                         }
 862                 ;
 863
 864
 865 /* Z.200, 6.2 */
 866
 867 single_assignment_action :
 868                         location GDB_ASSIGNMENT value
 869                         {
 870                           write_exp_elt_opcode (BINOP_ASSIGN);
 871                         }
 872                 ;
 873
 874 /* Z.200, 6.20.3 */
 875
 876 chill_value_built_in_routine_call :
 877                         NUM '(' expression ')'
 878                         {
 879                           $$ = 0;       /* FIXME */
 880                         }
 881                 |       PRED '(' expression ')'
 882                         {
 883                           $$ = 0;       /* FIXME */
 884                         }
 885                 |       SUCC '(' expression ')'
 886                         {
 887                           $$ = 0;       /* FIXME */
 888                         }
 889                 |       ABS '(' expression ')'
 890                         {
 891                           $$ = 0;       /* FIXME */
 892                         }
 893                 |       CARD '(' expression ')'
 894                         {
 895                           $$ = 0;       /* FIXME */
 896                         }
 897                 |       MAX_TOKEN '(' expression ')'
 898                         {
 899                           $$ = 0;       /* FIXME */
 900                         }
 901                 |       MIN_TOKEN '(' expression ')'
 902                         {
 903                           $$ = 0;       /* FIXME */
 904                         }
 905                 |       SIZE '(' location ')'
 906                         {
 907                           $$ = 0;       /* FIXME */
 908                         }
 909                 |       SIZE '(' mode_argument ')'
 910                         {
 911                           $$ = 0;       /* FIXME */
 912                         }
 913                 |       UPPER '(' upper_lower_argument ')'
 914                         {
 915                           $$ = 0;       /* FIXME */
 916                         }
 917                 |       LOWER '(' upper_lower_argument ')'
 918                         {
 919                           $$ = 0;       /* FIXME */
 920                         }
 921                 |       LENGTH '(' length_argument ')'
 922                         {
 923                           $$ = 0;       /* FIXME */
 924                         }
 925                 ;
 926
 927 mode_argument :         mode_name
 928                         {
 929                           $$ = 0;       /* FIXME */
 930                         }
 931                 |       array_mode_name '(' expression ')'
 932                         {
 933                           $$ = 0;       /* FIXME */
 934                         }
 935                 |       string_mode_name '(' expression ')'
 936                         {
 937                           $$ = 0;       /* FIXME */
 938                         }
 939                 |       variant_structure_mode_name '(' expression_list ')'
 940                         {
 941                           $$ = 0;       /* FIXME */
 942                         }
 943                 ;
 944
 945 mode_name :             TYPENAME
 946                 ;
 947
 948 upper_lower_argument :  expression
 949                         {
 950                           $$ = 0;       /* FIXME */
 951                         }
 952                 |       mode_name
 953                         {
 954                           $$ = 0;       /* FIXME */
 955                         }
 956                 ;
 957
 958 length_argument :       expression
 959                         {
 960                           $$ = 0;       /* FIXME */
 961                         }
 962                 ;
 963
 964 /* Z.200, 12.4.3 */
 965
 966 array_primitive_value : primitive_value
 967                         {
 968                           $$ = 0;
 969                         }
 970                 ;
 971
 972
 973 /* Things which still need productions... */
 974
 975 array_mode_name         :       FIXME_08 { $$ = 0; }
 976 string_mode_name        :       FIXME_09 { $$ = 0; }
 977 variant_structure_mode_name:    FIXME_10 { $$ = 0; }
 978 synonym_name            :       FIXME_11 { $$ = 0; }
 979 value_enumeration_name  :       FIXME_12 { $$ = 0; }
 980 value_do_with_name      :       FIXME_13 { $$ = 0; }
 981 value_receive_name      :       FIXME_14 { $$ = 0; }
 982 string_primitive_value  :       FIXME_15 { $$ = 0; }
 983 start_element           :       FIXME_16 { $$ = 0; }
 984 left_element            :       FIXME_17 { $$ = 0; }
 985 right_element           :       FIXME_18 { $$ = 0; }
 986 slice_size              :       FIXME_19 { $$ = 0; }
 987 lower_element           :       FIXME_20 { $$ = 0; }
 988 upper_element           :       FIXME_21 { $$ = 0; }
 989 first_element           :       FIXME_22 { $$ = 0; }
 990 boolean_expression      :       FIXME_26 { $$ = 0; }
 991 case_selector_list      :       FIXME_27 { $$ = 0; }
 992 subexpression           :       FIXME_28 { $$ = 0; }
 993 case_label_specification:       FIXME_29 { $$ = 0; }
 994 buffer_location         :       FIXME_30 { $$ = 0; }
 995
 996 %%
 997
 998 /* Implementation of a dynamically expandable buffer for processing input
 999    characters acquired through lexptr and building a value to return in
1000    yylval. */
1001
1002 static char *tempbuf;           /* Current buffer contents */
1003 static int tempbufsize;         /* Size of allocated buffer */
1004 static int tempbufindex;        /* Current index into buffer */
1005
1006 #define GROWBY_MIN_SIZE 64      /* Minimum amount to grow buffer by */
1007
1008 #define CHECKBUF(size) \
1009   do { \
1010     if (tempbufindex + (size) >= tempbufsize) \
1011       { \
1012         growbuf_by_size (size); \
1013       } \
1014   } while (0);
1015
1016 /* Grow the static temp buffer if necessary, including allocating the first one
1017    on demand. */
1018
1019 static void
1020 growbuf_by_size (count)
1021      int count;
1022 {
1023   int growby;
1024
1025   growby = max (count, GROWBY_MIN_SIZE);
1026   tempbufsize += growby;
1027   if (tempbuf == NULL)
1028     {
1029       tempbuf = (char *) malloc (tempbufsize);
1030     }
1031   else
1032     {
1033       tempbuf = (char *) realloc (tempbuf, tempbufsize);
1034     }
1035 }
1036
1037 /* Try to consume a simple name string token.  If successful, returns
1038    a pointer to a nullbyte terminated copy of the name that can be used
1039    in symbol table lookups.  If not successful, returns NULL. */
1040
1041 static char *
1042 match_simple_name_string ()
1043 {
1044   char *tokptr = lexptr;
1045
1046   if (isalpha (*tokptr))
1047     {
1048       char *result;
1049       do {
1050         tokptr++;
1051       } while (isalnum (*tokptr) || (*tokptr == '_'));
1052       yylval.sval.ptr = lexptr;
1053       yylval.sval.length = tokptr - lexptr;
1054       lexptr = tokptr;
1055       result = copy_name (yylval.sval);
1056       for (tokptr = result; *tokptr; tokptr++)
1057         if (isupper (*tokptr))
1058           *tokptr = tolower(*tokptr);
1059       return result;
1060     }
1061   return (NULL);
1062 }
1063
1064 /* Start looking for a value composed of valid digits as set by the base
1065    in use.  Note that '_' characters are valid anywhere, in any quantity,
1066    and are simply ignored.  Since we must find at least one valid digit,
1067    or reject this token as an integer literal, we keep track of how many
1068    digits we have encountered. */
1069
1070 static int
1071 decode_integer_value (base, tokptrptr, ivalptr)
1072   int base;
1073   char **tokptrptr;
1074   int *ivalptr;
1075 {
1076   char *tokptr = *tokptrptr;
1077   int temp;
1078   int digits = 0;
1079
1080   while (*tokptr != '\0')
1081     {
1082       temp = tolower (*tokptr);
1083       tokptr++;
1084       switch (temp)
1085         {
1086         case '_':
1087           continue;
1088         case '0':  case '1':  case '2':  case '3':  case '4':
1089         case '5':  case '6':  case '7':  case '8':  case '9':
1090           temp -= '0';
1091           break;
1092         case 'a':  case 'b':  case 'c':  case 'd':  case 'e': case 'f':
1093           temp -= 'a';
1094           temp += 10;
1095           break;
1096         default:
1097           temp = base;
1098           break;
1099         }
1100       if (temp < base)
1101         {
1102           digits++;
1103           *ivalptr *= base;
1104           *ivalptr += temp;
1105         }
1106       else
1107         {
1108           /* Found something not in domain for current base. */
1109           tokptr--;     /* Unconsume what gave us indigestion. */
1110           break;
1111         }
1112     }
1113
1114   /* If we didn't find any digits, then we don't have a valid integer
1115      value, so reject the entire token.  Otherwise, update the lexical
1116      scan pointer, and return non-zero for success. */
1117
1118   if (digits == 0)
1119     {
1120       return (0);
1121     }
1122   else
1123     {
1124       *tokptrptr = tokptr;
1125       return (1);
1126     }
1127 }
1128
1129 static int
1130 decode_integer_literal (valptr, tokptrptr)
1131   int *valptr;
1132   char **tokptrptr;
1133 {
1134   char *tokptr = *tokptrptr;
1135   int base = 0;
1136   int ival = 0;
1137   int explicit_base = 0;
1138
1139   /* Look for an explicit base specifier, which is optional. */
1140
1141   switch (*tokptr)
1142     {
1143     case 'd':
1144     case 'D':
1145       explicit_base++;
1146       base = 10;
1147       tokptr++;
1148       break;
1149     case 'b':
1150     case 'B':
1151       explicit_base++;
1152       base = 2;
1153       tokptr++;
1154       break;
1155     case 'h':
1156     case 'H':
1157       explicit_base++;
1158       base = 16;
1159       tokptr++;
1160       break;
1161     case 'o':
1162     case 'O':
1163       explicit_base++;
1164       base = 8;
1165       tokptr++;
1166       break;
1167     default:
1168       base = 10;
1169       break;
1170     }
1171
1172   /* If we found an explicit base ensure that the character after the
1173      explicit base is a single quote. */
1174
1175   if (explicit_base && (*tokptr++ != '\''))
1176     {
1177       return (0);
1178     }
1179
1180   /* Attempt to decode whatever follows as an integer value in the
1181      indicated base, updating the token pointer in the process and
1182      computing the value into ival.  Also, if we have an explicit
1183      base, then the next character must not be a single quote, or we
1184      have a bitstring literal, so reject the entire token in this case.
1185      Otherwise, update the lexical scan pointer, and return non-zero
1186      for success. */
1187
1188   if (!decode_integer_value (base, &tokptr, &ival))
1189     {
1190       return (0);
1191     }
1192   else if (explicit_base && (*tokptr == '\''))
1193     {
1194       return (0);
1195     }
1196   else
1197     {
1198       *valptr = ival;
1199       *tokptrptr = tokptr;
1200       return (1);
1201     }
1202 }
1203
1204 /*  If it wasn't for the fact that floating point values can contain '_'
1205     characters, we could just let strtod do all the hard work by letting it
1206     try to consume as much of the current token buffer as possible and
1207     find a legal conversion.  Unfortunately we need to filter out the '_'
1208     characters before calling strtod, which we do by copying the other
1209     legal chars to a local buffer to be converted.  However since we also
1210     need to keep track of where the last unconsumed character in the input
1211     buffer is, we have transfer only as many characters as may compose a
1212     legal floating point value. */
1213
1214 static int
1215 match_float_literal ()
1216 {
1217   char *tokptr = lexptr;
1218   char *buf;
1219   char *copy;
1220   double dval;
1221   extern double strtod ();
1222
1223   /* Make local buffer in which to build the string to convert.  This is
1224      required because underscores are valid in chill floating point numbers
1225      but not in the string passed to strtod to convert.  The string will be
1226      no longer than our input string. */
1227
1228   copy = buf = (char *) alloca (strlen (tokptr) + 1);
1229
1230   /* Transfer all leading digits to the conversion buffer, discarding any
1231      underscores. */
1232
1233   while (isdigit (*tokptr) || *tokptr == '_')
1234     {
1235       if (*tokptr != '_')
1236         {
1237           *copy++ = *tokptr;
1238         }
1239       tokptr++;
1240     }
1241
1242   /* Now accept either a '.', or one of [eEdD].  Dot is legal regardless
1243      of whether we found any leading digits, and we simply accept it and
1244      continue on to look for the fractional part and/or exponent.  One of
1245      [eEdD] is legal only if we have seen digits, and means that there
1246      is no fractional part.  If we find neither of these, then this is
1247      not a floating point number, so return failure. */
1248
1249   switch (*tokptr++)
1250     {
1251       case '.':
1252         /* Accept and then look for fractional part and/or exponent. */
1253         *copy++ = '.';
1254         break;
1255
1256       case 'e':
1257       case 'E':
1258       case 'd':
1259       case 'D':
1260         if (copy == buf)
1261           {
1262             return (0);
1263           }
1264         *copy++ = 'e';
1265         goto collect_exponent;
1266         break;
1267
1268       default:
1269         return (0);
1270         break;
1271     }
1272
1273   /* We found a '.', copy any fractional digits to the conversion buffer, up
1274      to the first nondigit, non-underscore character. */
1275
1276   while (isdigit (*tokptr) || *tokptr == '_')
1277     {
1278       if (*tokptr != '_')
1279         {
1280           *copy++ = *tokptr;
1281         }
1282       tokptr++;
1283     }
1284
1285   /* Look for an exponent, which must start with one of [eEdD].  If none
1286      is found, jump directly to trying to convert what we have collected
1287      so far. */
1288
1289   switch (*tokptr)
1290     {
1291       case 'e':
1292       case 'E':
1293       case 'd':
1294       case 'D':
1295         *copy++ = 'e';
1296         tokptr++;
1297         break;
1298       default:
1299         goto convert_float;
1300         break;
1301     }
1302
1303   /* Accept an optional '-' or '+' following one of [eEdD]. */
1304
1305   collect_exponent:
1306   if (*tokptr == '+' || *tokptr == '-')
1307     {
1308       *copy++ = *tokptr++;
1309     }
1310
1311   /* Now copy an exponent into the conversion buffer.  Note that at the
1312      moment underscores are *not* allowed in exponents. */
1313
1314   while (isdigit (*tokptr))
1315     {
1316       *copy++ = *tokptr++;
1317     }
1318
1319   /* If we transfered any chars to the conversion buffer, try to interpret its
1320      contents as a floating point value.  If any characters remain, then we
1321      must not have a valid floating point string. */
1322
1323   convert_float:
1324   *copy = '\0';
1325   if (copy != buf)
1326       {
1327         dval = strtod (buf, &copy);
1328         if (*copy == '\0')
1329           {
1330             yylval.dval = dval;
1331             lexptr = tokptr;
1332             return (FLOAT_LITERAL);
1333           }
1334       }
1335   return (0);
1336 }
1337
1338 /* Recognize a string literal.  A string literal is a nonzero sequence
1339    of characters enclosed in matching single or double quotes, except that
1340    a single character inside single quotes is a character literal, which
1341    we reject as a string literal.  To embed the terminator character inside
1342    a string, it is simply doubled (I.E. "this""is""one""string") */
1343
1344 static int
1345 match_string_literal ()
1346 {
1347   char *tokptr = lexptr;
1348
1349   for (tempbufindex = 0, tokptr++; *tokptr != '\0'; tokptr++)
1350     {
1351       CHECKBUF (1);
1352       if (*tokptr == *lexptr)
1353         {
1354           if (*(tokptr + 1) == *lexptr)
1355             {
1356               tokptr++;
1357             }
1358           else
1359             {
1360               break;
1361             }
1362         }
1363       tempbuf[tempbufindex++] = *tokptr;
1364     }
1365   if (*tokptr == '\0'                                   /* no terminator */
1366       || tempbufindex == 0                              /* no string */
1367       || (tempbufindex == 1 && *tokptr == '\''))        /* char literal */
1368     {
1369       return (0);
1370     }
1371   else
1372     {
1373       tempbuf[tempbufindex] = '\0';
1374       yylval.sval.ptr = tempbuf;
1375       yylval.sval.length = tempbufindex;
1376       lexptr = ++tokptr;
1377       return (CHARACTER_STRING_LITERAL);
1378     }
1379 }
1380
1381 /* Recognize a character literal.  A character literal is single character
1382    or a control sequence, enclosed in single quotes.  A control sequence
1383    is a comma separated list of one or more integer literals, enclosed
1384    in parenthesis and introduced with a circumflex character.
1385
1386    EX:  'a'  '^(7)'  '^(7,8)'
1387
1388    As a GNU chill extension, the syntax C'xx' is also recognized as a
1389    character literal, where xx is a hex value for the character.
1390
1391    Note that more than a single character, enclosed in single quotes, is
1392    a string literal.
1393
1394    Also note that the control sequence form is not in GNU Chill since it
1395    is ambiguous with the string literal form using single quotes.  I.E.
1396    is '^(7)' a character literal or a string literal.  In theory it it
1397    possible to tell by context, but GNU Chill doesn't accept the control
1398    sequence form, so neither do we (for now the code is disabled).
1399
1400    Returns CHARACTER_LITERAL if a match is found.
1401    */
1402
1403 static int
1404 match_character_literal ()
1405 {
1406   char *tokptr = lexptr;
1407   int ival = 0;
1408
1409   if ((tolower (*tokptr) == 'c') && (*(tokptr + 1) == '\''))
1410     {
1411       /* We have a GNU chill extension form, so skip the leading "C'",
1412          decode the hex value, and then ensure that we have a trailing
1413          single quote character. */
1414       tokptr += 2;
1415       if (!decode_integer_value (16, &tokptr, &ival) || (*tokptr != '\''))
1416         {
1417           return (0);
1418         }
1419       tokptr++;
1420     }
1421   else if (*tokptr == '\'')
1422     {
1423       tokptr++;
1424
1425       /* Determine which form we have, either a control sequence or the
1426          single character form. */
1427
1428       if ((*tokptr == '^') && (*(tokptr + 1) == '('))
1429         {
1430 #if 0     /* Disable, see note above. -fnf */
1431           /* Match and decode a control sequence.  Return zero if we don't
1432              find a valid integer literal, or if the next unconsumed character
1433              after the integer literal is not the trailing ')'.
1434              FIXME:  We currently don't handle the multiple integer literal
1435              form. */
1436           tokptr += 2;
1437           if (!decode_integer_literal (&ival, &tokptr) || (*tokptr++ != ')'))
1438             {
1439               return (0);
1440             }
1441 #else
1442           return (0);
1443 #endif
1444         }
1445       else
1446         {
1447           ival = *tokptr++;
1448         }
1449
1450       /* The trailing quote has not yet been consumed.  If we don't find
1451          it, then we have no match. */
1452
1453       if (*tokptr++ != '\'')
1454         {
1455           return (0);
1456         }
1457     }
1458   else
1459     {
1460       /* Not a character literal. */
1461       return (0);
1462     }
1463   yylval.typed_val.val = ival;
1464   yylval.typed_val.type = builtin_type_chill_char;
1465   lexptr = tokptr;
1466   return (CHARACTER_LITERAL);
1467 }
1468
1469 /* Recognize an integer literal, as specified in Z.200 sec 5.2.4.2.
1470    Note that according to 5.2.4.2, a single "_" is also a valid integer
1471    literal, however GNU-chill requires there to be at least one "digit"
1472    in any integer literal. */
1473
1474 static int
1475 match_integer_literal ()
1476 {
1477   char *tokptr = lexptr;
1478   int ival;
1479
1480   if (!decode_integer_literal (&ival, &tokptr))
1481     {
1482       return (0);
1483     }
1484   else
1485     {
1486       yylval.typed_val.val = ival;
1487       yylval.typed_val.type = builtin_type_int;
1488       lexptr = tokptr;
1489       return (INTEGER_LITERAL);
1490     }
1491 }
1492
1493 /* Recognize a bit-string literal, as specified in Z.200 sec 5.2.4.8
1494    Note that according to 5.2.4.8, a single "_" is also a valid bit-string
1495    literal, however GNU-chill requires there to be at least one "digit"
1496    in any bit-string literal. */
1497
1498 static int
1499 match_bitstring_literal ()
1500 {
1501   char *tokptr = lexptr;
1502   int mask;
1503   int bitoffset = 0;
1504   int bitcount = 0;
1505   int base;
1506   int digit;
1507
1508   tempbufindex = 0;
1509
1510   /* Look for the required explicit base specifier. */
1511
1512   switch (*tokptr++)
1513     {
1514     case 'b':
1515     case 'B':
1516       base = 2;
1517       break;
1518     case 'o':
1519     case 'O':
1520       base = 8;
1521       break;
1522     case 'h':
1523     case 'H':
1524       base = 16;
1525       break;
1526     default:
1527       return (0);
1528       break;
1529     }
1530
1531   /* Ensure that the character after the explicit base is a single quote. */
1532
1533   if (*tokptr++ != '\'')
1534     {
1535       return (0);
1536     }
1537
1538   while (*tokptr != '\0' && *tokptr != '\'')
1539     {
1540       digit = tolower (*tokptr);
1541       tokptr++;
1542       switch (digit)
1543         {
1544           case '_':
1545             continue;
1546           case '0':  case '1':  case '2':  case '3':  case '4':
1547           case '5':  case '6':  case '7':  case '8':  case '9':
1548             digit -= '0';
1549             break;
1550           case 'a':  case 'b':  case 'c':  case 'd':  case 'e': case 'f':
1551             digit -= 'a';
1552             digit += 10;
1553             break;
1554           default:
1555             return (0);
1556             break;
1557         }
1558       if (digit >= base)
1559         {
1560           /* Found something not in domain for current base. */
1561           return (0);
1562         }
1563       else
1564         {
1565           /* Extract bits from digit, starting with the msbit appropriate for
1566              the current base, and packing them into the bitstring byte,
1567              starting at the lsbit. */
1568           for (mask = (base >> 1); mask > 0; mask >>= 1)
1569             {
1570               bitcount++;
1571               CHECKBUF (1);
1572               if (digit & mask)
1573                 {
1574                   tempbuf[tempbufindex] |= (1 << bitoffset);
1575                 }
1576               bitoffset++;
1577               if (bitoffset == HOST_CHAR_BIT)
1578                 {
1579                   bitoffset = 0;
1580                   tempbufindex++;
1581                 }
1582             }
1583         }
1584     }
1585
1586   /* Verify that we consumed everything up to the trailing single quote,
1587      and that we found some bits (IE not just underbars). */
1588
1589   if (*tokptr++ != '\'')
1590     {
1591       return (0);
1592     }
1593   else
1594     {
1595       yylval.sval.ptr = tempbuf;
1596       yylval.sval.length = bitcount;
1597       lexptr = tokptr;
1598       return (BIT_STRING_LITERAL);
1599     }
1600 }
1601
1602 /* Recognize tokens that start with '$'.  These include:
1603
1604         $regname        A native register name or a "standard
1605                         register name".
1606                         Return token GDB_REGNAME.
1607
1608         $variable       A convenience variable with a name chosen
1609                         by the user.
1610                         Return token GDB_VARIABLE.
1611
1612         $digits         Value history with index <digits>, starting
1613                         from the first value which has index 1.
1614                         Return GDB_LAST.
1615
1616         $$digits        Value history with index <digits> relative
1617                         to the last value.  I.E. $$0 is the last
1618                         value, $$1 is the one previous to that, $$2
1619                         is the one previous to $$1, etc.
1620                         Return token GDB_LAST.
1621
1622         $ | $0 | $$0    The last value in the value history.
1623                         Return token GDB_LAST.
1624
1625         $$              An abbreviation for the second to the last
1626                         value in the value history, I.E. $$1
1627                         Return token GDB_LAST.
1628
1629     Note that we currently assume that register names and convenience
1630     variables follow the convention of starting with a letter or '_'.
1631
1632    */
1633
1634 static int
1635 match_dollar_tokens ()
1636 {
1637   char *tokptr;
1638   int regno;
1639   int namelength;
1640   int negate;
1641   int ival;
1642
1643   /* We will always have a successful match, even if it is just for
1644      a single '$', the abbreviation for $$0.  So advance lexptr. */
1645
1646   tokptr = ++lexptr;
1647
1648   if (*tokptr == '_' || isalpha (*tokptr))
1649     {
1650       /* Look for a match with a native register name, usually something
1651          like "r0" for example. */
1652
1653       for (regno = 0; regno < NUM_REGS; regno++)
1654         {
1655           namelength = strlen (reg_names[regno]);
1656           if (STREQN (tokptr, reg_names[regno], namelength)
1657               && !isalnum (tokptr[namelength]))
1658             {
1659               yylval.lval = regno;
1660               lexptr += namelength + 1;
1661               return (GDB_REGNAME);
1662             }
1663         }
1664
1665       /* Look for a match with a standard register name, usually something
1666          like "pc", which gdb always recognizes as the program counter
1667          regardless of what the native register name is. */
1668
1669       for (regno = 0; regno < num_std_regs; regno++)
1670         {
1671           namelength = strlen (std_regs[regno].name);
1672           if (STREQN (tokptr, std_regs[regno].name, namelength)
1673               && !isalnum (tokptr[namelength]))
1674             {
1675               yylval.lval = std_regs[regno].regnum;
1676               lexptr += namelength;
1677               return (GDB_REGNAME);
1678             }
1679         }
1680
1681       /* Attempt to match against a convenience variable.  Note that
1682          this will always succeed, because if no variable of that name
1683          already exists, the lookup_internalvar will create one for us.
1684          Also note that both lexptr and tokptr currently point to the
1685          start of the input string we are trying to match, and that we
1686          have already tested the first character for non-numeric, so we
1687          don't have to treat it specially. */
1688
1689       while (*tokptr == '_' || isalnum (*tokptr))
1690         {
1691           tokptr++;
1692         }
1693       yylval.sval.ptr = lexptr;
1694       yylval.sval.length = tokptr - lexptr;
1695       yylval.ivar = lookup_internalvar (copy_name (yylval.sval));
1696       lexptr = tokptr;
1697       return (GDB_VARIABLE);
1698     }
1699
1700   /* Since we didn't match against a register name or convenience
1701      variable, our only choice left is a history value. */
1702
1703   if (*tokptr == '$')
1704     {
1705       negate = 1;
1706       ival = 1;
1707       tokptr++;
1708     }
1709   else
1710     {
1711       negate = 0;
1712       ival = 0;
1713     }
1714
1715   /* Attempt to decode more characters as an integer value giving
1716      the index in the history list.  If successful, the value will
1717      overwrite ival (currently 0 or 1), and if not, ival will be
1718      left alone, which is good since it is currently correct for
1719      the '$' or '$$' case. */
1720
1721   decode_integer_literal (&ival, &tokptr);
1722   yylval.lval = negate ? -ival : ival;
1723   lexptr = tokptr;
1724   return (GDB_LAST);
1725 }
1726
1727 struct token
1728 {
1729   char *operator;
1730   int token;
1731 };
1732
1733 static const struct token idtokentab[] =
1734 {
1735     { "length", LENGTH },
1736     { "lower", LOWER },
1737     { "upper", UPPER },
1738     { "andif", ANDIF },
1739     { "pred", PRED },
1740     { "succ", SUCC },
1741     { "card", CARD },
1742     { "size", SIZE },
1743     { "orif", ORIF },
1744     { "num", NUM },
1745     { "abs", ABS },
1746     { "max", MAX_TOKEN },
1747     { "min", MIN_TOKEN },
1748     { "mod", MOD },
1749     { "rem", REM },
1750     { "not", NOT },
1751     { "xor", LOGXOR },
1752     { "and", LOGAND },
1753     { "in", IN },
1754     { "or", LOGIOR }
1755 };
1756
1757 static const struct token tokentab2[] =
1758 {
1759     { ":=", GDB_ASSIGNMENT },
1760     { "//", SLASH_SLASH },
1761     { "->", POINTER },
1762     { "/=", NOTEQUAL },
1763     { "<=", LEQ },
1764     { ">=", GTR }
1765 };
1766
1767 /* Read one token, getting characters through lexptr.  */
1768 /* This is where we will check to make sure that the language and the
1769    operators used are compatible.  */
1770
1771 static int
1772 yylex ()
1773 {
1774     unsigned int i;
1775     int token;
1776     char *simplename;
1777     struct symbol *sym;
1778
1779     /* Skip over any leading whitespace. */
1780     while (isspace (*lexptr))
1781         {
1782             lexptr++;
1783         }
1784     /* Look for special single character cases which can't be the first
1785        character of some other multicharacter token. */
1786     switch (*lexptr)
1787         {
1788             case '\0':
1789                 return (0);
1790             case ',':
1791             case '=':
1792             case ';':
1793             case '!':
1794             case '+':
1795             case '*':
1796             case '(':
1797             case ')':
1798             case '[':
1799             case ']':
1800                 return (*lexptr++);
1801         }
1802     /* Look for characters which start a particular kind of multicharacter
1803        token, such as a character literal, register name, convenience
1804        variable name, string literal, etc. */
1805     switch (*lexptr)
1806       {
1807         case '\'':
1808         case '\"':
1809           /* First try to match a string literal, which is any nonzero
1810              sequence of characters enclosed in matching single or double
1811              quotes, except that a single character inside single quotes
1812              is a character literal, so we have to catch that case also. */
1813           token = match_string_literal ();
1814           if (token != 0)
1815             {
1816               return (token);
1817             }
1818           if (*lexptr == '\'')
1819             {
1820               token = match_character_literal ();
1821               if (token != 0)
1822                 {
1823                   return (token);
1824                 }
1825             }
1826           break;
1827         case 'C':
1828         case 'c':
1829           token = match_character_literal ();
1830           if (token != 0)
1831             {
1832               return (token);
1833             }
1834           break;
1835         case '$':
1836           token = match_dollar_tokens ();
1837           if (token != 0)
1838             {
1839               return (token);
1840             }
1841           break;
1842       }
1843     /* See if it is a special token of length 2.  */
1844     for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++)
1845         {
1846             if (STREQN (lexptr, tokentab2[i].operator, 2))
1847                 {
1848                     lexptr += 2;
1849                     return (tokentab2[i].token);
1850                 }
1851         }
1852     /* Look for single character cases which which could be the first
1853        character of some other multicharacter token, but aren't, or we
1854        would already have found it. */
1855     switch (*lexptr)
1856         {
1857             case '-':
1858             case ':':
1859             case '/':
1860             case '<':
1861             case '>':
1862                 return (*lexptr++);
1863         }
1864     /* Look for a float literal before looking for an integer literal, so
1865        we match as much of the input stream as possible. */
1866     token = match_float_literal ();
1867     if (token != 0)
1868         {
1869             return (token);
1870         }
1871     token = match_bitstring_literal ();
1872     if (token != 0)
1873         {
1874             return (token);
1875         }
1876     token = match_integer_literal ();
1877     if (token != 0)
1878         {
1879             return (token);
1880         }
1881
1882     /* Try to match a simple name string, and if a match is found, then
1883        further classify what sort of name it is and return an appropriate
1884        token.  Note that attempting to match a simple name string consumes
1885        the token from lexptr, so we can't back out if we later find that
1886        we can't classify what sort of name it is. */
1887
1888     simplename = match_simple_name_string ();
1889
1890     if (simplename != NULL)
1891       {
1892         /* See if it is a reserved identifier. */
1893         for (i = 0; i < sizeof (idtokentab) / sizeof (idtokentab[0]); i++)
1894             {
1895                 if (STREQ (simplename, idtokentab[i].operator))
1896                     {
1897                         return (idtokentab[i].token);
1898                     }
1899             }
1900
1901         /* Look for other special tokens. */
1902         if (STREQ (simplename, "true"))
1903             {
1904                 yylval.ulval = 1;
1905                 return (BOOLEAN_LITERAL);
1906             }
1907         if (STREQ (simplename, "false"))
1908             {
1909                 yylval.ulval = 0;
1910                 return (BOOLEAN_LITERAL);
1911             }
1912
1913         sym = lookup_symbol (simplename, expression_context_block,
1914                              VAR_NAMESPACE, (int *) NULL,
1915                              (struct symtab **) NULL);
1916         if (sym != NULL)
1917           {
1918             yylval.ssym.stoken.ptr = NULL;
1919             yylval.ssym.stoken.length = 0;
1920             yylval.ssym.sym = sym;
1921             yylval.ssym.is_a_field_of_this = 0; /* FIXME, C++'ism */
1922             switch (SYMBOL_CLASS (sym))
1923               {
1924               case LOC_BLOCK:
1925                 /* Found a procedure name. */
1926                 return (GENERAL_PROCEDURE_NAME);
1927               case LOC_STATIC:
1928                 /* Found a global or local static variable. */
1929                 return (LOCATION_NAME);
1930               case LOC_REGISTER:
1931               case LOC_ARG:
1932               case LOC_REF_ARG:
1933               case LOC_REGPARM:
1934               case LOC_REGPARM_ADDR:
1935               case LOC_LOCAL:
1936               case LOC_LOCAL_ARG:
1937               case LOC_BASEREG:
1938               case LOC_BASEREG_ARG:
1939                 if (innermost_block == NULL
1940                     || contained_in (block_found, innermost_block))
1941                   {
1942                     innermost_block = block_found;
1943                   }
1944                 return (LOCATION_NAME);
1945                 break;
1946               case LOC_CONST:
1947               case LOC_LABEL:
1948                 return (LOCATION_NAME);
1949                 break;
1950               case LOC_TYPEDEF:
1951                 yylval.tsym.type = SYMBOL_TYPE (sym);
1952                 return TYPENAME;
1953               case LOC_UNDEF:
1954               case LOC_CONST_BYTES:
1955               case LOC_OPTIMIZED_OUT:
1956                 error ("Symbol \"%s\" names no location.", simplename);
1957                 break;
1958               }
1959           }
1960         else if (!have_full_symbols () && !have_partial_symbols ())
1961           {
1962             error ("No symbol table is loaded.  Use the \"file\" command.");
1963           }
1964         else
1965           {
1966             error ("No symbol \"%s\" in current context.", simplename);
1967           }
1968       }
1969
1970     /* Catch single character tokens which are not part of some
1971        longer token. */
1972
1973     switch (*lexptr)
1974       {
1975         case '.':                       /* Not float for example. */
1976           lexptr++;
1977           while (isspace (*lexptr)) lexptr++;
1978           simplename = match_simple_name_string ();
1979           if (!simplename)
1980             return '.';
1981           return FIELD_NAME;
1982       }
1983
1984     return (ILLEGAL_TOKEN);
1985 }
1986
1987 void
1988 yyerror (msg)
1989      char *msg; /* unused */
1990 {
1991   printf ("Parsing:  %s\n", lexptr);
1992   if (yychar < 256)
1993     {
1994       error ("Invalid syntax in expression near character '%c'.", yychar);
1995     }
1996   else
1997     {
1998       error ("Invalid syntax in expression");
1999     }
2000 }