URL https://opencores.org/ocsvn/or1k/or1k/trunk
Subversion Repositories or1k

[/] [or1k/] [trunk/] [insight/] [gdb/] [p-exp.tab.c] - Blame information for rev 1771

Go to most recent revision | Details | Compare with Previous | View Log

 
/*  A Bison parser, made from p-exp.y
 by  GNU Bison version 1.27
  */
 
#define YYBISON 1  /* Identify Bison output.  */
 
#define INT     257
#define FLOAT   258
#define STRING  259
#define NAME    260
#define TYPENAME        261
#define NAME_OR_INT     262
#define STRUCT  263
#define CLASS   264
#define SIZEOF  265
#define COLONCOLON      266
#define ERROR   267
#define VARIABLE        268
#define THIS    269
#define TRUE    270
#define FALSE   271
#define ABOVE_COMMA     272
#define ASSIGN  273
#define NOT     274
#define OR      275
#define XOR     276
#define ANDAND  277
#define NOTEQUAL        278
#define LEQ     279
#define GEQ     280
#define LSH     281
#define RSH     282
#define DIV     283
#define MOD     284
#define UNARY   285
#define INCREMENT       286
#define DECREMENT       287
#define ARROW   288
#define BLOCKNAME       289
 
#line 47 "p-exp.y"
 
 
#include "defs.h"
#include "gdb_string.h"
#include <ctype.h>
#include "expression.h"
#include "value.h"
#include "parser-defs.h"
#include "language.h"
#include "p-lang.h"
#include "bfd.h" /* Required by objfiles.h.  */
#include "symfile.h" /* Required by objfiles.h.  */
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
 
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
   as well as gratuitiously global symbol names, so we can have multiple
   yacc generated parsers in gdb.  Note that these are only the variables
   produced by yacc.  If other parser generators (bison, byacc, etc) produce
   additional global names that conflict at link time, then those parser
   generators need to be fixed instead of adding those names to this list. */
 
#define yymaxdepth pascal_maxdepth
#define yyparse pascal_parse
#define yylex   pascal_lex
#define yyerror pascal_error
#define yylval  pascal_lval
#define yychar  pascal_char
#define yydebug pascal_debug
#define yypact  pascal_pact     
#define yyr1    pascal_r1                       
#define yyr2    pascal_r2                       
#define yydef   pascal_def              
#define yychk   pascal_chk              
#define yypgo   pascal_pgo              
#define yyact   pascal_act
#define yyexca  pascal_exca
#define yyerrflag pascal_errflag
#define yynerrs pascal_nerrs
#define yyps    pascal_ps
#define yypv    pascal_pv
#define yys     pascal_s
#define yy_yys  pascal_yys
#define yystate pascal_state
#define yytmp   pascal_tmp
#define yyv     pascal_v
#define yy_yyv  pascal_yyv
#define yyval   pascal_val
#define yylloc  pascal_lloc
#define yyreds  pascal_reds             /* With YYDEBUG defined */
#define yytoks  pascal_toks             /* With YYDEBUG defined */
#define yylhs   pascal_yylhs
#define yylen   pascal_yylen
#define yydefred pascal_yydefred
#define yydgoto pascal_yydgoto
#define yysindex pascal_yysindex
#define yyrindex pascal_yyrindex
#define yygindex pascal_yygindex
#define yytable  pascal_yytable
#define yycheck  pascal_yycheck
 
#ifndef YYDEBUG
#define YYDEBUG 0                /* Default to no yydebug support */
#endif
 
int yyparse (void);
 
static int yylex (void);
 
void
yyerror (char *);
 
static char * uptok (char *, int);
 
#line 125 "p-exp.y"
typedef union
  {
    LONGEST lval;
    struct {
      LONGEST val;
      struct type *type;
    } typed_val_int;
    struct {
      DOUBLEST dval;
      struct type *type;
    } typed_val_float;
    struct symbol *sym;
    struct type *tval;
    struct stoken sval;
    struct ttype tsym;
    struct symtoken ssym;
    int voidval;
    struct block *bval;
    enum exp_opcode opcode;
    struct internalvar *ivar;
 
    struct type **tvec;
    int *ivec;
  } YYSTYPE;
#line 150 "p-exp.y"
 
/* YYSTYPE gets defined by %union */
static int
parse_number (char *, int, int, YYSTYPE *);
#include <stdio.h>
 
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
 
 
 
#define YYFINAL         117
#define YYFLAG          -32768
#define YYNTBASE        51
 
#define YYTRANSLATE(x) ((unsigned)(x) <= 289 ? yytranslate[x] : 65)
 
static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,    46,
    49,    38,    36,    18,    37,    44,    39,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,    27,
    25,    28,     2,    35,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    45,     2,    50,    48,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     3,     4,     5,     6,
     7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
    17,    19,    20,    21,    22,    23,    24,    26,    29,    30,
    31,    32,    33,    34,    40,    41,    42,    43,    47
};
 
#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     4,     6,     8,    12,    15,    18,    21,    24,
    29,    34,    38,    43,    44,    50,    51,    53,    57,    62,
    66,    70,    74,    78,    82,    86,    90,    94,    98,   102,
   106,   110,   114,   118,   122,   126,   130,   134,   138,   140,
   142,   144,   146,   148,   150,   152,   157,   159,   161,   163,
   167,   171,   175,   177,   180,   182,   184,   186,   190,   192,
   195,   198,   200,   202,   204,   206,   208
};
 
static const short yyrhs[] = {    53,
     0,    52,     0,    61,     0,    54,     0,    53,    18,    54,
     0,    54,    48,     0,    35,    54,     0,    37,    54,     0,
    21,    54,     0,    41,    46,    54,    49,     0,    42,    46,
    54,    49,     0,    54,    44,    63,     0,    54,    45,    53,
    50,     0,     0,    54,    46,    55,    56,    49,     0,     0,
    54,     0,    56,    18,    54,     0,    61,    46,    54,    49,
     0,    46,    53,    49,     0,    54,    38,    54,     0,    54,
    39,    54,     0,    54,    33,    54,     0,    54,    34,    54,
     0,    54,    36,    54,     0,    54,    37,    54,     0,    54,
    31,    54,     0,    54,    32,    54,     0,    54,    25,    54,
     0,    54,    26,    54,     0,    54,    29,    54,     0,    54,
    30,    54,     0,    54,    27,    54,     0,    54,    28,    54,
     0,    54,    24,    54,     0,    54,    23,    54,     0,    54,
    22,    54,     0,    54,    20,    54,     0,    16,     0,    17,
     0,     3,     0,     8,     0,     4,     0,    58,     0,    14,
     0,    11,    46,    61,    49,     0,     5,     0,    15,     0,
    47,     0,    57,    12,    63,     0,    57,    12,    63,     0,
    62,    12,    63,     0,    59,     0,    12,    63,     0,    64,
     0,    62,     0,    60,     0,    62,    12,    38,     0,     7,
     0,     9,    63,     0,    10,    63,     0,     6,     0,    47,
     0,     7,     0,     8,     0,     6,     0,    47,     0
};
 
#endif
 
#if YYDEBUG != 0
static const short yyrline[] = { 0,
   222,   223,   226,   233,   234,   239,   242,   245,   249,   253,
   257,   261,   267,   271,   275,   281,   282,   284,   288,   294,
   300,   304,   308,   312,   316,   320,   324,   328,   332,   336,
   340,   344,   348,   352,   356,   360,   364,   368,   372,   378,
   384,   391,   402,   409,   412,   416,   424,   449,   456,   473,
   484,   500,   515,   516,   550,   608,   619,   620,   625,   627,
   630,   638,   639,   640,   641,   644,   645
};
#endif
 
 
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
 
static const char * const yytname[] = {   "$","error","$undefined.","INT","FLOAT",
"STRING","NAME","TYPENAME","NAME_OR_INT","STRUCT","CLASS","SIZEOF","COLONCOLON",
"ERROR","VARIABLE","THIS","TRUE","FALSE","','","ABOVE_COMMA","ASSIGN","NOT",
"OR","XOR","ANDAND","'='","NOTEQUAL","'<'","'>'","LEQ","GEQ","LSH","RSH","DIV",
"MOD","'@'","'+'","'-'","'*'","'/'","UNARY","INCREMENT","DECREMENT","ARROW",
"'.'","'['","'('","BLOCKNAME","'^'","')'","']'","start","type_exp","exp1","exp",
"@1","arglist","block","variable","qualified_name","ptype","type","typebase",
"name","name_not_typename", NULL
};
#endif
 
static const short yyr1[] = {     0,
    51,    51,    52,    53,    53,    54,    54,    54,    54,    54,
    54,    54,    54,    55,    54,    56,    56,    56,    54,    54,
    54,    54,    54,    54,    54,    54,    54,    54,    54,    54,
    54,    54,    54,    54,    54,    54,    54,    54,    54,    54,
    54,    54,    54,    54,    54,    54,    54,    54,    57,    57,
    58,    59,    58,    58,    58,    60,    61,    61,    62,    62,
    62,    63,    63,    63,    63,    64,    64
};
 
static const short yyr2[] = {     0,
     1,     1,     1,     1,     3,     2,     2,     2,     2,     4,
     4,     3,     4,     0,     5,     0,     1,     3,     4,     3,
     3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     3,     3,     3,     3,     3,     1,     1,
     1,     1,     1,     1,     1,     4,     1,     1,     1,     3,
     3,     3,     1,     2,     1,     1,     1,     3,     1,     2,
     2,     1,     1,     1,     1,     1,     1
};
 
static const short yydefact[] = {     0,
    41,    43,    47,    66,    59,    42,     0,     0,     0,     0,
    45,    48,    39,    40,     0,     0,     0,     0,     0,     0,
    67,     2,     1,     4,     0,    44,    53,    57,     3,    56,
    55,    62,    64,    65,    63,    60,    61,     0,    54,     9,
     0,     7,     8,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,    14,     6,     0,
     0,     0,     0,    56,     0,     0,    20,     5,    38,    37,
    36,    35,    29,    30,    33,    34,    31,    32,    27,    28,
    23,    24,    25,    26,    21,    22,    12,     0,    16,    51,
     0,    58,    52,    46,     0,    10,    11,    13,    17,     0,
    19,     0,    15,    18,     0,     0,     0
};
 
static const short yydefgoto[] = {   115,
    22,    23,    24,    99,   110,    25,    26,    27,    28,    41,
    30,    36,    31
};
 
static const short yypact[] = {    65,
-32768,-32768,-32768,-32768,-32768,-32768,     5,     5,   -37,     5,
-32768,-32768,-32768,-32768,    65,    65,    65,   -32,   -27,    65,
    14,-32768,     2,   183,    19,-32768,-32768,-32768,   -18,    47,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,     8,-32768,   -38,
   -18,   -38,   -38,    65,    65,     6,    65,    65,    65,    65,
    65,    65,    65,    65,    65,    65,    65,    65,    65,    65,
    65,    65,    65,    65,    65,     5,    65,-32768,-32768,     5,
    65,    15,    11,    51,    93,   123,-32768,   183,   183,   209,
   234,   258,   280,   280,   298,   298,   298,   298,   311,   311,
   311,   311,    50,    50,   -38,   -38,-32768,     7,    65,    52,
   153,-32768,-32768,-32768,    28,-32768,-32768,-32768,   183,     9,
-32768,    65,-32768,   183,    78,    83,-32768
};
 
static const short yypgoto[] = {-32768,
-32768,   -16,   -15,-32768,-32768,-32768,-32768,-32768,-32768,    16,
    49,    -5,-32768
};
 
 
#define YYLAST          359
 
 
static const short yytable[] = {    40,
    42,    43,    37,    46,    39,    66,    67,    68,    38,    69,
    32,    33,    34,    44,     5,    29,     7,     8,    45,    47,
    32,    33,    34,    47,    47,   -49,   112,    71,    75,    76,
    70,    78,    79,    80,    81,    82,    83,    84,    85,    86,
    87,    88,    89,    90,    91,    92,    93,    94,    95,    96,
    98,    35,   102,    73,    77,   101,   108,   113,    72,   104,
    97,    35,   105,   -50,   100,   102,   103,     1,     2,     3,
     4,     5,     6,     7,     8,     9,    10,   116,    11,    12,
    13,    14,   117,   109,     0,    15,    74,    64,    65,     0,
     0,     0,     0,    66,    67,    68,   114,    69,     0,    16,
     0,    17,     0,     0,     0,    18,    19,     0,     0,     0,
    20,    21,    48,     0,    49,    50,    51,    52,    53,    54,
    55,    56,    57,    58,    59,    60,    61,     0,    62,    63,
    64,    65,     0,     0,     0,     0,    66,    67,    68,     0,
    69,   106,    48,     0,    49,    50,    51,    52,    53,    54,
    55,    56,    57,    58,    59,    60,    61,     0,    62,    63,
    64,    65,     0,     0,     0,     0,    66,    67,    68,     0,
    69,   107,    48,     0,    49,    50,    51,    52,    53,    54,
    55,    56,    57,    58,    59,    60,    61,     0,    62,    63,
    64,    65,     0,     0,     0,     0,    66,    67,    68,     0,
    69,   111,    48,     0,    49,    50,    51,    52,    53,    54,
    55,    56,    57,    58,    59,    60,    61,     0,    62,    63,
    64,    65,     0,     0,     0,     0,    66,    67,    68,     0,
    69,    50,    51,    52,    53,    54,    55,    56,    57,    58,
    59,    60,    61,     0,    62,    63,    64,    65,     0,     0,
     0,     0,    66,    67,    68,     0,    69,    51,    52,    53,
    54,    55,    56,    57,    58,    59,    60,    61,     0,    62,
    63,    64,    65,     0,     0,     0,     0,    66,    67,    68,
     0,    69,    52,    53,    54,    55,    56,    57,    58,    59,
    60,    61,     0,    62,    63,    64,    65,     0,     0,     0,
     0,    66,    67,    68,     0,    69,    54,    55,    56,    57,
    58,    59,    60,    61,     0,    62,    63,    64,    65,     0,
     0,     0,     0,    66,    67,    68,     0,    69,    58,    59,
    60,    61,     0,    62,    63,    64,    65,     0,     0,     0,
     0,    66,    67,    68,     0,    69,    62,    63,    64,    65,
     0,     0,     0,     0,    66,    67,    68,     0,    69
};
 
static const short yycheck[] = {    15,
    16,    17,     8,    20,    10,    44,    45,    46,    46,    48,
     6,     7,     8,    46,     7,     0,     9,    10,    46,    18,
     6,     7,     8,    18,    18,    12,    18,    46,    44,    45,
    12,    47,    48,    49,    50,    51,    52,    53,    54,    55,
    56,    57,    58,    59,    60,    61,    62,    63,    64,    65,
    67,    47,    38,    38,    49,    71,    50,    49,    12,    49,
    66,    47,    12,    12,    70,    38,    72,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    12,     0,    14,    15,
    16,    17,     0,    99,    -1,    21,    38,    38,    39,    -1,
    -1,    -1,    -1,    44,    45,    46,   112,    48,    -1,    35,
    -1,    37,    -1,    -1,    -1,    41,    42,    -1,    -1,    -1,
    46,    47,    20,    -1,    22,    23,    24,    25,    26,    27,
    28,    29,    30,    31,    32,    33,    34,    -1,    36,    37,
    38,    39,    -1,    -1,    -1,    -1,    44,    45,    46,    -1,
    48,    49,    20,    -1,    22,    23,    24,    25,    26,    27,
    28,    29,    30,    31,    32,    33,    34,    -1,    36,    37,
    38,    39,    -1,    -1,    -1,    -1,    44,    45,    46,    -1,
    48,    49,    20,    -1,    22,    23,    24,    25,    26,    27,
    28,    29,    30,    31,    32,    33,    34,    -1,    36,    37,
    38,    39,    -1,    -1,    -1,    -1,    44,    45,    46,    -1,
    48,    49,    20,    -1,    22,    23,    24,    25,    26,    27,
    28,    29,    30,    31,    32,    33,    34,    -1,    36,    37,
    38,    39,    -1,    -1,    -1,    -1,    44,    45,    46,    -1,
    48,    23,    24,    25,    26,    27,    28,    29,    30,    31,
    32,    33,    34,    -1,    36,    37,    38,    39,    -1,    -1,
    -1,    -1,    44,    45,    46,    -1,    48,    24,    25,    26,
    27,    28,    29,    30,    31,    32,    33,    34,    -1,    36,
    37,    38,    39,    -1,    -1,    -1,    -1,    44,    45,    46,
    -1,    48,    25,    26,    27,    28,    29,    30,    31,    32,
    33,    34,    -1,    36,    37,    38,    39,    -1,    -1,    -1,
    -1,    44,    45,    46,    -1,    48,    27,    28,    29,    30,
    31,    32,    33,    34,    -1,    36,    37,    38,    39,    -1,
    -1,    -1,    -1,    44,    45,    46,    -1,    48,    31,    32,
    33,    34,    -1,    36,    37,    38,    39,    -1,    -1,    -1,
    -1,    44,    45,    46,    -1,    48,    36,    37,    38,    39,
    -1,    -1,    -1,    -1,    44,    45,    46,    -1,    48
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"
/* This file comes from bison-1.27.  */
 
/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
 
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.
 
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
 
   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */
 
/* As a special exception, when this file is copied by Bison into a
   Bison output file, you may use that output file without restriction.
   This special exception was added by the Free Software Foundation
   in version 1.24 of Bison.  */
 
/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */
 
#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else /* alloca not defined */
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else /* not sparc */
/* We think this test detects Watcom and Microsoft C.  */
/* This used to test MSDOS, but that is a bad idea
   since that symbol is in the user namespace.  */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for xmalloc.h, which pollutes the namespace;
         instead, just don't use alloca.  */
#endif
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
   So I turned it off.   rms, 2 May 1997.  */
 #pragma alloca
#define YYSTACK_USE_ALLOCA
#else /* not MSDOS, or __TURBOC__, or _AIX */
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
                 and on HPUX 10.  Eventually we can turn this on.  */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif /* __hpux */
#endif
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc */
#endif /* not GNU C */
#endif /* alloca not defined */
#endif /* YYSTACK_USE_ALLOCA not defined */
 
#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC xmalloc
#endif
 
/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */
 
#define yyerrok         (yyerrstatus = 0)
#define yyclearin       (yychar = YYEMPTY)
#define YYEMPTY         -2
#define YYEOF           0
#define YYACCEPT        goto yyacceptlab
#define YYABORT         goto yyabortlab
#define YYERROR         goto yyerrlab1
/* Like YYERROR except do call yyerror.
   This remains here temporarily to ease the
   transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL          goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(token, value) \
do                                                              \
  if (yychar == YYEMPTY && yylen == 1)                          \
    { yychar = (token), yylval = (value);                       \
      yychar1 = YYTRANSLATE (yychar);                           \
      YYPOPSTACK;                                               \
      goto yybackup;                                            \
    }                                                           \
  else                                                          \
    { yyerror ("syntax error: cannot back up"); YYERROR; }      \
while (0)
 
#define YYTERROR        1
#define YYERRCODE       256
 
#ifndef YYPURE
#define YYLEX           yylex()
#endif
 
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX           yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX           yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX           yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX           yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#endif
 
/* If nonreentrant, generate the variables here */
 
#ifndef YYPURE
 
int     yychar;                 /*  the lookahead symbol                */
YYSTYPE yylval;                 /*  the semantic value of the           */
                                /*  lookahead symbol                    */
 
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;                 /*  location data for the lookahead     */
                                /*  symbol                              */
#endif
 
int yynerrs;                    /*  number of parse errors so far       */
#endif  /* not YYPURE */
 
#if YYDEBUG != 0
int yydebug;                    /*  nonzero means print parse trace     */
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif
 
/*  YYINITDEPTH indicates the initial size of the parser's stacks       */
 
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
 
/*  YYMAXDEPTH is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */
 
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
 
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
 
/* Define __yy_memcpy.  Note that the size argument
   should be passed with type unsigned int, because that is what the non-GCC
   definitions require.  With GCC, __builtin_memcpy takes an arg
   of type size_t, but it can handle unsigned int.  */
 
#if __GNUC__ > 1                /* GNU C and GNU C++ define this.  */
#define __yy_memcpy(TO,FROM,COUNT)      __builtin_memcpy(TO,FROM,COUNT)
#else                           /* not GNU C or C++ */
#ifndef __cplusplus
 
/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (to, from, count)
     char *to;
     char *from;
     unsigned int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;
 
  while (i-- > 0)
    *t++ = *f++;
}
 
#else /* __cplusplus */
 
/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (char *to, char *from, unsigned int count)
{
  register char *t = to;
  register char *f = from;
  register int i = count;
 
  while (i-- > 0)
    *t++ = *f++;
}
 
#endif
#endif
 
#line 216 "/usr/lib/bison.simple"
 
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
   into yyparse.  The argument should have type void *.
   It should actually point to an object.
   Grammar actions can access the variable by casting it
   to the proper pointer type.  */
 
#ifdef YYPARSE_PARAM
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */
 
/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
int yyparse (void *);
#else
int yyparse (void);
#endif
#endif
 
int
yyparse(YYPARSE_PARAM_ARG)
     YYPARSE_PARAM_DECL
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  int yyerrstatus;      /*  number of tokens to shift before error messages enabled */
  int yychar1 = 0;               /*  lookahead token as an internal (translated) token number */
 
  short yyssa[YYINITDEPTH];     /*  the state stack                     */
  YYSTYPE yyvsa[YYINITDEPTH];   /*  the semantic value stack            */
 
  short *yyss = yyssa;          /*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;        /*  to allow yyoverflow to xreallocate them elsewhere */
 
#ifdef YYLSP_NEEDED
  YYLTYPE yylsa[YYINITDEPTH];   /*  the location stack                  */
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;
 
#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK   (yyvsp--, yyssp--)
#endif
 
  int yystacksize = YYINITDEPTH;
  int yyfree_stacks = 0;
 
#ifdef YYPURE
  int yychar;
  YYSTYPE yylval;
  int yynerrs;
#ifdef YYLSP_NEEDED
  YYLTYPE yylloc;
#endif
#endif
 
  YYSTYPE yyval;                /*  the variable used to return         */
                                /*  semantic values from the action     */
                                /*  routines                            */
 
  int yylen;
 
#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif
 
  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;             /* Cause a token to be read.  */
 
  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.
     The wasted elements are never initialized.  */
 
  yyssp = yyss - 1;
  yyvsp = yyvs;
#ifdef YYLSP_NEEDED
  yylsp = yyls;
#endif
 
/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:
 
  *++yyssp = yystate;
 
  if (yyssp >= yyss + yystacksize - 1)
    {
      /* Give user a chance to xreallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif
 
      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;
 
#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
         the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* This used to be a conditional around just the two extra args,
         but that might be undefined if yyoverflow is a macro.  */
      yyoverflow("parser stack overflow",
                 &yyss1, size * sizeof (*yyssp),
                 &yyvs1, size * sizeof (*yyvsp),
                 &yyls1, size * sizeof (*yylsp),
                 &yystacksize);
#else
      yyoverflow("parser stack overflow",
                 &yyss1, size * sizeof (*yyssp),
                 &yyvs1, size * sizeof (*yyvsp),
                 &yystacksize);
#endif
 
      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
        {
          yyerror("parser stack overflow");
          if (yyfree_stacks)
            {
              free (yyss);
              free (yyvs);
#ifdef YYLSP_NEEDED
              free (yyls);
#endif
            }
          return 2;
        }
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
        yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
      yyfree_stacks = 1;
#endif
      yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss, (char *)yyss1,
                   size * (unsigned int) sizeof (*yyssp));
      yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs, (char *)yyvs1,
                   size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls, (char *)yyls1,
                   size * (unsigned int) sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
 
      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif
 
#if YYDEBUG != 0
      if (yydebug)
        fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
 
      if (yyssp >= yyss + yystacksize - 1)
        YYABORT;
    }
 
#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif
 
  goto yybackup;
 yybackup:
 
/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */
 
  /* First try to decide what to do without reference to lookahead token.  */
 
  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;
 
  /* Not known => get a lookahead token if don't already have one.  */
 
  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */
 
  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
        fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }
 
  /* Convert token to internal form (in yychar1) for indexing tables with */
 
  if (yychar <= 0)               /* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;           /* Don't call YYLEX any more */
 
#if YYDEBUG != 0
      if (yydebug)
        fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);
 
#if YYDEBUG != 0
      if (yydebug)
        {
          fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
          /* Give the individual parser a way to print the precise meaning
             of a token, for further debugging info.  */
#ifdef YYPRINT
          YYPRINT (stderr, yychar, yylval);
#endif
          fprintf (stderr, ")\n");
        }
#endif
    }
 
  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;
 
  yyn = yytable[yyn];
 
  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */
 
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
        goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;
 
  if (yyn == YYFINAL)
    YYACCEPT;
 
  /* Shift the lookahead token.  */
 
#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
 
  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;
 
  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif
 
  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;
 
  yystate = yyn;
  goto yynewstate;
 
/* Do the default action for the current state.  */
yydefault:
 
  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;
 
/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */
 
#if YYDEBUG != 0
  if (yydebug)
    {
      int i;
 
      fprintf (stderr, "Reducing via rule %d (line %d), ",
               yyn, yyrline[yyn]);
 
      /* Print the symbols being reduced, and their result.  */
      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
        fprintf (stderr, "%s ", yytname[yyrhs[i]]);
      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif
 
 
  switch (yyn) {
 
case 3:
#line 227 "p-exp.y"
{ write_exp_elt_opcode(OP_TYPE);
                          write_exp_elt_type(yyvsp[0].tval);
                          write_exp_elt_opcode(OP_TYPE);;
    break;}
case 5:
#line 235 "p-exp.y"
{ write_exp_elt_opcode (BINOP_COMMA); ;
    break;}
case 6:
#line 240 "p-exp.y"
{ write_exp_elt_opcode (UNOP_IND); ;
    break;}
case 7:
#line 243 "p-exp.y"
{ write_exp_elt_opcode (UNOP_ADDR); ;
    break;}
case 8:
#line 246 "p-exp.y"
{ write_exp_elt_opcode (UNOP_NEG); ;
    break;}
case 9:
#line 250 "p-exp.y"
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); ;
    break;}
case 10:
#line 254 "p-exp.y"
{ write_exp_elt_opcode (UNOP_PREINCREMENT); ;
    break;}
case 11:
#line 258 "p-exp.y"
{ write_exp_elt_opcode (UNOP_PREDECREMENT); ;
    break;}
case 12:
#line 262 "p-exp.y"
{ write_exp_elt_opcode (STRUCTOP_STRUCT);
                          write_exp_string (yyvsp[0].sval);
                          write_exp_elt_opcode (STRUCTOP_STRUCT); ;
    break;}
case 13:
#line 268 "p-exp.y"
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); ;
    break;}
case 14:
#line 274 "p-exp.y"
{ start_arglist (); ;
    break;}
case 15:
#line 276 "p-exp.y"
{ write_exp_elt_opcode (OP_FUNCALL);
                          write_exp_elt_longcst ((LONGEST) end_arglist ());
                          write_exp_elt_opcode (OP_FUNCALL); ;
    break;}
case 17:
#line 283 "p-exp.y"
{ arglist_len = 1; ;
    break;}
case 18:
#line 285 "p-exp.y"
{ arglist_len++; ;
    break;}
case 19:
#line 289 "p-exp.y"
{ write_exp_elt_opcode (UNOP_CAST);
                          write_exp_elt_type (yyvsp[-3].tval);
                          write_exp_elt_opcode (UNOP_CAST); ;
    break;}
case 20:
#line 295 "p-exp.y"
{ ;
    break;}
case 21:
#line 301 "p-exp.y"
{ write_exp_elt_opcode (BINOP_MUL); ;
    break;}
case 22:
#line 305 "p-exp.y"
{ write_exp_elt_opcode (BINOP_DIV); ;
    break;}
case 23:
#line 309 "p-exp.y"
{ write_exp_elt_opcode (BINOP_INTDIV); ;
    break;}
case 24:
#line 313 "p-exp.y"
{ write_exp_elt_opcode (BINOP_REM); ;
    break;}
case 25:
#line 317 "p-exp.y"
{ write_exp_elt_opcode (BINOP_ADD); ;
    break;}
case 26:
#line 321 "p-exp.y"
{ write_exp_elt_opcode (BINOP_SUB); ;
    break;}
case 27:
#line 325 "p-exp.y"
{ write_exp_elt_opcode (BINOP_LSH); ;
    break;}
case 28:
#line 329 "p-exp.y"
{ write_exp_elt_opcode (BINOP_RSH); ;
    break;}
case 29:
#line 333 "p-exp.y"
{ write_exp_elt_opcode (BINOP_EQUAL); ;
    break;}
case 30:
#line 337 "p-exp.y"
{ write_exp_elt_opcode (BINOP_NOTEQUAL); ;
    break;}
case 31:
#line 341 "p-exp.y"
{ write_exp_elt_opcode (BINOP_LEQ); ;
    break;}
case 32:
#line 345 "p-exp.y"
{ write_exp_elt_opcode (BINOP_GEQ); ;
    break;}
case 33:
#line 349 "p-exp.y"
{ write_exp_elt_opcode (BINOP_LESS); ;
    break;}
case 34:
#line 353 "p-exp.y"
{ write_exp_elt_opcode (BINOP_GTR); ;
    break;}
case 35:
#line 357 "p-exp.y"
{ write_exp_elt_opcode (BINOP_BITWISE_AND); ;
    break;}
case 36:
#line 361 "p-exp.y"
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); ;
    break;}
case 37:
#line 365 "p-exp.y"
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); ;
    break;}
case 38:
#line 369 "p-exp.y"
{ write_exp_elt_opcode (BINOP_ASSIGN); ;
    break;}
case 39:
#line 373 "p-exp.y"
{ write_exp_elt_opcode (OP_BOOL);
                          write_exp_elt_longcst ((LONGEST) yyvsp[0].lval);
                          write_exp_elt_opcode (OP_BOOL); ;
    break;}
case 40:
#line 379 "p-exp.y"
{ write_exp_elt_opcode (OP_BOOL);
                          write_exp_elt_longcst ((LONGEST) yyvsp[0].lval);
                          write_exp_elt_opcode (OP_BOOL); ;
    break;}
case 41:
#line 385 "p-exp.y"
{ write_exp_elt_opcode (OP_LONG);
                          write_exp_elt_type (yyvsp[0].typed_val_int.type);
                          write_exp_elt_longcst ((LONGEST)(yyvsp[0].typed_val_int.val));
                          write_exp_elt_opcode (OP_LONG); ;
    break;}
case 42:
#line 392 "p-exp.y"
{ YYSTYPE val;
                          parse_number (yyvsp[0].ssym.stoken.ptr, yyvsp[0].ssym.stoken.length, 0, &val);
                          write_exp_elt_opcode (OP_LONG);
                          write_exp_elt_type (val.typed_val_int.type);
                          write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
                          write_exp_elt_opcode (OP_LONG);
                        ;
    break;}
case 43:
#line 403 "p-exp.y"
{ write_exp_elt_opcode (OP_DOUBLE);
                          write_exp_elt_type (yyvsp[0].typed_val_float.type);
                          write_exp_elt_dblcst (yyvsp[0].typed_val_float.dval);
                          write_exp_elt_opcode (OP_DOUBLE); ;
    break;}
case 46:
#line 417 "p-exp.y"
{ write_exp_elt_opcode (OP_LONG);
                          write_exp_elt_type (builtin_type_int);
                          CHECK_TYPEDEF (yyvsp[-1].tval);
                          write_exp_elt_longcst ((LONGEST) TYPE_LENGTH (yyvsp[-1].tval));
                          write_exp_elt_opcode (OP_LONG); ;
    break;}
case 47:
#line 425 "p-exp.y"
{ /* C strings are converted into array constants with
                             an explicit null byte added at the end.  Thus
                             the array upper bound is the string length.
                             There is no such thing in C as a completely empty
                             string. */
                          char *sp = yyvsp[0].sval.ptr; int count = yyvsp[0].sval.length;
                          while (count-- > 0)
                            {
                              write_exp_elt_opcode (OP_LONG);
                              write_exp_elt_type (builtin_type_char);
                              write_exp_elt_longcst ((LONGEST)(*sp++));
                              write_exp_elt_opcode (OP_LONG);
                            }
                          write_exp_elt_opcode (OP_LONG);
                          write_exp_elt_type (builtin_type_char);
                          write_exp_elt_longcst ((LONGEST)'\0');
                          write_exp_elt_opcode (OP_LONG);
                          write_exp_elt_opcode (OP_ARRAY);
                          write_exp_elt_longcst ((LONGEST) 0);
                          write_exp_elt_longcst ((LONGEST) (yyvsp[0].sval.length));
                          write_exp_elt_opcode (OP_ARRAY); ;
    break;}
case 48:
#line 450 "p-exp.y"
{ write_exp_elt_opcode (OP_THIS);
                          write_exp_elt_opcode (OP_THIS); ;
    break;}
case 49:
#line 457 "p-exp.y"
{
                          if (yyvsp[0].ssym.sym != 0)
                              yyval.bval = SYMBOL_BLOCK_VALUE (yyvsp[0].ssym.sym);
                          else
                            {
                              struct symtab *tem =
                                  lookup_symtab (copy_name (yyvsp[0].ssym.stoken));
                              if (tem)
                                yyval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (tem), STATIC_BLOCK);
                              else
                                error ("No file or function \"%s\".",
                                       copy_name (yyvsp[0].ssym.stoken));
                            }
                        ;
    break;}
case 50:
#line 474 "p-exp.y"
{ struct symbol *tem
                            = lookup_symbol (copy_name (yyvsp[0].sval), yyvsp[-2].bval,
                                             VAR_NAMESPACE, (int *) NULL,
                                             (struct symtab **) NULL);
                          if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
                            error ("No function \"%s\" in specified context.",
                                   copy_name (yyvsp[0].sval));
                          yyval.bval = SYMBOL_BLOCK_VALUE (tem); ;
    break;}
case 51:
#line 485 "p-exp.y"
{ struct symbol *sym;
                          sym = lookup_symbol (copy_name (yyvsp[0].sval), yyvsp[-2].bval,
                                               VAR_NAMESPACE, (int *) NULL,
                                               (struct symtab **) NULL);
                          if (sym == 0)
                            error ("No symbol \"%s\" in specified context.",
                                   copy_name (yyvsp[0].sval));
 
                          write_exp_elt_opcode (OP_VAR_VALUE);
                          /* block_found is set by lookup_symbol.  */
                          write_exp_elt_block (block_found);
                          write_exp_elt_sym (sym);
                          write_exp_elt_opcode (OP_VAR_VALUE); ;
    break;}
case 52:
#line 501 "p-exp.y"
{
                          struct type *type = yyvsp[-2].tval;
                          if (TYPE_CODE (type) != TYPE_CODE_STRUCT
                              && TYPE_CODE (type) != TYPE_CODE_UNION)
                            error ("`%s' is not defined as an aggregate type.",
                                   TYPE_NAME (type));
 
                          write_exp_elt_opcode (OP_SCOPE);
                          write_exp_elt_type (type);
                          write_exp_string (yyvsp[0].sval);
                          write_exp_elt_opcode (OP_SCOPE);
                        ;
    break;}
case 54:
#line 517 "p-exp.y"
{
                          char *name = copy_name (yyvsp[0].sval);
                          struct symbol *sym;
                          struct minimal_symbol *msymbol;
 
                          sym =
                            lookup_symbol (name, (const struct block *) NULL,
                                           VAR_NAMESPACE, (int *) NULL,
                                           (struct symtab **) NULL);
                          if (sym)
                            {
                              write_exp_elt_opcode (OP_VAR_VALUE);
                              write_exp_elt_block (NULL);
                              write_exp_elt_sym (sym);
                              write_exp_elt_opcode (OP_VAR_VALUE);
                              break;
                            }
 
                          msymbol = lookup_minimal_symbol (name, NULL, NULL);
                          if (msymbol != NULL)
                            {
                              write_exp_msymbol (msymbol,
                                                 lookup_function_type (builtin_type_int),
                                                 builtin_type_int);
                            }
                          else
                            if (!have_full_symbols () && !have_partial_symbols ())
                              error ("No symbol table is loaded.  Use the \"file\" command.");
                            else
                              error ("No symbol \"%s\" in current context.", name);
                        ;
    break;}
case 55:
#line 551 "p-exp.y"
{ struct symbol *sym = yyvsp[0].ssym.sym;
 
                          if (sym)
                            {
                              if (symbol_read_needs_frame (sym))
                                {
                                  if (innermost_block == 0 ||
                                      contained_in (block_found,
                                                    innermost_block))
                                    innermost_block = block_found;
                                }
 
                              write_exp_elt_opcode (OP_VAR_VALUE);
                              /* We want to use the selected frame, not
                                 another more inner frame which happens to
                                 be in the same block.  */
                              write_exp_elt_block (NULL);
                              write_exp_elt_sym (sym);
                              write_exp_elt_opcode (OP_VAR_VALUE);
                            }
                          else if (yyvsp[0].ssym.is_a_field_of_this)
                            {
                              /* Object pascal: it hangs off of `this'.  Must
                                 not inadvertently convert from a method call
                                 to data ref.  */
                              if (innermost_block == 0 ||
                                  contained_in (block_found, innermost_block))
                                innermost_block = block_found;
                              write_exp_elt_opcode (OP_THIS);
                              write_exp_elt_opcode (OP_THIS);
                              write_exp_elt_opcode (STRUCTOP_PTR);
                              write_exp_string (yyvsp[0].ssym.stoken);
                              write_exp_elt_opcode (STRUCTOP_PTR);
                            }
                          else
                            {
                              struct minimal_symbol *msymbol;
                              register char *arg = copy_name (yyvsp[0].ssym.stoken);
 
                              msymbol =
                                lookup_minimal_symbol (arg, NULL, NULL);
                              if (msymbol != NULL)
                                {
                                  write_exp_msymbol (msymbol,
                                                     lookup_function_type (builtin_type_int),
                                                     builtin_type_int);
                                }
                              else if (!have_full_symbols () && !have_partial_symbols ())
                                error ("No symbol table is loaded.  Use the \"file\" command.");
                              else
                                error ("No symbol \"%s\" in current context.",
                                       copy_name (yyvsp[0].ssym.stoken));
                            }
                        ;
    break;}
case 58:
#line 621 "p-exp.y"
{ yyval.tval = lookup_member_type (builtin_type_int, yyvsp[-2].tval); ;
    break;}
case 59:
#line 626 "p-exp.y"
{ yyval.tval = yyvsp[0].tsym.type; ;
    break;}
case 60:
#line 628 "p-exp.y"
{ yyval.tval = lookup_struct (copy_name (yyvsp[0].sval),
                                              expression_context_block); ;
    break;}
case 61:
#line 631 "p-exp.y"
{ yyval.tval = lookup_struct (copy_name (yyvsp[0].sval),
                                              expression_context_block); ;
    break;}
case 62:
#line 638 "p-exp.y"
{ yyval.sval = yyvsp[0].ssym.stoken; ;
    break;}
case 63:
#line 639 "p-exp.y"
{ yyval.sval = yyvsp[0].ssym.stoken; ;
    break;}
case 64:
#line 640 "p-exp.y"
{ yyval.sval = yyvsp[0].tsym.stoken; ;
    break;}
case 65:
#line 641 "p-exp.y"
{ yyval.sval = yyvsp[0].ssym.stoken; ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 542 "/usr/lib/bison.simple"
 
  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif
 
#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
        fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif
 
  *++yyvsp = yyval;
 
#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif
 
  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */
 
  yyn = yyr1[yyn];
 
  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];
 
  goto yynewstate;
 
yyerrlab:   /* here on detecting error */
 
  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;
 
#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];
 
      if (yyn > YYFLAG && yyn < YYLAST)
        {
          int size = 0;
          char *msg;
          int x, count;
 
          count = 0;
          /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
          for (x = (yyn < 0 ? -yyn : 0);
               x < (sizeof(yytname) / sizeof(char *)); x++)
            if (yycheck[x + yyn] == x)
              size += strlen(yytname[x]) + 15, count++;
          msg = (char *) xmalloc(size + 15);
          if (msg != 0)
            {
              strcpy(msg, "parse error");
 
              if (count < 5)
                {
                  count = 0;
                  for (x = (yyn < 0 ? -yyn : 0);
                       x < (sizeof(yytname) / sizeof(char *)); x++)
                    if (yycheck[x + yyn] == x)
                      {
                        strcat(msg, count == 0 ? ", expecting `" : " or `");
                        strcat(msg, yytname[x]);
                        strcat(msg, "'");
                        count++;
                      }
                }
              yyerror(msg);
              free(msg);
            }
          else
            yyerror ("parse error; also virtual memory exceeded");
        }
      else
#endif /* YYERROR_VERBOSE */
        yyerror("parse error");
    }
 
  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */
 
  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */
 
      /* return failure if at end of input */
      if (yychar == YYEOF)
        YYABORT;
 
#if YYDEBUG != 0
      if (yydebug)
        fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
 
      yychar = YYEMPTY;
    }
 
  /* Else will try to reuse lookahead token
     after shifting the error token.  */
 
  yyerrstatus = 3;              /* Each real token shifted decrements this */
 
  goto yyerrhandle;
 
yyerrdefault:  /* current state does not do anything special for the error token. */
 
#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif
 
yyerrpop:   /* pop the current state because it cannot handle the error token */
 
  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif
 
#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
        fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif
 
yyerrhandle:
 
  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;
 
  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;
 
  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
        goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;
 
  if (yyn == YYFINAL)
    YYACCEPT;
 
#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif
 
  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif
 
  yystate = yyn;
  goto yynewstate;
 
 yyacceptlab:
  /* YYACCEPT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 0;
 
 yyabortlab:
  /* YYABORT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 1;
}
#line 655 "p-exp.y"
 
 
/* Take care of parsing a number (anything that starts with a digit).
   Set yylval and return the token type; update lexptr.
   LEN is the number of characters in it.  */
 
/*** Needs some error checking for the float case ***/
 
static int
parse_number (p, len, parsed_float, putithere)
     register char *p;
     register int len;
     int parsed_float;
     YYSTYPE *putithere;
{
  /* FIXME: Shouldn't these be unsigned?  We don't deal with negative values
     here, and we do kind of silly things like cast to unsigned.  */
  register LONGEST n = 0;
  register LONGEST prevn = 0;
  ULONGEST un;
 
  register int i = 0;
  register int c;
  register int base = input_radix;
  int unsigned_p = 0;
 
  /* Number of "L" suffixes encountered.  */
  int long_p = 0;
 
  /* We have found a "L" or "U" suffix.  */
  int found_suffix = 0;
 
  ULONGEST high_bit;
  struct type *signed_type;
  struct type *unsigned_type;
 
  if (parsed_float)
    {
      /* It's a float since it contains a point or an exponent.  */
      char c;
      int num = 0;       /* number of tokens scanned by scanf */
      char saved_char = p[len];
 
      p[len] = 0;        /* null-terminate the token */
      if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
        num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval,&c);
      else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
        num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval,&c);
      else
        {
#ifdef SCANF_HAS_LONG_DOUBLE
          num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval,&c);
#else
          /* Scan it into a double, then assign it to the long double.
             This at least wins with values representable in the range
             of doubles. */
          double temp;
          num = sscanf (p, "%lg%c", &temp,&c);
          putithere->typed_val_float.dval = temp;
#endif
        }
      p[len] = saved_char;      /* restore the input stream */
      if (num != 1)             /* check scanf found ONLY a float ... */
        return ERROR;
      /* See if it has `f' or `l' suffix (float or long double).  */
 
      c = tolower (p[len - 1]);
 
      if (c == 'f')
        putithere->typed_val_float.type = builtin_type_float;
      else if (c == 'l')
        putithere->typed_val_float.type = builtin_type_long_double;
      else if (isdigit (c) || c == '.')
        putithere->typed_val_float.type = builtin_type_double;
      else
        return ERROR;
 
      return FLOAT;
    }
 
  /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
  if (p[0] == '0')
    switch (p[1])
      {
      case 'x':
      case 'X':
        if (len >= 3)
          {
            p += 2;
            base = 16;
            len -= 2;
          }
        break;
 
      case 't':
      case 'T':
      case 'd':
      case 'D':
        if (len >= 3)
          {
            p += 2;
            base = 10;
            len -= 2;
          }
        break;
 
      default:
        base = 8;
        break;
      }
 
  while (len-- > 0)
    {
      c = *p++;
      if (c >= 'A' && c <= 'Z')
        c += 'a' - 'A';
      if (c != 'l' && c != 'u')
        n *= base;
      if (c >= '0' && c <= '9')
        {
          if (found_suffix)
            return ERROR;
          n += i = c - '0';
        }
      else
        {
          if (base > 10 && c >= 'a' && c <= 'f')
            {
              if (found_suffix)
                return ERROR;
              n += i = c - 'a' + 10;
            }
          else if (c == 'l')
            {
              ++long_p;
              found_suffix = 1;
            }
          else if (c == 'u')
            {
              unsigned_p = 1;
              found_suffix = 1;
            }
          else
            return ERROR;       /* Char not a digit */
        }
      if (i >= base)
        return ERROR;           /* Invalid digit in this base */
 
      /* Portably test for overflow (only works for nonzero values, so make
         a second check for zero).  FIXME: Can't we just make n and prevn
         unsigned and avoid this?  */
      if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
        unsigned_p = 1;         /* Try something unsigned */
 
      /* Portably test for unsigned overflow.
         FIXME: This check is wrong; for example it doesn't find overflow
         on 0x123456789 when LONGEST is 32 bits.  */
      if (c != 'l' && c != 'u' && n != 0)
        {
          if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
            error ("Numeric constant too large.");
        }
      prevn = n;
    }
 
  /* An integer constant is an int, a long, or a long long.  An L
     suffix forces it to be long; an LL suffix forces it to be long
     long.  If not forced to a larger size, it gets the first type of
     the above that it fits in.  To figure out whether it fits, we
     shift it right and see whether anything remains.  Note that we
     can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
     operation, because many compilers will warn about such a shift
     (which always produces a zero result).  Sometimes TARGET_INT_BIT
     or TARGET_LONG_BIT will be that big, sometimes not.  To deal with
     the case where it is we just always shift the value more than
     once, with fewer bits each time.  */
 
  un = (ULONGEST)n >> 2;
  if (long_p == 0
      && (un >> (TARGET_INT_BIT - 2)) == 0)
    {
      high_bit = ((ULONGEST)1) << (TARGET_INT_BIT-1);
 
      /* A large decimal (not hex or octal) constant (between INT_MAX
         and UINT_MAX) is a long or unsigned long, according to ANSI,
         never an unsigned int, but this code treats it as unsigned
         int.  This probably should be fixed.  GCC gives a warning on
         such constants.  */
 
      unsigned_type = builtin_type_unsigned_int;
      signed_type = builtin_type_int;
    }
  else if (long_p <= 1
           && (un >> (TARGET_LONG_BIT - 2)) == 0)
    {
      high_bit = ((ULONGEST)1) << (TARGET_LONG_BIT-1);
      unsigned_type = builtin_type_unsigned_long;
      signed_type = builtin_type_long;
    }
  else
    {
      int shift;
      if (sizeof (ULONGEST) * HOST_CHAR_BIT < TARGET_LONG_LONG_BIT)
        /* A long long does not fit in a LONGEST.  */
        shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
      else
        shift = (TARGET_LONG_LONG_BIT - 1);
      high_bit = (ULONGEST) 1 << shift;
      unsigned_type = builtin_type_unsigned_long_long;
      signed_type = builtin_type_long_long;
    }
 
   putithere->typed_val_int.val = n;
 
   /* If the high bit of the worked out type is set then this number
      has to be unsigned. */
 
   if (unsigned_p || (n & high_bit))
     {
       putithere->typed_val_int.type = unsigned_type;
     }
   else
     {
       putithere->typed_val_int.type = signed_type;
     }
 
   return INT;
}
 
struct token
{
  char *operator;
  int token;
  enum exp_opcode opcode;
};
 
static const struct token tokentab3[] =
  {
    {"shr", RSH, BINOP_END},
    {"shl", LSH, BINOP_END},
    {"and", ANDAND, BINOP_END},
    {"div", DIV, BINOP_END},
    {"not", NOT, BINOP_END},
    {"mod", MOD, BINOP_END},
    {"inc", INCREMENT, BINOP_END},
    {"dec", DECREMENT, BINOP_END},
    {"xor", XOR, BINOP_END}
  };
 
static const struct token tokentab2[] =
  {
    {"or", OR, BINOP_END},
    {"<>", NOTEQUAL, BINOP_END},
    {"<=", LEQ, BINOP_END},
    {">=", GEQ, BINOP_END},
    {":=", ASSIGN, BINOP_END}
  };
 
/* Allocate uppercased var */
/* make an uppercased copy of tokstart */
static char * uptok (tokstart, namelen)
  char *tokstart;
  int namelen;
{
  int i;
  char *uptokstart = (char *)xmalloc(namelen+1);
  for (i = 0;i <= namelen;i++)
    {
      if ((tokstart[i]>='a' && tokstart[i]<='z'))
        uptokstart[i] = tokstart[i]-('a'-'A');
      else
        uptokstart[i] = tokstart[i];
    }
  uptokstart[namelen]='\0';
  return uptokstart;
}
/* Read one token, getting characters through lexptr.  */
 
 
static int
yylex ()
{
  int c;
  int namelen;
  unsigned int i;
  char *tokstart;
  char *uptokstart;
  char *tokptr;
  char *p;
  int explen, tempbufindex;
  static char *tempbuf;
  static int tempbufsize;
 
 retry:
 
  tokstart = lexptr;
  explen = strlen (lexptr);
  /* See if it is a special token of length 3.  */
  if (explen > 2)
    for (i = 0; i < sizeof (tokentab3) / sizeof (tokentab3[0]); i++)
      if (strncasecmp (tokstart, tokentab3[i].operator, 3) == 0
          && (!isalpha (tokentab3[i].operator[0]) || explen == 3
              || (!isalpha (tokstart[3]) && !isdigit (tokstart[3]) && tokstart[3] != '_')))
        {
          lexptr += 3;
          yylval.opcode = tokentab3[i].opcode;
          return tokentab3[i].token;
        }
 
  /* See if it is a special token of length 2.  */
  if (explen > 1)
  for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++)
      if (strncasecmp (tokstart, tokentab2[i].operator, 2) == 0
          && (!isalpha (tokentab2[i].operator[0]) || explen == 2
              || (!isalpha (tokstart[2]) && !isdigit (tokstart[2]) && tokstart[2] != '_')))
        {
          lexptr += 2;
          yylval.opcode = tokentab2[i].opcode;
          return tokentab2[i].token;
        }
 
  switch (c = *tokstart)
    {
    case 0:
      return 0;
 
    case ' ':
    case '\t':
    case '\n':
      lexptr++;
      goto retry;
 
    case '\'':
      /* We either have a character constant ('0' or '\177' for example)
         or we have a quoted symbol reference ('foo(int,int)' in object pascal
         for example). */
      lexptr++;
      c = *lexptr++;
      if (c == '\\')
        c = parse_escape (&lexptr);
      else if (c == '\'')
        error ("Empty character constant.");
 
      yylval.typed_val_int.val = c;
      yylval.typed_val_int.type = builtin_type_char;
 
      c = *lexptr++;
      if (c != '\'')
        {
          namelen = skip_quoted (tokstart) - tokstart;
          if (namelen > 2)
            {
              lexptr = tokstart + namelen;
              if (lexptr[-1] != '\'')
                error ("Unmatched single quote.");
              namelen -= 2;
              tokstart++;
              uptokstart = uptok(tokstart,namelen);
              goto tryname;
            }
          error ("Invalid character constant.");
        }
      return INT;
 
    case '(':
      paren_depth++;
      lexptr++;
      return c;
 
    case ')':
      if (paren_depth == 0)
        return 0;
      paren_depth--;
      lexptr++;
      return c;
 
    case ',':
      if (comma_terminates && paren_depth == 0)
        return 0;
      lexptr++;
      return c;
 
    case '.':
      /* Might be a floating point number.  */
      if (lexptr[1] < '0' || lexptr[1] > '9')
        goto symbol;            /* Nope, must be a symbol. */
      /* FALL THRU into number case.  */
 
    case '0':
    case '1':
    case '2':
    case '3':
    case '4':
    case '5':
    case '6':
    case '7':
    case '8':
    case '9':
      {
        /* It's a number.  */
        int got_dot = 0, got_e = 0, toktype;
        register char *p = tokstart;
        int hex = input_radix > 10;
 
        if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
          {
            p += 2;
            hex = 1;
          }
        else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
          {
            p += 2;
            hex = 0;
          }
 
        for (;; ++p)
          {
            /* This test includes !hex because 'e' is a valid hex digit
               and thus does not indicate a floating point number when
               the radix is hex.  */
            if (!hex && !got_e && (*p == 'e' || *p == 'E'))
              got_dot = got_e = 1;
            /* This test does not include !hex, because a '.' always indicates
               a decimal floating point number regardless of the radix.  */
            else if (!got_dot && *p == '.')
              got_dot = 1;
            else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
                     && (*p == '-' || *p == '+'))
              /* This is the sign of the exponent, not the end of the
                 number.  */
              continue;
            /* We will take any letters or digits.  parse_number will
               complain if past the radix, or if L or U are not final.  */
            else if ((*p < '0' || *p > '9')
                     && ((*p < 'a' || *p > 'z')
                                  && (*p < 'A' || *p > 'Z')))
              break;
          }
        toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
        if (toktype == ERROR)
          {
            char *err_copy = (char *) alloca (p - tokstart + 1);
 
            memcpy (err_copy, tokstart, p - tokstart);
            err_copy[p - tokstart] = 0;
            error ("Invalid number \"%s\".", err_copy);
          }
        lexptr = p;
        return toktype;
      }
 
    case '+':
    case '-':
    case '*':
    case '/':
    case '|':
    case '&':
    case '^':
    case '~':
    case '!':
    case '@':
    case '<':
    case '>':
    case '[':
    case ']':
    case '?':
    case ':':
    case '=':
    case '{':
    case '}':
    symbol:
      lexptr++;
      return c;
 
    case '"':
 
      /* Build the gdb internal form of the input string in tempbuf,
         translating any standard C escape forms seen.  Note that the
         buffer is null byte terminated *only* for the convenience of
         debugging gdb itself and printing the buffer contents when
         the buffer contains no embedded nulls.  Gdb does not depend
         upon the buffer being null byte terminated, it uses the length
         string instead.  This allows gdb to handle C strings (as well
         as strings in other languages) with embedded null bytes */
 
      tokptr = ++tokstart;
      tempbufindex = 0;
 
      do {
        /* Grow the static temp buffer if necessary, including allocating
           the first one on demand. */
        if (tempbufindex + 1 >= tempbufsize)
          {
            tempbuf = (char *) xrealloc (tempbuf, tempbufsize += 64);
          }
        switch (*tokptr)
          {
          case '\0':
          case '"':
            /* Do nothing, loop will terminate. */
            break;
          case '\\':
            tokptr++;
            c = parse_escape (&tokptr);
            if (c == -1)
              {
                continue;
              }
            tempbuf[tempbufindex++] = c;
            break;
          default:
            tempbuf[tempbufindex++] = *tokptr++;
            break;
          }
      } while ((*tokptr != '"') && (*tokptr != '\0'));
      if (*tokptr++ != '"')
        {
          error ("Unterminated string in expression.");
        }
      tempbuf[tempbufindex] = '\0';     /* See note above */
      yylval.sval.ptr = tempbuf;
      yylval.sval.length = tempbufindex;
      lexptr = tokptr;
      return (STRING);
    }
 
  if (!(c == '_' || c == '$'
        || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
    /* We must have come across a bad character (e.g. ';').  */
    error ("Invalid character '%c' in expression.", c);
 
  /* It's a name.  See how long it is.  */
  namelen = 0;
  for (c = tokstart[namelen];
       (c == '_' || c == '$' || (c >= '0' && c <= '9')
        || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
    {
      /* Template parameter lists are part of the name.
         FIXME: This mishandles `print $a<4&&$a>3'.  */
      if (c == '<')
        {
          int i = namelen;
          int nesting_level = 1;
          while (tokstart[++i])
            {
              if (tokstart[i] == '<')
                nesting_level++;
              else if (tokstart[i] == '>')
                {
                  if (--nesting_level == 0)
                    break;
                }
            }
          if (tokstart[i] == '>')
            namelen = i;
          else
            break;
        }
 
      /* do NOT uppercase internals because of registers !!! */
      c = tokstart[++namelen];
    }
 
  uptokstart = uptok(tokstart,namelen);
 
  /* The token "if" terminates the expression and is NOT
     removed from the input stream.  */
  if (namelen == 2 && uptokstart[0] == 'I' && uptokstart[1] == 'F')
    {
      return 0;
    }
 
  lexptr += namelen;
 
  tryname:
 
  /* Catch specific keywords.  Should be done with a data structure.  */
  switch (namelen)
    {
    case 6:
      if (STREQ (uptokstart, "OBJECT"))
        return CLASS;
      if (STREQ (uptokstart, "RECORD"))
        return STRUCT;
      if (STREQ (uptokstart, "SIZEOF"))
        return SIZEOF;
      break;
    case 5:
      if (STREQ (uptokstart, "CLASS"))
        return CLASS;
      if (STREQ (uptokstart, "FALSE"))
        {
          yylval.lval = 0;
          return FALSE;
        }
      break;
    case 4:
      if (STREQ (uptokstart, "TRUE"))
        {
          yylval.lval = 1;
          return TRUE;
        }
      if (STREQ (uptokstart, "SELF"))
        {
          /* here we search for 'this' like
             inserted in FPC stabs debug info */
          static const char this_name[] =
                                 { /* CPLUS_MARKER,*/ 't', 'h', 'i', 's', '\0' };
 
          if (lookup_symbol (this_name, expression_context_block,
                             VAR_NAMESPACE, (int *) NULL,
                             (struct symtab **) NULL))
            return THIS;
        }
      break;
    default:
      break;
    }
 
  yylval.sval.ptr = tokstart;
  yylval.sval.length = namelen;
 
  if (*tokstart == '$')
    {
      /* $ is the normal prefix for pascal hexadecimal values
        but this conflicts with the GDB use for debugger variables
        so in expression to enter hexadecimal values
        we still need to use C syntax with 0xff  */
      write_dollar_variable (yylval.sval);
      return VARIABLE;
    }
 
  /* Use token-type BLOCKNAME for symbols that happen to be defined as
     functions or symtabs.  If this is not so, then ...
     Use token-type TYPENAME for symbols that happen to be defined
     currently as names of types; NAME for other symbols.
     The caller is not constrained to care about the distinction.  */
  {
    char *tmp = copy_name (yylval.sval);
    struct symbol *sym;
    int is_a_field_of_this = 0;
    int hextype;
 
    sym = lookup_symbol (tmp, expression_context_block,
                         VAR_NAMESPACE,
                         &is_a_field_of_this,
                         (struct symtab **) NULL);
    /* second chance uppercased ! */
    if (!sym)
      {
       for (i = 0;i <= namelen;i++)
         {
           if ((tmp[i]>='a' && tmp[i]<='z'))
             tmp[i] -= ('a'-'A');
           /* I am not sure that copy_name gives excatly the same result ! */
           if ((tokstart[i]>='a' && tokstart[i]<='z'))
             tokstart[i] -= ('a'-'A');
         }
        sym = lookup_symbol (tmp, expression_context_block,
                         VAR_NAMESPACE,
                         &is_a_field_of_this,
                         (struct symtab **) NULL);
      }
    /* Call lookup_symtab, not lookup_partial_symtab, in case there are
       no psymtabs (coff, xcoff, or some future change to blow away the
       psymtabs once once symbols are read).  */
    if ((sym && SYMBOL_CLASS (sym) == LOC_BLOCK) ||
        lookup_symtab (tmp))
      {
        yylval.ssym.sym = sym;
        yylval.ssym.is_a_field_of_this = is_a_field_of_this;
        return BLOCKNAME;
      }
    if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
        {
#if 1
          /* Despite the following flaw, we need to keep this code enabled.
             Because we can get called from check_stub_method, if we don't
             handle nested types then it screws many operations in any
             program which uses nested types.  */
          /* In "A::x", if x is a member function of A and there happens
             to be a type (nested or not, since the stabs don't make that
             distinction) named x, then this code incorrectly thinks we
             are dealing with nested types rather than a member function.  */
 
          char *p;
          char *namestart;
          struct symbol *best_sym;
 
          /* Look ahead to detect nested types.  This probably should be
             done in the grammar, but trying seemed to introduce a lot
             of shift/reduce and reduce/reduce conflicts.  It's possible
             that it could be done, though.  Or perhaps a non-grammar, but
             less ad hoc, approach would work well.  */
 
          /* Since we do not currently have any way of distinguishing
             a nested type from a non-nested one (the stabs don't tell
             us whether a type is nested), we just ignore the
             containing type.  */
 
          p = lexptr;
          best_sym = sym;
          while (1)
            {
              /* Skip whitespace.  */
              while (*p == ' ' || *p == '\t' || *p == '\n')
                ++p;
              if (*p == ':' && p[1] == ':')
                {
                  /* Skip the `::'.  */
                  p += 2;
                  /* Skip whitespace.  */
                  while (*p == ' ' || *p == '\t' || *p == '\n')
                    ++p;
                  namestart = p;
                  while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9')
                         || (*p >= 'a' && *p <= 'z')
                         || (*p >= 'A' && *p <= 'Z'))
                    ++p;
                  if (p != namestart)
                    {
                      struct symbol *cur_sym;
                      /* As big as the whole rest of the expression, which is
                         at least big enough.  */
                      char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3);
                      char *tmp1;
 
                      tmp1 = ncopy;
                      memcpy (tmp1, tmp, strlen (tmp));
                      tmp1 += strlen (tmp);
                      memcpy (tmp1, "::", 2);
                      tmp1 += 2;
                      memcpy (tmp1, namestart, p - namestart);
                      tmp1[p - namestart] = '\0';
                      cur_sym = lookup_symbol (ncopy, expression_context_block,
                                               VAR_NAMESPACE, (int *) NULL,
                                               (struct symtab **) NULL);
                      if (cur_sym)
                        {
                          if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF)
                            {
                              best_sym = cur_sym;
                              lexptr = p;
                            }
                          else
                            break;
                        }
                      else
                        break;
                    }
                  else
                    break;
                }
              else
                break;
            }
 
          yylval.tsym.type = SYMBOL_TYPE (best_sym);
#else /* not 0 */
          yylval.tsym.type = SYMBOL_TYPE (sym);
#endif /* not 0 */
          return TYPENAME;
        }
    if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0)
        return TYPENAME;
 
    /* Input names that aren't symbols but ARE valid hex numbers,
       when the input radix permits them, can be names or numbers
       depending on the parse.  Note we support radixes > 16 here.  */
    if (!sym &&
        ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
         (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
      {
        YYSTYPE newlval;        /* Its value is ignored.  */
        hextype = parse_number (tokstart, namelen, 0, &newlval);
        if (hextype == INT)
          {
            yylval.ssym.sym = sym;
            yylval.ssym.is_a_field_of_this = is_a_field_of_this;
            return NAME_OR_INT;
          }
      }
 
    free(uptokstart);
    /* Any other kind of symbol */
    yylval.ssym.sym = sym;
    yylval.ssym.is_a_field_of_this = is_a_field_of_this;
    return NAME;
  }
}
 
void
yyerror (msg)
     char *msg;
{
  error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
}
Browse

Tools

Subversion Repositories or1k

[/] [or1k/] [trunk/] [insight/] [gdb/] [p-exp.tab.c] - Blame information for rev 1771

Line No.	Rev	Author	Line
1	578	markom
2			`/* A Bison parser, made from p-exp.y`
3			`by GNU Bison version 1.27`
4			`*/`
5
6			`#define YYBISON 1 /* Identify Bison output. */`
7
8			`#define INT 257`
9			`#define FLOAT 258`
10			`#define STRING 259`
11			`#define NAME 260`
12			`#define TYPENAME 261`
13			`#define NAME_OR_INT 262`
14			`#define STRUCT 263`
15			`#define CLASS 264`
16			`#define SIZEOF 265`
17			`#define COLONCOLON 266`
18			`#define ERROR 267`
19			`#define VARIABLE 268`
20			`#define THIS 269`
21			`#define TRUE 270`
22			`#define FALSE 271`
23			`#define ABOVE_COMMA 272`
24			`#define ASSIGN 273`
25			`#define NOT 274`
26			`#define OR 275`
27			`#define XOR 276`
28			`#define ANDAND 277`
29			`#define NOTEQUAL 278`
30			`#define LEQ 279`
31			`#define GEQ 280`
32			`#define LSH 281`
33			`#define RSH 282`
34			`#define DIV 283`
35			`#define MOD 284`
36			`#define UNARY 285`
37			`#define INCREMENT 286`
38			`#define DECREMENT 287`
39			`#define ARROW 288`
40			`#define BLOCKNAME 289`