1 /* YACC grammar for Chill expressions, for GDB.
2 Copyright 1992, 1993, 1994 Free Software Foundation, Inc.
4 This file is part of GDB.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
20 /* Parse a Chill expression from text in a string,
21 and return the result as a struct expression pointer.
22 That structure contains arithmetic operations in reverse polish,
23 with constants represented by operations that are followed by special data.
24 See expression.h for the details of the format.
25 What is important here is that it can be built up sequentially
26 during the process of parsing; the lower levels of the tree always
27 come first in the result.
29 Note that malloc's and realloc's in this file are transformed to
30 xmalloc and xrealloc respectively by the same sed command in the
31 makefile that remaps any other malloc/realloc inserted by the parser
32 generator. Doing this with #defines and trying to control the interaction
33 with include files (<malloc.h> and <stdlib.h> for example) just became
34 too messy, particularly when such includes can be inserted at random
35 times by the parser generator.
37 Also note that the language accepted by this parser is more liberal
38 than the one accepted by an actual Chill compiler. For example, the
39 language rule that a simple name string can not be one of the reserved
40 simple name strings is not enforced (e.g "case" is not treated as a
41 reserved name). Another example is that Chill is a strongly typed
42 language, and certain expressions that violate the type constraints
43 may still be evaluated if gdb can do so in a meaningful manner, while
44 such expressions would be rejected by the compiler. The reason for
45 this more liberal behavior is the philosophy that the debugger
46 is intended to be a tool that is used by the programmer when things
47 go wrong, and as such, it should provide as few artificial barriers
48 to it's use as possible. If it can do something meaningful, even
49 something that violates language contraints that are enforced by the
50 compiler, it should do so without complaint.
59 #include "expression.h"
62 #include "parser-defs.h"
64 #include "bfd.h" /* Required by objfiles.h. */
65 #include "symfile.h" /* Required by objfiles.h. */
66 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
68 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
69 as well as gratuitiously global symbol names, so we can have multiple
70 yacc generated parsers in gdb. Note that these are only the variables
71 produced by yacc. If other parser generators (bison, byacc, etc) produce
72 additional global names that conflict at link time, then those parser
73 generators need to be fixed instead of adding those names to this list. */
75 #define yymaxdepth chill_maxdepth
76 #define yyparse chill_parse
77 #define yylex chill_lex
78 #define yyerror chill_error
79 #define yylval chill_lval
80 #define yychar chill_char
81 #define yydebug chill_debug
82 #define yypact chill_pact
85 #define yydef chill_def
86 #define yychk chill_chk
87 #define yypgo chill_pgo
88 #define yyact chill_act
89 #define yyexca chill_exca
90 #define yyerrflag chill_errflag
91 #define yynerrs chill_nerrs
95 #define yy_yys chill_yys
96 #define yystate chill_state
97 #define yytmp chill_tmp
99 #define yy_yyv chill_yyv
100 #define yyval chill_val
101 #define yylloc chill_lloc
102 #define yyreds chill_reds /* With YYDEBUG defined */
103 #define yytoks chill_toks /* With YYDEBUG defined */
106 #define YYDEBUG 0 /* Default to no yydebug support */
110 yyparse PARAMS ((void));
113 yylex PARAMS ((void));
116 yyerror PARAMS ((char *));
120 /* Although the yacc "value" of an expression is not used,
121 since the result is stored in the structure being created,
122 other node types do have values. */
127 unsigned LONGEST ulval;
137 struct symtoken ssym;
140 enum exp_opcode opcode;
141 struct internalvar *ivar;
147 %token <voidval> FIXME_01
148 %token <voidval> FIXME_02
149 %token <voidval> FIXME_03
150 %token <voidval> FIXME_04
151 %token <voidval> FIXME_05
152 %token <voidval> FIXME_06
153 %token <voidval> FIXME_07
154 %token <voidval> FIXME_08
155 %token <voidval> FIXME_09
156 %token <voidval> FIXME_10
157 %token <voidval> FIXME_11
158 %token <voidval> FIXME_12
159 %token <voidval> FIXME_13
160 %token <voidval> FIXME_14
161 %token <voidval> FIXME_15
162 %token <voidval> FIXME_16
163 %token <voidval> FIXME_17
164 %token <voidval> FIXME_18
165 %token <voidval> FIXME_19
166 %token <voidval> FIXME_20
167 %token <voidval> FIXME_21
168 %token <voidval> FIXME_22
169 %token <voidval> FIXME_24
170 %token <voidval> FIXME_25
171 %token <voidval> FIXME_26
172 %token <voidval> FIXME_27
173 %token <voidval> FIXME_28
174 %token <voidval> FIXME_29
175 %token <voidval> FIXME_30
177 %token <typed_val> INTEGER_LITERAL
178 %token <ulval> BOOLEAN_LITERAL
179 %token <typed_val> CHARACTER_LITERAL
180 %token <dval> FLOAT_LITERAL
181 %token <ssym> GENERAL_PROCEDURE_NAME
182 %token <ssym> LOCATION_NAME
183 %token <voidval> SET_LITERAL
184 %token <voidval> EMPTINESS_LITERAL
185 %token <sval> CHARACTER_STRING_LITERAL
186 %token <sval> BIT_STRING_LITERAL
187 %token <tsym> TYPENAME
188 %token <sval> FIELD_NAME
193 %token <voidval> CASE
195 %token <voidval> ESAC
196 %token <voidval> LOGIOR
197 %token <voidval> ORIF
198 %token <voidval> LOGXOR
199 %token <voidval> LOGAND
200 %token <voidval> ANDIF
202 %token <voidval> NOTEQUAL
212 %token <voidval> SLASH_SLASH
216 %token <voidval> POINTER
217 %token <voidval> RECEIVE
224 %token <voidval> THEN
225 %token <voidval> ELSE
227 %token <voidval> ELSIF
228 %token <voidval> ILLEGAL_TOKEN
230 %token <voidval> PRED
231 %token <voidval> SUCC
233 %token <voidval> CARD
234 %token <voidval> MAX_TOKEN
235 %token <voidval> MIN_TOKEN
236 %token <voidval> SIZE
237 %token <voidval> UPPER
238 %token <voidval> LOWER
239 %token <voidval> LENGTH
241 /* Tokens which are not Chill tokens used in expressions, but rather GDB
242 specific things that we recognize in the same context as Chill tokens
243 (register names for example). */
245 %token <lval> GDB_REGNAME /* Machine register name */
246 %token <lval> GDB_LAST /* Value history */
247 %token <ivar> GDB_VARIABLE /* Convenience variable */
248 %token <voidval> GDB_ASSIGNMENT /* Assign value to somewhere */
250 %type <voidval> access_name
251 %type <voidval> primitive_value
252 %type <voidval> value_name
253 %type <voidval> literal
254 %type <voidval> tuple
255 %type <voidval> slice
256 %type <voidval> expression_conversion
257 %type <voidval> value_procedure_call
258 %type <voidval> value_built_in_routine_call
259 %type <voidval> chill_value_built_in_routine_call
260 %type <voidval> start_expression
261 %type <voidval> zero_adic_operator
262 %type <voidval> parenthesised_expression
263 %type <voidval> value
264 %type <voidval> undefined_value
265 %type <voidval> expression
266 %type <voidval> conditional_expression
267 %type <voidval> then_alternative
268 %type <voidval> else_alternative
269 %type <voidval> sub_expression
270 %type <voidval> value_case_alternative
271 %type <voidval> operand_0
272 %type <voidval> operand_1
273 %type <voidval> operand_2
274 %type <voidval> operand_3
275 %type <voidval> operand_4
276 %type <voidval> operand_5
277 %type <voidval> operand_6
278 %type <voidval> synonym_name
279 %type <voidval> value_enumeration_name
280 %type <voidval> value_do_with_name
281 %type <voidval> value_receive_name
282 %type <voidval> expression_list
283 %type <tval> mode_argument
284 %type <voidval> upper_lower_argument
285 %type <voidval> length_argument
286 %type <voidval> array_mode_name
287 %type <voidval> string_mode_name
288 %type <voidval> variant_structure_mode_name
289 %type <voidval> boolean_expression
290 %type <voidval> case_selector_list
291 %type <voidval> subexpression
292 %type <voidval> case_label_specification
293 %type <voidval> buffer_location
294 %type <voidval> single_assignment_action
295 %type <tsym> mode_name
304 { write_exp_elt_opcode(OP_TYPE);
305 write_exp_elt_type($1.type);
306 write_exp_elt_opcode(OP_TYPE);}
319 undefined_value : FIXME_01
327 access_name : LOCATION_NAME
329 write_exp_elt_opcode (OP_VAR_VALUE);
330 write_exp_elt_block (NULL);
331 write_exp_elt_sym ($1.sym);
332 write_exp_elt_opcode (OP_VAR_VALUE);
334 | GDB_LAST /* gdb specific */
336 write_exp_elt_opcode (OP_LAST);
337 write_exp_elt_longcst ($1);
338 write_exp_elt_opcode (OP_LAST);
340 | GDB_REGNAME /* gdb specific */
342 write_exp_elt_opcode (OP_REGISTER);
343 write_exp_elt_longcst ($1);
344 write_exp_elt_opcode (OP_REGISTER);
346 | GDB_VARIABLE /* gdb specific */
348 write_exp_elt_opcode (OP_INTERNALVAR);
349 write_exp_elt_intern ($1);
350 write_exp_elt_opcode (OP_INTERNALVAR);
360 expression_list : expression
364 | expression_list ',' expression
370 maybe_expression_list: /* EMPTY */
380 primitive_value_lparen: primitive_value '('
381 /* This is to save the value of arglist_len
382 being accumulated for each dimension. */
383 { start_arglist (); }
387 { $$ = end_arglist (); }
392 | primitive_value_lparen maybe_expression_list rparen
394 write_exp_elt_opcode (MULTI_SUBSCRIPT);
395 write_exp_elt_longcst ($3);
396 write_exp_elt_opcode (MULTI_SUBSCRIPT);
398 | primitive_value FIELD_NAME
399 { write_exp_elt_opcode (STRUCTOP_STRUCT);
400 write_exp_string ($2);
401 write_exp_elt_opcode (STRUCTOP_STRUCT);
403 | primitive_value POINTER
405 write_exp_elt_opcode (UNOP_IND);
423 | expression_conversion
427 | value_procedure_call
431 | value_built_in_routine_call
443 | parenthesised_expression
451 value_name : synonym_name
455 | value_enumeration_name
467 | GENERAL_PROCEDURE_NAME
469 write_exp_elt_opcode (OP_VAR_VALUE);
470 write_exp_elt_block (NULL);
471 write_exp_elt_sym ($1.sym);
472 write_exp_elt_opcode (OP_VAR_VALUE);
478 literal : INTEGER_LITERAL
480 write_exp_elt_opcode (OP_LONG);
481 write_exp_elt_type ($1.type);
482 write_exp_elt_longcst ((LONGEST) ($1.val));
483 write_exp_elt_opcode (OP_LONG);
487 write_exp_elt_opcode (OP_BOOL);
488 write_exp_elt_longcst ((LONGEST) $1);
489 write_exp_elt_opcode (OP_BOOL);
493 write_exp_elt_opcode (OP_LONG);
494 write_exp_elt_type ($1.type);
495 write_exp_elt_longcst ((LONGEST) ($1.val));
496 write_exp_elt_opcode (OP_LONG);
500 write_exp_elt_opcode (OP_DOUBLE);
501 write_exp_elt_type (builtin_type_double);
502 write_exp_elt_dblcst ($1);
503 write_exp_elt_opcode (OP_DOUBLE);
511 struct type *void_ptr_type
512 = lookup_pointer_type (builtin_type_void);
513 write_exp_elt_opcode (OP_LONG);
514 write_exp_elt_type (void_ptr_type);
515 write_exp_elt_longcst (0);
516 write_exp_elt_opcode (OP_LONG);
518 | CHARACTER_STRING_LITERAL
520 write_exp_elt_opcode (OP_STRING);
521 write_exp_string ($1);
522 write_exp_elt_opcode (OP_STRING);
526 write_exp_elt_opcode (OP_BITSTRING);
527 write_exp_bitstring ($1);
528 write_exp_elt_opcode (OP_BITSTRING);
534 tuple_element : expression
535 | named_record_element
538 named_record_element: FIELD_NAME ',' named_record_element
539 { write_exp_elt_opcode (OP_LABELED);
540 write_exp_string ($1);
541 write_exp_elt_opcode (OP_LABELED);
543 | FIELD_NAME ':' expression
544 { write_exp_elt_opcode (OP_LABELED);
545 write_exp_string ($1);
546 write_exp_elt_opcode (OP_LABELED);
550 tuple_elements : tuple_element
554 | tuple_elements ',' tuple_element
560 maybe_tuple_elements : tuple_elements
565 { start_arglist (); }
566 maybe_tuple_elements ']'
568 write_exp_elt_opcode (OP_ARRAY);
569 write_exp_elt_longcst ((LONGEST) 0);
570 write_exp_elt_longcst ((LONGEST) end_arglist () - 1);
571 write_exp_elt_opcode (OP_ARRAY);
575 { start_arglist (); }
576 maybe_tuple_elements ']'
578 write_exp_elt_opcode (OP_ARRAY);
579 write_exp_elt_longcst ((LONGEST) 0);
580 write_exp_elt_longcst ((LONGEST) end_arglist () - 1);
581 write_exp_elt_opcode (OP_ARRAY);
583 write_exp_elt_opcode (UNOP_CAST);
584 write_exp_elt_type ($1.type);
585 write_exp_elt_opcode (UNOP_CAST);
593 slice: primitive_value_lparen expression ':' expression rparen
595 write_exp_elt_opcode (TERNOP_SLICE);
597 | primitive_value_lparen expression UP expression rparen
599 write_exp_elt_opcode (TERNOP_SLICE_COUNT);
605 expression_conversion: mode_name parenthesised_expression
607 write_exp_elt_opcode (UNOP_CAST);
608 write_exp_elt_type ($1.type);
609 write_exp_elt_opcode (UNOP_CAST);
615 value_procedure_call: FIXME_05
623 value_built_in_routine_call: chill_value_built_in_routine_call
631 start_expression: FIXME_06
634 } /* Not in GNU-Chill */
639 zero_adic_operator: FIXME_07
647 parenthesised_expression: '(' expression ')'
655 expression : operand_0
659 | single_assignment_action
663 | conditional_expression
669 conditional_expression : IF boolean_expression then_alternative else_alternative FI
673 | CASE case_selector_list OF value_case_alternative ELSE sub_expression ESAC
679 then_alternative: THEN subexpression
685 else_alternative: ELSE subexpression
689 | ELSIF boolean_expression then_alternative else_alternative
695 sub_expression : expression
701 value_case_alternative: case_label_specification ':' sub_expression ';'
709 operand_0 : operand_1
713 | operand_0 LOGIOR operand_1
715 write_exp_elt_opcode (BINOP_BITWISE_IOR);
717 | operand_0 ORIF operand_1
721 | operand_0 LOGXOR operand_1
723 write_exp_elt_opcode (BINOP_BITWISE_XOR);
729 operand_1 : operand_2
733 | operand_1 LOGAND operand_2
735 write_exp_elt_opcode (BINOP_BITWISE_AND);
737 | operand_1 ANDIF operand_2
745 operand_2 : operand_3
749 | operand_2 '=' operand_3
751 write_exp_elt_opcode (BINOP_EQUAL);
753 | operand_2 NOTEQUAL operand_3
755 write_exp_elt_opcode (BINOP_NOTEQUAL);
757 | operand_2 '>' operand_3
759 write_exp_elt_opcode (BINOP_GTR);
761 | operand_2 GTR operand_3
763 write_exp_elt_opcode (BINOP_GEQ);
765 | operand_2 '<' operand_3
767 write_exp_elt_opcode (BINOP_LESS);
769 | operand_2 LEQ operand_3
771 write_exp_elt_opcode (BINOP_LEQ);
773 | operand_2 IN operand_3
775 write_exp_elt_opcode (BINOP_IN);
782 operand_3 : operand_4
786 | operand_3 '+' operand_4
788 write_exp_elt_opcode (BINOP_ADD);
790 | operand_3 '-' operand_4
792 write_exp_elt_opcode (BINOP_SUB);
794 | operand_3 SLASH_SLASH operand_4
796 write_exp_elt_opcode (BINOP_CONCAT);
802 operand_4 : operand_5
806 | operand_4 '*' operand_5
808 write_exp_elt_opcode (BINOP_MUL);
810 | operand_4 '/' operand_5
812 write_exp_elt_opcode (BINOP_DIV);
814 | operand_4 MOD operand_5
816 write_exp_elt_opcode (BINOP_MOD);
818 | operand_4 REM operand_5
820 write_exp_elt_opcode (BINOP_REM);
826 operand_5 : operand_6
832 write_exp_elt_opcode (UNOP_NEG);
836 write_exp_elt_opcode (UNOP_LOGICAL_NOT);
838 | parenthesised_expression literal
839 /* We require the string operand to be a literal, to avoid some
840 nasty parsing ambiguities. */
842 write_exp_elt_opcode (BINOP_CONCAT);
848 operand_6 : POINTER primitive_value
850 write_exp_elt_opcode (UNOP_ADDR);
852 | RECEIVE buffer_location
865 single_assignment_action :
866 primitive_value GDB_ASSIGNMENT value
868 write_exp_elt_opcode (BINOP_ASSIGN);
874 chill_value_built_in_routine_call :
875 NUM '(' expression ')'
879 | PRED '(' expression ')'
883 | SUCC '(' expression ')'
887 | ABS '(' expression ')'
891 | CARD '(' expression ')'
895 | MAX_TOKEN '(' expression ')'
899 | MIN_TOKEN '(' expression ')'
903 | SIZE '(' expression ')'
904 { write_exp_elt_opcode (UNOP_SIZEOF); }
905 | SIZE '(' mode_argument ')'
906 { write_exp_elt_opcode (OP_LONG);
907 write_exp_elt_type (builtin_type_int);
908 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
909 write_exp_elt_opcode (OP_LONG); }
910 | UPPER '(' upper_lower_argument ')'
914 | LOWER '(' upper_lower_argument ')'
918 | LENGTH '(' length_argument ')'
924 mode_argument : mode_name
928 | array_mode_name '(' expression ')'
932 | string_mode_name '(' expression ')'
936 | variant_structure_mode_name '(' expression_list ')'
945 upper_lower_argument : expression
955 length_argument : expression
961 /* Things which still need productions... */
963 array_mode_name : FIXME_08 { $$ = 0; }
964 string_mode_name : FIXME_09 { $$ = 0; }
965 variant_structure_mode_name: FIXME_10 { $$ = 0; }
966 synonym_name : FIXME_11 { $$ = 0; }
967 value_enumeration_name : FIXME_12 { $$ = 0; }
968 value_do_with_name : FIXME_13 { $$ = 0; }
969 value_receive_name : FIXME_14 { $$ = 0; }
970 boolean_expression : FIXME_26 { $$ = 0; }
971 case_selector_list : FIXME_27 { $$ = 0; }
972 subexpression : FIXME_28 { $$ = 0; }
973 case_label_specification: FIXME_29 { $$ = 0; }
974 buffer_location : FIXME_30 { $$ = 0; }
978 /* Implementation of a dynamically expandable buffer for processing input
979 characters acquired through lexptr and building a value to return in
982 static char *tempbuf; /* Current buffer contents */
983 static int tempbufsize; /* Size of allocated buffer */
984 static int tempbufindex; /* Current index into buffer */
986 #define GROWBY_MIN_SIZE 64 /* Minimum amount to grow buffer by */
988 #define CHECKBUF(size) \
990 if (tempbufindex + (size) >= tempbufsize) \
992 growbuf_by_size (size); \
996 /* Grow the static temp buffer if necessary, including allocating the first one
1000 growbuf_by_size (count)
1005 growby = max (count, GROWBY_MIN_SIZE);
1006 tempbufsize += growby;
1007 if (tempbuf == NULL)
1009 tempbuf = (char *) malloc (tempbufsize);
1013 tempbuf = (char *) realloc (tempbuf, tempbufsize);
1017 /* Try to consume a simple name string token. If successful, returns
1018 a pointer to a nullbyte terminated copy of the name that can be used
1019 in symbol table lookups. If not successful, returns NULL. */
1022 match_simple_name_string ()
1024 char *tokptr = lexptr;
1026 if (isalpha (*tokptr) || *tokptr == '_')
1031 } while (isalnum (*tokptr) || (*tokptr == '_'));
1032 yylval.sval.ptr = lexptr;
1033 yylval.sval.length = tokptr - lexptr;
1035 result = copy_name (yylval.sval);
1041 /* Start looking for a value composed of valid digits as set by the base
1042 in use. Note that '_' characters are valid anywhere, in any quantity,
1043 and are simply ignored. Since we must find at least one valid digit,
1044 or reject this token as an integer literal, we keep track of how many
1045 digits we have encountered. */
1048 decode_integer_value (base, tokptrptr, ivalptr)
1053 char *tokptr = *tokptrptr;
1057 while (*tokptr != '\0')
1061 temp = tolower (temp);
1067 case '0': case '1': case '2': case '3': case '4':
1068 case '5': case '6': case '7': case '8': case '9':
1071 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
1087 /* Found something not in domain for current base. */
1088 tokptr--; /* Unconsume what gave us indigestion. */
1093 /* If we didn't find any digits, then we don't have a valid integer
1094 value, so reject the entire token. Otherwise, update the lexical
1095 scan pointer, and return non-zero for success. */
1103 *tokptrptr = tokptr;
1109 decode_integer_literal (valptr, tokptrptr)
1113 char *tokptr = *tokptrptr;
1116 int explicit_base = 0;
1118 /* Look for an explicit base specifier, which is optional. */
1151 /* If we found an explicit base ensure that the character after the
1152 explicit base is a single quote. */
1154 if (explicit_base && (*tokptr++ != '\''))
1159 /* Attempt to decode whatever follows as an integer value in the
1160 indicated base, updating the token pointer in the process and
1161 computing the value into ival. Also, if we have an explicit
1162 base, then the next character must not be a single quote, or we
1163 have a bitstring literal, so reject the entire token in this case.
1164 Otherwise, update the lexical scan pointer, and return non-zero
1167 if (!decode_integer_value (base, &tokptr, &ival))
1171 else if (explicit_base && (*tokptr == '\''))
1178 *tokptrptr = tokptr;
1183 /* If it wasn't for the fact that floating point values can contain '_'
1184 characters, we could just let strtod do all the hard work by letting it
1185 try to consume as much of the current token buffer as possible and
1186 find a legal conversion. Unfortunately we need to filter out the '_'
1187 characters before calling strtod, which we do by copying the other
1188 legal chars to a local buffer to be converted. However since we also
1189 need to keep track of where the last unconsumed character in the input
1190 buffer is, we have transfer only as many characters as may compose a
1191 legal floating point value. */
1194 match_float_literal ()
1196 char *tokptr = lexptr;
1200 extern double strtod ();
1202 /* Make local buffer in which to build the string to convert. This is
1203 required because underscores are valid in chill floating point numbers
1204 but not in the string passed to strtod to convert. The string will be
1205 no longer than our input string. */
1207 copy = buf = (char *) alloca (strlen (tokptr) + 1);
1209 /* Transfer all leading digits to the conversion buffer, discarding any
1212 while (isdigit (*tokptr) || *tokptr == '_')
1221 /* Now accept either a '.', or one of [eEdD]. Dot is legal regardless
1222 of whether we found any leading digits, and we simply accept it and
1223 continue on to look for the fractional part and/or exponent. One of
1224 [eEdD] is legal only if we have seen digits, and means that there
1225 is no fractional part. If we find neither of these, then this is
1226 not a floating point number, so return failure. */
1231 /* Accept and then look for fractional part and/or exponent. */
1244 goto collect_exponent;
1252 /* We found a '.', copy any fractional digits to the conversion buffer, up
1253 to the first nondigit, non-underscore character. */
1255 while (isdigit (*tokptr) || *tokptr == '_')
1264 /* Look for an exponent, which must start with one of [eEdD]. If none
1265 is found, jump directly to trying to convert what we have collected
1282 /* Accept an optional '-' or '+' following one of [eEdD]. */
1285 if (*tokptr == '+' || *tokptr == '-')
1287 *copy++ = *tokptr++;
1290 /* Now copy an exponent into the conversion buffer. Note that at the
1291 moment underscores are *not* allowed in exponents. */
1293 while (isdigit (*tokptr))
1295 *copy++ = *tokptr++;
1298 /* If we transfered any chars to the conversion buffer, try to interpret its
1299 contents as a floating point value. If any characters remain, then we
1300 must not have a valid floating point string. */
1306 dval = strtod (buf, ©);
1311 return (FLOAT_LITERAL);
1317 /* Recognize a string literal. A string literal is a sequence
1318 of characters enclosed in matching single or double quotes, except that
1319 a single character inside single quotes is a character literal, which
1320 we reject as a string literal. To embed the terminator character inside
1321 a string, it is simply doubled (I.E. "this""is""one""string") */
1324 match_string_literal ()
1326 char *tokptr = lexptr;
1328 for (tempbufindex = 0, tokptr++; *tokptr != '\0'; tokptr++)
1331 if (*tokptr == *lexptr)
1333 if (*(tokptr + 1) == *lexptr)
1342 tempbuf[tempbufindex++] = *tokptr;
1344 if (*tokptr == '\0' /* no terminator */
1345 || (tempbufindex == 1 && *tokptr == '\'')) /* char literal */
1351 tempbuf[tempbufindex] = '\0';
1352 yylval.sval.ptr = tempbuf;
1353 yylval.sval.length = tempbufindex;
1355 return (CHARACTER_STRING_LITERAL);
1359 /* Recognize a character literal. A character literal is single character
1360 or a control sequence, enclosed in single quotes. A control sequence
1361 is a comma separated list of one or more integer literals, enclosed
1362 in parenthesis and introduced with a circumflex character.
1364 EX: 'a' '^(7)' '^(7,8)'
1366 As a GNU chill extension, the syntax C'xx' is also recognized as a
1367 character literal, where xx is a hex value for the character.
1369 Note that more than a single character, enclosed in single quotes, is
1372 Also note that the control sequence form is not in GNU Chill since it
1373 is ambiguous with the string literal form using single quotes. I.E.
1374 is '^(7)' a character literal or a string literal. In theory it it
1375 possible to tell by context, but GNU Chill doesn't accept the control
1376 sequence form, so neither do we (for now the code is disabled).
1378 Returns CHARACTER_LITERAL if a match is found.
1382 match_character_literal ()
1384 char *tokptr = lexptr;
1387 if ((*tokptr == 'c' || *tokptr == 'C') && (*(tokptr + 1) == '\''))
1389 /* We have a GNU chill extension form, so skip the leading "C'",
1390 decode the hex value, and then ensure that we have a trailing
1391 single quote character. */
1393 if (!decode_integer_value (16, &tokptr, &ival) || (*tokptr != '\''))
1399 else if (*tokptr == '\'')
1403 /* Determine which form we have, either a control sequence or the
1404 single character form. */
1406 if ((*tokptr == '^') && (*(tokptr + 1) == '('))
1408 #if 0 /* Disable, see note above. -fnf */
1409 /* Match and decode a control sequence. Return zero if we don't
1410 find a valid integer literal, or if the next unconsumed character
1411 after the integer literal is not the trailing ')'.
1412 FIXME: We currently don't handle the multiple integer literal
1415 if (!decode_integer_literal (&ival, &tokptr) || (*tokptr++ != ')'))
1428 /* The trailing quote has not yet been consumed. If we don't find
1429 it, then we have no match. */
1431 if (*tokptr++ != '\'')
1438 /* Not a character literal. */
1441 yylval.typed_val.val = ival;
1442 yylval.typed_val.type = builtin_type_chill_char;
1444 return (CHARACTER_LITERAL);
1447 /* Recognize an integer literal, as specified in Z.200 sec 5.2.4.2.
1448 Note that according to 5.2.4.2, a single "_" is also a valid integer
1449 literal, however GNU-chill requires there to be at least one "digit"
1450 in any integer literal. */
1453 match_integer_literal ()
1455 char *tokptr = lexptr;
1458 if (!decode_integer_literal (&ival, &tokptr))
1464 yylval.typed_val.val = ival;
1465 yylval.typed_val.type = builtin_type_int;
1467 return (INTEGER_LITERAL);
1471 /* Recognize a bit-string literal, as specified in Z.200 sec 5.2.4.8
1472 Note that according to 5.2.4.8, a single "_" is also a valid bit-string
1473 literal, however GNU-chill requires there to be at least one "digit"
1474 in any bit-string literal. */
1477 match_bitstring_literal ()
1479 register char *tokptr = lexptr;
1489 /* Look for the required explicit base specifier. */
1510 /* Ensure that the character after the explicit base is a single quote. */
1512 if (*tokptr++ != '\'')
1517 while (*tokptr != '\0' && *tokptr != '\'')
1520 if (isupper (digit))
1521 digit = tolower (digit);
1527 case '0': case '1': case '2': case '3': case '4':
1528 case '5': case '6': case '7': case '8': case '9':
1531 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
1539 if (digit >= 1 << bits_per_char)
1541 /* Found something not in domain for current base. */
1546 /* Extract bits from digit, packing them into the bitstring byte. */
1547 int k = TARGET_BYTE_ORDER == BIG_ENDIAN ? bits_per_char - 1 : 0;
1548 for (; TARGET_BYTE_ORDER == BIG_ENDIAN ? k >= 0 : k < bits_per_char;
1549 TARGET_BYTE_ORDER == BIG_ENDIAN ? k-- : k++)
1552 if (digit & (1 << k))
1554 tempbuf[tempbufindex] |=
1555 (TARGET_BYTE_ORDER == BIG_ENDIAN)
1556 ? (1 << (HOST_CHAR_BIT - 1 - bitoffset))
1560 if (bitoffset == HOST_CHAR_BIT)
1565 tempbuf[tempbufindex] = 0;
1571 /* Verify that we consumed everything up to the trailing single quote,
1572 and that we found some bits (IE not just underbars). */
1574 if (*tokptr++ != '\'')
1580 yylval.sval.ptr = tempbuf;
1581 yylval.sval.length = bitcount;
1583 return (BIT_STRING_LITERAL);
1587 /* Recognize tokens that start with '$'. These include:
1589 $regname A native register name or a "standard
1591 Return token GDB_REGNAME.
1593 $variable A convenience variable with a name chosen
1595 Return token GDB_VARIABLE.
1597 $digits Value history with index <digits>, starting
1598 from the first value which has index 1.
1601 $$digits Value history with index <digits> relative
1602 to the last value. I.E. $$0 is the last
1603 value, $$1 is the one previous to that, $$2
1604 is the one previous to $$1, etc.
1605 Return token GDB_LAST.
1607 $ | $0 | $$0 The last value in the value history.
1608 Return token GDB_LAST.
1610 $$ An abbreviation for the second to the last
1611 value in the value history, I.E. $$1
1612 Return token GDB_LAST.
1614 Note that we currently assume that register names and convenience
1615 variables follow the convention of starting with a letter or '_'.
1620 match_dollar_tokens ()
1628 /* We will always have a successful match, even if it is just for
1629 a single '$', the abbreviation for $$0. So advance lexptr. */
1633 if (*tokptr == '_' || isalpha (*tokptr))
1635 /* Look for a match with a native register name, usually something
1636 like "r0" for example. */
1638 for (regno = 0; regno < NUM_REGS; regno++)
1640 namelength = strlen (reg_names[regno]);
1641 if (STREQN (tokptr, reg_names[regno], namelength)
1642 && !isalnum (tokptr[namelength]))
1644 yylval.lval = regno;
1645 lexptr += namelength;
1646 return (GDB_REGNAME);
1650 /* Look for a match with a standard register name, usually something
1651 like "pc", which gdb always recognizes as the program counter
1652 regardless of what the native register name is. */
1654 for (regno = 0; regno < num_std_regs; regno++)
1656 namelength = strlen (std_regs[regno].name);
1657 if (STREQN (tokptr, std_regs[regno].name, namelength)
1658 && !isalnum (tokptr[namelength]))
1660 yylval.lval = std_regs[regno].regnum;
1661 lexptr += namelength;
1662 return (GDB_REGNAME);
1666 /* Attempt to match against a convenience variable. Note that
1667 this will always succeed, because if no variable of that name
1668 already exists, the lookup_internalvar will create one for us.
1669 Also note that both lexptr and tokptr currently point to the
1670 start of the input string we are trying to match, and that we
1671 have already tested the first character for non-numeric, so we
1672 don't have to treat it specially. */
1674 while (*tokptr == '_' || isalnum (*tokptr))
1678 yylval.sval.ptr = lexptr;
1679 yylval.sval.length = tokptr - lexptr;
1680 yylval.ivar = lookup_internalvar (copy_name (yylval.sval));
1682 return (GDB_VARIABLE);
1685 /* Since we didn't match against a register name or convenience
1686 variable, our only choice left is a history value. */
1700 /* Attempt to decode more characters as an integer value giving
1701 the index in the history list. If successful, the value will
1702 overwrite ival (currently 0 or 1), and if not, ival will be
1703 left alone, which is good since it is currently correct for
1704 the '$' or '$$' case. */
1706 decode_integer_literal (&ival, &tokptr);
1707 yylval.lval = negate ? -ival : ival;
1718 static const struct token idtokentab[] =
1720 { "length", LENGTH },
1731 { "max", MAX_TOKEN },
1732 { "min", MIN_TOKEN },
1741 { "null", EMPTINESS_LITERAL }
1744 static const struct token tokentab2[] =
1746 { ":=", GDB_ASSIGNMENT },
1747 { "//", SLASH_SLASH },
1754 /* Read one token, getting characters through lexptr. */
1755 /* This is where we will check to make sure that the language and the
1756 operators used are compatible. */
1766 /* Skip over any leading whitespace. */
1767 while (isspace (*lexptr))
1771 /* Look for special single character cases which can't be the first
1772 character of some other multicharacter token. */
1789 /* Look for characters which start a particular kind of multicharacter
1790 token, such as a character literal, register name, convenience
1791 variable name, string literal, etc. */
1796 /* First try to match a string literal, which is any
1797 sequence of characters enclosed in matching single or double
1798 quotes, except that a single character inside single quotes
1799 is a character literal, so we have to catch that case also. */
1800 token = match_string_literal ();
1805 if (*lexptr == '\'')
1807 token = match_character_literal ();
1816 token = match_character_literal ();
1823 token = match_dollar_tokens ();
1830 /* See if it is a special token of length 2. */
1831 for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++)
1833 if (STREQN (lexptr, tokentab2[i].operator, 2))
1836 return (tokentab2[i].token);
1839 /* Look for single character cases which which could be the first
1840 character of some other multicharacter token, but aren't, or we
1841 would already have found it. */
1851 /* Look for a float literal before looking for an integer literal, so
1852 we match as much of the input stream as possible. */
1853 token = match_float_literal ();
1858 token = match_bitstring_literal ();
1863 token = match_integer_literal ();
1869 /* Try to match a simple name string, and if a match is found, then
1870 further classify what sort of name it is and return an appropriate
1871 token. Note that attempting to match a simple name string consumes
1872 the token from lexptr, so we can't back out if we later find that
1873 we can't classify what sort of name it is. */
1875 inputname = match_simple_name_string ();
1877 if (inputname != NULL)
1879 char *simplename = (char*) alloca (strlen (inputname) + 1);
1881 char *dptr = simplename, *sptr = inputname;
1882 for (; *sptr; sptr++)
1883 *dptr++ = isupper (*sptr) ? tolower(*sptr) : *sptr;
1886 /* See if it is a reserved identifier. */
1887 for (i = 0; i < sizeof (idtokentab) / sizeof (idtokentab[0]); i++)
1889 if (STREQ (simplename, idtokentab[i].operator))
1891 return (idtokentab[i].token);
1895 /* Look for other special tokens. */
1896 if (STREQ (simplename, "true"))
1899 return (BOOLEAN_LITERAL);
1901 if (STREQ (simplename, "false"))
1904 return (BOOLEAN_LITERAL);
1907 sym = lookup_symbol (inputname, expression_context_block,
1908 VAR_NAMESPACE, (int *) NULL,
1909 (struct symtab **) NULL);
1910 if (sym == NULL && strcmp (inputname, simplename) != 0)
1912 sym = lookup_symbol (simplename, expression_context_block,
1913 VAR_NAMESPACE, (int *) NULL,
1914 (struct symtab **) NULL);
1918 yylval.ssym.stoken.ptr = NULL;
1919 yylval.ssym.stoken.length = 0;
1920 yylval.ssym.sym = sym;
1921 yylval.ssym.is_a_field_of_this = 0; /* FIXME, C++'ism */
1922 switch (SYMBOL_CLASS (sym))
1925 /* Found a procedure name. */
1926 return (GENERAL_PROCEDURE_NAME);
1928 /* Found a global or local static variable. */
1929 return (LOCATION_NAME);
1934 case LOC_REGPARM_ADDR:
1938 case LOC_BASEREG_ARG:
1939 if (innermost_block == NULL
1940 || contained_in (block_found, innermost_block))
1942 innermost_block = block_found;
1944 return (LOCATION_NAME);
1948 return (LOCATION_NAME);
1951 yylval.tsym.type = SYMBOL_TYPE (sym);
1954 case LOC_CONST_BYTES:
1955 case LOC_OPTIMIZED_OUT:
1956 error ("Symbol \"%s\" names no location.", inputname);
1960 else if (!have_full_symbols () && !have_partial_symbols ())
1962 error ("No symbol table is loaded. Use the \"file\" command.");
1966 error ("No symbol \"%s\" in current context.", inputname);
1970 /* Catch single character tokens which are not part of some
1975 case '.': /* Not float for example. */
1977 while (isspace (*lexptr)) lexptr++;
1978 inputname = match_simple_name_string ();
1984 return (ILLEGAL_TOKEN);
1991 error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);