|
143
|
1 /* parse.y -*- text -*- |
|
1
|
2 |
|
315
|
3 Copyright (C) 1992, 1993, 1994 John W. Eaton |
|
1
|
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 |
|
767
|
25 // C decarations. |
|
|
26 |
|
1
|
27 %{ |
|
|
28 #define YYDEBUG 1 |
|
|
29 |
|
240
|
30 #ifdef HAVE_CONFIG_H |
|
|
31 #include "config.h" |
|
|
32 #endif |
|
|
33 |
|
581
|
34 #include <strstream.h> |
|
|
35 |
|
1
|
36 #include "SLStack.h" |
|
|
37 |
|
|
38 #include "Matrix.h" |
|
|
39 |
|
168
|
40 #include "octave-hist.h" |
|
1
|
41 #include "user-prefs.h" |
|
584
|
42 #include "tree-base.h" |
|
|
43 #include "tree-expr.h" |
|
|
44 #include "tree-cmd.h" |
|
581
|
45 #include "tree-const.h" |
|
|
46 #include "tree-misc.h" |
|
|
47 #include "variables.h" |
|
|
48 #include "tree-plot.h" |
|
|
49 #include "octave.h" |
|
|
50 #include "symtab.h" |
|
|
51 #include "parse.h" |
|
|
52 #include "token.h" |
|
|
53 #include "error.h" |
|
|
54 #include "pager.h" |
|
1
|
55 #include "input.h" |
|
|
56 #include "utils.h" |
|
|
57 #include "lex.h" |
|
|
58 |
|
|
59 // Nonzero means we're in the middle of defining a function. |
|
|
60 int defining_func = 0; |
|
|
61 |
|
|
62 // Nonzero means we're in the middle of defining a loop. |
|
|
63 int looping = 0; |
|
|
64 |
|
|
65 // Nonzero means we're in the middle of defining a conditional expression. |
|
|
66 int iffing = 0; |
|
|
67 |
|
|
68 // Nonzero means we need to do some extra lookahead to avoid being |
|
|
69 // screwed by bogus function syntax. |
|
|
70 int maybe_screwed = 0; |
|
|
71 |
|
|
72 // Nonzero means we need to do some extra lookahead to avoid being |
|
|
73 // screwed by bogus function syntax. |
|
|
74 int maybe_screwed_again = 0; |
|
|
75 |
|
|
76 // Temporary symbol table pointer used to cope with bogus function syntax. |
|
522
|
77 symbol_table *tmp_local_sym_tab = 0; |
|
1
|
78 |
|
|
79 // Stack to hold list of literal matrices. |
|
|
80 SLStack <tree_matrix *> ml; |
|
|
81 |
|
|
82 // A nonzero element corresponding to an element of ml means we just |
|
|
83 // started reading a new matrix. This should probably be part of a |
|
|
84 // new struct for matrix lists... |
|
|
85 SLStack <int> mlnm; |
|
|
86 |
|
|
87 // The current input line number. |
|
|
88 int input_line_number = 0; |
|
|
89 |
|
|
90 // The column of the current token. |
|
143
|
91 int current_input_column = 1; |
|
1
|
92 |
|
338
|
93 // Buffer for help text snagged from function files. |
|
991
|
94 char *help_buf = 0; |
|
1
|
95 |
|
|
96 // Nonzero means we're working on a plot command. |
|
|
97 int plotting = 0; |
|
|
98 |
|
113
|
99 // Nonzero means we've seen something that means we must be past the |
|
|
100 // range part of a plot command. |
|
|
101 int past_plot_range = 0; |
|
|
102 |
|
1
|
103 // Nonzero means we're looking at the range part of a plot command. |
|
|
104 int in_plot_range = 0; |
|
|
105 |
|
|
106 // Nonzero means we're looking at the using part of a plot command. |
|
|
107 int in_plot_using = 0; |
|
|
108 |
|
|
109 // Nonzero means we're looking at the style part of a plot command. |
|
|
110 int in_plot_style = 0; |
|
|
111 |
|
751
|
112 // Nonzero means we're looking at an indirect reference to a structure |
|
|
113 // element. |
|
|
114 int looking_at_indirect_ref = 0; |
|
|
115 |
|
496
|
116 // Forward declarations for some functions defined at the bottom of |
|
|
117 // the file. |
|
|
118 |
|
|
119 // Generic error messages. |
|
|
120 static void yyerror (char *s); |
|
1
|
121 |
|
578
|
122 // Error mesages for mismatched end tokens. |
|
143
|
123 static void end_error (char *type, token::end_tok_type ettype, int l, int c); |
|
1
|
124 |
|
578
|
125 // Check to see that end tokens are properly matched. |
|
496
|
126 static int check_end (token *tok, token::end_tok_type expected); |
|
1
|
127 |
|
496
|
128 // Try to figure out early if an expression should become an |
|
|
129 // assignment to the builtin variable ans. |
|
|
130 static tree_expression *maybe_convert_to_ans_assign (tree_expression *expr); |
|
|
131 |
|
|
132 // Maybe print a warning if an assignment expression is used as the |
|
|
133 // test in a logical expression. |
|
|
134 static void maybe_warn_assign_as_truth_value (tree_expression *expr); |
|
1
|
135 |
|
578
|
136 // Build a binary expression. |
|
751
|
137 static tree_expression *make_binary_op |
|
|
138 (int op, tree_expression *op1, token *tok_val, tree_expression *op2); |
|
578
|
139 |
|
|
140 // Build a prefix expression. |
|
751
|
141 static tree_expression *make_prefix_op |
|
|
142 (int op, tree_identifier *op1, token *tok_val); |
|
578
|
143 |
|
|
144 // Build a postfix expression. |
|
751
|
145 static tree_expression *make_postfix_op |
|
|
146 (int op, tree_identifier *op1, token *tok_val); |
|
578
|
147 |
|
|
148 // Build a binary expression. |
|
751
|
149 static tree_expression *make_unary_op |
|
|
150 (int op, tree_expression *op1, token *tok_val); |
|
578
|
151 |
|
666
|
152 // Make an expression that handles assignment of multiple values. |
|
751
|
153 static tree_expression *make_multi_val_ret |
|
|
154 (tree_expression *rhs, int l = -1, int c = -1); |
|
|
155 |
|
|
156 // Make an index expression. |
|
|
157 static tree_index_expression *make_index_expression |
|
|
158 (tree_indirect_ref *indir, tree_argument_list *args); |
|
666
|
159 |
|
1
|
160 #define ABORT_PARSE \ |
|
|
161 do \ |
|
|
162 { \ |
|
522
|
163 global_command = 0; \ |
|
1
|
164 yyerrok; \ |
|
|
165 if (interactive) \ |
|
|
166 YYACCEPT; \ |
|
|
167 else \ |
|
|
168 YYABORT; \ |
|
|
169 } \ |
|
|
170 while (0) |
|
|
171 |
|
|
172 %} |
|
|
173 |
|
666
|
174 // Bison declarations. |
|
|
175 |
|
1
|
176 %union |
|
|
177 { |
|
143
|
178 // The type of the basic tokens returned by the lexer. |
|
|
179 token *tok_val; |
|
|
180 |
|
|
181 // Types for the nonterminals we generate. |
|
1
|
182 tree *tree_type; |
|
496
|
183 tree_expression *tree_expression_type; |
|
1
|
184 tree_constant *tree_constant_type; |
|
|
185 tree_matrix *tree_matrix_type; |
|
|
186 tree_identifier *tree_identifier_type; |
|
751
|
187 tree_indirect_ref *tree_indirect_ref_type; |
|
1
|
188 tree_function *tree_function_type; |
|
|
189 tree_index_expression *tree_index_expression_type; |
|
|
190 tree_colon_expression *tree_colon_expression_type; |
|
|
191 tree_argument_list *tree_argument_list_type; |
|
|
192 tree_parameter_list *tree_parameter_list_type; |
|
|
193 tree_command *tree_command_type; |
|
|
194 tree_if_command *tree_if_command_type; |
|
578
|
195 tree_if_clause *tree_if_clause_type; |
|
|
196 tree_if_command_list *tree_if_command_list_type; |
|
|
197 tree_global *tree_global_type; |
|
|
198 tree_global_init_list *tree_global_init_list_type; |
|
195
|
199 tree_global_command *tree_global_command_type; |
|
578
|
200 tree_statement *tree_statement_type; |
|
|
201 tree_statement_list *tree_statement_list_type; |
|
1
|
202 tree_plot_command *tree_plot_command_type; |
|
578
|
203 subplot *subplot_type; |
|
|
204 subplot_list *subplot_list_type; |
|
|
205 plot_limits *plot_limits_type; |
|
|
206 plot_range *plot_range_type; |
|
|
207 subplot_using *subplot_using_type; |
|
|
208 subplot_style *subplot_style_type; |
|
1
|
209 } |
|
|
210 |
|
143
|
211 // Tokens with line and column information. |
|
|
212 %token <tok_val> '=' ':' '-' '+' '*' '/' |
|
428
|
213 %token <tok_val> EXPR_AND_AND EXPR_OR_OR |
|
143
|
214 %token <tok_val> EXPR_AND EXPR_OR EXPR_NOT |
|
|
215 %token <tok_val> EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
216 %token <tok_val> LEFTDIV EMUL EDIV ELEFTDIV QUOTE TRANSPOSE |
|
|
217 %token <tok_val> PLUS_PLUS MINUS_MINUS POW EPOW |
|
|
218 %token <tok_val> NUM IMAG_NUM |
|
169
|
219 %token <tok_val> NAME SCREW |
|
143
|
220 %token <tok_val> END |
|
|
221 %token <tok_val> PLOT |
|
|
222 %token <tok_val> TEXT STYLE |
|
191
|
223 %token <tok_val> FOR WHILE IF ELSEIF ELSE BREAK CONTINUE FUNC_RET |
|
924
|
224 %token <tok_val> UNWIND CLEANUP |
|
578
|
225 %token <tok_val> GLOBAL |
|
751
|
226 %token <tok_val> TEXT_ID |
|
1
|
227 |
|
143
|
228 // Other tokens. |
|
627
|
229 %token LEXICAL_ERROR |
|
191
|
230 %token FCN SCREW_TWO |
|
206
|
231 %token ELLIPSIS |
|
922
|
232 %token ALL_VA_ARGS |
|
206
|
233 %token END_OF_INPUT |
|
883
|
234 %token USING TITLE WITH COLON OPEN_BRACE CLOSE_BRACE CLEAR |
|
1
|
235 |
|
143
|
236 // Nonterminals we construct. |
|
578
|
237 %type <tree_type> input |
|
496
|
238 %type <tree_expression_type> expression simple_expr simple_expr1 |
|
|
239 %type <tree_expression_type> ans_expression title |
|
1
|
240 %type <tree_matrix_type> matrix |
|
|
241 %type <tree_identifier_type> identifier |
|
751
|
242 %type <tree_indirect_ref_type> indirect_ref indirect_ref1 |
|
578
|
243 %type <tree_function_type> func_def1 func_def2 func_def3 |
|
482
|
244 %type <tree_index_expression_type> variable word_list_cmd |
|
1
|
245 %type <tree_colon_expression_type> colon_expr |
|
578
|
246 %type <tree_argument_list_type> arg_list word_list |
|
723
|
247 %type <tree_parameter_list_type> param_list param_list1 |
|
|
248 %type <tree_parameter_list_type> return_list return_list1 |
|
578
|
249 %type <tree_command_type> command func_def |
|
|
250 %type <tree_if_command_type> if_command |
|
|
251 %type <tree_if_clause_type> elseif_clause else_clause |
|
|
252 %type <tree_if_command_list_type> if_cmd_list1 if_cmd_list |
|
|
253 %type <tree_global_type> global_decl2 |
|
|
254 %type <tree_global_init_list_type> global_decl1 |
|
|
255 %type <tree_global_command_type> global_decl |
|
|
256 %type <tree_statement_type> statement |
|
627
|
257 %type <tree_statement_list_type> simple_list simple_list1 list list1 |
|
|
258 %type <tree_statement_list_type> opt_list input1 |
|
1
|
259 %type <tree_plot_command_type> plot_command |
|
578
|
260 %type <subplot_type> plot_command2 plot_options |
|
|
261 %type <subplot_list_type> plot_command1 |
|
|
262 %type <plot_limits_type> ranges |
|
|
263 %type <plot_range_type> ranges1 |
|
|
264 %type <subplot_using_type> using using1 |
|
|
265 %type <subplot_style_type> style |
|
1
|
266 |
|
143
|
267 // Precedence and associativity. |
|
1
|
268 %left ';' ',' '\n' |
|
|
269 %right '=' |
|
428
|
270 %left EXPR_AND_AND EXPR_OR_OR |
|
1
|
271 %left EXPR_AND EXPR_OR |
|
|
272 %left EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
273 %left ':' |
|
|
274 %left '-' '+' |
|
|
275 %left '*' '/' LEFTDIV EMUL EDIV ELEFTDIV |
|
|
276 %left QUOTE TRANSPOSE |
|
|
277 %left UNARY PLUS_PLUS MINUS_MINUS EXPR_NOT |
|
|
278 %right POW EPOW |
|
|
279 |
|
169
|
280 // There are 19 shift/reduce conflicts, ok? |
|
|
281 %expect 19 |
|
143
|
282 |
|
|
283 // Where to start. |
|
1
|
284 %start input |
|
|
285 |
|
666
|
286 // Grammar rules. |
|
|
287 |
|
1
|
288 %% |
|
|
289 |
|
627
|
290 input : input1 |
|
1
|
291 { |
|
627
|
292 global_command = $1; |
|
1
|
293 promptflag = 1; |
|
|
294 YYACCEPT; |
|
|
295 } |
|
|
296 | END_OF_INPUT |
|
|
297 { |
|
522
|
298 global_command = 0; |
|
1
|
299 promptflag = 1; |
|
|
300 YYABORT; |
|
|
301 } |
|
627
|
302 | simple_list parse_error |
|
|
303 { ABORT_PARSE; } |
|
|
304 | parse_error |
|
|
305 { ABORT_PARSE; } |
|
|
306 ; |
|
|
307 |
|
|
308 input1 : '\n' |
|
|
309 { $$ = 0; } |
|
327
|
310 | simple_list |
|
627
|
311 { $$ = $1; } |
|
1
|
312 | simple_list '\n' |
|
627
|
313 { $$ = $1; } |
|
1
|
314 | simple_list END_OF_INPUT |
|
627
|
315 { $$ = $1; } |
|
|
316 ; |
|
|
317 |
|
|
318 parse_error : LEXICAL_ERROR |
|
1
|
319 | error |
|
|
320 ; |
|
|
321 |
|
|
322 simple_list : semi_comma |
|
522
|
323 { $$ = 0; } |
|
1
|
324 | comma_semi |
|
522
|
325 { $$ = 0; } |
|
1
|
326 | simple_list1 |
|
578
|
327 { $$ = $1; } |
|
1
|
328 | simple_list1 semi_comma |
|
|
329 { |
|
578
|
330 tree_statement *tmp = $1->rear (); |
|
|
331 tmp->set_print_flag (0); |
|
1
|
332 } |
|
|
333 | simple_list1 comma_semi |
|
578
|
334 { $$ = $1; } |
|
1
|
335 ; |
|
|
336 |
|
578
|
337 simple_list1 : statement |
|
|
338 { $$ = new tree_statement_list ($1); } |
|
|
339 | semi_comma statement |
|
|
340 { $$ = new tree_statement_list ($2); } |
|
|
341 | comma_semi statement |
|
|
342 { $$ = new tree_statement_list ($2); } |
|
|
343 | simple_list1 semi_comma statement |
|
1
|
344 { |
|
578
|
345 tree_statement *tmp = $1->rear (); |
|
|
346 tmp->set_print_flag (0); |
|
|
347 $1->append ($3); |
|
1
|
348 } |
|
578
|
349 | simple_list1 comma_semi statement |
|
|
350 { $1->append ($3); } |
|
1
|
351 ; |
|
|
352 |
|
|
353 semi_comma : ';' |
|
|
354 | semi_comma ',' |
|
|
355 | semi_comma ';' |
|
|
356 ; |
|
|
357 |
|
|
358 comma_semi : ',' |
|
|
359 | comma_semi ';' |
|
|
360 | comma_semi ',' |
|
|
361 ; |
|
|
362 |
|
|
363 comma_nl_sep : ',' |
|
|
364 | '\n' |
|
|
365 | comma_nl_sep sep |
|
|
366 ; |
|
|
367 |
|
|
368 semi_sep : ';' |
|
|
369 | semi_sep sep |
|
|
370 ; |
|
|
371 |
|
|
372 opt_list : // empty |
|
578
|
373 { $$ = new tree_statement_list (); } |
|
1
|
374 | list |
|
|
375 { $$ = $1; } |
|
496
|
376 ; |
|
1
|
377 |
|
|
378 list : list1 |
|
578
|
379 { $$ = $1; } |
|
1
|
380 | list1 comma_nl_sep |
|
578
|
381 { $$ = $1; } |
|
1
|
382 | list1 semi_sep |
|
|
383 { |
|
578
|
384 tree_statement *tmp = $1->rear (); |
|
|
385 tmp->set_print_flag (0); |
|
1
|
386 } |
|
|
387 ; |
|
|
388 |
|
578
|
389 list1 : statement |
|
440
|
390 { |
|
|
391 beginning_of_function = 0; |
|
578
|
392 $$ = new tree_statement_list ($1); |
|
440
|
393 } |
|
578
|
394 | list1 comma_nl_sep statement |
|
|
395 { $1->append ($3); } |
|
|
396 | list1 semi_sep statement |
|
1
|
397 { |
|
578
|
398 tree_statement *tmp = $1->rear (); |
|
|
399 tmp->set_print_flag (0); |
|
|
400 $1->append ($3); |
|
1
|
401 } |
|
|
402 ; |
|
|
403 |
|
578
|
404 statement : command |
|
|
405 { $$ = new tree_statement ($1); } |
|
1
|
406 | ans_expression |
|
578
|
407 { $$ = new tree_statement ($1); } |
|
883
|
408 | PLOT CLEAR |
|
|
409 { |
|
|
410 symbol_record *sr = lookup_by_name ("clearplot", 0); |
|
|
411 tree_identifier *id = new tree_identifier (sr); |
|
|
412 $$ = new tree_statement (id); |
|
|
413 } |
|
1
|
414 ; |
|
|
415 |
|
|
416 plot_command : PLOT plot_command1 |
|
|
417 { |
|
578
|
418 if (! $2 && $1->pttype () != token::replot) |
|
478
|
419 { |
|
|
420 yyerror ("must have something to plot"); |
|
|
421 ABORT_PARSE; |
|
|
422 } |
|
|
423 else |
|
|
424 { |
|
578
|
425 $$ = new tree_plot_command ($2, $1->pttype ()); |
|
478
|
426 plotting = 0; |
|
|
427 past_plot_range = 0; |
|
|
428 in_plot_range = 0; |
|
|
429 in_plot_using = 0; |
|
|
430 in_plot_style = 0; |
|
|
431 } |
|
1
|
432 } |
|
|
433 | PLOT ranges plot_command1 |
|
|
434 { |
|
476
|
435 if ($1->pttype () == token::replot) |
|
|
436 { |
|
|
437 yyerror ("cannot specify new ranges with replot"); |
|
|
438 ABORT_PARSE; |
|
|
439 } |
|
|
440 else |
|
|
441 { |
|
578
|
442 $$ = new tree_plot_command ($3, $2, $1->pttype ()); |
|
476
|
443 plotting = 0; |
|
|
444 past_plot_range = 0; |
|
|
445 in_plot_range = 0; |
|
|
446 in_plot_using = 0; |
|
|
447 in_plot_style = 0; |
|
|
448 } |
|
1
|
449 } |
|
|
450 ; |
|
|
451 |
|
|
452 ranges : ranges1 |
|
578
|
453 { $$ = new plot_limits ($1); } |
|
1
|
454 | ranges1 ranges1 |
|
578
|
455 { $$ = new plot_limits ($1, $2); } |
|
1
|
456 | ranges1 ranges1 ranges1 |
|
578
|
457 { $$ = new plot_limits ($1, $2, $3); } |
|
1
|
458 ; |
|
|
459 |
|
|
460 ranges1 : OPEN_BRACE expression COLON expression CLOSE_BRACE |
|
578
|
461 { $$ = new plot_range ($2, $4); } |
|
1
|
462 | OPEN_BRACE COLON expression CLOSE_BRACE |
|
578
|
463 { $$ = new plot_range (0, $3); } |
|
1
|
464 | OPEN_BRACE expression COLON CLOSE_BRACE |
|
578
|
465 { $$ = new plot_range ($2, 0); } |
|
1
|
466 | OPEN_BRACE COLON CLOSE_BRACE |
|
578
|
467 { $$ = new plot_range (); } |
|
1
|
468 | OPEN_BRACE CLOSE_BRACE |
|
578
|
469 { $$ = new plot_range (); } |
|
1
|
470 ; |
|
|
471 |
|
478
|
472 plot_command1 : // empty |
|
522
|
473 { $$ = 0; } |
|
478
|
474 | plot_command2 |
|
578
|
475 { $$ = new subplot_list ($1); } |
|
1
|
476 | plot_command1 ',' plot_command2 |
|
578
|
477 { $1->append ($3); } |
|
1
|
478 ; |
|
|
479 |
|
|
480 plot_command2 : expression |
|
578
|
481 { $$ = new subplot ($1); } |
|
1
|
482 | expression plot_options |
|
578
|
483 { |
|
|
484 $2->set_data ($1); |
|
|
485 $$ = $2; |
|
|
486 } |
|
1
|
487 ; |
|
|
488 |
|
|
489 plot_options : using |
|
578
|
490 { $$ = new subplot ($1, 0, 0); } |
|
1
|
491 | title |
|
578
|
492 { $$ = new subplot (0, $1, 0); } |
|
1
|
493 | style |
|
578
|
494 { $$ = new subplot (0, 0, $1); } |
|
1
|
495 | using title |
|
578
|
496 { $$ = new subplot ($1, $2, 0); } |
|
|
497 | title using |
|
|
498 { $$ = new subplot ($2, $1, 0); } |
|
|
499 | using style |
|
|
500 { $$ = new subplot ($1, 0, $2); } |
|
|
501 | style using |
|
|
502 { $$ = new subplot ($2, 0, $1); } |
|
|
503 | title style |
|
|
504 { $$ = new subplot (0, $1, $2); } |
|
|
505 | style title |
|
|
506 { $$ = new subplot (0, $2, $1); } |
|
|
507 | using title style |
|
|
508 { $$ = new subplot ($1, $2, $3); } |
|
|
509 | using style title |
|
|
510 { $$ = new subplot ($1, $3, $2); } |
|
|
511 | title using style |
|
|
512 { $$ = new subplot ($2, $1, $3); } |
|
|
513 | title style using |
|
|
514 { $$ = new subplot ($3, $1, $2); } |
|
|
515 | style using title |
|
|
516 { $$ = new subplot ($2, $3, $1); } |
|
|
517 | style title using |
|
|
518 { $$ = new subplot ($3, $2, $1); } |
|
1
|
519 ; |
|
|
520 |
|
|
521 using : using1 |
|
|
522 { |
|
496
|
523 in_plot_using = 0; |
|
1
|
524 $$ = $1; |
|
|
525 } |
|
|
526 | using1 expression |
|
|
527 { |
|
496
|
528 in_plot_using = 0; |
|
1
|
529 $$ = $1->set_format ($2); |
|
|
530 } |
|
|
531 ; |
|
|
532 |
|
|
533 using1 : USING expression |
|
|
534 { |
|
578
|
535 subplot_using *tmp = new subplot_using (); |
|
1
|
536 $$ = tmp->add_qualifier ($2); |
|
|
537 } |
|
|
538 | using1 COLON expression |
|
|
539 { $$ = $1->add_qualifier ($3); } |
|
|
540 ; |
|
|
541 |
|
|
542 title : TITLE expression |
|
|
543 { $$ = $2; } |
|
|
544 ; |
|
|
545 |
|
|
546 style : WITH STYLE |
|
578
|
547 { $$ = new subplot_style ($2->string ()); } |
|
1
|
548 | WITH STYLE expression |
|
578
|
549 { $$ = new subplot_style ($2->string (), $3); } |
|
1
|
550 | WITH STYLE expression bogus_syntax expression |
|
578
|
551 { $$ = new subplot_style ($2->string (), $3, $5); } |
|
1
|
552 ; |
|
|
553 |
|
|
554 bogus_syntax : // empty |
|
|
555 ; |
|
|
556 |
|
|
557 ans_expression : expression |
|
|
558 { $$ = maybe_convert_to_ans_assign ($1); } |
|
|
559 ; |
|
|
560 |
|
|
561 global_decl : GLOBAL global_decl1 |
|
578
|
562 { |
|
|
563 $$ = new tree_global_command ($2, $1->line (), |
|
|
564 $1->column ()); |
|
|
565 } |
|
1
|
566 ; |
|
|
567 |
|
578
|
568 global_decl1 : global_decl2 |
|
|
569 { $$ = new tree_global_init_list ($1); } |
|
|
570 | global_decl1 optcomma global_decl2 |
|
|
571 { $1->append ($3); } |
|
|
572 |
|
|
573 global_decl2 : identifier |
|
|
574 { $$ = new tree_global ($1); } |
|
|
575 | identifier '=' expression |
|
1
|
576 { |
|
578
|
577 tree_simple_assignment_expression *tmp_ass; |
|
|
578 tmp_ass = new tree_simple_assignment_expression |
|
581
|
579 ($1, $3, 0, 0, $2->line (), $2->column ()); |
|
578
|
580 $$ = new tree_global (tmp_ass); |
|
1
|
581 } |
|
|
582 ; |
|
|
583 |
|
|
584 optcomma : // empty |
|
|
585 | ',' |
|
|
586 { |
|
|
587 if (user_pref.warn_comma_in_global_decl) |
|
|
588 warning ("comma in global declaration not\ |
|
|
589 interpreted as a command separator"); |
|
|
590 } |
|
|
591 ; |
|
|
592 |
|
578
|
593 command : plot_command |
|
|
594 { $$ = $1; } |
|
|
595 | func_def |
|
|
596 { $$ = $1; } |
|
|
597 | global_decl |
|
|
598 { $$ = $1; } |
|
|
599 | if_command |
|
|
600 { |
|
|
601 iffing--; |
|
|
602 $$ = $1; |
|
|
603 } |
|
916
|
604 |
|
924
|
605 | UNWIND optsep opt_list CLEANUP optsep opt_list END |
|
916
|
606 { |
|
924
|
607 if (check_end ($7, token::unwind_protect_end)) |
|
916
|
608 ABORT_PARSE; |
|
|
609 |
|
924
|
610 $$ = new tree_unwind_protect_command ($3, $6, $1->line (), |
|
916
|
611 $1->column ()); |
|
|
612 } |
|
578
|
613 | WHILE expression optsep opt_list END |
|
1
|
614 { |
|
|
615 maybe_warn_assign_as_truth_value ($2); |
|
143
|
616 if (check_end ($5, token::while_end)) |
|
|
617 ABORT_PARSE; |
|
1
|
618 looping--; |
|
191
|
619 $$ = new tree_while_command ($2, $4, $1->line (), |
|
|
620 $1->column ()); |
|
1
|
621 } |
|
118
|
622 | FOR variable '=' expression optsep opt_list END |
|
1
|
623 { |
|
143
|
624 if (check_end ($7, token::for_end)) |
|
|
625 ABORT_PARSE; |
|
1
|
626 looping--; |
|
191
|
627 $$ = new tree_for_command ($2, $4, $6, |
|
|
628 $1->line (), $1->column ()); |
|
1
|
629 } |
|
|
630 | BREAK |
|
|
631 { |
|
|
632 if (!looping) |
|
|
633 { |
|
1005
|
634 yyerror ("break: only meaningful within a `for'\ |
|
1
|
635 or `while' loop"); |
|
|
636 ABORT_PARSE; |
|
|
637 } |
|
191
|
638 $$ = new tree_break_command ($1->line (), $1->column ()); |
|
1
|
639 } |
|
|
640 | CONTINUE |
|
|
641 { |
|
|
642 if (!looping) |
|
|
643 { |
|
1005
|
644 yyerror ("continue: only meaningful within a\ |
|
1
|
645 `for' or `while' loop"); |
|
|
646 ABORT_PARSE; |
|
|
647 } |
|
191
|
648 $$ = new tree_continue_command ($1->line (), |
|
|
649 $1->column ()); |
|
1
|
650 } |
|
|
651 | FUNC_RET |
|
|
652 { |
|
|
653 if (!defining_func) |
|
|
654 { |
|
1005
|
655 yyerror ("return: only meaningful within a function"); |
|
1
|
656 ABORT_PARSE; |
|
|
657 } |
|
191
|
658 $$ = new tree_return_command ($1->line (), $1->column ()); |
|
1
|
659 } |
|
|
660 ; |
|
|
661 |
|
578
|
662 if_command : IF if_cmd_list END |
|
|
663 { |
|
|
664 if (check_end ($3, token::if_end)) |
|
|
665 ABORT_PARSE; |
|
|
666 $$ = new tree_if_command ($2, $1->line (), $1->column ()); |
|
|
667 } |
|
|
668 ; |
|
|
669 |
|
|
670 if_cmd_list : if_cmd_list1 |
|
|
671 { $$ = $1 } |
|
|
672 | if_cmd_list1 else_clause |
|
|
673 { $1->append ($2); } |
|
|
674 ; |
|
|
675 |
|
|
676 if_cmd_list1 : expression optsep opt_list |
|
|
677 { |
|
|
678 maybe_warn_assign_as_truth_value ($1); |
|
|
679 tree_if_clause *t = new tree_if_clause ($1, $3); |
|
|
680 $$ = new tree_if_command_list (t); |
|
|
681 } |
|
|
682 | if_cmd_list1 elseif_clause |
|
|
683 { $1->append ($2); } |
|
|
684 ; |
|
|
685 |
|
|
686 elseif_clause : ELSEIF optsep expression optsep opt_list |
|
1
|
687 { |
|
|
688 maybe_warn_assign_as_truth_value ($3); |
|
578
|
689 $$ = new tree_if_clause ($3, $5); |
|
1
|
690 } |
|
578
|
691 ; |
|
|
692 |
|
|
693 else_clause : ELSE optsep opt_list |
|
|
694 { $$ = new tree_if_clause ($3); } |
|
1
|
695 ; |
|
|
696 |
|
|
697 optsep : // empty |
|
|
698 | sep |
|
|
699 ; |
|
|
700 |
|
|
701 sep : ',' |
|
|
702 | ';' |
|
|
703 | '\n' |
|
|
704 | sep ',' |
|
|
705 | sep ';' |
|
|
706 | sep '\n' |
|
|
707 ; |
|
|
708 |
|
|
709 screwed_again : // empty |
|
|
710 { maybe_screwed_again++; } |
|
|
711 ; |
|
|
712 |
|
|
713 expression : variable '=' expression |
|
143
|
714 { $$ = new tree_simple_assignment_expression |
|
581
|
715 ($1, $3, 0, 0, $2->line (), $2->column ()); } |
|
1
|
716 | NUM '=' expression |
|
|
717 { |
|
1005
|
718 yyerror ("invalid assignment to a number"); |
|
522
|
719 $$ = 0; |
|
1
|
720 ABORT_PARSE; |
|
|
721 } |
|
666
|
722 | '[' screwed_again matrix_row SCREW_TWO '=' expression |
|
|
723 { |
|
|
724 $$ = make_multi_val_ret ($6, $5->line (), $5->column ()); |
|
|
725 |
|
|
726 if (! $$) |
|
|
727 ABORT_PARSE; |
|
|
728 } |
|
1
|
729 | simple_expr |
|
|
730 { $$ = $1; } |
|
|
731 ; |
|
|
732 |
|
|
733 simple_expr : simple_expr1 |
|
|
734 { $$ = $1; } |
|
|
735 | identifier PLUS_PLUS |
|
578
|
736 { $$ = make_postfix_op (PLUS_PLUS, $1, $2); } |
|
1
|
737 | identifier MINUS_MINUS |
|
578
|
738 { $$ = make_postfix_op (MINUS_MINUS, $1, $2); } |
|
1
|
739 | simple_expr QUOTE |
|
578
|
740 { $$ = make_unary_op (QUOTE, $1, $2); } |
|
1
|
741 | simple_expr TRANSPOSE |
|
578
|
742 { $$ = make_unary_op (TRANSPOSE, $1, $2); } |
|
1
|
743 | simple_expr POW simple_expr |
|
578
|
744 { $$ = make_binary_op (POW, $1, $2, $3); } |
|
1
|
745 | simple_expr EPOW simple_expr |
|
578
|
746 { $$ = make_binary_op (EPOW, $1, $2, $3); } |
|
1
|
747 | simple_expr '+' simple_expr |
|
578
|
748 { $$ = make_binary_op ('+', $1, $2, $3); } |
|
1
|
749 | simple_expr '-' simple_expr |
|
578
|
750 { $$ = make_binary_op ('-', $1, $2, $3); } |
|
1
|
751 | simple_expr '*' simple_expr |
|
578
|
752 { $$ = make_binary_op ('*', $1, $2, $3); } |
|
1
|
753 | simple_expr '/' simple_expr |
|
578
|
754 { $$ = make_binary_op ('/', $1, $2, $3); } |
|
1
|
755 | simple_expr EMUL simple_expr |
|
578
|
756 { $$ = make_binary_op (EMUL, $1, $2, $3); } |
|
1
|
757 | simple_expr EDIV simple_expr |
|
578
|
758 { $$ = make_binary_op (EDIV, $1, $2, $3); } |
|
1
|
759 | simple_expr LEFTDIV simple_expr |
|
578
|
760 { $$ = make_binary_op (LEFTDIV, $1, $2, $3); } |
|
1
|
761 | simple_expr ELEFTDIV simple_expr |
|
578
|
762 { $$ = make_binary_op (ELEFTDIV, $1, $2, $3); } |
|
1
|
763 | simple_expr EXPR_LT simple_expr |
|
578
|
764 { $$ = make_binary_op (EXPR_LT, $1, $2, $3); } |
|
1
|
765 | simple_expr EXPR_LE simple_expr |
|
578
|
766 { $$ = make_binary_op (EXPR_LE, $1, $2, $3); } |
|
1
|
767 | simple_expr EXPR_EQ simple_expr |
|
578
|
768 { $$ = make_binary_op (EXPR_EQ, $1, $2, $3); } |
|
1
|
769 | simple_expr EXPR_GE simple_expr |
|
578
|
770 { $$ = make_binary_op (EXPR_GE, $1, $2, $3); } |
|
1
|
771 | simple_expr EXPR_GT simple_expr |
|
578
|
772 { $$ = make_binary_op (EXPR_GT, $1, $2, $3); } |
|
1
|
773 | simple_expr EXPR_NE simple_expr |
|
578
|
774 { $$ = make_binary_op (EXPR_NE, $1, $2, $3); } |
|
428
|
775 | simple_expr EXPR_AND_AND simple_expr |
|
578
|
776 { $$ = make_binary_op (EXPR_AND_AND, $1, $2, $3); } |
|
428
|
777 | simple_expr EXPR_OR_OR simple_expr |
|
578
|
778 { $$ = make_binary_op (EXPR_OR_OR, $1, $2, $3); } |
|
1
|
779 | simple_expr EXPR_AND simple_expr |
|
578
|
780 { $$ = make_binary_op (EXPR_AND, $1, $2, $3); } |
|
1
|
781 | simple_expr EXPR_OR simple_expr |
|
578
|
782 { $$ = make_binary_op (EXPR_OR, $1, $2, $3); } |
|
1
|
783 ; |
|
|
784 |
|
|
785 simple_expr1 : NUM |
|
581
|
786 { |
|
|
787 tree_constant *tmp = new tree_constant ($1->number ()); |
|
|
788 tmp->stash_original_text ($1->text_rep ()); |
|
|
789 $$ = tmp; |
|
|
790 } |
|
1
|
791 | IMAG_NUM |
|
581
|
792 { |
|
|
793 Complex c (0.0, $1->number ()); |
|
|
794 tree_constant *tmp = new tree_constant (c); |
|
|
795 tmp->stash_original_text ($1->text_rep ()); |
|
|
796 $$ = tmp; |
|
|
797 } |
|
1
|
798 | TEXT |
|
143
|
799 { $$ = new tree_constant ($1->string ()); } |
|
1
|
800 | '(' expression ')' |
|
|
801 { |
|
581
|
802 $2->in_parens++; |
|
1
|
803 $$ = $2; |
|
|
804 } |
|
496
|
805 | word_list_cmd |
|
|
806 { $$ = $1; } |
|
1
|
807 | variable |
|
|
808 { $$ = $1; } |
|
|
809 | matrix |
|
|
810 { $$ = $1; } |
|
240
|
811 | '[' ']' |
|
|
812 { |
|
|
813 mlnm.pop (); |
|
|
814 $$ = new tree_constant (Matrix ()); |
|
|
815 } |
|
|
816 | '[' ';' ']' |
|
|
817 { |
|
|
818 mlnm.pop (); |
|
|
819 $$ = new tree_constant (Matrix ()); |
|
|
820 } |
|
1
|
821 | colon_expr |
|
|
822 { $$ = $1; } |
|
|
823 | PLUS_PLUS identifier %prec UNARY |
|
578
|
824 { $$ = make_prefix_op (PLUS_PLUS, $2, $1); } |
|
1
|
825 | MINUS_MINUS identifier %prec UNARY |
|
578
|
826 { $$ = make_prefix_op (MINUS_MINUS, $2, $1); } |
|
1
|
827 | EXPR_NOT simple_expr |
|
578
|
828 { $$ = make_unary_op (EXPR_NOT, $2, $1); } |
|
1
|
829 | '+' simple_expr %prec UNARY |
|
|
830 { $$ = $2; } |
|
|
831 | '-' simple_expr %prec UNARY |
|
578
|
832 { $$ = make_unary_op ('-', $2, $1); } |
|
1
|
833 ; |
|
|
834 |
|
|
835 colon_expr : simple_expr ':' simple_expr |
|
143
|
836 { $$ = new tree_colon_expression |
|
|
837 ($1, $3, $2->line (), $2->column ()); } |
|
1
|
838 | colon_expr ':' simple_expr |
|
|
839 { |
|
|
840 $$ = $1->chain ($3); |
|
522
|
841 if (! $$) |
|
1005
|
842 ABORT_PARSE; |
|
1
|
843 } |
|
|
844 ; |
|
|
845 |
|
|
846 word_list_cmd : identifier word_list |
|
482
|
847 { |
|
|
848 $$ = new tree_index_expression |
|
|
849 ($1, $2, $1->line (), $1->column ()); |
|
|
850 } |
|
1
|
851 ; |
|
|
852 |
|
578
|
853 word_list : TEXT |
|
482
|
854 { |
|
|
855 tree_constant *tmp = new tree_constant ($1->string ()); |
|
|
856 $$ = new tree_argument_list (tmp); |
|
|
857 } |
|
578
|
858 | word_list TEXT |
|
482
|
859 { |
|
|
860 tree_constant *tmp = new tree_constant ($2->string ()); |
|
578
|
861 $1->append (tmp); |
|
482
|
862 } |
|
1
|
863 ; |
|
|
864 |
|
|
865 // This is truly disgusting. |
|
|
866 |
|
|
867 g_symtab : // empty |
|
|
868 { curr_sym_tab = global_sym_tab; } |
|
|
869 ; |
|
|
870 |
|
|
871 local_symtab : // empty |
|
|
872 { curr_sym_tab = tmp_local_sym_tab; } |
|
|
873 ; |
|
|
874 |
|
|
875 safe : // empty |
|
|
876 { maybe_screwed = 0; } |
|
|
877 ; |
|
|
878 |
|
|
879 are_we_screwed : // empty |
|
|
880 { maybe_screwed = 1; } |
|
|
881 ; |
|
|
882 |
|
|
883 func_def : FCN g_symtab are_we_screwed func_def1 |
|
|
884 { |
|
|
885 curr_sym_tab = top_level_sym_tab; |
|
|
886 defining_func = 0; |
|
522
|
887 $$ = 0; |
|
1
|
888 } |
|
|
889 | FCN g_symtab are_we_screwed func_def2 |
|
|
890 { |
|
|
891 curr_sym_tab = top_level_sym_tab; |
|
|
892 defining_func = 0; |
|
522
|
893 $$ = 0; |
|
1
|
894 } |
|
|
895 ; |
|
|
896 |
|
|
897 func_def1 : SCREW safe g_symtab '=' func_def2 |
|
|
898 { |
|
143
|
899 tree_identifier *tmp = new tree_identifier |
|
|
900 ($1->sym_rec (), $1->line (), $1->column ()); |
|
1
|
901 tree_parameter_list *tpl = new tree_parameter_list (tmp); |
|
|
902 tpl->mark_as_formal_parameters (); |
|
|
903 $$ = $5->define_ret_list (tpl); |
|
|
904 } |
|
723
|
905 | return_list g_symtab '=' func_def2 |
|
1
|
906 { |
|
578
|
907 $1->mark_as_formal_parameters (); |
|
723
|
908 $$ = $4->define_ret_list ($1); |
|
1
|
909 } |
|
|
910 ; |
|
|
911 |
|
723
|
912 return_list_x : '[' safe local_symtab |
|
|
913 ; |
|
|
914 |
|
|
915 return_list : return_list_x ']' |
|
|
916 { $$ = new tree_parameter_list (); } |
|
|
917 | return_list_x ELLIPSIS ']' |
|
|
918 { |
|
|
919 tree_parameter_list *tmp = new tree_parameter_list (); |
|
|
920 tmp->mark_varargs_only (); |
|
|
921 $$ = tmp; |
|
|
922 } |
|
|
923 | return_list1 ']' |
|
|
924 { $$ = $1; } |
|
|
925 | return_list1 ',' ELLIPSIS ']' |
|
|
926 { |
|
|
927 $1->mark_varargs (); |
|
|
928 $$ = $1; |
|
|
929 } |
|
|
930 ; |
|
|
931 |
|
|
932 return_list1 : return_list_x identifier |
|
|
933 { $$ = new tree_parameter_list ($2); } |
|
|
934 | return_list_x error |
|
|
935 { |
|
1005
|
936 yyerror ("invalid function return list"); |
|
723
|
937 ABORT_PARSE; |
|
|
938 } |
|
|
939 | return_list1 ',' identifier |
|
578
|
940 { $1->append ($3); } |
|
1
|
941 ; |
|
|
942 |
|
|
943 func_def2 : identifier safe local_symtab func_def3 |
|
|
944 { |
|
|
945 char *id_name = $1->name (); |
|
|
946 // if (is_text_function_name (id_name)) |
|
|
947 // { |
|
1005
|
948 // yyerror ("invalid use of reserved word %s", id_name); |
|
1
|
949 // ABORT_PARSE; |
|
|
950 // } |
|
|
951 |
|
|
952 // If input is coming from a file, issue a warning if the name of the |
|
|
953 // file does not match the name of the function stated in the file. |
|
|
954 // Matlab doesn't provide a diagnostic (it ignores the stated name). |
|
|
955 |
|
908
|
956 $4->stash_function_name (id_name); |
|
|
957 |
|
338
|
958 if (reading_fcn_file) |
|
1
|
959 { |
|
338
|
960 if (strcmp (curr_fcn_file_name, id_name) != 0) |
|
195
|
961 { |
|
|
962 warning ("function name `%s' does not agree\ |
|
341
|
963 with function file name `%s.m'", id_name, curr_fcn_file_name); |
|
1
|
964 |
|
572
|
965 global_sym_tab->rename (id_name, |
|
|
966 curr_fcn_file_name); |
|
|
967 |
|
773
|
968 if (error_state) |
|
|
969 ABORT_PARSE; |
|
|
970 |
|
197
|
971 id_name = $1->name (); |
|
195
|
972 } |
|
|
973 |
|
908
|
974 $4->stash_function_name (id_name); |
|
905
|
975 $4->stash_fcn_file_name (); |
|
522
|
976 $4->stash_fcn_file_time (time (0)); |
|
338
|
977 $4->mark_as_system_fcn_file (); |
|
1
|
978 } |
|
315
|
979 else if (! (input_from_tmp_history_file |
|
|
980 || input_from_startup_file) |
|
195
|
981 && reading_script_file |
|
338
|
982 && strcmp (curr_fcn_file_name, id_name) == 0) |
|
1
|
983 { |
|
195
|
984 warning ("function `%s' defined within\ |
|
341
|
985 script file `%s.m'", id_name, curr_fcn_file_name); |
|
1
|
986 } |
|
|
987 |
|
197
|
988 top_level_sym_tab->clear (id_name); |
|
|
989 |
|
195
|
990 $1->define ($4); |
|
|
991 $1->document (help_buf); |
|
|
992 |
|
1
|
993 $$ = $4; |
|
|
994 } |
|
|
995 ; |
|
|
996 |
|
|
997 func_def3 : param_list optsep opt_list fcn_end_or_eof |
|
|
998 { |
|
|
999 tree_function *fcn = new tree_function ($3, curr_sym_tab); |
|
|
1000 $$ = fcn->define_param_list ($1); |
|
|
1001 } |
|
|
1002 | optsep opt_list fcn_end_or_eof |
|
|
1003 { $$ = new tree_function ($2, curr_sym_tab); } |
|
|
1004 ; |
|
|
1005 |
|
|
1006 fcn_end_or_eof : END |
|
|
1007 { |
|
143
|
1008 if (check_end ($1, token::function_end)) |
|
1
|
1009 ABORT_PARSE; |
|
|
1010 |
|
338
|
1011 if (reading_fcn_file) |
|
1
|
1012 check_for_garbage_after_fcn_def (); |
|
|
1013 } |
|
|
1014 | END_OF_INPUT |
|
|
1015 { |
|
338
|
1016 if (! (reading_fcn_file || reading_script_file)) |
|
1
|
1017 YYABORT; |
|
|
1018 } |
|
|
1019 ; |
|
|
1020 |
|
751
|
1021 indirect_ref : indirect_ref1 |
|
191
|
1022 { |
|
751
|
1023 looking_at_indirect_ref = 0; |
|
|
1024 $$ = $1; |
|
191
|
1025 } |
|
751
|
1026 |
|
|
1027 indirect_ref1 : identifier |
|
191
|
1028 { |
|
751
|
1029 $$ = new tree_indirect_ref ($1, $1->line (), |
|
|
1030 $1->column ()); |
|
191
|
1031 } |
|
751
|
1032 | indirect_ref1 '.' { looking_at_indirect_ref = 1; } TEXT_ID |
|
|
1033 { $$ = $1->chain ($4->string ()); } |
|
|
1034 ; |
|
|
1035 |
|
|
1036 variable : indirect_ref |
|
|
1037 { $$ = make_index_expression ($1, 0); } |
|
|
1038 | indirect_ref '(' ')' |
|
|
1039 { $$ = make_index_expression ($1, 0); } |
|
|
1040 | indirect_ref '(' arg_list ')' |
|
|
1041 { $$ = make_index_expression ($1, $3); } |
|
|
1042 | indirect_ref '[' |
|
1
|
1043 { |
|
1005
|
1044 yyerror ("use `(\' and `)\' as index operators, not\ |
|
1
|
1045 `[\' and `]\'"); |
|
522
|
1046 $$ = 0; |
|
1
|
1047 ABORT_PARSE; |
|
|
1048 } |
|
|
1049 ; |
|
|
1050 |
|
240
|
1051 param_list : '(' ')' |
|
1
|
1052 { |
|
240
|
1053 quote_is_transpose = 0; |
|
522
|
1054 $$ = 0; |
|
240
|
1055 } |
|
504
|
1056 | '(' ELLIPSIS ')' |
|
|
1057 { |
|
|
1058 quote_is_transpose = 0; |
|
|
1059 tree_parameter_list *tmp = new tree_parameter_list (); |
|
|
1060 tmp->mark_varargs_only (); |
|
|
1061 $$ = tmp; |
|
|
1062 } |
|
240
|
1063 | param_list1 ')' |
|
|
1064 { |
|
|
1065 quote_is_transpose = 0; |
|
578
|
1066 $1->mark_as_formal_parameters (); |
|
1
|
1067 } |
|
206
|
1068 | param_list1 ',' ELLIPSIS ')' |
|
|
1069 { |
|
240
|
1070 quote_is_transpose = 0; |
|
578
|
1071 $1->mark_as_formal_parameters (); |
|
|
1072 $1->mark_varargs (); |
|
206
|
1073 } |
|
504
|
1074 ; |
|
1
|
1075 |
|
|
1076 param_list1 : '(' identifier |
|
|
1077 { $$ = new tree_parameter_list ($2); } |
|
|
1078 | param_list1 ',' identifier |
|
578
|
1079 { $1->append ($3); } |
|
1
|
1080 | '(' error |
|
|
1081 { |
|
1005
|
1082 yyerror ("invalid parameter list"); |
|
206
|
1083 ABORT_PARSE; |
|
1
|
1084 } |
|
|
1085 | param_list1 ',' error |
|
|
1086 { |
|
1005
|
1087 yyerror ("invalid parameter list"); |
|
206
|
1088 ABORT_PARSE; |
|
1
|
1089 } |
|
|
1090 ; |
|
|
1091 |
|
|
1092 identifier : NAME |
|
504
|
1093 { |
|
|
1094 $$ = new tree_identifier |
|
|
1095 ($1->sym_rec (), $1->line (), $1->column ()); |
|
|
1096 } |
|
|
1097 ; |
|
1
|
1098 |
|
578
|
1099 arg_list : ':' |
|
1
|
1100 { |
|
|
1101 tree_constant *colon; |
|
620
|
1102 tree_constant::magic_colon t; |
|
|
1103 colon = new tree_constant (t); |
|
1
|
1104 $$ = new tree_argument_list (colon); |
|
|
1105 } |
|
922
|
1106 | expression |
|
|
1107 { $$ = new tree_argument_list ($1); } |
|
|
1108 | ALL_VA_ARGS |
|
|
1109 { |
|
|
1110 tree_constant *all_va_args; |
|
|
1111 tree_constant::all_va_args t; |
|
|
1112 all_va_args = new tree_constant (t); |
|
|
1113 $$ = new tree_argument_list (all_va_args); |
|
|
1114 } |
|
578
|
1115 | arg_list ',' ':' |
|
1
|
1116 { |
|
|
1117 tree_constant *colon; |
|
620
|
1118 tree_constant::magic_colon t; |
|
|
1119 colon = new tree_constant (t); |
|
578
|
1120 $1->append (colon); |
|
1
|
1121 } |
|
578
|
1122 | arg_list ',' expression |
|
|
1123 { $1->append ($3); } |
|
922
|
1124 | arg_list ',' ALL_VA_ARGS |
|
|
1125 { |
|
|
1126 tree_constant *all_va_args; |
|
|
1127 tree_constant::all_va_args t; |
|
|
1128 all_va_args = new tree_constant (t); |
|
|
1129 $1->append (all_va_args); |
|
|
1130 } |
|
1
|
1131 ; |
|
|
1132 |
|
240
|
1133 matrix : '[' screwed_again rows ']' |
|
1
|
1134 { |
|
|
1135 mlnm.pop (); |
|
|
1136 maybe_screwed_again--; |
|
|
1137 tree_matrix *tmp = ml.pop (); |
|
|
1138 $$ = tmp->reverse (); |
|
|
1139 } |
|
|
1140 ; |
|
|
1141 |
|
|
1142 rows : matrix_row |
|
|
1143 | rows ';' // Ignore trailing semicolon. |
|
|
1144 | rows ';' matrix_row |
|
|
1145 ; |
|
|
1146 |
|
|
1147 matrix_row : expression // First element on row. |
|
|
1148 { |
|
|
1149 if (mlnm.top ()) |
|
|
1150 { |
|
|
1151 mlnm.pop (); |
|
|
1152 mlnm.push (0); |
|
578
|
1153 tree_matrix *tmp = new tree_matrix |
|
|
1154 ($1, tree_matrix::md_none); |
|
1
|
1155 ml.push (tmp); |
|
|
1156 } |
|
|
1157 else |
|
|
1158 { |
|
|
1159 tree_matrix *tmp = ml.pop (); |
|
578
|
1160 tmp = tmp->chain ($1, tree_matrix::md_down); |
|
1
|
1161 ml.push (tmp); |
|
|
1162 } |
|
|
1163 } |
|
|
1164 | matrix_row ',' // Ignore trailing comma. |
|
|
1165 | matrix_row ',' expression |
|
|
1166 { |
|
|
1167 tree_matrix *tmp = ml.pop (); |
|
578
|
1168 tmp = tmp->chain ($3, tree_matrix::md_right); |
|
1
|
1169 ml.push (tmp); |
|
|
1170 } |
|
|
1171 ; |
|
|
1172 |
|
|
1173 %% |
|
|
1174 |
|
666
|
1175 // Generic error messages. |
|
|
1176 |
|
1
|
1177 static void |
|
|
1178 yyerror (char *s) |
|
|
1179 { |
|
|
1180 char *line = current_input_line; |
|
143
|
1181 int err_col = current_input_column - 1; |
|
522
|
1182 if (err_col == 0 && line) |
|
335
|
1183 err_col = strlen (line) + 1; |
|
1
|
1184 |
|
581
|
1185 ostrstream output_buf; |
|
1
|
1186 |
|
1005
|
1187 if (reading_fcn_file || reading_script_file) |
|
|
1188 output_buf << "parse error near line " << input_line_number |
|
|
1189 << " of file " << curr_fcn_file_name << ".m:"; |
|
|
1190 else |
|
|
1191 output_buf << "parse error:"; |
|
581
|
1192 |
|
1005
|
1193 if (s && strcmp (s, "parse error") != 0) |
|
|
1194 output_buf << "\n\n " << s; |
|
|
1195 |
|
|
1196 output_buf << "\n\n"; |
|
1
|
1197 |
|
522
|
1198 if (line) |
|
1
|
1199 { |
|
335
|
1200 int len = strlen (line); |
|
|
1201 if (line[len-1] == '\n') |
|
|
1202 { |
|
|
1203 len--; |
|
|
1204 line[len] = '\0'; |
|
|
1205 } |
|
1005
|
1206 |
|
335
|
1207 // Print the line, maybe with a pointer near the error token. |
|
1005
|
1208 |
|
|
1209 output_buf << " " << line << "\n"; |
|
|
1210 if (err_col <= len) |
|
|
1211 { |
|
|
1212 for (int i = 0; i < err_col + 1; i++) |
|
|
1213 output_buf << " "; |
|
|
1214 output_buf << "^"; |
|
|
1215 } |
|
1
|
1216 } |
|
1005
|
1217 |
|
|
1218 output_buf << "\n" << ends; |
|
581
|
1219 |
|
1005
|
1220 char *msg = output_buf.str (); |
|
|
1221 |
|
|
1222 parse_error (msg); |
|
|
1223 |
|
|
1224 delete [] msg; |
|
1
|
1225 } |
|
|
1226 |
|
666
|
1227 // Error mesages for mismatched end tokens. |
|
|
1228 |
|
496
|
1229 static void |
|
|
1230 end_error (char *type, token::end_tok_type ettype, int l, int c) |
|
|
1231 { |
|
769
|
1232 static char *fmt = "`%s' command matched by `%s' near line %d column %d"; |
|
496
|
1233 |
|
|
1234 switch (ettype) |
|
|
1235 { |
|
|
1236 case token::simple_end: |
|
|
1237 error (fmt, type, "end", l, c); |
|
|
1238 break; |
|
777
|
1239 |
|
496
|
1240 case token::for_end: |
|
|
1241 error (fmt, type, "endfor", l, c); |
|
|
1242 break; |
|
777
|
1243 |
|
496
|
1244 case token::function_end: |
|
|
1245 error (fmt, type, "endfunction", l, c); |
|
|
1246 break; |
|
777
|
1247 |
|
496
|
1248 case token::if_end: |
|
|
1249 error (fmt, type, "endif", l, c); |
|
|
1250 break; |
|
777
|
1251 |
|
496
|
1252 case token::while_end: |
|
|
1253 error (fmt, type, "endwhile", l, c); |
|
|
1254 break; |
|
777
|
1255 |
|
496
|
1256 default: |
|
|
1257 panic_impossible (); |
|
|
1258 break; |
|
|
1259 } |
|
|
1260 } |
|
|
1261 |
|
666
|
1262 // Check to see that end tokens are properly matched. |
|
|
1263 |
|
143
|
1264 static int |
|
|
1265 check_end (token *tok, token::end_tok_type expected) |
|
|
1266 { |
|
|
1267 token::end_tok_type ettype = tok->ettype (); |
|
|
1268 if (ettype != expected && ettype != token::simple_end) |
|
|
1269 { |
|
|
1270 yyerror ("parse error"); |
|
|
1271 |
|
|
1272 int l = tok->line (); |
|
|
1273 int c = tok->column (); |
|
|
1274 |
|
|
1275 switch (expected) |
|
|
1276 { |
|
|
1277 case token::for_end: |
|
|
1278 end_error ("for", ettype, l, c); |
|
|
1279 break; |
|
777
|
1280 |
|
143
|
1281 case token::function_end: |
|
|
1282 end_error ("function", ettype, l, c); |
|
|
1283 break; |
|
777
|
1284 |
|
143
|
1285 case token::if_end: |
|
|
1286 end_error ("if", ettype, l, c); |
|
|
1287 break; |
|
777
|
1288 |
|
143
|
1289 case token::while_end: |
|
|
1290 end_error ("while", ettype, l, c); |
|
|
1291 break; |
|
777
|
1292 |
|
143
|
1293 default: |
|
|
1294 panic_impossible (); |
|
|
1295 break; |
|
|
1296 } |
|
|
1297 return 1; |
|
|
1298 } |
|
|
1299 else |
|
|
1300 return 0; |
|
|
1301 } |
|
|
1302 |
|
666
|
1303 // Try to figure out early if an expression should become an |
|
|
1304 // assignment to the builtin variable ans. |
|
|
1305 // |
|
|
1306 // Need to make sure that the expression isn't already an identifier |
|
|
1307 // that has a name, or an assignment expression. |
|
|
1308 // |
|
|
1309 // Note that an expression can't be just an identifier anymore -- it |
|
|
1310 // must at least be an index expression (see the definition of the |
|
|
1311 // non-terminal `variable' above). |
|
|
1312 // |
|
|
1313 // XXX FIXME XXX. This isn't quite sufficient. For example, try the |
|
|
1314 // command `x = 4, x' for `x' previously undefined. |
|
|
1315 // |
|
|
1316 // XXX FIXME XXX -- we should probably delay doing this until eval-time. |
|
|
1317 |
|
496
|
1318 static tree_expression * |
|
|
1319 maybe_convert_to_ans_assign (tree_expression *expr) |
|
1
|
1320 { |
|
|
1321 if (expr->is_index_expression ()) |
|
|
1322 { |
|
195
|
1323 expr->mark_for_possible_ans_assign (); |
|
|
1324 return expr; |
|
|
1325 } |
|
|
1326 else if (expr->is_assignment_expression () |
|
|
1327 || expr->is_prefix_expression ()) |
|
|
1328 { |
|
|
1329 return expr; |
|
|
1330 } |
|
|
1331 else |
|
|
1332 { |
|
|
1333 symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); |
|
1
|
1334 |
|
522
|
1335 assert (sr); |
|
195
|
1336 |
|
|
1337 tree_identifier *ans = new tree_identifier (sr); |
|
|
1338 |
|
581
|
1339 return new tree_simple_assignment_expression (ans, expr, 0, 1); |
|
1
|
1340 } |
|
|
1341 } |
|
|
1342 |
|
666
|
1343 // Maybe print a warning if an assignment expression is used as the |
|
|
1344 // test in a logical expression. |
|
|
1345 |
|
496
|
1346 static void |
|
|
1347 maybe_warn_assign_as_truth_value (tree_expression *expr) |
|
1
|
1348 { |
|
|
1349 if (user_pref.warn_assign_as_truth_value |
|
|
1350 && expr->is_assignment_expression () |
|
581
|
1351 && expr->in_parens < 2) |
|
1
|
1352 { |
|
|
1353 warning ("suggest parenthesis around assignment used as truth value"); |
|
|
1354 } |
|
|
1355 } |
|
578
|
1356 |
|
666
|
1357 // Build a binary expression. |
|
|
1358 |
|
578
|
1359 static tree_expression * |
|
|
1360 make_binary_op (int op, tree_expression *op1, token *tok_val, |
|
|
1361 tree_expression *op2) |
|
|
1362 { |
|
|
1363 tree_expression::type t; |
|
|
1364 switch (op) |
|
|
1365 { |
|
|
1366 case POW: |
|
|
1367 t = tree_expression::power; |
|
|
1368 break; |
|
777
|
1369 |
|
578
|
1370 case EPOW: |
|
|
1371 t = tree_expression::elem_pow; |
|
|
1372 break; |
|
777
|
1373 |
|
578
|
1374 case '+': |
|
|
1375 t = tree_expression::add; |
|
|
1376 break; |
|
777
|
1377 |
|
578
|
1378 case '-': |
|
|
1379 t = tree_expression::subtract; |
|
|
1380 break; |
|
777
|
1381 |
|
578
|
1382 case '*': |
|
|
1383 t = tree_expression::multiply; |
|
|
1384 break; |
|
777
|
1385 |
|
578
|
1386 case '/': |
|
|
1387 t = tree_expression::divide; |
|
|
1388 break; |
|
777
|
1389 |
|
578
|
1390 case EMUL: |
|
|
1391 t = tree_expression::el_mul; |
|
|
1392 break; |
|
777
|
1393 |
|
578
|
1394 case EDIV: |
|
|
1395 t = tree_expression::el_div; |
|
|
1396 break; |
|
777
|
1397 |
|
578
|
1398 case LEFTDIV: |
|
|
1399 t = tree_expression::leftdiv; |
|
|
1400 break; |
|
777
|
1401 |
|
578
|
1402 case ELEFTDIV: |
|
|
1403 t = tree_expression::el_leftdiv; |
|
|
1404 break; |
|
777
|
1405 |
|
578
|
1406 case EXPR_LT: |
|
|
1407 t = tree_expression::cmp_lt; |
|
|
1408 break; |
|
777
|
1409 |
|
578
|
1410 case EXPR_LE: |
|
|
1411 t = tree_expression::cmp_le; |
|
|
1412 break; |
|
777
|
1413 |
|
578
|
1414 case EXPR_EQ: |
|
|
1415 t = tree_expression::cmp_eq; |
|
|
1416 break; |
|
777
|
1417 |
|
578
|
1418 case EXPR_GE: |
|
|
1419 t = tree_expression::cmp_ge; |
|
|
1420 break; |
|
777
|
1421 |
|
578
|
1422 case EXPR_GT: |
|
|
1423 t = tree_expression::cmp_gt; |
|
|
1424 break; |
|
777
|
1425 |
|
578
|
1426 case EXPR_NE: |
|
|
1427 t = tree_expression::cmp_ne; |
|
|
1428 break; |
|
777
|
1429 |
|
578
|
1430 case EXPR_AND_AND: |
|
|
1431 t = tree_expression::and_and; |
|
|
1432 break; |
|
777
|
1433 |
|
578
|
1434 case EXPR_OR_OR: |
|
|
1435 t = tree_expression::or_or; |
|
|
1436 break; |
|
777
|
1437 |
|
578
|
1438 case EXPR_AND: |
|
|
1439 t = tree_expression::and; |
|
|
1440 break; |
|
777
|
1441 |
|
578
|
1442 case EXPR_OR: |
|
|
1443 t = tree_expression::or; |
|
|
1444 break; |
|
777
|
1445 |
|
578
|
1446 default: |
|
|
1447 panic_impossible (); |
|
|
1448 break; |
|
|
1449 } |
|
|
1450 |
|
|
1451 int l = tok_val->line (); |
|
|
1452 int c = tok_val->column (); |
|
|
1453 |
|
|
1454 return new tree_binary_expression (op1, op2, t, l, c); |
|
|
1455 } |
|
|
1456 |
|
666
|
1457 // Build a prefix expression. |
|
|
1458 |
|
578
|
1459 static tree_expression * |
|
|
1460 make_prefix_op (int op, tree_identifier *op1, token *tok_val) |
|
|
1461 { |
|
|
1462 tree_expression::type t; |
|
|
1463 switch (op) |
|
|
1464 { |
|
|
1465 case PLUS_PLUS: |
|
|
1466 t = tree_expression::increment; |
|
|
1467 break; |
|
777
|
1468 |
|
578
|
1469 case MINUS_MINUS: |
|
|
1470 t = tree_expression::decrement; |
|
|
1471 break; |
|
777
|
1472 |
|
578
|
1473 default: |
|
|
1474 panic_impossible (); |
|
|
1475 break; |
|
|
1476 } |
|
|
1477 |
|
|
1478 int l = tok_val->line (); |
|
|
1479 int c = tok_val->column (); |
|
|
1480 |
|
|
1481 return new tree_prefix_expression (op1, t, l, c); |
|
|
1482 } |
|
|
1483 |
|
666
|
1484 // Build a postfix expression. |
|
|
1485 |
|
578
|
1486 static tree_expression * |
|
|
1487 make_postfix_op (int op, tree_identifier *op1, token *tok_val) |
|
|
1488 { |
|
|
1489 tree_expression::type t; |
|
|
1490 switch (op) |
|
|
1491 { |
|
|
1492 case PLUS_PLUS: |
|
|
1493 t = tree_expression::increment; |
|
|
1494 break; |
|
777
|
1495 |
|
578
|
1496 case MINUS_MINUS: |
|
|
1497 t = tree_expression::decrement; |
|
|
1498 break; |
|
777
|
1499 |
|
578
|
1500 default: |
|
|
1501 panic_impossible (); |
|
|
1502 break; |
|
|
1503 } |
|
|
1504 |
|
|
1505 int l = tok_val->line (); |
|
|
1506 int c = tok_val->column (); |
|
|
1507 |
|
|
1508 return new tree_postfix_expression (op1, t, l, c); |
|
|
1509 } |
|
|
1510 |
|
666
|
1511 // Build a unary expression. |
|
|
1512 |
|
578
|
1513 static tree_expression * |
|
|
1514 make_unary_op (int op, tree_expression *op1, token *tok_val) |
|
|
1515 { |
|
|
1516 tree_expression::type t; |
|
|
1517 switch (op) |
|
|
1518 { |
|
|
1519 case QUOTE: |
|
|
1520 t = tree_expression::hermitian; |
|
|
1521 break; |
|
777
|
1522 |
|
578
|
1523 case TRANSPOSE: |
|
|
1524 t = tree_expression::transpose; |
|
|
1525 break; |
|
777
|
1526 |
|
578
|
1527 case EXPR_NOT: |
|
|
1528 t = tree_expression::not; |
|
|
1529 break; |
|
777
|
1530 |
|
578
|
1531 case '-': |
|
|
1532 t = tree_expression::uminus; |
|
|
1533 break; |
|
777
|
1534 |
|
578
|
1535 default: |
|
|
1536 panic_impossible (); |
|
|
1537 break; |
|
|
1538 } |
|
|
1539 |
|
|
1540 int l = tok_val->line (); |
|
|
1541 int c = tok_val->column (); |
|
|
1542 |
|
|
1543 return new tree_unary_expression (op1, t, l, c); |
|
|
1544 } |
|
666
|
1545 |
|
|
1546 // Make an expression that handles assignment of multiple values. |
|
|
1547 |
|
|
1548 static tree_expression * |
|
|
1549 make_multi_val_ret (tree_expression *rhs, int l, int c) |
|
|
1550 { |
|
|
1551 // Convert the matrix list to a list of identifiers. If that fails, |
|
|
1552 // we can abort here, without losing anything -- no other possible |
|
|
1553 // syntax is valid if we've seen the equals sign as the next token |
|
|
1554 // after the `]'. |
|
|
1555 |
|
|
1556 tree_expression *retval = 0; |
|
|
1557 |
|
|
1558 maybe_screwed_again--; |
|
|
1559 |
|
|
1560 tree_matrix *tmp = ml.pop (); |
|
|
1561 |
|
|
1562 tmp = tmp->reverse (); |
|
|
1563 |
|
|
1564 tree_return_list *id_list = tmp->to_return_list (); |
|
|
1565 |
|
|
1566 if (id_list) |
|
|
1567 { |
|
|
1568 int list_len = id_list->length (); |
|
|
1569 |
|
|
1570 if (list_len == 1) |
|
|
1571 { |
|
|
1572 tree_index_expression *lhs = id_list->remove_front (); |
|
947
|
1573 retval = new tree_simple_assignment_expression (lhs, rhs, |
|
|
1574 0, 0, l, c); |
|
666
|
1575 |
|
|
1576 } |
|
|
1577 else if (list_len > 1) |
|
|
1578 { |
|
|
1579 if (rhs->is_multi_val_ret_expression ()) |
|
|
1580 { |
|
|
1581 tree_multi_val_ret *t = (tree_multi_val_ret *) rhs; |
|
|
1582 retval = new tree_multi_assignment_expression (id_list, t, l, c); |
|
|
1583 } |
|
|
1584 else |
|
1005
|
1585 yyerror ("RHS must be an expression that returns multiple values"); |
|
666
|
1586 } |
|
|
1587 else |
|
|
1588 panic_impossible (); |
|
|
1589 } |
|
|
1590 else |
|
1005
|
1591 yyerror ("invalid identifier list for assignment"); |
|
666
|
1592 |
|
|
1593 return retval; |
|
|
1594 } |
|
751
|
1595 |
|
|
1596 static tree_index_expression * |
|
|
1597 make_index_expression (tree_indirect_ref *indir, tree_argument_list *args) |
|
|
1598 { |
|
|
1599 tree_index_expression *retval = 0; |
|
|
1600 |
|
|
1601 int l = indir->line (); |
|
|
1602 int c = indir->column (); |
|
|
1603 |
|
|
1604 if (indir->is_identifier_only ()) |
|
|
1605 { |
|
|
1606 indir->preserve_identifier (); |
|
|
1607 retval = new tree_index_expression (indir->ident (), args, l, c); |
|
|
1608 delete indir; |
|
|
1609 } |
|
|
1610 else |
|
|
1611 retval = new tree_index_expression (indir, args, l, c); |
|
|
1612 |
|
|
1613 return retval; |
|
|
1614 } |
