
/*  A Bison parser, made from c-parse.y  */

#define	IDENTIFIER	258
#define	TYPENAME	259
#define	SCSPEC	260
#define	TYPESPEC	261
#define	TYPE_QUAL	262
#define	CONSTANT	263
#define	STRING	264
#define	ELLIPSIS	265
#define	SIZEOF	266
#define	ENUM	267
#define	STRUCT	268
#define	UNION	269
#define	IF	270
#define	ELSE	271
#define	WHILE	272
#define	DO	273
#define	FOR	274
#define	SWITCH	275
#define	CASE	276
#define	DEFAULT	277
#define	BREAK	278
#define	CONTINUE	279
#define	RETURN	280
#define	GOTO	281
#define	ASM	282
#define	TYPEOF	283
#define	ALIGNOF	284
#define	ASSIGN	285
#define	OROR	286
#define	ANDAND	287
#define	EQCOMPARE	288
#define	ARITHCOMPARE	289
#define	LSHIFT	290
#define	RSHIFT	291
#define	UNARY	292
#define	PLUSPLUS	293
#define	MINUSMINUS	294
#define	HYPERUNARY	295
#define	POINTSAT	296

#line 48 "c-parse.y"

#include "config.h"
#include "tree.h"
#include "c-parse.h"
#include "c-tree.h"

#include <stdio.h>
#include <errno.h>

#ifndef errno
extern int errno;
#endif

/* Cause the `yydebug' variable to be defined.  */
#define YYDEBUG

#line 67 "c-parse.y"
typedef union {long itype; tree ttype; enum tree_code code; char *cptr; } YYSTYPE;
#line 151 "c-parse.y"

/* the declaration found for the last IDENTIFIER token read in.
   yylex must look this up to detect typedefs, which get token type TYPENAME,
   so it is left around in case the identifier is not a typedef but is
   used in a context which makes it a reference to a variable.  */
static tree lastiddecl;

static tree make_pointer_declarator ();
static tree combine_strings ();
static void reinit_parse_for_function ();

extern double atof ();

/* List of types and structure classes of the current declaration */
tree current_declspecs;

char *input_filename;		/* source file current line is coming from */
char *main_input_filename;	/* top-level source file */

static int yylex ();

#ifndef YYLTYPE
typedef
  struct yyltype
    {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
  yyltype;

#define YYLTYPE yyltype
#endif

#define	YYACCEPT	return(0)
#define	YYABORT	return(1)
#define	YYERROR	goto yyerrlab
#include <stdio.h>

#ifndef __STDC__
#define const
#endif



#define	YYFINAL		493
#define	YYFLAG		-32768
#define	YYNTBASE	64

#define YYTRANSLATE(x) ((unsigned)(x) <= 296 ? yytranslate[x] : 165)

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,    59,     2,     2,     2,    47,    38,     2,    54,
    55,    45,    43,    60,    44,    53,    46,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    33,    56,     2,
    31,     2,    32,     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,
    62,     2,    63,    37,     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,    61,    36,    57,    58,     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,     2,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
    26,    27,    28,    29,    30,    34,    35,    39,    40,    41,
    42,    48,    49,    50,    51,    52
};

static const short yyrline[] = {     0,
   174,   175,   182,   184,   184,   185,   187,   189,   190,   197,
   203,   205,   207,   209,   211,   212,   213,   216,   222,   224,
   225,   227,   232,   234,   235,   237,   242,   244,   245,   249,
   251,   254,   256,   258,   260,   262,   264,   266,   270,   274,
   277,   280,   283,   287,   289,   291,   293,   296,   308,   313,
   315,   320,   322,   324,   326,   328,   330,   332,   334,   336,
   338,   340,   342,   344,   346,   348,   350,   352,   354,   358,
   382,   383,   385,   387,   389,   396,   400,   402,   404,   406,
   408,   410,   415,   417,   421,   423,   426,   428,   429,   430,
   435,   440,   443,   445,   447,   455,   458,   462,   464,   466,
   474,   477,   479,   481,   490,   493,   497,   499,   507,   508,
   509,   510,   514,   522,   523,   524,   527,   529,   532,   534,
   537,   540,   548,   553,   554,   559,   564,   565,   570,   572,
   576,   578,   580,   586,   589,   596,   598,   603,   606,   611,
   613,   615,   617,   625,   631,   633,   635,   637,   643,   649,
   651,   653,   655,   657,   660,   665,   669,   672,   674,   676,
   678,   681,   683,   686,   689,   692,   695,   699,   701,   704,
   706,   710,   712,   714,   728,   732,   735,   739,   742,   743,
   747,   750,   752,   761,   763,   768,   771,   775,   778,   782,
   785,   788,   791,   795,   798,   802,   806,   808,   810,   812,
   814,   816,   818,   820,   828,   830,   831,   834,   836,   839,
   842,   851,   853,   856,   857,   861,   865,   871,   876,   878,
   880,   884,   887,   888,   890,   893,   897,   898,   901,   903,
   908,   913,   917,   923,   929,   936,   938,   964,   964,   975,
   975,   979,   983,   986,   989,   993,   998,  1003,  1008,  1013,
  1018,  1018,  1023,  1031,  1037,  1040,  1045,  1047,  1050,  1052,
  1056,  1061,  1064,  1070,  1073,  1078,  1081,  1084,  1086,  1088,
  1092,  1094,  1100,  1102,  1104,  1108,  1111,  1117,  1120,  1122,
  1124,  1126,  1131,  1134
};

static const char * const yytname[] = {     0,
"error","$illegal.","IDENTIFIER","TYPENAME","SCSPEC","TYPESPEC","TYPE_QUAL","CONSTANT","STRING","ELLIPSIS",
"SIZEOF","ENUM","STRUCT","UNION","IF","ELSE","WHILE","DO","FOR","SWITCH",
"CASE","DEFAULT","BREAK","CONTINUE","RETURN","GOTO","ASM","TYPEOF","ALIGNOF","ASSIGN",
"'='","'?'","':'","OROR","ANDAND","'|'","'^'","'&'","EQCOMPARE","ARITHCOMPARE",
"LSHIFT","RSHIFT","'+'","'-'","'*'","'/'","'%'","UNARY","PLUSPLUS","MINUSMINUS",
"HYPERUNARY","POINTSAT","'.'","'('","')'","';'","'}'","'~'","'!'","','",
"'{'","'['","']'","program"
};

static const short yyr1[] = {     0,
    64,    64,    66,    65,    67,    65,    68,    68,    68,    69,
    69,    69,    69,    69,    69,    69,    69,    71,    72,    70,
    70,    73,    74,    70,    70,    75,    76,    70,    70,    77,
    77,    78,    78,    78,    78,    78,    78,    78,    79,    80,
    80,    81,    81,    82,    82,    82,    82,    82,    82,    82,
    82,    82,    82,    82,    82,    82,    82,    82,    82,    82,
    82,    82,    82,    82,    82,    82,    82,    82,    82,    83,
    83,    83,    83,    83,    84,    83,    83,    83,    83,    83,
    83,    83,    85,    85,    86,    86,    87,    87,    87,    87,
    88,    89,    89,    89,    89,    90,    90,    91,    91,    91,
    92,    92,    92,    92,    93,    93,    94,    94,    95,    95,
    95,    95,    95,    96,    96,    96,    97,    97,    98,    98,
    99,    99,   101,   100,   100,   103,   102,   102,   104,   104,
   104,   104,   104,   105,   105,   106,   106,   107,   107,   107,
   107,   107,   107,   108,   108,   108,   108,   108,   109,   109,
   109,   109,   109,   109,   111,   110,   110,   110,   112,   110,
   110,   110,   113,   110,   114,   110,   110,   115,   115,   116,
   116,   117,   117,   117,   118,   118,   118,   119,   119,   119,
   120,   120,   120,   121,   121,   122,   122,   123,   123,   124,
   124,   125,   125,   126,   126,   127,   127,   127,   127,   127,
   127,   127,   127,   127,   128,   128,   128,   129,   129,   130,
   131,   132,   132,   133,   133,   133,   133,   135,   134,   136,
   136,   137,   136,   136,   138,   139,   136,   140,   141,   136,
   142,   143,   144,   136,   145,   136,   146,   136,   147,   136,
   136,   136,   136,   136,   136,   136,   136,   136,   136,   148,
   136,   136,   149,   149,   150,   150,   151,   151,   152,   152,
   153,   154,   154,   156,   155,   158,   157,   159,   159,   159,
   160,   160,   161,   161,   161,   162,   162,   163,   163,   163,
   163,   163,   164,   164
};

static const short yyr2[] = {     0,
     0,     1,     0,     2,     0,     3,     1,     1,     5,     3,
     4,     4,     2,     2,     2,     2,     1,     0,     0,     7,
     4,     0,     0,     7,     4,     0,     0,     6,     3,     1,
     1,     1,     1,     1,     1,     1,     1,     1,     1,     0,
     1,     1,     3,     1,     2,     2,     4,     7,     2,     4,
     2,     4,     3,     3,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     3,     3,     3,     5,     3,     3,     1,
     1,     1,     3,     3,     0,     4,     4,     4,     3,     3,
     2,     2,     1,     2,     0,     1,     1,     1,     2,     2,
     0,     4,     4,     2,     2,     2,     3,     0,     2,     2,
     1,     1,     2,     2,     2,     3,     0,     2,     1,     1,
     1,     4,     4,     1,     1,     1,     1,     3,     1,     3,
     0,     4,     0,     5,     2,     0,     5,     2,     1,     2,
     3,     4,     1,     1,     3,     1,     1,     3,     3,     4,
     3,     3,     1,     3,     4,     3,     3,     1,     3,     3,
     3,     4,     3,     1,     0,     6,     4,     2,     0,     6,
     4,     2,     0,     7,     0,     6,     2,     0,     1,     0,
     1,     0,     3,     2,     3,     3,     1,     0,     1,     3,
     1,     3,     2,     1,     3,     1,     3,     2,     2,     0,
     1,     1,     2,     0,     2,     3,     3,     2,     3,     4,
     3,     2,     3,     2,     1,     2,     2,     0,     1,     2,
     0,     1,     2,     2,     5,     4,     4,     0,     6,     1,
     2,     0,     4,     1,     0,     0,     7,     0,     0,     9,
     0,     0,     0,    12,     0,     6,     0,     5,     0,     4,
     2,     2,     2,     3,     6,     8,    10,    12,     3,     0,
     4,     1,     0,     1,     0,     1,     0,     1,     1,     3,
     4,     1,     3,     0,     2,     0,     2,     2,     2,     2,
     2,     2,     0,     1,     3,     1,     3,     2,     2,     2,
     2,     2,     1,     3
};

static const short yydefact[] = {     3,
     5,     0,     0,     0,   111,   102,   109,   101,     0,     0,
     0,     0,     0,    17,     4,     8,     7,     0,    91,    91,
    98,   110,     6,    15,    16,    30,    31,   165,   167,   172,
   158,   172,   162,     0,     0,   154,   194,     0,     0,   119,
     0,    14,     0,   104,   103,    13,     0,    98,    96,     0,
   163,     0,   155,     0,   159,    83,     0,    70,   192,    71,
     0,     0,    32,    34,    33,     0,    35,    36,     0,    37,
    38,     0,     0,    39,    42,    44,    72,   190,   107,     0,
   190,     0,     0,    10,     0,    29,     0,   266,     0,     0,
   128,   143,   194,     0,     0,   117,     0,   136,   137,     0,
     0,    97,   100,   114,   115,    99,   116,   186,   170,   184,
     0,   177,   174,   157,    91,     0,    91,   172,   161,   172,
    84,     0,     0,    49,     0,    51,    45,     0,     0,     0,
     0,    46,   112,     0,     0,     0,   255,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,    81,    82,     0,     0,    40,     0,   194,   264,     0,
   188,   191,   105,   113,   193,   107,   189,   195,   151,   150,
   120,   121,     0,   149,     0,   153,     0,     0,    27,    86,
     0,    91,    91,    88,   126,     0,     0,    12,     0,    21,
     0,   125,   266,     0,    11,    25,     0,     0,   171,     0,
   170,   178,   173,   178,     0,     0,     9,     0,     0,    74,
    73,   211,     0,     0,    43,    69,    68,   256,     0,    66,
    65,    63,    64,    62,    61,    60,    58,    59,    53,    54,
    55,    56,    57,    80,    79,     0,    41,     0,   198,     0,
   202,     0,   204,     0,   264,     0,   108,   106,     0,     0,
   283,   190,   190,   267,     0,   274,   276,     0,   152,   210,
     0,    89,    90,    94,     0,    95,     0,     0,   142,   138,
   118,    19,   123,   139,   141,     0,    23,   187,   185,   166,
     0,     0,   181,   175,   179,   176,   156,   160,    50,    52,
   214,     0,    76,     0,    47,     0,    77,    78,   197,   196,
     0,   265,     0,   203,   199,   201,     0,   122,   270,   148,
   194,   264,   278,   279,   280,   194,   281,   282,   268,     0,
   269,     0,     0,    28,   212,     0,     0,   121,   133,     0,
   129,   127,     0,     0,   140,     0,   164,   183,     0,     0,
     0,    70,   111,     0,   225,   228,     0,     0,     0,     0,
     0,     0,     0,     0,   253,   252,     0,     0,   208,     0,
   220,   224,   205,   134,   168,    67,   272,   271,   200,   198,
   266,     0,   198,   275,   277,   284,   213,    92,    93,   130,
     0,    20,   124,    24,   182,   180,   216,     0,     0,     0,
   255,     0,     0,   239,   241,   242,   243,     0,     0,   254,
     0,   250,   221,     0,     0,   217,   207,   206,   222,     0,
     0,   147,   144,   146,     0,   131,     0,     0,     0,     0,
     0,     0,   237,     0,   244,   249,     0,     0,   215,     0,
   135,    48,   145,   132,   218,     0,   229,   231,   235,     0,
   240,     0,   251,   223,     0,   226,     0,   255,     0,   238,
   257,     0,   219,     0,     0,     0,   236,     0,     0,   258,
   259,   245,   227,     0,   232,     0,   257,     0,     0,     0,
   255,     0,     0,   246,   260,   230,     0,   261,     0,     0,
   233,   262,     0,   247,     0,     0,     0,   234,   248,   263,
     0,     0,     0
};

static const short yydefgoto[] = {   491,
     1,     2,     3,    15,    16,    17,   191,   333,   197,   336,
    90,   261,   357,    72,   358,   236,    74,    75,    76,   130,
    77,   179,   180,    18,   181,   182,    49,   183,    78,   163,
    21,   106,    95,    39,    91,    96,   334,    40,   268,   364,
   365,   172,    98,   313,    99,    22,   118,   120,   111,    50,
   411,   200,    52,   116,   284,   285,   109,   110,    80,   161,
    81,    82,   162,   360,   405,   184,   292,   324,   361,   362,
   445,   363,   430,   389,   454,   390,   447,   448,   471,   485,
   449,   440,   424,   428,   401,   219,   459,   460,   461,   483,
   241,   242,   174,   175,   254,   302,   255,   256,   257,   258
};

static const short yypact[] = {    49,
    74,  1453,  1453,   162,-32768,-32768,-32768,-32768,    65,    76,
   138,    22,    38,-32768,-32768,-32768,-32768,   244,   104,   657,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    69,-32768,
   117,-32768,   123,   197,  1238,-32768,-32768,   244,    -9,-32768,
   327,-32768,   219,-32768,-32768,-32768,   244,-32768,   248,    59,
-32768,  1382,-32768,  1386,-32768,-32768,    23,-32768,-32768,-32768,
  1282,  1304,-32768,-32768,-32768,  1326,-32768,-32768,   689,-32768,
-32768,  1326,   188,   180,  1031,   120,   236,   109,-32768,   195,
  1203,   185,   224,-32768,   219,-32768,   214,-32768,   266,   362,
   259,-32768,-32768,   219,    31,-32768,   995,    -2,     3,    83,
   391,   248,-32768,-32768,-32768,-32768,-32768,   271,   232,-32768,
    59,-32768,-32768,-32768,-32768,   241,   480,-32768,-32768,-32768,
-32768,   256,   689,-32768,   689,-32768,-32768,   252,   264,   275,
   267,-32768,-32768,  1326,  1326,  1326,  1326,  1326,  1326,  1326,
  1326,  1326,  1326,  1326,  1326,  1326,  1326,  1326,  1326,  1326,
  1326,-32768,-32768,    59,    59,  1326,  1326,-32768,   109,   870,
-32768,    99,   358,-32768,-32768,-32768,-32768,-32768,     3,-32768,
-32768,   311,   197,-32768,   863,-32768,   279,   287,-32768,   420,
   453,   292,   942,-32768,-32768,   231,   226,-32768,   219,-32768,
   362,   319,-32768,   914,-32768,-32768,   362,  1326,    59,   294,
   232,   290,-32768,   290,  1405,  1422,-32768,   297,   305,-32768,
-32768,   304,   318,  1175,  1031,  1031,  1031,-32768,   344,  1503,
  1515,  1526,  1430,  1488,   397,   501,   558,   558,   300,   300,
-32768,-32768,-32768,-32768,-32768,   323,   180,   317,   159,   251,
-32768,  1482,-32768,   322,-32768,   931,-32768,   358,   142,   336,
-32768,   153,  1036,-32768,   338,   339,-32768,   157,-32768,-32768,
    28,-32768,-32768,-32768,   219,-32768,   244,   851,    -2,-32768,
-32768,-32768,-32768,-32768,-32768,   337,-32768,  1031,-32768,-32768,
   325,  1326,   368,   342,-32768,   342,-32768,-32768,   733,   733,
-32768,   512,-32768,   851,-32768,  1326,-32768,-32768,    99,-32768,
   355,-32768,   356,-32768,-32768,-32768,   354,-32768,-32768,-32768,
-32768,    93,   174,     3,-32768,-32768,     3,-32768,-32768,   402,
-32768,   418,   275,-32768,-32768,   211,   261,    32,-32768,   711,
  1031,-32768,    28,   851,-32768,    28,-32768,  1031,  1326,   290,
   227,   395,   396,   381,-32768,-32768,   392,   401,  1326,   416,
   394,   407,  1260,    59,   462,-32768,   450,   429,  1088,   571,
-32768,   472,-32768,-32768,   430,  1479,-32768,-32768,-32768,   141,
-32768,   975,    39,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
   148,-32768,-32768,-32768,  1031,-32768,-32768,  1326,   435,  1147,
  1326,  1326,   466,-32768,-32768,-32768,-32768,   439,   444,-32768,
   447,-32768,-32768,   630,   448,-32768,-32768,-32768,-32768,   770,
   449,   174,-32768,-32768,   441,-32768,   792,   467,  1326,   511,
   493,   496,-32768,  1147,-32768,-32768,   197,  1147,-32768,  1147,
-32768,-32768,-32768,-32768,-32768,   497,-32768,-32768,-32768,  1147,
-32768,    44,-32768,-32768,  1147,-32768,   499,  1326,  1147,-32768,
   545,   502,-32768,  1147,  1326,   503,-32768,   506,     0,   504,
-32768,-32768,-32768,   508,-32768,  1326,   545,   509,   545,   513,
  1326,   521,    17,-32768,-32768,-32768,   522,-32768,   569,   525,
-32768,-32768,   189,-32768,  1147,   527,   575,-32768,-32768,-32768,
   567,   585,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,-32768,   584,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,    -5,-32768,   -35,-32768,   443,   -31,-32768,-32768,
   -33,  -116,   314,    18,  -166,     6,   559,    10,   -29,   442,
     4,  -120,   345,   -36,   -75,   -65,-32768,-32768,-32768,  -252,
   281,   -40,   -54,   242,   -11,   -32,-32768,-32768,-32768,-32768,
-32768,   412,    16,-32768,   413,   278,   515,   423,   -25,   -62,
   -26,   -91,  -144,   260,-32768,  -171,-32768,  -272,  -109,-32768,
-32768,  -158,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,  -325,   156,-32768,   155,-32768,
   390,-32768,  -175,-32768,-32768,-32768,   398,-32768,   316,-32768
};


#define	YYLAST		1573


static const short yytable[] = {    73,
    57,   186,    97,    29,    31,    33,    41,    19,    19,   263,
   100,    20,    20,   262,   240,   332,   107,   274,   167,   171,
   213,   192,   115,    48,   115,   117,    83,   117,   323,   124,
   126,   121,   467,   129,   127,   101,    43,    47,    79,   187,
   132,    36,   247,   131,   108,   168,    84,    54,    -1,   479,
    85,   193,   121,   177,   468,    79,    88,    79,    87,   194,
   382,    26,    27,   384,    89,   421,   239,    26,    27,   107,
   169,   480,    79,    -2,   272,    34,   451,   122,    26,    27,
   277,   383,    83,   316,   166,    88,   188,   129,   212,   129,
   189,    35,   312,    89,   299,    36,   192,   208,   452,   209,
   160,   218,   215,   216,   217,   108,   220,   221,   222,   223,
   224,   225,   226,   227,   228,   229,   230,   231,   232,   233,
   166,   238,   456,   271,   244,    28,    79,   247,    79,    51,
   107,   269,   202,   205,   204,   206,    30,   316,   195,   249,
    26,    27,    85,    36,   310,   477,   312,   168,   234,   235,
   121,   325,   245,   158,   160,    36,   310,   431,   276,    42,
   246,   283,   159,   283,   431,   168,   278,   240,   152,   153,
   160,   154,   155,   156,   169,   115,   115,    53,   117,   117,
   252,   157,   295,    55,   253,   311,    48,    36,   407,   315,
   318,   168,   262,   108,   312,   413,   308,   311,    32,   265,
   267,   408,   160,   158,   416,    56,   312,   417,    79,    79,
   307,   321,   159,   377,   160,   107,   322,    24,    25,   370,
   160,    36,    92,   325,   373,   299,   325,   371,   299,    37,
   327,   420,   407,    36,    92,   372,   331,   168,    38,   134,
   314,   317,   133,   486,   121,   408,    36,   252,   487,   164,
   338,   253,   103,   104,   105,   328,    48,   295,   295,     9,
    10,    11,   331,    93,   366,   441,   378,   173,    58,   443,
   189,   444,    94,    60,    56,    93,    61,    88,   170,   193,
   270,   450,   260,   387,    94,    89,   453,   194,    37,   185,
   457,   199,    36,    92,    62,   463,   203,    38,   331,   283,
    83,   198,   331,    63,   245,   300,   210,   385,    64,    65,
    66,   207,   246,   393,    67,    68,   379,   398,   211,    69,
    85,   214,   282,    70,    71,   252,   488,    86,   176,   253,
   -26,   -26,   -26,   -26,    93,   212,   415,    87,   -26,   -26,
   -26,   259,   260,    94,   149,   150,   151,   264,   399,   273,
   280,   289,   418,    87,   -26,   218,   422,  -121,   169,   290,
   291,   169,   178,   104,   105,     5,     6,     7,     8,     9,
    10,    11,   293,     9,    10,    11,   296,   297,   331,   298,
    88,   337,  -121,   436,   304,   331,  -121,   -26,    89,    13,
   309,   196,   319,   442,   -22,   -22,   -22,   -22,   320,   335,
   339,   340,   -22,   -22,   -22,     5,     6,     7,     8,   367,
   368,   374,   218,     9,    10,    11,   369,    87,   -22,   464,
   376,  -121,   -85,     5,     6,     7,     8,   -30,   -31,    13,
   472,     9,    10,    11,   388,   218,   144,   145,   146,   147,
   148,   149,   150,   151,    88,   391,  -121,    13,   394,   395,
  -121,   -22,    89,   178,   392,   -87,   -87,   -87,   -87,   -87,
   -87,   -87,   396,   -87,   -87,   -87,   -87,   -87,   400,   -87,
   -87,   -87,   -87,   -87,   -87,   -87,   -87,   -87,   -87,   -87,
   -87,   -87,   402,     5,   403,     7,   165,   409,   419,   410,
   -87,     9,    10,    11,   425,   -87,   -87,   -87,   423,   426,
   427,   -87,   -87,   433,   429,   432,   -87,    13,   -87,   -87,
   -87,   -87,   341,   -87,   342,   343,     6,     7,     8,    60,
    56,   435,    61,     9,    10,    11,   344,   437,   345,   346,
   347,   348,   349,   350,   351,   352,   353,   354,   355,    13,
    62,   145,   146,   147,   148,   149,   150,   151,   438,    63,
   439,   446,   455,   458,    64,    65,    66,   462,   465,   466,
    67,    68,   470,   469,   474,    69,   492,   356,   476,    70,
    71,   178,   212,   342,    27,   478,   481,   482,    60,    56,
   484,    61,   489,   490,   493,   344,    23,   345,   346,   347,
   348,   349,   350,   351,   352,   353,   354,   355,   237,    62,
   147,   148,   149,   150,   151,   359,   102,   248,    63,   326,
   381,   412,   281,    64,    65,    66,   286,   386,   404,    67,
    68,   279,   473,   475,    69,   201,   356,   406,    70,    71,
   178,   212,   342,    27,   305,   375,     0,    60,    56,   303,
    61,     0,     0,     0,   344,     0,   345,   346,   347,   348,
   349,   350,   351,   352,   353,   354,   355,     0,    62,     0,
     5,    44,     7,    45,     0,     0,     0,    63,     9,    10,
    11,     0,    64,    65,    66,     0,     0,     0,    67,    68,
     0,     0,     0,    69,    13,   356,  -209,    70,    71,   128,
   212,    58,     5,     0,     7,    59,    60,    56,     0,    61,
     9,    10,    11,     0,     0,     0,     0,     0,     0,     0,
     0,   329,    46,    58,     0,     0,    13,    62,    60,    56,
     0,    61,     0,     0,     0,     0,    63,     0,     0,     0,
     0,    64,    65,    66,     0,    58,     0,    67,    68,    62,
    60,    56,    69,    61,     0,     0,    70,    71,    63,   -75,
     0,     0,     0,    64,    65,    66,     0,     0,     0,    67,
    68,    62,     0,     0,    69,     0,     0,   380,    70,    71,
   329,   330,    58,     0,     0,     0,     0,    60,    56,     0,
    61,    67,    68,     0,     0,     0,    69,     0,     0,     0,
    70,    71,   329,   294,    58,     0,     0,     0,    62,    60,
    56,     0,    61,     0,     0,     0,     0,    63,     0,     0,
     0,     0,    64,    65,    66,     0,     0,     0,    67,    68,
    62,     0,     0,    69,     0,     0,  -169,    70,    71,    63,
   330,     0,     0,     0,    64,    65,    66,     0,     0,     0,
    67,    68,     0,     0,     0,    69,     0,     0,   434,    70,
    71,   329,   330,    58,     0,     0,     0,     0,    60,    56,
     0,    61,     0,   250,     0,   251,     5,     6,     7,     8,
     0,     0,    58,     0,     9,    10,    11,    60,    56,    62,
    61,     0,     0,     0,     0,     0,     0,     0,    63,     0,
    13,     0,     0,    64,    65,    66,     0,     0,    62,    67,
    68,     0,     0,     0,    69,     0,     0,    63,    70,    71,
     0,   330,    64,    65,    66,     0,    58,  -273,    67,    68,
     0,    60,    56,    69,    61,     0,     0,    70,    71,     0,
     0,     0,   243,    58,     0,     0,     0,     0,    60,    56,
     0,    61,    62,     0,     0,     5,    44,     7,    45,     0,
     0,    63,     0,     9,    10,    11,    64,    65,    66,    62,
     0,     0,    67,    68,     0,     0,     0,    69,    63,    13,
     0,    70,    71,    64,    65,    66,   275,    58,     0,    67,
    68,     0,    60,    56,    69,    61,     0,     0,    70,    71,
     0,     0,     0,   306,     0,   190,     0,   266,   -18,   -18,
   -18,   -18,     0,    62,     0,     0,   -18,   -18,   -18,     0,
     0,     0,    63,     0,     0,     0,     0,    64,    65,    66,
     0,    87,   -18,    67,    68,  -121,     0,     0,    69,     0,
     0,     0,    70,    71,     0,     0,     0,   414,    36,     5,
    44,     7,    45,     0,     0,     0,     0,     9,    10,    11,
  -121,     0,     0,     0,  -121,   -18,     0,     0,     0,     0,
   135,   136,   137,    13,   138,   139,   140,   141,   142,   143,
   144,   145,   146,   147,   148,   149,   150,   151,     0,     0,
   316,     0,     0,     0,     0,     0,     0,     0,     0,   312,
   342,   343,     6,     7,     8,    60,    56,   160,    61,     9,
    10,    11,   344,     0,   345,   346,   347,   348,   349,   350,
   351,   352,   353,   354,   355,    13,    62,     0,     0,     0,
     0,     0,     0,     0,     0,    63,     0,     0,     0,     0,
    64,    65,    66,     0,     0,     0,    67,    68,     0,     0,
     0,    69,     0,   356,     0,    70,    71,     0,   212,   342,
    27,     0,     0,     0,    60,    56,     0,    61,     0,     0,
     0,   344,     0,   345,   346,   347,   348,   349,   350,   351,
   352,   353,   354,   355,     0,    62,     0,    58,     0,     0,
     0,     0,    60,    56,    63,    61,     0,     0,     0,    64,
    65,    66,     0,     0,     0,    67,    68,     0,     0,     0,
    69,     0,   356,    62,    70,    71,     5,   212,     7,   165,
     0,     0,    63,     0,     9,    10,    11,    64,    65,    66,
     0,     0,     0,    67,    68,     0,     0,     0,    69,     0,
    13,     0,    70,    71,     0,   294,     0,     0,     0,     0,
    58,     5,     0,     7,    59,    60,    56,   158,    61,     9,
    10,    11,     0,     0,     0,     0,   159,     0,     0,     0,
     0,     0,    58,     0,   160,    13,    62,    60,    56,     0,
    61,     0,     0,     0,     0,    63,     0,     0,     0,     0,
    64,    65,    66,     0,    58,     0,    67,    68,    62,    60,
    56,    69,    61,     0,     0,    70,    71,    63,     0,     0,
     0,     0,    64,    65,    66,     0,    58,     0,    67,    68,
    62,    60,    56,    69,    61,   397,     0,    70,    71,    63,
     0,     0,     0,     0,    64,    65,    66,     0,    58,     0,
    67,    68,    62,    60,    56,   123,    61,     0,     0,    70,
    71,    63,     0,     0,     0,     0,    64,    65,    66,     0,
     0,     0,    67,    68,    62,     0,     0,   125,     0,     0,
     0,    70,    71,    63,     0,     0,     0,     0,    64,    65,
    66,     0,     0,     0,    67,    68,     0,     0,     0,    69,
     0,     0,   112,    70,    71,     5,   112,     7,    59,     5,
     0,     7,    59,     9,    10,    11,     0,     9,    10,    11,
     0,     0,     0,     0,     0,   112,     0,     0,     5,    13,
     7,    59,     0,    13,     0,     0,     9,    10,    11,     0,
     0,     0,   112,     0,     0,     5,     0,     7,    59,     0,
     0,     0,    13,     9,    10,    11,     0,   113,   114,     0,
     0,   113,   119,     0,     0,     0,     0,     0,     0,    13,
     0,     0,     0,     4,     0,   -91,     5,     6,     7,     8,
   113,   287,     0,     0,     9,    10,    11,   142,   143,   144,
   145,   146,   147,   148,   149,   150,   151,   113,   288,    12,
    13,     0,   301,     0,     0,     5,     6,     7,     8,     0,
     0,     0,     0,     9,    10,    11,     0,   -91,     0,     0,
     0,     0,     0,     0,     0,     0,   -91,     0,    14,    13,
   137,     0,   138,   139,   140,   141,   142,   143,   144,   145,
   146,   147,   148,   149,   150,   151,   143,   144,   145,   146,
   147,   148,   149,   150,   151,     0,  -273,   139,   140,   141,
   142,   143,   144,   145,   146,   147,   148,   149,   150,   151,
   140,   141,   142,   143,   144,   145,   146,   147,   148,   149,
   150,   151,   141,   142,   143,   144,   145,   146,   147,   148,
   149,   150,   151
};

static const short yycheck[] = {    35,
    34,    93,    43,     9,    10,    11,    18,     2,     3,   181,
    47,     2,     3,   180,   159,   268,    49,   193,    81,    85,
   130,    97,    52,    20,    54,    52,    38,    54,     1,    61,
    62,     9,    33,    69,    66,    47,    19,    20,    35,    94,
    72,     3,   163,    69,    50,     7,    56,    32,     0,    33,
    60,    54,     9,    89,    55,    52,    54,    54,    27,    62,
   333,     3,     4,   336,    62,   391,   158,     3,     4,   102,
    82,    55,    69,     0,   191,    54,    33,    55,     3,     4,
   197,   334,    94,    45,    81,    54,    56,   123,    61,   125,
    60,    54,    54,    62,   239,     3,   172,   123,    55,   125,
    62,   137,   134,   135,   136,   111,   138,   139,   140,   141,
   142,   143,   144,   145,   146,   147,   148,   149,   150,   151,
   117,   157,   448,   189,   160,    61,   123,   248,   125,    61,
   163,   186,   115,   118,   117,   120,    61,    45,    56,   173,
     3,     4,    60,     3,     4,   471,    54,     7,   154,   155,
     9,   261,    54,    45,    62,     3,     4,   410,   194,    56,
    62,   202,    54,   204,   417,     7,   198,   312,    49,    50,
    62,    52,    53,    54,   186,   205,   206,    61,   205,   206,
   175,    62,   214,    61,   175,    45,   183,     3,   360,   252,
   253,     7,   359,   199,    54,   371,    55,    45,    61,   182,
   183,   360,    62,    45,    57,     9,    54,    60,   205,   206,
   246,    55,    54,   323,    62,   248,    60,    56,    57,   311,
    62,     3,     4,   333,   316,   370,   336,    54,   373,    45,
   267,   390,   404,     3,     4,    62,   268,     7,    54,    60,
   252,   253,    55,    55,     9,   404,     3,   242,    60,    55,
   282,   242,     5,     6,     7,   267,   253,   289,   290,    12,
    13,    14,   294,    45,   296,   424,    56,    54,     3,   428,
    60,   430,    54,     8,     9,    45,    11,    54,    55,    54,
    55,   440,    56,    57,    54,    62,   445,    62,    45,    31,
   449,    60,     3,     4,    29,   454,    56,    54,   330,   340,
   312,    31,   334,    38,    54,    55,    55,   339,    43,    44,
    45,    56,    62,   349,    49,    50,    56,   353,    55,    54,
    60,    55,    33,    58,    59,   320,   485,     1,    63,   320,
     4,     5,     6,     7,    45,    61,   372,    27,    12,    13,
    14,    63,    56,    54,    45,    46,    47,    56,   354,    31,
    57,    55,   388,    27,    28,   391,   392,    31,   370,    55,
    57,   373,     1,     6,     7,     4,     5,     6,     7,    12,
    13,    14,    55,    12,    13,    14,    33,    55,   410,    63,
    54,    57,    56,   419,    63,   417,    60,    61,    62,    28,
    55,     1,    55,   427,     4,     5,     6,     7,    60,    63,
    33,    60,    12,    13,    14,     4,     5,     6,     7,    55,
    55,    10,   448,    12,    13,    14,    63,    27,    28,   455,
     3,    31,    61,     4,     5,     6,     7,    33,    33,    28,
   466,    12,    13,    14,    54,   471,    40,    41,    42,    43,
    44,    45,    46,    47,    54,    54,    56,    28,    33,    56,
    60,    61,    62,     1,    54,     3,     4,     5,     6,     7,
     8,     9,    56,    11,    12,    13,    14,    15,     7,    17,
    18,    19,    20,    21,    22,    23,    24,    25,    26,    27,
    28,    29,    33,     4,    56,     6,     7,    16,    54,    60,
    38,    12,    13,    14,    56,    43,    44,    45,    33,    56,
    54,    49,    50,    63,    57,    57,    54,    28,    56,    57,
    58,    59,     1,    61,     3,     4,     5,     6,     7,     8,
     9,    55,    11,    12,    13,    14,    15,    17,    17,    18,
    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
    29,    41,    42,    43,    44,    45,    46,    47,    56,    38,
    55,    55,    54,     9,    43,    44,    45,    56,    56,    54,
    49,    50,    55,    60,    56,    54,     0,    56,    56,    58,
    59,     1,    61,     3,     4,    55,    55,     9,     8,     9,
    56,    11,    56,     9,     0,    15,     3,    17,    18,    19,
    20,    21,    22,    23,    24,    25,    26,    27,   156,    29,
    43,    44,    45,    46,    47,   292,    48,   166,    38,   265,
   330,   370,   201,    43,    44,    45,   204,   340,   359,    49,
    50,   199,   467,   469,    54,   111,    56,    57,    58,    59,
     1,    61,     3,     4,   245,   320,    -1,     8,     9,   242,
    11,    -1,    -1,    -1,    15,    -1,    17,    18,    19,    20,
    21,    22,    23,    24,    25,    26,    27,    -1,    29,    -1,
     4,     5,     6,     7,    -1,    -1,    -1,    38,    12,    13,
    14,    -1,    43,    44,    45,    -1,    -1,    -1,    49,    50,
    -1,    -1,    -1,    54,    28,    56,    57,    58,    59,     1,
    61,     3,     4,    -1,     6,     7,     8,     9,    -1,    11,
    12,    13,    14,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
    -1,     1,    56,     3,    -1,    -1,    28,    29,     8,     9,
    -1,    11,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,
    -1,    43,    44,    45,    -1,     3,    -1,    49,    50,    29,
     8,     9,    54,    11,    -1,    -1,    58,    59,    38,    61,
    -1,    -1,    -1,    43,    44,    45,    -1,    -1,    -1,    49,
    50,    29,    -1,    -1,    54,    -1,    -1,    57,    58,    59,
     1,    61,     3,    -1,    -1,    -1,    -1,     8,     9,    -1,
    11,    49,    50,    -1,    -1,    -1,    54,    -1,    -1,    -1,
    58,    59,     1,    61,     3,    -1,    -1,    -1,    29,     8,
     9,    -1,    11,    -1,    -1,    -1,    -1,    38,    -1,    -1,
    -1,    -1,    43,    44,    45,    -1,    -1,    -1,    49,    50,
    29,    -1,    -1,    54,    -1,    -1,    57,    58,    59,    38,
    61,    -1,    -1,    -1,    43,    44,    45,    -1,    -1,    -1,
    49,    50,    -1,    -1,    -1,    54,    -1,    -1,    57,    58,
    59,     1,    61,     3,    -1,    -1,    -1,    -1,     8,     9,
    -1,    11,    -1,     1,    -1,     3,     4,     5,     6,     7,
    -1,    -1,     3,    -1,    12,    13,    14,     8,     9,    29,
    11,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    38,    -1,
    28,    -1,    -1,    43,    44,    45,    -1,    -1,    29,    49,
    50,    -1,    -1,    -1,    54,    -1,    -1,    38,    58,    59,
    -1,    61,    43,    44,    45,    -1,     3,    55,    49,    50,
    -1,     8,     9,    54,    11,    -1,    -1,    58,    59,    -1,
    -1,    -1,    63,     3,    -1,    -1,    -1,    -1,     8,     9,
    -1,    11,    29,    -1,    -1,     4,     5,     6,     7,    -1,
    -1,    38,    -1,    12,    13,    14,    43,    44,    45,    29,
    -1,    -1,    49,    50,    -1,    -1,    -1,    54,    38,    28,
    -1,    58,    59,    43,    44,    45,    63,     3,    -1,    49,
    50,    -1,     8,     9,    54,    11,    -1,    -1,    58,    59,
    -1,    -1,    -1,    63,    -1,     1,    -1,    56,     4,     5,
     6,     7,    -1,    29,    -1,    -1,    12,    13,    14,    -1,
    -1,    -1,    38,    -1,    -1,    -1,    -1,    43,    44,    45,
    -1,    27,    28,    49,    50,    31,    -1,    -1,    54,    -1,
    -1,    -1,    58,    59,    -1,    -1,    -1,    63,     3,     4,
     5,     6,     7,    -1,    -1,    -1,    -1,    12,    13,    14,
    56,    -1,    -1,    -1,    60,    61,    -1,    -1,    -1,    -1,
    30,    31,    32,    28,    34,    35,    36,    37,    38,    39,
    40,    41,    42,    43,    44,    45,    46,    47,    -1,    -1,
    45,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    54,
     3,     4,     5,     6,     7,     8,     9,    62,    11,    12,
    13,    14,    15,    -1,    17,    18,    19,    20,    21,    22,
    23,    24,    25,    26,    27,    28,    29,    -1,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,    -1,
    43,    44,    45,    -1,    -1,    -1,    49,    50,    -1,    -1,
    -1,    54,    -1,    56,    -1,    58,    59,    -1,    61,     3,
     4,    -1,    -1,    -1,     8,     9,    -1,    11,    -1,    -1,
    -1,    15,    -1,    17,    18,    19,    20,    21,    22,    23,
    24,    25,    26,    27,    -1,    29,    -1,     3,    -1,    -1,
    -1,    -1,     8,     9,    38,    11,    -1,    -1,    -1,    43,
    44,    45,    -1,    -1,    -1,    49,    50,    -1,    -1,    -1,
    54,    -1,    56,    29,    58,    59,     4,    61,     6,     7,
    -1,    -1,    38,    -1,    12,    13,    14,    43,    44,    45,
    -1,    -1,    -1,    49,    50,    -1,    -1,    -1,    54,    -1,
    28,    -1,    58,    59,    -1,    61,    -1,    -1,    -1,    -1,
     3,     4,    -1,     6,     7,     8,     9,    45,    11,    12,
    13,    14,    -1,    -1,    -1,    -1,    54,    -1,    -1,    -1,
    -1,    -1,     3,    -1,    62,    28,    29,     8,     9,    -1,
    11,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,    -1,
    43,    44,    45,    -1,     3,    -1,    49,    50,    29,     8,
     9,    54,    11,    -1,    -1,    58,    59,    38,    -1,    -1,
    -1,    -1,    43,    44,    45,    -1,     3,    -1,    49,    50,
    29,     8,     9,    54,    11,    56,    -1,    58,    59,    38,
    -1,    -1,    -1,    -1,    43,    44,    45,    -1,     3,    -1,
    49,    50,    29,     8,     9,    54,    11,    -1,    -1,    58,
    59,    38,    -1,    -1,    -1,    -1,    43,    44,    45,    -1,
    -1,    -1,    49,    50,    29,    -1,    -1,    54,    -1,    -1,
    -1,    58,    59,    38,    -1,    -1,    -1,    -1,    43,    44,
    45,    -1,    -1,    -1,    49,    50,    -1,    -1,    -1,    54,
    -1,    -1,     1,    58,    59,     4,     1,     6,     7,     4,
    -1,     6,     7,    12,    13,    14,    -1,    12,    13,    14,
    -1,    -1,    -1,    -1,    -1,     1,    -1,    -1,     4,    28,
     6,     7,    -1,    28,    -1,    -1,    12,    13,    14,    -1,
    -1,    -1,     1,    -1,    -1,     4,    -1,     6,     7,    -1,
    -1,    -1,    28,    12,    13,    14,    -1,    56,    57,    -1,
    -1,    56,    57,    -1,    -1,    -1,    -1,    -1,    -1,    28,
    -1,    -1,    -1,     1,    -1,     3,     4,     5,     6,     7,
    56,    57,    -1,    -1,    12,    13,    14,    38,    39,    40,
    41,    42,    43,    44,    45,    46,    47,    56,    57,    27,
    28,    -1,     1,    -1,    -1,     4,     5,     6,     7,    -1,
    -1,    -1,    -1,    12,    13,    14,    -1,    45,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    -1,    54,    -1,    56,    28,
    32,    -1,    34,    35,    36,    37,    38,    39,    40,    41,
    42,    43,    44,    45,    46,    47,    39,    40,    41,    42,
    43,    44,    45,    46,    47,    -1,    55,    35,    36,    37,
    38,    39,    40,    41,    42,    43,    44,    45,    46,    47,
    36,    37,    38,    39,    40,    41,    42,    43,    44,    45,
    46,    47,    37,    38,    39,    40,    41,    42,    43,    44,
    45,    46,    47
};
#define YYPURE 1

#line 2 "bison.simple"

/* Skeleton output parser for bison,
   copyright (C) 1984 Bob Corbett and Richard Stallman

		       NO WARRANTY

  BECAUSE THIS PROGRAM IS LICENSED FREE OF CHARGE, WE PROVIDE ABSOLUTELY
NO WARRANTY, TO THE EXTENT PERMITTED BY APPLICABLE STATE LAW.  EXCEPT
WHEN OTHERWISE STATED IN WRITING, FREE SOFTWARE FOUNDATION, INC,
RICHARD M. STALLMAN AND/OR OTHER PARTIES PROVIDE THIS PROGRAM "AS IS"
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY
AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.

 IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW WILL RICHARD M.
STALLMAN, THE FREE SOFTWARE FOUNDATION, INC., AND/OR ANY OTHER PARTY
WHO MAY MODIFY AND REDISTRIBUTE THIS PROGRAM AS PERMITTED BELOW, BE
LIABLE TO YOU FOR DAMAGES, INCLUDING ANY LOST PROFITS, LOST MONIES, OR
OTHER SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR
DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY THIRD PARTIES OR
A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS) THIS
PROGRAM, EVEN IF YOU HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY.

		GENERAL PUBLIC LICENSE TO COPY

  1. You may copy and distribute verbatim copies of this source file
as you receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy a valid copyright notice "Copyright
(C) 1985 Free Software Foundation, Inc."; and include following the
copyright notice a verbatim copy of the above disclaimer of warranty
and of this License.  You may charge a distribution fee for the
physical act of transferring a copy.

  2. You may modify your copy or copies of this source file or
any portion of it, and copy and distribute such modifications under
the terms of Paragraph 1 above, provided that you also do the following:

    a) cause the modified files to carry prominent notices stating
    that you changed the files and the date of any change; and

    b) cause the whole of any work that you distribute or publish,
    that in whole or in part contains or is a derivative of this
    program or any part thereof, to be licensed at no charge to all
    third parties on terms identical to those contained in this
    License Agreement (except that you may choose to grant more extensive
    warranty protection to some or all third parties, at your option).

    c) You may charge a distribution fee for the physical act of
    transferring a copy, and you may at your option offer warranty
    protection in exchange for a fee.

Mere aggregation of another unrelated program with this program (or its
derivative) on a volume of a storage or distribution medium does not bring
the other program under the scope of these terms.

  3. You may copy and distribute this program (or a portion or derivative
of it, under Paragraph 2) in object code or executable form under the terms
of Paragraphs 1 and 2 above provided that you also do one of the following:

    a) accompany it with the complete corresponding machine-readable
    source code, which must be distributed under the terms of
    Paragraphs 1 and 2 above; or,

    b) accompany it with a written offer, valid for at least three
    years, to give any third party free (except for a nominal
    shipping charge) a complete machine-readable copy of the
    corresponding source code, to be distributed under the terms of
    Paragraphs 1 and 2 above; or,

    c) accompany it with the information you received as to where the
    corresponding source code may be obtained.  (This alternative is
    allowed only for noncommercial distribution and only if you
    received the program in object code or executable form alone.)

For an executable file, complete source code means all the source code for
all modules it contains; but, as a special exception, it need not include
source code for modules which are standard libraries that accompany the
operating system on which the executable file runs.

  4. You may not copy, sublicense, distribute or transfer this program
except as expressly provided under this License Agreement.  Any attempt
otherwise to copy, sublicense, distribute or transfer this program is void and
your rights to use the program under this License agreement shall be
automatically terminated.  However, parties who have received computer
software programs from you with this License Agreement will not have
their licenses terminated so long as such parties remain in full compliance.

  5. If you wish to incorporate parts of this program into other free
programs whose distribution conditions are different, write to the Free
Software Foundation at 675 Mass Ave, Cambridge, MA 02139.  We have not yet
worked out a simple rule that can be stated here, but we will often permit
this.  We will be guided by the two goals of preserving the free status of
all derivatives of our free software and of promoting the sharing and reuse of
software.


In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them.   Help stamp out software-hoarding!  */

/* 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.  */

/* 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 YYFAIL		goto yyerrlab;

#define YYTERROR	1

#ifndef YYIMPURE
#define YYLEX		yylex()
#endif

#ifndef YYPURE
#define YYLEX		yylex(&yylval, &yylloc)
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYIMPURE

int	yychar;			/*  the lookahead symbol		*/
YYSTYPE	yylval;			/*  the semantic value of the		*/
				/*  lookahead symbol			*/

YYLTYPE yylloc;			/*  location data for the lookahead	*/
				/*  symbol				*/

int yynerr;			/*  number of parse errors so far       */

#ifdef YYDEBUG
int yydebug = 0;		/*  nonzero means print parse trace	*/
#endif

#endif  /* YYIMPURE */


/*  YYMAXDEPTH indicates the initial size of the parser's stacks	*/

#ifndef	YYMAXDEPTH
#define YYMAXDEPTH 200
#endif

/*  YYMAXLIMIT is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */

#ifndef YYMAXLIMIT
#define YYMAXLIMIT 10000
#endif


#line 167 "bison.simple"
int
yyparse()
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  YYLTYPE *yylsp;
  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
  int yychar1;		/*  lookahead token as an internal (translated) token number */

  short	yyssa[YYMAXDEPTH];	/*  the state stack			*/
  YYSTYPE yyvsa[YYMAXDEPTH];	/*  the semantic value stack		*/
  YYLTYPE yylsa[YYMAXDEPTH];	/*  the location stack			*/

  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */
  YYLTYPE *yyls = yylsa;

  int yymaxdepth = YYMAXDEPTH;

#ifndef YYPURE
  int yychar;
  YYSTYPE yylval;
  YYLTYPE yylloc;
#endif

#ifdef YYDEBUG
  extern int yydebug;
#endif


  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#ifdef YYDEBUG
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  yystate = 0;
  yyerrstatus = 0;
  yynerr = 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.  */

  yyssp = yyss - 1;
  yyvsp = yyvs;
  yylsp = yyls;

/* 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 + yymaxdepth - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      YYLTYPE *yyls1 = yyls;
      short *yyss1 = yyss;

      /* 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.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yymaxdepth);

      yyss = yyss1; yyvs = yyvs1; yyls = yyls1;
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yymaxdepth >= YYMAXLIMIT)
	yyerror("parser stack overflow");
      yymaxdepth *= 2;
      if (yymaxdepth > YYMAXLIMIT)
	yymaxdepth = YYMAXLIMIT;
      yyss = (short *) alloca (yymaxdepth * sizeof (*yyssp));
      bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yymaxdepth * sizeof (*yyvsp));
      bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yymaxdepth * sizeof (*yylsp));
      bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#ifdef YYDEBUG
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yymaxdepth);
#endif

      if (yyssp >= yyss + yymaxdepth - 1)
	YYABORT;
    }

#ifdef YYDEBUG
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

/* 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)
    {
#ifdef YYDEBUG
      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 */

#ifdef YYDEBUG
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#ifdef YYDEBUG
      if (yydebug)
	fprintf(stderr, "Next token is %d (%s)\n", yychar, yytname[yychar1]);
#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.  */

#ifdef YYDEBUG
  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];
  yyval = yyvsp[1-yylen]; /* implement default value of the action */

#ifdef YYDEBUG
  if (yydebug)
    {
      if (yylen == 1)
	fprintf (stderr, "Reducing 1 value via line %d, ",
		 yyrline[yyn]);
      else
	fprintf (stderr, "Reducing %d values via line %d, ",
		 yylen, yyrline[yyn]);
    }
#endif


  switch (yyn) {

case 3:
#line 183 "c-parse.y"
{yyval.ttype = NULL_TREE; ;
    break;}
case 5:
#line 184 "c-parse.y"
{yyval.ttype = NULL_TREE; ;
    break;}
case 9:
#line 191 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype);
		  assemble_asm (yyvsp[-2].ttype); ;
    break;}
case 10:
#line 199 "c-parse.y"
{ if (pedantic)
		    error ("ANSI C forbids data definition lacking type or storage class");
		  else if (!flag_traditional)
		    warning ("data definition lacks type or storage class"); ;
    break;}
case 11:
#line 204 "c-parse.y"
{;
    break;}
case 12:
#line 206 "c-parse.y"
{;
    break;}
case 13:
#line 208 "c-parse.y"
{ error ("empty declaration"); ;
    break;}
case 14:
#line 210 "c-parse.y"
{ shadow_tag (yyvsp[-1].ttype); ;
    break;}
case 18:
#line 218 "c-parse.y"
{ if (! start_function (yyvsp[-2].ttype, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 19:
#line 222 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 20:
#line 224 "c-parse.y"
{ finish_function (); ;
    break;}
case 21:
#line 226 "c-parse.y"
{ ;
    break;}
case 22:
#line 228 "c-parse.y"
{ if (! start_function (yyvsp[-2].ttype, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 23:
#line 232 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 24:
#line 234 "c-parse.y"
{ finish_function (); ;
    break;}
case 25:
#line 236 "c-parse.y"
{ ;
    break;}
case 26:
#line 238 "c-parse.y"
{ if (! start_function (0, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 27:
#line 242 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 28:
#line 244 "c-parse.y"
{ finish_function (); ;
    break;}
case 29:
#line 246 "c-parse.y"
{ ;
    break;}
case 32:
#line 255 "c-parse.y"
{ yyval.code = ADDR_EXPR; ;
    break;}
case 33:
#line 257 "c-parse.y"
{ yyval.code = NEGATE_EXPR; ;
    break;}
case 34:
#line 259 "c-parse.y"
{ yyval.code = CONVERT_EXPR; ;
    break;}
case 35:
#line 261 "c-parse.y"
{ yyval.code = PREINCREMENT_EXPR; ;
    break;}
case 36:
#line 263 "c-parse.y"
{ yyval.code = PREDECREMENT_EXPR; ;
    break;}
case 37:
#line 265 "c-parse.y"
{ yyval.code = BIT_NOT_EXPR; ;
    break;}
case 38:
#line 267 "c-parse.y"
{ yyval.code = TRUTH_NOT_EXPR; ;
    break;}
case 39:
#line 271 "c-parse.y"
{ yyval.ttype = build_compound_expr (yyvsp[0].ttype); ;
    break;}
case 40:
#line 276 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 42:
#line 282 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 43:
#line 284 "c-parse.y"
{ chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;
    break;}
case 45:
#line 290 "c-parse.y"
{ yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ;
    break;}
case 46:
#line 292 "c-parse.y"
{ yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ;
    break;}
case 47:
#line 294 "c-parse.y"
{ tree type = groktypename (yyvsp[-2].ttype);
		  yyval.ttype = build_c_cast (type, yyvsp[0].ttype); ;
    break;}
case 48:
#line 297 "c-parse.y"
{ tree type = groktypename (yyvsp[-5].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids constructor-expressions");
		  yyval.ttype = digest_init (type, build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)), 0);
		  if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
		    {
		      int failure = complete_array_type (type, yyval.ttype, 1);
		      if (failure)
			abort ();
		    }
		;
    break;}
case 49:
#line 309 "c-parse.y"
{ if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF
		      && TREE_PACKED (TREE_OPERAND (yyvsp[0].ttype, 1)))
		    error ("sizeof applied to a bit-field");
		  yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ;
    break;}
case 50:
#line 314 "c-parse.y"
{ yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ;
    break;}
case 51:
#line 316 "c-parse.y"
{ if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF
		      && TREE_PACKED (TREE_OPERAND (yyvsp[0].ttype, 1)))
		    error ("__alignof applied to a bit-field");
		  yyval.ttype = c_alignof (TREE_TYPE (yyvsp[0].ttype)); ;
    break;}
case 52:
#line 321 "c-parse.y"
{ yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ;
    break;}
case 53:
#line 323 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 54:
#line 325 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 55:
#line 327 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 56:
#line 329 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 57:
#line 331 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 58:
#line 333 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 59:
#line 335 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 60:
#line 337 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 61:
#line 339 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 62:
#line 341 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 63:
#line 343 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 64:
#line 345 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 65:
#line 347 "c-parse.y"
{ yyval.ttype = build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 66:
#line 349 "c-parse.y"
{ yyval.ttype = build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 67:
#line 351 "c-parse.y"
{ yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 68:
#line 353 "c-parse.y"
{ yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); ;
    break;}
case 69:
#line 355 "c-parse.y"
{ yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); ;
    break;}
case 70:
#line 360 "c-parse.y"
{ yyval.ttype = lastiddecl;
		  if (!yyval.ttype)
		    {
		      if (yychar == YYEMPTY)
			yychar = YYLEX;
		      if (yychar == '(')
			yyval.ttype = implicitly_declare (yyvsp[0].ttype);
		      else
			{
			  if (IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype) != error_mark_node)
			    error ("undeclared variable `%s' (first use here)",
				   IDENTIFIER_POINTER (yyvsp[0].ttype));
			  yyval.ttype = error_mark_node;
			  /* Prevent repeated error messages.  */
			  IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype) = error_mark_node;
			}
		    }
		  else
		    TREE_USED (yyval.ttype) = 1;
		  if (TREE_CODE (yyval.ttype) == CONST_DECL)
		    yyval.ttype = DECL_INITIAL (yyval.ttype);
		;
    break;}
case 72:
#line 384 "c-parse.y"
{ yyval.ttype = combine_strings (yyvsp[0].ttype); ;
    break;}
case 73:
#line 386 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 74:
#line 388 "c-parse.y"
{ yyval.ttype = error_mark_node; ;
    break;}
case 75:
#line 390 "c-parse.y"
{ if (current_function_decl == 0)
		    {
		      error ("braced-group within expression allowed only inside a function");
		      YYERROR;
		    }
		  yyval.ttype = expand_start_stmt_expr (); ;
    break;}
case 76:
#line 397 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids braced-groups within expressions");
		  yyval.ttype = expand_end_stmt_expr (yyvsp[-2].ttype); ;
    break;}
case 77:
#line 401 "c-parse.y"
{ yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 78:
#line 403 "c-parse.y"
{ yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 79:
#line 405 "c-parse.y"
{ yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 80:
#line 407 "c-parse.y"
{ yyval.ttype = build_component_ref (build_indirect_ref (yyvsp[-2].ttype, "->"), yyvsp[0].ttype); ;
    break;}
case 81:
#line 409 "c-parse.y"
{ yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ;
    break;}
case 82:
#line 411 "c-parse.y"
{ yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ;
    break;}
case 84:
#line 418 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 91:
#line 436 "c-parse.y"
{ current_declspecs = yyvsp[0].ttype;
		  yyval.itype = suspend_momentary (); ;
    break;}
case 92:
#line 442 "c-parse.y"
{ resume_momentary (yyvsp[-2].itype); ;
    break;}
case 93:
#line 444 "c-parse.y"
{ resume_momentary (yyvsp[-2].itype); ;
    break;}
case 94:
#line 446 "c-parse.y"
{ shadow_tag (yyvsp[-1].ttype); ;
    break;}
case 95:
#line 448 "c-parse.y"
{ warning ("empty declaration"); ;
    break;}
case 96:
#line 457 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 97:
#line 459 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[-2].ttype)); ;
    break;}
case 98:
#line 463 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 99:
#line 465 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 100:
#line 467 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 101:
#line 476 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 102:
#line 478 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 103:
#line 480 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 104:
#line 482 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 105:
#line 492 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 106:
#line 494 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[-2].ttype)); ;
    break;}
case 107:
#line 498 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 108:
#line 500 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 112:
#line 511 "c-parse.y"
{ yyval.ttype = TREE_TYPE (yyvsp[-1].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids `typeof'"); ;
    break;}
case 113:
#line 515 "c-parse.y"
{ yyval.ttype = groktypename (yyvsp[-1].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids `typeof'"); ;
    break;}
case 121:
#line 539 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 122:
#line 541 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype);
		  yyval.ttype = yyvsp[-1].ttype;
		  if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		;
    break;}
case 123:
#line 550 "c-parse.y"
{ yyval.ttype = start_decl (yyvsp[-2].ttype, current_declspecs, 1); ;
    break;}
case 124:
#line 553 "c-parse.y"
{ finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); ;
    break;}
case 125:
#line 555 "c-parse.y"
{ tree d = start_decl (yyvsp[-1].ttype, current_declspecs, 0);
		  finish_decl (d, NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 126:
#line 561 "c-parse.y"
{ yyval.ttype = start_decl (yyvsp[-2].ttype, current_declspecs, 1); ;
    break;}
case 127:
#line 564 "c-parse.y"
{ finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); ;
    break;}
case 128:
#line 566 "c-parse.y"
{ tree d = start_decl (yyvsp[-1].ttype, current_declspecs, 0);
		  finish_decl (d, NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 130:
#line 573 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, NULL_TREE);
		  if (pedantic)
		    warning ("ANSI C forbids empty initializer braces"); ;
    break;}
case 131:
#line 577 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-1].ttype)); ;
    break;}
case 132:
#line 579 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); ;
    break;}
case 133:
#line 581 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 134:
#line 588 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 135:
#line 590 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 138:
#line 605 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 139:
#line 607 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 140:
#line 612 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 141:
#line 614 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 142:
#line 616 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 144:
#line 627 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 145:
#line 632 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 146:
#line 634 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 147:
#line 636 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 149:
#line 645 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 150:
#line 650 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 151:
#line 652 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 152:
#line 654 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 153:
#line 656 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 155:
#line 662 "c-parse.y"
{ yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype);
		  /* Start scope of tag before parsing components.  */
		;
    break;}
case 156:
#line 666 "c-parse.y"
{ yyval.ttype = finish_struct (yyvsp[-2].ttype, yyvsp[-1].ttype);
		  /* Really define the structure.  */
		;
    break;}
case 157:
#line 670 "c-parse.y"
{ yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE),
				      yyvsp[-1].ttype); ;
    break;}
case 158:
#line 673 "c-parse.y"
{ yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ;
    break;}
case 159:
#line 675 "c-parse.y"
{ yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ;
    break;}
case 160:
#line 677 "c-parse.y"
{ yyval.ttype = finish_struct (yyvsp[-2].ttype, yyvsp[-1].ttype); ;
    break;}
case 161:
#line 679 "c-parse.y"
{ yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE),
				      yyvsp[-1].ttype); ;
    break;}
case 162:
#line 682 "c-parse.y"
{ yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ;
    break;}
case 163:
#line 684 "c-parse.y"
{ yyvsp[0].itype = suspend_momentary ();
		  yyval.ttype = start_enum (yyvsp[-1].ttype); ;
    break;}
case 164:
#line 687 "c-parse.y"
{ yyval.ttype = finish_enum (yyvsp[-3].ttype, nreverse (yyvsp[-2].ttype));
		  resume_momentary (yyvsp[-4].itype); ;
    break;}
case 165:
#line 690 "c-parse.y"
{ yyvsp[0].itype = suspend_momentary ();
		  yyval.ttype = start_enum (NULL_TREE); ;
    break;}
case 166:
#line 693 "c-parse.y"
{ yyval.ttype = finish_enum (yyvsp[-3].ttype, nreverse (yyvsp[-2].ttype));
		  resume_momentary (yyvsp[-4].itype); ;
    break;}
case 167:
#line 696 "c-parse.y"
{ yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); ;
    break;}
case 171:
#line 707 "c-parse.y"
{ if (pedantic) warning ("comma at end of enumerator list"); ;
    break;}
case 172:
#line 711 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 173:
#line 713 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ;
    break;}
case 174:
#line 715 "c-parse.y"
{ if (pedantic) 
		    warning ("extra semicolon in struct or union specified"); ;
    break;}
case 175:
#line 730 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  resume_momentary (yyvsp[-1].itype); ;
    break;}
case 176:
#line 733 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  resume_momentary (yyvsp[-1].itype); ;
    break;}
case 177:
#line 736 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 178:
#line 741 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 180:
#line 744 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 181:
#line 749 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, yyvsp[0].ttype, current_declspecs, NULL_TREE); ;
    break;}
case 182:
#line 751 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, yyvsp[-2].ttype, current_declspecs, yyvsp[0].ttype); ;
    break;}
case 183:
#line 753 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, NULL_TREE, current_declspecs, yyvsp[0].ttype); ;
    break;}
case 185:
#line 764 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 186:
#line 770 "c-parse.y"
{ yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 187:
#line 772 "c-parse.y"
{ yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 188:
#line 777 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 189:
#line 779 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 190:
#line 784 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 192:
#line 790 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 193:
#line 792 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 194:
#line 797 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 195:
#line 799 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 196:
#line 804 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 197:
#line 807 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 198:
#line 809 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 199:
#line 811 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 200:
#line 813 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 201:
#line 815 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 202:
#line 817 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 203:
#line 819 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ;
    break;}
case 204:
#line 821 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, NULL_TREE); ;
    break;}
case 211:
#line 843 "c-parse.y"
{ pushlevel (0);
		  clear_last_expr ();
		  push_momentary ();
		  expand_start_bindings (0); ;
    break;}
case 215:
#line 858 "c-parse.y"
{ expand_end_bindings (getdecls (), 1, 0);
		  poplevel (1, 1, 0);
		  pop_momentary (); ;
    break;}
case 216:
#line 862 "c-parse.y"
{ expand_end_bindings (getdecls (), 0, 0);
		  poplevel (0, 0, 0);
		  pop_momentary (); ;
    break;}
case 217:
#line 866 "c-parse.y"
{ expand_end_bindings (getdecls (), 0, 0);
		  poplevel (0, 0, 0);
		  pop_momentary (); ;
    break;}
case 218:
#line 873 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), 0); ;
    break;}
case 221:
#line 881 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_expr_stmt (yyvsp[-1].ttype);
		  clear_momentary (); ;
    break;}
case 222:
#line 885 "c-parse.y"
{ expand_start_else (); ;
    break;}
case 223:
#line 887 "c-parse.y"
{ expand_end_else (); ;
    break;}
case 224:
#line 889 "c-parse.y"
{ expand_end_cond (); ;
    break;}
case 225:
#line 891 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_loop (1); ;
    break;}
case 226:
#line 894 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-1].ttype)); ;
    break;}
case 227:
#line 897 "c-parse.y"
{ expand_end_loop (); ;
    break;}
case 228:
#line 899 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_loop_continue_elsewhere (1); ;
    break;}
case 229:
#line 902 "c-parse.y"
{ expand_loop_continue_here (); ;
    break;}
case 230:
#line 904 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-2].ttype));
		  expand_end_loop ();
		  clear_momentary (); ;
    break;}
case 231:
#line 910 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (yyvsp[-1].ttype) expand_expr_stmt (yyvsp[-1].ttype);
		  expand_start_loop_continue_elsewhere (1); ;
    break;}
case 232:
#line 914 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (yyvsp[-1].ttype)
		    expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-1].ttype)); ;
    break;}
case 233:
#line 920 "c-parse.y"
{ push_momentary ();
		  yyvsp[0].itype = lineno; ;
    break;}
case 234:
#line 923 "c-parse.y"
{ emit_line_note (input_filename, yyvsp[-2].itype);
		  expand_loop_continue_here ();
		  if (yyvsp[-3].ttype)
		    expand_expr_stmt (yyvsp[-3].ttype);
		  pop_momentary ();
		  expand_end_loop (); ;
    break;}
case 235:
#line 930 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_start_case (yyvsp[-1].ttype);
		  /* Don't let the tree nodes for $3 be discarded by
		     clear_momentary during the parsing of the next stmt.  */
		  push_momentary (); ;
    break;}
case 236:
#line 936 "c-parse.y"
{ expand_end_case ();
		  pop_momentary (); ;
    break;}
case 237:
#line 939 "c-parse.y"
{ register tree value = fold (yyvsp[-1].ttype);
		  register tree label
		    = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);

		  if (TREE_CODE (value) != INTEGER_CST
		      && value != error_mark_node)
		    {
		      error ("case label does not reduce to an integer constant");
		      value = error_mark_node;
		    }
		  else
		    /* Promote char or short to int.  */
		    value = default_conversion (value);
		  if (value != error_mark_node)
		    {
		      int success = pushcase (value, label);
		      if (success == 1)
			error ("case label not within a switch statement");
		      else if (success == 2)
			error ("duplicate case value");
		      else if (success == 3)
			warning ("case value out of range");
		    }
		;
    break;}
case 239:
#line 965 "c-parse.y"
{
		  register tree label
		    = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
		  int success = pushcase (NULL_TREE, label);
		  if (success == 1)
		    error ("default label not within a switch statement");
		  else if (success == 2)
		    error ("multiple default labels in one switch");
		;
    break;}
case 241:
#line 976 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if ( ! expand_exit_something ())
		    error ("break statement not within loop or switch"); ;
    break;}
case 242:
#line 980 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (! expand_continue_loop ())
		    error ("continue statement not within a loop"); ;
    break;}
case 243:
#line 984 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_return (NULL_TREE); ;
    break;}
case 244:
#line 987 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_return (yyvsp[-1].ttype); ;
    break;}
case 245:
#line 990 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype);
		  expand_asm (yyvsp[-2].ttype); ;
    break;}
case 246:
#line 994 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-4].ttype)) yyvsp[-4].ttype = combine_strings (yyvsp[-4].ttype);
		  c_expand_asm_operands (yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE,
					 yyvsp[-6].ttype == ridpointers[(int)RID_VOLATILE]); ;
    break;}
case 247:
#line 999 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-6].ttype)) yyvsp[-6].ttype = combine_strings (yyvsp[-6].ttype);
		  c_expand_asm_operands (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE,
					 yyvsp[-8].ttype == ridpointers[(int)RID_VOLATILE]); ;
    break;}
case 248:
#line 1005 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-8].ttype)) yyvsp[-8].ttype = combine_strings (yyvsp[-8].ttype);
		  c_expand_asm_operands (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype,
					 yyvsp[-10].ttype == ridpointers[(int)RID_VOLATILE]); ;
    break;}
case 249:
#line 1009 "c-parse.y"
{ tree decl;
		  emit_line_note (input_filename, lineno);
		  decl = lookup_label (yyvsp[-1].ttype);
		  expand_goto (decl); ;
    break;}
case 250:
#line 1014 "c-parse.y"
{ tree label = define_label (input_filename, lineno, yyvsp[-1].ttype);
		  if (label)
		    expand_label (label); ;
    break;}
case 253:
#line 1025 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  /* We use emit_note rather than emit_line_note
		     so that this note is emitted even if line #s
		     are not generally wanted.  */
		  emit_note (input_filename, lineno); ;
    break;}
case 254:
#line 1032 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  emit_note (input_filename, lineno); ;
    break;}
case 255:
#line 1039 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 257:
#line 1046 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 260:
#line 1053 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 261:
#line 1058 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 262:
#line 1063 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 263:
#line 1065 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 264:
#line 1071 "c-parse.y"
{ pushlevel (0); ;
    break;}
case 265:
#line 1073 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype; poplevel (0, 0, 0); ;
    break;}
case 266:
#line 1079 "c-parse.y"
{ pushlevel (0); ;
    break;}
case 267:
#line 1081 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype; poplevel (0, 0, 0); ;
    break;}
case 269:
#line 1087 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, yyvsp[-1].ttype); ;
    break;}
case 270:
#line 1089 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;
    break;}
case 272:
#line 1095 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;
    break;}
case 273:
#line 1101 "c-parse.y"
{ yyval.ttype = get_parm_info (0); ;
    break;}
case 274:
#line 1103 "c-parse.y"
{ yyval.ttype = get_parm_info (1); ;
    break;}
case 275:
#line 1105 "c-parse.y"
{ yyval.ttype = get_parm_info (0); ;
    break;}
case 276:
#line 1110 "c-parse.y"
{ push_parm_decl (yyvsp[0].ttype); ;
    break;}
case 277:
#line 1112 "c-parse.y"
{ push_parm_decl (yyvsp[0].ttype); ;
    break;}
case 278:
#line 1119 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 279:
#line 1121 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 280:
#line 1123 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 281:
#line 1125 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 282:
#line 1127 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 283:
#line 1133 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 284:
#line 1135 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 408 "bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#ifdef YYDEBUG
  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.  */
    {
      ++yynerr;
      yyerror("parse error");
    }

  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;

#ifdef YYDEBUG
      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

#ifdef YYDEBUG
  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;

#ifdef YYDEBUG
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;
}
#line 1137 "c-parse.y"


/* Return something to represent absolute declarators containing a *.
   TARGET is the absolute declarator that the * contains.
   TYPE_QUALS is a list of modifiers such as const or volatile
   to apply to the pointer type, represented as identifiers.

   We return an INDIRECT_REF whose "contents" are TARGET
   and whose type is the modifier list.  */
   
static tree
make_pointer_declarator (type_quals, target)
     tree type_quals, target;
{
  return build (INDIRECT_REF, type_quals, target);
}

/* Given a chain of STRING_CST nodes,
   concatenate them into one STRING_CST
   and give it a suitable array-of-chars data type.  */

static tree
combine_strings (strings)
     tree strings;
{
  register tree value, t;
  register int length = 1;
  int wide_length = 0;
  int wide_flag = 0;

  if (TREE_CHAIN (strings))
    {
      /* More than one in the chain, so concatenate.  */
      register char *p, *q;

      /* Don't include the \0 at the end of each substring,
	 except for the last one.
	 Count wide strings and ordinary strings separately.  */
      for (t = strings; t; t = TREE_CHAIN (t))
	{
	  if (TREE_TYPE (t) == int_array_type_node)
	    {
	      wide_length += (TREE_STRING_LENGTH (t) - 1);
	      wide_flag = 1;
	    }
	  else
	    length += (TREE_STRING_LENGTH (t) - 1);
	}

      /* If anything is wide, the non-wides will be converted,
	 which makes them take more space.  */
      if (wide_flag)
	length = length * UNITS_PER_WORD + wide_length;

      p = (char *) oballoc (length);

      /* Copy the individual strings into the new combined string.
	 If the combined string is wide, convert the chars to ints
	 for any individual strings that are not wide.  */

      q = p;
      for (t = strings; t; t = TREE_CHAIN (t))
	{
	  int len = TREE_STRING_LENGTH (t) - 1;
	  if ((TREE_TYPE (t) == int_array_type_node) == wide_flag)
	    {
	      bcopy (TREE_STRING_POINTER (t), q, len);
	      q += len;
	    }
	  else
	    {
	      int i;
	      for (i = 0; i < len; i++)
		((int *) q)[i] = TREE_STRING_POINTER (t)[i];
	      q += len * UNITS_PER_WORD;
	    }
	}
      *q = 0;

      value = make_node (STRING_CST);
      TREE_STRING_POINTER (value) = p;
      TREE_STRING_LENGTH (value) = length;
      TREE_LITERAL (value) = 1;
    }
  else
    {
      value = strings;
      length = TREE_STRING_LENGTH (value);
      if (TREE_TYPE (value) == int_array_type_node)
	wide_flag = 1;
    }

  /* Create the array type for the string constant.
     -Wwrite-strings says make the string constant an array of const char
     so that copying it to a non-const pointer will get a warning.  */
  if (warn_write_strings)
    {
      tree elements
	= build_type_variant (wide_flag ? integer_type_node : char_type_node,
			      1, 0);
      TREE_TYPE (value)
	= build_array_type (elements,
			    build_index_type (build_int_2 (length - 1, 0)));
    }
  else
    TREE_TYPE (value)
      = build_array_type (wide_flag ? integer_type_node : char_type_node,
			  build_index_type (build_int_2 (length - 1, 0)));
  TREE_LITERAL (value) = 1;
  TREE_STATIC (value) = 1;
  return value;
}

int lineno;			/* current line number in file being read */

FILE *finput;			/* input file.
				   Normally a pipe from the preprocessor.  */

/* lexical analyzer */

static int maxtoken;		/* Current nominal length of token buffer */
static char *token_buffer;	/* Pointer to token buffer.
				   Actual allocated length is maxtoken + 2.  */
static int end_of_file;

#define MIN_WORD_SIZE       2      /* minimum size for C keyword */
#define MAX_WORD_SIZE       9      /* maximum size for C keyword */
#define MIN_KEY_SIZE        4      /* range of the hash keys values for the */
#define MAX_KEY_SIZE        39     /* minimum perfect hash generator */

#define NORID RID_UNUSED

struct resword {char *name; short token; enum rid rid;};

/* This is the hash table of keywords.
   The order of keywords has been chosen for perfect hashing.
   Therefore, this table cannot be updated by hand.
   Use the program perfect-hash to generate an updated table.  */

static struct resword reswords[] 
  = {{NULL, 0, NORID},            
     {NULL, 0, NORID}, /* these locations are not used. */
     {NULL, 0, NORID}, /* they simplify the hashing.    */
     {NULL, 0, NORID},
     {"else", ELSE, NORID},
     {"enum", ENUM, NORID},
     {"while", WHILE, NORID},
     {"extern", SCSPEC, RID_EXTERN},
     {"double", TYPESPEC, RID_DOUBLE},
     {"default", DEFAULT, NORID},
     {"do", DO, NORID},
     {"goto", GOTO, NORID},
     {"short", TYPESPEC, RID_SHORT},        
     {"struct", STRUCT, NORID},
     {"return", RETURN, NORID},
     {"signed", TYPESPEC, RID_SIGNED},       
     {"float", TYPESPEC, RID_FLOAT},        
     {"typeof", TYPEOF, NORID},
     {"typedef", SCSPEC, RID_TYPEDEF},        
     {"switch", SWITCH, NORID},
     {"int", TYPESPEC, RID_INT},          
     {"for", FOR, NORID},
     {"register", SCSPEC, RID_REGISTER},       
     {"inline", SCSPEC, RID_INLINE},         
     {"sizeof", SIZEOF, NORID},
     {"void", TYPESPEC, RID_VOID},         
     {"__alignof", ALIGNOF, NORID},
     {"volatile", TYPE_QUAL, RID_VOLATILE},    
     {"case", CASE, NORID},
     {"const", TYPE_QUAL, RID_CONST},       
     {"if", IF, NORID},
     {"long", TYPESPEC, RID_LONG},         
     {"continue", CONTINUE, NORID},
     {"asm", ASM, NORID},
     {"union", UNION, NORID},
     {"char", TYPESPEC, RID_CHAR},         
     {"break", BREAK, NORID},               
     {"static", SCSPEC, RID_STATIC},         
     {"unsigned", TYPESPEC, RID_UNSIGNED},     
     {"auto", SCSPEC, RID_AUTO}};

/* The elements of `ridpointers' are identifier nodes
   for the reserved type names and storage classes.
   It is indexed by a RID_... value.  */

tree ridpointers[(int) RID_MAX];

int check_newline ();

/* This function performs the minimum-perfect hash mapping from input
   string to reswords table index.  It only looks at the first and 
   last characters in the string, thus assuring the O(1) lookup time 
   (this keeps our constant down to an insignificant amount!).  Compiling
   the following 2 functions as inline removes all overhead of the
   function calls. */

#ifdef __GNUC__
inline
#endif
static int
hash (str, len)
     register char *str;             
     register int len;
{
  /* This table is used to build the hash table index that recognizes
     reserved words in 0(1) steps.  It is larger than strictly necessary, 
     but I'm trading off the space for the time-saving luxury of avoiding 
     subtraction of an offset. */

  static char hash_table[]
    = {0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
       0,  0,  0,  0,  0,  6,  0, 29, 31, 24,
       2,  0, 11,  1,  6, 17,  0,  0, 26,  1,
       1,  6,  0,  0,  7,  7,  0, 28, 19,  1,
       0,  0,  0,  0,  0,  0,  0,  0};

  /* The hash function couldn't be simpler: add the length of the string
     to the Hash_Table value of its first and last character. */

  return len + hash_table[(int) str[0]] + hash_table[(int) str[len - 1]];
}

/* This routine attempts to match the string found in the reswords with
   the one from the input stream.  If all the relevant details match an
   actual strcmp comparison is performed.  */

#ifdef __GNUC__
inline
#endif
static struct resword *
is_reserved_word (str,len)
     register char *str;
     register int len;
{
  if (len <= MAX_WORD_SIZE && len >= MIN_WORD_SIZE) 
    {
      register int key = hash (str, len);

      if (key >= MIN_KEY_SIZE && key <= MAX_KEY_SIZE)
	if (reswords[key].name[0] == str[0]
	    && !strcmp (reswords[key].name + 1, str + 1))
	  return &reswords[key];
    }
  return NULL;   
}

void
init_lex ()
{
  extern char *malloc ();

  /* Start it at 0, because check_newline is called at the very beginning
     and will increment it to 1.  */
  lineno = 0;

  maxtoken = 40;
  token_buffer = malloc (maxtoken + 2);
  ridpointers[(int) RID_INT] = get_identifier ("int");
  ridpointers[(int) RID_CHAR] = get_identifier ("char");
  ridpointers[(int) RID_VOID] = get_identifier ("void");
  ridpointers[(int) RID_FLOAT] = get_identifier ("float");
  ridpointers[(int) RID_DOUBLE] = get_identifier ("double");
  ridpointers[(int) RID_SHORT] = get_identifier ("short");
  ridpointers[(int) RID_LONG] = get_identifier ("long");
  ridpointers[(int) RID_UNSIGNED] = get_identifier ("unsigned");
  ridpointers[(int) RID_SIGNED] = get_identifier ("signed");
  ridpointers[(int) RID_INLINE] = get_identifier ("inline");
  ridpointers[(int) RID_CONST] = get_identifier ("const");
  ridpointers[(int) RID_VOLATILE] = get_identifier ("volatile");
  ridpointers[(int) RID_AUTO] = get_identifier ("auto");
  ridpointers[(int) RID_STATIC] = get_identifier ("static");
  ridpointers[(int) RID_EXTERN] = get_identifier ("extern");
  ridpointers[(int) RID_TYPEDEF] = get_identifier ("typedef");
  ridpointers[(int) RID_REGISTER] = get_identifier ("register");
}

static void
reinit_parse_for_function ()
{
}

/* If C is not whitespace, return C.
   Otherwise skip whitespace and return first nonwhite char read.  */

static int
skip_white_space (c)
     register int c;
{
  register int inside;

  for (;;)
    {
      switch (c)
	{
	  /* Don't recognize comments in cc1: all comments are removed by cpp,
	     and cpp output can include / and * consecutively as operators.  */
#if 0
	case '/':
	  c = getc (finput);
	  if (c != '*')
	    {
	      ungetc (c, finput);
	      return '/';
	    }

	  c = getc (finput);

	  inside = 1;
	  while (inside)
	    {
	      if (c == '*')
		{
		  while (c == '*')
		    c = getc (finput);

		  if (c == '/')
		    {
		      inside = 0;
		      c = getc (finput);
		    }
		}
	      else if (c == '\n')
		{
		  lineno++;
		  c = getc (finput);
		}
	      else if (c == EOF)
		{
		  error ("unterminated comment");
		  break;
		}
	      else
		c = getc (finput);
	    }

	  break;
#endif

	case '\n':
	  c = check_newline ();
	  break;

	case ' ':
	case '\t':
	case '\f':
	case '\r':
	case '\b':
	  c = getc (finput);
	  break;

	case '\\':
	  c = getc (finput);
	  if (c == '\n')
	    lineno++;
	  else
	    error ("stray '\\' in program");
	  c = getc (finput);
	  break;

	default:
	  return (c);
	}
    }
}



/* Make the token buffer longer, preserving the data in it.
   P should point to just beyond the last valid character in the old buffer.
   The value we return is a pointer to the new buffer
   at a place corresponding to P.  */

static char *
extend_token_buffer (p)
     char *p;
{
  int offset = p - token_buffer;

  maxtoken = maxtoken * 2 + 10;
  token_buffer = (char *) realloc (token_buffer, maxtoken + 2);
  if (token_buffer == 0)
    fatal ("virtual memory exceeded");

  return token_buffer + offset;
}

/* At the beginning of a line, increment the line number
   and handle a #line directive immediately following.
   Return first nonwhite char of first non-# line following.  */

int
check_newline ()
{
  register int c;
  register int token;

  while (1)
    {
      lineno++;

      /* Read first nonwhite char on the line.  */

      c = getc (finput);
      while (c == ' ' || c == '\t')
	c = getc (finput);

      if (c != '#')
	{
	  /* If not #, return it so caller will use it.  */
	  return c;
	}

      /* Read first nonwhite char after the `#'.  */

      c = getc (finput);
      while (c == ' ' || c == '\t')
	c = getc (finput);

      /* If a letter follows, then if the word here is `line', skip
	 it and ignore it; otherwise, ignore the line, with an error
	 if the word isn't `pragma'.  */

      if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
	{
	  if (c == 'p')
	    {
	      if (getc (finput) == 'r'
		  && getc (finput) == 'a'
		  && getc (finput) == 'g'
		  && getc (finput) == 'm'
		  && getc (finput) == 'a'
		  && ((c = getc (finput)) == ' ' || c == '\t'))
		goto noerror;
	    }

	  else if (c == 'l')
	    {
	      if (getc (finput) == 'i'
		  && getc (finput) == 'n'
		  && getc (finput) == 'e'
		  && ((c = getc (finput)) == ' ' || c == '\t'))
		goto linenum;
	    }
#ifdef IDENT_DIRECTIVE
	  else if (c == 'i')
	    {
	      if (getc (finput) == 'd'
		  && getc (finput) == 'e'
		  && getc (finput) == 'n'
		  && getc (finput) == 't'
		  && ((c = getc (finput)) == ' ' || c == '\t'))
		{
		  extern FILE *asm_out_file;

		  if (pedantic)
		    error ("ANSI C does not allow #ident");

		  /* Here we have just seen `#ident '.
		     A string constant should follow.  */

		  while (c == ' ' || c == '\t')
		    c = getc (finput);

		  /* If no argument, ignore the line.  */
		  if (c == '\n')
		    continue;

		  ungetc (c, finput);
		  token = yylex ();
		  if (token != STRING
		      || TREE_CODE (yylval.ttype) != STRING_CST)
		    {
		      error ("invalid #ident");
		      return getc (finput);
		    }

#ifdef ASM_OUTPUT_IDENT
		  ASM_OUTPUT_IDENT (asm_out_file, TREE_STRING_POINTER (yylval.ttype));
#else
		  fprintf (asm_out_file, "\t.ident \"%s\"\n",
			   TREE_STRING_POINTER (yylval.ttype));
#endif

		  /* Skip the rest of this line.  */
		  while ((c = getc (finput)) && c != '\n');
		  if (c == 0)
		    return 0;
		  continue;
		}
	    }
#endif

	  error ("undefined or invalid # directive");
	noerror:

	  while ((c = getc (finput)) && c != '\n');

	  if (c == 0)
	    return 0;
	  continue;
	}

    linenum:
      /* Here we have either `#line' or `# <nonletter>'.
	 In either case, it should be a line number; a digit should follow.  */

      while (c == ' ' || c == '\t')
	c = getc (finput);

      /* If the # is the only nonwhite char on the line,
	 just ignore it.  Check the new newline.  */
      if (c == '\n')
	continue;

      /* Something follows the #; read a token.  */

      ungetc (c, finput);
      token = yylex ();

      if (token == CONSTANT
	  && TREE_CODE (yylval.ttype) == INTEGER_CST)
	{
	  /* subtract one, because it is the following line that
	     gets the specified number */

	  int l = TREE_INT_CST_LOW (yylval.ttype) - 1;

	  /* Is this the last nonwhite stuff on the line?  */
	  c = getc (finput);
	  while (c == ' ' || c == '\t')
	    c = getc (finput);
	  if (c == '\n')
	    {
	      /* No more: store the line number and check following line.  */
	      lineno = l;
	      continue;
	    }
	  ungetc (c, finput);

	  /* More follows: it must be a string constant (filename).  */

	  token = yylex ();
	  if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST)
	    {
	      error ("invalid #line");
	      return getc (finput);
	    }

	  input_filename
	    = (char *) permalloc (TREE_STRING_LENGTH (yylval.ttype) + 1);
	  strcpy (input_filename, TREE_STRING_POINTER (yylval.ttype));
	  lineno = l;

	  if (main_input_filename == 0)
	    main_input_filename = input_filename;
	}
      else
	error ("invalid #line");

      /* skip the rest of this line.  */
      while ((c = getc (finput)) && c != '\n');
      if (c == 0)
	return 0;
    }
}

#define isalnum(char) ((char >= 'a' && char <= 'z') || (char >= 'A' && char <= 'Z') || (char >= '0' && char <= '9'))
#define isdigit(char) (char >= '0' && char <= '9')
#define ENDFILE -1  /* token that represents end-of-file */


static int
readescape ()
{
  register int c = getc (finput);
  register int count, code;

  switch (c)
    {
    case 'x':
      code = 0;
      count = 0;
      while (1)
	{
	  c = getc (finput);
	  if (!(c >= 'a' && c <= 'f')
	      && !(c >= 'A' && c <= 'F')
	      && !(c >= '0' && c <= '9'))
	    {
	      ungetc (c, finput);
	      break;
	    }
	  code *= 16;
	  if (c >= 'a' && c <= 'f')
	    code += c - 'a' + 10;
	  if (c >= 'A' && c <= 'F')
	    code += c - 'A' + 10;
	  if (c >= '0' && c <= '9')
	    code += c - '0';
	  count++;
	}
      if (count == 0)
	error ("\\x used with no following hex digits");
      return code;

    case '0':  case '1':  case '2':  case '3':  case '4':
    case '5':  case '6':  case '7':
      code = 0;
      count = 0;
      while ((c <= '7') && (c >= '0') && (count++ < 3))
	{
	  code = (code * 8) + (c - '0');
	  c = getc (finput);
	}
      ungetc (c, finput);
      return code;

    case '\\': case '\'': case '"':
      return c;

    case '\n':
      lineno++;
      return -1;

    case 'n':
      return TARGET_NEWLINE;

    case 't':
      return TARGET_TAB;

    case 'r':
      return TARGET_CR;

    case 'f':
      return TARGET_FF;

    case 'b':
      return TARGET_BS;

    case 'a':
      return TARGET_BELL;

    case 'v':
      return TARGET_VT;

    case 'E':
      return 033;

    case '?':
      /* `\(', etc, are used at beginning of line to avoid confusing Emacs.  */
    case '(':
    case '{':
    case '[':
      return c;
    }
  if (c >= 040 && c <= 0177)
    warning ("unknown escape sequence `\\%c'", c);
  else
    warning ("unknown escape sequence: `\\' followed by char code 0x%x", c);
  return c;
}

void
yyerror (string)
     char *string;
{
  char buf[200];

  strcpy (buf, string);

  /* We can't print string and character constants well
     because the token_buffer contains the result of processing escapes.  */
  if (end_of_file)
    strcat (buf, " at end of input");
  else if (token_buffer[0] == 0)
    strcat (buf, " at null character");
  else if (token_buffer[0] == '"')
    strcat (buf, " before string constant");
  else if (token_buffer[0] == '\'')
    strcat (buf, " before character constant");
  else
    strcat (buf, " before `%s'");

  error (buf, token_buffer);
}

static int nextchar = -1;

static int
yylex ()
{
  register int c;
  register char *p;
  register int value;
  int wide_flag = 0;

  if (nextchar >= 0)
    c = nextchar, nextchar = -1;
  else
    c = getc (finput);

  /* Effectively do c = skip_white_space (c)
     but do it faster in the usual cases.  */
  while (1)
    switch (c)
      {
      case ' ':
      case '\t':
      case '\f':
      case '\r':
      case '\b':
	c = getc (finput);
	break;

      case '\n':
      case '/':
      case '\\':
	c = skip_white_space (c);
      default:
	goto found_nonwhite;
      }
 found_nonwhite:

  token_buffer[0] = c;
  token_buffer[1] = 0;

/*  yylloc.first_line = lineno; */

  switch (c)
    {
    case EOF:
      end_of_file = 1;
      token_buffer[0] = 0;
      value = ENDFILE;
      break;

    case '$':
      if (dollars_in_ident)
	goto letter;
      return '$';

    case 'L':
      /* Capital L may start a wide-string or wide-character constant.  */
      {
	register int c = getc (finput);
	if (c == '\'')
	  {
	    wide_flag = 1;
	    goto char_constant;
	  }
	if (c == '"')
	  {
	    wide_flag = 1;
	    goto string_constant;
	  }
	ungetc (c, finput);
      }

    case 'A':  case 'B':  case 'C':  case 'D':  case 'E':
    case 'F':  case 'G':  case 'H':  case 'I':  case 'J':
    case 'K':		  case 'M':  case 'N':  case 'O':
    case 'P':  case 'Q':  case 'R':  case 'S':  case 'T':
    case 'U':  case 'V':  case 'W':  case 'X':  case 'Y':
    case 'Z':
    case 'a':  case 'b':  case 'c':  case 'd':  case 'e':
    case 'f':  case 'g':  case 'h':  case 'i':  case 'j':
    case 'k':  case 'l':  case 'm':  case 'n':  case 'o':
    case 'p':  case 'q':  case 'r':  case 's':  case 't':
    case 'u':  case 'v':  case 'w':  case 'x':  case 'y':
    case 'z':
    case '_':
    letter:
      p = token_buffer;
      while (isalnum (c) || c == '_' || c == '$')
	{
	  if (p >= token_buffer + maxtoken)
	    p = extend_token_buffer (p);
	  if (c == '$' && ! dollars_in_ident)
	    break;

	  *p++ = c;
	  c = getc (finput);
	}

      *p = 0;
      nextchar = c;

      value = IDENTIFIER;
      yylval.itype = 0;

      /* Try to recognize a keyword.  Uses minimum-perfect hash function */
  
      {
	register struct resword *ptr;

	if (ptr = is_reserved_word (token_buffer, p - token_buffer))
	  {
	    if (ptr->rid)
	      yylval.ttype = ridpointers[(int) ptr->rid];
	    if ((! flag_no_asm
		 /* -fno-asm means don't recognize the non-ANSI keywords.  */
		 || ((int) ptr->token != ASM
		     && (int) ptr->token != TYPEOF
		     && ptr->rid != RID_INLINE))
		/* -ftraditional means don't recognize nontraditional keywords
		   typeof, const, volatile, signed or inline.  */
		&& (! flag_traditional
		    || ((int) ptr->token != TYPE_QUAL
			&& (int) ptr->token != TYPEOF
			&& ptr->rid != RID_SIGNED
			&& ptr->rid != RID_INLINE)))
	      value = (int) ptr->token;
	  }
      }

      /* If we did not find a keyword, look for an identifier
	 (or a typename).  */

      if (value == IDENTIFIER)
	{
          yylval.ttype = get_identifier (token_buffer);
	  lastiddecl = lookup_name (yylval.ttype);

	  if (lastiddecl != 0 && TREE_CODE (lastiddecl) == TYPE_DECL)
	    value = TYPENAME;
	}

      break;

    case '0':  case '1':  case '2':  case '3':  case '4':
    case '5':  case '6':  case '7':  case '8':  case '9':
    case '.':
      {
	int base = 10;
	int count = 0;
	int largest_digit = 0;
	int numdigits = 0;
	/* for multi-precision arithmetic,
	   we store only 8 live bits in each short,
	   giving us 64 bits of reliable precision */
	short shorts[8];

	enum anon1 { NOT_FLOAT, AFTER_POINT, TOO_MANY_POINTS} floatflag
	  = NOT_FLOAT;

	for (count = 0; count < 8; count++)
	  shorts[count] = 0;

	p = token_buffer;
	*p++ = c;

	if (c == '0')
	  {
	    *p++ = (c = getc (finput));
	    if ((c == 'x') || (c == 'X'))
	      {
		base = 16;
		*p++ = (c = getc (finput));
	      }
	    else
	      {
		base = 8;
		numdigits++;
	      }
	  }

	/* Read all the digits-and-decimal-points.  */

	while (c == '.'
	       || (isalnum (c) && (c != 'l') && (c != 'L')
		   && (c != 'u') && (c != 'U')
		   && (floatflag == NOT_FLOAT || ((c != 'f') && (c != 'F')))))
	  {
	    if (c == '.')
	      {
		if (base == 16)
		  error ("floating constant may not be in radix 16");
		if (floatflag == AFTER_POINT)
		  {
		    error ("malformed floating constant");
		    floatflag = TOO_MANY_POINTS;
		  }
		else
		  floatflag = AFTER_POINT;

		base = 10;
		*p++ = c = getc (finput);
		/* Accept '.' as the start of a floating-point number
		   only when it is followed by a digit.
		   Otherwise, unread the following non-digit
		   and use the '.' as a structural token.  */
		if (p == token_buffer + 2 && !isdigit (c))
		  {
		    if (c == '.')
		      {
			c = getc (finput);
			if (c == '.')
			  {
			    *p++ = c;
			    *p = 0;
			    return ELLIPSIS;
			  }
			error ("parse error at `..'");
		      }
		    ungetc (c, finput);
		    token_buffer[1] = 0;
		    value = '.';
		    goto done;
		  }
	      }
	    else
	      {
		/* It is not a decimal point.
		   It should be a digit (perhaps a hex digit).  */

		if (isdigit (c))
		  {
		    c = c - '0';
		  }
		else if (base <= 10)
		  {
		    if ((c&~040) == 'E')
		      {
			base = 10;
			floatflag = AFTER_POINT;
			break;   /* start of exponent */
		      }
		    error ("nondigits in number and not hexadecimal");
		    c = 0;
		  }
		else if (c >= 'a')
		  {
		    c = c - 'a' + 10;
		  }
		else
		  {
		    c = c - 'A' + 10;
		  }
		if (c >= largest_digit)
		  largest_digit = c;
		numdigits++;
	    
		for (count = 0; count < 8; count++)
		  {
		    (shorts[count] *= base);
		    if (count)
		      {
			shorts[count] += (shorts[count-1] >> 8);
			shorts[count-1] &= (1<<8)-1;
		      }
		    else shorts[0] += c;
		  }
    
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = (c = getc (finput));
	      }
	  }

	if (numdigits == 0)
	  error ("numeric constant with no digits");

	if (largest_digit >= base)
	  error ("numeric constant contains digits beyond the radix");

	/* Remove terminating char from the token buffer and delimit the string */
	*--p = 0;

	if (floatflag != NOT_FLOAT)
	  {
	    tree type = double_type_node;
	    char f_seen = 0;
	    char l_seen = 0;
	    double value;

	    /* Read explicit exponent if any, and put it in tokenbuf.  */

	    if ((c == 'e') || (c == 'E'))
	      {
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
		if ((c == '+') || (c == '-'))
		  {
		    *p++ = c;
		    c = getc (finput);
		  }
		if (! isdigit (c))
		  error ("floating constant exponent has no digits");
	        while (isdigit (c))
		  {
		    if (p >= token_buffer + maxtoken - 3)
		      p = extend_token_buffer (p);
		    *p++ = c;
		    c = getc (finput);
		  }
	      }

	    *p = 0;
	    errno = 0;
	    value = atof (token_buffer);
#ifdef ERANGE
	    if (errno == ERANGE && !flag_traditional)
	      {
		char *p1 = token_buffer;
		/* Check for "0.0" and variants;
		   Sunos 4 spuriously returns ERANGE for them.  */
		while (*p1 == '0') p1++;
		if (*p1 == '.') p1++;
		while (*p1 == '0') p1++;
		if (*p1 != 0)
		  warning ("floating point number exceeds range of `double'");
	      }
#endif

	    /* Read the suffixes to choose a data type.  */
	    while (1)
	      {
		if (c == 'f' || c == 'F')
		  {
		    if (f_seen)
		      error ("two `f's in floating constant");
		    f_seen = 1;
		    type = float_type_node;
		  }
		else if (c == 'l' || c == 'L')
		  {
		    if (l_seen)
		      error ("two `l's in floating constant");
		    l_seen = 1;
		    type = long_double_type_node;
		  }
		else
		  {
		    if (isalnum (c))
		      {
			error ("garbage at end of number");
			while (isalnum (c))
			  {
			    if (p >= token_buffer + maxtoken - 3)
			      p = extend_token_buffer (p);
			    *p++ = c;
			    c = getc (finput);
			  }
		      }
		    break;
		  }
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
	      }

	    /* Create a node with determined type and value.  */
	    yylval.ttype = build_real (type, value);

	    ungetc (c, finput);
	    *p = 0;
	  }
	else
	  {
	    tree type;
	    int spec_unsigned = 0;
	    int spec_long = 0;

	    while (1)
	      {
		if (c == 'u' || c == 'U')
		  {
		    if (spec_unsigned)
		      error ("two `u's in integer constant");
		    spec_unsigned = 1;
		  }
		else if (c == 'l' || c == 'L')
		  {
		    if (spec_long)
		      error ("two `l's in integer constant");
		    spec_long = 1;
		  }
		else
		  {
		    if (isalnum (c))
		      {
			error ("garbage at end of number");
			while (isalnum (c))
			  {
			    if (p >= token_buffer + maxtoken - 3)
			      p = extend_token_buffer (p);
			    *p++ = c;
			    c = getc (finput);
			  }
		      }
		    break;
		  }
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
	      }

	    ungetc (c, finput);

	    if (shorts[7] | shorts[6] | shorts[5] | shorts[4])
	      warning ("integer constant out of range");

	    /* This is simplified by the fact that our constant
	       is always positive.  */
	    yylval.ttype
	      = build_int_2 ((shorts[3]<<24) + (shorts[2]<<16) + (shorts[1]<<8) + shorts[0],
			     0);
    
	    if (!spec_long && !spec_unsigned
		&& int_fits_type_p (yylval.ttype, integer_type_node))
	      type = integer_type_node;

	    else if (!spec_long && base != 10
		&& int_fits_type_p (yylval.ttype, unsigned_type_node))
	      type = unsigned_type_node;

	    else if (!spec_unsigned
		&& int_fits_type_p (yylval.ttype, long_integer_type_node))
	      type = long_integer_type_node;

	    else
	      {
		type = long_unsigned_type_node;
		if (! int_fits_type_p (yylval.ttype, long_unsigned_type_node))
		  warning ("integer constant out of range");
	      }
	    TREE_TYPE (yylval.ttype) = type;
	  }

	value = CONSTANT; break;
      }

    case '\'':
    char_constant:
      c = getc (finput);
      {
	register int code = 0;

      tryagain:

	if (c == '\\')
	  {
	    c = readescape ();
	    if (c < 0)
	      goto tryagain;
	  }
	else if (c == '\n')
	  {
	    if (pedantic)
	      warning ("ANSI C forbids newline in character constant");
	    lineno++;
	  }

	code = c;
	token_buffer[1] = c;
	token_buffer[2] = '\'';
	token_buffer[3] = 0;

	c = getc (finput);
	if (c != '\'')
	  error ("malformatted character constant");

	/* If char type is signed, sign-extend the constant.  */
	if (TREE_UNSIGNED (char_type_node)
	    || ((code >> (BITS_PER_UNIT - 1)) & 1) == 0)
	  yylval.ttype = build_int_2 (code & ((1 << BITS_PER_UNIT) - 1), 0);
	else
	  yylval.ttype = build_int_2 (code | ((-1) << BITS_PER_UNIT), -1);

	TREE_TYPE (yylval.ttype) = integer_type_node;
	value = CONSTANT; break;
      }

    case '"':
    string_constant:
      {
	c = getc (finput);
	p = token_buffer + 1;

	while (c != '"')
	  {
	    if (c == '\\')
	      {
		c = readescape ();
		if (c < 0)
		  goto skipnewline;
	      }
	    else if (c == '\n')
	      {
		if (pedantic)
		  warning ("ANSI C forbids newline in string constant");
		lineno++;
	      }

	    if (p == token_buffer + maxtoken)
	      p = extend_token_buffer (p);
	    *p++ = c;

	  skipnewline:
	    c = getc (finput);
	  }

	*p = 0;

	if (wide_flag)
	  {
	    /* If this is a L"..." wide-string, convert each char
	       to an int, making a vector of ints.  */
	    int *widebuf = (int *) alloca (p - token_buffer);
	    char *p1 = token_buffer + 1;
	    for (; p1 != p; p1++)
	      widebuf[p1 - token_buffer - 1] = *p1;
	    yylval.ttype = build_string ((p - token_buffer) * sizeof (int),
					 widebuf);
	    TREE_TYPE (yylval.ttype) = int_array_type_node;
	  }
	else
	  {
	    yylval.ttype = build_string (p - token_buffer, token_buffer + 1);
	    TREE_TYPE (yylval.ttype) = char_array_type_node;
	  }

	*p++ = '"';
	*p = 0;

	value = STRING; break;
      }
      
    case '+':
    case '-':
    case '&':
    case '|':
    case '<':
    case '>':
    case '*':
    case '/':
    case '%':
    case '^':
    case '!':
    case '=':
      {
	register int c1;

      combine:

	switch (c)
	  {
	  case '+':
	    yylval.code = PLUS_EXPR; break;
	  case '-':
	    yylval.code = MINUS_EXPR; break;
	  case '&':
	    yylval.code = BIT_AND_EXPR; break;
	  case '|':
	    yylval.code = BIT_IOR_EXPR; break;
	  case '*':
	    yylval.code = MULT_EXPR; break;
	  case '/':
	    yylval.code = TRUNC_DIV_EXPR; break;
	  case '%':
	    yylval.code = TRUNC_MOD_EXPR; break;
	  case '^':
	    yylval.code = BIT_XOR_EXPR; break;
	  case LSHIFT:
	    yylval.code = LSHIFT_EXPR; break;
	  case RSHIFT:
	    yylval.code = RSHIFT_EXPR; break;
	  case '<':
	    yylval.code = LT_EXPR; break;
	  case '>':
	    yylval.code = GT_EXPR; break;
	  }	

	token_buffer[1] = c1 = getc (finput);
	token_buffer[2] = 0;

	if (c1 == '=')
	  {
	    switch (c)
	      {
	      case '<':
		value = ARITHCOMPARE; yylval.code = LE_EXPR; goto done;
	      case '>':
		value = ARITHCOMPARE; yylval.code = GE_EXPR; goto done;
	      case '!':
		value = EQCOMPARE; yylval.code = NE_EXPR; goto done;
	      case '=':
		value = EQCOMPARE; yylval.code = EQ_EXPR; goto done;
	      }	
	    value = ASSIGN; goto done;
	  }
	else if (c == c1)
	  switch (c)
	    {
	    case '+':
	      value = PLUSPLUS; goto done;
	    case '-':
	      value = MINUSMINUS; goto done;
	    case '&':
	      value = ANDAND; goto done;
	    case '|':
	      value = OROR; goto done;
	    case '<':
	      c = LSHIFT;
	      goto combine;
	    case '>':
	      c = RSHIFT;
	      goto combine;
	    }
	else if ((c == '-') && (c1 == '>'))
	  { value = POINTSAT; goto done; }
	ungetc (c1, finput);
	token_buffer[1] = 0;

	if ((c == '<') || (c == '>'))
	  value = ARITHCOMPARE;
	else value = c;
	goto done;
      }

    case 0:
      /* Don't make yyparse think this is eof.  */
      value = 1;
      break;

    default:
      value = c;
    }

done:
/*  yylloc.last_line = lineno; */

  return value;
}
