gdb/ch-exp.y

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