|
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 |
|
169
|
171 %token <tok_val> NAME SCREW |
|
143
|
172 %token <tok_val> END |
|
|
173 %token <tok_val> PLOT |
|
|
174 %token <tok_val> TEXT STYLE |
|
191
|
175 %token <tok_val> FOR WHILE IF ELSEIF ELSE BREAK CONTINUE FUNC_RET |
|
1
|
176 |
|
143
|
177 // Other tokens. |
|
191
|
178 %token FCN SCREW_TWO |
|
143
|
179 %token END_OF_INPUT GLOBAL |
|
1
|
180 %token USING TITLE WITH COLON OPEN_BRACE CLOSE_BRACE |
|
|
181 |
|
143
|
182 // Nonterminals we construct. |
|
1
|
183 %type <tree_type> input command |
|
|
184 %type <tree_type> ans_expression expression simple_expr simple_expr1 |
|
|
185 %type <tree_type> title |
|
|
186 %type <tree_matrix_type> matrix |
|
|
187 %type <tree_identifier_type> identifier |
|
|
188 %type <tree_function_type> func_def func_def1 func_def2 func_def3 |
|
|
189 %type <tree_index_expression_type> variable |
|
|
190 %type <tree_colon_expression_type> colon_expr |
|
|
191 %type <tree_argument_list_type> arg_list arg_list1 |
|
|
192 %type <tree_parameter_list_type> param_list param_list1 func_def1a |
|
|
193 %type <tree_word_list_type> word_list word_list1 |
|
|
194 %type <tree_command_type> statement |
|
|
195 %type <tree_if_command_type> elseif |
|
|
196 %type <tree_command_list_type> simple_list simple_list1 list list1 opt_list |
|
191
|
197 %type <tree_command_list_type> global_decl global_decl1 |
|
1
|
198 %type <tree_word_list_command_type> word_list_cmd |
|
|
199 %type <tree_plot_command_type> plot_command |
|
|
200 %type <tree_subplot_list_type> plot_command1 plot_command2 plot_options |
|
|
201 %type <tree_plot_limits_type> ranges |
|
|
202 %type <tree_plot_range_type> ranges1 |
|
|
203 %type <tree_subplot_using_type> using using1 |
|
|
204 %type <tree_subplot_style_type> style |
|
|
205 |
|
143
|
206 // Precedence and associativity. |
|
1
|
207 %left ';' ',' '\n' |
|
|
208 %right '=' |
|
|
209 %left EXPR_AND EXPR_OR |
|
|
210 %left EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
211 %left ':' |
|
|
212 %left '-' '+' |
|
|
213 %left '*' '/' LEFTDIV EMUL EDIV ELEFTDIV |
|
|
214 %left QUOTE TRANSPOSE |
|
|
215 %left UNARY PLUS_PLUS MINUS_MINUS EXPR_NOT |
|
|
216 %right POW EPOW |
|
|
217 |
|
169
|
218 // There are 19 shift/reduce conflicts, ok? |
|
|
219 %expect 19 |
|
143
|
220 |
|
|
221 // Where to start. |
|
1
|
222 %start input |
|
|
223 |
|
|
224 /* |
|
|
225 * Grammar rules. |
|
|
226 */ |
|
|
227 %% |
|
|
228 |
|
|
229 input : '\n' |
|
|
230 { |
|
|
231 global_command = NULL_TREE; |
|
|
232 promptflag = 1; |
|
|
233 YYACCEPT; |
|
|
234 } |
|
|
235 | END_OF_INPUT |
|
|
236 { |
|
|
237 global_command = NULL_TREE; |
|
|
238 promptflag = 1; |
|
|
239 YYABORT; |
|
|
240 } |
|
|
241 | simple_list '\n' |
|
|
242 { |
|
|
243 global_command = $1; |
|
|
244 promptflag = 1; |
|
|
245 YYACCEPT; |
|
|
246 } |
|
|
247 | simple_list END_OF_INPUT |
|
|
248 { |
|
|
249 global_command = $1; |
|
|
250 promptflag = 1; |
|
|
251 YYACCEPT; |
|
|
252 } |
|
|
253 | error |
|
|
254 { ABORT_PARSE; } |
|
|
255 | error '\n' |
|
|
256 { ABORT_PARSE; } |
|
|
257 | error END_OF_INPUT |
|
|
258 { ABORT_PARSE; } |
|
|
259 | simple_list error |
|
|
260 { ABORT_PARSE; } |
|
|
261 | simple_list error END_OF_INPUT |
|
|
262 { ABORT_PARSE; } |
|
|
263 ; |
|
|
264 |
|
|
265 simple_list : semi_comma |
|
|
266 { $$ = (tree_command_list *) NULL; } |
|
|
267 | comma_semi |
|
|
268 { $$ = (tree_command_list *) NULL; } |
|
|
269 | simple_list1 |
|
|
270 { $$ = $1->reverse (); } |
|
|
271 | simple_list1 semi_comma |
|
|
272 { |
|
|
273 $1->set_print_flag (0); |
|
|
274 $$ = $1->reverse (); |
|
|
275 } |
|
|
276 | simple_list1 comma_semi |
|
|
277 { $$ = $1->reverse (); } |
|
|
278 ; |
|
|
279 |
|
|
280 simple_list1 : command |
|
|
281 { $$ = new tree_command_list ($1); } |
|
|
282 | semi_comma command |
|
|
283 { $$ = new tree_command_list ($2); } |
|
|
284 | comma_semi command |
|
|
285 { $$ = new tree_command_list ($2); } |
|
|
286 | simple_list1 semi_comma command |
|
|
287 { |
|
|
288 $1->set_print_flag (0); |
|
|
289 $$ = $1->chain ($3); |
|
|
290 } |
|
|
291 | simple_list1 comma_semi command |
|
|
292 { $$ = $1->chain ($3); } |
|
|
293 ; |
|
|
294 |
|
|
295 semi_comma : ';' |
|
|
296 | semi_comma ',' |
|
|
297 | semi_comma ';' |
|
|
298 ; |
|
|
299 |
|
|
300 comma_semi : ',' |
|
|
301 | comma_semi ';' |
|
|
302 | comma_semi ',' |
|
|
303 ; |
|
|
304 |
|
|
305 comma_nl_sep : ',' |
|
|
306 | '\n' |
|
|
307 | comma_nl_sep sep |
|
|
308 ; |
|
|
309 |
|
|
310 semi_sep : ';' |
|
|
311 | semi_sep sep |
|
|
312 ; |
|
|
313 |
|
|
314 opt_list : // empty |
|
|
315 { $$ = new tree_command_list (); } |
|
|
316 | list |
|
|
317 { $$ = $1; } |
|
|
318 |
|
|
319 list : list1 |
|
|
320 { $$ = $1->reverse (); } |
|
|
321 | list1 comma_nl_sep |
|
|
322 { $$ = $1->reverse (); } |
|
|
323 | list1 semi_sep |
|
|
324 { |
|
|
325 $1->set_print_flag (0); |
|
|
326 $$ = $1->reverse (); |
|
|
327 } |
|
|
328 ; |
|
|
329 |
|
|
330 list1 : command |
|
|
331 { $$ = new tree_command_list ($1); } |
|
|
332 | list1 comma_nl_sep command |
|
|
333 { $$ = $1->chain ($3); } |
|
|
334 | list1 semi_sep command |
|
|
335 { |
|
|
336 $1->set_print_flag (0); |
|
|
337 $$ = $1->chain ($3); |
|
|
338 } |
|
|
339 ; |
|
|
340 |
|
|
341 command : plot_command |
|
|
342 { $$ = $1; } |
|
|
343 | statement |
|
|
344 { $$ = $1; } |
|
|
345 | ans_expression |
|
|
346 { $$ = $1; } |
|
|
347 | func_def |
|
|
348 { $$ = $1; } |
|
|
349 | global_decl |
|
191
|
350 { $$ = $1; } |
|
1
|
351 ; |
|
|
352 |
|
|
353 plot_command : PLOT plot_command1 |
|
|
354 { |
|
|
355 tree_subplot_list *tmp = $2->reverse (); |
|
143
|
356 $$ = new tree_plot_command (tmp, $1->pttype ()); |
|
1
|
357 plotting = 0; |
|
113
|
358 past_plot_range = 0; |
|
1
|
359 in_plot_range = 0; |
|
|
360 in_plot_using = 0; |
|
|
361 in_plot_style = 0; |
|
|
362 } |
|
|
363 | PLOT ranges plot_command1 |
|
|
364 { |
|
|
365 tree_subplot_list *tmp = $3->reverse (); |
|
143
|
366 $$ = new tree_plot_command (tmp, $2, $1->pttype ()); |
|
1
|
367 plotting = 0; |
|
113
|
368 past_plot_range = 0; |
|
1
|
369 in_plot_range = 0; |
|
|
370 in_plot_using = 0; |
|
|
371 in_plot_style = 0; |
|
|
372 } |
|
|
373 ; |
|
|
374 |
|
|
375 ranges : ranges1 |
|
|
376 { $$ = new tree_plot_limits ($1); } |
|
|
377 | ranges1 ranges1 |
|
|
378 { $$ = new tree_plot_limits ($1, $2); } |
|
|
379 | ranges1 ranges1 ranges1 |
|
|
380 { $$ = new tree_plot_limits ($1, $2, $3); } |
|
|
381 ; |
|
|
382 |
|
|
383 ranges1 : OPEN_BRACE expression COLON expression CLOSE_BRACE |
|
|
384 { $$ = new tree_plot_range ($2, $4); } |
|
|
385 | OPEN_BRACE COLON expression CLOSE_BRACE |
|
|
386 { $$ = new tree_plot_range (NULL, $3); } |
|
|
387 | OPEN_BRACE expression COLON CLOSE_BRACE |
|
|
388 { $$ = new tree_plot_range ($2, NULL); } |
|
|
389 | OPEN_BRACE COLON CLOSE_BRACE |
|
|
390 { $$ = new tree_plot_range (); } |
|
|
391 | OPEN_BRACE CLOSE_BRACE |
|
|
392 { $$ = new tree_plot_range (); } |
|
|
393 ; |
|
|
394 |
|
|
395 plot_command1 : plot_command2 |
|
|
396 { $$ = $1; } |
|
|
397 | plot_command1 ',' plot_command2 |
|
|
398 { $$ = $1->chain ($3); } |
|
|
399 ; |
|
|
400 |
|
|
401 plot_command2 : expression |
|
|
402 { $$ = new tree_subplot_list ($1); } |
|
|
403 | expression plot_options |
|
|
404 { $$ = $2->set_data ($1); } |
|
|
405 ; |
|
|
406 |
|
|
407 plot_options : using |
|
|
408 { $$ = new tree_subplot_list ($1, NULL, NULL); } |
|
|
409 | title |
|
|
410 { $$ = new tree_subplot_list (NULL, $1, NULL); } |
|
|
411 | style |
|
|
412 { $$ = new tree_subplot_list (NULL, NULL, $1); } |
|
|
413 | using title |
|
|
414 { $$ = new tree_subplot_list ($1, $2, NULL); } |
|
|
415 | title using |
|
|
416 { $$ = new tree_subplot_list ($2, $1, NULL); } |
|
|
417 | using style |
|
|
418 { $$ = new tree_subplot_list ($1, NULL, $2); } |
|
|
419 | style using |
|
|
420 { $$ = new tree_subplot_list ($2, NULL, $1); } |
|
|
421 | title style |
|
|
422 { $$ = new tree_subplot_list (NULL, $1, $2); } |
|
|
423 | style title |
|
|
424 { $$ = new tree_subplot_list (NULL, $2, $1); } |
|
|
425 | using title style |
|
|
426 { $$ = new tree_subplot_list ($1, $2, $3); } |
|
|
427 | using style title |
|
|
428 { $$ = new tree_subplot_list ($1, $3, $2); } |
|
|
429 | title using style |
|
|
430 { $$ = new tree_subplot_list ($2, $1, $3); } |
|
|
431 | title style using |
|
|
432 { $$ = new tree_subplot_list ($3, $1, $2); } |
|
|
433 | style using title |
|
|
434 { $$ = new tree_subplot_list ($2, $3, $1); } |
|
|
435 | style title using |
|
|
436 { $$ = new tree_subplot_list ($3, $2, $1); } |
|
|
437 ; |
|
|
438 |
|
|
439 using : using1 |
|
|
440 { |
|
|
441 $$ = $1; |
|
|
442 in_plot_using = 0; |
|
|
443 } |
|
|
444 | using1 expression |
|
|
445 { |
|
|
446 $$ = $1->set_format ($2); |
|
|
447 in_plot_using = 0; |
|
|
448 } |
|
|
449 ; |
|
|
450 |
|
|
451 using1 : USING expression |
|
|
452 { |
|
|
453 tree_subplot_using *tmp = new tree_subplot_using (); |
|
|
454 $$ = tmp->add_qualifier ($2); |
|
|
455 } |
|
|
456 | using1 COLON expression |
|
|
457 { $$ = $1->add_qualifier ($3); } |
|
|
458 ; |
|
|
459 |
|
|
460 title : TITLE expression |
|
|
461 { $$ = $2; } |
|
|
462 ; |
|
|
463 |
|
|
464 style : WITH STYLE |
|
143
|
465 { $$ = new tree_subplot_style ($2->string ()); } |
|
1
|
466 | WITH STYLE expression |
|
143
|
467 { $$ = new tree_subplot_style ($2->string (), $3); } |
|
1
|
468 | WITH STYLE expression bogus_syntax expression |
|
143
|
469 { $$ = new tree_subplot_style ($2->string (), $3, $5); } |
|
1
|
470 ; |
|
|
471 |
|
|
472 bogus_syntax : // empty |
|
|
473 ; |
|
|
474 |
|
|
475 ans_expression : expression |
|
|
476 { $$ = maybe_convert_to_ans_assign ($1); } |
|
|
477 ; |
|
|
478 |
|
|
479 global_decl : GLOBAL global_decl1 |
|
191
|
480 { $$ = $2->reverse (); } |
|
1
|
481 ; |
|
|
482 |
|
|
483 global_decl1 : NAME |
|
191
|
484 { |
|
|
485 force_global ($1->sym_rec()->name ()); |
|
|
486 $$ = new tree_command_list (); |
|
|
487 } |
|
1
|
488 | NAME '=' expression |
|
|
489 { |
|
143
|
490 symbol_record *sr = force_global ($1->sym_rec()->name ()); |
|
|
491 tree_identifier *id = new tree_identifier |
|
|
492 (sr, $1->line (), $1->column ()); |
|
1
|
493 tree_simple_assignment_expression *expr = |
|
143
|
494 new tree_simple_assignment_expression |
|
168
|
495 (id, $3, $2->line (), $2->column ()); |
|
191
|
496 $$ = new tree_command_list (expr); |
|
1
|
497 } |
|
|
498 | global_decl1 optcomma NAME |
|
191
|
499 { |
|
|
500 force_global ($3->sym_rec()->name ()); |
|
|
501 $$ = $1; |
|
|
502 } |
|
1
|
503 | global_decl1 optcomma NAME '=' expression |
|
|
504 { |
|
143
|
505 symbol_record *sr = force_global ($3->sym_rec()->name ()); |
|
|
506 tree_identifier *id = new tree_identifier |
|
|
507 (sr, $3->line (), $3->column ()); |
|
1
|
508 tree_simple_assignment_expression *expr = |
|
143
|
509 new tree_simple_assignment_expression |
|
|
510 (id, $5, $4->line (), $4->column ()); |
|
191
|
511 $$ = $1->chain (expr); |
|
1
|
512 } |
|
|
513 ; |
|
|
514 |
|
|
515 optcomma : // empty |
|
|
516 | ',' |
|
|
517 { |
|
|
518 if (user_pref.warn_comma_in_global_decl) |
|
|
519 warning ("comma in global declaration not\ |
|
|
520 interpreted as a command separator"); |
|
|
521 } |
|
|
522 ; |
|
|
523 |
|
|
524 statement : WHILE expression optsep opt_list END |
|
|
525 { |
|
|
526 maybe_warn_assign_as_truth_value ($2); |
|
143
|
527 if (check_end ($5, token::while_end)) |
|
|
528 ABORT_PARSE; |
|
1
|
529 looping--; |
|
191
|
530 $$ = new tree_while_command ($2, $4, $1->line (), |
|
|
531 $1->column ()); |
|
1
|
532 } |
|
118
|
533 | FOR variable '=' expression optsep opt_list END |
|
1
|
534 { |
|
143
|
535 if (check_end ($7, token::for_end)) |
|
|
536 ABORT_PARSE; |
|
1
|
537 looping--; |
|
191
|
538 $$ = new tree_for_command ($2, $4, $6, |
|
|
539 $1->line (), $1->column ()); |
|
1
|
540 } |
|
|
541 | IF expression optsep opt_list END |
|
|
542 { |
|
|
543 maybe_warn_assign_as_truth_value ($2); |
|
143
|
544 if (check_end ($5, token::if_end)) |
|
|
545 ABORT_PARSE; |
|
1
|
546 iffing--; |
|
191
|
547 $$ = new tree_if_command ($2, $4, |
|
|
548 $1->line (), $1->column ()); |
|
1
|
549 } |
|
|
550 | IF expression optsep opt_list ELSE optsep opt_list END |
|
|
551 { |
|
|
552 maybe_warn_assign_as_truth_value ($2); |
|
143
|
553 if (check_end ($8, token::if_end)) |
|
|
554 ABORT_PARSE; |
|
1
|
555 iffing--; |
|
191
|
556 tree_if_command *t1 = new tree_if_command |
|
|
557 ($7, $5->line (), $5->column ()); |
|
|
558 $$ = t1->chain ($2, $4, $1->line (), $1->column ()); |
|
1
|
559 } |
|
|
560 | IF expression optsep opt_list elseif END |
|
|
561 { |
|
|
562 maybe_warn_assign_as_truth_value ($2); |
|
143
|
563 if (check_end ($6, token::if_end)) |
|
|
564 ABORT_PARSE; |
|
1
|
565 iffing--; |
|
|
566 tree_if_command *t1 = $5->reverse (); |
|
|
567 // Add the if list to the new head of the elseif |
|
|
568 // list, and return the list. |
|
191
|
569 $$ = t1->chain ($2, $4, $1->line (), $1->column ()); |
|
1
|
570 } |
|
|
571 | IF expression optsep opt_list elseif ELSE optsep opt_list END |
|
|
572 { |
|
|
573 maybe_warn_assign_as_truth_value ($2); |
|
143
|
574 if (check_end ($9, token::if_end)) |
|
|
575 ABORT_PARSE; |
|
1
|
576 iffing--; |
|
|
577 // Add the else list to the head of the elseif list, |
|
|
578 // then reverse the list. |
|
191
|
579 tree_if_command *t1 = $5->chain ($8, $6->line (), |
|
|
580 $6->column ()); |
|
1
|
581 t1 = t1->reverse (); |
|
|
582 // Add the if list to the new head of the elseif |
|
|
583 // list, and return the list. |
|
191
|
584 $$ = t1->chain ($2, $4, $1->line (), $1->column ()); |
|
1
|
585 } |
|
|
586 | BREAK |
|
|
587 { |
|
|
588 if (!looping) |
|
|
589 { |
|
|
590 yyerror ("parse error"); |
|
|
591 error ("break: only meaningful within a `for'\ |
|
|
592 or `while' loop"); |
|
|
593 ABORT_PARSE; |
|
|
594 } |
|
191
|
595 $$ = new tree_break_command ($1->line (), $1->column ()); |
|
1
|
596 } |
|
|
597 | CONTINUE |
|
|
598 { |
|
|
599 if (!looping) |
|
|
600 { |
|
|
601 yyerror ("parse error"); |
|
|
602 error ("continue: only meaningful within a\ |
|
|
603 `for' or `while' loop"); |
|
|
604 ABORT_PARSE; |
|
|
605 } |
|
191
|
606 $$ = new tree_continue_command ($1->line (), |
|
|
607 $1->column ()); |
|
1
|
608 } |
|
|
609 | FUNC_RET |
|
|
610 { |
|
|
611 if (!defining_func) |
|
|
612 { |
|
|
613 yyerror ("parse error"); |
|
|
614 error ("return: only meaningful within a function"); |
|
|
615 ABORT_PARSE; |
|
|
616 } |
|
191
|
617 $$ = new tree_return_command ($1->line (), $1->column ()); |
|
1
|
618 } |
|
|
619 ; |
|
|
620 |
|
|
621 elseif : ELSEIF optsep expression optsep opt_list |
|
|
622 { |
|
|
623 maybe_warn_assign_as_truth_value ($3); |
|
191
|
624 $$ = new tree_if_command ($3, $5, $1->line (), |
|
|
625 $1->column ()); |
|
1
|
626 } |
|
|
627 | elseif ELSEIF optsep expression optsep opt_list |
|
|
628 { |
|
|
629 maybe_warn_assign_as_truth_value ($4); |
|
191
|
630 $$ = $1->chain ($4, $6, $2->line (), $2->column ()); |
|
1
|
631 } |
|
|
632 ; |
|
|
633 |
|
|
634 optsep : // empty |
|
|
635 | sep |
|
|
636 ; |
|
|
637 |
|
|
638 sep : ',' |
|
|
639 | ';' |
|
|
640 | '\n' |
|
|
641 | sep ',' |
|
|
642 | sep ';' |
|
|
643 | sep '\n' |
|
|
644 ; |
|
|
645 |
|
|
646 screwed_again : // empty |
|
|
647 { maybe_screwed_again++; } |
|
|
648 ; |
|
|
649 |
|
|
650 expression : variable '=' expression |
|
143
|
651 { $$ = new tree_simple_assignment_expression |
|
|
652 ($1, $3, $2->line (), $2->column ()); } |
|
1
|
653 | '[' screwed_again matrix_row SCREW_TWO '=' expression |
|
|
654 { |
|
|
655 |
|
|
656 // Will need a way to convert the matrix list to a list of |
|
143
|
657 // identifiers. If that fails, we can abort here, without losing |
|
1
|
658 // anything -- no other possible syntax is valid if we've seen the |
|
|
659 // equals sign as the next token after the `]'. |
|
|
660 |
|
|
661 $$ = (tree_multi_assignment_expression *) NULL; |
|
|
662 maybe_screwed_again--; |
|
|
663 tree_matrix *tmp = ml.pop (); |
|
|
664 tmp = tmp->reverse (); |
|
|
665 tree_return_list *id_list = tmp->to_return_list (); |
|
|
666 if (id_list == NULL_TREE) |
|
|
667 { |
|
|
668 yyerror ("parse error"); |
|
143
|
669 error ("invalid identifier list for assignment"); |
|
1
|
670 $$ = (tree_multi_assignment_expression *) NULL; |
|
|
671 ABORT_PARSE; |
|
|
672 } |
|
|
673 else |
|
143
|
674 $$ = new tree_multi_assignment_expression |
|
|
675 (id_list, $6, $5->line (), $5->column ()); |
|
1
|
676 } |
|
|
677 | NUM '=' expression |
|
|
678 { |
|
|
679 yyerror ("parse error"); |
|
|
680 error ("invalid assignment to a number"); |
|
|
681 $$ = (tree_simple_assignment_expression *) NULL; |
|
|
682 ABORT_PARSE; |
|
|
683 } |
|
|
684 | simple_expr |
|
|
685 { $$ = $1; } |
|
|
686 ; |
|
|
687 |
|
|
688 simple_expr : simple_expr1 |
|
|
689 { $$ = $1; } |
|
|
690 | identifier PLUS_PLUS |
|
143
|
691 { $$ = new tree_postfix_expression |
|
|
692 ($1, tree::increment, $2->line (), $2->column ()); } |
|
1
|
693 | identifier MINUS_MINUS |
|
143
|
694 { $$ = new tree_postfix_expression |
|
|
695 ($1, tree::decrement, $2->line (), $2->column ()); } |
|
1
|
696 | simple_expr QUOTE |
|
143
|
697 { $$ = new tree_unary_expression |
|
|
698 ($1, tree::hermitian, $2->line (), $2->column ()); } |
|
1
|
699 | simple_expr TRANSPOSE |
|
143
|
700 { $$ = new tree_unary_expression |
|
|
701 ($1, tree::transpose, $2->line (), $2->column ()); } |
|
1
|
702 | simple_expr POW simple_expr |
|
143
|
703 { $$ = new tree_binary_expression |
|
|
704 ($1, $3, tree::power, $2->line (), $2->column ()); } |
|
1
|
705 | simple_expr EPOW simple_expr |
|
143
|
706 { $$ = new tree_binary_expression |
|
|
707 ($1, $3, tree::elem_pow, $2->line (), $2->column ()); } |
|
1
|
708 | simple_expr '+' simple_expr |
|
143
|
709 { $$ = new tree_binary_expression |
|
|
710 ($1, $3, tree::add, $2->line (), $2->column ()); } |
|
1
|
711 | simple_expr '-' simple_expr |
|
143
|
712 { $$ = new tree_binary_expression |
|
|
713 ($1, $3, tree::subtract, $2->line (), $2->column ()); } |
|
1
|
714 | simple_expr '*' simple_expr |
|
143
|
715 { $$ = new tree_binary_expression |
|
|
716 ($1, $3, tree::multiply, $2->line (), $2->column ()); } |
|
1
|
717 | simple_expr '/' simple_expr |
|
143
|
718 { $$ = new tree_binary_expression |
|
|
719 ($1, $3, tree::divide, $2->line (), $2->column ()); } |
|
1
|
720 | simple_expr EMUL simple_expr |
|
143
|
721 { $$ = new tree_binary_expression |
|
|
722 ($1, $3, tree::el_mul, $2->line (), $2->column ()); } |
|
1
|
723 | simple_expr EDIV simple_expr |
|
143
|
724 { $$ = new tree_binary_expression |
|
|
725 ($1, $3, tree::el_div, $2->line (), $2->column ()); } |
|
1
|
726 | simple_expr LEFTDIV simple_expr |
|
143
|
727 { $$ = new tree_binary_expression |
|
|
728 ($1, $3, tree::leftdiv, $2->line (), $2->column ()); } |
|
1
|
729 | simple_expr ELEFTDIV simple_expr |
|
143
|
730 { $$ = new tree_binary_expression |
|
|
731 ($1, $3, tree::el_leftdiv, $2->line (), $2->column ()); } |
|
1
|
732 | simple_expr EXPR_LT simple_expr |
|
143
|
733 { $$ = new tree_binary_expression |
|
|
734 ($1, $3, tree::cmp_lt, $2->line (), $2->column ()); } |
|
1
|
735 | simple_expr EXPR_LE simple_expr |
|
143
|
736 { $$ = new tree_binary_expression |
|
|
737 ($1, $3, tree::cmp_le, $2->line (), $2->column ()); } |
|
1
|
738 | simple_expr EXPR_EQ simple_expr |
|
143
|
739 { $$ = new tree_binary_expression |
|
|
740 ($1, $3, tree::cmp_eq, $2->line (), $2->column ()); } |
|
1
|
741 | simple_expr EXPR_GE simple_expr |
|
143
|
742 { $$ = new tree_binary_expression |
|
|
743 ($1, $3, tree::cmp_ge, $2->line (), $2->column ()); } |
|
1
|
744 | simple_expr EXPR_GT simple_expr |
|
143
|
745 { $$ = new tree_binary_expression |
|
|
746 ($1, $3, tree::cmp_gt, $2->line (), $2->column ()); } |
|
1
|
747 | simple_expr EXPR_NE simple_expr |
|
143
|
748 { $$ = new tree_binary_expression |
|
|
749 ($1, $3, tree::cmp_ne, $2->line (), $2->column ()); } |
|
1
|
750 | simple_expr EXPR_AND simple_expr |
|
143
|
751 { $$ = new tree_binary_expression |
|
|
752 ($1, $3, tree::and, $2->line (), $2->column ()); } |
|
1
|
753 | simple_expr EXPR_OR simple_expr |
|
143
|
754 { $$ = new tree_binary_expression |
|
|
755 ($1, $3, tree::or, $2->line (), $2->column ()); } |
|
1
|
756 ; |
|
|
757 |
|
|
758 simple_expr1 : NUM |
|
143
|
759 { $$ = new tree_constant ($1->number ()); } |
|
1
|
760 | IMAG_NUM |
|
143
|
761 { $$ = new tree_constant (Complex (0.0, $1->number ())); } |
|
1
|
762 | TEXT |
|
143
|
763 { $$ = new tree_constant ($1->string ()); } |
|
1
|
764 | word_list_cmd |
|
|
765 { $$ = $1; } |
|
|
766 | '(' expression ')' |
|
|
767 { |
|
|
768 if ($2->is_assignment_expression ()) |
|
|
769 ((tree_assignment_expression *) $2) -> in_parens++; |
|
|
770 $$ = $2; |
|
|
771 } |
|
|
772 | variable |
|
|
773 { $$ = $1; } |
|
|
774 | matrix |
|
|
775 { $$ = $1; } |
|
|
776 | colon_expr |
|
|
777 { $$ = $1; } |
|
|
778 | PLUS_PLUS identifier %prec UNARY |
|
143
|
779 { $$ = new tree_prefix_expression |
|
|
780 ($2, tree::increment, $1->line (), $1->column ()); } |
|
1
|
781 | MINUS_MINUS identifier %prec UNARY |
|
143
|
782 { $$ = new tree_prefix_expression |
|
|
783 ($2, tree::decrement, $1->line (), $1->column ()); } |
|
1
|
784 | EXPR_NOT simple_expr |
|
143
|
785 { $$ = new tree_unary_expression |
|
|
786 ($2, tree::not, $1->line (), $1->column ()); } |
|
1
|
787 | '+' simple_expr %prec UNARY |
|
|
788 { $$ = $2; } |
|
|
789 | '-' simple_expr %prec UNARY |
|
143
|
790 { $$ = new tree_unary_expression |
|
|
791 ($2, tree::uminus, $1->line (), $1->column ()); } |
|
1
|
792 ; |
|
|
793 |
|
|
794 colon_expr : simple_expr ':' simple_expr |
|
143
|
795 { $$ = new tree_colon_expression |
|
|
796 ($1, $3, $2->line (), $2->column ()); } |
|
1
|
797 | colon_expr ':' simple_expr |
|
|
798 { |
|
|
799 $$ = $1->chain ($3); |
|
|
800 if ($$ == (tree_colon_expression *) NULL) |
|
|
801 { |
|
|
802 yyerror ("parse error"); |
|
|
803 ABORT_PARSE; |
|
|
804 } |
|
|
805 } |
|
|
806 ; |
|
|
807 |
|
|
808 word_list_cmd : identifier word_list |
|
|
809 { $$ = new tree_word_list_command ($1, $2); } |
|
|
810 ; |
|
|
811 |
|
|
812 word_list : word_list1 |
|
|
813 { $$ = $1->reverse (); } |
|
|
814 ; |
|
|
815 |
|
|
816 word_list1 : TEXT |
|
143
|
817 { $$ = new tree_word_list ($1->string ()); } |
|
1
|
818 | word_list1 TEXT |
|
143
|
819 { $$ = $1->chain ($2->string ()); } |
|
1
|
820 ; |
|
|
821 |
|
|
822 // This is truly disgusting. |
|
|
823 |
|
|
824 g_symtab : // empty |
|
|
825 { curr_sym_tab = global_sym_tab; } |
|
|
826 ; |
|
|
827 |
|
|
828 local_symtab : // empty |
|
|
829 { curr_sym_tab = tmp_local_sym_tab; } |
|
|
830 ; |
|
|
831 |
|
|
832 safe : // empty |
|
|
833 { maybe_screwed = 0; } |
|
|
834 ; |
|
|
835 |
|
|
836 are_we_screwed : // empty |
|
|
837 { maybe_screwed = 1; } |
|
|
838 ; |
|
|
839 |
|
|
840 func_def : FCN g_symtab are_we_screwed func_def1 |
|
|
841 { |
|
|
842 curr_sym_tab = top_level_sym_tab; |
|
|
843 defining_func = 0; |
|
|
844 $$ = (tree_function *) NULL; |
|
|
845 } |
|
|
846 | FCN g_symtab are_we_screwed func_def2 |
|
|
847 { |
|
|
848 curr_sym_tab = top_level_sym_tab; |
|
|
849 defining_func = 0; |
|
|
850 $$ = (tree_function *) NULL; |
|
|
851 } |
|
|
852 ; |
|
|
853 |
|
|
854 func_def1 : SCREW safe g_symtab '=' func_def2 |
|
|
855 { |
|
143
|
856 tree_identifier *tmp = new tree_identifier |
|
|
857 ($1->sym_rec (), $1->line (), $1->column ()); |
|
1
|
858 tree_parameter_list *tpl = new tree_parameter_list (tmp); |
|
|
859 tpl = tpl->reverse (); |
|
|
860 tpl->mark_as_formal_parameters (); |
|
|
861 $$ = $5->define_ret_list (tpl); |
|
|
862 } |
|
|
863 | func_def1a ']' g_symtab '=' func_def2 |
|
|
864 { |
|
|
865 tree_parameter_list *tpl = $1->reverse (); |
|
|
866 tpl->mark_as_formal_parameters (); |
|
|
867 $$ = $5->define_ret_list (tpl); |
|
|
868 } |
|
|
869 ; |
|
|
870 |
|
|
871 func_def1a : '[' safe local_symtab identifier |
|
|
872 { $$ = new tree_parameter_list ($4); } |
|
|
873 | func_def1a ',' identifier |
|
|
874 { $$ = $1->chain ($3); } |
|
|
875 ; |
|
|
876 |
|
|
877 func_def2 : identifier safe local_symtab func_def3 |
|
|
878 { |
|
|
879 char *id_name = $1->name (); |
|
|
880 // if (is_text_function_name (id_name)) |
|
|
881 // { |
|
|
882 // yyerror ("parse error"); |
|
|
883 // error ("invalid use of reserved word %s", id_name); |
|
|
884 // ABORT_PARSE; |
|
|
885 // } |
|
|
886 |
|
|
887 // If input is coming from a file, issue a warning if the name of the |
|
|
888 // file does not match the name of the function stated in the file. |
|
|
889 // Matlab doesn't provide a diagnostic (it ignores the stated name). |
|
|
890 |
|
|
891 if (reading_m_file) |
|
|
892 { |
|
|
893 if (strcmp (curr_m_file_name, id_name) != 0) |
|
|
894 warning ("function name `%s' does not agree\ |
|
|
895 with M-file name `%s.m'", id_name, curr_m_file_name); |
|
|
896 |
|
|
897 id_to_define->define ($4); |
|
|
898 id_to_define->document (help_buf); |
|
|
899 } |
|
|
900 else |
|
|
901 { |
|
168
|
902 if (! input_from_tmp_history_file |
|
|
903 && reading_script_file |
|
1
|
904 && strcmp (curr_m_file_name, id_name) == 0) |
|
|
905 warning ("function `%s' defined within\ |
|
|
906 script file `%s.m'", id_name, curr_m_file_name); |
|
|
907 |
|
|
908 $1->define ($4); |
|
|
909 $1->document (help_buf); |
|
|
910 top_level_sym_tab->clear (id_name); |
|
|
911 } |
|
|
912 |
|
143
|
913 $4->stash_function_name (id_name); |
|
1
|
914 $$ = $4; |
|
|
915 } |
|
|
916 ; |
|
|
917 |
|
|
918 func_def3 : param_list optsep opt_list fcn_end_or_eof |
|
|
919 { |
|
|
920 tree_function *fcn = new tree_function ($3, curr_sym_tab); |
|
|
921 $$ = fcn->define_param_list ($1); |
|
|
922 } |
|
|
923 | '(' ')' optsep opt_list fcn_end_or_eof |
|
|
924 { $$ = new tree_function ($4, curr_sym_tab); } |
|
|
925 | optsep opt_list fcn_end_or_eof |
|
|
926 { $$ = new tree_function ($2, curr_sym_tab); } |
|
|
927 ; |
|
|
928 |
|
|
929 fcn_end_or_eof : END |
|
|
930 { |
|
143
|
931 if (check_end ($1, token::function_end)) |
|
1
|
932 ABORT_PARSE; |
|
|
933 |
|
|
934 if (reading_m_file) |
|
|
935 check_for_garbage_after_fcn_def (); |
|
|
936 } |
|
|
937 | END_OF_INPUT |
|
|
938 { |
|
|
939 if (! (reading_m_file || reading_script_file)) |
|
|
940 YYABORT; |
|
|
941 } |
|
|
942 ; |
|
|
943 |
|
|
944 variable : identifier |
|
191
|
945 { |
|
|
946 $$ = new tree_index_expression |
|
|
947 ($1, $1->line (), $1->column ()); |
|
|
948 } |
|
1
|
949 | identifier '(' arg_list ')' |
|
191
|
950 { |
|
|
951 $$ = new tree_index_expression |
|
|
952 ($1, $3, $1->line (), $1->column ()); |
|
|
953 } |
|
1
|
954 | identifier '(' ')' |
|
|
955 { |
|
|
956 $$ = new tree_index_expression |
|
191
|
957 ($1, (tree_argument_list *) NULL, |
|
|
958 $1->line (), $1->column ()); |
|
1
|
959 } |
|
|
960 | identifier '[' |
|
|
961 { |
|
|
962 yyerror ("parse error"); |
|
|
963 error ("use `(\' and `)\' as index operators, not\ |
|
|
964 `[\' and `]\'"); |
|
|
965 $$ = (tree_index_expression *) NULL; |
|
|
966 ABORT_PARSE; |
|
|
967 } |
|
|
968 ; |
|
|
969 |
|
|
970 param_list : param_list1 ')' |
|
|
971 { |
|
|
972 tree_parameter_list *tmp = $1->reverse (); |
|
|
973 tmp->mark_as_formal_parameters (); |
|
|
974 $$ = tmp; |
|
|
975 } |
|
|
976 |
|
|
977 param_list1 : '(' identifier |
|
|
978 { $$ = new tree_parameter_list ($2); } |
|
|
979 | param_list1 ',' identifier |
|
|
980 { $$ = $1->chain ($3); } |
|
|
981 | '(' error |
|
|
982 { |
|
|
983 error ("parameter lists may only contain identifiers"); |
|
|
984 $$ = (tree_parameter_list *) NULL; |
|
|
985 } |
|
|
986 | param_list1 ',' error |
|
|
987 { |
|
|
988 error ("parameter lists may only contain identifiers"); |
|
|
989 $$ = (tree_parameter_list *) NULL; |
|
|
990 } |
|
|
991 ; |
|
|
992 |
|
|
993 identifier : NAME |
|
143
|
994 { $$ = new tree_identifier |
|
|
995 ($1->sym_rec (), $1->line (), $1->column ()); } |
|
1
|
996 |
|
|
997 arg_list : arg_list1 |
|
|
998 { $$ = $1->reverse (); } |
|
|
999 ; |
|
|
1000 |
|
|
1001 arg_list1 : ':' |
|
|
1002 { |
|
|
1003 tree_constant *colon; |
|
|
1004 colon = new tree_constant (tree_constant_rep::magic_colon); |
|
|
1005 $$ = new tree_argument_list (colon); |
|
|
1006 } |
|
|
1007 | arg_list1 ',' ':' |
|
|
1008 { |
|
|
1009 tree_constant *colon; |
|
|
1010 colon = new tree_constant (tree_constant_rep::magic_colon); |
|
|
1011 $$ = $1->chain (colon); |
|
|
1012 if ($$ == NULL_TREE) |
|
|
1013 { |
|
|
1014 yyerror ("parse error"); |
|
|
1015 ABORT_PARSE; |
|
|
1016 } |
|
|
1017 } |
|
|
1018 | expression |
|
|
1019 { $$ = new tree_argument_list ($1); } |
|
|
1020 | arg_list1 ',' expression |
|
|
1021 { |
|
|
1022 $$ = $1->chain ($3); |
|
|
1023 if ($$ == NULL_TREE) |
|
|
1024 { |
|
|
1025 yyerror ("parse error"); |
|
|
1026 ABORT_PARSE; |
|
|
1027 } |
|
|
1028 } |
|
|
1029 ; |
|
|
1030 |
|
|
1031 matrix : '[' ']' |
|
|
1032 { |
|
|
1033 mlnm.pop (); |
|
|
1034 $$ = new tree_matrix (); |
|
|
1035 } |
|
|
1036 | '[' ';' ']' |
|
|
1037 { |
|
|
1038 mlnm.pop (); |
|
|
1039 $$ = new tree_matrix (); |
|
|
1040 } |
|
|
1041 | '[' screwed_again rows ']' |
|
|
1042 { |
|
|
1043 mlnm.pop (); |
|
|
1044 maybe_screwed_again--; |
|
|
1045 tree_matrix *tmp = ml.pop (); |
|
|
1046 $$ = tmp->reverse (); |
|
|
1047 } |
|
|
1048 ; |
|
|
1049 |
|
|
1050 rows : matrix_row |
|
|
1051 | rows ';' // Ignore trailing semicolon. |
|
|
1052 | rows ';' matrix_row |
|
|
1053 ; |
|
|
1054 |
|
|
1055 matrix_row : expression // First element on row. |
|
|
1056 { |
|
|
1057 if (mlnm.top ()) |
|
|
1058 { |
|
|
1059 mlnm.pop (); |
|
|
1060 mlnm.push (0); |
|
143
|
1061 tree_matrix *tmp = new tree_matrix ($1, tree::md_none); |
|
1
|
1062 ml.push (tmp); |
|
|
1063 } |
|
|
1064 else |
|
|
1065 { |
|
|
1066 tree_matrix *tmp = ml.pop (); |
|
|
1067 tmp = tmp->chain ($1, tree::md_down); |
|
|
1068 ml.push (tmp); |
|
|
1069 } |
|
|
1070 } |
|
|
1071 | matrix_row ',' // Ignore trailing comma. |
|
|
1072 | matrix_row ',' expression |
|
|
1073 { |
|
|
1074 tree_matrix *tmp = ml.pop (); |
|
|
1075 tmp = tmp->chain ($3, tree::md_right); |
|
|
1076 ml.push (tmp); |
|
|
1077 } |
|
|
1078 ; |
|
|
1079 |
|
|
1080 %% |
|
|
1081 |
|
|
1082 static void |
|
|
1083 yyerror (char *s) |
|
|
1084 { |
|
|
1085 char *line = current_input_line; |
|
143
|
1086 int err_col = current_input_column - 1; |
|
1
|
1087 if (err_col == 0) |
|
|
1088 err_col = strlen (current_input_line) + 1; |
|
|
1089 |
|
|
1090 // Print a message like `parse error'. |
|
|
1091 fprintf (stderr, "\n%s", s); |
|
|
1092 |
|
|
1093 // Maybe print the line number and file name. |
|
|
1094 if (reading_m_file || reading_script_file) |
|
|
1095 fprintf (stderr, " near line %d of file %s.m", input_line_number, |
|
|
1096 curr_m_file_name); |
|
|
1097 |
|
|
1098 int len = strlen (line); |
|
|
1099 if (line[len-1] == '\n') |
|
|
1100 { |
|
|
1101 len--; |
|
|
1102 line[len] = '\0'; |
|
|
1103 } |
|
|
1104 |
|
|
1105 // Print the line, maybe with a pointer near the error token. |
|
|
1106 if (err_col > len) |
|
|
1107 fprintf (stderr, ":\n\n %s\n\n", line); |
|
|
1108 else |
|
|
1109 fprintf (stderr, ":\n\n %s\n %*s\n\n", line, err_col, "^"); |
|
|
1110 } |
|
|
1111 |
|
143
|
1112 static int |
|
|
1113 check_end (token *tok, token::end_tok_type expected) |
|
|
1114 { |
|
|
1115 token::end_tok_type ettype = tok->ettype (); |
|
|
1116 if (ettype != expected && ettype != token::simple_end) |
|
|
1117 { |
|
|
1118 yyerror ("parse error"); |
|
|
1119 |
|
|
1120 int l = tok->line (); |
|
|
1121 int c = tok->column (); |
|
|
1122 |
|
|
1123 switch (expected) |
|
|
1124 { |
|
|
1125 case token::for_end: |
|
|
1126 end_error ("for", ettype, l, c); |
|
|
1127 break; |
|
|
1128 case token::function_end: |
|
|
1129 end_error ("function", ettype, l, c); |
|
|
1130 break; |
|
|
1131 case token::if_end: |
|
|
1132 end_error ("if", ettype, l, c); |
|
|
1133 break; |
|
|
1134 case token::while_end: |
|
|
1135 end_error ("while", ettype, l, c); |
|
|
1136 break; |
|
|
1137 default: |
|
|
1138 panic_impossible (); |
|
|
1139 break; |
|
|
1140 } |
|
|
1141 return 1; |
|
|
1142 } |
|
|
1143 else |
|
|
1144 return 0; |
|
|
1145 } |
|
|
1146 |
|
1
|
1147 static void |
|
143
|
1148 end_error (char *type, token::end_tok_type ettype, int l, int c) |
|
1
|
1149 { |
|
143
|
1150 static char *fmt = "%s command matched by `%s' near line %d column %d"; |
|
|
1151 |
|
1
|
1152 switch (ettype) |
|
|
1153 { |
|
143
|
1154 case token::simple_end: |
|
|
1155 error (fmt, type, "end", l, c); |
|
1
|
1156 break; |
|
143
|
1157 case token::for_end: |
|
|
1158 error (fmt, type, "endfor", l, c); |
|
1
|
1159 break; |
|
143
|
1160 case token::function_end: |
|
|
1161 error (fmt, type, "endfunction", l, c); |
|
1
|
1162 break; |
|
143
|
1163 case token::if_end: |
|
|
1164 error (fmt, type, "endif", l, c); |
|
1
|
1165 break; |
|
143
|
1166 case token::while_end: |
|
|
1167 error (fmt, type, "endwhile", l, c); |
|
1
|
1168 break; |
|
|
1169 default: |
|
|
1170 panic_impossible (); |
|
|
1171 break; |
|
|
1172 } |
|
|
1173 } |
|
|
1174 |
|
|
1175 /* |
|
|
1176 * Need to make sure that the expression isn't already an identifier |
|
|
1177 * that has a name, or an assignment expression. |
|
|
1178 * |
|
|
1179 * Note that an expression can't be just an identifier anymore -- it |
|
|
1180 * must at least be an index expression (see the definition of the |
|
|
1181 * non-terminal `variable' above). |
|
183
|
1182 * |
|
|
1183 * XXX FIXME XXX. This isn't quite sufficient. For example, try the |
|
|
1184 * command `x = 4, x' for `x' previously undefined. |
|
1
|
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 } |
