|
143
|
1 /* parse.y -*- text -*- |
|
1
|
2 |
|
|
3 Copyright (C) 1992, 1993 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
|
19 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 // Parser for Octave. |
|
|
24 |
|
|
25 /* |
|
|
26 * C decarations. |
|
|
27 */ |
|
|
28 %{ |
|
|
29 #define YYDEBUG 1 |
|
|
30 |
|
|
31 #include "SLStack.h" |
|
|
32 |
|
|
33 #include "Matrix.h" |
|
|
34 |
|
|
35 #include "error.h" |
|
|
36 #include "variables.h" |
|
168
|
37 #include "octave-hist.h" |
|
1
|
38 #include "user-prefs.h" |
|
|
39 #include "input.h" |
|
|
40 #include "utils.h" |
|
|
41 #include "tree.h" |
|
|
42 #include "symtab.h" |
|
|
43 #include "builtins.h" |
|
|
44 #include "octave.h" |
|
|
45 #include "parse.h" |
|
|
46 #include "lex.h" |
|
143
|
47 #include "token.h" |
|
1
|
48 |
|
|
49 // Identifier to define if we are reading an M-fie. |
|
|
50 tree_identifier *id_to_define; |
|
|
51 |
|
|
52 // Nonzero means we're in the middle of defining a function. |
|
|
53 int defining_func = 0; |
|
|
54 |
|
|
55 // Nonzero means we're in the middle of defining a loop. |
|
|
56 int looping = 0; |
|
|
57 |
|
|
58 // Nonzero means we're in the middle of defining a conditional expression. |
|
|
59 int iffing = 0; |
|
|
60 |
|
|
61 // Nonzero means we need to do some extra lookahead to avoid being |
|
|
62 // screwed by bogus function syntax. |
|
|
63 int maybe_screwed = 0; |
|
|
64 |
|
|
65 // Nonzero means we need to do some extra lookahead to avoid being |
|
|
66 // screwed by bogus function syntax. |
|
|
67 int maybe_screwed_again = 0; |
|
|
68 |
|
|
69 // Temporary symbol table pointer used to cope with bogus function syntax. |
|
|
70 symbol_table *tmp_local_sym_tab = (symbol_table *) NULL; |
|
|
71 |
|
|
72 // Stack to hold list of literal matrices. |
|
|
73 SLStack <tree_matrix *> ml; |
|
|
74 |
|
|
75 // A nonzero element corresponding to an element of ml means we just |
|
|
76 // started reading a new matrix. This should probably be part of a |
|
|
77 // new struct for matrix lists... |
|
|
78 SLStack <int> mlnm; |
|
|
79 |
|
|
80 // The current input line number. |
|
|
81 int input_line_number = 0; |
|
|
82 |
|
|
83 // The column of the current token. |
|
143
|
84 int current_input_column = 1; |
|
1
|
85 |
|
|
86 // Buffer for help text snagged from M-files. |
|
|
87 // Probably shouldn't be a fixed size... |
|
|
88 char help_buf [HELP_BUF_LENGTH]; |
|
|
89 |
|
|
90 // Nonzero means we're working on a plot command. |
|
|
91 int plotting = 0; |
|
|
92 |
|
113
|
93 // Nonzero means we've seen something that means we must be past the |
|
|
94 // range part of a plot command. |
|
|
95 int past_plot_range = 0; |
|
|
96 |
|
1
|
97 // Nonzero means we're looking at the range part of a plot command. |
|
|
98 int in_plot_range = 0; |
|
|
99 |
|
|
100 // Nonzero means we're looking at the using part of a plot command. |
|
|
101 int in_plot_using = 0; |
|
|
102 |
|
|
103 // Nonzero means we're looking at the style part of a plot command. |
|
|
104 int in_plot_style = 0; |
|
|
105 |
|
143
|
106 // Check to see that end statements are properly matched. |
|
|
107 static int check_end (token *tok, token::end_tok_type expected); |
|
1
|
108 |
|
|
109 // Error mesages for mismatched end statements. |
|
143
|
110 static void end_error (char *type, token::end_tok_type ettype, int l, int c); |
|
1
|
111 |
|
|
112 // Generic error messages. |
|
|
113 static void yyerror (char *s); |
|
|
114 |
|
|
115 static tree *maybe_convert_to_ans_assign (tree *expr); |
|
|
116 static void maybe_warn_assign_as_truth_value (tree *expr); |
|
|
117 |
|
|
118 #define ABORT_PARSE \ |
|
|
119 do \ |
|
|
120 { \ |
|
|
121 global_command = NULL_TREE; \ |
|
|
122 reset_parser (); \ |
|
|
123 yyerrok; \ |
|
|
124 if (interactive) \ |
|
|
125 YYACCEPT; \ |
|
|
126 else \ |
|
|
127 YYABORT; \ |
|
|
128 } \ |
|
|
129 while (0) |
|
|
130 |
|
|
131 %} |
|
|
132 |
|
|
133 /* |
|
|
134 * Bison declarations. |
|
|
135 */ |
|
|
136 %union |
|
|
137 { |
|
143
|
138 // The type of the basic tokens returned by the lexer. |
|
|
139 token *tok_val; |
|
|
140 |
|
|
141 // Types for the nonterminals we generate. |
|
1
|
142 tree *tree_type; |
|
|
143 tree_constant *tree_constant_type; |
|
|
144 tree_matrix *tree_matrix_type; |
|
|
145 tree_identifier *tree_identifier_type; |
|
|
146 tree_function *tree_function_type; |
|
|
147 tree_index_expression *tree_index_expression_type; |
|
|
148 tree_colon_expression *tree_colon_expression_type; |
|
|
149 tree_argument_list *tree_argument_list_type; |
|
|
150 tree_parameter_list *tree_parameter_list_type; |
|
|
151 tree_word_list *tree_word_list_type; |
|
|
152 tree_command *tree_command_type; |
|
|
153 tree_if_command *tree_if_command_type; |
|
|
154 tree_command_list *tree_command_list_type; |
|
|
155 tree_word_list_command *tree_word_list_command_type; |
|
|
156 tree_plot_command *tree_plot_command_type; |
|
|
157 tree_subplot_list *tree_subplot_list_type; |
|
|
158 tree_plot_limits *tree_plot_limits_type; |
|
|
159 tree_plot_range *tree_plot_range_type; |
|
|
160 tree_subplot_using *tree_subplot_using_type; |
|
|
161 tree_subplot_style *tree_subplot_style_type; |
|
|
162 } |
|
|
163 |
|
143
|
164 // Tokens with line and column information. |
|
|
165 %token <tok_val> '=' ':' '-' '+' '*' '/' |
|
|
166 %token <tok_val> EXPR_AND EXPR_OR EXPR_NOT |
|
|
167 %token <tok_val> EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
168 %token <tok_val> LEFTDIV EMUL EDIV ELEFTDIV QUOTE TRANSPOSE |
|
|
169 %token <tok_val> PLUS_PLUS MINUS_MINUS POW EPOW |
|
|
170 %token <tok_val> NUM IMAG_NUM |
|
|
171 %token <tok_val> NAME SCREW CLEAR |
|
|
172 %token <tok_val> END |
|
|
173 %token <tok_val> PLOT |
|
|
174 %token <tok_val> TEXT STYLE |
|
1
|
175 |
|
143
|
176 // Other tokens. |
|
1
|
177 %token FOR WHILE IF ELSEIF ELSE FCN BREAK CONTINUE FUNC_RET SCREW_TWO |
|
143
|
178 %token END_OF_INPUT GLOBAL |
|
1
|
179 %token USING TITLE WITH COLON OPEN_BRACE CLOSE_BRACE |
|
|
180 |
|
143
|
181 // Nonterminals we construct. |
|
1
|
182 %type <tree_type> input command |
|
|
183 %type <tree_type> ans_expression expression simple_expr simple_expr1 |
|
|
184 %type <tree_type> title |
|
|
185 %type <tree_matrix_type> matrix |
|
|
186 %type <tree_identifier_type> identifier |
|
|
187 %type <tree_function_type> func_def func_def1 func_def2 func_def3 |
|
|
188 %type <tree_index_expression_type> variable |
|
|
189 %type <tree_colon_expression_type> colon_expr |
|
|
190 %type <tree_argument_list_type> arg_list arg_list1 |
|
|
191 %type <tree_parameter_list_type> param_list param_list1 func_def1a |
|
|
192 %type <tree_word_list_type> word_list word_list1 |
|
|
193 %type <tree_command_type> statement |
|
|
194 %type <tree_if_command_type> elseif |
|
|
195 %type <tree_command_list_type> simple_list simple_list1 list list1 opt_list |
|
|
196 %type <tree_word_list_command_type> word_list_cmd |
|
|
197 %type <tree_plot_command_type> plot_command |
|
|
198 %type <tree_subplot_list_type> plot_command1 plot_command2 plot_options |
|
|
199 %type <tree_plot_limits_type> ranges |
|
|
200 %type <tree_plot_range_type> ranges1 |
|
|
201 %type <tree_subplot_using_type> using using1 |
|
|
202 %type <tree_subplot_style_type> style |
|
|
203 |
|
143
|
204 // Precedence and associativity. |
|
1
|
205 %left ';' ',' '\n' |
|
|
206 %right '=' |
|
|
207 %left EXPR_AND EXPR_OR |
|
|
208 %left EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
209 %left ':' |
|
|
210 %left '-' '+' |
|
|
211 %left '*' '/' LEFTDIV EMUL EDIV ELEFTDIV |
|
|
212 %left QUOTE TRANSPOSE |
|
|
213 %left UNARY PLUS_PLUS MINUS_MINUS EXPR_NOT |
|
|
214 %right POW EPOW |
|
|
215 |
|
143
|
216 // There are 20 shift/reduce conflicts, ok? |
|
|
217 %expect 20 |
|
|
218 |
|
|
219 // Where to start. |
|
1
|
220 %start input |
|
|
221 |
|
|
222 /* |
|
|
223 * Grammar rules. |
|
|
224 */ |
|
|
225 %% |
|
|
226 |
|
|
227 input : '\n' |
|
|
228 { |
|
|
229 global_command = NULL_TREE; |
|
|
230 promptflag = 1; |
|
|
231 YYACCEPT; |
|
|
232 } |
|
|
233 | END_OF_INPUT |
|
|
234 { |
|
|
235 global_command = NULL_TREE; |
|
|
236 promptflag = 1; |
|
|
237 YYABORT; |
|
|
238 } |
|
|
239 | simple_list '\n' |
|
|
240 { |
|
|
241 global_command = $1; |
|
|
242 promptflag = 1; |
|
|
243 YYACCEPT; |
|
|
244 } |
|
|
245 | simple_list END_OF_INPUT |
|
|
246 { |
|
|
247 global_command = $1; |
|
|
248 promptflag = 1; |
|
|
249 YYACCEPT; |
|
|
250 } |
|
|
251 | error |
|
|
252 { ABORT_PARSE; } |
|
|
253 | error '\n' |
|
|
254 { ABORT_PARSE; } |
|
|
255 | error END_OF_INPUT |
|
|
256 { ABORT_PARSE; } |
|
|
257 | simple_list error |
|
|
258 { ABORT_PARSE; } |
|
|
259 | simple_list error END_OF_INPUT |
|
|
260 { ABORT_PARSE; } |
|
|
261 ; |
|
|
262 |
|
|
263 simple_list : semi_comma |
|
|
264 { $$ = (tree_command_list *) NULL; } |
|
|
265 | comma_semi |
|
|
266 { $$ = (tree_command_list *) NULL; } |
|
|
267 | simple_list1 |
|
|
268 { $$ = $1->reverse (); } |
|
|
269 | simple_list1 semi_comma |
|
|
270 { |
|
|
271 $1->set_print_flag (0); |
|
|
272 $$ = $1->reverse (); |
|
|
273 } |
|
|
274 | simple_list1 comma_semi |
|
|
275 { $$ = $1->reverse (); } |
|
|
276 ; |
|
|
277 |
|
|
278 simple_list1 : command |
|
|
279 { $$ = new tree_command_list ($1); } |
|
|
280 | semi_comma command |
|
|
281 { $$ = new tree_command_list ($2); } |
|
|
282 | comma_semi command |
|
|
283 { $$ = new tree_command_list ($2); } |
|
|
284 | simple_list1 semi_comma command |
|
|
285 { |
|
|
286 $1->set_print_flag (0); |
|
|
287 $$ = $1->chain ($3); |
|
|
288 } |
|
|
289 | simple_list1 comma_semi command |
|
|
290 { $$ = $1->chain ($3); } |
|
|
291 ; |
|
|
292 |
|
|
293 semi_comma : ';' |
|
|
294 | semi_comma ',' |
|
|
295 | semi_comma ';' |
|
|
296 ; |
|
|
297 |
|
|
298 comma_semi : ',' |
|
|
299 | comma_semi ';' |
|
|
300 | comma_semi ',' |
|
|
301 ; |
|
|
302 |
|
|
303 comma_nl_sep : ',' |
|
|
304 | '\n' |
|
|
305 | comma_nl_sep sep |
|
|
306 ; |
|
|
307 |
|
|
308 semi_sep : ';' |
|
|
309 | semi_sep sep |
|
|
310 ; |
|
|
311 |
|
|
312 opt_list : // empty |
|
|
313 { $$ = new tree_command_list (); } |
|
|
314 | list |
|
|
315 { $$ = $1; } |
|
|
316 |
|
|
317 list : list1 |
|
|
318 { $$ = $1->reverse (); } |
|
|
319 | list1 comma_nl_sep |
|
|
320 { $$ = $1->reverse (); } |
|
|
321 | list1 semi_sep |
|
|
322 { |
|
|
323 $1->set_print_flag (0); |
|
|
324 $$ = $1->reverse (); |
|
|
325 } |
|
|
326 ; |
|
|
327 |
|
|
328 list1 : command |
|
|
329 { $$ = new tree_command_list ($1); } |
|
|
330 | list1 comma_nl_sep command |
|
|
331 { $$ = $1->chain ($3); } |
|
|
332 | list1 semi_sep command |
|
|
333 { |
|
|
334 $1->set_print_flag (0); |
|
|
335 $$ = $1->chain ($3); |
|
|
336 } |
|
|
337 ; |
|
|
338 |
|
|
339 command : plot_command |
|
|
340 { $$ = $1; } |
|
|
341 | statement |
|
|
342 { $$ = $1; } |
|
|
343 | ans_expression |
|
|
344 { $$ = $1; } |
|
|
345 | func_def |
|
|
346 { $$ = $1; } |
|
|
347 | global_decl |
|
|
348 { $$ = NULL_TREE; } |
|
|
349 ; |
|
|
350 |
|
|
351 plot_command : PLOT plot_command1 |
|
|
352 { |
|
|
353 tree_subplot_list *tmp = $2->reverse (); |
|
143
|
354 $$ = new tree_plot_command (tmp, $1->pttype ()); |
|
1
|
355 plotting = 0; |
|
113
|
356 past_plot_range = 0; |
|
1
|
357 in_plot_range = 0; |
|
|
358 in_plot_using = 0; |
|
|
359 in_plot_style = 0; |
|
|
360 } |
|
|
361 | PLOT ranges plot_command1 |
|
|
362 { |
|
|
363 tree_subplot_list *tmp = $3->reverse (); |
|
143
|
364 $$ = new tree_plot_command (tmp, $2, $1->pttype ()); |
|
1
|
365 plotting = 0; |
|
113
|
366 past_plot_range = 0; |
|
1
|
367 in_plot_range = 0; |
|
|
368 in_plot_using = 0; |
|
|
369 in_plot_style = 0; |
|
|
370 } |
|
|
371 ; |
|
|
372 |
|
|
373 ranges : ranges1 |
|
|
374 { $$ = new tree_plot_limits ($1); } |
|
|
375 | ranges1 ranges1 |
|
|
376 { $$ = new tree_plot_limits ($1, $2); } |
|
|
377 | ranges1 ranges1 ranges1 |
|
|
378 { $$ = new tree_plot_limits ($1, $2, $3); } |
|
|
379 ; |
|
|
380 |
|
|
381 ranges1 : OPEN_BRACE expression COLON expression CLOSE_BRACE |
|
|
382 { $$ = new tree_plot_range ($2, $4); } |
|
|
383 | OPEN_BRACE COLON expression CLOSE_BRACE |
|
|
384 { $$ = new tree_plot_range (NULL, $3); } |
|
|
385 | OPEN_BRACE expression COLON CLOSE_BRACE |
|
|
386 { $$ = new tree_plot_range ($2, NULL); } |
|
|
387 | OPEN_BRACE COLON CLOSE_BRACE |
|
|
388 { $$ = new tree_plot_range (); } |
|
|
389 | OPEN_BRACE CLOSE_BRACE |
|
|
390 { $$ = new tree_plot_range (); } |
|
|
391 ; |
|
|
392 |
|
|
393 plot_command1 : plot_command2 |
|
|
394 { $$ = $1; } |
|
|
395 | plot_command1 ',' plot_command2 |
|
|
396 { $$ = $1->chain ($3); } |
|
|
397 ; |
|
|
398 |
|
|
399 plot_command2 : expression |
|
|
400 { $$ = new tree_subplot_list ($1); } |
|
|
401 | expression plot_options |
|
|
402 { $$ = $2->set_data ($1); } |
|
|
403 ; |
|
|
404 |
|
|
405 plot_options : using |
|
|
406 { $$ = new tree_subplot_list ($1, NULL, NULL); } |
|
|
407 | title |
|
|
408 { $$ = new tree_subplot_list (NULL, $1, NULL); } |
|
|
409 | style |
|
|
410 { $$ = new tree_subplot_list (NULL, NULL, $1); } |
|
|
411 | using title |
|
|
412 { $$ = new tree_subplot_list ($1, $2, NULL); } |
|
|
413 | title using |
|
|
414 { $$ = new tree_subplot_list ($2, $1, NULL); } |
|
|
415 | using style |
|
|
416 { $$ = new tree_subplot_list ($1, NULL, $2); } |
|
|
417 | style using |
|
|
418 { $$ = new tree_subplot_list ($2, NULL, $1); } |
|
|
419 | title style |
|
|
420 { $$ = new tree_subplot_list (NULL, $1, $2); } |
|
|
421 | style title |
|
|
422 { $$ = new tree_subplot_list (NULL, $2, $1); } |
|
|
423 | using title style |
|
|
424 { $$ = new tree_subplot_list ($1, $2, $3); } |
|
|
425 | using style title |
|
|
426 { $$ = new tree_subplot_list ($1, $3, $2); } |
|
|
427 | title using style |
|
|
428 { $$ = new tree_subplot_list ($2, $1, $3); } |
|
|
429 | title style using |
|
|
430 { $$ = new tree_subplot_list ($3, $1, $2); } |
|
|
431 | style using title |
|
|
432 { $$ = new tree_subplot_list ($2, $3, $1); } |
|
|
433 | style title using |
|
|
434 { $$ = new tree_subplot_list ($3, $2, $1); } |
|
|
435 ; |
|
|
436 |
|
|
437 using : using1 |
|
|
438 { |
|
|
439 $$ = $1; |
|
|
440 in_plot_using = 0; |
|
|
441 } |
|
|
442 | using1 expression |
|
|
443 { |
|
|
444 $$ = $1->set_format ($2); |
|
|
445 in_plot_using = 0; |
|
|
446 } |
|
|
447 ; |
|
|
448 |
|
|
449 using1 : USING expression |
|
|
450 { |
|
|
451 tree_subplot_using *tmp = new tree_subplot_using (); |
|
|
452 $$ = tmp->add_qualifier ($2); |
|
|
453 } |
|
|
454 | using1 COLON expression |
|
|
455 { $$ = $1->add_qualifier ($3); } |
|
|
456 ; |
|
|
457 |
|
|
458 title : TITLE expression |
|
|
459 { $$ = $2; } |
|
|
460 ; |
|
|
461 |
|
|
462 style : WITH STYLE |
|
143
|
463 { $$ = new tree_subplot_style ($2->string ()); } |
|
1
|
464 | WITH STYLE expression |
|
143
|
465 { $$ = new tree_subplot_style ($2->string (), $3); } |
|
1
|
466 | WITH STYLE expression bogus_syntax expression |
|
143
|
467 { $$ = new tree_subplot_style ($2->string (), $3, $5); } |
|
1
|
468 ; |
|
|
469 |
|
|
470 bogus_syntax : // empty |
|
|
471 ; |
|
|
472 |
|
|
473 ans_expression : expression |
|
|
474 { $$ = maybe_convert_to_ans_assign ($1); } |
|
|
475 ; |
|
|
476 |
|
|
477 global_decl : GLOBAL global_decl1 |
|
|
478 { } |
|
|
479 ; |
|
|
480 |
|
|
481 global_decl1 : NAME |
|
143
|
482 { force_global ($1->sym_rec()->name ()); } |
|
1
|
483 | NAME '=' expression |
|
|
484 { |
|
143
|
485 symbol_record *sr = force_global ($1->sym_rec()->name ()); |
|
|
486 tree_identifier *id = new tree_identifier |
|
|
487 (sr, $1->line (), $1->column ()); |
|
1
|
488 tree_simple_assignment_expression *expr = |
|
143
|
489 new tree_simple_assignment_expression |
|
168
|
490 (id, $3, $2->line (), $2->column ()); |
|
1
|
491 expr->eval (0); |
|
|
492 } |
|
|
493 | global_decl1 optcomma NAME |
|
143
|
494 { force_global ($3->sym_rec()->name ()); } |
|
1
|
495 | global_decl1 optcomma NAME '=' expression |
|
|
496 { |
|
143
|
497 symbol_record *sr = force_global ($3->sym_rec()->name ()); |
|
|
498 tree_identifier *id = new tree_identifier |
|
|
499 (sr, $3->line (), $3->column ()); |
|
1
|
500 tree_simple_assignment_expression *expr = |
|
143
|
501 new tree_simple_assignment_expression |
|
|
502 (id, $5, $4->line (), $4->column ()); |
|
1
|
503 expr->eval (0); |
|
|
504 } |
|
|
505 ; |
|
|
506 |
|
|
507 optcomma : // empty |
|
|
508 | ',' |
|
|
509 { |
|
|
510 if (user_pref.warn_comma_in_global_decl) |
|
|
511 warning ("comma in global declaration not\ |
|
|
512 interpreted as a command separator"); |
|
|
513 } |
|
|
514 ; |
|
|
515 |
|
|
516 statement : WHILE expression optsep opt_list END |
|
|
517 { |
|
|
518 maybe_warn_assign_as_truth_value ($2); |
|
143
|
519 if (check_end ($5, token::while_end)) |
|
|
520 ABORT_PARSE; |
|
1
|
521 looping--; |
|
|
522 $$ = new tree_while_command ($2, $4); |
|
|
523 } |
|
118
|
524 | FOR variable '=' expression optsep opt_list END |
|
1
|
525 { |
|
143
|
526 if (check_end ($7, token::for_end)) |
|
|
527 ABORT_PARSE; |
|
1
|
528 looping--; |
|
|
529 $$ = new tree_for_command ($2, $4, $6); |
|
|
530 } |
|
|
531 | IF expression optsep opt_list END |
|
|
532 { |
|
|
533 maybe_warn_assign_as_truth_value ($2); |
|
143
|
534 if (check_end ($5, token::if_end)) |
|
|
535 ABORT_PARSE; |
|
1
|
536 iffing--; |
|
|
537 $$ = new tree_if_command ($2, $4); |
|
|
538 } |
|
|
539 | IF expression optsep opt_list ELSE optsep opt_list END |
|
|
540 { |
|
|
541 maybe_warn_assign_as_truth_value ($2); |
|
143
|
542 if (check_end ($8, token::if_end)) |
|
|
543 ABORT_PARSE; |
|
1
|
544 iffing--; |
|
|
545 tree_if_command *t1 = new tree_if_command ($7); |
|
|
546 $$ = t1->chain ($2, $4); |
|
|
547 } |
|
|
548 | IF expression optsep opt_list elseif END |
|
|
549 { |
|
|
550 maybe_warn_assign_as_truth_value ($2); |
|
143
|
551 if (check_end ($6, token::if_end)) |
|
|
552 ABORT_PARSE; |
|
1
|
553 iffing--; |
|
|
554 tree_if_command *t1 = $5->reverse (); |
|
|
555 // Add the if list to the new head of the elseif |
|
|
556 // list, and return the list. |
|
|
557 $$ = t1->chain ($2, $4); |
|
|
558 } |
|
|
559 | IF expression optsep opt_list elseif ELSE optsep opt_list END |
|
|
560 { |
|
|
561 maybe_warn_assign_as_truth_value ($2); |
|
143
|
562 if (check_end ($9, token::if_end)) |
|
|
563 ABORT_PARSE; |
|
1
|
564 iffing--; |
|
|
565 // Add the else list to the head of the elseif list, |
|
|
566 // then reverse the list. |
|
|
567 tree_if_command *t1 = $5->chain ($8); |
|
|
568 t1 = t1->reverse (); |
|
|
569 // Add the if list to the new head of the elseif |
|
|
570 // list, and return the list. |
|
|
571 $$ = t1->chain ($2, $4); |
|
|
572 } |
|
|
573 | BREAK |
|
|
574 { |
|
|
575 if (!looping) |
|
|
576 { |
|
|
577 yyerror ("parse error"); |
|
|
578 error ("break: only meaningful within a `for'\ |
|
|
579 or `while' loop"); |
|
|
580 ABORT_PARSE; |
|
|
581 } |
|
|
582 $$ = new tree_break_command (); |
|
|
583 } |
|
|
584 | CONTINUE |
|
|
585 { |
|
|
586 if (!looping) |
|
|
587 { |
|
|
588 yyerror ("parse error"); |
|
|
589 error ("continue: only meaningful within a\ |
|
|
590 `for' or `while' loop"); |
|
|
591 ABORT_PARSE; |
|
|
592 } |
|
|
593 $$ = new tree_break_command (); |
|
|
594 } |
|
|
595 | FUNC_RET |
|
|
596 { |
|
|
597 if (!defining_func) |
|
|
598 { |
|
|
599 yyerror ("parse error"); |
|
|
600 error ("return: only meaningful within a function"); |
|
|
601 ABORT_PARSE; |
|
|
602 } |
|
|
603 $$ = new tree_return_command (); |
|
|
604 } |
|
|
605 ; |
|
|
606 |
|
|
607 elseif : ELSEIF optsep expression optsep opt_list |
|
|
608 { |
|
|
609 maybe_warn_assign_as_truth_value ($3); |
|
|
610 $$ = new tree_if_command ($3, $5); |
|
|
611 } |
|
|
612 | elseif ELSEIF optsep expression optsep opt_list |
|
|
613 { |
|
|
614 maybe_warn_assign_as_truth_value ($4); |
|
|
615 $$ = $1->chain ($4, $6); |
|
|
616 } |
|
|
617 ; |
|
|
618 |
|
|
619 optsep : // empty |
|
|
620 | sep |
|
|
621 ; |
|
|
622 |
|
|
623 sep : ',' |
|
|
624 | ';' |
|
|
625 | '\n' |
|
|
626 | sep ',' |
|
|
627 | sep ';' |
|
|
628 | sep '\n' |
|
|
629 ; |
|
|
630 |
|
|
631 screwed_again : // empty |
|
|
632 { maybe_screwed_again++; } |
|
|
633 ; |
|
|
634 |
|
|
635 expression : variable '=' expression |
|
143
|
636 { $$ = new tree_simple_assignment_expression |
|
|
637 ($1, $3, $2->line (), $2->column ()); } |
|
1
|
638 | '[' screwed_again matrix_row SCREW_TWO '=' expression |
|
|
639 { |
|
|
640 |
|
|
641 // Will need a way to convert the matrix list to a list of |
|
143
|
642 // identifiers. If that fails, we can abort here, without losing |
|
1
|
643 // anything -- no other possible syntax is valid if we've seen the |
|
|
644 // equals sign as the next token after the `]'. |
|
|
645 |
|
|
646 $$ = (tree_multi_assignment_expression *) NULL; |
|
|
647 maybe_screwed_again--; |
|
|
648 tree_matrix *tmp = ml.pop (); |
|
|
649 tmp = tmp->reverse (); |
|
|
650 tree_return_list *id_list = tmp->to_return_list (); |
|
|
651 if (id_list == NULL_TREE) |
|
|
652 { |
|
|
653 yyerror ("parse error"); |
|
143
|
654 error ("invalid identifier list for assignment"); |
|
1
|
655 $$ = (tree_multi_assignment_expression *) NULL; |
|
|
656 ABORT_PARSE; |
|
|
657 } |
|
|
658 else |
|
143
|
659 $$ = new tree_multi_assignment_expression |
|
|
660 (id_list, $6, $5->line (), $5->column ()); |
|
1
|
661 } |
|
|
662 | NUM '=' expression |
|
|
663 { |
|
|
664 yyerror ("parse error"); |
|
|
665 error ("invalid assignment to a number"); |
|
|
666 $$ = (tree_simple_assignment_expression *) NULL; |
|
|
667 ABORT_PARSE; |
|
|
668 } |
|
|
669 | simple_expr |
|
|
670 { $$ = $1; } |
|
|
671 ; |
|
|
672 |
|
|
673 simple_expr : simple_expr1 |
|
|
674 { $$ = $1; } |
|
|
675 | identifier PLUS_PLUS |
|
143
|
676 { $$ = new tree_postfix_expression |
|
|
677 ($1, tree::increment, $2->line (), $2->column ()); } |
|
1
|
678 | identifier MINUS_MINUS |
|
143
|
679 { $$ = new tree_postfix_expression |
|
|
680 ($1, tree::decrement, $2->line (), $2->column ()); } |
|
1
|
681 | simple_expr QUOTE |
|
143
|
682 { $$ = new tree_unary_expression |
|
|
683 ($1, tree::hermitian, $2->line (), $2->column ()); } |
|
1
|
684 | simple_expr TRANSPOSE |
|
143
|
685 { $$ = new tree_unary_expression |
|
|
686 ($1, tree::transpose, $2->line (), $2->column ()); } |
|
1
|
687 | simple_expr POW simple_expr |
|
143
|
688 { $$ = new tree_binary_expression |
|
|
689 ($1, $3, tree::power, $2->line (), $2->column ()); } |
|
1
|
690 | simple_expr EPOW simple_expr |
|
143
|
691 { $$ = new tree_binary_expression |
|
|
692 ($1, $3, tree::elem_pow, $2->line (), $2->column ()); } |
|
1
|
693 | simple_expr '+' simple_expr |
|
143
|
694 { $$ = new tree_binary_expression |
|
|
695 ($1, $3, tree::add, $2->line (), $2->column ()); } |
|
1
|
696 | simple_expr '-' simple_expr |
|
143
|
697 { $$ = new tree_binary_expression |
|
|
698 ($1, $3, tree::subtract, $2->line (), $2->column ()); } |
|
1
|
699 | simple_expr '*' simple_expr |
|
143
|
700 { $$ = new tree_binary_expression |
|
|
701 ($1, $3, tree::multiply, $2->line (), $2->column ()); } |
|
1
|
702 | simple_expr '/' simple_expr |
|
143
|
703 { $$ = new tree_binary_expression |
|
|
704 ($1, $3, tree::divide, $2->line (), $2->column ()); } |
|
1
|
705 | simple_expr EMUL simple_expr |
|
143
|
706 { $$ = new tree_binary_expression |
|
|
707 ($1, $3, tree::el_mul, $2->line (), $2->column ()); } |
|
1
|
708 | simple_expr EDIV simple_expr |
|
143
|
709 { $$ = new tree_binary_expression |
|
|
710 ($1, $3, tree::el_div, $2->line (), $2->column ()); } |
|
1
|
711 | simple_expr LEFTDIV simple_expr |
|
143
|
712 { $$ = new tree_binary_expression |
|
|
713 ($1, $3, tree::leftdiv, $2->line (), $2->column ()); } |
|
1
|
714 | simple_expr ELEFTDIV simple_expr |
|
143
|
715 { $$ = new tree_binary_expression |
|
|
716 ($1, $3, tree::el_leftdiv, $2->line (), $2->column ()); } |
|
1
|
717 | simple_expr EXPR_LT simple_expr |
|
143
|
718 { $$ = new tree_binary_expression |
|
|
719 ($1, $3, tree::cmp_lt, $2->line (), $2->column ()); } |
|
1
|
720 | simple_expr EXPR_LE simple_expr |
|
143
|
721 { $$ = new tree_binary_expression |
|
|
722 ($1, $3, tree::cmp_le, $2->line (), $2->column ()); } |
|
1
|
723 | simple_expr EXPR_EQ simple_expr |
|
143
|
724 { $$ = new tree_binary_expression |
|
|
725 ($1, $3, tree::cmp_eq, $2->line (), $2->column ()); } |
|
1
|
726 | simple_expr EXPR_GE simple_expr |
|
143
|
727 { $$ = new tree_binary_expression |
|
|
728 ($1, $3, tree::cmp_ge, $2->line (), $2->column ()); } |
|
1
|
729 | simple_expr EXPR_GT simple_expr |
|
143
|
730 { $$ = new tree_binary_expression |
|
|
731 ($1, $3, tree::cmp_gt, $2->line (), $2->column ()); } |
|
1
|
732 | simple_expr EXPR_NE simple_expr |
|
143
|
733 { $$ = new tree_binary_expression |
|
|
734 ($1, $3, tree::cmp_ne, $2->line (), $2->column ()); } |
|
1
|
735 | simple_expr EXPR_AND simple_expr |
|
143
|
736 { $$ = new tree_binary_expression |
|
|
737 ($1, $3, tree::and, $2->line (), $2->column ()); } |
|
1
|
738 | simple_expr EXPR_OR simple_expr |
|
143
|
739 { $$ = new tree_binary_expression |
|
|
740 ($1, $3, tree::or, $2->line (), $2->column ()); } |
|
1
|
741 ; |
|
|
742 |
|
|
743 simple_expr1 : NUM |
|
143
|
744 { $$ = new tree_constant ($1->number ()); } |
|
1
|
745 | IMAG_NUM |
|
143
|
746 { $$ = new tree_constant (Complex (0.0, $1->number ())); } |
|
1
|
747 | TEXT |
|
143
|
748 { $$ = new tree_constant ($1->string ()); } |
|
1
|
749 | word_list_cmd |
|
|
750 { $$ = $1; } |
|
|
751 | '(' expression ')' |
|
|
752 { |
|
|
753 if ($2->is_assignment_expression ()) |
|
|
754 ((tree_assignment_expression *) $2) -> in_parens++; |
|
|
755 $$ = $2; |
|
|
756 } |
|
|
757 | variable |
|
|
758 { $$ = $1; } |
|
|
759 | matrix |
|
|
760 { $$ = $1; } |
|
|
761 | colon_expr |
|
|
762 { $$ = $1; } |
|
|
763 | PLUS_PLUS identifier %prec UNARY |
|
143
|
764 { $$ = new tree_prefix_expression |
|
|
765 ($2, tree::increment, $1->line (), $1->column ()); } |
|
1
|
766 | MINUS_MINUS identifier %prec UNARY |
|
143
|
767 { $$ = new tree_prefix_expression |
|
|
768 ($2, tree::decrement, $1->line (), $1->column ()); } |
|
1
|
769 | EXPR_NOT simple_expr |
|
143
|
770 { $$ = new tree_unary_expression |
|
|
771 ($2, tree::not, $1->line (), $1->column ()); } |
|
1
|
772 | '+' simple_expr %prec UNARY |
|
|
773 { $$ = $2; } |
|
|
774 | '-' simple_expr %prec UNARY |
|
143
|
775 { $$ = new tree_unary_expression |
|
|
776 ($2, tree::uminus, $1->line (), $1->column ()); } |
|
1
|
777 ; |
|
|
778 |
|
|
779 colon_expr : simple_expr ':' simple_expr |
|
143
|
780 { $$ = new tree_colon_expression |
|
|
781 ($1, $3, $2->line (), $2->column ()); } |
|
1
|
782 | colon_expr ':' simple_expr |
|
|
783 { |
|
|
784 $$ = $1->chain ($3); |
|
|
785 if ($$ == (tree_colon_expression *) NULL) |
|
|
786 { |
|
|
787 yyerror ("parse error"); |
|
|
788 ABORT_PARSE; |
|
|
789 } |
|
|
790 } |
|
|
791 ; |
|
|
792 |
|
|
793 word_list_cmd : identifier word_list |
|
|
794 { $$ = new tree_word_list_command ($1, $2); } |
|
|
795 | CLEAR |
|
|
796 { |
|
|
797 if (defining_func) |
|
|
798 { |
|
|
799 yyerror ("parse error"); |
|
|
800 error ("clear: invalid within function body"); |
|
|
801 ABORT_PARSE; |
|
|
802 } |
|
143
|
803 tree_identifier *tmp = new tree_identifier |
|
|
804 ($1->sym_rec (), $1->line (), $1->column ()); |
|
1
|
805 $$ = new tree_word_list_command (tmp, |
|
|
806 (tree_word_list *) NULL); |
|
|
807 } |
|
|
808 | CLEAR word_list |
|
|
809 { |
|
|
810 if (defining_func) |
|
|
811 { |
|
|
812 yyerror ("parse error"); |
|
|
813 error ("clear: invalid within function body"); |
|
|
814 ABORT_PARSE; |
|
|
815 } |
|
143
|
816 tree_identifier *tmp = new tree_identifier |
|
|
817 ($1->sym_rec (), $1->line (), $1->column ()); |
|
1
|
818 $$ = new tree_word_list_command (tmp, $2); |
|
|
819 } |
|
|
820 ; |
|
|
821 |
|
|
822 word_list : word_list1 |
|
|
823 { $$ = $1->reverse (); } |
|
|
824 ; |
|
|
825 |
|
|
826 word_list1 : TEXT |
|
143
|
827 { $$ = new tree_word_list ($1->string ()); } |
|
1
|
828 | word_list1 TEXT |
|
143
|
829 { $$ = $1->chain ($2->string ()); } |
|
1
|
830 ; |
|
|
831 |
|
|
832 // This is truly disgusting. |
|
|
833 |
|
|
834 g_symtab : // empty |
|
|
835 { curr_sym_tab = global_sym_tab; } |
|
|
836 ; |
|
|
837 |
|
|
838 local_symtab : // empty |
|
|
839 { curr_sym_tab = tmp_local_sym_tab; } |
|
|
840 ; |
|
|
841 |
|
|
842 safe : // empty |
|
|
843 { maybe_screwed = 0; } |
|
|
844 ; |
|
|
845 |
|
|
846 are_we_screwed : // empty |
|
|
847 { maybe_screwed = 1; } |
|
|
848 ; |
|
|
849 |
|
|
850 func_def : FCN g_symtab are_we_screwed func_def1 |
|
|
851 { |
|
|
852 curr_sym_tab = top_level_sym_tab; |
|
|
853 defining_func = 0; |
|
|
854 $$ = (tree_function *) NULL; |
|
|
855 } |
|
|
856 | FCN g_symtab are_we_screwed func_def2 |
|
|
857 { |
|
|
858 curr_sym_tab = top_level_sym_tab; |
|
|
859 defining_func = 0; |
|
|
860 $$ = (tree_function *) NULL; |
|
|
861 } |
|
|
862 ; |
|
|
863 |
|
|
864 func_def1 : SCREW safe g_symtab '=' func_def2 |
|
|
865 { |
|
143
|
866 tree_identifier *tmp = new tree_identifier |
|
|
867 ($1->sym_rec (), $1->line (), $1->column ()); |
|
1
|
868 tree_parameter_list *tpl = new tree_parameter_list (tmp); |
|
|
869 tpl = tpl->reverse (); |
|
|
870 tpl->mark_as_formal_parameters (); |
|
|
871 $$ = $5->define_ret_list (tpl); |
|
|
872 } |
|
|
873 | func_def1a ']' g_symtab '=' func_def2 |
|
|
874 { |
|
|
875 tree_parameter_list *tpl = $1->reverse (); |
|
|
876 tpl->mark_as_formal_parameters (); |
|
|
877 $$ = $5->define_ret_list (tpl); |
|
|
878 } |
|
|
879 ; |
|
|
880 |
|
|
881 func_def1a : '[' safe local_symtab identifier |
|
|
882 { $$ = new tree_parameter_list ($4); } |
|
|
883 | func_def1a ',' identifier |
|
|
884 { $$ = $1->chain ($3); } |
|
|
885 ; |
|
|
886 |
|
|
887 func_def2 : identifier safe local_symtab func_def3 |
|
|
888 { |
|
|
889 char *id_name = $1->name (); |
|
|
890 // if (is_text_function_name (id_name)) |
|
|
891 // { |
|
|
892 // yyerror ("parse error"); |
|
|
893 // error ("invalid use of reserved word %s", id_name); |
|
|
894 // ABORT_PARSE; |
|
|
895 // } |
|
|
896 |
|
|
897 // If input is coming from a file, issue a warning if the name of the |
|
|
898 // file does not match the name of the function stated in the file. |
|
|
899 // Matlab doesn't provide a diagnostic (it ignores the stated name). |
|
|
900 |
|
|
901 if (reading_m_file) |
|
|
902 { |
|
|
903 if (strcmp (curr_m_file_name, id_name) != 0) |
|
|
904 warning ("function name `%s' does not agree\ |
|
|
905 with M-file name `%s.m'", id_name, curr_m_file_name); |
|
|
906 |
|
|
907 id_to_define->define ($4); |
|
|
908 id_to_define->document (help_buf); |
|
|
909 } |
|
|
910 else |
|
|
911 { |
|
168
|
912 if (! input_from_tmp_history_file |
|
|
913 && reading_script_file |
|
1
|
914 && strcmp (curr_m_file_name, id_name) == 0) |
|
|
915 warning ("function `%s' defined within\ |
|
|
916 script file `%s.m'", id_name, curr_m_file_name); |
|
|
917 |
|
|
918 $1->define ($4); |
|
|
919 $1->document (help_buf); |
|
|
920 top_level_sym_tab->clear (id_name); |
|
|
921 } |
|
|
922 |
|
143
|
923 $4->stash_function_name (id_name); |
|
1
|
924 $$ = $4; |
|
|
925 } |
|
|
926 ; |
|
|
927 |
|
|
928 func_def3 : param_list optsep opt_list fcn_end_or_eof |
|
|
929 { |
|
|
930 tree_function *fcn = new tree_function ($3, curr_sym_tab); |
|
|
931 $$ = fcn->define_param_list ($1); |
|
|
932 } |
|
|
933 | '(' ')' optsep opt_list fcn_end_or_eof |
|
|
934 { $$ = new tree_function ($4, curr_sym_tab); } |
|
|
935 | optsep opt_list fcn_end_or_eof |
|
|
936 { $$ = new tree_function ($2, curr_sym_tab); } |
|
|
937 ; |
|
|
938 |
|
|
939 fcn_end_or_eof : END |
|
|
940 { |
|
143
|
941 if (check_end ($1, token::function_end)) |
|
1
|
942 ABORT_PARSE; |
|
|
943 |
|
|
944 if (reading_m_file) |
|
|
945 check_for_garbage_after_fcn_def (); |
|
|
946 } |
|
|
947 | END_OF_INPUT |
|
|
948 { |
|
|
949 if (! (reading_m_file || reading_script_file)) |
|
|
950 YYABORT; |
|
|
951 } |
|
|
952 ; |
|
|
953 |
|
|
954 variable : identifier |
|
|
955 { $$ = new tree_index_expression ($1); } |
|
|
956 | identifier '(' arg_list ')' |
|
|
957 { $$ = new tree_index_expression ($1, $3); } |
|
|
958 | identifier '(' ')' |
|
|
959 { |
|
|
960 $$ = new tree_index_expression |
|
|
961 ($1, (tree_argument_list *) NULL); |
|
|
962 } |
|
|
963 | identifier '[' |
|
|
964 { |
|
|
965 yyerror ("parse error"); |
|
|
966 error ("use `(\' and `)\' as index operators, not\ |
|
|
967 `[\' and `]\'"); |
|
|
968 $$ = (tree_index_expression *) NULL; |
|
|
969 ABORT_PARSE; |
|
|
970 } |
|
|
971 ; |
|
|
972 |
|
|
973 param_list : param_list1 ')' |
|
|
974 { |
|
|
975 tree_parameter_list *tmp = $1->reverse (); |
|
|
976 tmp->mark_as_formal_parameters (); |
|
|
977 $$ = tmp; |
|
|
978 } |
|
|
979 |
|
|
980 param_list1 : '(' identifier |
|
|
981 { $$ = new tree_parameter_list ($2); } |
|
|
982 | param_list1 ',' identifier |
|
|
983 { $$ = $1->chain ($3); } |
|
|
984 | '(' error |
|
|
985 { |
|
|
986 error ("parameter lists may only contain identifiers"); |
|
|
987 $$ = (tree_parameter_list *) NULL; |
|
|
988 } |
|
|
989 | param_list1 ',' error |
|
|
990 { |
|
|
991 error ("parameter lists may only contain identifiers"); |
|
|
992 $$ = (tree_parameter_list *) NULL; |
|
|
993 } |
|
|
994 ; |
|
|
995 |
|
|
996 identifier : NAME |
|
143
|
997 { $$ = new tree_identifier |
|
|
998 ($1->sym_rec (), $1->line (), $1->column ()); } |
|
1
|
999 |
|
|
1000 arg_list : arg_list1 |
|
|
1001 { $$ = $1->reverse (); } |
|
|
1002 ; |
|
|
1003 |
|
|
1004 arg_list1 : ':' |
|
|
1005 { |
|
|
1006 tree_constant *colon; |
|
|
1007 colon = new tree_constant (tree_constant_rep::magic_colon); |
|
|
1008 $$ = new tree_argument_list (colon); |
|
|
1009 } |
|
|
1010 | arg_list1 ',' ':' |
|
|
1011 { |
|
|
1012 tree_constant *colon; |
|
|
1013 colon = new tree_constant (tree_constant_rep::magic_colon); |
|
|
1014 $$ = $1->chain (colon); |
|
|
1015 if ($$ == NULL_TREE) |
|
|
1016 { |
|
|
1017 yyerror ("parse error"); |
|
|
1018 ABORT_PARSE; |
|
|
1019 } |
|
|
1020 } |
|
|
1021 | expression |
|
|
1022 { $$ = new tree_argument_list ($1); } |
|
|
1023 | arg_list1 ',' expression |
|
|
1024 { |
|
|
1025 $$ = $1->chain ($3); |
|
|
1026 if ($$ == NULL_TREE) |
|
|
1027 { |
|
|
1028 yyerror ("parse error"); |
|
|
1029 ABORT_PARSE; |
|
|
1030 } |
|
|
1031 } |
|
|
1032 ; |
|
|
1033 |
|
|
1034 matrix : '[' ']' |
|
|
1035 { |
|
|
1036 mlnm.pop (); |
|
|
1037 $$ = new tree_matrix (); |
|
|
1038 } |
|
|
1039 | '[' ';' ']' |
|
|
1040 { |
|
|
1041 mlnm.pop (); |
|
|
1042 $$ = new tree_matrix (); |
|
|
1043 } |
|
|
1044 | '[' screwed_again rows ']' |
|
|
1045 { |
|
|
1046 mlnm.pop (); |
|
|
1047 maybe_screwed_again--; |
|
|
1048 tree_matrix *tmp = ml.pop (); |
|
|
1049 $$ = tmp->reverse (); |
|
|
1050 } |
|
|
1051 ; |
|
|
1052 |
|
|
1053 rows : matrix_row |
|
|
1054 | rows ';' // Ignore trailing semicolon. |
|
|
1055 | rows ';' matrix_row |
|
|
1056 ; |
|
|
1057 |
|
|
1058 matrix_row : expression // First element on row. |
|
|
1059 { |
|
|
1060 if (mlnm.top ()) |
|
|
1061 { |
|
|
1062 mlnm.pop (); |
|
|
1063 mlnm.push (0); |
|
143
|
1064 tree_matrix *tmp = new tree_matrix ($1, tree::md_none); |
|
1
|
1065 ml.push (tmp); |
|
|
1066 } |
|
|
1067 else |
|
|
1068 { |
|
|
1069 tree_matrix *tmp = ml.pop (); |
|
|
1070 tmp = tmp->chain ($1, tree::md_down); |
|
|
1071 ml.push (tmp); |
|
|
1072 } |
|
|
1073 } |
|
|
1074 | matrix_row ',' // Ignore trailing comma. |
|
|
1075 | matrix_row ',' expression |
|
|
1076 { |
|
|
1077 tree_matrix *tmp = ml.pop (); |
|
|
1078 tmp = tmp->chain ($3, tree::md_right); |
|
|
1079 ml.push (tmp); |
|
|
1080 } |
|
|
1081 ; |
|
|
1082 |
|
|
1083 %% |
|
|
1084 |
|
|
1085 static void |
|
|
1086 yyerror (char *s) |
|
|
1087 { |
|
|
1088 char *line = current_input_line; |
|
143
|
1089 int err_col = current_input_column - 1; |
|
1
|
1090 if (err_col == 0) |
|
|
1091 err_col = strlen (current_input_line) + 1; |
|
|
1092 |
|
|
1093 // Print a message like `parse error'. |
|
|
1094 fprintf (stderr, "\n%s", s); |
|
|
1095 |
|
|
1096 // Maybe print the line number and file name. |
|
|
1097 if (reading_m_file || reading_script_file) |
|
|
1098 fprintf (stderr, " near line %d of file %s.m", input_line_number, |
|
|
1099 curr_m_file_name); |
|
|
1100 |
|
|
1101 int len = strlen (line); |
|
|
1102 if (line[len-1] == '\n') |
|
|
1103 { |
|
|
1104 len--; |
|
|
1105 line[len] = '\0'; |
|
|
1106 } |
|
|
1107 |
|
|
1108 // Print the line, maybe with a pointer near the error token. |
|
|
1109 if (err_col > len) |
|
|
1110 fprintf (stderr, ":\n\n %s\n\n", line); |
|
|
1111 else |
|
|
1112 fprintf (stderr, ":\n\n %s\n %*s\n\n", line, err_col, "^"); |
|
|
1113 } |
|
|
1114 |
|
143
|
1115 static int |
|
|
1116 check_end (token *tok, token::end_tok_type expected) |
|
|
1117 { |
|
|
1118 token::end_tok_type ettype = tok->ettype (); |
|
|
1119 if (ettype != expected && ettype != token::simple_end) |
|
|
1120 { |
|
|
1121 yyerror ("parse error"); |
|
|
1122 |
|
|
1123 int l = tok->line (); |
|
|
1124 int c = tok->column (); |
|
|
1125 |
|
|
1126 switch (expected) |
|
|
1127 { |
|
|
1128 case token::for_end: |
|
|
1129 end_error ("for", ettype, l, c); |
|
|
1130 break; |
|
|
1131 case token::function_end: |
|
|
1132 end_error ("function", ettype, l, c); |
|
|
1133 break; |
|
|
1134 case token::if_end: |
|
|
1135 end_error ("if", ettype, l, c); |
|
|
1136 break; |
|
|
1137 case token::while_end: |
|
|
1138 end_error ("while", ettype, l, c); |
|
|
1139 break; |
|
|
1140 default: |
|
|
1141 panic_impossible (); |
|
|
1142 break; |
|
|
1143 } |
|
|
1144 return 1; |
|
|
1145 } |
|
|
1146 else |
|
|
1147 return 0; |
|
|
1148 } |
|
|
1149 |
|
1
|
1150 static void |
|
143
|
1151 end_error (char *type, token::end_tok_type ettype, int l, int c) |
|
1
|
1152 { |
|
143
|
1153 static char *fmt = "%s command matched by `%s' near line %d column %d"; |
|
|
1154 |
|
1
|
1155 switch (ettype) |
|
|
1156 { |
|
143
|
1157 case token::simple_end: |
|
|
1158 error (fmt, type, "end", l, c); |
|
1
|
1159 break; |
|
143
|
1160 case token::for_end: |
|
|
1161 error (fmt, type, "endfor", l, c); |
|
1
|
1162 break; |
|
143
|
1163 case token::function_end: |
|
|
1164 error (fmt, type, "endfunction", l, c); |
|
1
|
1165 break; |
|
143
|
1166 case token::if_end: |
|
|
1167 error (fmt, type, "endif", l, c); |
|
1
|
1168 break; |
|
143
|
1169 case token::while_end: |
|
|
1170 error (fmt, type, "endwhile", l, c); |
|
1
|
1171 break; |
|
|
1172 default: |
|
|
1173 panic_impossible (); |
|
|
1174 break; |
|
|
1175 } |
|
|
1176 } |
|
|
1177 |
|
|
1178 /* |
|
|
1179 * Need to make sure that the expression isn't already an identifier |
|
|
1180 * that has a name, or an assignment expression. |
|
|
1181 * |
|
|
1182 * Note that an expression can't be just an identifier anymore -- it |
|
|
1183 * must at least be an index expression (see the definition of the |
|
|
1184 * non-terminal `variable' above). |
|
|
1185 */ |
|
|
1186 tree * |
|
|
1187 maybe_convert_to_ans_assign (tree *expr) |
|
|
1188 { |
|
|
1189 tree *retval = expr; |
|
|
1190 |
|
|
1191 symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); |
|
|
1192 |
|
|
1193 assert (sr != (symbol_record *) NULL); |
|
|
1194 |
|
|
1195 if (expr->is_index_expression ()) |
|
|
1196 { |
|
|
1197 tree_index_expression *idx_expr = (tree_index_expression *) expr; |
|
|
1198 tree_argument_list *args = idx_expr->arg_list (); |
|
|
1199 |
|
|
1200 if (args == (tree_argument_list *) NULL) |
|
|
1201 { |
|
|
1202 tree_identifier *tmp = idx_expr->ident (); |
|
|
1203 tree *defn = tmp->def (); |
|
|
1204 if (defn != NULL_TREE && ! defn->is_builtin ()) |
|
|
1205 { |
|
|
1206 return retval; |
|
|
1207 } |
|
|
1208 } |
|
|
1209 } |
|
|
1210 else if (expr->is_assignment_expression ()) |
|
|
1211 { |
|
|
1212 return retval; |
|
|
1213 } |
|
|
1214 |
|
|
1215 tree_identifier *ans = new tree_identifier (sr); |
|
|
1216 retval = new tree_simple_assignment_expression (ans, expr); |
|
|
1217 |
|
|
1218 return retval; |
|
|
1219 } |
|
|
1220 |
|
|
1221 void |
|
|
1222 maybe_warn_assign_as_truth_value (tree *expr) |
|
|
1223 { |
|
|
1224 if (user_pref.warn_assign_as_truth_value |
|
|
1225 && expr->is_assignment_expression () |
|
|
1226 && ((tree_assignment_expression *) expr) -> in_parens < 2) |
|
|
1227 { |
|
|
1228 warning ("suggest parenthesis around assignment used as truth value"); |
|
|
1229 } |
|
|
1230 } |
