Commit | Line | Data |
---|---|---|
e58de8a2 | 1 | /* YACC grammar for Chill expressions, for GDB. |
ba47c66a | 2 | Copyright 1992, 1993, 1994 Free Software Foundation, Inc. |
e58de8a2 FF |
3 | |
4 | This file is part of GDB. | |
5 | ||
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. | |
10 | ||
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. | |
15 | ||
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. */ | |
19 | ||
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. | |
28 | ||
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. | |
36 | ||
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. | |
51 | ||
52 | */ | |
53 | ||
54 | %{ | |
55 | ||
e58de8a2 | 56 | #include "defs.h" |
ba47c66a | 57 | #include <string.h> |
00cea52f | 58 | #include <ctype.h> |
e58de8a2 FF |
59 | #include "expression.h" |
60 | #include "language.h" | |
61 | #include "value.h" | |
62 | #include "parser-defs.h" | |
22e39759 | 63 | #include "ch-lang.h" |
100f92e2 JK |
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 */ | |
e58de8a2 | 67 | |
19d0f3f4 FF |
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. */ | |
74 | ||
e58de8a2 FF |
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 | |
83 | #define yyr1 chill_r1 | |
84 | #define yyr2 chill_r2 | |
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 | |
4015bfb9 BK |
90 | #define yyerrflag chill_errflag |
91 | #define yynerrs chill_nerrs | |
e58de8a2 FF |
92 | #define yyps chill_ps |
93 | #define yypv chill_pv | |
94 | #define yys chill_s | |
95 | #define yy_yys chill_yys | |
96 | #define yystate chill_state | |
97 | #define yytmp chill_tmp | |
98 | #define yyv chill_v | |
99 | #define yy_yyv chill_yyv | |
100 | #define yyval chill_val | |
101 | #define yylloc chill_lloc | |
4015bfb9 BK |
102 | #define yyreds chill_reds /* With YYDEBUG defined */ |
103 | #define yytoks chill_toks /* With YYDEBUG defined */ | |
19d0f3f4 FF |
104 | |
105 | #ifndef YYDEBUG | |
106 | #define YYDEBUG 0 /* Default to no yydebug support */ | |
107 | #endif | |
108 | ||
109 | int | |
110 | yyparse PARAMS ((void)); | |
e58de8a2 FF |
111 | |
112 | static int | |
113 | yylex PARAMS ((void)); | |
114 | ||
22e39759 | 115 | void |
e58de8a2 FF |
116 | yyerror PARAMS ((char *)); |
117 | ||
e58de8a2 FF |
118 | %} |
119 | ||
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. */ | |
123 | ||
124 | %union | |
125 | { | |
126 | LONGEST lval; | |
127 | unsigned LONGEST ulval; | |
128 | struct { | |
129 | LONGEST val; | |
130 | struct type *type; | |
131 | } typed_val; | |
132 | double dval; | |
133 | struct symbol *sym; | |
134 | struct type *tval; | |
135 | struct stoken sval; | |
136 | struct ttype tsym; | |
137 | struct symtoken ssym; | |
138 | int voidval; | |
139 | struct block *bval; | |
140 | enum exp_opcode opcode; | |
141 | struct internalvar *ivar; | |
142 | ||
143 | struct type **tvec; | |
144 | int *ivec; | |
145 | } | |
146 | ||
2fcc38b8 FF |
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 | |
2fcc38b8 FF |
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 | |
e58de8a2 FF |
176 | |
177 | %token <typed_val> INTEGER_LITERAL | |
178 | %token <ulval> BOOLEAN_LITERAL | |
2e66cf7d | 179 | %token <typed_val> CHARACTER_LITERAL |
1188fbbf | 180 | %token <dval> FLOAT_LITERAL |
cbd1bdc3 FF |
181 | %token <ssym> GENERAL_PROCEDURE_NAME |
182 | %token <ssym> LOCATION_NAME | |
e58de8a2 FF |
183 | %token <voidval> SET_LITERAL |
184 | %token <voidval> EMPTINESS_LITERAL | |
c7da3ed3 | 185 | %token <sval> CHARACTER_STRING_LITERAL |
81028ab0 | 186 | %token <sval> BIT_STRING_LITERAL |
8a177da6 PB |
187 | %token <tsym> TYPENAME |
188 | %token <sval> FIELD_NAME | |
e58de8a2 | 189 | |
e58de8a2 FF |
190 | %token <voidval> '.' |
191 | %token <voidval> ';' | |
192 | %token <voidval> ':' | |
193 | %token <voidval> CASE | |
194 | %token <voidval> OF | |
195 | %token <voidval> ESAC | |
196 | %token <voidval> LOGIOR | |
197 | %token <voidval> ORIF | |
198 | %token <voidval> LOGXOR | |
199 | %token <voidval> LOGAND | |
200 | %token <voidval> ANDIF | |
201 | %token <voidval> '=' | |
202 | %token <voidval> NOTEQUAL | |
203 | %token <voidval> '>' | |
204 | %token <voidval> GTR | |
205 | %token <voidval> '<' | |
206 | %token <voidval> LEQ | |
207 | %token <voidval> IN | |
208 | %token <voidval> '+' | |
209 | %token <voidval> '-' | |
210 | %token <voidval> '*' | |
211 | %token <voidval> '/' | |
212 | %token <voidval> SLASH_SLASH | |
213 | %token <voidval> MOD | |
214 | %token <voidval> REM | |
215 | %token <voidval> NOT | |
216 | %token <voidval> POINTER | |
217 | %token <voidval> RECEIVE | |
e58de8a2 FF |
218 | %token <voidval> '[' |
219 | %token <voidval> ']' | |
220 | %token <voidval> '(' | |
221 | %token <voidval> ')' | |
222 | %token <voidval> UP | |
223 | %token <voidval> IF | |
224 | %token <voidval> THEN | |
225 | %token <voidval> ELSE | |
226 | %token <voidval> FI | |
227 | %token <voidval> ELSIF | |
228 | %token <voidval> ILLEGAL_TOKEN | |
81028ab0 FF |
229 | %token <voidval> NUM |
230 | %token <voidval> PRED | |
231 | %token <voidval> SUCC | |
232 | %token <voidval> ABS | |
233 | %token <voidval> CARD | |
57ffffe3 JG |
234 | %token <voidval> MAX_TOKEN |
235 | %token <voidval> MIN_TOKEN | |
81028ab0 FF |
236 | %token <voidval> SIZE |
237 | %token <voidval> UPPER | |
238 | %token <voidval> LOWER | |
239 | %token <voidval> LENGTH | |
e58de8a2 | 240 | |
45fe3db4 FF |
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). */ | |
244 | ||
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 */ | |
249 | ||
cbd1bdc3 | 250 | %type <voidval> access_name |
e58de8a2 | 251 | %type <voidval> primitive_value |
e58de8a2 FF |
252 | %type <voidval> value_name |
253 | %type <voidval> literal | |
254 | %type <voidval> tuple | |
255 | %type <voidval> value_string_element | |
256 | %type <voidval> value_string_slice | |
e58de8a2 | 257 | %type <voidval> value_array_slice |
e58de8a2 FF |
258 | %type <voidval> expression_conversion |
259 | %type <voidval> value_procedure_call | |
260 | %type <voidval> value_built_in_routine_call | |
81028ab0 | 261 | %type <voidval> chill_value_built_in_routine_call |
e58de8a2 FF |
262 | %type <voidval> start_expression |
263 | %type <voidval> zero_adic_operator | |
264 | %type <voidval> parenthesised_expression | |
265 | %type <voidval> value | |
266 | %type <voidval> undefined_value | |
267 | %type <voidval> expression | |
268 | %type <voidval> conditional_expression | |
269 | %type <voidval> then_alternative | |
270 | %type <voidval> else_alternative | |
271 | %type <voidval> sub_expression | |
272 | %type <voidval> value_case_alternative | |
273 | %type <voidval> operand_0 | |
274 | %type <voidval> operand_1 | |
275 | %type <voidval> operand_2 | |
276 | %type <voidval> operand_3 | |
277 | %type <voidval> operand_4 | |
278 | %type <voidval> operand_5 | |
279 | %type <voidval> operand_6 | |
e58de8a2 FF |
280 | %type <voidval> synonym_name |
281 | %type <voidval> value_enumeration_name | |
282 | %type <voidval> value_do_with_name | |
283 | %type <voidval> value_receive_name | |
e58de8a2 FF |
284 | %type <voidval> string_primitive_value |
285 | %type <voidval> start_element | |
286 | %type <voidval> left_element | |
287 | %type <voidval> right_element | |
288 | %type <voidval> slice_size | |
e58de8a2 FF |
289 | %type <voidval> expression_list |
290 | %type <voidval> lower_element | |
291 | %type <voidval> upper_element | |
292 | %type <voidval> first_element | |
58cda66e | 293 | %type <tval> mode_argument |
81028ab0 FF |
294 | %type <voidval> upper_lower_argument |
295 | %type <voidval> length_argument | |
81028ab0 FF |
296 | %type <voidval> array_mode_name |
297 | %type <voidval> string_mode_name | |
298 | %type <voidval> variant_structure_mode_name | |
e58de8a2 FF |
299 | %type <voidval> boolean_expression |
300 | %type <voidval> case_selector_list | |
301 | %type <voidval> subexpression | |
302 | %type <voidval> case_label_specification | |
303 | %type <voidval> buffer_location | |
45fe3db4 | 304 | %type <voidval> single_assignment_action |
8a177da6 | 305 | %type <tsym> mode_name |
45fe3db4 | 306 | |
e58de8a2 FF |
307 | %% |
308 | ||
309 | /* Z.200, 5.3.1 */ | |
310 | ||
f39a2631 | 311 | start : value { } |
8a177da6 PB |
312 | | mode_name |
313 | { write_exp_elt_opcode(OP_TYPE); | |
314 | write_exp_elt_type($1.type); | |
315 | write_exp_elt_opcode(OP_TYPE);} | |
316 | ; | |
317 | ||
e58de8a2 FF |
318 | value : expression |
319 | { | |
2e66cf7d | 320 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
321 | } |
322 | | undefined_value | |
323 | { | |
2e66cf7d | 324 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
325 | } |
326 | ; | |
327 | ||
2fcc38b8 | 328 | undefined_value : FIXME_01 |
e58de8a2 | 329 | { |
2e66cf7d | 330 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
331 | } |
332 | ; | |
333 | ||
cbd1bdc3 FF |
334 | /* Z.200, 4.2.2 */ |
335 | ||
336 | access_name : LOCATION_NAME | |
337 | { | |
338 | write_exp_elt_opcode (OP_VAR_VALUE); | |
479fdd26 | 339 | write_exp_elt_block (NULL); |
cbd1bdc3 FF |
340 | write_exp_elt_sym ($1.sym); |
341 | write_exp_elt_opcode (OP_VAR_VALUE); | |
342 | } | |
45fe3db4 FF |
343 | | GDB_LAST /* gdb specific */ |
344 | { | |
345 | write_exp_elt_opcode (OP_LAST); | |
346 | write_exp_elt_longcst ($1); | |
347 | write_exp_elt_opcode (OP_LAST); | |
348 | } | |
349 | | GDB_REGNAME /* gdb specific */ | |
350 | { | |
351 | write_exp_elt_opcode (OP_REGISTER); | |
352 | write_exp_elt_longcst ($1); | |
353 | write_exp_elt_opcode (OP_REGISTER); | |
354 | } | |
355 | | GDB_VARIABLE /* gdb specific */ | |
356 | { | |
357 | write_exp_elt_opcode (OP_INTERNALVAR); | |
358 | write_exp_elt_intern ($1); | |
359 | write_exp_elt_opcode (OP_INTERNALVAR); | |
360 | } | |
2fcc38b8 | 361 | | FIXME_03 |
e58de8a2 | 362 | { |
2e66cf7d | 363 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
364 | } |
365 | ; | |
366 | ||
54bbbfb4 FF |
367 | /* Z.200, 4.2.8 */ |
368 | ||
369 | expression_list : expression | |
370 | { | |
371 | arglist_len = 1; | |
372 | } | |
373 | | expression_list ',' expression | |
374 | { | |
375 | arglist_len++; | |
376 | } | |
dcda44a0 PB |
377 | ; |
378 | ||
54bbbfb4 | 379 | |
e58de8a2 FF |
380 | /* Z.200, 5.2.1 */ |
381 | ||
bdef6b60 PB |
382 | primitive_value : |
383 | access_name | |
384 | | primitive_value '(' | |
385 | /* This is to save the value of arglist_len | |
386 | being accumulated for each dimension. */ | |
387 | { start_arglist (); } | |
388 | expression_list ')' | |
e58de8a2 | 389 | { |
bdef6b60 PB |
390 | write_exp_elt_opcode (MULTI_SUBSCRIPT); |
391 | write_exp_elt_longcst ((LONGEST) end_arglist ()); | |
392 | write_exp_elt_opcode (MULTI_SUBSCRIPT); | |
393 | } | |
394 | | primitive_value FIELD_NAME | |
395 | { write_exp_elt_opcode (STRUCTOP_STRUCT); | |
396 | write_exp_string ($2); | |
397 | write_exp_elt_opcode (STRUCTOP_STRUCT); | |
398 | } | |
399 | | primitive_value POINTER | |
400 | { | |
401 | write_exp_elt_opcode (UNOP_IND); | |
e58de8a2 FF |
402 | } |
403 | | value_name | |
404 | { | |
2e66cf7d | 405 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
406 | } |
407 | | literal | |
408 | { | |
2e66cf7d | 409 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
410 | } |
411 | | tuple | |
412 | { | |
2e66cf7d | 413 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
414 | } |
415 | | value_string_element | |
416 | { | |
2e66cf7d | 417 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
418 | } |
419 | | value_string_slice | |
420 | { | |
2e66cf7d | 421 | $$ = 0; /* FIXME */ |
e58de8a2 | 422 | } |
e58de8a2 FF |
423 | | value_array_slice |
424 | { | |
2e66cf7d | 425 | $$ = 0; /* FIXME */ |
e58de8a2 | 426 | } |
e58de8a2 FF |
427 | | expression_conversion |
428 | { | |
2e66cf7d | 429 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
430 | } |
431 | | value_procedure_call | |
432 | { | |
2e66cf7d | 433 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
434 | } |
435 | | value_built_in_routine_call | |
436 | { | |
2e66cf7d | 437 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
438 | } |
439 | | start_expression | |
440 | { | |
2e66cf7d | 441 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
442 | } |
443 | | zero_adic_operator | |
444 | { | |
2e66cf7d | 445 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
446 | } |
447 | | parenthesised_expression | |
448 | { | |
2e66cf7d | 449 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
450 | } |
451 | ; | |
452 | ||
e58de8a2 FF |
453 | /* Z.200, 5.2.3 */ |
454 | ||
455 | value_name : synonym_name | |
456 | { | |
2e66cf7d | 457 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
458 | } |
459 | | value_enumeration_name | |
460 | { | |
2e66cf7d | 461 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
462 | } |
463 | | value_do_with_name | |
464 | { | |
2e66cf7d | 465 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
466 | } |
467 | | value_receive_name | |
468 | { | |
2e66cf7d | 469 | $$ = 0; /* FIXME */ |
e58de8a2 | 470 | } |
cbd1bdc3 | 471 | | GENERAL_PROCEDURE_NAME |
e58de8a2 | 472 | { |
cbd1bdc3 | 473 | write_exp_elt_opcode (OP_VAR_VALUE); |
479fdd26 | 474 | write_exp_elt_block (NULL); |
cbd1bdc3 FF |
475 | write_exp_elt_sym ($1.sym); |
476 | write_exp_elt_opcode (OP_VAR_VALUE); | |
e58de8a2 FF |
477 | } |
478 | ; | |
479 | ||
480 | /* Z.200, 5.2.4.1 */ | |
481 | ||
482 | literal : INTEGER_LITERAL | |
483 | { | |
2e66cf7d FF |
484 | write_exp_elt_opcode (OP_LONG); |
485 | write_exp_elt_type ($1.type); | |
486 | write_exp_elt_longcst ((LONGEST) ($1.val)); | |
487 | write_exp_elt_opcode (OP_LONG); | |
e58de8a2 FF |
488 | } |
489 | | BOOLEAN_LITERAL | |
490 | { | |
2e66cf7d FF |
491 | write_exp_elt_opcode (OP_BOOL); |
492 | write_exp_elt_longcst ((LONGEST) $1); | |
493 | write_exp_elt_opcode (OP_BOOL); | |
e58de8a2 FF |
494 | } |
495 | | CHARACTER_LITERAL | |
496 | { | |
2e66cf7d FF |
497 | write_exp_elt_opcode (OP_LONG); |
498 | write_exp_elt_type ($1.type); | |
499 | write_exp_elt_longcst ((LONGEST) ($1.val)); | |
500 | write_exp_elt_opcode (OP_LONG); | |
e58de8a2 | 501 | } |
1188fbbf FF |
502 | | FLOAT_LITERAL |
503 | { | |
504 | write_exp_elt_opcode (OP_DOUBLE); | |
505 | write_exp_elt_type (builtin_type_double); | |
506 | write_exp_elt_dblcst ($1); | |
507 | write_exp_elt_opcode (OP_DOUBLE); | |
508 | } | |
e58de8a2 FF |
509 | | SET_LITERAL |
510 | { | |
2e66cf7d | 511 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
512 | } |
513 | | EMPTINESS_LITERAL | |
514 | { | |
2d67c7e9 PB |
515 | struct type *void_ptr_type |
516 | = lookup_pointer_type (builtin_type_void); | |
517 | write_exp_elt_opcode (OP_LONG); | |
518 | write_exp_elt_type (void_ptr_type); | |
519 | write_exp_elt_longcst (0); | |
520 | write_exp_elt_opcode (OP_LONG); | |
e58de8a2 FF |
521 | } |
522 | | CHARACTER_STRING_LITERAL | |
523 | { | |
c7da3ed3 FF |
524 | write_exp_elt_opcode (OP_STRING); |
525 | write_exp_string ($1); | |
526 | write_exp_elt_opcode (OP_STRING); | |
e58de8a2 FF |
527 | } |
528 | | BIT_STRING_LITERAL | |
529 | { | |
81028ab0 FF |
530 | write_exp_elt_opcode (OP_BITSTRING); |
531 | write_exp_bitstring ($1); | |
532 | write_exp_elt_opcode (OP_BITSTRING); | |
e58de8a2 FF |
533 | } |
534 | ; | |
535 | ||
536 | /* Z.200, 5.2.5 */ | |
537 | ||
dcda44a0 PB |
538 | tuple_element : expression |
539 | | named_record_element | |
540 | ; | |
541 | ||
542 | named_record_element: FIELD_NAME ',' named_record_element | |
543 | { write_exp_elt_opcode (OP_LABELED); | |
544 | write_exp_string ($1); | |
545 | write_exp_elt_opcode (OP_LABELED); | |
546 | } | |
547 | | FIELD_NAME ':' expression | |
548 | { write_exp_elt_opcode (OP_LABELED); | |
549 | write_exp_string ($1); | |
550 | write_exp_elt_opcode (OP_LABELED); | |
551 | } | |
552 | ; | |
553 | ||
554 | tuple_elements : tuple_element | |
555 | { | |
556 | arglist_len = 1; | |
557 | } | |
558 | | tuple_elements ',' tuple_element | |
559 | { | |
560 | arglist_len++; | |
561 | } | |
562 | ; | |
563 | ||
2d67c7e9 PB |
564 | tuple : '[' |
565 | { start_arglist (); } | |
dcda44a0 | 566 | tuple_elements ']' |
e58de8a2 | 567 | { |
2d67c7e9 PB |
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); | |
572 | } | |
573 | | | |
574 | mode_name '[' | |
575 | { start_arglist (); } | |
dcda44a0 | 576 | tuple_elements ']' |
2d67c7e9 PB |
577 | { |
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); | |
582 | ||
583 | write_exp_elt_opcode (UNOP_CAST); | |
584 | write_exp_elt_type ($1.type); | |
585 | write_exp_elt_opcode (UNOP_CAST); | |
e58de8a2 FF |
586 | } |
587 | ; | |
588 | ||
589 | ||
590 | /* Z.200, 5.2.6 */ | |
591 | ||
592 | value_string_element: string_primitive_value '(' start_element ')' | |
593 | { | |
2e66cf7d | 594 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
595 | } |
596 | ; | |
597 | ||
598 | /* Z.200, 5.2.7 */ | |
599 | ||
600 | value_string_slice: string_primitive_value '(' left_element ':' right_element ')' | |
601 | { | |
2e66cf7d | 602 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
603 | } |
604 | | string_primitive_value '(' start_element UP slice_size ')' | |
605 | { | |
2e66cf7d | 606 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
607 | } |
608 | ; | |
609 | ||
e58de8a2 FF |
610 | /* Z.200, 5.2.9 */ |
611 | ||
bdef6b60 | 612 | value_array_slice: primitive_value '(' lower_element ':' upper_element ')' |
e58de8a2 | 613 | { |
2e66cf7d | 614 | $$ = 0; /* FIXME */ |
e58de8a2 | 615 | } |
bdef6b60 | 616 | | primitive_value '(' first_element UP slice_size ')' |
e58de8a2 | 617 | { |
2e66cf7d | 618 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
619 | } |
620 | ; | |
621 | ||
e58de8a2 FF |
622 | /* Z.200, 5.2.11 */ |
623 | ||
2fcc38b8 | 624 | expression_conversion: mode_name parenthesised_expression |
e58de8a2 | 625 | { |
8a177da6 PB |
626 | write_exp_elt_opcode (UNOP_CAST); |
627 | write_exp_elt_type ($1.type); | |
628 | write_exp_elt_opcode (UNOP_CAST); | |
e58de8a2 FF |
629 | } |
630 | ; | |
631 | ||
632 | /* Z.200, 5.2.12 */ | |
633 | ||
2fcc38b8 | 634 | value_procedure_call: FIXME_05 |
e58de8a2 | 635 | { |
2e66cf7d | 636 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
637 | } |
638 | ; | |
639 | ||
640 | /* Z.200, 5.2.13 */ | |
641 | ||
81028ab0 | 642 | value_built_in_routine_call: chill_value_built_in_routine_call |
e58de8a2 | 643 | { |
2e66cf7d | 644 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
645 | } |
646 | ; | |
647 | ||
648 | /* Z.200, 5.2.14 */ | |
649 | ||
2fcc38b8 | 650 | start_expression: FIXME_06 |
e58de8a2 | 651 | { |
2e66cf7d | 652 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
653 | } /* Not in GNU-Chill */ |
654 | ; | |
655 | ||
656 | /* Z.200, 5.2.15 */ | |
657 | ||
2fcc38b8 | 658 | zero_adic_operator: FIXME_07 |
e58de8a2 | 659 | { |
2e66cf7d | 660 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
661 | } |
662 | ; | |
663 | ||
664 | /* Z.200, 5.2.16 */ | |
665 | ||
666 | parenthesised_expression: '(' expression ')' | |
667 | { | |
2e66cf7d | 668 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
669 | } |
670 | ; | |
671 | ||
672 | /* Z.200, 5.3.2 */ | |
673 | ||
674 | expression : operand_0 | |
675 | { | |
2e66cf7d | 676 | $$ = 0; /* FIXME */ |
e58de8a2 | 677 | } |
8a177da6 PB |
678 | | single_assignment_action |
679 | { | |
680 | $$ = 0; /* FIXME */ | |
681 | } | |
e58de8a2 FF |
682 | | conditional_expression |
683 | { | |
2e66cf7d | 684 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
685 | } |
686 | ; | |
687 | ||
688 | conditional_expression : IF boolean_expression then_alternative else_alternative FI | |
689 | { | |
2e66cf7d | 690 | $$ = 0; /* FIXME */ |
e58de8a2 | 691 | } |
2d67c7e9 | 692 | | CASE case_selector_list OF value_case_alternative ELSE sub_expression ESAC |
e58de8a2 | 693 | { |
2e66cf7d | 694 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
695 | } |
696 | ; | |
697 | ||
698 | then_alternative: THEN subexpression | |
699 | { | |
2e66cf7d | 700 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
701 | } |
702 | ; | |
703 | ||
704 | else_alternative: ELSE subexpression | |
705 | { | |
2e66cf7d | 706 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
707 | } |
708 | | ELSIF boolean_expression then_alternative else_alternative | |
709 | { | |
2e66cf7d | 710 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
711 | } |
712 | ; | |
713 | ||
714 | sub_expression : expression | |
715 | { | |
2e66cf7d | 716 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
717 | } |
718 | ; | |
719 | ||
720 | value_case_alternative: case_label_specification ':' sub_expression ';' | |
721 | { | |
2e66cf7d | 722 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
723 | } |
724 | ; | |
725 | ||
726 | /* Z.200, 5.3.3 */ | |
727 | ||
728 | operand_0 : operand_1 | |
729 | { | |
2e66cf7d | 730 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
731 | } |
732 | | operand_0 LOGIOR operand_1 | |
733 | { | |
2e66cf7d | 734 | write_exp_elt_opcode (BINOP_BITWISE_IOR); |
e58de8a2 FF |
735 | } |
736 | | operand_0 ORIF operand_1 | |
737 | { | |
2e66cf7d | 738 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
739 | } |
740 | | operand_0 LOGXOR operand_1 | |
741 | { | |
2e66cf7d | 742 | write_exp_elt_opcode (BINOP_BITWISE_XOR); |
e58de8a2 FF |
743 | } |
744 | ; | |
745 | ||
746 | /* Z.200, 5.3.4 */ | |
747 | ||
748 | operand_1 : operand_2 | |
749 | { | |
2e66cf7d | 750 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
751 | } |
752 | | operand_1 LOGAND operand_2 | |
753 | { | |
2e66cf7d | 754 | write_exp_elt_opcode (BINOP_BITWISE_AND); |
e58de8a2 FF |
755 | } |
756 | | operand_1 ANDIF operand_2 | |
757 | { | |
2e66cf7d | 758 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
759 | } |
760 | ; | |
761 | ||
762 | /* Z.200, 5.3.5 */ | |
763 | ||
764 | operand_2 : operand_3 | |
765 | { | |
2e66cf7d | 766 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
767 | } |
768 | | operand_2 '=' operand_3 | |
769 | { | |
2e66cf7d | 770 | write_exp_elt_opcode (BINOP_EQUAL); |
e58de8a2 FF |
771 | } |
772 | | operand_2 NOTEQUAL operand_3 | |
773 | { | |
2e66cf7d | 774 | write_exp_elt_opcode (BINOP_NOTEQUAL); |
e58de8a2 FF |
775 | } |
776 | | operand_2 '>' operand_3 | |
777 | { | |
2e66cf7d | 778 | write_exp_elt_opcode (BINOP_GTR); |
e58de8a2 FF |
779 | } |
780 | | operand_2 GTR operand_3 | |
781 | { | |
2e66cf7d | 782 | write_exp_elt_opcode (BINOP_GEQ); |
e58de8a2 FF |
783 | } |
784 | | operand_2 '<' operand_3 | |
785 | { | |
2e66cf7d | 786 | write_exp_elt_opcode (BINOP_LESS); |
e58de8a2 FF |
787 | } |
788 | | operand_2 LEQ operand_3 | |
789 | { | |
2e66cf7d | 790 | write_exp_elt_opcode (BINOP_LEQ); |
e58de8a2 FF |
791 | } |
792 | | operand_2 IN operand_3 | |
793 | { | |
e909f287 | 794 | write_exp_elt_opcode (BINOP_IN); |
e58de8a2 FF |
795 | } |
796 | ; | |
797 | ||
798 | ||
799 | /* Z.200, 5.3.6 */ | |
800 | ||
801 | operand_3 : operand_4 | |
802 | { | |
2e66cf7d | 803 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
804 | } |
805 | | operand_3 '+' operand_4 | |
806 | { | |
2e66cf7d | 807 | write_exp_elt_opcode (BINOP_ADD); |
e58de8a2 FF |
808 | } |
809 | | operand_3 '-' operand_4 | |
810 | { | |
2e66cf7d | 811 | write_exp_elt_opcode (BINOP_SUB); |
e58de8a2 FF |
812 | } |
813 | | operand_3 SLASH_SLASH operand_4 | |
814 | { | |
fcbadaee | 815 | write_exp_elt_opcode (BINOP_CONCAT); |
e58de8a2 FF |
816 | } |
817 | ; | |
818 | ||
819 | /* Z.200, 5.3.7 */ | |
820 | ||
821 | operand_4 : operand_5 | |
822 | { | |
2e66cf7d | 823 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
824 | } |
825 | | operand_4 '*' operand_5 | |
826 | { | |
2e66cf7d | 827 | write_exp_elt_opcode (BINOP_MUL); |
e58de8a2 FF |
828 | } |
829 | | operand_4 '/' operand_5 | |
830 | { | |
2e66cf7d | 831 | write_exp_elt_opcode (BINOP_DIV); |
e58de8a2 FF |
832 | } |
833 | | operand_4 MOD operand_5 | |
834 | { | |
76a0ffb4 | 835 | write_exp_elt_opcode (BINOP_MOD); |
e58de8a2 FF |
836 | } |
837 | | operand_4 REM operand_5 | |
838 | { | |
76a0ffb4 | 839 | write_exp_elt_opcode (BINOP_REM); |
e58de8a2 FF |
840 | } |
841 | ; | |
842 | ||
843 | /* Z.200, 5.3.8 */ | |
844 | ||
845 | operand_5 : operand_6 | |
846 | { | |
2e66cf7d | 847 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
848 | } |
849 | | '-' operand_6 | |
850 | { | |
2e66cf7d | 851 | write_exp_elt_opcode (UNOP_NEG); |
e58de8a2 FF |
852 | } |
853 | | NOT operand_6 | |
854 | { | |
2e66cf7d | 855 | write_exp_elt_opcode (UNOP_LOGICAL_NOT); |
e58de8a2 | 856 | } |
47f366bc | 857 | | parenthesised_expression literal |
8a177da6 PB |
858 | /* We require the string operand to be a literal, to avoid some |
859 | nasty parsing ambiguities. */ | |
e58de8a2 | 860 | { |
2fcc38b8 | 861 | write_exp_elt_opcode (BINOP_CONCAT); |
e58de8a2 FF |
862 | } |
863 | ; | |
864 | ||
865 | /* Z.200, 5.3.9 */ | |
866 | ||
bdef6b60 | 867 | operand_6 : POINTER primitive_value |
e58de8a2 | 868 | { |
8a177da6 | 869 | write_exp_elt_opcode (UNOP_ADDR); |
e58de8a2 FF |
870 | } |
871 | | RECEIVE buffer_location | |
872 | { | |
2e66cf7d | 873 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
874 | } |
875 | | primitive_value | |
876 | { | |
2e66cf7d | 877 | $$ = 0; /* FIXME */ |
e58de8a2 FF |
878 | } |
879 | ; | |
880 | ||
881 | ||
45fe3db4 FF |
882 | /* Z.200, 6.2 */ |
883 | ||
81028ab0 | 884 | single_assignment_action : |
bdef6b60 | 885 | primitive_value GDB_ASSIGNMENT value |
45fe3db4 FF |
886 | { |
887 | write_exp_elt_opcode (BINOP_ASSIGN); | |
888 | } | |
81028ab0 FF |
889 | ; |
890 | ||
891 | /* Z.200, 6.20.3 */ | |
892 | ||
893 | chill_value_built_in_routine_call : | |
894 | NUM '(' expression ')' | |
895 | { | |
896 | $$ = 0; /* FIXME */ | |
897 | } | |
898 | | PRED '(' expression ')' | |
899 | { | |
900 | $$ = 0; /* FIXME */ | |
901 | } | |
902 | | SUCC '(' expression ')' | |
903 | { | |
904 | $$ = 0; /* FIXME */ | |
905 | } | |
906 | | ABS '(' expression ')' | |
907 | { | |
908 | $$ = 0; /* FIXME */ | |
909 | } | |
910 | | CARD '(' expression ')' | |
911 | { | |
912 | $$ = 0; /* FIXME */ | |
913 | } | |
57ffffe3 | 914 | | MAX_TOKEN '(' expression ')' |
81028ab0 FF |
915 | { |
916 | $$ = 0; /* FIXME */ | |
917 | } | |
57ffffe3 | 918 | | MIN_TOKEN '(' expression ')' |
81028ab0 FF |
919 | { |
920 | $$ = 0; /* FIXME */ | |
921 | } | |
58cda66e PB |
922 | | SIZE '(' expression ')' |
923 | { write_exp_elt_opcode (UNOP_SIZEOF); } | |
81028ab0 | 924 | | SIZE '(' mode_argument ')' |
58cda66e PB |
925 | { write_exp_elt_opcode (OP_LONG); |
926 | write_exp_elt_type (builtin_type_int); | |
927 | write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3)); | |
928 | write_exp_elt_opcode (OP_LONG); } | |
81028ab0 FF |
929 | | UPPER '(' upper_lower_argument ')' |
930 | { | |
931 | $$ = 0; /* FIXME */ | |
932 | } | |
933 | | LOWER '(' upper_lower_argument ')' | |
934 | { | |
935 | $$ = 0; /* FIXME */ | |
936 | } | |
937 | | LENGTH '(' length_argument ')' | |
938 | { | |
939 | $$ = 0; /* FIXME */ | |
940 | } | |
941 | ; | |
942 | ||
943 | mode_argument : mode_name | |
944 | { | |
58cda66e | 945 | $$ = $1.type; |
81028ab0 FF |
946 | } |
947 | | array_mode_name '(' expression ')' | |
948 | { | |
949 | $$ = 0; /* FIXME */ | |
950 | } | |
951 | | string_mode_name '(' expression ')' | |
952 | { | |
953 | $$ = 0; /* FIXME */ | |
954 | } | |
955 | | variant_structure_mode_name '(' expression_list ')' | |
956 | { | |
957 | $$ = 0; /* FIXME */ | |
958 | } | |
959 | ; | |
960 | ||
8a177da6 PB |
961 | mode_name : TYPENAME |
962 | ; | |
963 | ||
964 | upper_lower_argument : expression | |
81028ab0 FF |
965 | { |
966 | $$ = 0; /* FIXME */ | |
967 | } | |
968 | | mode_name | |
969 | { | |
970 | $$ = 0; /* FIXME */ | |
971 | } | |
972 | ; | |
973 | ||
8a177da6 | 974 | length_argument : expression |
81028ab0 FF |
975 | { |
976 | $$ = 0; /* FIXME */ | |
977 | } | |
978 | ; | |
45fe3db4 | 979 | |
e58de8a2 | 980 | /* Things which still need productions... */ |
54bbbfb4 | 981 | |
2fcc38b8 FF |
982 | array_mode_name : FIXME_08 { $$ = 0; } |
983 | string_mode_name : FIXME_09 { $$ = 0; } | |
984 | variant_structure_mode_name: FIXME_10 { $$ = 0; } | |
985 | synonym_name : FIXME_11 { $$ = 0; } | |
986 | value_enumeration_name : FIXME_12 { $$ = 0; } | |
987 | value_do_with_name : FIXME_13 { $$ = 0; } | |
988 | value_receive_name : FIXME_14 { $$ = 0; } | |
989 | string_primitive_value : FIXME_15 { $$ = 0; } | |
990 | start_element : FIXME_16 { $$ = 0; } | |
991 | left_element : FIXME_17 { $$ = 0; } | |
992 | right_element : FIXME_18 { $$ = 0; } | |
993 | slice_size : FIXME_19 { $$ = 0; } | |
994 | lower_element : FIXME_20 { $$ = 0; } | |
995 | upper_element : FIXME_21 { $$ = 0; } | |
996 | first_element : FIXME_22 { $$ = 0; } | |
2fcc38b8 FF |
997 | boolean_expression : FIXME_26 { $$ = 0; } |
998 | case_selector_list : FIXME_27 { $$ = 0; } | |
999 | subexpression : FIXME_28 { $$ = 0; } | |
1000 | case_label_specification: FIXME_29 { $$ = 0; } | |
1001 | buffer_location : FIXME_30 { $$ = 0; } | |
e58de8a2 FF |
1002 | |
1003 | %% | |
1004 | ||
c7da3ed3 FF |
1005 | /* Implementation of a dynamically expandable buffer for processing input |
1006 | characters acquired through lexptr and building a value to return in | |
1007 | yylval. */ | |
1008 | ||
1009 | static char *tempbuf; /* Current buffer contents */ | |
1010 | static int tempbufsize; /* Size of allocated buffer */ | |
1011 | static int tempbufindex; /* Current index into buffer */ | |
1012 | ||
1013 | #define GROWBY_MIN_SIZE 64 /* Minimum amount to grow buffer by */ | |
1014 | ||
1015 | #define CHECKBUF(size) \ | |
1016 | do { \ | |
1017 | if (tempbufindex + (size) >= tempbufsize) \ | |
1018 | { \ | |
1019 | growbuf_by_size (size); \ | |
1020 | } \ | |
1021 | } while (0); | |
1022 | ||
1023 | /* Grow the static temp buffer if necessary, including allocating the first one | |
1024 | on demand. */ | |
1025 | ||
1026 | static void | |
1027 | growbuf_by_size (count) | |
1028 | int count; | |
1029 | { | |
1030 | int growby; | |
1031 | ||
1032 | growby = max (count, GROWBY_MIN_SIZE); | |
1033 | tempbufsize += growby; | |
1034 | if (tempbuf == NULL) | |
1035 | { | |
1036 | tempbuf = (char *) malloc (tempbufsize); | |
1037 | } | |
1038 | else | |
1039 | { | |
1040 | tempbuf = (char *) realloc (tempbuf, tempbufsize); | |
1041 | } | |
1042 | } | |
1043 | ||
cbd1bdc3 FF |
1044 | /* Try to consume a simple name string token. If successful, returns |
1045 | a pointer to a nullbyte terminated copy of the name that can be used | |
1046 | in symbol table lookups. If not successful, returns NULL. */ | |
1047 | ||
1048 | static char * | |
1049 | match_simple_name_string () | |
1050 | { | |
1051 | char *tokptr = lexptr; | |
1052 | ||
93dc3414 | 1053 | if (isalpha (*tokptr) || *tokptr == '_') |
cbd1bdc3 | 1054 | { |
5a7c9cce | 1055 | char *result; |
cbd1bdc3 FF |
1056 | do { |
1057 | tokptr++; | |
5a7c9cce | 1058 | } while (isalnum (*tokptr) || (*tokptr == '_')); |
cbd1bdc3 FF |
1059 | yylval.sval.ptr = lexptr; |
1060 | yylval.sval.length = tokptr - lexptr; | |
1061 | lexptr = tokptr; | |
5a7c9cce | 1062 | result = copy_name (yylval.sval); |
5a7c9cce | 1063 | return result; |
cbd1bdc3 FF |
1064 | } |
1065 | return (NULL); | |
1066 | } | |
1067 | ||
5d074aa9 FF |
1068 | /* Start looking for a value composed of valid digits as set by the base |
1069 | in use. Note that '_' characters are valid anywhere, in any quantity, | |
1070 | and are simply ignored. Since we must find at least one valid digit, | |
1071 | or reject this token as an integer literal, we keep track of how many | |
1072 | digits we have encountered. */ | |
1073 | ||
1074 | static int | |
1075 | decode_integer_value (base, tokptrptr, ivalptr) | |
1076 | int base; | |
1077 | char **tokptrptr; | |
1078 | int *ivalptr; | |
1079 | { | |
1080 | char *tokptr = *tokptrptr; | |
1081 | int temp; | |
1082 | int digits = 0; | |
1083 | ||
1084 | while (*tokptr != '\0') | |
1085 | { | |
db2302cb PS |
1086 | temp = *tokptr; |
1087 | if (isupper (temp)) | |
1088 | temp = tolower (temp); | |
5d074aa9 FF |
1089 | tokptr++; |
1090 | switch (temp) | |
1091 | { | |
1092 | case '_': | |
1093 | continue; | |
1094 | case '0': case '1': case '2': case '3': case '4': | |
1095 | case '5': case '6': case '7': case '8': case '9': | |
1096 | temp -= '0'; | |
1097 | break; | |
1098 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | |
1099 | temp -= 'a'; | |
1100 | temp += 10; | |
1101 | break; | |
1102 | default: | |
1103 | temp = base; | |
1104 | break; | |
1105 | } | |
1106 | if (temp < base) | |
1107 | { | |
1108 | digits++; | |
1109 | *ivalptr *= base; | |
1110 | *ivalptr += temp; | |
1111 | } | |
1112 | else | |
1113 | { | |
1114 | /* Found something not in domain for current base. */ | |
1115 | tokptr--; /* Unconsume what gave us indigestion. */ | |
1116 | break; | |
1117 | } | |
1118 | } | |
1119 | ||
1120 | /* If we didn't find any digits, then we don't have a valid integer | |
1121 | value, so reject the entire token. Otherwise, update the lexical | |
1122 | scan pointer, and return non-zero for success. */ | |
1123 | ||
1124 | if (digits == 0) | |
1125 | { | |
1126 | return (0); | |
1127 | } | |
1128 | else | |
1129 | { | |
1130 | *tokptrptr = tokptr; | |
1131 | return (1); | |
1132 | } | |
1133 | } | |
1134 | ||
e58de8a2 | 1135 | static int |
2e66cf7d | 1136 | decode_integer_literal (valptr, tokptrptr) |
5d074aa9 FF |
1137 | int *valptr; |
1138 | char **tokptrptr; | |
e58de8a2 | 1139 | { |
2e66cf7d FF |
1140 | char *tokptr = *tokptrptr; |
1141 | int base = 0; | |
1142 | int ival = 0; | |
2e66cf7d FF |
1143 | int explicit_base = 0; |
1144 | ||
1145 | /* Look for an explicit base specifier, which is optional. */ | |
1146 | ||
1147 | switch (*tokptr) | |
1148 | { | |
1149 | case 'd': | |
1150 | case 'D': | |
1151 | explicit_base++; | |
1152 | base = 10; | |
1153 | tokptr++; | |
1154 | break; | |
1155 | case 'b': | |
1156 | case 'B': | |
1157 | explicit_base++; | |
1158 | base = 2; | |
1159 | tokptr++; | |
1160 | break; | |
1161 | case 'h': | |
1162 | case 'H': | |
1163 | explicit_base++; | |
1164 | base = 16; | |
1165 | tokptr++; | |
1166 | break; | |
1167 | case 'o': | |
1168 | case 'O': | |
1169 | explicit_base++; | |
1170 | base = 8; | |
1171 | tokptr++; | |
1172 | break; | |
1173 | default: | |
1174 | base = 10; | |
1175 | break; | |
1176 | } | |
1177 | ||
1178 | /* If we found an explicit base ensure that the character after the | |
1179 | explicit base is a single quote. */ | |
1180 | ||
1181 | if (explicit_base && (*tokptr++ != '\'')) | |
1182 | { | |
1183 | return (0); | |
1184 | } | |
1185 | ||
5d074aa9 FF |
1186 | /* Attempt to decode whatever follows as an integer value in the |
1187 | indicated base, updating the token pointer in the process and | |
1188 | computing the value into ival. Also, if we have an explicit | |
2e66cf7d | 1189 | base, then the next character must not be a single quote, or we |
5d074aa9 FF |
1190 | have a bitstring literal, so reject the entire token in this case. |
1191 | Otherwise, update the lexical scan pointer, and return non-zero | |
1192 | for success. */ | |
1193 | ||
1194 | if (!decode_integer_value (base, &tokptr, &ival)) | |
2e66cf7d FF |
1195 | { |
1196 | return (0); | |
1197 | } | |
1198 | else if (explicit_base && (*tokptr == '\'')) | |
1199 | { | |
1200 | return (0); | |
1201 | } | |
1202 | else | |
1203 | { | |
1204 | *valptr = ival; | |
1205 | *tokptrptr = tokptr; | |
1206 | return (1); | |
1207 | } | |
1208 | } | |
1209 | ||
1188fbbf FF |
1210 | /* If it wasn't for the fact that floating point values can contain '_' |
1211 | characters, we could just let strtod do all the hard work by letting it | |
1212 | try to consume as much of the current token buffer as possible and | |
1213 | find a legal conversion. Unfortunately we need to filter out the '_' | |
1214 | characters before calling strtod, which we do by copying the other | |
1215 | legal chars to a local buffer to be converted. However since we also | |
1216 | need to keep track of where the last unconsumed character in the input | |
1217 | buffer is, we have transfer only as many characters as may compose a | |
1218 | legal floating point value. */ | |
1219 | ||
1220 | static int | |
1221 | match_float_literal () | |
1222 | { | |
1223 | char *tokptr = lexptr; | |
1224 | char *buf; | |
1225 | char *copy; | |
1188fbbf FF |
1226 | double dval; |
1227 | extern double strtod (); | |
1228 | ||
1229 | /* Make local buffer in which to build the string to convert. This is | |
1230 | required because underscores are valid in chill floating point numbers | |
1231 | but not in the string passed to strtod to convert. The string will be | |
1232 | no longer than our input string. */ | |
1233 | ||
1234 | copy = buf = (char *) alloca (strlen (tokptr) + 1); | |
1235 | ||
1236 | /* Transfer all leading digits to the conversion buffer, discarding any | |
1237 | underscores. */ | |
1238 | ||
1239 | while (isdigit (*tokptr) || *tokptr == '_') | |
1240 | { | |
1241 | if (*tokptr != '_') | |
1242 | { | |
1243 | *copy++ = *tokptr; | |
1244 | } | |
1245 | tokptr++; | |
1246 | } | |
1247 | ||
1248 | /* Now accept either a '.', or one of [eEdD]. Dot is legal regardless | |
1249 | of whether we found any leading digits, and we simply accept it and | |
1250 | continue on to look for the fractional part and/or exponent. One of | |
1251 | [eEdD] is legal only if we have seen digits, and means that there | |
1252 | is no fractional part. If we find neither of these, then this is | |
1253 | not a floating point number, so return failure. */ | |
1254 | ||
1255 | switch (*tokptr++) | |
1256 | { | |
1257 | case '.': | |
1258 | /* Accept and then look for fractional part and/or exponent. */ | |
1259 | *copy++ = '.'; | |
1260 | break; | |
1261 | ||
1262 | case 'e': | |
1263 | case 'E': | |
1264 | case 'd': | |
1265 | case 'D': | |
1266 | if (copy == buf) | |
1267 | { | |
1268 | return (0); | |
1269 | } | |
1270 | *copy++ = 'e'; | |
1271 | goto collect_exponent; | |
1272 | break; | |
1273 | ||
1274 | default: | |
1275 | return (0); | |
1276 | break; | |
1277 | } | |
1278 | ||
1279 | /* We found a '.', copy any fractional digits to the conversion buffer, up | |
1280 | to the first nondigit, non-underscore character. */ | |
1281 | ||
1282 | while (isdigit (*tokptr) || *tokptr == '_') | |
1283 | { | |
1284 | if (*tokptr != '_') | |
1285 | { | |
1286 | *copy++ = *tokptr; | |
1287 | } | |
1288 | tokptr++; | |
1289 | } | |
1290 | ||
1291 | /* Look for an exponent, which must start with one of [eEdD]. If none | |
1292 | is found, jump directly to trying to convert what we have collected | |
1293 | so far. */ | |
1294 | ||
1295 | switch (*tokptr) | |
1296 | { | |
1297 | case 'e': | |
1298 | case 'E': | |
1299 | case 'd': | |
1300 | case 'D': | |
1301 | *copy++ = 'e'; | |
1302 | tokptr++; | |
1303 | break; | |
1304 | default: | |
1305 | goto convert_float; | |
1306 | break; | |
1307 | } | |
1308 | ||
1309 | /* Accept an optional '-' or '+' following one of [eEdD]. */ | |
1310 | ||
1311 | collect_exponent: | |
1312 | if (*tokptr == '+' || *tokptr == '-') | |
1313 | { | |
1314 | *copy++ = *tokptr++; | |
1315 | } | |
1316 | ||
1317 | /* Now copy an exponent into the conversion buffer. Note that at the | |
1318 | moment underscores are *not* allowed in exponents. */ | |
1319 | ||
1320 | while (isdigit (*tokptr)) | |
1321 | { | |
1322 | *copy++ = *tokptr++; | |
1323 | } | |
1324 | ||
1325 | /* If we transfered any chars to the conversion buffer, try to interpret its | |
1326 | contents as a floating point value. If any characters remain, then we | |
1327 | must not have a valid floating point string. */ | |
1328 | ||
1329 | convert_float: | |
1330 | *copy = '\0'; | |
1331 | if (copy != buf) | |
1332 | { | |
1333 | dval = strtod (buf, ©); | |
1334 | if (*copy == '\0') | |
1335 | { | |
1336 | yylval.dval = dval; | |
1337 | lexptr = tokptr; | |
1338 | return (FLOAT_LITERAL); | |
1339 | } | |
1340 | } | |
1341 | return (0); | |
1342 | } | |
1343 | ||
96b6b765 | 1344 | /* Recognize a string literal. A string literal is a sequence |
c7da3ed3 FF |
1345 | of characters enclosed in matching single or double quotes, except that |
1346 | a single character inside single quotes is a character literal, which | |
1347 | we reject as a string literal. To embed the terminator character inside | |
1348 | a string, it is simply doubled (I.E. "this""is""one""string") */ | |
1349 | ||
1350 | static int | |
1351 | match_string_literal () | |
1352 | { | |
1353 | char *tokptr = lexptr; | |
1354 | ||
1355 | for (tempbufindex = 0, tokptr++; *tokptr != '\0'; tokptr++) | |
1356 | { | |
1357 | CHECKBUF (1); | |
1358 | if (*tokptr == *lexptr) | |
1359 | { | |
1360 | if (*(tokptr + 1) == *lexptr) | |
1361 | { | |
1362 | tokptr++; | |
1363 | } | |
1364 | else | |
1365 | { | |
1366 | break; | |
1367 | } | |
1368 | } | |
1369 | tempbuf[tempbufindex++] = *tokptr; | |
1370 | } | |
1371 | if (*tokptr == '\0' /* no terminator */ | |
c7da3ed3 FF |
1372 | || (tempbufindex == 1 && *tokptr == '\'')) /* char literal */ |
1373 | { | |
1374 | return (0); | |
1375 | } | |
1376 | else | |
1377 | { | |
1378 | tempbuf[tempbufindex] = '\0'; | |
1379 | yylval.sval.ptr = tempbuf; | |
1380 | yylval.sval.length = tempbufindex; | |
1381 | lexptr = ++tokptr; | |
1382 | return (CHARACTER_STRING_LITERAL); | |
1383 | } | |
1384 | } | |
1385 | ||
2e66cf7d FF |
1386 | /* Recognize a character literal. A character literal is single character |
1387 | or a control sequence, enclosed in single quotes. A control sequence | |
1388 | is a comma separated list of one or more integer literals, enclosed | |
1389 | in parenthesis and introduced with a circumflex character. | |
1390 | ||
1391 | EX: 'a' '^(7)' '^(7,8)' | |
1392 | ||
5d074aa9 FF |
1393 | As a GNU chill extension, the syntax C'xx' is also recognized as a |
1394 | character literal, where xx is a hex value for the character. | |
1395 | ||
c7da3ed3 FF |
1396 | Note that more than a single character, enclosed in single quotes, is |
1397 | a string literal. | |
1398 | ||
c4413e2c FF |
1399 | Also note that the control sequence form is not in GNU Chill since it |
1400 | is ambiguous with the string literal form using single quotes. I.E. | |
1401 | is '^(7)' a character literal or a string literal. In theory it it | |
1402 | possible to tell by context, but GNU Chill doesn't accept the control | |
1403 | sequence form, so neither do we (for now the code is disabled). | |
1404 | ||
2e66cf7d FF |
1405 | Returns CHARACTER_LITERAL if a match is found. |
1406 | */ | |
1407 | ||
1408 | static int | |
1409 | match_character_literal () | |
1410 | { | |
1411 | char *tokptr = lexptr; | |
1412 | int ival = 0; | |
1413 | ||
db2302cb | 1414 | if ((*tokptr == 'c' || *tokptr == 'C') && (*(tokptr + 1) == '\'')) |
2e66cf7d | 1415 | { |
5d074aa9 FF |
1416 | /* We have a GNU chill extension form, so skip the leading "C'", |
1417 | decode the hex value, and then ensure that we have a trailing | |
1418 | single quote character. */ | |
2e66cf7d | 1419 | tokptr += 2; |
5d074aa9 | 1420 | if (!decode_integer_value (16, &tokptr, &ival) || (*tokptr != '\'')) |
e58de8a2 | 1421 | { |
2e66cf7d | 1422 | return (0); |
e58de8a2 | 1423 | } |
5d074aa9 | 1424 | tokptr++; |
2e66cf7d | 1425 | } |
5d074aa9 | 1426 | else if (*tokptr == '\'') |
2e66cf7d | 1427 | { |
5d074aa9 | 1428 | tokptr++; |
2e66cf7d | 1429 | |
5d074aa9 FF |
1430 | /* Determine which form we have, either a control sequence or the |
1431 | single character form. */ | |
1432 | ||
1433 | if ((*tokptr == '^') && (*(tokptr + 1) == '(')) | |
1434 | { | |
9da75ad3 | 1435 | #if 0 /* Disable, see note above. -fnf */ |
5d074aa9 FF |
1436 | /* Match and decode a control sequence. Return zero if we don't |
1437 | find a valid integer literal, or if the next unconsumed character | |
1438 | after the integer literal is not the trailing ')'. | |
1439 | FIXME: We currently don't handle the multiple integer literal | |
1440 | form. */ | |
1441 | tokptr += 2; | |
1442 | if (!decode_integer_literal (&ival, &tokptr) || (*tokptr++ != ')')) | |
1443 | { | |
1444 | return (0); | |
1445 | } | |
9da75ad3 FF |
1446 | #else |
1447 | return (0); | |
1448 | #endif | |
5d074aa9 FF |
1449 | } |
1450 | else | |
1451 | { | |
1452 | ival = *tokptr++; | |
1453 | } | |
1454 | ||
1455 | /* The trailing quote has not yet been consumed. If we don't find | |
1456 | it, then we have no match. */ | |
1457 | ||
1458 | if (*tokptr++ != '\'') | |
1459 | { | |
1460 | return (0); | |
1461 | } | |
2e66cf7d | 1462 | } |
aed656ba FF |
1463 | else |
1464 | { | |
1465 | /* Not a character literal. */ | |
1466 | return (0); | |
1467 | } | |
2e66cf7d FF |
1468 | yylval.typed_val.val = ival; |
1469 | yylval.typed_val.type = builtin_type_chill_char; | |
1470 | lexptr = tokptr; | |
1471 | return (CHARACTER_LITERAL); | |
e58de8a2 FF |
1472 | } |
1473 | ||
1474 | /* Recognize an integer literal, as specified in Z.200 sec 5.2.4.2. | |
1475 | Note that according to 5.2.4.2, a single "_" is also a valid integer | |
1476 | literal, however GNU-chill requires there to be at least one "digit" | |
1477 | in any integer literal. */ | |
1478 | ||
1479 | static int | |
2e66cf7d | 1480 | match_integer_literal () |
e58de8a2 | 1481 | { |
2e66cf7d | 1482 | char *tokptr = lexptr; |
ae0afa4b | 1483 | int ival; |
2e66cf7d | 1484 | |
ae0afa4b | 1485 | if (!decode_integer_literal (&ival, &tokptr)) |
2e66cf7d FF |
1486 | { |
1487 | return (0); | |
1488 | } | |
ae0afa4b | 1489 | else |
2e66cf7d FF |
1490 | { |
1491 | yylval.typed_val.val = ival; | |
1492 | yylval.typed_val.type = builtin_type_int; | |
1493 | lexptr = tokptr; | |
1494 | return (INTEGER_LITERAL); | |
1495 | } | |
e58de8a2 FF |
1496 | } |
1497 | ||
81028ab0 FF |
1498 | /* Recognize a bit-string literal, as specified in Z.200 sec 5.2.4.8 |
1499 | Note that according to 5.2.4.8, a single "_" is also a valid bit-string | |
1500 | literal, however GNU-chill requires there to be at least one "digit" | |
1501 | in any bit-string literal. */ | |
1502 | ||
1503 | static int | |
1504 | match_bitstring_literal () | |
1505 | { | |
1506 | char *tokptr = lexptr; | |
1507 | int mask; | |
1508 | int bitoffset = 0; | |
1509 | int bitcount = 0; | |
1510 | int base; | |
1511 | int digit; | |
81028ab0 | 1512 | |
c7da3ed3 FF |
1513 | tempbufindex = 0; |
1514 | ||
81028ab0 FF |
1515 | /* Look for the required explicit base specifier. */ |
1516 | ||
1517 | switch (*tokptr++) | |
1518 | { | |
1519 | case 'b': | |
1520 | case 'B': | |
1521 | base = 2; | |
1522 | break; | |
1523 | case 'o': | |
1524 | case 'O': | |
1525 | base = 8; | |
1526 | break; | |
1527 | case 'h': | |
1528 | case 'H': | |
1529 | base = 16; | |
1530 | break; | |
1531 | default: | |
1532 | return (0); | |
1533 | break; | |
1534 | } | |
1535 | ||
1536 | /* Ensure that the character after the explicit base is a single quote. */ | |
1537 | ||
1538 | if (*tokptr++ != '\'') | |
1539 | { | |
1540 | return (0); | |
1541 | } | |
1542 | ||
1543 | while (*tokptr != '\0' && *tokptr != '\'') | |
1544 | { | |
db2302cb PS |
1545 | digit = *tokptr; |
1546 | if (isupper (digit)) | |
1547 | digit = tolower (digit); | |
81028ab0 FF |
1548 | tokptr++; |
1549 | switch (digit) | |
1550 | { | |
1551 | case '_': | |
1552 | continue; | |
1553 | case '0': case '1': case '2': case '3': case '4': | |
1554 | case '5': case '6': case '7': case '8': case '9': | |
1555 | digit -= '0'; | |
1556 | break; | |
1557 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | |
1558 | digit -= 'a'; | |
1559 | digit += 10; | |
1560 | break; | |
1561 | default: | |
1562 | return (0); | |
1563 | break; | |
1564 | } | |
1565 | if (digit >= base) | |
1566 | { | |
1567 | /* Found something not in domain for current base. */ | |
1568 | return (0); | |
1569 | } | |
1570 | else | |
1571 | { | |
1572 | /* Extract bits from digit, starting with the msbit appropriate for | |
1573 | the current base, and packing them into the bitstring byte, | |
1574 | starting at the lsbit. */ | |
1575 | for (mask = (base >> 1); mask > 0; mask >>= 1) | |
1576 | { | |
1577 | bitcount++; | |
c7da3ed3 | 1578 | CHECKBUF (1); |
81028ab0 FF |
1579 | if (digit & mask) |
1580 | { | |
1581 | tempbuf[tempbufindex] |= (1 << bitoffset); | |
1582 | } | |
1583 | bitoffset++; | |
1584 | if (bitoffset == HOST_CHAR_BIT) | |
1585 | { | |
1586 | bitoffset = 0; | |
1587 | tempbufindex++; | |
1588 | } | |
1589 | } | |
1590 | } | |
1591 | } | |
1592 | ||
1593 | /* Verify that we consumed everything up to the trailing single quote, | |
1594 | and that we found some bits (IE not just underbars). */ | |
1595 | ||
1596 | if (*tokptr++ != '\'') | |
1597 | { | |
1598 | return (0); | |
1599 | } | |
1600 | else | |
1601 | { | |
1602 | yylval.sval.ptr = tempbuf; | |
1603 | yylval.sval.length = bitcount; | |
1604 | lexptr = tokptr; | |
1605 | return (BIT_STRING_LITERAL); | |
1606 | } | |
1607 | } | |
1608 | ||
45fe3db4 FF |
1609 | /* Recognize tokens that start with '$'. These include: |
1610 | ||
1611 | $regname A native register name or a "standard | |
1612 | register name". | |
1613 | Return token GDB_REGNAME. | |
1614 | ||
1615 | $variable A convenience variable with a name chosen | |
1616 | by the user. | |
1617 | Return token GDB_VARIABLE. | |
1618 | ||
1619 | $digits Value history with index <digits>, starting | |
1620 | from the first value which has index 1. | |
1621 | Return GDB_LAST. | |
1622 | ||
1623 | $$digits Value history with index <digits> relative | |
1624 | to the last value. I.E. $$0 is the last | |
1625 | value, $$1 is the one previous to that, $$2 | |
1626 | is the one previous to $$1, etc. | |
1627 | Return token GDB_LAST. | |
1628 | ||
1629 | $ | $0 | $$0 The last value in the value history. | |
1630 | Return token GDB_LAST. | |
1631 | ||
1632 | $$ An abbreviation for the second to the last | |
1633 | value in the value history, I.E. $$1 | |
1634 | Return token GDB_LAST. | |
1635 | ||
1636 | Note that we currently assume that register names and convenience | |
1637 | variables follow the convention of starting with a letter or '_'. | |
1638 | ||
1639 | */ | |
1640 | ||
1641 | static int | |
1642 | match_dollar_tokens () | |
1643 | { | |
1644 | char *tokptr; | |
1645 | int regno; | |
1646 | int namelength; | |
1647 | int negate; | |
1648 | int ival; | |
1649 | ||
1650 | /* We will always have a successful match, even if it is just for | |
1651 | a single '$', the abbreviation for $$0. So advance lexptr. */ | |
1652 | ||
1653 | tokptr = ++lexptr; | |
1654 | ||
1655 | if (*tokptr == '_' || isalpha (*tokptr)) | |
1656 | { | |
1657 | /* Look for a match with a native register name, usually something | |
1658 | like "r0" for example. */ | |
1659 | ||
1660 | for (regno = 0; regno < NUM_REGS; regno++) | |
1661 | { | |
1662 | namelength = strlen (reg_names[regno]); | |
1663 | if (STREQN (tokptr, reg_names[regno], namelength) | |
1664 | && !isalnum (tokptr[namelength])) | |
1665 | { | |
1666 | yylval.lval = regno; | |
cba00921 | 1667 | lexptr += namelength; |
45fe3db4 FF |
1668 | return (GDB_REGNAME); |
1669 | } | |
1670 | } | |
1671 | ||
1672 | /* Look for a match with a standard register name, usually something | |
1673 | like "pc", which gdb always recognizes as the program counter | |
1674 | regardless of what the native register name is. */ | |
1675 | ||
1676 | for (regno = 0; regno < num_std_regs; regno++) | |
1677 | { | |
1678 | namelength = strlen (std_regs[regno].name); | |
1679 | if (STREQN (tokptr, std_regs[regno].name, namelength) | |
1680 | && !isalnum (tokptr[namelength])) | |
1681 | { | |
1682 | yylval.lval = std_regs[regno].regnum; | |
1683 | lexptr += namelength; | |
1684 | return (GDB_REGNAME); | |
1685 | } | |
1686 | } | |
1687 | ||
1688 | /* Attempt to match against a convenience variable. Note that | |
1689 | this will always succeed, because if no variable of that name | |
1690 | already exists, the lookup_internalvar will create one for us. | |
1691 | Also note that both lexptr and tokptr currently point to the | |
1692 | start of the input string we are trying to match, and that we | |
1693 | have already tested the first character for non-numeric, so we | |
1694 | don't have to treat it specially. */ | |
1695 | ||
1696 | while (*tokptr == '_' || isalnum (*tokptr)) | |
1697 | { | |
1698 | tokptr++; | |
1699 | } | |
1700 | yylval.sval.ptr = lexptr; | |
1701 | yylval.sval.length = tokptr - lexptr; | |
1702 | yylval.ivar = lookup_internalvar (copy_name (yylval.sval)); | |
1703 | lexptr = tokptr; | |
1704 | return (GDB_VARIABLE); | |
1705 | } | |
1706 | ||
1707 | /* Since we didn't match against a register name or convenience | |
1708 | variable, our only choice left is a history value. */ | |
1709 | ||
1710 | if (*tokptr == '$') | |
1711 | { | |
1712 | negate = 1; | |
1713 | ival = 1; | |
1714 | tokptr++; | |
1715 | } | |
1716 | else | |
1717 | { | |
1718 | negate = 0; | |
1719 | ival = 0; | |
1720 | } | |
1721 | ||
1722 | /* Attempt to decode more characters as an integer value giving | |
1723 | the index in the history list. If successful, the value will | |
1724 | overwrite ival (currently 0 or 1), and if not, ival will be | |
1725 | left alone, which is good since it is currently correct for | |
1726 | the '$' or '$$' case. */ | |
1727 | ||
1728 | decode_integer_literal (&ival, &tokptr); | |
1729 | yylval.lval = negate ? -ival : ival; | |
1730 | lexptr = tokptr; | |
1731 | return (GDB_LAST); | |
1732 | } | |
1733 | ||
e58de8a2 FF |
1734 | struct token |
1735 | { | |
1736 | char *operator; | |
1737 | int token; | |
1738 | }; | |
1739 | ||
5a7c9cce | 1740 | static const struct token idtokentab[] = |
81028ab0 | 1741 | { |
5a7c9cce PB |
1742 | { "length", LENGTH }, |
1743 | { "lower", LOWER }, | |
1744 | { "upper", UPPER }, | |
1745 | { "andif", ANDIF }, | |
1746 | { "pred", PRED }, | |
1747 | { "succ", SUCC }, | |
1748 | { "card", CARD }, | |
1749 | { "size", SIZE }, | |
1750 | { "orif", ORIF }, | |
1751 | { "num", NUM }, | |
1752 | { "abs", ABS }, | |
57ffffe3 JG |
1753 | { "max", MAX_TOKEN }, |
1754 | { "min", MIN_TOKEN }, | |
5a7c9cce PB |
1755 | { "mod", MOD }, |
1756 | { "rem", REM }, | |
1757 | { "not", NOT }, | |
1758 | { "xor", LOGXOR }, | |
1759 | { "and", LOGAND }, | |
1760 | { "in", IN }, | |
2d67c7e9 PB |
1761 | { "or", LOGIOR }, |
1762 | { "null", EMPTINESS_LITERAL } | |
e58de8a2 FF |
1763 | }; |
1764 | ||
a8a69e63 | 1765 | static const struct token tokentab2[] = |
e58de8a2 | 1766 | { |
45fe3db4 | 1767 | { ":=", GDB_ASSIGNMENT }, |
e58de8a2 | 1768 | { "//", SLASH_SLASH }, |
8a177da6 | 1769 | { "->", POINTER }, |
e58de8a2 FF |
1770 | { "/=", NOTEQUAL }, |
1771 | { "<=", LEQ }, | |
5a7c9cce | 1772 | { ">=", GTR } |
e58de8a2 FF |
1773 | }; |
1774 | ||
1775 | /* Read one token, getting characters through lexptr. */ | |
1776 | /* This is where we will check to make sure that the language and the | |
1777 | operators used are compatible. */ | |
1778 | ||
1779 | static int | |
1780 | yylex () | |
1781 | { | |
1782 | unsigned int i; | |
1783 | int token; | |
ad86f717 | 1784 | char *inputname; |
cbd1bdc3 | 1785 | struct symbol *sym; |
e58de8a2 FF |
1786 | |
1787 | /* Skip over any leading whitespace. */ | |
1788 | while (isspace (*lexptr)) | |
1789 | { | |
1790 | lexptr++; | |
1791 | } | |
1792 | /* Look for special single character cases which can't be the first | |
1793 | character of some other multicharacter token. */ | |
1794 | switch (*lexptr) | |
1795 | { | |
1796 | case '\0': | |
1797 | return (0); | |
54bbbfb4 | 1798 | case ',': |
e58de8a2 | 1799 | case '=': |
e58de8a2 FF |
1800 | case ';': |
1801 | case '!': | |
1802 | case '+': | |
e58de8a2 | 1803 | case '*': |
e58de8a2 FF |
1804 | case '(': |
1805 | case ')': | |
1806 | case '[': | |
1807 | case ']': | |
1808 | return (*lexptr++); | |
1809 | } | |
1810 | /* Look for characters which start a particular kind of multicharacter | |
45fe3db4 | 1811 | token, such as a character literal, register name, convenience |
c7da3ed3 | 1812 | variable name, string literal, etc. */ |
e58de8a2 | 1813 | switch (*lexptr) |
2e66cf7d | 1814 | { |
c7da3ed3 FF |
1815 | case '\'': |
1816 | case '\"': | |
96b6b765 | 1817 | /* First try to match a string literal, which is any |
c7da3ed3 FF |
1818 | sequence of characters enclosed in matching single or double |
1819 | quotes, except that a single character inside single quotes | |
1820 | is a character literal, so we have to catch that case also. */ | |
1821 | token = match_string_literal (); | |
1822 | if (token != 0) | |
1823 | { | |
1824 | return (token); | |
1825 | } | |
1826 | if (*lexptr == '\'') | |
1827 | { | |
1828 | token = match_character_literal (); | |
1829 | if (token != 0) | |
1830 | { | |
1831 | return (token); | |
1832 | } | |
1833 | } | |
1834 | break; | |
5d074aa9 FF |
1835 | case 'C': |
1836 | case 'c': | |
2e66cf7d FF |
1837 | token = match_character_literal (); |
1838 | if (token != 0) | |
1839 | { | |
1840 | return (token); | |
1841 | } | |
1842 | break; | |
45fe3db4 FF |
1843 | case '$': |
1844 | token = match_dollar_tokens (); | |
1845 | if (token != 0) | |
1846 | { | |
1847 | return (token); | |
1848 | } | |
1849 | break; | |
2e66cf7d | 1850 | } |
e58de8a2 FF |
1851 | /* See if it is a special token of length 2. */ |
1852 | for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++) | |
1853 | { | |
45fe3db4 | 1854 | if (STREQN (lexptr, tokentab2[i].operator, 2)) |
e58de8a2 FF |
1855 | { |
1856 | lexptr += 2; | |
1857 | return (tokentab2[i].token); | |
1858 | } | |
1859 | } | |
1860 | /* Look for single character cases which which could be the first | |
1861 | character of some other multicharacter token, but aren't, or we | |
1862 | would already have found it. */ | |
1863 | switch (*lexptr) | |
1864 | { | |
8a177da6 | 1865 | case '-': |
45fe3db4 | 1866 | case ':': |
e58de8a2 FF |
1867 | case '/': |
1868 | case '<': | |
1869 | case '>': | |
1870 | return (*lexptr++); | |
1871 | } | |
1188fbbf FF |
1872 | /* Look for a float literal before looking for an integer literal, so |
1873 | we match as much of the input stream as possible. */ | |
1874 | token = match_float_literal (); | |
81028ab0 FF |
1875 | if (token != 0) |
1876 | { | |
1877 | return (token); | |
1878 | } | |
1879 | token = match_bitstring_literal (); | |
1188fbbf FF |
1880 | if (token != 0) |
1881 | { | |
1882 | return (token); | |
1883 | } | |
2e66cf7d | 1884 | token = match_integer_literal (); |
cbd1bdc3 | 1885 | if (token != 0) |
e58de8a2 FF |
1886 | { |
1887 | return (token); | |
1888 | } | |
cbd1bdc3 FF |
1889 | |
1890 | /* Try to match a simple name string, and if a match is found, then | |
1891 | further classify what sort of name it is and return an appropriate | |
1892 | token. Note that attempting to match a simple name string consumes | |
1893 | the token from lexptr, so we can't back out if we later find that | |
1894 | we can't classify what sort of name it is. */ | |
1895 | ||
ad86f717 | 1896 | inputname = match_simple_name_string (); |
5a7c9cce | 1897 | |
ad86f717 | 1898 | if (inputname != NULL) |
cbd1bdc3 | 1899 | { |
a30e2087 | 1900 | char *simplename = (char*) alloca (strlen (inputname) + 1); |
ad86f717 PB |
1901 | |
1902 | char *dptr = simplename, *sptr = inputname; | |
1903 | for (; *sptr; sptr++) | |
1904 | *dptr++ = isupper (*sptr) ? tolower(*sptr) : *sptr; | |
a30e2087 | 1905 | *dptr = '\0'; |
ad86f717 | 1906 | |
d8f23320 PS |
1907 | /* See if it is a reserved identifier. */ |
1908 | for (i = 0; i < sizeof (idtokentab) / sizeof (idtokentab[0]); i++) | |
1909 | { | |
1910 | if (STREQ (simplename, idtokentab[i].operator)) | |
1911 | { | |
1912 | return (idtokentab[i].token); | |
1913 | } | |
1914 | } | |
1915 | ||
1916 | /* Look for other special tokens. */ | |
1917 | if (STREQ (simplename, "true")) | |
1918 | { | |
1919 | yylval.ulval = 1; | |
1920 | return (BOOLEAN_LITERAL); | |
1921 | } | |
1922 | if (STREQ (simplename, "false")) | |
1923 | { | |
1924 | yylval.ulval = 0; | |
1925 | return (BOOLEAN_LITERAL); | |
1926 | } | |
1927 | ||
ad86f717 | 1928 | sym = lookup_symbol (inputname, expression_context_block, |
cbd1bdc3 FF |
1929 | VAR_NAMESPACE, (int *) NULL, |
1930 | (struct symtab **) NULL); | |
ad86f717 PB |
1931 | if (sym == NULL && strcmp (inputname, simplename) != 0) |
1932 | { | |
1933 | sym = lookup_symbol (simplename, expression_context_block, | |
1934 | VAR_NAMESPACE, (int *) NULL, | |
1935 | (struct symtab **) NULL); | |
1936 | } | |
cbd1bdc3 FF |
1937 | if (sym != NULL) |
1938 | { | |
1939 | yylval.ssym.stoken.ptr = NULL; | |
1940 | yylval.ssym.stoken.length = 0; | |
1941 | yylval.ssym.sym = sym; | |
1942 | yylval.ssym.is_a_field_of_this = 0; /* FIXME, C++'ism */ | |
1943 | switch (SYMBOL_CLASS (sym)) | |
1944 | { | |
1945 | case LOC_BLOCK: | |
1946 | /* Found a procedure name. */ | |
1947 | return (GENERAL_PROCEDURE_NAME); | |
1948 | case LOC_STATIC: | |
1949 | /* Found a global or local static variable. */ | |
1950 | return (LOCATION_NAME); | |
a8a69e63 FF |
1951 | case LOC_REGISTER: |
1952 | case LOC_ARG: | |
1953 | case LOC_REF_ARG: | |
1954 | case LOC_REGPARM: | |
996ccb30 | 1955 | case LOC_REGPARM_ADDR: |
a8a69e63 | 1956 | case LOC_LOCAL: |
76a0ffb4 | 1957 | case LOC_LOCAL_ARG: |
a1c8d76e JK |
1958 | case LOC_BASEREG: |
1959 | case LOC_BASEREG_ARG: | |
76a0ffb4 FF |
1960 | if (innermost_block == NULL |
1961 | || contained_in (block_found, innermost_block)) | |
1962 | { | |
1963 | innermost_block = block_found; | |
1964 | } | |
1965 | return (LOCATION_NAME); | |
1966 | break; | |
1967 | case LOC_CONST: | |
a8a69e63 | 1968 | case LOC_LABEL: |
76a0ffb4 FF |
1969 | return (LOCATION_NAME); |
1970 | break; | |
76a0ffb4 | 1971 | case LOC_TYPEDEF: |
8a177da6 PB |
1972 | yylval.tsym.type = SYMBOL_TYPE (sym); |
1973 | return TYPENAME; | |
1974 | case LOC_UNDEF: | |
a8a69e63 | 1975 | case LOC_CONST_BYTES: |
0848ad1c | 1976 | case LOC_OPTIMIZED_OUT: |
ad86f717 | 1977 | error ("Symbol \"%s\" names no location.", inputname); |
a8a69e63 | 1978 | break; |
cbd1bdc3 FF |
1979 | } |
1980 | } | |
1981 | else if (!have_full_symbols () && !have_partial_symbols ()) | |
1982 | { | |
1983 | error ("No symbol table is loaded. Use the \"file\" command."); | |
1984 | } | |
1985 | else | |
1986 | { | |
ad86f717 | 1987 | error ("No symbol \"%s\" in current context.", inputname); |
cbd1bdc3 FF |
1988 | } |
1989 | } | |
1990 | ||
1188fbbf FF |
1991 | /* Catch single character tokens which are not part of some |
1992 | longer token. */ | |
1993 | ||
1994 | switch (*lexptr) | |
1995 | { | |
1996 | case '.': /* Not float for example. */ | |
8a177da6 PB |
1997 | lexptr++; |
1998 | while (isspace (*lexptr)) lexptr++; | |
ad86f717 PB |
1999 | inputname = match_simple_name_string (); |
2000 | if (!inputname) | |
8a177da6 PB |
2001 | return '.'; |
2002 | return FIELD_NAME; | |
1188fbbf FF |
2003 | } |
2004 | ||
e58de8a2 FF |
2005 | return (ILLEGAL_TOKEN); |
2006 | } | |
2007 | ||
22e39759 | 2008 | void |
e58de8a2 | 2009 | yyerror (msg) |
8db1a922 | 2010 | char *msg; |
e58de8a2 | 2011 | { |
8db1a922 | 2012 | error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr); |
e58de8a2 | 2013 | } |