📄 m2-exp.y
字号:
/* YACC grammar for Modula-2 expressions, for GDB. Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc. Generated from expread.y (now c-exp.y) and contributed by the Department of Computer Science at the State University of New York at Buffalo, 1991.This file is part of GDB.This program is free software; you can redistribute it and/or modifyit under the terms of the GNU General Public License as published bythe Free Software Foundation; either version 2 of the License, or(at your option) any later version.This program is distributed in the hope that it will be useful,but WITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See theGNU General Public License for more details.You should have received a copy of the GNU General Public Licensealong with this program; if not, write to the Free SoftwareFoundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. *//* Parse a Modula-2 expression from text in a string, and return the result as a struct expression pointer. That structure contains arithmetic operations in reverse polish, with constants represented by operations that are followed by special data. See expression.h for the details of the format. What is important here is that it can be built up sequentially during the process of parsing; the lower levels of the tree always come first in the result. */ %{#include <stdio.h>#include <string.h>#include "defs.h"#include "symtab.h"#include "gdbtypes.h"#include "frame.h"#include "expression.h"#include "language.h"#include "value.h"#include "parser-defs.h"#include "bfd.h"#include "symfile.h"#include "objfiles.h"/* These MUST be included in any grammar file!!!! Please choose unique names! Note that this are a combined list of variables that can be produced by any one of bison, byacc, or yacc. */#define yymaxdepth m2_maxdepth#define yyparse m2_parse#define yylex m2_lex#define yyerror m2_error#define yylval m2_lval#define yychar m2_char#define yydebug m2_debug#define yypact m2_pact#define yyr1 m2_r1#define yyr2 m2_r2#define yydef m2_def#define yychk m2_chk#define yypgo m2_pgo#define yyact m2_act#define yyexca m2_exca#define yyerrflag m2_errflag#define yynerrs m2_nerrs#define yyps m2_ps#define yypv m2_pv#define yys m2_s#define yy_yys m2_yys#define yystate m2_state#define yytmp m2_tmp#define yyv m2_v#define yy_yyv m2_yyv#define yyval m2_val#define yylloc m2_lloc#define yyss m2_yyss /* byacc */#define yyssp m2_yysp /* byacc */#define yyvs m2_yyvs /* byacc */#define yyvsp m2_yyvsp /* byacc */#if 0static char *make_qualname PARAMS ((char *, char *));#endifstatic intparse_number PARAMS ((int));static intyylex PARAMS ((void));static voidyyerror PARAMS ((char *));intyyparse PARAMS ((void));/* The sign of the number being parsed. */int number_sign = 1;/* The block that the module specified by the qualifer on an identifer is contained in, */struct block *modblock=0;/* #define YYDEBUG 1 */%}/* Although the yacc "value" of an expression is not used, since the result is stored in the structure being created, other node types do have values. */%union { LONGEST lval; unsigned LONGEST ulval; double dval; struct symbol *sym; struct type *tval; struct stoken sval; int voidval; struct block *bval; enum exp_opcode opcode; struct internalvar *ivar; struct type **tvec; int *ivec; }%type <voidval> exp type_exp start set%type <voidval> variable%type <tval> type%type <bval> block %type <sym> fblock %token <lval> INT HEX ERROR%token <ulval> UINT M2_TRUE M2_FALSE CHAR%token <dval> FLOAT/* Both NAME and TYPENAME tokens represent symbols in the input, and both convey their data as strings. But a TYPENAME is a string that happens to be defined as a typedef or builtin type name (such as int or char) and a NAME is any other symbol. Contexts where this distinction is not important can use the nonterminal "name", which matches either NAME or TYPENAME. */%token <sval> STRING%token <sval> NAME BLOCKNAME IDENT VARNAME%token <sval> TYPENAME%token SIZE CAP ORD HIGH ABS MIN_FUNC MAX_FUNC FLOAT_FUNC VAL CHR ODD TRUNC%token INC DEC INCL EXCL/* The GDB scope operator */%token COLONCOLON%token <lval> LAST REGNAME%token <ivar> INTERNAL_VAR/* M2 tokens */%left ','%left ABOVE_COMMA%nonassoc ASSIGN%left '<' '>' LEQ GEQ '=' NOTEQUAL '#' IN%left OROR%left ANDAND '&'%left '@'%left '+' '-'%left '*' '/' DIV MOD%right UNARY%right '^' DOT '[' '('%right NOT '~'%left COLONCOLON QID/* This is not an actual token ; it is used for precedence. %right QID*/%{/* Ensure that if the generated parser contains any calls to malloc/realloc, that they get mapped to xmalloc/xrealloc. We have to do this here rather than earlier in the file because this is the first point after the place where the SVR4 yacc includes <malloc.h>, and if we do it before that, then the remapped declarations in <malloc.h> will collide with the ones in "defs.h". */#define malloc xmalloc#define realloc xrealloc%}%%start : exp | type_exp ;type_exp: type { write_exp_elt_opcode(OP_TYPE); write_exp_elt_type($1); write_exp_elt_opcode(OP_TYPE); } ;/* Expressions */exp : exp '^' %prec UNARY { write_exp_elt_opcode (UNOP_IND); }exp : '-' { number_sign = -1; } exp %prec UNARY { number_sign = 1; write_exp_elt_opcode (UNOP_NEG); } ;exp : '+' exp %prec UNARY { write_exp_elt_opcode(UNOP_PLUS); } ;exp : not_exp exp %prec UNARY { write_exp_elt_opcode (UNOP_ZEROP); } ;not_exp : NOT | '~' ;exp : CAP '(' exp ')' { write_exp_elt_opcode (UNOP_CAP); } ;exp : ORD '(' exp ')' { write_exp_elt_opcode (UNOP_ORD); } ;exp : ABS '(' exp ')' { write_exp_elt_opcode (UNOP_ABS); } ;exp : HIGH '(' exp ')' { write_exp_elt_opcode (UNOP_HIGH); } ;exp : MIN_FUNC '(' type ')' { write_exp_elt_opcode (UNOP_MIN); write_exp_elt_type ($3); write_exp_elt_opcode (UNOP_MIN); } ;exp : MAX_FUNC '(' type ')' { write_exp_elt_opcode (UNOP_MAX); write_exp_elt_type ($3); write_exp_elt_opcode (UNOP_MIN); } ;exp : FLOAT_FUNC '(' exp ')' { write_exp_elt_opcode (UNOP_FLOAT); } ;exp : VAL '(' type ',' exp ')' { write_exp_elt_opcode (BINOP_VAL); write_exp_elt_type ($3); write_exp_elt_opcode (BINOP_VAL); } ;exp : CHR '(' exp ')' { write_exp_elt_opcode (UNOP_CHR); } ;exp : ODD '(' exp ')' { write_exp_elt_opcode (UNOP_ODD); } ;exp : TRUNC '(' exp ')' { write_exp_elt_opcode (UNOP_TRUNC); } ;exp : SIZE exp %prec UNARY { write_exp_elt_opcode (UNOP_SIZEOF); } ;exp : INC '(' exp ')' { write_exp_elt_opcode(UNOP_PREINCREMENT); } ;exp : INC '(' exp ',' exp ')' { write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); write_exp_elt_opcode(BINOP_ADD); write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); } ;exp : DEC '(' exp ')' { write_exp_elt_opcode(UNOP_PREDECREMENT);} ;exp : DEC '(' exp ',' exp ')' { write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); write_exp_elt_opcode(BINOP_SUB); write_exp_elt_opcode(BINOP_ASSIGN_MODIFY); } ;exp : exp DOT NAME { write_exp_elt_opcode (STRUCTOP_STRUCT); write_exp_string ($3); write_exp_elt_opcode (STRUCTOP_STRUCT); } ;exp : set ;exp : exp IN set { error("Sets are not implemented.");} ;exp : INCL '(' exp ',' exp ')' { error("Sets are not implemented.");} ;exp : EXCL '(' exp ',' exp ')' { error("Sets are not implemented.");}set : '{' arglist '}' { error("Sets are not implemented.");} | type '{' arglist '}' { error("Sets are not implemented.");} ;/* Modula-2 array subscript notation [a,b,c...] */exp : exp '[' /* This function just saves the number of arguments that follow in the list. It is *not* specific to function types */ { start_arglist(); } non_empty_arglist ']' %prec DOT { write_exp_elt_opcode (BINOP_MULTI_SUBSCRIPT); write_exp_elt_longcst ((LONGEST) end_arglist()); write_exp_elt_opcode (BINOP_MULTI_SUBSCRIPT); } ;exp : exp '(' /* This is to save the value of arglist_len being accumulated by an outer function call. */ { start_arglist (); } arglist ')' %prec DOT { write_exp_elt_opcode (OP_FUNCALL); write_exp_elt_longcst ((LONGEST) end_arglist ()); write_exp_elt_opcode (OP_FUNCALL); } ;arglist : ;arglist : exp { arglist_len = 1; } ;arglist : arglist ',' exp %prec ABOVE_COMMA { arglist_len++; } ;non_empty_arglist : exp { arglist_len = 1; } ;non_empty_arglist : non_empty_arglist ',' exp %prec ABOVE_COMMA { arglist_len++; } ;/* GDB construct */exp : '{' type '}' exp %prec UNARY { write_exp_elt_opcode (UNOP_MEMVAL); write_exp_elt_type ($2); write_exp_elt_opcode (UNOP_MEMVAL); } ;exp : type '(' exp ')' %prec UNARY { write_exp_elt_opcode (UNOP_CAST); write_exp_elt_type ($1); write_exp_elt_opcode (UNOP_CAST); } ;exp : '(' exp ')' { } ;/* Binary operators in order of decreasing precedence. Note that some of these operators are overloaded! (ie. sets) *//* GDB construct */exp : exp '@' exp { write_exp_elt_opcode (BINOP_REPEAT); } ;exp : exp '*' exp { write_exp_elt_opcode (BINOP_MUL); } ;exp : exp '/' exp { write_exp_elt_opcode (BINOP_DIV); } ;exp : exp DIV exp { write_exp_elt_opcode (BINOP_INTDIV); } ;exp : exp MOD exp { write_exp_elt_opcode (BINOP_REM); } ;exp : exp '+' exp { write_exp_elt_opcode (BINOP_ADD); } ;exp : exp '-' exp { write_exp_elt_opcode (BINOP_SUB); } ;exp : exp '=' exp { write_exp_elt_opcode (BINOP_EQUAL); } ;exp : exp NOTEQUAL exp { write_exp_elt_opcode (BINOP_NOTEQUAL); } | exp '#' exp { write_exp_elt_opcode (BINOP_NOTEQUAL); } ;exp : exp LEQ exp { write_exp_elt_opcode (BINOP_LEQ); } ;exp : exp GEQ exp { write_exp_elt_opcode (BINOP_GEQ); } ;exp : exp '<' exp { write_exp_elt_opcode (BINOP_LESS); } ;exp : exp '>' exp { write_exp_elt_opcode (BINOP_GTR); } ;exp : exp ANDAND exp { write_exp_elt_opcode (BINOP_AND); } ;exp : exp '&' exp { write_exp_elt_opcode (BINOP_AND); } ;exp : exp OROR exp { write_exp_elt_opcode (BINOP_OR); } ;exp : exp ASSIGN exp { write_exp_elt_opcode (BINOP_ASSIGN); } ;/* Constants */exp : M2_TRUE { write_exp_elt_opcode (OP_BOOL); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_BOOL); } ;exp : M2_FALSE { write_exp_elt_opcode (OP_BOOL); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_BOOL); } ;exp : INT { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_m2_int); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_LONG); } ;exp : UINT { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_m2_card); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_LONG); } ;exp : CHAR { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_m2_char); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_LONG); } ;exp : FLOAT { write_exp_elt_opcode (OP_DOUBLE); write_exp_elt_type (builtin_type_m2_real); write_exp_elt_dblcst ($1); write_exp_elt_opcode (OP_DOUBLE); } ;exp : variable ;/* The GDB internal variable $$, et al. */exp : LAST { write_exp_elt_opcode (OP_LAST); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_LAST); } ;exp : REGNAME { write_exp_elt_opcode (OP_REGISTER); write_exp_elt_longcst ((LONGEST) $1); write_exp_elt_opcode (OP_REGISTER); } ;exp : SIZE '(' type ')' %prec UNARY { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_int); write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3)); write_exp_elt_opcode (OP_LONG); } ;exp : STRING { write_exp_elt_opcode (OP_M2_STRING); write_exp_string ($1); write_exp_elt_opcode (OP_M2_STRING); } ;/* This will be used for extensions later. Like adding modules. */block : fblock { $$ = SYMBOL_BLOCK_VALUE($1); } ;fblock : BLOCKNAME { struct symbol *sym = lookup_symbol (copy_name ($1), expression_context_block, VAR_NAMESPACE, 0, NULL); $$ = sym;} ; /* GDB scope operator */fblock : block COLONCOLON BLOCKNAME { struct symbol *tem = lookup_symbol (copy_name ($3), $1, VAR_NAMESPACE, 0, NULL); if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK) error ("No function \"%s\" in specified context.", copy_name ($3)); $$ = tem; } ;/* Useful for assigning to PROCEDURE variables */variable: fblock { write_exp_elt_opcode(OP_VAR_VALUE); write_exp_elt_sym ($1); write_exp_elt_opcode (OP_VAR_VALUE); } ;/* GDB internal ($foo) variable */variable: INTERNAL_VAR { write_exp_elt_opcode (OP_INTERNALVAR); write_exp_elt_intern ($1); write_exp_elt_opcode (OP_INTERNALVAR); } ;/* GDB scope operator */variable: block COLONCOLON NAME { struct symbol *sym; sym = lookup_symbol (copy_name ($3), $1, VAR_NAMESPACE, 0, NULL); if (sym == 0) error ("No symbol \"%s\" in specified context.", copy_name ($3)); write_exp_elt_opcode (OP_VAR_VALUE); write_exp_elt_sym (sym); write_exp_elt_opcode (OP_VAR_VALUE); } ;/* Base case for variables. */variable: NAME { struct symbol *sym; int is_a_field_of_this; sym = lookup_symbol (copy_name ($1), expression_context_block, VAR_NAMESPACE, &is_a_field_of_this, NULL); if (sym) { switch (sym->class) { case LOC_REGISTER: case LOC_ARG: case LOC_LOCAL: case LOC_REF_ARG: case LOC_REGPARM: case LOC_LOCAL_ARG: if (innermost_block == 0 || contained_in (block_found, innermost_block)) innermost_block = block_found; break; case LOC_UNDEF: case LOC_CONST: case LOC_STATIC: case LOC_TYPEDEF: case LOC_LABEL: /* maybe should go above? */ case LOC_BLOCK: case LOC_CONST_BYTES: /* These are listed so gcc -Wall will reveal un-handled cases. */ break; } write_exp_elt_opcode (OP_VAR_VALUE); write_exp_elt_sym (sym); write_exp_elt_opcode (OP_VAR_VALUE); } else { struct minimal_symbol *msymbol; register char *arg = copy_name ($1); msymbol = lookup_minimal_symbol (arg, (struct objfile *) NULL); if (msymbol != NULL)
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -