|
|
/* A Bison parser, made from jv-exp.y
|
/* A Bison parser, made from jv-exp.y
|
by GNU Bison version 1.27
|
by GNU Bison version 1.27
|
*/
|
*/
|
|
|
#define YYBISON 1 /* Identify Bison output. */
|
#define YYBISON 1 /* Identify Bison output. */
|
|
|
#define INTEGER_LITERAL 257
|
#define INTEGER_LITERAL 257
|
#define FLOATING_POINT_LITERAL 258
|
#define FLOATING_POINT_LITERAL 258
|
#define IDENTIFIER 259
|
#define IDENTIFIER 259
|
#define STRING_LITERAL 260
|
#define STRING_LITERAL 260
|
#define BOOLEAN_LITERAL 261
|
#define BOOLEAN_LITERAL 261
|
#define TYPENAME 262
|
#define TYPENAME 262
|
#define NAME_OR_INT 263
|
#define NAME_OR_INT 263
|
#define ERROR 264
|
#define ERROR 264
|
#define LONG 265
|
#define LONG 265
|
#define SHORT 266
|
#define SHORT 266
|
#define BYTE 267
|
#define BYTE 267
|
#define INT 268
|
#define INT 268
|
#define CHAR 269
|
#define CHAR 269
|
#define BOOLEAN 270
|
#define BOOLEAN 270
|
#define DOUBLE 271
|
#define DOUBLE 271
|
#define FLOAT 272
|
#define FLOAT 272
|
#define VARIABLE 273
|
#define VARIABLE 273
|
#define ASSIGN_MODIFY 274
|
#define ASSIGN_MODIFY 274
|
#define THIS 275
|
#define THIS 275
|
#define SUPER 276
|
#define SUPER 276
|
#define NEW 277
|
#define NEW 277
|
#define OROR 278
|
#define OROR 278
|
#define ANDAND 279
|
#define ANDAND 279
|
#define EQUAL 280
|
#define EQUAL 280
|
#define NOTEQUAL 281
|
#define NOTEQUAL 281
|
#define LEQ 282
|
#define LEQ 282
|
#define GEQ 283
|
#define GEQ 283
|
#define LSH 284
|
#define LSH 284
|
#define RSH 285
|
#define RSH 285
|
#define INCREMENT 286
|
#define INCREMENT 286
|
#define DECREMENT 287
|
#define DECREMENT 287
|
|
|
#line 38 "jv-exp.y"
|
#line 38 "jv-exp.y"
|
|
|
|
|
#include "defs.h"
|
#include "defs.h"
|
#include "gdb_string.h"
|
#include "gdb_string.h"
|
#include <ctype.h>
|
#include <ctype.h>
|
#include "expression.h"
|
#include "expression.h"
|
#include "value.h"
|
#include "value.h"
|
#include "parser-defs.h"
|
#include "parser-defs.h"
|
#include "language.h"
|
#include "language.h"
|
#include "jv-lang.h"
|
#include "jv-lang.h"
|
#include "bfd.h" /* Required by objfiles.h. */
|
#include "bfd.h" /* Required by objfiles.h. */
|
#include "symfile.h" /* Required by objfiles.h. */
|
#include "symfile.h" /* Required by objfiles.h. */
|
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
|
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
|
|
|
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
|
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
|
as well as gratuitiously global symbol names, so we can have multiple
|
as well as gratuitiously global symbol names, so we can have multiple
|
yacc generated parsers in gdb. Note that these are only the variables
|
yacc generated parsers in gdb. Note that these are only the variables
|
produced by yacc. If other parser generators (bison, byacc, etc) produce
|
produced by yacc. If other parser generators (bison, byacc, etc) produce
|
additional global names that conflict at link time, then those parser
|
additional global names that conflict at link time, then those parser
|
generators need to be fixed instead of adding those names to this list. */
|
generators need to be fixed instead of adding those names to this list. */
|
|
|
#define yymaxdepth java_maxdepth
|
#define yymaxdepth java_maxdepth
|
#define yyparse java_parse
|
#define yyparse java_parse
|
#define yylex java_lex
|
#define yylex java_lex
|
#define yyerror java_error
|
#define yyerror java_error
|
#define yylval java_lval
|
#define yylval java_lval
|
#define yychar java_char
|
#define yychar java_char
|
#define yydebug java_debug
|
#define yydebug java_debug
|
#define yypact java_pact
|
#define yypact java_pact
|
#define yyr1 java_r1
|
#define yyr1 java_r1
|
#define yyr2 java_r2
|
#define yyr2 java_r2
|
#define yydef java_def
|
#define yydef java_def
|
#define yychk java_chk
|
#define yychk java_chk
|
#define yypgo java_pgo
|
#define yypgo java_pgo
|
#define yyact java_act
|
#define yyact java_act
|
#define yyexca java_exca
|
#define yyexca java_exca
|
#define yyerrflag java_errflag
|
#define yyerrflag java_errflag
|
#define yynerrs java_nerrs
|
#define yynerrs java_nerrs
|
#define yyps java_ps
|
#define yyps java_ps
|
#define yypv java_pv
|
#define yypv java_pv
|
#define yys java_s
|
#define yys java_s
|
#define yy_yys java_yys
|
#define yy_yys java_yys
|
#define yystate java_state
|
#define yystate java_state
|
#define yytmp java_tmp
|
#define yytmp java_tmp
|
#define yyv java_v
|
#define yyv java_v
|
#define yy_yyv java_yyv
|
#define yy_yyv java_yyv
|
#define yyval java_val
|
#define yyval java_val
|
#define yylloc java_lloc
|
#define yylloc java_lloc
|
#define yyreds java_reds /* With YYDEBUG defined */
|
#define yyreds java_reds /* With YYDEBUG defined */
|
#define yytoks java_toks /* With YYDEBUG defined */
|
#define yytoks java_toks /* With YYDEBUG defined */
|
#define yylhs java_yylhs
|
#define yylhs java_yylhs
|
#define yylen java_yylen
|
#define yylen java_yylen
|
#define yydefred java_yydefred
|
#define yydefred java_yydefred
|
#define yydgoto java_yydgoto
|
#define yydgoto java_yydgoto
|
#define yysindex java_yysindex
|
#define yysindex java_yysindex
|
#define yyrindex java_yyrindex
|
#define yyrindex java_yyrindex
|
#define yygindex java_yygindex
|
#define yygindex java_yygindex
|
#define yytable java_yytable
|
#define yytable java_yytable
|
#define yycheck java_yycheck
|
#define yycheck java_yycheck
|
|
|
#ifndef YYDEBUG
|
#ifndef YYDEBUG
|
#define YYDEBUG 0 /* Default to no yydebug support */
|
#define YYDEBUG 0 /* Default to no yydebug support */
|
#endif
|
#endif
|
|
|
int
|
int
|
yyparse PARAMS ((void));
|
yyparse PARAMS ((void));
|
|
|
static int
|
static int
|
yylex PARAMS ((void));
|
yylex PARAMS ((void));
|
|
|
void
|
void
|
yyerror PARAMS ((char *));
|
yyerror PARAMS ((char *));
|
|
|
static struct type * java_type_from_name PARAMS ((struct stoken));
|
static struct type * java_type_from_name PARAMS ((struct stoken));
|
static void push_expression_name PARAMS ((struct stoken));
|
static void push_expression_name PARAMS ((struct stoken));
|
static void push_fieldnames PARAMS ((struct stoken));
|
static void push_fieldnames PARAMS ((struct stoken));
|
|
|
static struct expression *copy_exp PARAMS ((struct expression *, int));
|
static struct expression *copy_exp PARAMS ((struct expression *, int));
|
static void insert_exp PARAMS ((int, struct expression *));
|
static void insert_exp PARAMS ((int, struct expression *));
|
|
|
|
|
#line 124 "jv-exp.y"
|
#line 124 "jv-exp.y"
|
typedef union
|
typedef union
|
{
|
{
|
LONGEST lval;
|
LONGEST lval;
|
struct {
|
struct {
|
LONGEST val;
|
LONGEST val;
|
struct type *type;
|
struct type *type;
|
} typed_val_int;
|
} typed_val_int;
|
struct {
|
struct {
|
DOUBLEST dval;
|
DOUBLEST dval;
|
struct type *type;
|
struct type *type;
|
} typed_val_float;
|
} typed_val_float;
|
struct symbol *sym;
|
struct symbol *sym;
|
struct type *tval;
|
struct type *tval;
|
struct stoken sval;
|
struct stoken sval;
|
struct ttype tsym;
|
struct ttype tsym;
|
struct symtoken ssym;
|
struct symtoken ssym;
|
struct block *bval;
|
struct block *bval;
|
enum exp_opcode opcode;
|
enum exp_opcode opcode;
|
struct internalvar *ivar;
|
struct internalvar *ivar;
|
int *ivec;
|
int *ivec;
|
} YYSTYPE;
|
} YYSTYPE;
|
#line 146 "jv-exp.y"
|
#line 146 "jv-exp.y"
|
|
|
/* YYSTYPE gets defined by %union */
|
/* YYSTYPE gets defined by %union */
|
static int
|
static int
|
parse_number PARAMS ((char *, int, int, YYSTYPE *));
|
parse_number PARAMS ((char *, int, int, YYSTYPE *));
|
#include <stdio.h>
|
#include <stdio.h>
|
|
|
#ifndef __cplusplus
|
#ifndef __cplusplus
|
#ifndef __STDC__
|
#ifndef __STDC__
|
#define const
|
#define const
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
|
|
|
|
#define YYFINAL 208
|
#define YYFINAL 208
|
#define YYFLAG -32768
|
#define YYFLAG -32768
|
#define YYNTBASE 57
|
#define YYNTBASE 57
|
|
|
#define YYTRANSLATE(x) ((unsigned)(x) <= 287 ? yytranslate[x] : 112)
|
#define YYTRANSLATE(x) ((unsigned)(x) <= 287 ? yytranslate[x] : 112)
|
|
|
static const char yytranslate[] = { 0,
|
static const char yytranslate[] = { 0,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 55, 2, 2, 2, 44, 31, 2, 49,
|
2, 2, 55, 2, 2, 2, 44, 31, 2, 49,
|
50, 42, 40, 24, 41, 47, 43, 2, 2, 2,
|
50, 42, 40, 24, 41, 47, 43, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 56, 2, 34,
|
2, 2, 2, 2, 2, 2, 2, 56, 2, 34,
|
25, 35, 26, 2, 2, 2, 2, 2, 2, 2,
|
25, 35, 26, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
48, 2, 53, 30, 2, 2, 2, 2, 2, 2,
|
48, 2, 53, 30, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 51, 29, 52, 54, 2, 2, 2, 2,
|
2, 2, 51, 29, 52, 54, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
|
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
|
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
|
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
|
17, 18, 19, 20, 21, 22, 23, 27, 28, 32,
|
17, 18, 19, 20, 21, 22, 23, 27, 28, 32,
|
33, 36, 37, 38, 39, 45, 46
|
33, 36, 37, 38, 39, 45, 46
|
};
|
};
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
static const short yyprhs[] = { 0,
|
static const short yyprhs[] = { 0,
|
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
|
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
|
20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
|
20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
|
40, 42, 44, 46, 48, 51, 54, 56, 58, 60,
|
40, 42, 44, 46, 48, 51, 54, 56, 58, 60,
|
62, 64, 66, 70, 72, 76, 78, 80, 82, 84,
|
62, 64, 66, 70, 72, 76, 78, 80, 82, 84,
|
88, 90, 92, 94, 96, 100, 102, 104, 110, 112,
|
88, 90, 92, 94, 96, 100, 102, 104, 110, 112,
|
116, 117, 119, 124, 129, 131, 134, 138, 141, 145,
|
116, 117, 119, 124, 129, 131, 134, 138, 141, 145,
|
147, 148, 152, 156, 161, 168, 175, 180, 185, 190,
|
147, 148, 152, 156, 161, 168, 175, 180, 185, 190,
|
192, 194, 196, 198, 200, 203, 206, 208, 210, 213,
|
192, 194, 196, 198, 200, 203, 206, 208, 210, 213,
|
216, 219, 221, 224, 227, 229, 232, 235, 237, 243,
|
216, 219, 221, 224, 227, 229, 232, 235, 237, 243,
|
248, 254, 256, 260, 264, 268, 270, 274, 278, 280,
|
248, 254, 256, 260, 264, 268, 270, 274, 278, 280,
|
284, 288, 290, 294, 298, 302, 306, 308, 312, 316,
|
284, 288, 290, 294, 298, 302, 306, 308, 312, 316,
|
318, 322, 324, 328, 330, 334, 336, 340, 342, 346,
|
318, 322, 324, 328, 330, 334, 336, 340, 342, 346,
|
348, 354, 356, 358, 362, 366, 368, 370, 372, 374
|
348, 354, 356, 358, 362, 366, 368, 370, 372, 374
|
};
|
};
|
|
|
static const short yyrhs[] = { 73,
|
static const short yyrhs[] = { 73,
|
0, 58, 0, 59, 0, 62, 0, 68, 0, 6,
|
0, 58, 0, 59, 0, 62, 0, 68, 0, 6,
|
0, 3, 0, 9, 0, 4, 0, 7, 0, 60,
|
0, 3, 0, 9, 0, 4, 0, 7, 0, 60,
|
0, 63, 0, 16, 0, 64, 0, 65, 0, 13,
|
0, 63, 0, 16, 0, 64, 0, 65, 0, 13,
|
0, 12, 0, 14, 0, 11, 0, 15, 0, 18,
|
0, 12, 0, 14, 0, 11, 0, 15, 0, 18,
|
0, 17, 0, 69, 0, 66, 0, 62, 84, 0,
|
0, 17, 0, 69, 0, 66, 0, 62, 84, 0,
|
69, 84, 0, 5, 0, 72, 0, 71, 0, 72,
|
69, 84, 0, 5, 0, 72, 0, 71, 0, 72,
|
0, 5, 0, 9, 0, 69, 47, 71, 0, 111,
|
0, 5, 0, 9, 0, 69, 47, 71, 0, 111,
|
0, 73, 24, 111, 0, 75, 0, 81, 0, 61,
|
0, 73, 24, 111, 0, 75, 0, 81, 0, 61,
|
0, 21, 0, 49, 111, 50, 0, 78, 0, 86,
|
0, 21, 0, 49, 111, 50, 0, 78, 0, 86,
|
0, 87, 0, 88, 0, 76, 79, 77, 0, 51,
|
0, 87, 0, 88, 0, 76, 79, 77, 0, 51,
|
0, 52, 0, 23, 67, 49, 80, 50, 0, 111,
|
0, 52, 0, 23, 67, 49, 80, 50, 0, 111,
|
0, 79, 24, 111, 0, 0, 79, 0, 23, 62,
|
0, 79, 24, 111, 0, 0, 79, 0, 23, 62,
|
82, 85, 0, 23, 66, 82, 85, 0, 83, 0,
|
82, 85, 0, 23, 66, 82, 85, 0, 83, 0,
|
82, 83, 0, 48, 111, 53, 0, 48, 53, 0,
|
82, 83, 0, 48, 111, 53, 0, 48, 53, 0,
|
84, 48, 53, 0, 84, 0, 0, 74, 47, 71,
|
84, 48, 53, 0, 84, 0, 0, 74, 47, 71,
|
0, 19, 47, 71, 0, 69, 49, 80, 50, 0,
|
0, 19, 47, 71, 0, 69, 49, 80, 50, 0,
|
74, 47, 71, 49, 80, 50, 0, 22, 47, 71,
|
74, 47, 71, 49, 80, 50, 0, 22, 47, 71,
|
49, 80, 50, 0, 69, 48, 111, 53, 0, 19,
|
49, 80, 50, 0, 69, 48, 111, 53, 0, 19,
|
48, 111, 53, 0, 75, 48, 111, 53, 0, 74,
|
48, 111, 53, 0, 75, 48, 111, 53, 0, 74,
|
0, 69, 0, 19, 0, 90, 0, 91, 0, 89,
|
0, 69, 0, 19, 0, 90, 0, 91, 0, 89,
|
45, 0, 89, 46, 0, 93, 0, 94, 0, 40,
|
45, 0, 89, 46, 0, 93, 0, 94, 0, 40,
|
92, 0, 41, 92, 0, 42, 92, 0, 95, 0,
|
92, 0, 41, 92, 0, 42, 92, 0, 95, 0,
|
45, 92, 0, 46, 92, 0, 89, 0, 54, 92,
|
45, 92, 0, 46, 92, 0, 89, 0, 54, 92,
|
0, 55, 92, 0, 96, 0, 49, 62, 85, 50,
|
0, 55, 92, 0, 96, 0, 49, 62, 85, 50,
|
92, 0, 49, 111, 50, 95, 0, 49, 69, 84,
|
92, 0, 49, 111, 50, 95, 0, 49, 69, 84,
|
50, 95, 0, 92, 0, 97, 42, 92, 0, 97,
|
50, 95, 0, 92, 0, 97, 42, 92, 0, 97,
|
43, 92, 0, 97, 44, 92, 0, 97, 0, 98,
|
43, 92, 0, 97, 44, 92, 0, 97, 0, 98,
|
40, 97, 0, 98, 41, 97, 0, 98, 0, 99,
|
40, 97, 0, 98, 41, 97, 0, 98, 0, 99,
|
38, 98, 0, 99, 39, 98, 0, 99, 0, 100,
|
38, 98, 0, 99, 39, 98, 0, 99, 0, 100,
|
34, 99, 0, 100, 35, 99, 0, 100, 36, 99,
|
34, 99, 0, 100, 35, 99, 0, 100, 36, 99,
|
0, 100, 37, 99, 0, 100, 0, 101, 32, 100,
|
0, 100, 37, 99, 0, 100, 0, 101, 32, 100,
|
0, 101, 33, 100, 0, 101, 0, 102, 31, 101,
|
0, 101, 33, 100, 0, 101, 0, 102, 31, 101,
|
0, 102, 0, 103, 30, 102, 0, 103, 0, 104,
|
0, 102, 0, 103, 30, 102, 0, 103, 0, 104,
|
29, 103, 0, 104, 0, 105, 28, 104, 0, 105,
|
29, 103, 0, 104, 0, 105, 28, 104, 0, 105,
|
0, 106, 27, 105, 0, 106, 0, 106, 26, 111,
|
0, 106, 27, 105, 0, 106, 0, 106, 26, 111,
|
56, 107, 0, 107, 0, 109, 0, 110, 25, 107,
|
56, 107, 0, 107, 0, 109, 0, 110, 25, 107,
|
0, 110, 20, 107, 0, 70, 0, 19, 0, 86,
|
0, 110, 20, 107, 0, 70, 0, 19, 0, 86,
|
0, 88, 0, 108, 0
|
0, 88, 0, 108, 0
|
};
|
};
|
|
|
#endif
|
#endif
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
static const short yyrline[] = { 0,
|
static const short yyrline[] = { 0,
|
203, 204, 207, 215, 217, 220, 229, 235, 243, 248,
|
203, 204, 207, 215, 217, 220, 229, 235, 243, 248,
|
253, 263, 265, 269, 271, 274, 277, 279, 281, 283,
|
253, 263, 265, 269, 271, 274, 277, 279, 281, 283,
|
287, 290, 301, 306, 310, 313, 317, 319, 322, 324,
|
287, 290, 301, 306, 310, 313, 317, 319, 322, 324,
|
327, 329, 332, 356, 357, 361, 363, 366, 368, 371,
|
327, 329, 332, 356, 357, 361, 363, 366, 368, 371,
|
372, 373, 374, 375, 376, 383, 388, 393, 398, 401,
|
372, 373, 374, 375, 376, 383, 388, 393, 398, 401,
|
405, 408, 411, 414, 418, 420, 423, 427, 430, 434,
|
405, 408, 411, 414, 418, 420, 423, 427, 430, 434,
|
436, 440, 443, 448, 451, 453, 457, 475, 477, 481,
|
436, 440, 443, 448, 451, 453, 457, 475, 477, 481,
|
483, 485, 487, 488, 491, 496, 501, 503, 504, 505,
|
483, 485, 487, 488, 491, 496, 501, 503, 504, 505,
|
507, 509, 512, 517, 522, 524, 526, 528, 531, 536,
|
507, 509, 512, 517, 522, 524, 526, 528, 531, 536,
|
557, 564, 566, 568, 570, 574, 576, 578, 582, 584,
|
557, 564, 566, 568, 570, 574, 576, 578, 582, 584,
|
586, 591, 593, 595, 597, 599, 604, 606, 608, 612,
|
586, 591, 593, 595, 597, 599, 604, 606, 608, 612,
|
614, 618, 620, 623, 625, 629, 631, 635, 637, 641,
|
614, 618, 620, 623, 625, 629, 631, 635, 637, 641,
|
643, 647, 649, 652, 655, 661, 664, 666, 667, 671
|
643, 647, 649, 652, 655, 661, 664, 666, 667, 671
|
};
|
};
|
#endif
|
#endif
|
|
|
|
|
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
|
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
|
|
|
static const char * const yytname[] = { "$","error","$undefined.","INTEGER_LITERAL",
|
static const char * const yytname[] = { "$","error","$undefined.","INTEGER_LITERAL",
|
"FLOATING_POINT_LITERAL","IDENTIFIER","STRING_LITERAL","BOOLEAN_LITERAL","TYPENAME",
|
"FLOATING_POINT_LITERAL","IDENTIFIER","STRING_LITERAL","BOOLEAN_LITERAL","TYPENAME",
|
"NAME_OR_INT","ERROR","LONG","SHORT","BYTE","INT","CHAR","BOOLEAN","DOUBLE",
|
"NAME_OR_INT","ERROR","LONG","SHORT","BYTE","INT","CHAR","BOOLEAN","DOUBLE",
|
"FLOAT","VARIABLE","ASSIGN_MODIFY","THIS","SUPER","NEW","','","'='","'?'","OROR",
|
"FLOAT","VARIABLE","ASSIGN_MODIFY","THIS","SUPER","NEW","','","'='","'?'","OROR",
|
"ANDAND","'|'","'^'","'&'","EQUAL","NOTEQUAL","'<'","'>'","LEQ","GEQ","LSH",
|
"ANDAND","'|'","'^'","'&'","EQUAL","NOTEQUAL","'<'","'>'","LEQ","GEQ","LSH",
|
"RSH","'+'","'-'","'*'","'/'","'%'","INCREMENT","DECREMENT","'.'","'['","'('",
|
"RSH","'+'","'-'","'*'","'/'","'%'","INCREMENT","DECREMENT","'.'","'['","'('",
|
"')'","'{'","'}'","']'","'~'","'!'","':'","start","type_exp","PrimitiveOrArrayType",
|
"')'","'{'","'}'","']'","'~'","'!'","':'","start","type_exp","PrimitiveOrArrayType",
|
"StringLiteral","Literal","PrimitiveType","NumericType","IntegralType","FloatingPointType",
|
"StringLiteral","Literal","PrimitiveType","NumericType","IntegralType","FloatingPointType",
|
"ClassOrInterfaceType","ClassType","ArrayType","Name","ForcedName","SimpleName",
|
"ClassOrInterfaceType","ClassType","ArrayType","Name","ForcedName","SimpleName",
|
"QualifiedName","exp1","Primary","PrimaryNoNewArray","lcurly","rcurly","ClassInstanceCreationExpression",
|
"QualifiedName","exp1","Primary","PrimaryNoNewArray","lcurly","rcurly","ClassInstanceCreationExpression",
|
"ArgumentList","ArgumentList_opt","ArrayCreationExpression","DimExprs","DimExpr",
|
"ArgumentList","ArgumentList_opt","ArrayCreationExpression","DimExprs","DimExpr",
|
"Dims","Dims_opt","FieldAccess","MethodInvocation","ArrayAccess","PostfixExpression",
|
"Dims","Dims_opt","FieldAccess","MethodInvocation","ArrayAccess","PostfixExpression",
|
"PostIncrementExpression","PostDecrementExpression","UnaryExpression","PreIncrementExpression",
|
"PostIncrementExpression","PostDecrementExpression","UnaryExpression","PreIncrementExpression",
|
"PreDecrementExpression","UnaryExpressionNotPlusMinus","CastExpression","MultiplicativeExpression",
|
"PreDecrementExpression","UnaryExpressionNotPlusMinus","CastExpression","MultiplicativeExpression",
|
"AdditiveExpression","ShiftExpression","RelationalExpression","EqualityExpression",
|
"AdditiveExpression","ShiftExpression","RelationalExpression","EqualityExpression",
|
"AndExpression","ExclusiveOrExpression","InclusiveOrExpression","ConditionalAndExpression",
|
"AndExpression","ExclusiveOrExpression","InclusiveOrExpression","ConditionalAndExpression",
|
"ConditionalOrExpression","ConditionalExpression","AssignmentExpression","Assignment",
|
"ConditionalOrExpression","ConditionalExpression","AssignmentExpression","Assignment",
|
"LeftHandSide","Expression", NULL
|
"LeftHandSide","Expression", NULL
|
};
|
};
|
#endif
|
#endif
|
|
|
static const short yyr1[] = { 0,
|
static const short yyr1[] = { 0,
|
57, 57, 58, 59, 59, 60, 61, 61, 61, 61,
|
57, 57, 58, 59, 59, 60, 61, 61, 61, 61,
|
61, 62, 62, 63, 63, 64, 64, 64, 64, 64,
|
61, 62, 62, 63, 63, 64, 64, 64, 64, 64,
|
65, 65, 66, 67, 68, 68, 69, 69, 70, 70,
|
65, 65, 66, 67, 68, 68, 69, 69, 70, 70,
|
71, 71, 72, 73, 73, 74, 74, 75, 75, 75,
|
71, 71, 72, 73, 73, 74, 74, 75, 75, 75,
|
75, 75, 75, 75, 75, 76, 77, 78, 79, 79,
|
75, 75, 75, 75, 75, 76, 77, 78, 79, 79,
|
80, 80, 81, 81, 82, 82, 83, 84, 84, 85,
|
80, 80, 81, 81, 82, 82, 83, 84, 84, 85,
|
85, 86, 86, 87, 87, 87, 88, 88, 88, 89,
|
85, 86, 86, 87, 87, 87, 88, 88, 88, 89,
|
89, 89, 89, 89, 90, 91, 92, 92, 92, 92,
|
89, 89, 89, 89, 90, 91, 92, 92, 92, 92,
|
92, 92, 93, 94, 95, 95, 95, 95, 96, 96,
|
92, 92, 93, 94, 95, 95, 95, 95, 96, 96,
|
96, 97, 97, 97, 97, 98, 98, 98, 99, 99,
|
96, 97, 97, 97, 97, 98, 98, 98, 99, 99,
|
99, 100, 100, 100, 100, 100, 101, 101, 101, 102,
|
99, 100, 100, 100, 100, 100, 101, 101, 101, 102,
|
102, 103, 103, 104, 104, 105, 105, 106, 106, 107,
|
102, 103, 103, 104, 104, 105, 105, 106, 106, 107,
|
107, 108, 108, 109, 109, 110, 110, 110, 110, 111
|
107, 108, 108, 109, 109, 110, 110, 110, 110, 111
|
};
|
};
|
|
|
static const short yyr2[] = { 0,
|
static const short yyr2[] = { 0,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 1, 1, 1, 2, 2, 1, 1, 1, 1,
|
1, 1, 1, 1, 2, 2, 1, 1, 1, 1,
|
1, 1, 3, 1, 3, 1, 1, 1, 1, 3,
|
1, 1, 3, 1, 3, 1, 1, 1, 1, 3,
|
1, 1, 1, 1, 3, 1, 1, 5, 1, 3,
|
1, 1, 1, 1, 3, 1, 1, 5, 1, 3,
|
0, 1, 4, 4, 1, 2, 3, 2, 3, 1,
|
0, 1, 4, 4, 1, 2, 3, 2, 3, 1,
|
0, 3, 3, 4, 6, 6, 4, 4, 4, 1,
|
0, 3, 3, 4, 6, 6, 4, 4, 4, 1,
|
1, 1, 1, 1, 2, 2, 1, 1, 2, 2,
|
1, 1, 1, 1, 2, 2, 1, 1, 2, 2,
|
2, 1, 2, 2, 1, 2, 2, 1, 5, 4,
|
2, 1, 2, 2, 1, 2, 2, 1, 5, 4,
|
5, 1, 3, 3, 3, 1, 3, 3, 1, 3,
|
5, 1, 3, 3, 3, 1, 3, 3, 1, 3,
|
3, 1, 3, 3, 3, 3, 1, 3, 3, 1,
|
3, 1, 3, 3, 3, 3, 1, 3, 3, 1,
|
3, 1, 3, 1, 3, 1, 3, 1, 3, 1,
|
3, 1, 3, 1, 3, 1, 3, 1, 3, 1,
|
5, 1, 1, 3, 3, 1, 1, 1, 1, 1
|
5, 1, 1, 3, 3, 1, 1, 1, 1, 1
|
};
|
};
|
|
|
static const short yydefact[] = { 0,
|
static const short yydefact[] = { 0,
|
7, 9, 27, 6, 10, 8, 19, 17, 16, 18,
|
7, 9, 27, 6, 10, 8, 19, 17, 16, 18,
|
20, 13, 22, 21, 72, 39, 0, 0, 0, 0,
|
20, 13, 22, 21, 72, 39, 0, 0, 0, 0,
|
0, 0, 0, 0, 46, 0, 0, 2, 3, 11,
|
0, 0, 0, 0, 46, 0, 0, 2, 3, 11,
|
38, 4, 12, 14, 15, 5, 71, 126, 29, 28,
|
38, 4, 12, 14, 15, 5, 71, 126, 29, 28,
|
1, 70, 36, 0, 41, 37, 42, 43, 44, 85,
|
1, 70, 36, 0, 41, 37, 42, 43, 44, 85,
|
73, 74, 92, 77, 78, 82, 88, 96, 99, 102,
|
73, 74, 92, 77, 78, 82, 88, 96, 99, 102,
|
107, 110, 112, 114, 116, 118, 120, 122, 130, 123,
|
107, 110, 112, 114, 116, 118, 120, 122, 130, 123,
|
0, 34, 0, 0, 0, 27, 0, 24, 0, 23,
|
0, 34, 0, 0, 0, 27, 0, 24, 0, 23,
|
28, 8, 72, 71, 42, 44, 79, 80, 81, 83,
|
28, 8, 72, 71, 42, 44, 79, 80, 81, 83,
|
84, 61, 71, 0, 86, 87, 0, 25, 0, 0,
|
84, 61, 71, 0, 86, 87, 0, 25, 0, 0,
|
51, 26, 0, 0, 0, 0, 49, 75, 76, 0,
|
51, 26, 0, 0, 0, 0, 49, 75, 76, 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,
|
31, 32, 63, 0, 0, 0, 61, 55, 61, 51,
|
31, 32, 63, 0, 0, 0, 61, 55, 61, 51,
|
0, 60, 0, 0, 40, 58, 0, 33, 0, 52,
|
0, 60, 0, 0, 40, 58, 0, 33, 0, 52,
|
0, 35, 62, 0, 0, 47, 45, 93, 94, 95,
|
0, 35, 62, 0, 0, 47, 45, 93, 94, 95,
|
97, 98, 100, 101, 103, 104, 105, 106, 108, 109,
|
97, 98, 100, 101, 103, 104, 105, 106, 108, 109,
|
111, 113, 115, 117, 0, 119, 125, 124, 68, 51,
|
111, 113, 115, 117, 0, 119, 125, 124, 68, 51,
|
0, 0, 56, 53, 54, 0, 0, 0, 90, 59,
|
0, 0, 56, 53, 54, 0, 0, 0, 90, 59,
|
67, 64, 51, 69, 50, 0, 0, 57, 48, 89,
|
67, 64, 51, 69, 50, 0, 0, 57, 48, 89,
|
91, 0, 121, 66, 65, 0, 0, 0
|
91, 0, 121, 66, 65, 0, 0, 0
|
};
|
};
|
|
|
static const short yydefgoto[] = { 206,
|
static const short yydefgoto[] = { 206,
|
28, 29, 30, 31, 32, 33, 34, 35, 78, 79,
|
28, 29, 30, 31, 32, 33, 34, 35, 78, 79,
|
36, 84, 38, 39, 81, 41, 42, 43, 44, 157,
|
36, 84, 38, 39, 81, 41, 42, 43, 44, 157,
|
45, 150, 151, 46, 137, 138, 142, 143, 85, 48,
|
45, 150, 151, 46, 137, 138, 142, 143, 85, 48,
|
86, 50, 51, 52, 53, 54, 55, 56, 57, 58,
|
86, 50, 51, 52, 53, 54, 55, 56, 57, 58,
|
59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
|
59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
|
69, 70, 71, 107
|
69, 70, 71, 107
|
};
|
};
|
|
|
static const short yypact[] = { 206,
|
static const short yypact[] = { 206,
|
-32768,-32768, -5,-32768,-32768, -3,-32768,-32768,-32768,-32768,
|
-32768,-32768, -5,-32768,-32768, -3,-32768,-32768,-32768,-32768,
|
-32768,-32768,-32768,-32768, 1,-32768, -34, 225, 312, 312,
|
-32768,-32768,-32768,-32768, 1,-32768, -34, 225, 312, 312,
|
312, 312, 312, 206,-32768, 312, 312,-32768,-32768,-32768,
|
312, 312, 312, 206,-32768, 312, 312,-32768,-32768,-32768,
|
-32768, -23,-32768,-32768,-32768,-32768, 34,-32768,-32768, 7,
|
-32768, -23,-32768,-32768,-32768,-32768, 34,-32768,-32768, 7,
|
4, -28, -17, 365,-32768,-32768, 15,-32768, 21, 74,
|
4, -28, -17, 365,-32768,-32768, 15,-32768, 21, 74,
|
-32768,-32768,-32768,-32768,-32768,-32768,-32768, 45, 44, 86,
|
-32768,-32768,-32768,-32768,-32768,-32768,-32768, 45, 44, 86,
|
35, 96, 3, 23, 8, 51, 104,-32768,-32768,-32768,
|
35, 96, 3, 23, 8, 51, 104,-32768,-32768,-32768,
|
32,-32768, 46, 365, 46,-32768, 25, 25, 14, 55,
|
32,-32768, 46, 365, 46,-32768, 25, 25, 14, 55,
|
-32768,-32768, 87, 47,-32768,-32768,-32768,-32768,-32768,-32768,
|
-32768,-32768, 87, 47,-32768,-32768,-32768,-32768,-32768,-32768,
|
-32768, -23, 34, 40,-32768,-32768, 57, 50, 46, 259,
|
-32768, -23, 34, 40,-32768,-32768, 57, 50, 46, 259,
|
365, 50, 365, 46, 365, -13,-32768,-32768,-32768, 312,
|
365, 50, 365, 46, 365, -13,-32768,-32768,-32768, 312,
|
312, 312, 312, 312, 312, 312, 312, 312, 312, 312,
|
312, 312, 312, 312, 312, 312, 312, 312, 312, 312,
|
312, 312, 312, 312, 312, 312, 365, 312, 312, 312,
|
312, 312, 312, 312, 312, 312, 365, 312, 312, 312,
|
-32768,-32768,-32768, 61, 59, 365, 56,-32768, 56, 365,
|
-32768,-32768,-32768, 61, 59, 365, 56,-32768, 56, 365,
|
365, 50, 66, 43, 372,-32768, 69,-32768, 73, 108,
|
365, 50, 66, 43, 372,-32768, 69,-32768, 73, 108,
|
106,-32768, 111, 109, 365,-32768,-32768,-32768,-32768,-32768,
|
106,-32768, 111, 109, 365,-32768,-32768,-32768,-32768,-32768,
|
45, 45, 44, 44, 86, 86, 86, 86, 35, 35,
|
45, 45, 44, 44, 86, 86, 86, 86, 35, 35,
|
96, 3, 23, 8, 107, 51,-32768,-32768,-32768, 365,
|
96, 3, 23, 8, 107, 51,-32768,-32768,-32768, 365,
|
112, 259,-32768,-32768,-32768, 114, 312, 372,-32768,-32768,
|
112, 259,-32768,-32768,-32768, 114, 312, 372,-32768,-32768,
|
-32768,-32768, 365,-32768,-32768, 312, 116,-32768,-32768,-32768,
|
-32768,-32768, 365,-32768,-32768, 312, 116,-32768,-32768,-32768,
|
-32768, 118,-32768,-32768,-32768, 169, 170,-32768
|
-32768, 118,-32768,-32768,-32768, 169, 170,-32768
|
};
|
};
|
|
|
static const short yypgoto[] = {-32768,
|
static const short yypgoto[] = {-32768,
|
-32768,-32768,-32768,-32768, -8,-32768,-32768,-32768,-32768,-32768,
|
-32768,-32768,-32768,-32768, -8,-32768,-32768,-32768,-32768,-32768,
|
-32768, 5,-32768, -66, 0,-32768,-32768,-32768,-32768,-32768,
|
-32768, 5,-32768, -66, 0,-32768,-32768,-32768,-32768,-32768,
|
-32768, 127, -126,-32768, 94, -94, -29, -40, 6,-32768,
|
-32768, 127, -126,-32768, 94, -94, -29, -40, 6,-32768,
|
12,-32768,-32768,-32768, 39,-32768,-32768, -141,-32768, 24,
|
12,-32768,-32768,-32768, 39,-32768,-32768, -141,-32768, 24,
|
28, -42, 36, 52, 53, 49, 58, 48,-32768, -128,
|
28, -42, 36, 52, 53, 49, 58, 48,-32768, -128,
|
-32768,-32768,-32768, 18
|
-32768,-32768,-32768, 18
|
};
|
};
|
|
|
|
|
#define YYLAST 427
|
#define YYLAST 427
|
|
|
|
|
static const short yytable[] = { 40,
|
static const short yytable[] = { 40,
|
177, 178, 98, 189, 37, 47, 133, 102, 135, 77,
|
177, 178, 98, 189, 37, 47, 133, 102, 135, 77,
|
155, 49, 75, 186, -31, 92, -32, 72, 104, -31,
|
155, 49, 75, 186, -31, 92, -32, 72, 104, -31,
|
-127, -32, 80, 40, 97, -127, -30, 103, 93, 47,
|
-127, -32, 80, 40, 97, -127, -30, 103, 93, 47,
|
105, -30, 148, 123, -128, 49, 125, 153, 156, -128,
|
105, -30, 148, 123, -128, 49, 125, 153, 156, -128,
|
-129, 94, 183, 40, 183, -129, 201, 73, 74, 47,
|
-129, 94, 183, 40, 183, -129, 201, 73, 74, 47,
|
131, 129, 124, 197, 132, 49, 130, 87, 88, 89,
|
131, 129, 124, 197, 132, 49, 130, 87, 88, 89,
|
90, 91, 140, 144, 95, 96, 202, 203, 117, 118,
|
90, 91, 140, 144, 95, 96, 202, 203, 117, 118,
|
119, 120, 136, 40, 165, 166, 167, 168, 126, 47,
|
119, 120, 136, 40, 165, 166, 167, 168, 126, 47,
|
99, 100, 101, 113, 114, 49, 110, 111, 112, 145,
|
99, 100, 101, 113, 114, 49, 110, 111, 112, 145,
|
147, 134, 188, 99, 141, 101, 184, 147, 185, 40,
|
147, 134, 188, 99, 141, 101, 184, 147, 185, 40,
|
40, 99, 40, 182, 40, 47, 47, 180, 47, 146,
|
40, 99, 40, 182, 40, 47, 47, 180, 47, 146,
|
47, 49, 49, 179, 49, 187, 49, 149, 108, 109,
|
47, 49, 49, 179, 49, 187, 49, 149, 108, 109,
|
152, 190, 154, 115, 116, 191, 40, 121, 122, 127,
|
152, 190, 154, 115, 116, 191, 40, 121, 122, 127,
|
128, 155, 47, 73, 74, 40, 161, 162, 49, 40,
|
128, 155, 47, 73, 74, 40, 161, 162, 49, 40,
|
40, 47, 163, 164, 175, 47, 47, 49, 158, 159,
|
40, 47, 163, 164, 175, 47, 47, 49, 158, 159,
|
160, 49, 49, 181, 40, 192, 169, 170, 149, 193,
|
160, 49, 49, 181, 40, 192, 169, 170, 149, 193,
|
47, 194, 196, 199, 198, 204, 49, 205, 207, 208,
|
47, 194, 196, 199, 198, 204, 49, 205, 207, 208,
|
106, 139, 195, 173, 171, 176, 172, 0, 0, 40,
|
106, 139, 195, 173, 171, 176, 172, 0, 0, 40,
|
0, 40, 0, 174, 0, 47, 0, 47, 0, 0,
|
0, 40, 0, 174, 0, 47, 0, 47, 0, 0,
|
0, 49, 40, 49, 0, 0, 0, 0, 47, 181,
|
0, 49, 40, 49, 0, 0, 0, 0, 47, 181,
|
0, 0, 0, 0, 49, 0, 0, 0, 1, 2,
|
0, 0, 0, 0, 49, 0, 0, 0, 1, 2,
|
3, 4, 5, 0, 6, 0, 7, 8, 9, 10,
|
3, 4, 5, 0, 6, 0, 7, 8, 9, 10,
|
11, 12, 13, 14, 15, 200, 16, 17, 18, 76,
|
11, 12, 13, 14, 15, 200, 16, 17, 18, 76,
|
0, 0, 0, 0, 0, 7, 8, 9, 10, 11,
|
0, 0, 0, 0, 0, 7, 8, 9, 10, 11,
|
12, 13, 14, 0, 0, 19, 20, 21, 0, 0,
|
12, 13, 14, 0, 0, 19, 20, 21, 0, 0,
|
22, 23, 0, 0, 24, 0, 25, 0, 0, 26,
|
22, 23, 0, 0, 24, 0, 25, 0, 0, 26,
|
27, 1, 2, 3, 4, 5, 0, 6, 0, 0,
|
27, 1, 2, 3, 4, 5, 0, 6, 0, 0,
|
0, 0, 0, 0, 0, 0, 0, 15, 0, 16,
|
0, 0, 0, 0, 0, 0, 0, 15, 0, 16,
|
17, 18, 0, 0, 0, 0, 0, 0, 0, 0,
|
17, 18, 0, 0, 0, 0, 0, 0, 0, 0,
|
0, 0, 0, 0, 0, 0, 0, 0, 19, 20,
|
0, 0, 0, 0, 0, 0, 0, 0, 19, 20,
|
21, 0, 0, 22, 23, 0, 0, 24, 0, 25,
|
21, 0, 0, 22, 23, 0, 0, 24, 0, 25,
|
0, 146, 26, 27, 1, 2, 76, 4, 5, 0,
|
0, 146, 26, 27, 1, 2, 76, 4, 5, 0,
|
82, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
82, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
83, 0, 16, 17, 18, 0, 0, 0, 0, 0,
|
83, 0, 16, 17, 18, 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, 19, 20, 21, 0, 0, 22, 23, 0, 0,
|
0, 19, 20, 21, 0, 0, 22, 23, 0, 0,
|
24, 0, 25, 0, 0, 26, 27, 1, 2, 3,
|
24, 0, 25, 0, 0, 26, 27, 1, 2, 3,
|
4, 5, 0, 6, 1, 2, 76, 4, 5, 0,
|
4, 5, 0, 6, 1, 2, 76, 4, 5, 0,
|
82, 0, 0, 15, 0, 16, 17, 18, 0, 0,
|
82, 0, 0, 15, 0, 16, 17, 18, 0, 0,
|
83, 0, 16, 17, 18, 0, 0, 0, 0, 0,
|
83, 0, 16, 17, 18, 0, 0, 0, 0, 0,
|
0, 0, 0, 0, 19, 20, 21, 0, 0, 22,
|
0, 0, 0, 0, 19, 20, 21, 0, 0, 22,
|
23, 0, 0, 24, 0, 25, 0, 0, 26, 27,
|
23, 0, 0, 24, 0, 25, 0, 0, 26, 27,
|
24, 0, 25, 0, 0, 26, 27
|
24, 0, 25, 0, 0, 26, 27
|
};
|
};
|
|
|
static const short yycheck[] = { 0,
|
static const short yycheck[] = { 0,
|
129, 130, 32, 145, 0, 0, 73, 37, 75, 18,
|
129, 130, 32, 145, 0, 0, 73, 37, 75, 18,
|
24, 0, 47, 140, 20, 24, 20, 0, 47, 25,
|
24, 0, 47, 140, 20, 24, 20, 0, 47, 25,
|
20, 25, 18, 24, 48, 25, 20, 24, 24, 24,
|
20, 25, 18, 24, 48, 25, 20, 24, 24, 24,
|
48, 25, 99, 31, 20, 24, 29, 104, 52, 25,
|
48, 25, 99, 31, 20, 24, 29, 104, 52, 25,
|
20, 24, 137, 44, 139, 25, 188, 47, 48, 44,
|
20, 24, 137, 44, 139, 25, 188, 47, 48, 44,
|
5, 20, 30, 180, 9, 44, 25, 19, 20, 21,
|
5, 20, 30, 180, 9, 44, 25, 19, 20, 21,
|
22, 23, 49, 93, 26, 27, 193, 196, 34, 35,
|
22, 23, 49, 93, 26, 27, 193, 196, 34, 35,
|
36, 37, 48, 74, 117, 118, 119, 120, 28, 74,
|
36, 37, 48, 74, 117, 118, 119, 120, 28, 74,
|
47, 48, 49, 40, 41, 74, 42, 43, 44, 50,
|
47, 48, 49, 40, 41, 74, 42, 43, 44, 50,
|
48, 74, 50, 47, 48, 49, 137, 48, 139, 100,
|
48, 74, 50, 47, 48, 49, 137, 48, 139, 100,
|
101, 47, 103, 48, 105, 100, 101, 49, 103, 53,
|
101, 47, 103, 48, 105, 100, 101, 49, 103, 53,
|
105, 100, 101, 53, 103, 50, 105, 100, 45, 46,
|
105, 100, 101, 53, 103, 50, 105, 100, 45, 46,
|
103, 53, 105, 38, 39, 53, 127, 32, 33, 26,
|
103, 53, 105, 38, 39, 53, 127, 32, 33, 26,
|
27, 24, 127, 47, 48, 136, 113, 114, 127, 140,
|
27, 24, 127, 47, 48, 136, 113, 114, 127, 140,
|
141, 136, 115, 116, 127, 140, 141, 136, 110, 111,
|
141, 136, 115, 116, 127, 140, 141, 136, 110, 111,
|
112, 140, 141, 136, 155, 50, 121, 122, 141, 49,
|
112, 140, 141, 136, 155, 50, 121, 122, 141, 49,
|
155, 53, 56, 50, 53, 50, 155, 50, 0, 0,
|
155, 53, 56, 50, 53, 50, 155, 50, 0, 0,
|
44, 78, 155, 125, 123, 128, 124, -1, -1, 180,
|
44, 78, 155, 125, 123, 128, 124, -1, -1, 180,
|
-1, 182, -1, 126, -1, 180, -1, 182, -1, -1,
|
-1, 182, -1, 126, -1, 180, -1, 182, -1, -1,
|
-1, 180, 193, 182, -1, -1, -1, -1, 193, 182,
|
-1, 180, 193, 182, -1, -1, -1, -1, 193, 182,
|
-1, -1, -1, -1, 193, -1, -1, -1, 3, 4,
|
-1, -1, -1, -1, 193, -1, -1, -1, 3, 4,
|
5, 6, 7, -1, 9, -1, 11, 12, 13, 14,
|
5, 6, 7, -1, 9, -1, 11, 12, 13, 14,
|
15, 16, 17, 18, 19, 187, 21, 22, 23, 5,
|
15, 16, 17, 18, 19, 187, 21, 22, 23, 5,
|
-1, -1, -1, -1, -1, 11, 12, 13, 14, 15,
|
-1, -1, -1, -1, -1, 11, 12, 13, 14, 15,
|
16, 17, 18, -1, -1, 40, 41, 42, -1, -1,
|
16, 17, 18, -1, -1, 40, 41, 42, -1, -1,
|
45, 46, -1, -1, 49, -1, 51, -1, -1, 54,
|
45, 46, -1, -1, 49, -1, 51, -1, -1, 54,
|
55, 3, 4, 5, 6, 7, -1, 9, -1, -1,
|
55, 3, 4, 5, 6, 7, -1, 9, -1, -1,
|
-1, -1, -1, -1, -1, -1, -1, 19, -1, 21,
|
-1, -1, -1, -1, -1, -1, -1, 19, -1, 21,
|
22, 23, -1, -1, -1, -1, -1, -1, -1, -1,
|
22, 23, -1, -1, -1, -1, -1, -1, -1, -1,
|
-1, -1, -1, -1, -1, -1, -1, -1, 40, 41,
|
-1, -1, -1, -1, -1, -1, -1, -1, 40, 41,
|
42, -1, -1, 45, 46, -1, -1, 49, -1, 51,
|
42, -1, -1, 45, 46, -1, -1, 49, -1, 51,
|
-1, 53, 54, 55, 3, 4, 5, 6, 7, -1,
|
-1, 53, 54, 55, 3, 4, 5, 6, 7, -1,
|
9, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
9, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
19, -1, 21, 22, 23, -1, -1, -1, -1, -1,
|
19, -1, 21, 22, 23, -1, -1, -1, -1, -1,
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
-1, 40, 41, 42, -1, -1, 45, 46, -1, -1,
|
-1, 40, 41, 42, -1, -1, 45, 46, -1, -1,
|
49, -1, 51, -1, -1, 54, 55, 3, 4, 5,
|
49, -1, 51, -1, -1, 54, 55, 3, 4, 5,
|
6, 7, -1, 9, 3, 4, 5, 6, 7, -1,
|
6, 7, -1, 9, 3, 4, 5, 6, 7, -1,
|
9, -1, -1, 19, -1, 21, 22, 23, -1, -1,
|
9, -1, -1, 19, -1, 21, 22, 23, -1, -1,
|
19, -1, 21, 22, 23, -1, -1, -1, -1, -1,
|
19, -1, 21, 22, 23, -1, -1, -1, -1, -1,
|
-1, -1, -1, -1, 40, 41, 42, -1, -1, 45,
|
-1, -1, -1, -1, 40, 41, 42, -1, -1, 45,
|
46, -1, -1, 49, -1, 51, -1, -1, 54, 55,
|
46, -1, -1, 49, -1, 51, -1, -1, 54, 55,
|
49, -1, 51, -1, -1, 54, 55
|
49, -1, 51, -1, -1, 54, 55
|
};
|
};
|
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
|
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
|
#line 3 "/usr/lib/bison.simple"
|
#line 3 "/usr/lib/bison.simple"
|
/* This file comes from bison-1.27. */
|
/* This file comes from bison-1.27. */
|
|
|
/* Skeleton output parser for bison,
|
/* Skeleton output parser for bison,
|
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
|
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2, or (at your option)
|
the Free Software Foundation; either version 2, or (at your option)
|
any later version.
|
any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 59 Temple Place - Suite 330,
|
Foundation, Inc., 59 Temple Place - Suite 330,
|
Boston, MA 02111-1307, USA. */
|
Boston, MA 02111-1307, USA. */
|
|
|
/* As a special exception, when this file is copied by Bison into a
|
/* As a special exception, when this file is copied by Bison into a
|
Bison output file, you may use that output file without restriction.
|
Bison output file, you may use that output file without restriction.
|
This special exception was added by the Free Software Foundation
|
This special exception was added by the Free Software Foundation
|
in version 1.24 of Bison. */
|
in version 1.24 of Bison. */
|
|
|
/* This is the parser code that is written into each bison parser
|
/* This is the parser code that is written into each bison parser
|
when the %semantic_parser declaration is not specified in the grammar.
|
when the %semantic_parser declaration is not specified in the grammar.
|
It was written by Richard Stallman by simplifying the hairy parser
|
It was written by Richard Stallman by simplifying the hairy parser
|
used when %semantic_parser is specified. */
|
used when %semantic_parser is specified. */
|
|
|
#ifndef YYSTACK_USE_ALLOCA
|
#ifndef YYSTACK_USE_ALLOCA
|
#ifdef alloca
|
#ifdef alloca
|
#define YYSTACK_USE_ALLOCA
|
#define YYSTACK_USE_ALLOCA
|
#else /* alloca not defined */
|
#else /* alloca not defined */
|
#ifdef __GNUC__
|
#ifdef __GNUC__
|
#define YYSTACK_USE_ALLOCA
|
#define YYSTACK_USE_ALLOCA
|
#define alloca __builtin_alloca
|
#define alloca __builtin_alloca
|
#else /* not GNU C. */
|
#else /* not GNU C. */
|
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
|
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
|
#define YYSTACK_USE_ALLOCA
|
#define YYSTACK_USE_ALLOCA
|
#include <alloca.h>
|
#include <alloca.h>
|
#else /* not sparc */
|
#else /* not sparc */
|
/* We think this test detects Watcom and Microsoft C. */
|
/* We think this test detects Watcom and Microsoft C. */
|
/* This used to test MSDOS, but that is a bad idea
|
/* This used to test MSDOS, but that is a bad idea
|
since that symbol is in the user namespace. */
|
since that symbol is in the user namespace. */
|
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
|
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
|
#if 0 /* No need for xmalloc.h, which pollutes the namespace;
|
#if 0 /* No need for xmalloc.h, which pollutes the namespace;
|
instead, just don't use alloca. */
|
instead, just don't use alloca. */
|
#endif
|
#endif
|
#else /* not MSDOS, or __TURBOC__ */
|
#else /* not MSDOS, or __TURBOC__ */
|
#if defined(_AIX)
|
#if defined(_AIX)
|
/* I don't know what this was needed for, but it pollutes the namespace.
|
/* I don't know what this was needed for, but it pollutes the namespace.
|
So I turned it off. rms, 2 May 1997. */
|
So I turned it off. rms, 2 May 1997. */
|
#pragma alloca
|
#pragma alloca
|
#define YYSTACK_USE_ALLOCA
|
#define YYSTACK_USE_ALLOCA
|
#else /* not MSDOS, or __TURBOC__, or _AIX */
|
#else /* not MSDOS, or __TURBOC__, or _AIX */
|
#if 0
|
#if 0
|
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
|
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
|
and on HPUX 10. Eventually we can turn this on. */
|
and on HPUX 10. Eventually we can turn this on. */
|
#define YYSTACK_USE_ALLOCA
|
#define YYSTACK_USE_ALLOCA
|
#define alloca __builtin_alloca
|
#define alloca __builtin_alloca
|
#endif /* __hpux */
|
#endif /* __hpux */
|
#endif
|
#endif
|
#endif /* not _AIX */
|
#endif /* not _AIX */
|
#endif /* not MSDOS, or __TURBOC__ */
|
#endif /* not MSDOS, or __TURBOC__ */
|
#endif /* not sparc */
|
#endif /* not sparc */
|
#endif /* not GNU C */
|
#endif /* not GNU C */
|
#endif /* alloca not defined */
|
#endif /* alloca not defined */
|
#endif /* YYSTACK_USE_ALLOCA not defined */
|
#endif /* YYSTACK_USE_ALLOCA not defined */
|
|
|
#ifdef YYSTACK_USE_ALLOCA
|
#ifdef YYSTACK_USE_ALLOCA
|
#define YYSTACK_ALLOC alloca
|
#define YYSTACK_ALLOC alloca
|
#else
|
#else
|
#define YYSTACK_ALLOC xmalloc
|
#define YYSTACK_ALLOC xmalloc
|
#endif
|
#endif
|
|
|
/* Note: there must be only one dollar sign in this file.
|
/* Note: there must be only one dollar sign in this file.
|
It is replaced by the list of actions, each action
|
It is replaced by the list of actions, each action
|
as one case of the switch. */
|
as one case of the switch. */
|
|
|
#define yyerrok (yyerrstatus = 0)
|
#define yyerrok (yyerrstatus = 0)
|
#define yyclearin (yychar = YYEMPTY)
|
#define yyclearin (yychar = YYEMPTY)
|
#define YYEMPTY -2
|
#define YYEMPTY -2
|
#define YYEOF 0
|
#define YYEOF 0
|
#define YYACCEPT goto yyacceptlab
|
#define YYACCEPT goto yyacceptlab
|
#define YYABORT goto yyabortlab
|
#define YYABORT goto yyabortlab
|
#define YYERROR goto yyerrlab1
|
#define YYERROR goto yyerrlab1
|
/* Like YYERROR except do call yyerror.
|
/* Like YYERROR except do call yyerror.
|
This remains here temporarily to ease the
|
This remains here temporarily to ease the
|
transition to the new meaning of YYERROR, for GCC.
|
transition to the new meaning of YYERROR, for GCC.
|
Once GCC version 2 has supplanted version 1, this can go. */
|
Once GCC version 2 has supplanted version 1, this can go. */
|
#define YYFAIL goto yyerrlab
|
#define YYFAIL goto yyerrlab
|
#define YYRECOVERING() (!!yyerrstatus)
|
#define YYRECOVERING() (!!yyerrstatus)
|
#define YYBACKUP(token, value) \
|
#define YYBACKUP(token, value) \
|
do \
|
do \
|
if (yychar == YYEMPTY && yylen == 1) \
|
if (yychar == YYEMPTY && yylen == 1) \
|
{ yychar = (token), yylval = (value); \
|
{ yychar = (token), yylval = (value); \
|
yychar1 = YYTRANSLATE (yychar); \
|
yychar1 = YYTRANSLATE (yychar); \
|
YYPOPSTACK; \
|
YYPOPSTACK; \
|
goto yybackup; \
|
goto yybackup; \
|
} \
|
} \
|
else \
|
else \
|
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
|
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
|
while (0)
|
while (0)
|
|
|
#define YYTERROR 1
|
#define YYTERROR 1
|
#define YYERRCODE 256
|
#define YYERRCODE 256
|
|
|
#ifndef YYPURE
|
#ifndef YYPURE
|
#define YYLEX yylex()
|
#define YYLEX yylex()
|
#endif
|
#endif
|
|
|
#ifdef YYPURE
|
#ifdef YYPURE
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLEX_PARAM
|
#ifdef YYLEX_PARAM
|
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
|
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
|
#else
|
#else
|
#define YYLEX yylex(&yylval, &yylloc)
|
#define YYLEX yylex(&yylval, &yylloc)
|
#endif
|
#endif
|
#else /* not YYLSP_NEEDED */
|
#else /* not YYLSP_NEEDED */
|
#ifdef YYLEX_PARAM
|
#ifdef YYLEX_PARAM
|
#define YYLEX yylex(&yylval, YYLEX_PARAM)
|
#define YYLEX yylex(&yylval, YYLEX_PARAM)
|
#else
|
#else
|
#define YYLEX yylex(&yylval)
|
#define YYLEX yylex(&yylval)
|
#endif
|
#endif
|
#endif /* not YYLSP_NEEDED */
|
#endif /* not YYLSP_NEEDED */
|
#endif
|
#endif
|
|
|
/* If nonreentrant, generate the variables here */
|
/* If nonreentrant, generate the variables here */
|
|
|
#ifndef YYPURE
|
#ifndef YYPURE
|
|
|
int yychar; /* the lookahead symbol */
|
int yychar; /* the lookahead symbol */
|
YYSTYPE yylval; /* the semantic value of the */
|
YYSTYPE yylval; /* the semantic value of the */
|
/* lookahead symbol */
|
/* lookahead symbol */
|
|
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
YYLTYPE yylloc; /* location data for the lookahead */
|
YYLTYPE yylloc; /* location data for the lookahead */
|
/* symbol */
|
/* symbol */
|
#endif
|
#endif
|
|
|
int yynerrs; /* number of parse errors so far */
|
int yynerrs; /* number of parse errors so far */
|
#endif /* not YYPURE */
|
#endif /* not YYPURE */
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
int yydebug; /* nonzero means print parse trace */
|
int yydebug; /* nonzero means print parse trace */
|
/* Since this is uninitialized, it does not stop multiple parsers
|
/* Since this is uninitialized, it does not stop multiple parsers
|
from coexisting. */
|
from coexisting. */
|
#endif
|
#endif
|
|
|
/* YYINITDEPTH indicates the initial size of the parser's stacks */
|
/* YYINITDEPTH indicates the initial size of the parser's stacks */
|
|
|
#ifndef YYINITDEPTH
|
#ifndef YYINITDEPTH
|
#define YYINITDEPTH 200
|
#define YYINITDEPTH 200
|
#endif
|
#endif
|
|
|
/* YYMAXDEPTH is the maximum size the stacks can grow to
|
/* YYMAXDEPTH is the maximum size the stacks can grow to
|
(effective only if the built-in stack extension method is used). */
|
(effective only if the built-in stack extension method is used). */
|
|
|
#if YYMAXDEPTH == 0
|
#if YYMAXDEPTH == 0
|
#undef YYMAXDEPTH
|
#undef YYMAXDEPTH
|
#endif
|
#endif
|
|
|
#ifndef YYMAXDEPTH
|
#ifndef YYMAXDEPTH
|
#define YYMAXDEPTH 10000
|
#define YYMAXDEPTH 10000
|
#endif
|
#endif
|
|
|
/* Define __yy_memcpy. Note that the size argument
|
/* Define __yy_memcpy. Note that the size argument
|
should be passed with type unsigned int, because that is what the non-GCC
|
should be passed with type unsigned int, because that is what the non-GCC
|
definitions require. With GCC, __builtin_memcpy takes an arg
|
definitions require. With GCC, __builtin_memcpy takes an arg
|
of type size_t, but it can handle unsigned int. */
|
of type size_t, but it can handle unsigned int. */
|
|
|
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
|
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
|
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
|
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
|
#else /* not GNU C or C++ */
|
#else /* not GNU C or C++ */
|
#ifndef __cplusplus
|
#ifndef __cplusplus
|
|
|
/* This is the most reliable way to avoid incompatibilities
|
/* This is the most reliable way to avoid incompatibilities
|
in available built-in functions on various systems. */
|
in available built-in functions on various systems. */
|
static void
|
static void
|
__yy_memcpy (to, from, count)
|
__yy_memcpy (to, from, count)
|
char *to;
|
char *to;
|
char *from;
|
char *from;
|
unsigned int count;
|
unsigned int count;
|
{
|
{
|
register char *f = from;
|
register char *f = from;
|
register char *t = to;
|
register char *t = to;
|
register int i = count;
|
register int i = count;
|
|
|
while (i-- > 0)
|
while (i-- > 0)
|
*t++ = *f++;
|
*t++ = *f++;
|
}
|
}
|
|
|
#else /* __cplusplus */
|
#else /* __cplusplus */
|
|
|
/* This is the most reliable way to avoid incompatibilities
|
/* This is the most reliable way to avoid incompatibilities
|
in available built-in functions on various systems. */
|
in available built-in functions on various systems. */
|
static void
|
static void
|
__yy_memcpy (char *to, char *from, unsigned int count)
|
__yy_memcpy (char *to, char *from, unsigned int count)
|
{
|
{
|
register char *t = to;
|
register char *t = to;
|
register char *f = from;
|
register char *f = from;
|
register int i = count;
|
register int i = count;
|
|
|
while (i-- > 0)
|
while (i-- > 0)
|
*t++ = *f++;
|
*t++ = *f++;
|
}
|
}
|
|
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#line 216 "/usr/lib/bison.simple"
|
#line 216 "/usr/lib/bison.simple"
|
|
|
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
|
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
|
into yyparse. The argument should have type void *.
|
into yyparse. The argument should have type void *.
|
It should actually point to an object.
|
It should actually point to an object.
|
Grammar actions can access the variable by casting it
|
Grammar actions can access the variable by casting it
|
to the proper pointer type. */
|
to the proper pointer type. */
|
|
|
#ifdef YYPARSE_PARAM
|
#ifdef YYPARSE_PARAM
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
|
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
|
#define YYPARSE_PARAM_DECL
|
#define YYPARSE_PARAM_DECL
|
#else /* not __cplusplus */
|
#else /* not __cplusplus */
|
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
|
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
|
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
|
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
|
#endif /* not __cplusplus */
|
#endif /* not __cplusplus */
|
#else /* not YYPARSE_PARAM */
|
#else /* not YYPARSE_PARAM */
|
#define YYPARSE_PARAM_ARG
|
#define YYPARSE_PARAM_ARG
|
#define YYPARSE_PARAM_DECL
|
#define YYPARSE_PARAM_DECL
|
#endif /* not YYPARSE_PARAM */
|
#endif /* not YYPARSE_PARAM */
|
|
|
/* Prevent warning if -Wstrict-prototypes. */
|
/* Prevent warning if -Wstrict-prototypes. */
|
#ifdef __GNUC__
|
#ifdef __GNUC__
|
#ifdef YYPARSE_PARAM
|
#ifdef YYPARSE_PARAM
|
int yyparse (void *);
|
int yyparse (void *);
|
#else
|
#else
|
int yyparse (void);
|
int yyparse (void);
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
int
|
int
|
yyparse(YYPARSE_PARAM_ARG)
|
yyparse(YYPARSE_PARAM_ARG)
|
YYPARSE_PARAM_DECL
|
YYPARSE_PARAM_DECL
|
{
|
{
|
register int yystate;
|
register int yystate;
|
register int yyn;
|
register int yyn;
|
register short *yyssp;
|
register short *yyssp;
|
register YYSTYPE *yyvsp;
|
register YYSTYPE *yyvsp;
|
int yyerrstatus; /* number of tokens to shift before error messages enabled */
|
int yyerrstatus; /* number of tokens to shift before error messages enabled */
|
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
|
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
|
|
|
short yyssa[YYINITDEPTH]; /* the state stack */
|
short yyssa[YYINITDEPTH]; /* the state stack */
|
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
|
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
|
|
|
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
|
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
|
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to xreallocate them elsewhere */
|
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to xreallocate them elsewhere */
|
|
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
|
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
|
YYLTYPE *yyls = yylsa;
|
YYLTYPE *yyls = yylsa;
|
YYLTYPE *yylsp;
|
YYLTYPE *yylsp;
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
|
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
|
#else
|
#else
|
#define YYPOPSTACK (yyvsp--, yyssp--)
|
#define YYPOPSTACK (yyvsp--, yyssp--)
|
#endif
|
#endif
|
|
|
int yystacksize = YYINITDEPTH;
|
int yystacksize = YYINITDEPTH;
|
int yyfree_stacks = 0;
|
int yyfree_stacks = 0;
|
|
|
#ifdef YYPURE
|
#ifdef YYPURE
|
int yychar;
|
int yychar;
|
YYSTYPE yylval;
|
YYSTYPE yylval;
|
int yynerrs;
|
int yynerrs;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
YYLTYPE yylloc;
|
YYLTYPE yylloc;
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
YYSTYPE yyval; /* the variable used to return */
|
YYSTYPE yyval; /* the variable used to return */
|
/* semantic values from the action */
|
/* semantic values from the action */
|
/* routines */
|
/* routines */
|
|
|
int yylen;
|
int yylen;
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Starting parse\n");
|
fprintf(stderr, "Starting parse\n");
|
#endif
|
#endif
|
|
|
yystate = 0;
|
yystate = 0;
|
yyerrstatus = 0;
|
yyerrstatus = 0;
|
yynerrs = 0;
|
yynerrs = 0;
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
/* Initialize stack pointers.
|
/* Initialize stack pointers.
|
Waste one element of value and location stack
|
Waste one element of value and location stack
|
so that they stay on the same level as the state stack.
|
so that they stay on the same level as the state stack.
|
The wasted elements are never initialized. */
|
The wasted elements are never initialized. */
|
|
|
yyssp = yyss - 1;
|
yyssp = yyss - 1;
|
yyvsp = yyvs;
|
yyvsp = yyvs;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yylsp = yyls;
|
yylsp = yyls;
|
#endif
|
#endif
|
|
|
/* Push a new state, which is found in yystate . */
|
/* Push a new state, which is found in yystate . */
|
/* In all cases, when you get here, the value and location stacks
|
/* In all cases, when you get here, the value and location stacks
|
have just been pushed. so pushing a state here evens the stacks. */
|
have just been pushed. so pushing a state here evens the stacks. */
|
yynewstate:
|
yynewstate:
|
|
|
*++yyssp = yystate;
|
*++yyssp = yystate;
|
|
|
if (yyssp >= yyss + yystacksize - 1)
|
if (yyssp >= yyss + yystacksize - 1)
|
{
|
{
|
/* Give user a chance to xreallocate the stack */
|
/* Give user a chance to xreallocate the stack */
|
/* Use copies of these so that the &'s don't force the real ones into memory. */
|
/* Use copies of these so that the &'s don't force the real ones into memory. */
|
YYSTYPE *yyvs1 = yyvs;
|
YYSTYPE *yyvs1 = yyvs;
|
short *yyss1 = yyss;
|
short *yyss1 = yyss;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
YYLTYPE *yyls1 = yyls;
|
YYLTYPE *yyls1 = yyls;
|
#endif
|
#endif
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
/* Get the current used size of the three stacks, in elements. */
|
int size = yyssp - yyss + 1;
|
int size = yyssp - yyss + 1;
|
|
|
#ifdef yyoverflow
|
#ifdef yyoverflow
|
/* Each stack pointer address is followed by the size of
|
/* Each stack pointer address is followed by the size of
|
the data in use in that stack, in bytes. */
|
the data in use in that stack, in bytes. */
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
/* This used to be a conditional around just the two extra args,
|
/* This used to be a conditional around just the two extra args,
|
but that might be undefined if yyoverflow is a macro. */
|
but that might be undefined if yyoverflow is a macro. */
|
yyoverflow("parser stack overflow",
|
yyoverflow("parser stack overflow",
|
&yyss1, size * sizeof (*yyssp),
|
&yyss1, size * sizeof (*yyssp),
|
&yyvs1, size * sizeof (*yyvsp),
|
&yyvs1, size * sizeof (*yyvsp),
|
&yyls1, size * sizeof (*yylsp),
|
&yyls1, size * sizeof (*yylsp),
|
&yystacksize);
|
&yystacksize);
|
#else
|
#else
|
yyoverflow("parser stack overflow",
|
yyoverflow("parser stack overflow",
|
&yyss1, size * sizeof (*yyssp),
|
&yyss1, size * sizeof (*yyssp),
|
&yyvs1, size * sizeof (*yyvsp),
|
&yyvs1, size * sizeof (*yyvsp),
|
&yystacksize);
|
&yystacksize);
|
#endif
|
#endif
|
|
|
yyss = yyss1; yyvs = yyvs1;
|
yyss = yyss1; yyvs = yyvs1;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yyls = yyls1;
|
yyls = yyls1;
|
#endif
|
#endif
|
#else /* no yyoverflow */
|
#else /* no yyoverflow */
|
/* Extend the stack our own way. */
|
/* Extend the stack our own way. */
|
if (yystacksize >= YYMAXDEPTH)
|
if (yystacksize >= YYMAXDEPTH)
|
{
|
{
|
yyerror("parser stack overflow");
|
yyerror("parser stack overflow");
|
if (yyfree_stacks)
|
if (yyfree_stacks)
|
{
|
{
|
free (yyss);
|
free (yyss);
|
free (yyvs);
|
free (yyvs);
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
free (yyls);
|
free (yyls);
|
#endif
|
#endif
|
}
|
}
|
return 2;
|
return 2;
|
}
|
}
|
yystacksize *= 2;
|
yystacksize *= 2;
|
if (yystacksize > YYMAXDEPTH)
|
if (yystacksize > YYMAXDEPTH)
|
yystacksize = YYMAXDEPTH;
|
yystacksize = YYMAXDEPTH;
|
#ifndef YYSTACK_USE_ALLOCA
|
#ifndef YYSTACK_USE_ALLOCA
|
yyfree_stacks = 1;
|
yyfree_stacks = 1;
|
#endif
|
#endif
|
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
|
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
|
__yy_memcpy ((char *)yyss, (char *)yyss1,
|
__yy_memcpy ((char *)yyss, (char *)yyss1,
|
size * (unsigned int) sizeof (*yyssp));
|
size * (unsigned int) sizeof (*yyssp));
|
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
|
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
|
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
|
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
|
size * (unsigned int) sizeof (*yyvsp));
|
size * (unsigned int) sizeof (*yyvsp));
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
|
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
|
__yy_memcpy ((char *)yyls, (char *)yyls1,
|
__yy_memcpy ((char *)yyls, (char *)yyls1,
|
size * (unsigned int) sizeof (*yylsp));
|
size * (unsigned int) sizeof (*yylsp));
|
#endif
|
#endif
|
#endif /* no yyoverflow */
|
#endif /* no yyoverflow */
|
|
|
yyssp = yyss + size - 1;
|
yyssp = yyss + size - 1;
|
yyvsp = yyvs + size - 1;
|
yyvsp = yyvs + size - 1;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yylsp = yyls + size - 1;
|
yylsp = yyls + size - 1;
|
#endif
|
#endif
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
|
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
|
#endif
|
#endif
|
|
|
if (yyssp >= yyss + yystacksize - 1)
|
if (yyssp >= yyss + yystacksize - 1)
|
YYABORT;
|
YYABORT;
|
}
|
}
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Entering state %d\n", yystate);
|
fprintf(stderr, "Entering state %d\n", yystate);
|
#endif
|
#endif
|
|
|
goto yybackup;
|
goto yybackup;
|
yybackup:
|
yybackup:
|
|
|
/* Do appropriate processing given the current state. */
|
/* Do appropriate processing given the current state. */
|
/* Read a lookahead token if we need one and don't already have one. */
|
/* Read a lookahead token if we need one and don't already have one. */
|
/* yyresume: */
|
/* yyresume: */
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
yyn = yypact[yystate];
|
yyn = yypact[yystate];
|
if (yyn == YYFLAG)
|
if (yyn == YYFLAG)
|
goto yydefault;
|
goto yydefault;
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
/* yychar is either YYEMPTY or YYEOF
|
/* yychar is either YYEMPTY or YYEOF
|
or a valid token in external form. */
|
or a valid token in external form. */
|
|
|
if (yychar == YYEMPTY)
|
if (yychar == YYEMPTY)
|
{
|
{
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Reading a token: ");
|
fprintf(stderr, "Reading a token: ");
|
#endif
|
#endif
|
yychar = YYLEX;
|
yychar = YYLEX;
|
}
|
}
|
|
|
/* Convert token to internal form (in yychar1) for indexing tables with */
|
/* Convert token to internal form (in yychar1) for indexing tables with */
|
|
|
if (yychar <= 0) /* This means end of input. */
|
if (yychar <= 0) /* This means end of input. */
|
{
|
{
|
yychar1 = 0;
|
yychar1 = 0;
|
yychar = YYEOF; /* Don't call YYLEX any more */
|
yychar = YYEOF; /* Don't call YYLEX any more */
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Now at end of input.\n");
|
fprintf(stderr, "Now at end of input.\n");
|
#endif
|
#endif
|
}
|
}
|
else
|
else
|
{
|
{
|
yychar1 = YYTRANSLATE(yychar);
|
yychar1 = YYTRANSLATE(yychar);
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
{
|
{
|
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
|
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
|
/* Give the individual parser a way to print the precise meaning
|
/* Give the individual parser a way to print the precise meaning
|
of a token, for further debugging info. */
|
of a token, for further debugging info. */
|
#ifdef YYPRINT
|
#ifdef YYPRINT
|
YYPRINT (stderr, yychar, yylval);
|
YYPRINT (stderr, yychar, yylval);
|
#endif
|
#endif
|
fprintf (stderr, ")\n");
|
fprintf (stderr, ")\n");
|
}
|
}
|
#endif
|
#endif
|
}
|
}
|
|
|
yyn += yychar1;
|
yyn += yychar1;
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
|
goto yydefault;
|
goto yydefault;
|
|
|
yyn = yytable[yyn];
|
yyn = yytable[yyn];
|
|
|
/* yyn is what to do for this token type in this state.
|
/* yyn is what to do for this token type in this state.
|
Negative => reduce, -yyn is rule number.
|
Negative => reduce, -yyn is rule number.
|
Positive => shift, yyn is new state.
|
Positive => shift, yyn is new state.
|
New state is final state => don't bother to shift,
|
New state is final state => don't bother to shift,
|
just return success.
|
just return success.
|
0, or most negative number => error. */
|
0, or most negative number => error. */
|
|
|
if (yyn < 0)
|
if (yyn < 0)
|
{
|
{
|
if (yyn == YYFLAG)
|
if (yyn == YYFLAG)
|
goto yyerrlab;
|
goto yyerrlab;
|
yyn = -yyn;
|
yyn = -yyn;
|
goto yyreduce;
|
goto yyreduce;
|
}
|
}
|
else if (yyn == 0)
|
else if (yyn == 0)
|
goto yyerrlab;
|
goto yyerrlab;
|
|
|
if (yyn == YYFINAL)
|
if (yyn == YYFINAL)
|
YYACCEPT;
|
YYACCEPT;
|
|
|
/* Shift the lookahead token. */
|
/* Shift the lookahead token. */
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
|
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
|
#endif
|
#endif
|
|
|
/* Discard the token being shifted unless it is eof. */
|
/* Discard the token being shifted unless it is eof. */
|
if (yychar != YYEOF)
|
if (yychar != YYEOF)
|
yychar = YYEMPTY;
|
yychar = YYEMPTY;
|
|
|
*++yyvsp = yylval;
|
*++yyvsp = yylval;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
*++yylsp = yylloc;
|
*++yylsp = yylloc;
|
#endif
|
#endif
|
|
|
/* count tokens shifted since error; after three, turn off error status. */
|
/* count tokens shifted since error; after three, turn off error status. */
|
if (yyerrstatus) yyerrstatus--;
|
if (yyerrstatus) yyerrstatus--;
|
|
|
yystate = yyn;
|
yystate = yyn;
|
goto yynewstate;
|
goto yynewstate;
|
|
|
/* Do the default action for the current state. */
|
/* Do the default action for the current state. */
|
yydefault:
|
yydefault:
|
|
|
yyn = yydefact[yystate];
|
yyn = yydefact[yystate];
|
if (yyn == 0)
|
if (yyn == 0)
|
goto yyerrlab;
|
goto yyerrlab;
|
|
|
/* Do a reduction. yyn is the number of a rule to reduce with. */
|
/* Do a reduction. yyn is the number of a rule to reduce with. */
|
yyreduce:
|
yyreduce:
|
yylen = yyr2[yyn];
|
yylen = yyr2[yyn];
|
if (yylen > 0)
|
if (yylen > 0)
|
yyval = yyvsp[1-yylen]; /* implement default value of the action */
|
yyval = yyvsp[1-yylen]; /* implement default value of the action */
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
{
|
{
|
int i;
|
int i;
|
|
|
fprintf (stderr, "Reducing via rule %d (line %d), ",
|
fprintf (stderr, "Reducing via rule %d (line %d), ",
|
yyn, yyrline[yyn]);
|
yyn, yyrline[yyn]);
|
|
|
/* Print the symbols being reduced, and their result. */
|
/* Print the symbols being reduced, and their result. */
|
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
|
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
|
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
|
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
|
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
|
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
switch (yyn) {
|
switch (yyn) {
|
|
|
case 3:
|
case 3:
|
#line 208 "jv-exp.y"
|
#line 208 "jv-exp.y"
|
{
|
{
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_type(yyvsp[0].tval);
|
write_exp_elt_type(yyvsp[0].tval);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
;
|
;
|
break;}
|
break;}
|
case 6:
|
case 6:
|
#line 222 "jv-exp.y"
|
#line 222 "jv-exp.y"
|
{
|
{
|
write_exp_elt_opcode (OP_STRING);
|
write_exp_elt_opcode (OP_STRING);
|
write_exp_string (yyvsp[0].sval);
|
write_exp_string (yyvsp[0].sval);
|
write_exp_elt_opcode (OP_STRING);
|
write_exp_elt_opcode (OP_STRING);
|
;
|
;
|
break;}
|
break;}
|
case 7:
|
case 7:
|
#line 231 "jv-exp.y"
|
#line 231 "jv-exp.y"
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (yyvsp[0].typed_val_int.type);
|
write_exp_elt_type (yyvsp[0].typed_val_int.type);
|
write_exp_elt_longcst ((LONGEST)(yyvsp[0].typed_val_int.val));
|
write_exp_elt_longcst ((LONGEST)(yyvsp[0].typed_val_int.val));
|
write_exp_elt_opcode (OP_LONG); ;
|
write_exp_elt_opcode (OP_LONG); ;
|
break;}
|
break;}
|
case 8:
|
case 8:
|
#line 236 "jv-exp.y"
|
#line 236 "jv-exp.y"
|
{ YYSTYPE val;
|
{ YYSTYPE val;
|
parse_number (yyvsp[0].sval.ptr, yyvsp[0].sval.length, 0, &val);
|
parse_number (yyvsp[0].sval.ptr, yyvsp[0].sval.length, 0, &val);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (val.typed_val_int.type);
|
write_exp_elt_type (val.typed_val_int.type);
|
write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
|
write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
;
|
;
|
break;}
|
break;}
|
case 9:
|
case 9:
|
#line 244 "jv-exp.y"
|
#line 244 "jv-exp.y"
|
{ write_exp_elt_opcode (OP_DOUBLE);
|
{ write_exp_elt_opcode (OP_DOUBLE);
|
write_exp_elt_type (yyvsp[0].typed_val_float.type);
|
write_exp_elt_type (yyvsp[0].typed_val_float.type);
|
write_exp_elt_dblcst (yyvsp[0].typed_val_float.dval);
|
write_exp_elt_dblcst (yyvsp[0].typed_val_float.dval);
|
write_exp_elt_opcode (OP_DOUBLE); ;
|
write_exp_elt_opcode (OP_DOUBLE); ;
|
break;}
|
break;}
|
case 10:
|
case 10:
|
#line 249 "jv-exp.y"
|
#line 249 "jv-exp.y"
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (java_boolean_type);
|
write_exp_elt_type (java_boolean_type);
|
write_exp_elt_longcst ((LONGEST)yyvsp[0].lval);
|
write_exp_elt_longcst ((LONGEST)yyvsp[0].lval);
|
write_exp_elt_opcode (OP_LONG); ;
|
write_exp_elt_opcode (OP_LONG); ;
|
break;}
|
break;}
|
case 13:
|
case 13:
|
#line 266 "jv-exp.y"
|
#line 266 "jv-exp.y"
|
{ yyval.tval = java_boolean_type; ;
|
{ yyval.tval = java_boolean_type; ;
|
break;}
|
break;}
|
case 16:
|
case 16:
|
#line 276 "jv-exp.y"
|
#line 276 "jv-exp.y"
|
{ yyval.tval = java_byte_type; ;
|
{ yyval.tval = java_byte_type; ;
|
break;}
|
break;}
|
case 17:
|
case 17:
|
#line 278 "jv-exp.y"
|
#line 278 "jv-exp.y"
|
{ yyval.tval = java_short_type; ;
|
{ yyval.tval = java_short_type; ;
|
break;}
|
break;}
|
case 18:
|
case 18:
|
#line 280 "jv-exp.y"
|
#line 280 "jv-exp.y"
|
{ yyval.tval = java_int_type; ;
|
{ yyval.tval = java_int_type; ;
|
break;}
|
break;}
|
case 19:
|
case 19:
|
#line 282 "jv-exp.y"
|
#line 282 "jv-exp.y"
|
{ yyval.tval = java_long_type; ;
|
{ yyval.tval = java_long_type; ;
|
break;}
|
break;}
|
case 20:
|
case 20:
|
#line 284 "jv-exp.y"
|
#line 284 "jv-exp.y"
|
{ yyval.tval = java_char_type; ;
|
{ yyval.tval = java_char_type; ;
|
break;}
|
break;}
|
case 21:
|
case 21:
|
#line 289 "jv-exp.y"
|
#line 289 "jv-exp.y"
|
{ yyval.tval = java_float_type; ;
|
{ yyval.tval = java_float_type; ;
|
break;}
|
break;}
|
case 22:
|
case 22:
|
#line 291 "jv-exp.y"
|
#line 291 "jv-exp.y"
|
{ yyval.tval = java_double_type; ;
|
{ yyval.tval = java_double_type; ;
|
break;}
|
break;}
|
case 23:
|
case 23:
|
#line 303 "jv-exp.y"
|
#line 303 "jv-exp.y"
|
{ yyval.tval = java_type_from_name (yyvsp[0].sval); ;
|
{ yyval.tval = java_type_from_name (yyvsp[0].sval); ;
|
break;}
|
break;}
|
case 25:
|
case 25:
|
#line 312 "jv-exp.y"
|
#line 312 "jv-exp.y"
|
{ yyval.tval = java_array_type (yyvsp[-1].tval, yyvsp[0].lval); ;
|
{ yyval.tval = java_array_type (yyvsp[-1].tval, yyvsp[0].lval); ;
|
break;}
|
break;}
|
case 26:
|
case 26:
|
#line 314 "jv-exp.y"
|
#line 314 "jv-exp.y"
|
{ yyval.tval = java_array_type (java_type_from_name (yyvsp[-1].sval), yyvsp[0].lval); ;
|
{ yyval.tval = java_array_type (java_type_from_name (yyvsp[-1].sval), yyvsp[0].lval); ;
|
break;}
|
break;}
|
case 33:
|
case 33:
|
#line 334 "jv-exp.y"
|
#line 334 "jv-exp.y"
|
{ yyval.sval.length = yyvsp[-2].sval.length + yyvsp[0].sval.length + 1;
|
{ yyval.sval.length = yyvsp[-2].sval.length + yyvsp[0].sval.length + 1;
|
if (yyvsp[-2].sval.ptr + yyvsp[-2].sval.length + 1 == yyvsp[0].sval.ptr
|
if (yyvsp[-2].sval.ptr + yyvsp[-2].sval.length + 1 == yyvsp[0].sval.ptr
|
&& yyvsp[-2].sval.ptr[yyvsp[-2].sval.length] == '.')
|
&& yyvsp[-2].sval.ptr[yyvsp[-2].sval.length] == '.')
|
yyval.sval.ptr = yyvsp[-2].sval.ptr; /* Optimization. */
|
yyval.sval.ptr = yyvsp[-2].sval.ptr; /* Optimization. */
|
else
|
else
|
{
|
{
|
yyval.sval.ptr = (char *) xmalloc (yyval.sval.length + 1);
|
yyval.sval.ptr = (char *) xmalloc (yyval.sval.length + 1);
|
make_cleanup (free, yyval.sval.ptr);
|
make_cleanup (free, yyval.sval.ptr);
|
sprintf (yyval.sval.ptr, "%.*s.%.*s",
|
sprintf (yyval.sval.ptr, "%.*s.%.*s",
|
yyvsp[-2].sval.length, yyvsp[-2].sval.ptr, yyvsp[0].sval.length, yyvsp[0].sval.ptr);
|
yyvsp[-2].sval.length, yyvsp[-2].sval.ptr, yyvsp[0].sval.length, yyvsp[0].sval.ptr);
|
} ;
|
} ;
|
break;}
|
break;}
|
case 35:
|
case 35:
|
#line 358 "jv-exp.y"
|
#line 358 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_COMMA); ;
|
{ write_exp_elt_opcode (BINOP_COMMA); ;
|
break;}
|
break;}
|
case 39:
|
case 39:
|
#line 369 "jv-exp.y"
|
#line 369 "jv-exp.y"
|
{ write_exp_elt_opcode (OP_THIS);
|
{ write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS); ;
|
write_exp_elt_opcode (OP_THIS); ;
|
break;}
|
break;}
|
case 45:
|
case 45:
|
#line 377 "jv-exp.y"
|
#line 377 "jv-exp.y"
|
{ write_exp_elt_opcode (OP_ARRAY);
|
{ write_exp_elt_opcode (OP_ARRAY);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) yyvsp[0].lval);
|
write_exp_elt_longcst ((LONGEST) yyvsp[0].lval);
|
write_exp_elt_opcode (OP_ARRAY); ;
|
write_exp_elt_opcode (OP_ARRAY); ;
|
break;}
|
break;}
|
case 46:
|
case 46:
|
#line 385 "jv-exp.y"
|
#line 385 "jv-exp.y"
|
{ start_arglist (); ;
|
{ start_arglist (); ;
|
break;}
|
break;}
|
case 47:
|
case 47:
|
#line 390 "jv-exp.y"
|
#line 390 "jv-exp.y"
|
{ yyval.lval = end_arglist () - 1; ;
|
{ yyval.lval = end_arglist () - 1; ;
|
break;}
|
break;}
|
case 48:
|
case 48:
|
#line 395 "jv-exp.y"
|
#line 395 "jv-exp.y"
|
{ error ("FIXME - ClassInstanceCreationExpression"); ;
|
{ error ("FIXME - ClassInstanceCreationExpression"); ;
|
break;}
|
break;}
|
case 49:
|
case 49:
|
#line 400 "jv-exp.y"
|
#line 400 "jv-exp.y"
|
{ arglist_len = 1; ;
|
{ arglist_len = 1; ;
|
break;}
|
break;}
|
case 50:
|
case 50:
|
#line 402 "jv-exp.y"
|
#line 402 "jv-exp.y"
|
{ arglist_len++; ;
|
{ arglist_len++; ;
|
break;}
|
break;}
|
case 51:
|
case 51:
|
#line 407 "jv-exp.y"
|
#line 407 "jv-exp.y"
|
{ arglist_len = 0; ;
|
{ arglist_len = 0; ;
|
break;}
|
break;}
|
case 53:
|
case 53:
|
#line 413 "jv-exp.y"
|
#line 413 "jv-exp.y"
|
{ error ("FIXME - ArrayCreatiionExpression"); ;
|
{ error ("FIXME - ArrayCreatiionExpression"); ;
|
break;}
|
break;}
|
case 54:
|
case 54:
|
#line 415 "jv-exp.y"
|
#line 415 "jv-exp.y"
|
{ error ("FIXME - ArrayCreatiionExpression"); ;
|
{ error ("FIXME - ArrayCreatiionExpression"); ;
|
break;}
|
break;}
|
case 58:
|
case 58:
|
#line 429 "jv-exp.y"
|
#line 429 "jv-exp.y"
|
{ yyval.lval = 1; ;
|
{ yyval.lval = 1; ;
|
break;}
|
break;}
|
case 59:
|
case 59:
|
#line 431 "jv-exp.y"
|
#line 431 "jv-exp.y"
|
{ yyval.lval = yyvsp[-2].lval + 1; ;
|
{ yyval.lval = yyvsp[-2].lval + 1; ;
|
break;}
|
break;}
|
case 61:
|
case 61:
|
#line 437 "jv-exp.y"
|
#line 437 "jv-exp.y"
|
{ yyval.lval = 0; ;
|
{ yyval.lval = 0; ;
|
break;}
|
break;}
|
case 62:
|
case 62:
|
#line 442 "jv-exp.y"
|
#line 442 "jv-exp.y"
|
{ push_fieldnames (yyvsp[0].sval); ;
|
{ push_fieldnames (yyvsp[0].sval); ;
|
break;}
|
break;}
|
case 63:
|
case 63:
|
#line 444 "jv-exp.y"
|
#line 444 "jv-exp.y"
|
{ push_fieldnames (yyvsp[0].sval); ;
|
{ push_fieldnames (yyvsp[0].sval); ;
|
break;}
|
break;}
|
case 64:
|
case 64:
|
#line 450 "jv-exp.y"
|
#line 450 "jv-exp.y"
|
{ error ("method invocation not implemented"); ;
|
{ error ("method invocation not implemented"); ;
|
break;}
|
break;}
|
case 65:
|
case 65:
|
#line 452 "jv-exp.y"
|
#line 452 "jv-exp.y"
|
{ error ("method invocation not implemented"); ;
|
{ error ("method invocation not implemented"); ;
|
break;}
|
break;}
|
case 66:
|
case 66:
|
#line 454 "jv-exp.y"
|
#line 454 "jv-exp.y"
|
{ error ("method invocation not implemented"); ;
|
{ error ("method invocation not implemented"); ;
|
break;}
|
break;}
|
case 67:
|
case 67:
|
#line 459 "jv-exp.y"
|
#line 459 "jv-exp.y"
|
{
|
{
|
/* Emit code for the Name now, then exchange it in the
|
/* Emit code for the Name now, then exchange it in the
|
expout array with the Expression's code. We could
|
expout array with the Expression's code. We could
|
introduce a OP_SWAP code or a reversed version of
|
introduce a OP_SWAP code or a reversed version of
|
BINOP_SUBSCRIPT, but that makes the rest of GDB pay
|
BINOP_SUBSCRIPT, but that makes the rest of GDB pay
|
for our parsing kludges. */
|
for our parsing kludges. */
|
struct expression *name_expr;
|
struct expression *name_expr;
|
|
|
push_expression_name (yyvsp[-3].sval);
|
push_expression_name (yyvsp[-3].sval);
|
name_expr = copy_exp (expout, expout_ptr);
|
name_expr = copy_exp (expout, expout_ptr);
|
expout_ptr -= name_expr->nelts;
|
expout_ptr -= name_expr->nelts;
|
insert_exp (expout_ptr-length_of_subexp (expout, expout_ptr),
|
insert_exp (expout_ptr-length_of_subexp (expout, expout_ptr),
|
name_expr);
|
name_expr);
|
free (name_expr);
|
free (name_expr);
|
write_exp_elt_opcode (BINOP_SUBSCRIPT);
|
write_exp_elt_opcode (BINOP_SUBSCRIPT);
|
;
|
;
|
break;}
|
break;}
|
case 68:
|
case 68:
|
#line 476 "jv-exp.y"
|
#line 476 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); ;
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); ;
|
break;}
|
break;}
|
case 69:
|
case 69:
|
#line 478 "jv-exp.y"
|
#line 478 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); ;
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); ;
|
break;}
|
break;}
|
case 71:
|
case 71:
|
#line 484 "jv-exp.y"
|
#line 484 "jv-exp.y"
|
{ push_expression_name (yyvsp[0].sval); ;
|
{ push_expression_name (yyvsp[0].sval); ;
|
break;}
|
break;}
|
case 75:
|
case 75:
|
#line 493 "jv-exp.y"
|
#line 493 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_POSTINCREMENT); ;
|
{ write_exp_elt_opcode (UNOP_POSTINCREMENT); ;
|
break;}
|
break;}
|
case 76:
|
case 76:
|
#line 498 "jv-exp.y"
|
#line 498 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_POSTDECREMENT); ;
|
{ write_exp_elt_opcode (UNOP_POSTDECREMENT); ;
|
break;}
|
break;}
|
case 80:
|
case 80:
|
#line 506 "jv-exp.y"
|
#line 506 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_NEG); ;
|
{ write_exp_elt_opcode (UNOP_NEG); ;
|
break;}
|
break;}
|
case 81:
|
case 81:
|
#line 508 "jv-exp.y"
|
#line 508 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_IND); ;
|
{ write_exp_elt_opcode (UNOP_IND); ;
|
break;}
|
break;}
|
case 83:
|
case 83:
|
#line 514 "jv-exp.y"
|
#line 514 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_PREINCREMENT); ;
|
{ write_exp_elt_opcode (UNOP_PREINCREMENT); ;
|
break;}
|
break;}
|
case 84:
|
case 84:
|
#line 519 "jv-exp.y"
|
#line 519 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_PREDECREMENT); ;
|
{ write_exp_elt_opcode (UNOP_PREDECREMENT); ;
|
break;}
|
break;}
|
case 86:
|
case 86:
|
#line 525 "jv-exp.y"
|
#line 525 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_COMPLEMENT); ;
|
{ write_exp_elt_opcode (UNOP_COMPLEMENT); ;
|
break;}
|
break;}
|
case 87:
|
case 87:
|
#line 527 "jv-exp.y"
|
#line 527 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); ;
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); ;
|
break;}
|
break;}
|
case 89:
|
case 89:
|
#line 533 "jv-exp.y"
|
#line 533 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_CAST);
|
{ write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type (java_array_type (yyvsp[-3].tval, yyvsp[-2].lval));
|
write_exp_elt_type (java_array_type (yyvsp[-3].tval, yyvsp[-2].lval));
|
write_exp_elt_opcode (UNOP_CAST); ;
|
write_exp_elt_opcode (UNOP_CAST); ;
|
break;}
|
break;}
|
case 90:
|
case 90:
|
#line 537 "jv-exp.y"
|
#line 537 "jv-exp.y"
|
{
|
{
|
int exp_size = expout_ptr;
|
int exp_size = expout_ptr;
|
int last_exp_size = length_of_subexp(expout, expout_ptr);
|
int last_exp_size = length_of_subexp(expout, expout_ptr);
|
struct type *type;
|
struct type *type;
|
int i;
|
int i;
|
int base = expout_ptr - last_exp_size - 3;
|
int base = expout_ptr - last_exp_size - 3;
|
if (base < 0 || expout->elts[base+2].opcode != OP_TYPE)
|
if (base < 0 || expout->elts[base+2].opcode != OP_TYPE)
|
error ("invalid cast expression");
|
error ("invalid cast expression");
|
type = expout->elts[base+1].type;
|
type = expout->elts[base+1].type;
|
/* Remove the 'Expression' and slide the
|
/* Remove the 'Expression' and slide the
|
UnaryExpressionNotPlusMinus down to replace it. */
|
UnaryExpressionNotPlusMinus down to replace it. */
|
for (i = 0; i < last_exp_size; i++)
|
for (i = 0; i < last_exp_size; i++)
|
expout->elts[base + i] = expout->elts[base + i + 3];
|
expout->elts[base + i] = expout->elts[base + i + 3];
|
expout_ptr -= 3;
|
expout_ptr -= 3;
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
type = lookup_pointer_type (type);
|
type = lookup_pointer_type (type);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type (type);
|
write_exp_elt_type (type);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
;
|
;
|
break;}
|
break;}
|
case 91:
|
case 91:
|
#line 558 "jv-exp.y"
|
#line 558 "jv-exp.y"
|
{ write_exp_elt_opcode (UNOP_CAST);
|
{ write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type (java_array_type (java_type_from_name (yyvsp[-3].sval), yyvsp[-2].lval));
|
write_exp_elt_type (java_array_type (java_type_from_name (yyvsp[-3].sval), yyvsp[-2].lval));
|
write_exp_elt_opcode (UNOP_CAST); ;
|
write_exp_elt_opcode (UNOP_CAST); ;
|
break;}
|
break;}
|
case 93:
|
case 93:
|
#line 567 "jv-exp.y"
|
#line 567 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_MUL); ;
|
{ write_exp_elt_opcode (BINOP_MUL); ;
|
break;}
|
break;}
|
case 94:
|
case 94:
|
#line 569 "jv-exp.y"
|
#line 569 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_DIV); ;
|
{ write_exp_elt_opcode (BINOP_DIV); ;
|
break;}
|
break;}
|
case 95:
|
case 95:
|
#line 571 "jv-exp.y"
|
#line 571 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_REM); ;
|
{ write_exp_elt_opcode (BINOP_REM); ;
|
break;}
|
break;}
|
case 97:
|
case 97:
|
#line 577 "jv-exp.y"
|
#line 577 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_ADD); ;
|
{ write_exp_elt_opcode (BINOP_ADD); ;
|
break;}
|
break;}
|
case 98:
|
case 98:
|
#line 579 "jv-exp.y"
|
#line 579 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_SUB); ;
|
{ write_exp_elt_opcode (BINOP_SUB); ;
|
break;}
|
break;}
|
case 100:
|
case 100:
|
#line 585 "jv-exp.y"
|
#line 585 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_LSH); ;
|
{ write_exp_elt_opcode (BINOP_LSH); ;
|
break;}
|
break;}
|
case 101:
|
case 101:
|
#line 587 "jv-exp.y"
|
#line 587 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_RSH); ;
|
{ write_exp_elt_opcode (BINOP_RSH); ;
|
break;}
|
break;}
|
case 103:
|
case 103:
|
#line 594 "jv-exp.y"
|
#line 594 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_LESS); ;
|
{ write_exp_elt_opcode (BINOP_LESS); ;
|
break;}
|
break;}
|
case 104:
|
case 104:
|
#line 596 "jv-exp.y"
|
#line 596 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_GTR); ;
|
{ write_exp_elt_opcode (BINOP_GTR); ;
|
break;}
|
break;}
|
case 105:
|
case 105:
|
#line 598 "jv-exp.y"
|
#line 598 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_LEQ); ;
|
{ write_exp_elt_opcode (BINOP_LEQ); ;
|
break;}
|
break;}
|
case 106:
|
case 106:
|
#line 600 "jv-exp.y"
|
#line 600 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_GEQ); ;
|
{ write_exp_elt_opcode (BINOP_GEQ); ;
|
break;}
|
break;}
|
case 108:
|
case 108:
|
#line 607 "jv-exp.y"
|
#line 607 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_EQUAL); ;
|
{ write_exp_elt_opcode (BINOP_EQUAL); ;
|
break;}
|
break;}
|
case 109:
|
case 109:
|
#line 609 "jv-exp.y"
|
#line 609 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); ;
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); ;
|
break;}
|
break;}
|
case 111:
|
case 111:
|
#line 615 "jv-exp.y"
|
#line 615 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); ;
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); ;
|
break;}
|
break;}
|
case 113:
|
case 113:
|
#line 621 "jv-exp.y"
|
#line 621 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); ;
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); ;
|
break;}
|
break;}
|
case 115:
|
case 115:
|
#line 626 "jv-exp.y"
|
#line 626 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); ;
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); ;
|
break;}
|
break;}
|
case 117:
|
case 117:
|
#line 632 "jv-exp.y"
|
#line 632 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); ;
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); ;
|
break;}
|
break;}
|
case 119:
|
case 119:
|
#line 638 "jv-exp.y"
|
#line 638 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); ;
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); ;
|
break;}
|
break;}
|
case 121:
|
case 121:
|
#line 644 "jv-exp.y"
|
#line 644 "jv-exp.y"
|
{ write_exp_elt_opcode (TERNOP_COND); ;
|
{ write_exp_elt_opcode (TERNOP_COND); ;
|
break;}
|
break;}
|
case 124:
|
case 124:
|
#line 654 "jv-exp.y"
|
#line 654 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_ASSIGN); ;
|
{ write_exp_elt_opcode (BINOP_ASSIGN); ;
|
break;}
|
break;}
|
case 125:
|
case 125:
|
#line 656 "jv-exp.y"
|
#line 656 "jv-exp.y"
|
{ write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
|
{ write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
|
write_exp_elt_opcode (yyvsp[-1].opcode);
|
write_exp_elt_opcode (yyvsp[-1].opcode);
|
write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); ;
|
write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); ;
|
break;}
|
break;}
|
case 126:
|
case 126:
|
#line 663 "jv-exp.y"
|
#line 663 "jv-exp.y"
|
{ push_expression_name (yyvsp[0].sval); ;
|
{ push_expression_name (yyvsp[0].sval); ;
|
break;}
|
break;}
|
}
|
}
|
/* the action file gets copied in in place of this dollarsign */
|
/* the action file gets copied in in place of this dollarsign */
|
#line 542 "/usr/lib/bison.simple"
|
#line 542 "/usr/lib/bison.simple"
|
|
|
yyvsp -= yylen;
|
yyvsp -= yylen;
|
yyssp -= yylen;
|
yyssp -= yylen;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yylsp -= yylen;
|
yylsp -= yylen;
|
#endif
|
#endif
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
{
|
{
|
short *ssp1 = yyss - 1;
|
short *ssp1 = yyss - 1;
|
fprintf (stderr, "state stack now");
|
fprintf (stderr, "state stack now");
|
while (ssp1 != yyssp)
|
while (ssp1 != yyssp)
|
fprintf (stderr, " %d", *++ssp1);
|
fprintf (stderr, " %d", *++ssp1);
|
fprintf (stderr, "\n");
|
fprintf (stderr, "\n");
|
}
|
}
|
#endif
|
#endif
|
|
|
*++yyvsp = yyval;
|
*++yyvsp = yyval;
|
|
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yylsp++;
|
yylsp++;
|
if (yylen == 0)
|
if (yylen == 0)
|
{
|
{
|
yylsp->first_line = yylloc.first_line;
|
yylsp->first_line = yylloc.first_line;
|
yylsp->first_column = yylloc.first_column;
|
yylsp->first_column = yylloc.first_column;
|
yylsp->last_line = (yylsp-1)->last_line;
|
yylsp->last_line = (yylsp-1)->last_line;
|
yylsp->last_column = (yylsp-1)->last_column;
|
yylsp->last_column = (yylsp-1)->last_column;
|
yylsp->text = 0;
|
yylsp->text = 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
yylsp->last_line = (yylsp+yylen-1)->last_line;
|
yylsp->last_line = (yylsp+yylen-1)->last_line;
|
yylsp->last_column = (yylsp+yylen-1)->last_column;
|
yylsp->last_column = (yylsp+yylen-1)->last_column;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Now "shift" the result of the reduction.
|
/* Now "shift" the result of the reduction.
|
Determine what state that goes to,
|
Determine what state that goes to,
|
based on the state we popped back to
|
based on the state we popped back to
|
and the rule number reduced by. */
|
and the rule number reduced by. */
|
|
|
yyn = yyr1[yyn];
|
yyn = yyr1[yyn];
|
|
|
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
|
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
|
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
yystate = yytable[yystate];
|
yystate = yytable[yystate];
|
else
|
else
|
yystate = yydefgoto[yyn - YYNTBASE];
|
yystate = yydefgoto[yyn - YYNTBASE];
|
|
|
goto yynewstate;
|
goto yynewstate;
|
|
|
yyerrlab: /* here on detecting error */
|
yyerrlab: /* here on detecting error */
|
|
|
if (! yyerrstatus)
|
if (! yyerrstatus)
|
/* If not already recovering from an error, report this error. */
|
/* If not already recovering from an error, report this error. */
|
{
|
{
|
++yynerrs;
|
++yynerrs;
|
|
|
#ifdef YYERROR_VERBOSE
|
#ifdef YYERROR_VERBOSE
|
yyn = yypact[yystate];
|
yyn = yypact[yystate];
|
|
|
if (yyn > YYFLAG && yyn < YYLAST)
|
if (yyn > YYFLAG && yyn < YYLAST)
|
{
|
{
|
int size = 0;
|
int size = 0;
|
char *msg;
|
char *msg;
|
int x, count;
|
int x, count;
|
|
|
count = 0;
|
count = 0;
|
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
|
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
|
for (x = (yyn < 0 ? -yyn : 0);
|
for (x = (yyn < 0 ? -yyn : 0);
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
if (yycheck[x + yyn] == x)
|
if (yycheck[x + yyn] == x)
|
size += strlen(yytname[x]) + 15, count++;
|
size += strlen(yytname[x]) + 15, count++;
|
msg = (char *) xmalloc(size + 15);
|
msg = (char *) xmalloc(size + 15);
|
if (msg != 0)
|
if (msg != 0)
|
{
|
{
|
strcpy(msg, "parse error");
|
strcpy(msg, "parse error");
|
|
|
if (count < 5)
|
if (count < 5)
|
{
|
{
|
count = 0;
|
count = 0;
|
for (x = (yyn < 0 ? -yyn : 0);
|
for (x = (yyn < 0 ? -yyn : 0);
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
if (yycheck[x + yyn] == x)
|
if (yycheck[x + yyn] == x)
|
{
|
{
|
strcat(msg, count == 0 ? ", expecting `" : " or `");
|
strcat(msg, count == 0 ? ", expecting `" : " or `");
|
strcat(msg, yytname[x]);
|
strcat(msg, yytname[x]);
|
strcat(msg, "'");
|
strcat(msg, "'");
|
count++;
|
count++;
|
}
|
}
|
}
|
}
|
yyerror(msg);
|
yyerror(msg);
|
free(msg);
|
free(msg);
|
}
|
}
|
else
|
else
|
yyerror ("parse error; also virtual memory exceeded");
|
yyerror ("parse error; also virtual memory exceeded");
|
}
|
}
|
else
|
else
|
#endif /* YYERROR_VERBOSE */
|
#endif /* YYERROR_VERBOSE */
|
yyerror("parse error");
|
yyerror("parse error");
|
}
|
}
|
|
|
goto yyerrlab1;
|
goto yyerrlab1;
|
yyerrlab1: /* here on error raised explicitly by an action */
|
yyerrlab1: /* here on error raised explicitly by an action */
|
|
|
if (yyerrstatus == 3)
|
if (yyerrstatus == 3)
|
{
|
{
|
/* if just tried and failed to reuse lookahead token after an error, discard it. */
|
/* if just tried and failed to reuse lookahead token after an error, discard it. */
|
|
|
/* return failure if at end of input */
|
/* return failure if at end of input */
|
if (yychar == YYEOF)
|
if (yychar == YYEOF)
|
YYABORT;
|
YYABORT;
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
|
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
|
#endif
|
#endif
|
|
|
yychar = YYEMPTY;
|
yychar = YYEMPTY;
|
}
|
}
|
|
|
/* Else will try to reuse lookahead token
|
/* Else will try to reuse lookahead token
|
after shifting the error token. */
|
after shifting the error token. */
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this */
|
yyerrstatus = 3; /* Each real token shifted decrements this */
|
|
|
goto yyerrhandle;
|
goto yyerrhandle;
|
|
|
yyerrdefault: /* current state does not do anything special for the error token. */
|
yyerrdefault: /* current state does not do anything special for the error token. */
|
|
|
#if 0
|
#if 0
|
/* This is wrong; only states that explicitly want error tokens
|
/* This is wrong; only states that explicitly want error tokens
|
should shift them. */
|
should shift them. */
|
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
|
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
|
if (yyn) goto yydefault;
|
if (yyn) goto yydefault;
|
#endif
|
#endif
|
|
|
yyerrpop: /* pop the current state because it cannot handle the error token */
|
yyerrpop: /* pop the current state because it cannot handle the error token */
|
|
|
if (yyssp == yyss) YYABORT;
|
if (yyssp == yyss) YYABORT;
|
yyvsp--;
|
yyvsp--;
|
yystate = *--yyssp;
|
yystate = *--yyssp;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
yylsp--;
|
yylsp--;
|
#endif
|
#endif
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
{
|
{
|
short *ssp1 = yyss - 1;
|
short *ssp1 = yyss - 1;
|
fprintf (stderr, "Error: state stack now");
|
fprintf (stderr, "Error: state stack now");
|
while (ssp1 != yyssp)
|
while (ssp1 != yyssp)
|
fprintf (stderr, " %d", *++ssp1);
|
fprintf (stderr, " %d", *++ssp1);
|
fprintf (stderr, "\n");
|
fprintf (stderr, "\n");
|
}
|
}
|
#endif
|
#endif
|
|
|
yyerrhandle:
|
yyerrhandle:
|
|
|
yyn = yypact[yystate];
|
yyn = yypact[yystate];
|
if (yyn == YYFLAG)
|
if (yyn == YYFLAG)
|
goto yyerrdefault;
|
goto yyerrdefault;
|
|
|
yyn += YYTERROR;
|
yyn += YYTERROR;
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
|
goto yyerrdefault;
|
goto yyerrdefault;
|
|
|
yyn = yytable[yyn];
|
yyn = yytable[yyn];
|
if (yyn < 0)
|
if (yyn < 0)
|
{
|
{
|
if (yyn == YYFLAG)
|
if (yyn == YYFLAG)
|
goto yyerrpop;
|
goto yyerrpop;
|
yyn = -yyn;
|
yyn = -yyn;
|
goto yyreduce;
|
goto yyreduce;
|
}
|
}
|
else if (yyn == 0)
|
else if (yyn == 0)
|
goto yyerrpop;
|
goto yyerrpop;
|
|
|
if (yyn == YYFINAL)
|
if (yyn == YYFINAL)
|
YYACCEPT;
|
YYACCEPT;
|
|
|
#if YYDEBUG != 0
|
#if YYDEBUG != 0
|
if (yydebug)
|
if (yydebug)
|
fprintf(stderr, "Shifting error token, ");
|
fprintf(stderr, "Shifting error token, ");
|
#endif
|
#endif
|
|
|
*++yyvsp = yylval;
|
*++yyvsp = yylval;
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
*++yylsp = yylloc;
|
*++yylsp = yylloc;
|
#endif
|
#endif
|
|
|
yystate = yyn;
|
yystate = yyn;
|
goto yynewstate;
|
goto yynewstate;
|
|
|
yyacceptlab:
|
yyacceptlab:
|
/* YYACCEPT comes here. */
|
/* YYACCEPT comes here. */
|
if (yyfree_stacks)
|
if (yyfree_stacks)
|
{
|
{
|
free (yyss);
|
free (yyss);
|
free (yyvs);
|
free (yyvs);
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
free (yyls);
|
free (yyls);
|
#endif
|
#endif
|
}
|
}
|
return 0;
|
return 0;
|
|
|
yyabortlab:
|
yyabortlab:
|
/* YYABORT comes here. */
|
/* YYABORT comes here. */
|
if (yyfree_stacks)
|
if (yyfree_stacks)
|
{
|
{
|
free (yyss);
|
free (yyss);
|
free (yyvs);
|
free (yyvs);
|
#ifdef YYLSP_NEEDED
|
#ifdef YYLSP_NEEDED
|
free (yyls);
|
free (yyls);
|
#endif
|
#endif
|
}
|
}
|
return 1;
|
return 1;
|
}
|
}
|
#line 675 "jv-exp.y"
|
#line 675 "jv-exp.y"
|
|
|
/* Take care of parsing a number (anything that starts with a digit).
|
/* Take care of parsing a number (anything that starts with a digit).
|
Set yylval and return the token type; update lexptr.
|
Set yylval and return the token type; update lexptr.
|
LEN is the number of characters in it. */
|
LEN is the number of characters in it. */
|
|
|
/*** Needs some error checking for the float case ***/
|
/*** Needs some error checking for the float case ***/
|
|
|
static int
|
static int
|
parse_number (p, len, parsed_float, putithere)
|
parse_number (p, len, parsed_float, putithere)
|
register char *p;
|
register char *p;
|
register int len;
|
register int len;
|
int parsed_float;
|
int parsed_float;
|
YYSTYPE *putithere;
|
YYSTYPE *putithere;
|
{
|
{
|
register ULONGEST n = 0;
|
register ULONGEST n = 0;
|
ULONGEST limit, limit_div_base;
|
ULONGEST limit, limit_div_base;
|
|
|
register int c;
|
register int c;
|
register int base = input_radix;
|
register int base = input_radix;
|
|
|
struct type *type;
|
struct type *type;
|
|
|
if (parsed_float)
|
if (parsed_float)
|
{
|
{
|
/* It's a float since it contains a point or an exponent. */
|
/* It's a float since it contains a point or an exponent. */
|
char c;
|
char c;
|
int num = 0; /* number of tokens scanned by scanf */
|
int num = 0; /* number of tokens scanned by scanf */
|
char saved_char = p[len];
|
char saved_char = p[len];
|
|
|
p[len] = 0; /* null-terminate the token */
|
p[len] = 0; /* null-terminate the token */
|
if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
|
if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
|
num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval, &c);
|
num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval, &c);
|
else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
|
else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
|
num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval, &c);
|
num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval, &c);
|
else
|
else
|
{
|
{
|
#ifdef SCANF_HAS_LONG_DOUBLE
|
#ifdef SCANF_HAS_LONG_DOUBLE
|
num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval, &c);
|
num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval, &c);
|
#else
|
#else
|
/* Scan it into a double, then assign it to the long double.
|
/* Scan it into a double, then assign it to the long double.
|
This at least wins with values representable in the range
|
This at least wins with values representable in the range
|
of doubles. */
|
of doubles. */
|
double temp;
|
double temp;
|
num = sscanf (p, "%lg%c", &temp, &c);
|
num = sscanf (p, "%lg%c", &temp, &c);
|
putithere->typed_val_float.dval = temp;
|
putithere->typed_val_float.dval = temp;
|
#endif
|
#endif
|
}
|
}
|
p[len] = saved_char; /* restore the input stream */
|
p[len] = saved_char; /* restore the input stream */
|
if (num != 1) /* check scanf found ONLY a float ... */
|
if (num != 1) /* check scanf found ONLY a float ... */
|
return ERROR;
|
return ERROR;
|
/* See if it has `f' or `d' suffix (float or double). */
|
/* See if it has `f' or `d' suffix (float or double). */
|
|
|
c = tolower (p[len - 1]);
|
c = tolower (p[len - 1]);
|
|
|
if (c == 'f' || c == 'F')
|
if (c == 'f' || c == 'F')
|
putithere->typed_val_float.type = builtin_type_float;
|
putithere->typed_val_float.type = builtin_type_float;
|
else if (isdigit (c) || c == '.' || c == 'd' || c == 'D')
|
else if (isdigit (c) || c == '.' || c == 'd' || c == 'D')
|
putithere->typed_val_float.type = builtin_type_double;
|
putithere->typed_val_float.type = builtin_type_double;
|
else
|
else
|
return ERROR;
|
return ERROR;
|
|
|
return FLOATING_POINT_LITERAL;
|
return FLOATING_POINT_LITERAL;
|
}
|
}
|
|
|
/* Handle base-switching prefixes 0x, 0t, 0d, 0 */
|
/* Handle base-switching prefixes 0x, 0t, 0d, 0 */
|
if (p[0] == '0')
|
if (p[0] == '0')
|
switch (p[1])
|
switch (p[1])
|
{
|
{
|
case 'x':
|
case 'x':
|
case 'X':
|
case 'X':
|
if (len >= 3)
|
if (len >= 3)
|
{
|
{
|
p += 2;
|
p += 2;
|
base = 16;
|
base = 16;
|
len -= 2;
|
len -= 2;
|
}
|
}
|
break;
|
break;
|
|
|
case 't':
|
case 't':
|
case 'T':
|
case 'T':
|
case 'd':
|
case 'd':
|
case 'D':
|
case 'D':
|
if (len >= 3)
|
if (len >= 3)
|
{
|
{
|
p += 2;
|
p += 2;
|
base = 10;
|
base = 10;
|
len -= 2;
|
len -= 2;
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
base = 8;
|
base = 8;
|
break;
|
break;
|
}
|
}
|
|
|
c = p[len-1];
|
c = p[len-1];
|
limit = (ULONGEST)0xffffffff;
|
limit = (ULONGEST)0xffffffff;
|
if (c == 'l' || c == 'L')
|
if (c == 'l' || c == 'L')
|
{
|
{
|
type = java_long_type;
|
type = java_long_type;
|
len--;
|
len--;
|
/* A paranoid calculation of (1<<64)-1. */
|
/* A paranoid calculation of (1<<64)-1. */
|
limit = ((limit << 16) << 16) | limit;
|
limit = ((limit << 16) << 16) | limit;
|
}
|
}
|
else
|
else
|
{
|
{
|
type = java_int_type;
|
type = java_int_type;
|
}
|
}
|
limit_div_base = limit / (ULONGEST) base;
|
limit_div_base = limit / (ULONGEST) base;
|
|
|
while (--len >= 0)
|
while (--len >= 0)
|
{
|
{
|
c = *p++;
|
c = *p++;
|
if (c >= '0' && c <= '9')
|
if (c >= '0' && c <= '9')
|
c -= '0';
|
c -= '0';
|
else if (c >= 'A' && c <= 'Z')
|
else if (c >= 'A' && c <= 'Z')
|
c -= 'A' - 10;
|
c -= 'A' - 10;
|
else if (c >= 'a' && c <= 'z')
|
else if (c >= 'a' && c <= 'z')
|
c -= 'a' - 10;
|
c -= 'a' - 10;
|
else
|
else
|
return ERROR; /* Char not a digit */
|
return ERROR; /* Char not a digit */
|
if (c >= base)
|
if (c >= base)
|
return ERROR;
|
return ERROR;
|
if (n > limit_div_base
|
if (n > limit_div_base
|
|| (n *= base) > limit - c)
|
|| (n *= base) > limit - c)
|
error ("Numeric constant too large.");
|
error ("Numeric constant too large.");
|
n += c;
|
n += c;
|
}
|
}
|
|
|
putithere->typed_val_int.val = n;
|
putithere->typed_val_int.val = n;
|
putithere->typed_val_int.type = type;
|
putithere->typed_val_int.type = type;
|
return INTEGER_LITERAL;
|
return INTEGER_LITERAL;
|
}
|
}
|
|
|
struct token
|
struct token
|
{
|
{
|
char *operator;
|
char *operator;
|
int token;
|
int token;
|
enum exp_opcode opcode;
|
enum exp_opcode opcode;
|
};
|
};
|
|
|
static const struct token tokentab3[] =
|
static const struct token tokentab3[] =
|
{
|
{
|
{">>=", ASSIGN_MODIFY, BINOP_RSH},
|
{">>=", ASSIGN_MODIFY, BINOP_RSH},
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH}
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH}
|
};
|
};
|
|
|
static const struct token tokentab2[] =
|
static const struct token tokentab2[] =
|
{
|
{
|
{"+=", ASSIGN_MODIFY, BINOP_ADD},
|
{"+=", ASSIGN_MODIFY, BINOP_ADD},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV},
|
{"%=", ASSIGN_MODIFY, BINOP_REM},
|
{"%=", ASSIGN_MODIFY, BINOP_REM},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
|
{"++", INCREMENT, BINOP_END},
|
{"++", INCREMENT, BINOP_END},
|
{"--", DECREMENT, BINOP_END},
|
{"--", DECREMENT, BINOP_END},
|
{"&&", ANDAND, BINOP_END},
|
{"&&", ANDAND, BINOP_END},
|
{"||", OROR, BINOP_END},
|
{"||", OROR, BINOP_END},
|
{"<<", LSH, BINOP_END},
|
{"<<", LSH, BINOP_END},
|
{">>", RSH, BINOP_END},
|
{">>", RSH, BINOP_END},
|
{"==", EQUAL, BINOP_END},
|
{"==", EQUAL, BINOP_END},
|
{"!=", NOTEQUAL, BINOP_END},
|
{"!=", NOTEQUAL, BINOP_END},
|
{"<=", LEQ, BINOP_END},
|
{"<=", LEQ, BINOP_END},
|
{">=", GEQ, BINOP_END}
|
{">=", GEQ, BINOP_END}
|
};
|
};
|
|
|
/* Read one token, getting characters through lexptr. */
|
/* Read one token, getting characters through lexptr. */
|
|
|
static int
|
static int
|
yylex ()
|
yylex ()
|
{
|
{
|
int c;
|
int c;
|
int namelen;
|
int namelen;
|
unsigned int i;
|
unsigned int i;
|
char *tokstart;
|
char *tokstart;
|
char *tokptr;
|
char *tokptr;
|
int tempbufindex;
|
int tempbufindex;
|
static char *tempbuf;
|
static char *tempbuf;
|
static int tempbufsize;
|
static int tempbufsize;
|
|
|
retry:
|
retry:
|
|
|
tokstart = lexptr;
|
tokstart = lexptr;
|
/* See if it is a special token of length 3. */
|
/* See if it is a special token of length 3. */
|
for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
|
for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
|
if (STREQN (tokstart, tokentab3[i].operator, 3))
|
if (STREQN (tokstart, tokentab3[i].operator, 3))
|
{
|
{
|
lexptr += 3;
|
lexptr += 3;
|
yylval.opcode = tokentab3[i].opcode;
|
yylval.opcode = tokentab3[i].opcode;
|
return tokentab3[i].token;
|
return tokentab3[i].token;
|
}
|
}
|
|
|
/* See if it is a special token of length 2. */
|
/* See if it is a special token of length 2. */
|
for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
|
for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
|
if (STREQN (tokstart, tokentab2[i].operator, 2))
|
if (STREQN (tokstart, tokentab2[i].operator, 2))
|
{
|
{
|
lexptr += 2;
|
lexptr += 2;
|
yylval.opcode = tokentab2[i].opcode;
|
yylval.opcode = tokentab2[i].opcode;
|
return tokentab2[i].token;
|
return tokentab2[i].token;
|
}
|
}
|
|
|
switch (c = *tokstart)
|
switch (c = *tokstart)
|
{
|
{
|
case 0:
|
case 0:
|
return 0;
|
return 0;
|
|
|
case ' ':
|
case ' ':
|
case '\t':
|
case '\t':
|
case '\n':
|
case '\n':
|
lexptr++;
|
lexptr++;
|
goto retry;
|
goto retry;
|
|
|
case '\'':
|
case '\'':
|
/* We either have a character constant ('0' or '\177' for example)
|
/* We either have a character constant ('0' or '\177' for example)
|
or we have a quoted symbol reference ('foo(int,int)' in C++
|
or we have a quoted symbol reference ('foo(int,int)' in C++
|
for example). */
|
for example). */
|
lexptr++;
|
lexptr++;
|
c = *lexptr++;
|
c = *lexptr++;
|
if (c == '\\')
|
if (c == '\\')
|
c = parse_escape (&lexptr);
|
c = parse_escape (&lexptr);
|
else if (c == '\'')
|
else if (c == '\'')
|
error ("Empty character constant.");
|
error ("Empty character constant.");
|
|
|
yylval.typed_val_int.val = c;
|
yylval.typed_val_int.val = c;
|
yylval.typed_val_int.type = java_char_type;
|
yylval.typed_val_int.type = java_char_type;
|
|
|
c = *lexptr++;
|
c = *lexptr++;
|
if (c != '\'')
|
if (c != '\'')
|
{
|
{
|
namelen = skip_quoted (tokstart) - tokstart;
|
namelen = skip_quoted (tokstart) - tokstart;
|
if (namelen > 2)
|
if (namelen > 2)
|
{
|
{
|
lexptr = tokstart + namelen;
|
lexptr = tokstart + namelen;
|
if (lexptr[-1] != '\'')
|
if (lexptr[-1] != '\'')
|
error ("Unmatched single quote.");
|
error ("Unmatched single quote.");
|
namelen -= 2;
|
namelen -= 2;
|
tokstart++;
|
tokstart++;
|
goto tryname;
|
goto tryname;
|
}
|
}
|
error ("Invalid character constant.");
|
error ("Invalid character constant.");
|
}
|
}
|
return INTEGER_LITERAL;
|
return INTEGER_LITERAL;
|
|
|
case '(':
|
case '(':
|
paren_depth++;
|
paren_depth++;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case ')':
|
case ')':
|
if (paren_depth == 0)
|
if (paren_depth == 0)
|
return 0;
|
return 0;
|
paren_depth--;
|
paren_depth--;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case ',':
|
case ',':
|
if (comma_terminates && paren_depth == 0)
|
if (comma_terminates && paren_depth == 0)
|
return 0;
|
return 0;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case '.':
|
case '.':
|
/* Might be a floating point number. */
|
/* Might be a floating point number. */
|
if (lexptr[1] < '0' || lexptr[1] > '9')
|
if (lexptr[1] < '0' || lexptr[1] > '9')
|
goto symbol; /* Nope, must be a symbol. */
|
goto symbol; /* Nope, must be a symbol. */
|
/* FALL THRU into number case. */
|
/* FALL THRU into number case. */
|
|
|
case '0':
|
case '0':
|
case '1':
|
case '1':
|
case '2':
|
case '2':
|
case '3':
|
case '3':
|
case '4':
|
case '4':
|
case '5':
|
case '5':
|
case '6':
|
case '6':
|
case '7':
|
case '7':
|
case '8':
|
case '8':
|
case '9':
|
case '9':
|
{
|
{
|
/* It's a number. */
|
/* It's a number. */
|
int got_dot = 0, got_e = 0, toktype;
|
int got_dot = 0, got_e = 0, toktype;
|
register char *p = tokstart;
|
register char *p = tokstart;
|
int hex = input_radix > 10;
|
int hex = input_radix > 10;
|
|
|
if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
|
if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
|
{
|
{
|
p += 2;
|
p += 2;
|
hex = 1;
|
hex = 1;
|
}
|
}
|
else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
|
else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
|
{
|
{
|
p += 2;
|
p += 2;
|
hex = 0;
|
hex = 0;
|
}
|
}
|
|
|
for (;; ++p)
|
for (;; ++p)
|
{
|
{
|
/* This test includes !hex because 'e' is a valid hex digit
|
/* This test includes !hex because 'e' is a valid hex digit
|
and thus does not indicate a floating point number when
|
and thus does not indicate a floating point number when
|
the radix is hex. */
|
the radix is hex. */
|
if (!hex && !got_e && (*p == 'e' || *p == 'E'))
|
if (!hex && !got_e && (*p == 'e' || *p == 'E'))
|
got_dot = got_e = 1;
|
got_dot = got_e = 1;
|
/* This test does not include !hex, because a '.' always indicates
|
/* This test does not include !hex, because a '.' always indicates
|
a decimal floating point number regardless of the radix. */
|
a decimal floating point number regardless of the radix. */
|
else if (!got_dot && *p == '.')
|
else if (!got_dot && *p == '.')
|
got_dot = 1;
|
got_dot = 1;
|
else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
|
else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
|
&& (*p == '-' || *p == '+'))
|
&& (*p == '-' || *p == '+'))
|
/* This is the sign of the exponent, not the end of the
|
/* This is the sign of the exponent, not the end of the
|
number. */
|
number. */
|
continue;
|
continue;
|
/* We will take any letters or digits. parse_number will
|
/* We will take any letters or digits. parse_number will
|
complain if past the radix, or if L or U are not final. */
|
complain if past the radix, or if L or U are not final. */
|
else if ((*p < '0' || *p > '9')
|
else if ((*p < '0' || *p > '9')
|
&& ((*p < 'a' || *p > 'z')
|
&& ((*p < 'a' || *p > 'z')
|
&& (*p < 'A' || *p > 'Z')))
|
&& (*p < 'A' || *p > 'Z')))
|
break;
|
break;
|
}
|
}
|
toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
|
toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
|
if (toktype == ERROR)
|
if (toktype == ERROR)
|
{
|
{
|
char *err_copy = (char *) alloca (p - tokstart + 1);
|
char *err_copy = (char *) alloca (p - tokstart + 1);
|
|
|
memcpy (err_copy, tokstart, p - tokstart);
|
memcpy (err_copy, tokstart, p - tokstart);
|
err_copy[p - tokstart] = 0;
|
err_copy[p - tokstart] = 0;
|
error ("Invalid number \"%s\".", err_copy);
|
error ("Invalid number \"%s\".", err_copy);
|
}
|
}
|
lexptr = p;
|
lexptr = p;
|
return toktype;
|
return toktype;
|
}
|
}
|
|
|
case '+':
|
case '+':
|
case '-':
|
case '-':
|
case '*':
|
case '*':
|
case '/':
|
case '/':
|
case '%':
|
case '%':
|
case '|':
|
case '|':
|
case '&':
|
case '&':
|
case '^':
|
case '^':
|
case '~':
|
case '~':
|
case '!':
|
case '!':
|
case '<':
|
case '<':
|
case '>':
|
case '>':
|
case '[':
|
case '[':
|
case ']':
|
case ']':
|
case '?':
|
case '?':
|
case ':':
|
case ':':
|
case '=':
|
case '=':
|
case '{':
|
case '{':
|
case '}':
|
case '}':
|
symbol:
|
symbol:
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case '"':
|
case '"':
|
|
|
/* Build the gdb internal form of the input string in tempbuf,
|
/* Build the gdb internal form of the input string in tempbuf,
|
translating any standard C escape forms seen. Note that the
|
translating any standard C escape forms seen. Note that the
|
buffer is null byte terminated *only* for the convenience of
|
buffer is null byte terminated *only* for the convenience of
|
debugging gdb itself and printing the buffer contents when
|
debugging gdb itself and printing the buffer contents when
|
the buffer contains no embedded nulls. Gdb does not depend
|
the buffer contains no embedded nulls. Gdb does not depend
|
upon the buffer being null byte terminated, it uses the length
|
upon the buffer being null byte terminated, it uses the length
|
string instead. This allows gdb to handle C strings (as well
|
string instead. This allows gdb to handle C strings (as well
|
as strings in other languages) with embedded null bytes */
|
as strings in other languages) with embedded null bytes */
|
|
|
tokptr = ++tokstart;
|
tokptr = ++tokstart;
|
tempbufindex = 0;
|
tempbufindex = 0;
|
|
|
do {
|
do {
|
/* Grow the static temp buffer if necessary, including allocating
|
/* Grow the static temp buffer if necessary, including allocating
|
the first one on demand. */
|
the first one on demand. */
|
if (tempbufindex + 1 >= tempbufsize)
|
if (tempbufindex + 1 >= tempbufsize)
|
{
|
{
|
tempbuf = (char *) xrealloc (tempbuf, tempbufsize += 64);
|
tempbuf = (char *) xrealloc (tempbuf, tempbufsize += 64);
|
}
|
}
|
switch (*tokptr)
|
switch (*tokptr)
|
{
|
{
|
case '\0':
|
case '\0':
|
case '"':
|
case '"':
|
/* Do nothing, loop will terminate. */
|
/* Do nothing, loop will terminate. */
|
break;
|
break;
|
case '\\':
|
case '\\':
|
tokptr++;
|
tokptr++;
|
c = parse_escape (&tokptr);
|
c = parse_escape (&tokptr);
|
if (c == -1)
|
if (c == -1)
|
{
|
{
|
continue;
|
continue;
|
}
|
}
|
tempbuf[tempbufindex++] = c;
|
tempbuf[tempbufindex++] = c;
|
break;
|
break;
|
default:
|
default:
|
tempbuf[tempbufindex++] = *tokptr++;
|
tempbuf[tempbufindex++] = *tokptr++;
|
break;
|
break;
|
}
|
}
|
} while ((*tokptr != '"') && (*tokptr != '\0'));
|
} while ((*tokptr != '"') && (*tokptr != '\0'));
|
if (*tokptr++ != '"')
|
if (*tokptr++ != '"')
|
{
|
{
|
error ("Unterminated string in expression.");
|
error ("Unterminated string in expression.");
|
}
|
}
|
tempbuf[tempbufindex] = '\0'; /* See note above */
|
tempbuf[tempbufindex] = '\0'; /* See note above */
|
yylval.sval.ptr = tempbuf;
|
yylval.sval.ptr = tempbuf;
|
yylval.sval.length = tempbufindex;
|
yylval.sval.length = tempbufindex;
|
lexptr = tokptr;
|
lexptr = tokptr;
|
return (STRING_LITERAL);
|
return (STRING_LITERAL);
|
}
|
}
|
|
|
if (!(c == '_' || c == '$'
|
if (!(c == '_' || c == '$'
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
|
/* We must have come across a bad character (e.g. ';'). */
|
/* We must have come across a bad character (e.g. ';'). */
|
error ("Invalid character '%c' in expression.", c);
|
error ("Invalid character '%c' in expression.", c);
|
|
|
/* It's a name. See how long it is. */
|
/* It's a name. See how long it is. */
|
namelen = 0;
|
namelen = 0;
|
for (c = tokstart[namelen];
|
for (c = tokstart[namelen];
|
(c == '_'
|
(c == '_'
|
|| c == '$'
|
|| c == '$'
|
|| (c >= '0' && c <= '9')
|
|| (c >= '0' && c <= '9')
|
|| (c >= 'a' && c <= 'z')
|
|| (c >= 'a' && c <= 'z')
|
|| (c >= 'A' && c <= 'Z')
|
|| (c >= 'A' && c <= 'Z')
|
|| c == '<');
|
|| c == '<');
|
)
|
)
|
{
|
{
|
if (c == '<')
|
if (c == '<')
|
{
|
{
|
int i = namelen;
|
int i = namelen;
|
while (tokstart[++i] && tokstart[i] != '>');
|
while (tokstart[++i] && tokstart[i] != '>');
|
if (tokstart[i] == '>')
|
if (tokstart[i] == '>')
|
namelen = i;
|
namelen = i;
|
}
|
}
|
c = tokstart[++namelen];
|
c = tokstart[++namelen];
|
}
|
}
|
|
|
/* The token "if" terminates the expression and is NOT
|
/* The token "if" terminates the expression and is NOT
|
removed from the input stream. */
|
removed from the input stream. */
|
if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
|
if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
|
{
|
{
|
return 0;
|
return 0;
|
}
|
}
|
|
|
lexptr += namelen;
|
lexptr += namelen;
|
|
|
tryname:
|
tryname:
|
|
|
/* Catch specific keywords. Should be done with a data structure. */
|
/* Catch specific keywords. Should be done with a data structure. */
|
switch (namelen)
|
switch (namelen)
|
{
|
{
|
case 7:
|
case 7:
|
if (STREQN (tokstart, "boolean", 7))
|
if (STREQN (tokstart, "boolean", 7))
|
return BOOLEAN;
|
return BOOLEAN;
|
break;
|
break;
|
case 6:
|
case 6:
|
if (STREQN (tokstart, "double", 6))
|
if (STREQN (tokstart, "double", 6))
|
return DOUBLE;
|
return DOUBLE;
|
break;
|
break;
|
case 5:
|
case 5:
|
if (STREQN (tokstart, "short", 5))
|
if (STREQN (tokstart, "short", 5))
|
return SHORT;
|
return SHORT;
|
if (STREQN (tokstart, "false", 5))
|
if (STREQN (tokstart, "false", 5))
|
{
|
{
|
yylval.lval = 0;
|
yylval.lval = 0;
|
return BOOLEAN_LITERAL;
|
return BOOLEAN_LITERAL;
|
}
|
}
|
if (STREQN (tokstart, "super", 5))
|
if (STREQN (tokstart, "super", 5))
|
return SUPER;
|
return SUPER;
|
if (STREQN (tokstart, "float", 5))
|
if (STREQN (tokstart, "float", 5))
|
return FLOAT;
|
return FLOAT;
|
break;
|
break;
|
case 4:
|
case 4:
|
if (STREQN (tokstart, "long", 4))
|
if (STREQN (tokstart, "long", 4))
|
return LONG;
|
return LONG;
|
if (STREQN (tokstart, "byte", 4))
|
if (STREQN (tokstart, "byte", 4))
|
return BYTE;
|
return BYTE;
|
if (STREQN (tokstart, "char", 4))
|
if (STREQN (tokstart, "char", 4))
|
return CHAR;
|
return CHAR;
|
if (STREQN (tokstart, "true", 4))
|
if (STREQN (tokstart, "true", 4))
|
{
|
{
|
yylval.lval = 1;
|
yylval.lval = 1;
|
return BOOLEAN_LITERAL;
|
return BOOLEAN_LITERAL;
|
}
|
}
|
if (current_language->la_language == language_cplus
|
if (current_language->la_language == language_cplus
|
&& STREQN (tokstart, "this", 4))
|
&& STREQN (tokstart, "this", 4))
|
{
|
{
|
static const char this_name[] =
|
static const char this_name[] =
|
{ CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
|
{ CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
|
|
|
if (lookup_symbol (this_name, expression_context_block,
|
if (lookup_symbol (this_name, expression_context_block,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL))
|
(struct symtab **) NULL))
|
return THIS;
|
return THIS;
|
}
|
}
|
break;
|
break;
|
case 3:
|
case 3:
|
if (STREQN (tokstart, "int", 3))
|
if (STREQN (tokstart, "int", 3))
|
return INT;
|
return INT;
|
if (STREQN (tokstart, "new", 3))
|
if (STREQN (tokstart, "new", 3))
|
return NEW;
|
return NEW;
|
break;
|
break;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
yylval.sval.ptr = tokstart;
|
yylval.sval.ptr = tokstart;
|
yylval.sval.length = namelen;
|
yylval.sval.length = namelen;
|
|
|
if (*tokstart == '$')
|
if (*tokstart == '$')
|
{
|
{
|
write_dollar_variable (yylval.sval);
|
write_dollar_variable (yylval.sval);
|
return VARIABLE;
|
return VARIABLE;
|
}
|
}
|
|
|
/* Input names that aren't symbols but ARE valid hex numbers,
|
/* Input names that aren't symbols but ARE valid hex numbers,
|
when the input radix permits them, can be names or numbers
|
when the input radix permits them, can be names or numbers
|
depending on the parse. Note we support radixes > 16 here. */
|
depending on the parse. Note we support radixes > 16 here. */
|
if (((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
|
if (((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
|
(tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
|
(tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
|
{
|
{
|
YYSTYPE newlval; /* Its value is ignored. */
|
YYSTYPE newlval; /* Its value is ignored. */
|
int hextype = parse_number (tokstart, namelen, 0, &newlval);
|
int hextype = parse_number (tokstart, namelen, 0, &newlval);
|
if (hextype == INTEGER_LITERAL)
|
if (hextype == INTEGER_LITERAL)
|
return NAME_OR_INT;
|
return NAME_OR_INT;
|
}
|
}
|
return IDENTIFIER;
|
return IDENTIFIER;
|
}
|
}
|
|
|
void
|
void
|
yyerror (msg)
|
yyerror (msg)
|
char *msg;
|
char *msg;
|
{
|
{
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
java_type_from_name (name)
|
java_type_from_name (name)
|
struct stoken name;
|
struct stoken name;
|
|
|
{
|
{
|
char *tmp = copy_name (name);
|
char *tmp = copy_name (name);
|
struct type *typ = java_lookup_class (tmp);
|
struct type *typ = java_lookup_class (tmp);
|
if (typ == NULL || TYPE_CODE (typ) != TYPE_CODE_STRUCT)
|
if (typ == NULL || TYPE_CODE (typ) != TYPE_CODE_STRUCT)
|
error ("No class named %s.", tmp);
|
error ("No class named %s.", tmp);
|
return typ;
|
return typ;
|
}
|
}
|
|
|
/* If NAME is a valid variable name in this scope, push it and return 1.
|
/* If NAME is a valid variable name in this scope, push it and return 1.
|
Otherwise, return 0. */
|
Otherwise, return 0. */
|
|
|
static int
|
static int
|
push_variable (name)
|
push_variable (name)
|
struct stoken name;
|
struct stoken name;
|
|
|
{
|
{
|
char *tmp = copy_name (name);
|
char *tmp = copy_name (name);
|
int is_a_field_of_this = 0;
|
int is_a_field_of_this = 0;
|
struct symbol *sym;
|
struct symbol *sym;
|
sym = lookup_symbol (tmp, expression_context_block, VAR_NAMESPACE,
|
sym = lookup_symbol (tmp, expression_context_block, VAR_NAMESPACE,
|
&is_a_field_of_this, (struct symtab **) NULL);
|
&is_a_field_of_this, (struct symtab **) NULL);
|
if (sym && SYMBOL_CLASS (sym) != LOC_TYPEDEF)
|
if (sym && SYMBOL_CLASS (sym) != LOC_TYPEDEF)
|
{
|
{
|
if (symbol_read_needs_frame (sym))
|
if (symbol_read_needs_frame (sym))
|
{
|
{
|
if (innermost_block == 0 ||
|
if (innermost_block == 0 ||
|
contained_in (block_found, innermost_block))
|
contained_in (block_found, innermost_block))
|
innermost_block = block_found;
|
innermost_block = block_found;
|
}
|
}
|
|
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
/* We want to use the selected frame, not another more inner frame
|
/* We want to use the selected frame, not another more inner frame
|
which happens to be in the same block. */
|
which happens to be in the same block. */
|
write_exp_elt_block (NULL);
|
write_exp_elt_block (NULL);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
return 1;
|
return 1;
|
}
|
}
|
if (is_a_field_of_this)
|
if (is_a_field_of_this)
|
{
|
{
|
/* it hangs off of `this'. Must not inadvertently convert from a
|
/* it hangs off of `this'. Must not inadvertently convert from a
|
method call to data ref. */
|
method call to data ref. */
|
if (innermost_block == 0 ||
|
if (innermost_block == 0 ||
|
contained_in (block_found, innermost_block))
|
contained_in (block_found, innermost_block))
|
innermost_block = block_found;
|
innermost_block = block_found;
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_string (name);
|
write_exp_string (name);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
return 1;
|
return 1;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Assuming a reference expression has been pushed, emit the
|
/* Assuming a reference expression has been pushed, emit the
|
STRUCTOP_STRUCT ops to access the field named NAME. If NAME is a
|
STRUCTOP_STRUCT ops to access the field named NAME. If NAME is a
|
qualified name (has '.'), generate a field access for each part. */
|
qualified name (has '.'), generate a field access for each part. */
|
|
|
static void
|
static void
|
push_fieldnames (name)
|
push_fieldnames (name)
|
struct stoken name;
|
struct stoken name;
|
{
|
{
|
int i;
|
int i;
|
struct stoken token;
|
struct stoken token;
|
token.ptr = name.ptr;
|
token.ptr = name.ptr;
|
for (i = 0; ; i++)
|
for (i = 0; ; i++)
|
{
|
{
|
if (i == name.length || name.ptr[i] == '.')
|
if (i == name.length || name.ptr[i] == '.')
|
{
|
{
|
/* token.ptr is start of current field name. */
|
/* token.ptr is start of current field name. */
|
token.length = &name.ptr[i] - token.ptr;
|
token.length = &name.ptr[i] - token.ptr;
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
write_exp_string (token);
|
write_exp_string (token);
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
token.ptr += token.length + 1;
|
token.ptr += token.length + 1;
|
}
|
}
|
if (i >= name.length)
|
if (i >= name.length)
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
/* Helper routine for push_expression_name.
|
/* Helper routine for push_expression_name.
|
Handle a qualified name, where DOT_INDEX is the index of the first '.' */
|
Handle a qualified name, where DOT_INDEX is the index of the first '.' */
|
|
|
static void
|
static void
|
push_qualified_expression_name (name, dot_index)
|
push_qualified_expression_name (name, dot_index)
|
struct stoken name;
|
struct stoken name;
|
int dot_index;
|
int dot_index;
|
{
|
{
|
struct stoken token;
|
struct stoken token;
|
char *tmp;
|
char *tmp;
|
struct type *typ;
|
struct type *typ;
|
|
|
token.ptr = name.ptr;
|
token.ptr = name.ptr;
|
token.length = dot_index;
|
token.length = dot_index;
|
|
|
if (push_variable (token))
|
if (push_variable (token))
|
{
|
{
|
token.ptr = name.ptr + dot_index + 1;
|
token.ptr = name.ptr + dot_index + 1;
|
token.length = name.length - dot_index - 1;
|
token.length = name.length - dot_index - 1;
|
push_fieldnames (token);
|
push_fieldnames (token);
|
return;
|
return;
|
}
|
}
|
|
|
token.ptr = name.ptr;
|
token.ptr = name.ptr;
|
for (;;)
|
for (;;)
|
{
|
{
|
token.length = dot_index;
|
token.length = dot_index;
|
tmp = copy_name (token);
|
tmp = copy_name (token);
|
typ = java_lookup_class (tmp);
|
typ = java_lookup_class (tmp);
|
if (typ != NULL)
|
if (typ != NULL)
|
{
|
{
|
if (dot_index == name.length)
|
if (dot_index == name.length)
|
{
|
{
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_type(typ);
|
write_exp_elt_type(typ);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
return;
|
return;
|
}
|
}
|
dot_index++; /* Skip '.' */
|
dot_index++; /* Skip '.' */
|
name.ptr += dot_index;
|
name.ptr += dot_index;
|
name.length -= dot_index;
|
name.length -= dot_index;
|
dot_index = 0;
|
dot_index = 0;
|
while (dot_index < name.length && name.ptr[dot_index] != '.')
|
while (dot_index < name.length && name.ptr[dot_index] != '.')
|
dot_index++;
|
dot_index++;
|
token.ptr = name.ptr;
|
token.ptr = name.ptr;
|
token.length = dot_index;
|
token.length = dot_index;
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_type (typ);
|
write_exp_elt_type (typ);
|
write_exp_string (token);
|
write_exp_string (token);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
if (dot_index < name.length)
|
if (dot_index < name.length)
|
{
|
{
|
dot_index++;
|
dot_index++;
|
name.ptr += dot_index;
|
name.ptr += dot_index;
|
name.length -= dot_index;
|
name.length -= dot_index;
|
push_fieldnames (name);
|
push_fieldnames (name);
|
}
|
}
|
return;
|
return;
|
}
|
}
|
else if (dot_index >= name.length)
|
else if (dot_index >= name.length)
|
break;
|
break;
|
dot_index++; /* Skip '.' */
|
dot_index++; /* Skip '.' */
|
while (dot_index < name.length && name.ptr[dot_index] != '.')
|
while (dot_index < name.length && name.ptr[dot_index] != '.')
|
dot_index++;
|
dot_index++;
|
}
|
}
|
error ("unknown type `%.*s'", name.length, name.ptr);
|
error ("unknown type `%.*s'", name.length, name.ptr);
|
}
|
}
|
|
|
/* Handle Name in an expression (or LHS).
|
/* Handle Name in an expression (or LHS).
|
Handle VAR, TYPE, TYPE.FIELD1....FIELDN and VAR.FIELD1....FIELDN. */
|
Handle VAR, TYPE, TYPE.FIELD1....FIELDN and VAR.FIELD1....FIELDN. */
|
|
|
static void
|
static void
|
push_expression_name (name)
|
push_expression_name (name)
|
struct stoken name;
|
struct stoken name;
|
{
|
{
|
char *tmp;
|
char *tmp;
|
struct type *typ;
|
struct type *typ;
|
char *ptr;
|
char *ptr;
|
int i;
|
int i;
|
|
|
for (i = 0; i < name.length; i++)
|
for (i = 0; i < name.length; i++)
|
{
|
{
|
if (name.ptr[i] == '.')
|
if (name.ptr[i] == '.')
|
{
|
{
|
/* It's a Qualified Expression Name. */
|
/* It's a Qualified Expression Name. */
|
push_qualified_expression_name (name, i);
|
push_qualified_expression_name (name, i);
|
return;
|
return;
|
}
|
}
|
}
|
}
|
|
|
/* It's a Simple Expression Name. */
|
/* It's a Simple Expression Name. */
|
|
|
if (push_variable (name))
|
if (push_variable (name))
|
return;
|
return;
|
tmp = copy_name (name);
|
tmp = copy_name (name);
|
typ = java_lookup_class (tmp);
|
typ = java_lookup_class (tmp);
|
if (typ != NULL)
|
if (typ != NULL)
|
{
|
{
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_type(typ);
|
write_exp_elt_type(typ);
|
write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_opcode(OP_TYPE);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
|
|
msymbol = lookup_minimal_symbol (tmp, NULL, NULL);
|
msymbol = lookup_minimal_symbol (tmp, NULL, NULL);
|
if (msymbol != NULL)
|
if (msymbol != NULL)
|
{
|
{
|
write_exp_msymbol (msymbol,
|
write_exp_msymbol (msymbol,
|
lookup_function_type (builtin_type_int),
|
lookup_function_type (builtin_type_int),
|
builtin_type_int);
|
builtin_type_int);
|
}
|
}
|
else if (!have_full_symbols () && !have_partial_symbols ())
|
else if (!have_full_symbols () && !have_partial_symbols ())
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
else
|
else
|
error ("No symbol \"%s\" in current context.", tmp);
|
error ("No symbol \"%s\" in current context.", tmp);
|
}
|
}
|
|
|
}
|
}
|
|
|
|
|
/* The following two routines, copy_exp and insert_exp, aren't specific to
|
/* The following two routines, copy_exp and insert_exp, aren't specific to
|
Java, so they could go in parse.c, but their only purpose is to support
|
Java, so they could go in parse.c, but their only purpose is to support
|
the parsing kludges we use in this file, so maybe it's best to isolate
|
the parsing kludges we use in this file, so maybe it's best to isolate
|
them here. */
|
them here. */
|
|
|
/* Copy the expression whose last element is at index ENDPOS - 1 in EXPR
|
/* Copy the expression whose last element is at index ENDPOS - 1 in EXPR
|
into a freshly xmalloc'ed struct expression. Its language_defn is set
|
into a freshly xmalloc'ed struct expression. Its language_defn is set
|
to null. */
|
to null. */
|
static struct expression *
|
static struct expression *
|
copy_exp (expr, endpos)
|
copy_exp (expr, endpos)
|
struct expression *expr;
|
struct expression *expr;
|
int endpos;
|
int endpos;
|
{
|
{
|
int len = length_of_subexp (expr, endpos);
|
int len = length_of_subexp (expr, endpos);
|
struct expression *new
|
struct expression *new
|
= (struct expression *) xmalloc (sizeof (*new) + EXP_ELEM_TO_BYTES (len));
|
= (struct expression *) xmalloc (sizeof (*new) + EXP_ELEM_TO_BYTES (len));
|
new->nelts = len;
|
new->nelts = len;
|
memcpy (new->elts, expr->elts + endpos - len, EXP_ELEM_TO_BYTES (len));
|
memcpy (new->elts, expr->elts + endpos - len, EXP_ELEM_TO_BYTES (len));
|
new->language_defn = 0;
|
new->language_defn = 0;
|
|
|
return new;
|
return new;
|
}
|
}
|
|
|
/* Insert the expression NEW into the current expression (expout) at POS. */
|
/* Insert the expression NEW into the current expression (expout) at POS. */
|
static void
|
static void
|
insert_exp (pos, new)
|
insert_exp (pos, new)
|
int pos;
|
int pos;
|
struct expression *new;
|
struct expression *new;
|
{
|
{
|
int newlen = new->nelts;
|
int newlen = new->nelts;
|
|
|
/* Grow expout if necessary. In this function's only use at present,
|
/* Grow expout if necessary. In this function's only use at present,
|
this should never be necessary. */
|
this should never be necessary. */
|
if (expout_ptr + newlen > expout_size)
|
if (expout_ptr + newlen > expout_size)
|
{
|
{
|
expout_size = max (expout_size * 2, expout_ptr + newlen + 10);
|
expout_size = max (expout_size * 2, expout_ptr + newlen + 10);
|
expout = (struct expression *)
|
expout = (struct expression *)
|
xrealloc ((char *) expout, (sizeof (struct expression)
|
xrealloc ((char *) expout, (sizeof (struct expression)
|
+ EXP_ELEM_TO_BYTES (expout_size)));
|
+ EXP_ELEM_TO_BYTES (expout_size)));
|
}
|
}
|
|
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = expout_ptr - 1; i >= pos; i--)
|
for (i = expout_ptr - 1; i >= pos; i--)
|
expout->elts[i + newlen] = expout->elts[i];
|
expout->elts[i + newlen] = expout->elts[i];
|
}
|
}
|
|
|
memcpy (expout->elts + pos, new->elts, EXP_ELEM_TO_BYTES (newlen));
|
memcpy (expout->elts + pos, new->elts, EXP_ELEM_TO_BYTES (newlen));
|
expout_ptr += newlen;
|
expout_ptr += newlen;
|
}
|
}
|
|
|
