1 /* YACC parser for Fortran expressions, for GDB.
2 Copyright 1986, 1989, 1990, 1991, 1993, 1994
3 Free Software Foundation, Inc.
4 Contributed by Motorola. Adapted from the C parser by Farooq Butt
5 (fmbutt@engage.sps.mot.com).
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
23 /* This was blantantly ripped off the C expression parser, please
24 be aware of that as you look at its basic structure -FMB */
26 /* Parse a F77 expression from text in a string,
27 and return the result as a struct expression pointer.
28 That structure contains arithmetic operations in reverse polish,
29 with constants represented by operations that are followed by special data.
30 See expression.h for the details of the format.
31 What is important here is that it can be built up sequentially
32 during the process of parsing; the lower levels of the tree always
33 come first in the result.
35 Note that malloc's and realloc's in this file are transformed to
36 xmalloc and xrealloc respectively by the same sed command in the
37 makefile that remaps any other malloc/realloc inserted by the parser
38 generator. Doing this with #defines and trying to control the interaction
39 with include files (<malloc.h> and <stdlib.h> for example) just became
40 too messy, particularly when such includes can be inserted at random
41 times by the parser generator. */
47 #include "expression.h"
49 #include "parser-defs.h"
52 #include "bfd.h" /* Required by objfiles.h. */
53 #include "symfile.h" /* Required by objfiles.h. */
54 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
56 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
57 as well as gratuitiously global symbol names, so we can have multiple
58 yacc generated parsers in gdb. Note that these are only the variables
59 produced by yacc. If other parser generators (bison, byacc, etc) produce
60 additional global names that conflict at link time, then those parser
61 generators need to be fixed instead of adding those names to this list. */
63 #define yymaxdepth f_maxdepth
64 #define yyparse f_parse
66 #define yyerror f_error
69 #define yydebug f_debug
78 #define yyerrflag f_errflag
79 #define yynerrs f_nerrs
84 #define yystate f_state
90 #define yyreds f_reds /* With YYDEBUG defined */
91 #define yytoks f_toks /* With YYDEBUG defined */
94 #define YYDEBUG 1 /* Default to no yydebug support */
97 int yyparse PARAMS ((void));
99 static int yylex PARAMS ((void));
101 void yyerror PARAMS ((char *));
105 /* Although the yacc "value" of an expression is not used,
106 since the result is stored in the structure being created,
107 other node types do have values. */
121 struct symtoken ssym;
124 enum exp_opcode opcode;
125 struct internalvar *ivar;
132 /* YYSTYPE gets defined by %union */
133 static int parse_number PARAMS ((char *, int, int, YYSTYPE *));
136 %type <voidval> exp type_exp start variable
137 %type <tval> type typebase
138 %type <tvec> nonempty_typelist
139 /* %type <bval> block */
141 /* Fancy type parsing. */
142 %type <voidval> func_mod direct_abs_decl abs_decl
145 %token <typed_val> INT
148 /* Both NAME and TYPENAME tokens represent symbols in the input,
149 and both convey their data as strings.
150 But a TYPENAME is a string that happens to be defined as a typedef
151 or builtin type name (such as int or char)
152 and a NAME is any other symbol.
153 Contexts where this distinction is not important can use the
154 nonterminal "name", which matches either NAME or TYPENAME. */
156 %token <sval> STRING_LITERAL
157 %token <lval> BOOLEAN_LITERAL
159 %token <tsym> TYPENAME
161 %type <ssym> name_not_typename
162 %type <tsym> typename
164 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
165 but which would parse as a valid number in the current input radix.
166 E.g. "c" when input_radix==16. Depending on the parse, it will be
167 turned into a name or into a number. */
169 %token <ssym> NAME_OR_INT
174 /* Special type cases, put in to allow the parser to distinguish different
176 %token INT_KEYWORD INT_S2_KEYWORD LOGICAL_S1_KEYWORD LOGICAL_S2_KEYWORD
177 %token LOGICAL_KEYWORD REAL_KEYWORD REAL_S8_KEYWORD REAL_S16_KEYWORD
178 %token COMPLEX_S8_KEYWORD COMPLEX_S16_KEYWORD COMPLEX_S32_KEYWORD
179 %token BOOL_AND BOOL_OR BOOL_NOT
180 %token <lval> LAST REGNAME CHARACTER
182 %token <ivar> VARIABLE
184 %token <opcode> ASSIGN_MODIFY
188 %right '=' ASSIGN_MODIFY
197 %left LESSTHAN GREATERTHAN LEQ GEQ
213 { write_exp_elt_opcode(OP_TYPE);
214 write_exp_elt_type($1);
215 write_exp_elt_opcode(OP_TYPE); }
222 /* Expressions, not including the comma operator. */
223 exp : '*' exp %prec UNARY
224 { write_exp_elt_opcode (UNOP_IND); }
226 exp : '&' exp %prec UNARY
227 { write_exp_elt_opcode (UNOP_ADDR); }
229 exp : '-' exp %prec UNARY
230 { write_exp_elt_opcode (UNOP_NEG); }
233 exp : BOOL_NOT exp %prec UNARY
234 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
237 exp : '~' exp %prec UNARY
238 { write_exp_elt_opcode (UNOP_COMPLEMENT); }
241 exp : SIZEOF exp %prec UNARY
242 { write_exp_elt_opcode (UNOP_SIZEOF); }
245 /* No more explicit array operators, we treat everything in F77 as
246 a function call. The disambiguation as to whether we are
247 doing a subscript operation or a function call is done
251 { start_arglist (); }
253 { write_exp_elt_opcode (OP_F77_UNDETERMINED_ARGLIST);
254 write_exp_elt_longcst ((LONGEST) end_arglist ());
255 write_exp_elt_opcode (OP_F77_UNDETERMINED_ARGLIST); }
268 arglist : arglist ',' exp %prec ABOVE_COMMA
272 substring: exp ':' exp %prec ABOVE_COMMA
277 complexnum: exp ',' exp
281 exp : '(' complexnum ')'
282 { write_exp_elt_opcode(OP_COMPLEX); }
285 exp : '(' type ')' exp %prec UNARY
286 { write_exp_elt_opcode (UNOP_CAST);
287 write_exp_elt_type ($2);
288 write_exp_elt_opcode (UNOP_CAST); }
291 /* Binary operators in order of decreasing precedence. */
294 { write_exp_elt_opcode (BINOP_REPEAT); }
298 { write_exp_elt_opcode (BINOP_MUL); }
302 { write_exp_elt_opcode (BINOP_DIV); }
306 { write_exp_elt_opcode (BINOP_REM); }
310 { write_exp_elt_opcode (BINOP_ADD); }
314 { write_exp_elt_opcode (BINOP_SUB); }
318 { write_exp_elt_opcode (BINOP_LSH); }
322 { write_exp_elt_opcode (BINOP_RSH); }
326 { write_exp_elt_opcode (BINOP_EQUAL); }
329 exp : exp NOTEQUAL exp
330 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
334 { write_exp_elt_opcode (BINOP_LEQ); }
338 { write_exp_elt_opcode (BINOP_GEQ); }
341 exp : exp LESSTHAN exp
342 { write_exp_elt_opcode (BINOP_LESS); }
345 exp : exp GREATERTHAN exp
346 { write_exp_elt_opcode (BINOP_GTR); }
350 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
354 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
358 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
361 exp : exp BOOL_AND exp
362 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
366 exp : exp BOOL_OR exp
367 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
371 { write_exp_elt_opcode (BINOP_ASSIGN); }
374 exp : exp ASSIGN_MODIFY exp
375 { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
376 write_exp_elt_opcode ($2);
377 write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
381 { write_exp_elt_opcode (OP_LONG);
382 write_exp_elt_type ($1.type);
383 write_exp_elt_longcst ((LONGEST)($1.val));
384 write_exp_elt_opcode (OP_LONG); }
389 parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
390 write_exp_elt_opcode (OP_LONG);
391 write_exp_elt_type (val.typed_val.type);
392 write_exp_elt_longcst ((LONGEST)val.typed_val.val);
393 write_exp_elt_opcode (OP_LONG); }
397 { write_exp_elt_opcode (OP_DOUBLE);
398 write_exp_elt_type (builtin_type_f_real_s8);
399 write_exp_elt_dblcst ($1);
400 write_exp_elt_opcode (OP_DOUBLE); }
407 { write_exp_elt_opcode (OP_LAST);
408 write_exp_elt_longcst ((LONGEST) $1);
409 write_exp_elt_opcode (OP_LAST); }
413 { write_exp_elt_opcode (OP_REGISTER);
414 write_exp_elt_longcst ((LONGEST) $1);
415 write_exp_elt_opcode (OP_REGISTER); }
419 { write_exp_elt_opcode (OP_INTERNALVAR);
420 write_exp_elt_intern ($1);
421 write_exp_elt_opcode (OP_INTERNALVAR); }
424 exp : SIZEOF '(' type ')' %prec UNARY
425 { write_exp_elt_opcode (OP_LONG);
426 write_exp_elt_type (builtin_type_f_integer);
427 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
428 write_exp_elt_opcode (OP_LONG); }
431 exp : BOOLEAN_LITERAL
432 { write_exp_elt_opcode (OP_BOOL);
433 write_exp_elt_longcst ((LONGEST) $1);
434 write_exp_elt_opcode (OP_BOOL);
440 write_exp_elt_opcode (OP_STRING);
441 write_exp_string ($1);
442 write_exp_elt_opcode (OP_STRING);
446 variable: name_not_typename
447 { struct symbol *sym = $1.sym;
451 if (symbol_read_needs_frame (sym))
453 if (innermost_block == 0 ||
454 contained_in (block_found,
456 innermost_block = block_found;
458 write_exp_elt_opcode (OP_VAR_VALUE);
459 /* We want to use the selected frame, not
460 another more inner frame which happens to
461 be in the same block. */
462 write_exp_elt_block (NULL);
463 write_exp_elt_sym (sym);
464 write_exp_elt_opcode (OP_VAR_VALUE);
469 struct minimal_symbol *msymbol;
470 register char *arg = copy_name ($1.stoken);
472 msymbol = lookup_minimal_symbol (arg, NULL);
475 write_exp_msymbol (msymbol,
476 lookup_function_type (builtin_type_int),
479 else if (!have_full_symbols () && !have_partial_symbols ())
480 error ("No symbol table is loaded. Use the \"file\" command.");
482 error ("No symbol \"%s\" in current context.",
483 copy_name ($1.stoken));
495 /* This is where the interesting stuff happens. */
498 struct type *follow_type = $1;
499 struct type *range_type;
508 follow_type = lookup_pointer_type (follow_type);
511 follow_type = lookup_reference_type (follow_type);
514 array_size = pop_type_int ();
515 if (array_size != -1)
518 create_range_type ((struct type *) NULL,
519 builtin_type_f_integer, 0,
522 create_array_type ((struct type *) NULL,
523 follow_type, range_type);
526 follow_type = lookup_pointer_type (follow_type);
529 follow_type = lookup_function_type (follow_type);
537 { push_type (tp_pointer); $$ = 0; }
539 { push_type (tp_pointer); $$ = $2; }
541 { push_type (tp_reference); $$ = 0; }
543 { push_type (tp_reference); $$ = $2; }
547 direct_abs_decl: '(' abs_decl ')'
549 | direct_abs_decl func_mod
550 { push_type (tp_function); }
552 { push_type (tp_function); }
557 | '(' nonempty_typelist ')'
558 { free ((PTR)$2); $$ = 0; }
561 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
565 { $$ = builtin_type_f_integer; }
567 { $$ = builtin_type_f_integer_s2; }
569 { $$ = builtin_type_f_character; }
571 { $$ = builtin_type_f_logical;}
573 { $$ = builtin_type_f_logical_s2;}
575 { $$ = builtin_type_f_logical_s1;}
577 { $$ = builtin_type_f_real;}
579 { $$ = builtin_type_f_real_s8;}
581 { $$ = builtin_type_f_real_s16;}
583 { $$ = builtin_type_f_complex_s8;}
584 | COMPLEX_S16_KEYWORD
585 { $$ = builtin_type_f_complex_s16;}
586 | COMPLEX_S32_KEYWORD
587 { $$ = builtin_type_f_complex_s32;}
595 { $$ = (struct type **) malloc (sizeof (struct type *) * 2);
596 $<ivec>$[0] = 1; /* Number of types in vector */
599 | nonempty_typelist ',' type
600 { int len = sizeof (struct type *) * (++($<ivec>1[0]) + 1);
601 $$ = (struct type **) realloc ((char *) $1, len);
602 $$[$<ivec>$[0]] = $3;
614 name_not_typename : NAME
615 /* These would be useful if name_not_typename was useful, but it is just
616 a fake for "variable", so these cause reduce/reduce conflicts because
617 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
618 =exp) or just an exp. If name_not_typename was ever used in an lvalue
619 context where only a name could occur, this might be useful.
626 /* Take care of parsing a number (anything that starts with a digit).
627 Set yylval and return the token type; update lexptr.
628 LEN is the number of characters in it. */
630 /*** Needs some error checking for the float case ***/
633 parse_number (p, len, parsed_float, putithere)
639 register LONGEST n = 0;
640 register LONGEST prevn = 0;
643 register int base = input_radix;
646 unsigned LONGEST high_bit;
647 struct type *signed_type;
648 struct type *unsigned_type;
652 /* It's a float since it contains a point or an exponent. */
653 /* [dD] is not understood as an exponent by atof, change it to 'e'. */
657 for (tmp2 = tmp; *tmp2; ++tmp2)
658 if (*tmp2 == 'd' || *tmp2 == 'D')
660 putithere->dval = atof (tmp);
665 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
699 if (c >= 'A' && c <= 'Z')
701 if (c != 'l' && c != 'u')
703 if (c >= '0' && c <= '9')
707 if (base > 10 && c >= 'a' && c <= 'f')
708 n += i = c - 'a' + 10;
709 else if (len == 0 && c == 'l')
711 else if (len == 0 && c == 'u')
714 return ERROR; /* Char not a digit */
717 return ERROR; /* Invalid digit in this base */
719 /* Portably test for overflow (only works for nonzero values, so make
720 a second check for zero). */
721 if ((prevn >= n) && n != 0)
722 unsigned_p=1; /* Try something unsigned */
723 /* If range checking enabled, portably test for unsigned overflow. */
724 if (RANGE_CHECK && n != 0)
726 if ((unsigned_p && (unsigned)prevn >= (unsigned)n))
727 range_error("Overflow on numeric constant.");
732 /* If the number is too big to be an int, or it's got an l suffix
733 then it's a long. Work out if this has to be a long by
734 shifting right and and seeing if anything remains, and the
735 target int size is different to the target long size.
737 In the expression below, we could have tested
738 (n >> TARGET_INT_BIT)
739 to see if it was zero,
740 but too many compilers warn about that, when ints and longs
741 are the same size. So we shift it twice, with fewer bits
742 each time, for the same result. */
744 if ((TARGET_INT_BIT != TARGET_LONG_BIT
745 && ((n >> 2) >> (TARGET_INT_BIT-2))) /* Avoid shift warning */
748 high_bit = ((unsigned LONGEST)1) << (TARGET_LONG_BIT-1);
749 unsigned_type = builtin_type_unsigned_long;
750 signed_type = builtin_type_long;
754 high_bit = ((unsigned LONGEST)1) << (TARGET_INT_BIT-1);
755 unsigned_type = builtin_type_unsigned_int;
756 signed_type = builtin_type_int;
759 putithere->typed_val.val = n;
761 /* If the high bit of the worked out type is set then this number
762 has to be unsigned. */
764 if (unsigned_p || (n & high_bit))
765 putithere->typed_val.type = unsigned_type;
767 putithere->typed_val.type = signed_type;
776 enum exp_opcode opcode;
779 static const struct token dot_ops[] =
781 { ".and.", BOOL_AND, BINOP_END },
782 { ".AND.", BOOL_AND, BINOP_END },
783 { ".or.", BOOL_OR, BINOP_END },
784 { ".OR.", BOOL_OR, BINOP_END },
785 { ".not.", BOOL_NOT, BINOP_END },
786 { ".NOT.", BOOL_NOT, BINOP_END },
787 { ".eq.", EQUAL, BINOP_END },
788 { ".EQ.", EQUAL, BINOP_END },
789 { ".eqv.", EQUAL, BINOP_END },
790 { ".NEQV.", NOTEQUAL, BINOP_END },
791 { ".neqv.", NOTEQUAL, BINOP_END },
792 { ".EQV.", EQUAL, BINOP_END },
793 { ".ne.", NOTEQUAL, BINOP_END },
794 { ".NE.", NOTEQUAL, BINOP_END },
795 { ".le.", LEQ, BINOP_END },
796 { ".LE.", LEQ, BINOP_END },
797 { ".ge.", GEQ, BINOP_END },
798 { ".GE.", GEQ, BINOP_END },
799 { ".gt.", GREATERTHAN, BINOP_END },
800 { ".GT.", GREATERTHAN, BINOP_END },
801 { ".lt.", LESSTHAN, BINOP_END },
802 { ".LT.", LESSTHAN, BINOP_END },
806 struct f77_boolean_val
812 static const struct f77_boolean_val boolean_values[] =
821 static const struct token f77_keywords[] =
823 { "complex_16", COMPLEX_S16_KEYWORD, BINOP_END },
824 { "complex_32", COMPLEX_S32_KEYWORD, BINOP_END },
825 { "character", CHARACTER, BINOP_END },
826 { "integer_2", INT_S2_KEYWORD, BINOP_END },
827 { "logical_1", LOGICAL_S1_KEYWORD, BINOP_END },
828 { "logical_2", LOGICAL_S2_KEYWORD, BINOP_END },
829 { "complex_8", COMPLEX_S8_KEYWORD, BINOP_END },
830 { "integer", INT_KEYWORD, BINOP_END },
831 { "logical", LOGICAL_KEYWORD, BINOP_END },
832 { "real_16", REAL_S16_KEYWORD, BINOP_END },
833 { "complex", COMPLEX_S8_KEYWORD, BINOP_END },
834 { "sizeof", SIZEOF, BINOP_END },
835 { "real_8", REAL_S8_KEYWORD, BINOP_END },
836 { "real", REAL_KEYWORD, BINOP_END },
840 /* Implementation of a dynamically expandable buffer for processing input
841 characters acquired through lexptr and building a value to return in
842 yylval. Ripped off from ch-exp.y */
844 static char *tempbuf; /* Current buffer contents */
845 static int tempbufsize; /* Size of allocated buffer */
846 static int tempbufindex; /* Current index into buffer */
848 #define GROWBY_MIN_SIZE 64 /* Minimum amount to grow buffer by */
850 #define CHECKBUF(size) \
852 if (tempbufindex + (size) >= tempbufsize) \
854 growbuf_by_size (size); \
859 /* Grow the static temp buffer if necessary, including allocating the first one
863 growbuf_by_size (count)
868 growby = max (count, GROWBY_MIN_SIZE);
869 tempbufsize += growby;
871 tempbuf = (char *) malloc (tempbufsize);
873 tempbuf = (char *) realloc (tempbuf, tempbufsize);
876 /* Blatantly ripped off from ch-exp.y. This routine recognizes F77
879 Recognize a string literal. A string literal is a nonzero sequence
880 of characters enclosed in matching single quotes, except that
881 a single character inside single quotes is a character literal, which
882 we reject as a string literal. To embed the terminator character inside
883 a string, it is simply doubled (I.E. 'this''is''one''string') */
886 match_string_literal ()
888 char *tokptr = lexptr;
890 for (tempbufindex = 0, tokptr++; *tokptr != '\0'; tokptr++)
893 if (*tokptr == *lexptr)
895 if (*(tokptr + 1) == *lexptr)
900 tempbuf[tempbufindex++] = *tokptr;
902 if (*tokptr == '\0' /* no terminator */
903 || tempbufindex == 0) /* no string */
907 tempbuf[tempbufindex] = '\0';
908 yylval.sval.ptr = tempbuf;
909 yylval.sval.length = tempbufindex;
911 return STRING_LITERAL;
915 /* Read one token, getting characters through lexptr. */
922 unsigned int i,token;
929 /* First of all, let us make sure we are not dealing with the
930 special tokens .true. and .false. which evaluate to 1 and 0. */
934 for (i = 0; boolean_values[i].name != NULL; i++)
936 if STREQN (tokstart, boolean_values[i].name,
937 strlen (boolean_values[i].name))
939 lexptr += strlen (boolean_values[i].name);
940 yylval.lval = boolean_values[i].value;
941 return BOOLEAN_LITERAL;
946 /* See if it is a special .foo. operator */
948 for (i = 0; dot_ops[i].operator != NULL; i++)
949 if (STREQN (tokstart, dot_ops[i].operator, strlen (dot_ops[i].operator)))
951 lexptr += strlen (dot_ops[i].operator);
952 yylval.opcode = dot_ops[i].opcode;
953 return dot_ops[i].token;
956 switch (c = *tokstart)
968 token = match_string_literal ();
979 if (paren_depth == 0)
986 if (comma_terminates && paren_depth == 0)
992 /* Might be a floating point number. */
993 if (lexptr[1] < '0' || lexptr[1] > '9')
994 goto symbol; /* Nope, must be a symbol. */
995 /* FALL THRU into number case. */
1008 /* It's a number. */
1009 int got_dot = 0, got_e = 0, got_d = 0, toktype;
1010 register char *p = tokstart;
1011 int hex = input_radix > 10;
1013 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
1018 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
1026 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
1027 got_dot = got_e = 1;
1028 else if (!hex && !got_d && (*p == 'd' || *p == 'D'))
1029 got_dot = got_d = 1;
1030 else if (!hex && !got_dot && *p == '.')
1032 else if ((got_e && (p[-1] == 'e' || p[-1] == 'E'))
1033 || (got_d && (p[-1] == 'd' || p[-1] == 'D'))
1034 && (*p == '-' || *p == '+'))
1035 /* This is the sign of the exponent, not the end of the
1038 /* We will take any letters or digits. parse_number will
1039 complain if past the radix, or if L or U are not final. */
1040 else if ((*p < '0' || *p > '9')
1041 && ((*p < 'a' || *p > 'z')
1042 && (*p < 'A' || *p > 'Z')))
1045 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e|got_d,
1047 if (toktype == ERROR)
1049 char *err_copy = (char *) alloca (p - tokstart + 1);
1051 memcpy (err_copy, tokstart, p - tokstart);
1052 err_copy[p - tokstart] = 0;
1053 error ("Invalid number \"%s\".", err_copy);
1084 if (!(c == '_' || c == '$'
1085 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
1086 /* We must have come across a bad character (e.g. ';'). */
1087 error ("Invalid character '%c' in expression.", c);
1090 for (c = tokstart[namelen];
1091 (c == '_' || c == '$' || (c >= '0' && c <= '9')
1092 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));
1093 c = tokstart[++namelen]);
1095 /* The token "if" terminates the expression and is NOT
1096 removed from the input stream. */
1098 if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
1103 /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1)
1104 and $$digits (equivalent to $<-digits> if you could type that).
1105 Make token type LAST, and put the number (the digits) in yylval. */
1108 if (*tokstart == '$')
1110 register int negate = 0;
1113 /* Double dollar means negate the number and add -1 as well.
1114 Thus $$ alone means -1. */
1115 if (namelen >= 2 && tokstart[1] == '$')
1122 /* Just dollars (one or two) */
1123 yylval.lval = - negate;
1126 /* Is the rest of the token digits? */
1127 for (; c < namelen; c++)
1128 if (!(tokstart[c] >= '0' && tokstart[c] <= '9'))
1132 yylval.lval = atoi (tokstart + 1 + negate);
1134 yylval.lval = - yylval.lval;
1139 /* Handle tokens that refer to machine registers:
1140 $ followed by a register name. */
1142 if (*tokstart == '$') {
1143 for (c = 0; c < NUM_REGS; c++)
1144 if (namelen - 1 == strlen (reg_names[c])
1145 && STREQN (tokstart + 1, reg_names[c], namelen - 1))
1150 for (c = 0; c < num_std_regs; c++)
1151 if (namelen - 1 == strlen (std_regs[c].name)
1152 && STREQN (tokstart + 1, std_regs[c].name, namelen - 1))
1154 yylval.lval = std_regs[c].regnum;
1158 /* Catch specific keywords. */
1160 for (i = 0; f77_keywords[i].operator != NULL; i++)
1161 if (STREQN(tokstart, f77_keywords[i].operator,
1162 strlen(f77_keywords[i].operator)))
1164 /* lexptr += strlen(f77_keywords[i].operator); */
1165 yylval.opcode = f77_keywords[i].opcode;
1166 return f77_keywords[i].token;
1169 yylval.sval.ptr = tokstart;
1170 yylval.sval.length = namelen;
1172 /* Any other names starting in $ are debugger internal variables. */
1174 if (*tokstart == '$')
1176 yylval.ivar = lookup_internalvar (copy_name (yylval.sval) + 1);
1180 /* Use token-type TYPENAME for symbols that happen to be defined
1181 currently as names of types; NAME for other symbols.
1182 The caller is not constrained to care about the distinction. */
1184 char *tmp = copy_name (yylval.sval);
1186 int is_a_field_of_this = 0;
1189 sym = lookup_symbol (tmp, expression_context_block,
1191 current_language->la_language == language_cplus
1192 ? &is_a_field_of_this : NULL,
1194 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
1196 yylval.tsym.type = SYMBOL_TYPE (sym);
1199 if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0)
1202 /* Input names that aren't symbols but ARE valid hex numbers,
1203 when the input radix permits them, can be names or numbers
1204 depending on the parse. Note we support radixes > 16 here. */
1206 && ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10)
1207 || (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
1209 YYSTYPE newlval; /* Its value is ignored. */
1210 hextype = parse_number (tokstart, namelen, 0, &newlval);
1213 yylval.ssym.sym = sym;
1214 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1219 /* Any other kind of symbol */
1220 yylval.ssym.sym = sym;
1221 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1230 error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);