|
1829
|
1 /* |
|
1
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 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 |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
1
|
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 |
|
1229
|
31 #include <config.h> |
|
240
|
32 #endif |
|
|
33 |
|
2427
|
34 #ifdef YYBYACC |
|
|
35 #include <cstdlib> |
|
|
36 #endif |
|
|
37 |
|
581
|
38 #include <strstream.h> |
|
|
39 |
|
1
|
40 #include "Matrix.h" |
|
|
41 |
|
2166
|
42 #include "defun.h" |
|
1351
|
43 #include "error.h" |
|
|
44 #include "input.h" |
|
|
45 #include "lex.h" |
|
1743
|
46 #include "oct-hist.h" |
|
1670
|
47 #include "toplev.h" |
|
1351
|
48 #include "pager.h" |
|
|
49 #include "parse.h" |
|
1740
|
50 #include "pt-cmd.h" |
|
|
51 #include "pt-const.h" |
|
|
52 #include "pt-fcn.h" |
|
|
53 #include "pt-fvc.h" |
|
|
54 #include "pt-mat.h" |
|
|
55 #include "pt-mvr.h" |
|
|
56 #include "pt-exp.h" |
|
|
57 #include "pt-misc.h" |
|
|
58 #include "pt-plot.h" |
|
2533
|
59 #include "pt-pr-code.h" |
|
1351
|
60 #include "symtab.h" |
|
|
61 #include "token.h" |
|
1
|
62 #include "utils.h" |
|
1351
|
63 #include "variables.h" |
|
1
|
64 |
|
2166
|
65 // If TRUE, generate a warning for the assignment in things like |
|
|
66 // |
|
|
67 // octave> if (a = 2 < n) |
|
|
68 // |
|
|
69 // but not |
|
|
70 // |
|
|
71 // octave> if ((a = 2) < n) |
|
|
72 // |
|
|
73 static bool Vwarn_assign_as_truth_value; |
|
|
74 |
|
2764
|
75 // If TRUE, generate a warning for variable swich labels. |
|
|
76 static bool Vwarn_variable_switch_label; |
|
|
77 |
|
2166
|
78 // If TRUE, generate warning if declared function name disagrees with |
|
|
79 // the name of the file in which it is defined. |
|
|
80 static bool Vwarn_function_name_clash; |
|
|
81 |
|
|
82 // If TRUE, generate warning if a statement in a function is not |
|
|
83 // terminated with a semicolon. Useful for checking functions that |
|
|
84 // should only produce output using explicit printing statements. |
|
|
85 static bool Vwarn_missing_semicolon; |
|
|
86 |
|
1
|
87 // Temporary symbol table pointer used to cope with bogus function syntax. |
|
522
|
88 symbol_table *tmp_local_sym_tab = 0; |
|
1
|
89 |
|
|
90 // The current input line number. |
|
|
91 int input_line_number = 0; |
|
|
92 |
|
|
93 // The column of the current token. |
|
143
|
94 int current_input_column = 1; |
|
1
|
95 |
|
338
|
96 // Buffer for help text snagged from function files. |
|
1755
|
97 string help_buf; |
|
1
|
98 |
|
496
|
99 // Forward declarations for some functions defined at the bottom of |
|
|
100 // the file. |
|
|
101 |
|
|
102 // Generic error messages. |
|
2805
|
103 static void yyerror (const char *s); |
|
1
|
104 |
|
578
|
105 // Error mesages for mismatched end tokens. |
|
2805
|
106 static void end_error |
|
|
107 (const char *type, token::end_tok_type ettype, int l, int c); |
|
1
|
108 |
|
578
|
109 // Check to see that end tokens are properly matched. |
|
2857
|
110 static bool end_token_ok (token *tok, token::end_tok_type expected); |
|
1
|
111 |
|
496
|
112 // Try to figure out early if an expression should become an |
|
1623
|
113 // assignment to the built-in variable ans. |
|
496
|
114 static tree_expression *maybe_convert_to_ans_assign (tree_expression *expr); |
|
|
115 |
|
|
116 // Maybe print a warning if an assignment expression is used as the |
|
|
117 // test in a logical expression. |
|
|
118 static void maybe_warn_assign_as_truth_value (tree_expression *expr); |
|
1
|
119 |
|
2764
|
120 // Maybe print a warning about switch labels that aren't constants. |
|
|
121 static void maybe_warn_variable_switch_label (tree_expression *expr); |
|
|
122 |
|
1623
|
123 // Create a plot command. |
|
|
124 static tree_plot_command *make_plot_command |
|
|
125 (token *tok, plot_limits *range, subplot_list *list); |
|
|
126 |
|
|
127 // Finish building a range. |
|
|
128 static tree_expression *finish_colon_expression (tree_colon_expression *e); |
|
|
129 |
|
1607
|
130 // Build a constant. |
|
2375
|
131 static tree_constant *make_constant (int op, token *tok_val); |
|
1607
|
132 |
|
578
|
133 // Build a binary expression. |
|
751
|
134 static tree_expression *make_binary_op |
|
|
135 (int op, tree_expression *op1, token *tok_val, tree_expression *op2); |
|
578
|
136 |
|
2375
|
137 // Build a boolean expression. |
|
|
138 static tree_expression *make_boolean_op |
|
|
139 (int op, tree_expression *op1, token *tok_val, tree_expression *op2); |
|
|
140 |
|
578
|
141 // Build a prefix expression. |
|
751
|
142 static tree_expression *make_prefix_op |
|
|
143 (int op, tree_identifier *op1, token *tok_val); |
|
578
|
144 |
|
|
145 // Build a postfix expression. |
|
751
|
146 static tree_expression *make_postfix_op |
|
|
147 (int op, tree_identifier *op1, token *tok_val); |
|
578
|
148 |
|
|
149 // Build a binary expression. |
|
751
|
150 static tree_expression *make_unary_op |
|
|
151 (int op, tree_expression *op1, token *tok_val); |
|
578
|
152 |
|
1623
|
153 // Build an unwind-protect command. |
|
|
154 static tree_command *make_unwind_command |
|
|
155 (token *unwind_tok, tree_statement_list *body, |
|
|
156 tree_statement_list *cleanup, token *end_tok); |
|
|
157 |
|
|
158 // Build a try-catch command. |
|
|
159 static tree_command *make_try_command |
|
|
160 (token *try_tok, tree_statement_list *body, |
|
|
161 tree_statement_list *cleanup, token *end_tok); |
|
|
162 |
|
|
163 // Build a while command. |
|
|
164 static tree_command *make_while_command |
|
|
165 (token *while_tok, tree_expression *expr, |
|
|
166 tree_statement_list *body, token *end_tok); |
|
|
167 |
|
|
168 // Build a for command. |
|
|
169 static tree_command *make_for_command |
|
|
170 (token *for_tok, tree_index_expression *var, |
|
|
171 tree_expression *expr, tree_statement_list *body, |
|
|
172 token *end_tok); |
|
|
173 |
|
|
174 // Build a for command a different way. |
|
|
175 static tree_command *make_for_command |
|
1829
|
176 (token *for_tok, tree_matrix_row *mr, tree_expression *expr, |
|
1623
|
177 tree_statement_list *body, token *end_tok); |
|
|
178 |
|
|
179 // Build a break command. |
|
|
180 static tree_command *make_break_command (token *break_tok); |
|
|
181 |
|
|
182 // Build a continue command. |
|
|
183 static tree_command *make_continue_command (token *continue_tok); |
|
|
184 |
|
|
185 // Build a return command. |
|
|
186 static tree_command *make_return_command (token *return_tok); |
|
|
187 |
|
|
188 // Start an if command. |
|
|
189 static tree_if_command_list *start_if_command |
|
|
190 (tree_expression *expr, tree_statement_list *list); |
|
|
191 |
|
|
192 // Finish an if command. |
|
|
193 static tree_if_command *finish_if_command |
|
|
194 (token *if_tok, tree_if_command_list *list, token *end_tok); |
|
|
195 |
|
|
196 // Build an elseif clause. |
|
|
197 static tree_if_clause *make_elseif_clause |
|
|
198 (tree_expression *expr, tree_statement_list *list); |
|
|
199 |
|
2764
|
200 // Finish a switch command. |
|
|
201 static tree_switch_command *finish_switch_command |
|
|
202 (token *switch_tok, tree_expression *expr, |
|
|
203 tree_switch_case_list *list, token *end_tok); |
|
|
204 |
|
|
205 // Build a switch case. |
|
|
206 static tree_switch_case *make_switch_case |
|
|
207 (tree_expression *expr, tree_statement_list *list); |
|
|
208 |
|
1623
|
209 // Build an assignment to a variable. |
|
|
210 static tree_expression *make_simple_assignment |
|
|
211 (tree_index_expression *var, token *eq_tok, tree_expression *expr); |
|
|
212 |
|
666
|
213 // Make an expression that handles assignment of multiple values. |
|
751
|
214 static tree_expression *make_multi_val_ret |
|
1829
|
215 (tree_matrix_row *mr, tree_expression *rhs, token *eq_tok); |
|
1623
|
216 |
|
|
217 // Begin defining a function. |
|
|
218 static tree_function *start_function_def |
|
|
219 (tree_parameter_list *param_list, tree_statement_list *body); |
|
|
220 |
|
|
221 // Do most of the work for defining a function. |
|
|
222 static tree_function *frob_function_def |
|
|
223 (tree_identifier *id, tree_function *fcn); |
|
|
224 |
|
|
225 // Finish defining a function. |
|
|
226 static tree_function *finish_function_def (token *var, tree_function *fcn); |
|
|
227 |
|
|
228 // Finish defining a function a different way. |
|
|
229 static tree_function *finish_function_def |
|
|
230 (tree_parameter_list *ret_list, tree_function *fcn); |
|
751
|
231 |
|
|
232 // Make an index expression. |
|
|
233 static tree_index_expression *make_index_expression |
|
|
234 (tree_indirect_ref *indir, tree_argument_list *args); |
|
666
|
235 |
|
2846
|
236 // Make a declaration command. |
|
|
237 static tree_decl_command *make_decl_command |
|
|
238 (int tok, token *tok_val, tree_decl_init_list *lst); |
|
|
239 |
|
1623
|
240 // Finish building a matrix list. |
|
1829
|
241 static tree_expression *finish_matrix (tree_matrix *m); |
|
1623
|
242 |
|
1511
|
243 // Maybe print a warning. Duh. |
|
|
244 static void maybe_warn_missing_semi (tree_statement_list *); |
|
|
245 |
|
2525
|
246 // Set the print flag for a statement based on the separator type. |
|
|
247 static void set_stmt_print_flag (tree_statement_list *, char, bool); |
|
|
248 |
|
1
|
249 #define ABORT_PARSE \ |
|
|
250 do \ |
|
|
251 { \ |
|
522
|
252 global_command = 0; \ |
|
1
|
253 yyerrok; \ |
|
|
254 if (interactive) \ |
|
|
255 YYACCEPT; \ |
|
|
256 else \ |
|
|
257 YYABORT; \ |
|
|
258 } \ |
|
|
259 while (0) |
|
|
260 |
|
|
261 %} |
|
|
262 |
|
666
|
263 // Bison declarations. |
|
|
264 |
|
1
|
265 %union |
|
|
266 { |
|
143
|
267 // The type of the basic tokens returned by the lexer. |
|
|
268 token *tok_val; |
|
|
269 |
|
|
270 // Types for the nonterminals we generate. |
|
2525
|
271 char sep_type; |
|
1
|
272 tree *tree_type; |
|
1829
|
273 tree_matrix *tree_matrix_type; |
|
|
274 tree_matrix_row *tree_matrix_row_type; |
|
496
|
275 tree_expression *tree_expression_type; |
|
2375
|
276 tree_constant *tree_constant_type; |
|
1
|
277 tree_identifier *tree_identifier_type; |
|
751
|
278 tree_indirect_ref *tree_indirect_ref_type; |
|
1
|
279 tree_function *tree_function_type; |
|
|
280 tree_index_expression *tree_index_expression_type; |
|
|
281 tree_colon_expression *tree_colon_expression_type; |
|
|
282 tree_argument_list *tree_argument_list_type; |
|
|
283 tree_parameter_list *tree_parameter_list_type; |
|
|
284 tree_command *tree_command_type; |
|
|
285 tree_if_command *tree_if_command_type; |
|
578
|
286 tree_if_clause *tree_if_clause_type; |
|
|
287 tree_if_command_list *tree_if_command_list_type; |
|
2764
|
288 tree_switch_command *tree_switch_command_type; |
|
|
289 tree_switch_case *tree_switch_case_type; |
|
|
290 tree_switch_case_list *tree_switch_case_list_type; |
|
2846
|
291 tree_decl_elt *tree_decl_elt_type; |
|
|
292 tree_decl_init_list *tree_decl_init_list_type; |
|
|
293 tree_decl_command *tree_decl_command_type; |
|
578
|
294 tree_statement *tree_statement_type; |
|
|
295 tree_statement_list *tree_statement_list_type; |
|
1
|
296 tree_plot_command *tree_plot_command_type; |
|
578
|
297 subplot *subplot_type; |
|
|
298 subplot_list *subplot_list_type; |
|
|
299 plot_limits *plot_limits_type; |
|
|
300 plot_range *plot_range_type; |
|
|
301 subplot_using *subplot_using_type; |
|
|
302 subplot_style *subplot_style_type; |
|
1
|
303 } |
|
|
304 |
|
143
|
305 // Tokens with line and column information. |
|
|
306 %token <tok_val> '=' ':' '-' '+' '*' '/' |
|
428
|
307 %token <tok_val> EXPR_AND_AND EXPR_OR_OR |
|
143
|
308 %token <tok_val> EXPR_AND EXPR_OR EXPR_NOT |
|
|
309 %token <tok_val> EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
1276
|
310 %token <tok_val> LEFTDIV EMUL EDIV ELEFTDIV EPLUS EMINUS |
|
|
311 %token <tok_val> QUOTE TRANSPOSE |
|
143
|
312 %token <tok_val> PLUS_PLUS MINUS_MINUS POW EPOW |
|
|
313 %token <tok_val> NUM IMAG_NUM |
|
169
|
314 %token <tok_val> NAME SCREW |
|
143
|
315 %token <tok_val> END |
|
|
316 %token <tok_val> PLOT |
|
|
317 %token <tok_val> TEXT STYLE |
|
1491
|
318 %token <tok_val> FOR WHILE |
|
|
319 %token <tok_val> IF ELSEIF ELSE |
|
2764
|
320 %token <tok_val> SWITCH CASE OTHERWISE |
|
1491
|
321 %token <tok_val> BREAK CONTINUE FUNC_RET |
|
924
|
322 %token <tok_val> UNWIND CLEANUP |
|
1489
|
323 %token <tok_val> TRY CATCH |
|
2846
|
324 %token <tok_val> GLOBAL STATIC |
|
751
|
325 %token <tok_val> TEXT_ID |
|
1
|
326 |
|
143
|
327 // Other tokens. |
|
627
|
328 %token LEXICAL_ERROR |
|
191
|
329 %token FCN SCREW_TWO |
|
206
|
330 %token ELLIPSIS |
|
922
|
331 %token ALL_VA_ARGS |
|
206
|
332 %token END_OF_INPUT |
|
883
|
333 %token USING TITLE WITH COLON OPEN_BRACE CLOSE_BRACE CLEAR |
|
1
|
334 |
|
143
|
335 // Nonterminals we construct. |
|
2525
|
336 %type <sep_type> sep_no_nl opt_sep_no_nl sep opt_sep |
|
578
|
337 %type <tree_type> input |
|
1829
|
338 %type <tree_matrix_type> rows rows1 |
|
|
339 %type <tree_matrix_row_type> matrix_row matrix_row1 |
|
496
|
340 %type <tree_expression_type> expression simple_expr simple_expr1 |
|
1623
|
341 %type <tree_expression_type> ans_expression title matrix |
|
1
|
342 %type <tree_identifier_type> identifier |
|
751
|
343 %type <tree_indirect_ref_type> indirect_ref indirect_ref1 |
|
578
|
344 %type <tree_function_type> func_def1 func_def2 func_def3 |
|
482
|
345 %type <tree_index_expression_type> variable word_list_cmd |
|
1
|
346 %type <tree_colon_expression_type> colon_expr |
|
578
|
347 %type <tree_argument_list_type> arg_list word_list |
|
723
|
348 %type <tree_parameter_list_type> param_list param_list1 |
|
|
349 %type <tree_parameter_list_type> return_list return_list1 |
|
578
|
350 %type <tree_command_type> command func_def |
|
|
351 %type <tree_if_command_type> if_command |
|
|
352 %type <tree_if_clause_type> elseif_clause else_clause |
|
|
353 %type <tree_if_command_list_type> if_cmd_list1 if_cmd_list |
|
2764
|
354 %type <tree_switch_command_type> switch_command |
|
|
355 %type <tree_switch_case_type> switch_case default_case |
|
|
356 %type <tree_switch_case_list_type> case_list1 case_list |
|
2846
|
357 %type <tree_decl_elt_type> decl2 |
|
|
358 %type <tree_decl_init_list_type> decl1 |
|
|
359 %type <tree_decl_command_type> declaration |
|
578
|
360 %type <tree_statement_type> statement |
|
627
|
361 %type <tree_statement_list_type> simple_list simple_list1 list list1 |
|
|
362 %type <tree_statement_list_type> opt_list input1 |
|
1
|
363 %type <tree_plot_command_type> plot_command |
|
578
|
364 %type <subplot_type> plot_command2 plot_options |
|
|
365 %type <subplot_list_type> plot_command1 |
|
|
366 %type <plot_limits_type> ranges |
|
|
367 %type <plot_range_type> ranges1 |
|
|
368 %type <subplot_using_type> using using1 |
|
|
369 %type <subplot_style_type> style |
|
1
|
370 |
|
143
|
371 // Precedence and associativity. |
|
1
|
372 %left ';' ',' '\n' |
|
|
373 %right '=' |
|
428
|
374 %left EXPR_AND_AND EXPR_OR_OR |
|
1
|
375 %left EXPR_AND EXPR_OR |
|
|
376 %left EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT |
|
|
377 %left ':' |
|
1276
|
378 %left '-' '+' EPLUS EMINUS |
|
1
|
379 %left '*' '/' LEFTDIV EMUL EDIV ELEFTDIV |
|
|
380 %left QUOTE TRANSPOSE |
|
|
381 %left UNARY PLUS_PLUS MINUS_MINUS EXPR_NOT |
|
|
382 %right POW EPOW |
|
|
383 |
|
2524
|
384 // There are 18 shift/reduce conflicts, ok? But this only works with |
|
2427
|
385 // bison... |
|
2524
|
386 // %expect 18 |
|
143
|
387 |
|
|
388 // Where to start. |
|
1
|
389 %start input |
|
|
390 |
|
666
|
391 // Grammar rules. |
|
|
392 |
|
1
|
393 %% |
|
|
394 |
|
627
|
395 input : input1 |
|
1
|
396 { |
|
627
|
397 global_command = $1; |
|
1
|
398 promptflag = 1; |
|
|
399 YYACCEPT; |
|
|
400 } |
|
|
401 | END_OF_INPUT |
|
|
402 { |
|
522
|
403 global_command = 0; |
|
1
|
404 promptflag = 1; |
|
|
405 YYABORT; |
|
|
406 } |
|
627
|
407 | simple_list parse_error |
|
1091
|
408 { ABORT_PARSE; } |
|
627
|
409 | parse_error |
|
1091
|
410 { ABORT_PARSE; } |
|
627
|
411 ; |
|
|
412 |
|
|
413 input1 : '\n' |
|
|
414 { $$ = 0; } |
|
327
|
415 | simple_list |
|
627
|
416 { $$ = $1; } |
|
1
|
417 | simple_list '\n' |
|
627
|
418 { $$ = $1; } |
|
1
|
419 | simple_list END_OF_INPUT |
|
627
|
420 { $$ = $1; } |
|
|
421 ; |
|
|
422 |
|
|
423 parse_error : LEXICAL_ERROR |
|
1091
|
424 { yyerror ("parse error"); } |
|
1
|
425 | error |
|
|
426 ; |
|
|
427 |
|
2525
|
428 simple_list : simple_list1 opt_sep_no_nl |
|
1
|
429 { |
|
2525
|
430 set_stmt_print_flag ($1, $2, false); |
|
1511
|
431 $$ = $1; |
|
1
|
432 } |
|
|
433 ; |
|
|
434 |
|
578
|
435 simple_list1 : statement |
|
|
436 { $$ = new tree_statement_list ($1); } |
|
2525
|
437 | simple_list1 sep_no_nl statement |
|
1
|
438 { |
|
2525
|
439 set_stmt_print_flag ($1, $2, false); |
|
578
|
440 $1->append ($3); |
|
1511
|
441 $$ = $1; |
|
1
|
442 } |
|
|
443 ; |
|
|
444 |
|
|
445 opt_list : // empty |
|
578
|
446 { $$ = new tree_statement_list (); } |
|
1
|
447 | list |
|
|
448 { $$ = $1; } |
|
496
|
449 ; |
|
1
|
450 |
|
2525
|
451 list : list1 opt_sep |
|
1511
|
452 { |
|
2525
|
453 set_stmt_print_flag ($1, $2, true); |
|
1829
|
454 $$ = $1; |
|
1
|
455 } |
|
|
456 ; |
|
|
457 |
|
578
|
458 list1 : statement |
|
440
|
459 { |
|
2857
|
460 lexer_flags.beginning_of_function = false; |
|
578
|
461 $$ = new tree_statement_list ($1); |
|
440
|
462 } |
|
2525
|
463 | list1 sep statement |
|
1511
|
464 { |
|
2525
|
465 set_stmt_print_flag ($1, $2, true); |
|
578
|
466 $1->append ($3); |
|
1511
|
467 $$ = $1; |
|
1
|
468 } |
|
|
469 ; |
|
|
470 |
|
578
|
471 statement : command |
|
|
472 { $$ = new tree_statement ($1); } |
|
1
|
473 | ans_expression |
|
578
|
474 { $$ = new tree_statement ($1); } |
|
883
|
475 | PLOT CLEAR |
|
|
476 { |
|
|
477 symbol_record *sr = lookup_by_name ("clearplot", 0); |
|
|
478 tree_identifier *id = new tree_identifier (sr); |
|
|
479 $$ = new tree_statement (id); |
|
|
480 } |
|
1
|
481 ; |
|
|
482 |
|
|
483 plot_command : PLOT plot_command1 |
|
|
484 { |
|
1623
|
485 if (! ($$ = make_plot_command ($1, 0, $2))) |
|
|
486 ABORT_PARSE; |
|
1
|
487 } |
|
|
488 | PLOT ranges plot_command1 |
|
|
489 { |
|
1623
|
490 if (! ($$ = make_plot_command ($1, $2, $3))) |
|
|
491 ABORT_PARSE; |
|
1
|
492 } |
|
|
493 ; |
|
|
494 |
|
|
495 ranges : ranges1 |
|
578
|
496 { $$ = new plot_limits ($1); } |
|
1
|
497 | ranges1 ranges1 |
|
578
|
498 { $$ = new plot_limits ($1, $2); } |
|
1
|
499 | ranges1 ranges1 ranges1 |
|
578
|
500 { $$ = new plot_limits ($1, $2, $3); } |
|
1
|
501 ; |
|
|
502 |
|
|
503 ranges1 : OPEN_BRACE expression COLON expression CLOSE_BRACE |
|
578
|
504 { $$ = new plot_range ($2, $4); } |
|
1
|
505 | OPEN_BRACE COLON expression CLOSE_BRACE |
|
578
|
506 { $$ = new plot_range (0, $3); } |
|
1
|
507 | OPEN_BRACE expression COLON CLOSE_BRACE |
|
578
|
508 { $$ = new plot_range ($2, 0); } |
|
1
|
509 | OPEN_BRACE COLON CLOSE_BRACE |
|
578
|
510 { $$ = new plot_range (); } |
|
1
|
511 | OPEN_BRACE CLOSE_BRACE |
|
578
|
512 { $$ = new plot_range (); } |
|
1
|
513 ; |
|
|
514 |
|
478
|
515 plot_command1 : // empty |
|
522
|
516 { $$ = 0; } |
|
478
|
517 | plot_command2 |
|
578
|
518 { $$ = new subplot_list ($1); } |
|
1
|
519 | plot_command1 ',' plot_command2 |
|
1829
|
520 { |
|
|
521 $1->append ($3); |
|
|
522 $$ = $1; |
|
|
523 } |
|
1
|
524 ; |
|
|
525 |
|
|
526 plot_command2 : expression |
|
578
|
527 { $$ = new subplot ($1); } |
|
1
|
528 | expression plot_options |
|
1623
|
529 { $$ = $2->set_data ($1); } |
|
1
|
530 ; |
|
|
531 |
|
|
532 plot_options : using |
|
578
|
533 { $$ = new subplot ($1, 0, 0); } |
|
1
|
534 | title |
|
578
|
535 { $$ = new subplot (0, $1, 0); } |
|
1
|
536 | style |
|
578
|
537 { $$ = new subplot (0, 0, $1); } |
|
1
|
538 | using title |
|
578
|
539 { $$ = new subplot ($1, $2, 0); } |
|
|
540 | title using |
|
|
541 { $$ = new subplot ($2, $1, 0); } |
|
|
542 | using style |
|
|
543 { $$ = new subplot ($1, 0, $2); } |
|
|
544 | style using |
|
|
545 { $$ = new subplot ($2, 0, $1); } |
|
|
546 | title style |
|
|
547 { $$ = new subplot (0, $1, $2); } |
|
|
548 | style title |
|
|
549 { $$ = new subplot (0, $2, $1); } |
|
|
550 | using title style |
|
|
551 { $$ = new subplot ($1, $2, $3); } |
|
|
552 | using style title |
|
|
553 { $$ = new subplot ($1, $3, $2); } |
|
|
554 | title using style |
|
|
555 { $$ = new subplot ($2, $1, $3); } |
|
|
556 | title style using |
|
|
557 { $$ = new subplot ($3, $1, $2); } |
|
|
558 | style using title |
|
|
559 { $$ = new subplot ($2, $3, $1); } |
|
|
560 | style title using |
|
|
561 { $$ = new subplot ($3, $2, $1); } |
|
1
|
562 ; |
|
|
563 |
|
|
564 using : using1 |
|
|
565 { |
|
2857
|
566 lexer_flags.in_plot_using = false; |
|
1
|
567 $$ = $1; |
|
|
568 } |
|
|
569 | using1 expression |
|
|
570 { |
|
2857
|
571 lexer_flags.in_plot_using = false; |
|
1
|
572 $$ = $1->set_format ($2); |
|
|
573 } |
|
|
574 ; |
|
|
575 |
|
|
576 using1 : USING expression |
|
|
577 { |
|
578
|
578 subplot_using *tmp = new subplot_using (); |
|
1
|
579 $$ = tmp->add_qualifier ($2); |
|
|
580 } |
|
|
581 | using1 COLON expression |
|
|
582 { $$ = $1->add_qualifier ($3); } |
|
|
583 ; |
|
|
584 |
|
|
585 title : TITLE expression |
|
|
586 { $$ = $2; } |
|
|
587 ; |
|
|
588 |
|
|
589 style : WITH STYLE |
|
1755
|
590 { $$ = new subplot_style ($2->text ()); } |
|
1
|
591 | WITH STYLE expression |
|
1755
|
592 { $$ = new subplot_style ($2->text (), $3); } |
|
2542
|
593 | WITH STYLE expression expression |
|
|
594 { $$ = new subplot_style ($2->text (), $3, $4); } |
|
1
|
595 ; |
|
|
596 |
|
|
597 ans_expression : expression |
|
|
598 { $$ = maybe_convert_to_ans_assign ($1); } |
|
|
599 ; |
|
|
600 |
|
2846
|
601 decl1 : decl2 |
|
|
602 { $$ = new tree_decl_init_list ($1); } |
|
|
603 | decl1 decl2 |
|
578
|
604 { |
|
2846
|
605 $1->append ($2); |
|
|
606 $$ = $1; |
|
578
|
607 } |
|
2846
|
608 ; |
|
|
609 |
|
|
610 decl2 : identifier |
|
|
611 { $$ = new tree_decl_elt ($1); } |
|
578
|
612 | identifier '=' expression |
|
1
|
613 { |
|
578
|
614 tree_simple_assignment_expression *tmp_ass; |
|
|
615 tmp_ass = new tree_simple_assignment_expression |
|
581
|
616 ($1, $3, 0, 0, $2->line (), $2->column ()); |
|
2846
|
617 $$ = new tree_decl_elt (tmp_ass); |
|
1
|
618 } |
|
|
619 ; |
|
|
620 |
|
2846
|
621 declaration : GLOBAL decl1 |
|
|
622 { $$ = make_decl_command (GLOBAL, $1, $2); } |
|
|
623 | STATIC decl1 |
|
|
624 { $$ = make_decl_command (STATIC, $1, $2); } |
|
1
|
625 ; |
|
|
626 |
|
578
|
627 command : plot_command |
|
|
628 { $$ = $1; } |
|
|
629 | func_def |
|
|
630 { $$ = $1; } |
|
2846
|
631 | declaration |
|
578
|
632 { $$ = $1; } |
|
2764
|
633 | switch_command |
|
|
634 { $$ = $1; } |
|
578
|
635 | if_command |
|
2764
|
636 { $$ = $1; } |
|
2525
|
637 | UNWIND opt_sep opt_list CLEANUP opt_sep opt_list END |
|
916
|
638 { |
|
1623
|
639 if (! ($$ = make_unwind_command ($1, $3, $6, $7))) |
|
916
|
640 ABORT_PARSE; |
|
|
641 } |
|
2525
|
642 | TRY opt_sep opt_list CATCH opt_sep opt_list END |
|
1489
|
643 { |
|
1623
|
644 if (! ($$ = make_try_command ($1, $3, $6, $7))) |
|
1489
|
645 ABORT_PARSE; |
|
|
646 } |
|
2525
|
647 | WHILE expression opt_sep opt_list END |
|
1
|
648 { |
|
1623
|
649 if (! ($$ = make_while_command ($1, $2, $4, $5))) |
|
143
|
650 ABORT_PARSE; |
|
1
|
651 } |
|
2525
|
652 | FOR variable '=' expression opt_sep opt_list END |
|
1
|
653 { |
|
1623
|
654 if (! ($$ = make_for_command ($1, $2, $4, $6, $7))) |
|
143
|
655 ABORT_PARSE; |
|
1
|
656 } |
|
1229
|
657 | FOR '[' screwed_again matrix_row SCREW_TWO '=' |
|
2525
|
658 expression opt_sep opt_list END |
|
1229
|
659 { |
|
1829
|
660 if (! ($$ = make_for_command ($1, $4, $7, $9, $10))) |
|
1229
|
661 ABORT_PARSE; |
|
|
662 } |
|
1
|
663 | BREAK |
|
|
664 { |
|
1623
|
665 if (! ($$ = make_break_command ($1))) |
|
|
666 ABORT_PARSE; |
|
1
|
667 } |
|
|
668 | CONTINUE |
|
|
669 { |
|
1623
|
670 if (! ($$ = make_continue_command ($1))) |
|
|
671 ABORT_PARSE; |
|
1
|
672 } |
|
|
673 | FUNC_RET |
|
|
674 { |
|
1623
|
675 if (! ($$ = make_return_command ($1))) |
|
|
676 ABORT_PARSE; |
|
1
|
677 } |
|
|
678 ; |
|
|
679 |
|
578
|
680 if_command : IF if_cmd_list END |
|
|
681 { |
|
1623
|
682 if (! ($$ = finish_if_command ($1, $2, $3))) |
|
578
|
683 ABORT_PARSE; |
|
|
684 } |
|
|
685 ; |
|
|
686 |
|
|
687 if_cmd_list : if_cmd_list1 |
|
2427
|
688 { $$ = $1; } |
|
578
|
689 | if_cmd_list1 else_clause |
|
1829
|
690 { |
|
|
691 $1->append ($2); |
|
|
692 $$ = $1; |
|
|
693 } |
|
578
|
694 ; |
|
|
695 |
|
2525
|
696 if_cmd_list1 : expression opt_sep opt_list |
|
1623
|
697 { $$ = start_if_command ($1, $3); } |
|
578
|
698 | if_cmd_list1 elseif_clause |
|
1829
|
699 { |
|
|
700 $1->append ($2); |
|
|
701 $$ = $1; |
|
|
702 } |
|
578
|
703 ; |
|
|
704 |
|
2525
|
705 elseif_clause : ELSEIF opt_sep expression opt_sep opt_list |
|
1623
|
706 { $$ = make_elseif_clause ($3, $5); } |
|
578
|
707 ; |
|
|
708 |
|
2525
|
709 else_clause : ELSE opt_sep opt_list |
|
578
|
710 { $$ = new tree_if_clause ($3); } |
|
1
|
711 ; |
|
|
712 |
|
2764
|
713 switch_command : SWITCH expression opt_sep case_list END |
|
|
714 { |
|
|
715 if (! ($$ = finish_switch_command ($1, $2, $4, $5))) |
|
|
716 ABORT_PARSE; |
|
|
717 } |
|
|
718 ; |
|
|
719 |
|
|
720 case_list : case_list1 |
|
|
721 { $$ = $1; } |
|
|
722 | case_list1 default_case |
|
|
723 { |
|
|
724 $1->append ($2); |
|
|
725 $$ = $1; |
|
|
726 } |
|
|
727 ; |
|
|
728 |
|
|
729 case_list1 : switch_case |
|
|
730 { $$ = new tree_switch_case_list ($1); } |
|
|
731 | case_list1 switch_case |
|
|
732 { |
|
|
733 $1->append ($2); |
|
|
734 $$ = $1; |
|
|
735 } |
|
|
736 ; |
|
|
737 |
|
|
738 switch_case : CASE opt_sep expression opt_sep list |
|
|
739 { $$ = make_switch_case ($3, $5); } |
|
|
740 ; |
|
|
741 |
|
|
742 default_case : OTHERWISE opt_sep opt_list |
|
|
743 { $$ = new tree_switch_case ($3); } |
|
|
744 ; |
|
|
745 |
|
1
|
746 screwed_again : // empty |
|
1826
|
747 { lexer_flags.maybe_screwed_again++; } |
|
1
|
748 ; |
|
|
749 |
|
1623
|
750 expression : simple_expr |
|
|
751 { $$ = $1; } |
|
1
|
752 | NUM '=' expression |
|
|
753 { |
|
1005
|
754 yyerror ("invalid assignment to a number"); |
|
522
|
755 $$ = 0; |
|
1
|
756 ABORT_PARSE; |
|
|
757 } |
|
1623
|
758 ; |
|
|
759 |
|
|
760 // Now that we do some simple constant folding, we have to make sure |
|
|
761 // that we get something valid back make_binary_op and make_unary_op. |
|
|
762 |
|
|
763 simple_expr : simple_expr1 |
|
666
|
764 { |
|
1623
|
765 if (! ($$ = $1)) |
|
666
|
766 ABORT_PARSE; |
|
|
767 } |
|
1
|
768 ; |
|
|
769 |
|
1623
|
770 simple_expr1 : NUM |
|
|
771 { $$ = make_constant (NUM, $1); } |
|
|
772 | IMAG_NUM |
|
|
773 { $$ = make_constant (IMAG_NUM, $1); } |
|
|
774 | TEXT |
|
|
775 { $$ = make_constant (TEXT, $1); } |
|
|
776 | '(' simple_expr ')' |
|
|
777 { |
|
2124
|
778 $2->mark_in_parens (); |
|
1623
|
779 $$ = $2; |
|
|
780 } |
|
|
781 | word_list_cmd |
|
|
782 { $$ = $1; } |
|
|
783 | variable |
|
|
784 { $$ = $1; } |
|
2533
|
785 | colon_expr |
|
|
786 { $$ = finish_colon_expression ($1); } |
|
1623
|
787 | matrix |
|
1
|
788 { $$ = $1; } |
|
1623
|
789 | '[' ']' |
|
2375
|
790 { $$ = new tree_constant (Matrix ()); } |
|
1623
|
791 | '[' ';' ']' |
|
2375
|
792 { $$ = new tree_constant (Matrix ()); } |
|
1623
|
793 | PLUS_PLUS identifier %prec UNARY |
|
|
794 { $$ = make_prefix_op (PLUS_PLUS, $2, $1); } |
|
|
795 | MINUS_MINUS identifier %prec UNARY |
|
|
796 { $$ = make_prefix_op (MINUS_MINUS, $2, $1); } |
|
|
797 | EXPR_NOT simple_expr |
|
|
798 { $$ = make_unary_op (EXPR_NOT, $2, $1); } |
|
|
799 | '+' simple_expr %prec UNARY |
|
|
800 { $$ = $2; } |
|
|
801 | '-' simple_expr %prec UNARY |
|
|
802 { $$ = make_unary_op ('-', $2, $1); } |
|
|
803 | variable '=' simple_expr |
|
|
804 { $$ = make_simple_assignment ($1, $2, $3); } |
|
|
805 | '[' screwed_again matrix_row SCREW_TWO '=' simple_expr |
|
|
806 { |
|
1829
|
807 if (! ($$ = make_multi_val_ret ($3, $6, $5))) |
|
1623
|
808 ABORT_PARSE; |
|
|
809 } |
|
1
|
810 | identifier PLUS_PLUS |
|
578
|
811 { $$ = make_postfix_op (PLUS_PLUS, $1, $2); } |
|
1
|
812 | identifier MINUS_MINUS |
|
578
|
813 { $$ = make_postfix_op (MINUS_MINUS, $1, $2); } |
|
1
|
814 | simple_expr QUOTE |
|
578
|
815 { $$ = make_unary_op (QUOTE, $1, $2); } |
|
1
|
816 | simple_expr TRANSPOSE |
|
578
|
817 { $$ = make_unary_op (TRANSPOSE, $1, $2); } |
|
1
|
818 | simple_expr POW simple_expr |
|
578
|
819 { $$ = make_binary_op (POW, $1, $2, $3); } |
|
1
|
820 | simple_expr EPOW simple_expr |
|
578
|
821 { $$ = make_binary_op (EPOW, $1, $2, $3); } |
|
1
|
822 | simple_expr '+' simple_expr |
|
578
|
823 { $$ = make_binary_op ('+', $1, $2, $3); } |
|
1
|
824 | simple_expr '-' simple_expr |
|
578
|
825 { $$ = make_binary_op ('-', $1, $2, $3); } |
|
1
|
826 | simple_expr '*' simple_expr |
|
578
|
827 { $$ = make_binary_op ('*', $1, $2, $3); } |
|
1
|
828 | simple_expr '/' simple_expr |
|
578
|
829 { $$ = make_binary_op ('/', $1, $2, $3); } |
|
1276
|
830 | simple_expr EPLUS simple_expr |
|
|
831 { $$ = make_binary_op ('+', $1, $2, $3); } |
|
|
832 | simple_expr EMINUS simple_expr |
|
|
833 { $$ = make_binary_op ('-', $1, $2, $3); } |
|
1
|
834 | simple_expr EMUL simple_expr |
|
578
|
835 { $$ = make_binary_op (EMUL, $1, $2, $3); } |
|
1
|
836 | simple_expr EDIV simple_expr |
|
578
|
837 { $$ = make_binary_op (EDIV, $1, $2, $3); } |
|
1
|
838 | simple_expr LEFTDIV simple_expr |
|
578
|
839 { $$ = make_binary_op (LEFTDIV, $1, $2, $3); } |
|
1
|
840 | simple_expr ELEFTDIV simple_expr |
|
578
|
841 { $$ = make_binary_op (ELEFTDIV, $1, $2, $3); } |
|
1
|
842 | simple_expr EXPR_LT simple_expr |
|
578
|
843 { $$ = make_binary_op (EXPR_LT, $1, $2, $3); } |
|
1
|
844 | simple_expr EXPR_LE simple_expr |
|
578
|
845 { $$ = make_binary_op (EXPR_LE, $1, $2, $3); } |
|
1
|
846 | simple_expr EXPR_EQ simple_expr |
|
578
|
847 { $$ = make_binary_op (EXPR_EQ, $1, $2, $3); } |
|
1
|
848 | simple_expr EXPR_GE simple_expr |
|
578
|
849 { $$ = make_binary_op (EXPR_GE, $1, $2, $3); } |
|
1
|
850 | simple_expr EXPR_GT simple_expr |
|
578
|
851 { $$ = make_binary_op (EXPR_GT, $1, $2, $3); } |
|
1
|
852 | simple_expr EXPR_NE simple_expr |
|
578
|
853 { $$ = make_binary_op (EXPR_NE, $1, $2, $3); } |
|
1
|
854 | simple_expr EXPR_AND simple_expr |
|
578
|
855 { $$ = make_binary_op (EXPR_AND, $1, $2, $3); } |
|
1
|
856 | simple_expr EXPR_OR simple_expr |
|
578
|
857 { $$ = make_binary_op (EXPR_OR, $1, $2, $3); } |
|
2375
|
858 | simple_expr EXPR_AND_AND simple_expr |
|
|
859 { $$ = make_boolean_op (EXPR_AND_AND, $1, $2, $3); } |
|
|
860 | simple_expr EXPR_OR_OR simple_expr |
|
|
861 { $$ = make_boolean_op (EXPR_OR_OR, $1, $2, $3); } |
|
1
|
862 ; |
|
|
863 |
|
1623
|
864 colon_expr : simple_expr ':' simple_expr |
|
1
|
865 { |
|
1623
|
866 $$ = new tree_colon_expression |
|
|
867 ($1, $3, $2->line (), $2->column ()); |
|
240
|
868 } |
|
1
|
869 | colon_expr ':' simple_expr |
|
|
870 { |
|
1623
|
871 if (! ($$ = $1->chain ($3))) |
|
1005
|
872 ABORT_PARSE; |
|
1
|
873 } |
|
|
874 ; |
|
|
875 |
|
|
876 word_list_cmd : identifier word_list |
|
482
|
877 { |
|
|
878 $$ = new tree_index_expression |
|
1623
|
879 ($1, $2, $1->line (), $1->column ()); |
|
482
|
880 } |
|
1
|
881 ; |
|
|
882 |
|
578
|
883 word_list : TEXT |
|
482
|
884 { |
|
2375
|
885 tree_constant *tmp = make_constant (TEXT, $1); |
|
482
|
886 $$ = new tree_argument_list (tmp); |
|
|
887 } |
|
578
|
888 | word_list TEXT |
|
482
|
889 { |
|
2375
|
890 tree_constant *tmp = make_constant (TEXT, $2); |
|
578
|
891 $1->append (tmp); |
|
1829
|
892 $$ = $1; |
|
482
|
893 } |
|
1
|
894 ; |
|
|
895 |
|
|
896 // This is truly disgusting. |
|
|
897 |
|
|
898 g_symtab : // empty |
|
|
899 { curr_sym_tab = global_sym_tab; } |
|
|
900 ; |
|
|
901 |
|
2745
|
902 in_return_list : // empty |
|
2857
|
903 { lexer_flags.looking_at_return_list = true; } |
|
2745
|
904 ; |
|
|
905 |
|
1
|
906 local_symtab : // empty |
|
|
907 { curr_sym_tab = tmp_local_sym_tab; } |
|
|
908 ; |
|
|
909 |
|
|
910 safe : // empty |
|
2857
|
911 { lexer_flags.maybe_screwed = false; } |
|
1
|
912 ; |
|
|
913 |
|
|
914 are_we_screwed : // empty |
|
2857
|
915 { lexer_flags.maybe_screwed = true; } |
|
1
|
916 ; |
|
|
917 |
|
|
918 func_def : FCN g_symtab are_we_screwed func_def1 |
|
|
919 { |
|
|
920 curr_sym_tab = top_level_sym_tab; |
|
2857
|
921 lexer_flags.defining_func = false; |
|
522
|
922 $$ = 0; |
|
1
|
923 } |
|
|
924 | FCN g_symtab are_we_screwed func_def2 |
|
|
925 { |
|
|
926 curr_sym_tab = top_level_sym_tab; |
|
2857
|
927 lexer_flags.defining_func = false; |
|
522
|
928 $$ = 0; |
|
1
|
929 } |
|
|
930 ; |
|
|
931 |
|
|
932 func_def1 : SCREW safe g_symtab '=' func_def2 |
|
1623
|
933 { $$ = finish_function_def ($1, $5); } |
|
723
|
934 | return_list g_symtab '=' func_def2 |
|
1623
|
935 { $$ = finish_function_def ($1, $4); } |
|
1
|
936 ; |
|
|
937 |
|
2745
|
938 return_list_x : '[' safe local_symtab in_return_list |
|
723
|
939 ; |
|
|
940 |
|
|
941 return_list : return_list_x ']' |
|
2745
|
942 { |
|
2857
|
943 lexer_flags.looking_at_return_list = false; |
|
2745
|
944 $$ = new tree_parameter_list (); |
|
|
945 } |
|
723
|
946 | return_list_x ELLIPSIS ']' |
|
|
947 { |
|
2857
|
948 lexer_flags.looking_at_return_list = false; |
|
723
|
949 tree_parameter_list *tmp = new tree_parameter_list (); |
|
|
950 tmp->mark_varargs_only (); |
|
|
951 $$ = tmp; |
|
|
952 } |
|
|
953 | return_list1 ']' |
|
2745
|
954 { |
|
2857
|
955 lexer_flags.looking_at_return_list = false; |
|
2745
|
956 $$ = $1; |
|
|
957 } |
|
723
|
958 | return_list1 ',' ELLIPSIS ']' |
|
|
959 { |
|
2857
|
960 lexer_flags.looking_at_return_list = false; |
|
723
|
961 $1->mark_varargs (); |
|
|
962 $$ = $1; |
|
|
963 } |
|
|
964 ; |
|
|
965 |
|
|
966 return_list1 : return_list_x identifier |
|
|
967 { $$ = new tree_parameter_list ($2); } |
|
|
968 | return_list_x error |
|
|
969 { |
|
1005
|
970 yyerror ("invalid function return list"); |
|
1829
|
971 $$ = 0; |
|
723
|
972 ABORT_PARSE; |
|
|
973 } |
|
|
974 | return_list1 ',' identifier |
|
1829
|
975 { |
|
|
976 $1->append ($3); |
|
|
977 $$ = $1; |
|
|
978 } |
|
1
|
979 ; |
|
|
980 |
|
|
981 func_def2 : identifier safe local_symtab func_def3 |
|
|
982 { |
|
1623
|
983 if (! ($$ = frob_function_def ($1, $4))) |
|
|
984 ABORT_PARSE; |
|
1
|
985 } |
|
|
986 ; |
|
|
987 |
|
2525
|
988 func_def3 : param_list opt_sep opt_list fcn_end_or_eof |
|
1623
|
989 { $$ = start_function_def ($1, $3); } |
|
2525
|
990 | opt_sep opt_list fcn_end_or_eof |
|
1623
|
991 { $$ = start_function_def (0, $2); } |
|
1
|
992 ; |
|
|
993 |
|
|
994 fcn_end_or_eof : END |
|
|
995 { |
|
2857
|
996 if (end_token_ok ($1, token::function_end)) |
|
|
997 { |
|
|
998 if (reading_fcn_file) |
|
|
999 check_for_garbage_after_fcn_def (); |
|
|
1000 } |
|
|
1001 else |
|
1829
|
1002 ABORT_PARSE; |
|
1
|
1003 } |
|
|
1004 | END_OF_INPUT |
|
|
1005 { |
|
338
|
1006 if (! (reading_fcn_file || reading_script_file)) |
|
1
|
1007 YYABORT; |
|
|
1008 } |
|
|
1009 ; |
|
|
1010 |
|
751
|
1011 indirect_ref : indirect_ref1 |
|
191
|
1012 { |
|
2857
|
1013 lexer_flags.looking_at_indirect_ref = false; |
|
751
|
1014 $$ = $1; |
|
191
|
1015 } |
|
751
|
1016 |
|
|
1017 indirect_ref1 : identifier |
|
191
|
1018 { |
|
751
|
1019 $$ = new tree_indirect_ref ($1, $1->line (), |
|
|
1020 $1->column ()); |
|
191
|
1021 } |
|
1826
|
1022 | indirect_ref1 '.' |
|
2857
|
1023 { lexer_flags.looking_at_indirect_ref = true; } TEXT_ID |
|
2375
|
1024 { $$ = new tree_indirect_ref ($1, $4->text ()); } |
|
751
|
1025 ; |
|
|
1026 |
|
|
1027 variable : indirect_ref |
|
|
1028 { $$ = make_index_expression ($1, 0); } |
|
|
1029 | indirect_ref '(' ')' |
|
|
1030 { $$ = make_index_expression ($1, 0); } |
|
|
1031 | indirect_ref '(' arg_list ')' |
|
|
1032 { $$ = make_index_expression ($1, $3); } |
|
|
1033 | indirect_ref '[' |
|
1
|
1034 { |
|
1005
|
1035 yyerror ("use `(\' and `)\' as index operators, not\ |
|
1
|
1036 `[\' and `]\'"); |
|
522
|
1037 $$ = 0; |
|
1
|
1038 ABORT_PARSE; |
|
|
1039 } |
|
|
1040 ; |
|
|
1041 |
|
2818
|
1042 param_list_beg : '(' |
|
2857
|
1043 { lexer_flags.looking_at_parameter_list = true; } |
|
2745
|
1044 ; |
|
|
1045 |
|
2818
|
1046 param_list_end : ')' |
|
2857
|
1047 { lexer_flags.looking_at_parameter_list = false; } |
|
2818
|
1048 ; |
|
|
1049 |
|
|
1050 param_list : param_list_beg param_list_end |
|
1
|
1051 { |
|
2857
|
1052 lexer_flags.quote_is_transpose = false; |
|
522
|
1053 $$ = 0; |
|
240
|
1054 } |
|
2818
|
1055 | param_list_beg ELLIPSIS param_list_end |
|
504
|
1056 { |
|
2857
|
1057 lexer_flags.quote_is_transpose = false; |
|
504
|
1058 tree_parameter_list *tmp = new tree_parameter_list (); |
|
|
1059 tmp->mark_varargs_only (); |
|
|
1060 $$ = tmp; |
|
|
1061 } |
|
2818
|
1062 | param_list1 param_list_end |
|
240
|
1063 { |
|
2857
|
1064 lexer_flags.quote_is_transpose = false; |
|
578
|
1065 $1->mark_as_formal_parameters (); |
|
1829
|
1066 $$ = $1; |
|
1
|
1067 } |
|
2818
|
1068 | param_list1 ',' ELLIPSIS param_list_end |
|
206
|
1069 { |
|
2857
|
1070 lexer_flags.quote_is_transpose = false; |
|
578
|
1071 $1->mark_as_formal_parameters (); |
|
|
1072 $1->mark_varargs (); |
|
1829
|
1073 $$ = $1; |
|
206
|
1074 } |
|
504
|
1075 ; |
|
1
|
1076 |
|
2818
|
1077 param_list1 : param_list_beg identifier |
|
|
1078 { $$ = new tree_parameter_list ($2); } |
|
1
|
1079 | param_list1 ',' identifier |
|
1829
|
1080 { |
|
|
1081 $1->append ($3); |
|
|
1082 $$ = $1; |
|
|
1083 } |
|
2818
|
1084 | param_list_beg error |
|
1
|
1085 { |
|
1005
|
1086 yyerror ("invalid parameter list"); |
|
1829
|
1087 $$ = 0; |
|
206
|
1088 ABORT_PARSE; |
|
1
|
1089 } |
|
|
1090 | param_list1 ',' error |
|
|
1091 { |
|
1005
|
1092 yyerror ("invalid parameter list"); |
|
1829
|
1093 $$ = 0; |
|
206
|
1094 ABORT_PARSE; |
|
1
|
1095 } |
|
|
1096 ; |
|
|
1097 |
|
|
1098 identifier : NAME |
|
504
|
1099 { |
|
|
1100 $$ = new tree_identifier |
|
|
1101 ($1->sym_rec (), $1->line (), $1->column ()); |
|
|
1102 } |
|
|
1103 ; |
|
1
|
1104 |
|
578
|
1105 arg_list : ':' |
|
1
|
1106 { |
|
2375
|
1107 tree_constant *colon = |
|
|
1108 new tree_constant (tree_constant::magic_colon_t); |
|
1
|
1109 $$ = new tree_argument_list (colon); |
|
|
1110 } |
|
922
|
1111 | expression |
|
|
1112 { $$ = new tree_argument_list ($1); } |
|
|
1113 | ALL_VA_ARGS |
|
|
1114 { |
|
2375
|
1115 tree_constant *all_va_args = |
|
|
1116 new tree_constant (tree_constant::all_va_args_t); |
|
922
|
1117 $$ = new tree_argument_list (all_va_args); |
|
|
1118 } |
|
578
|
1119 | arg_list ',' ':' |
|
1
|
1120 { |
|
2375
|
1121 tree_constant *colon = |
|
|
1122 new tree_constant (tree_constant::magic_colon_t); |
|
578
|
1123 $1->append (colon); |
|
1829
|
1124 $$ = $1; |
|
1
|
1125 } |
|
578
|
1126 | arg_list ',' expression |
|
1829
|
1127 { |
|
|
1128 $1->append ($3); |
|
|
1129 $$ = $1; |
|
|
1130 } |
|
922
|
1131 | arg_list ',' ALL_VA_ARGS |
|
|
1132 { |
|
2375
|
1133 tree_constant *all_va_args = |
|
|
1134 new tree_constant (tree_constant::all_va_args_t); |
|
922
|
1135 $1->append (all_va_args); |
|
1829
|
1136 $$ = $1; |
|
922
|
1137 } |
|
1
|
1138 ; |
|
|
1139 |
|
240
|
1140 matrix : '[' screwed_again rows ']' |
|
1829
|
1141 { $$ = finish_matrix ($3); } |
|
1
|
1142 ; |
|
|
1143 |
|
1084
|
1144 rows : rows1 |
|
1829
|
1145 { $$ = $1; } |
|
1084
|
1146 | rows1 ';' // Ignore trailing semicolon. |
|
1829
|
1147 { $$ = $1; } |
|
1
|
1148 ; |
|
|
1149 |
|
1084
|
1150 rows1 : matrix_row |
|
1829
|
1151 { $$ = new tree_matrix ($1); } |
|
1084
|
1152 | rows1 ';' matrix_row |
|
1829
|
1153 { |
|
|
1154 $1->append ($3); |
|
|
1155 $$ = $1; |
|
|
1156 } |
|
1084
|
1157 ; |
|
|
1158 |
|
|
1159 matrix_row : matrix_row1 |
|
1829
|
1160 { $$ = $1; } |
|
1084
|
1161 | matrix_row1 ',' // Ignore trailing comma. |
|
1829
|
1162 { $$ = $1; } |
|
1084
|
1163 ; |
|
|
1164 |
|
|
1165 matrix_row1 : expression // First element on row. |
|
1829
|
1166 { $$ = new tree_matrix_row ($1); } |
|
1084
|
1167 | matrix_row1 ',' expression |
|
1
|
1168 { |
|
1829
|
1169 $1->append ($3); |
|
|
1170 $$ = $1; |
|
1
|
1171 } |
|
|
1172 ; |
|
|
1173 |
|
2525
|
1174 sep_no_nl : ',' |
|
|
1175 { $$ = ','; } |
|
|
1176 | ';' |
|
|
1177 { $$ = ';'; } |
|
|
1178 | sep_no_nl ',' |
|
|
1179 { $$ = $1; } |
|
|
1180 | sep_no_nl ';' |
|
|
1181 { $$ = $1; } |
|
|
1182 ; |
|
|
1183 |
|
|
1184 opt_sep_no_nl : // empty |
|
|
1185 { $$ = 0; } |
|
|
1186 | sep_no_nl |
|
|
1187 { $$ = $1; } |
|
|
1188 ; |
|
|
1189 |
|
|
1190 sep : ',' |
|
|
1191 { $$ = ','; } |
|
|
1192 | ';' |
|
|
1193 { $$ = ';'; } |
|
|
1194 | '\n' |
|
|
1195 { $$ = '\n'; } |
|
|
1196 | sep ',' |
|
|
1197 { $$ = $1; } |
|
|
1198 | sep ';' |
|
|
1199 { $$ = $1; } |
|
|
1200 | sep '\n' |
|
|
1201 { $$ = $1; } |
|
|
1202 ; |
|
|
1203 |
|
|
1204 opt_sep : // empty |
|
|
1205 { $$ = 0; } |
|
|
1206 | sep |
|
|
1207 { $$ = $1; } |
|
|
1208 ; |
|
|
1209 |
|
1
|
1210 %% |
|
|
1211 |
|
666
|
1212 // Generic error messages. |
|
|
1213 |
|
1
|
1214 static void |
|
2805
|
1215 yyerror (const char *s) |
|
1
|
1216 { |
|
143
|
1217 int err_col = current_input_column - 1; |
|
1
|
1218 |
|
581
|
1219 ostrstream output_buf; |
|
1
|
1220 |
|
1005
|
1221 if (reading_fcn_file || reading_script_file) |
|
|
1222 output_buf << "parse error near line " << input_line_number |
|
1607
|
1223 << " of file " << curr_fcn_file_full_name; |
|
1005
|
1224 else |
|
|
1225 output_buf << "parse error:"; |
|
581
|
1226 |
|
1005
|
1227 if (s && strcmp (s, "parse error") != 0) |
|
|
1228 output_buf << "\n\n " << s; |
|
|
1229 |
|
|
1230 output_buf << "\n\n"; |
|
1
|
1231 |
|
1755
|
1232 if (! current_input_line.empty ()) |
|
1
|
1233 { |
|
1755
|
1234 size_t len = current_input_line.length (); |
|
1060
|
1235 |
|
1755
|
1236 if (current_input_line[len-1] == '\n') |
|
|
1237 current_input_line.resize (len-1); |
|
1005
|
1238 |
|
335
|
1239 // Print the line, maybe with a pointer near the error token. |
|
1005
|
1240 |
|
1755
|
1241 output_buf << ">>> " << current_input_line << "\n"; |
|
1060
|
1242 |
|
|
1243 if (err_col == 0) |
|
|
1244 err_col = len; |
|
|
1245 |
|
|
1246 for (int i = 0; i < err_col + 3; i++) |
|
|
1247 output_buf << " "; |
|
|
1248 |
|
|
1249 output_buf << "^"; |
|
1
|
1250 } |
|
1005
|
1251 |
|
|
1252 output_buf << "\n" << ends; |
|
581
|
1253 |
|
1005
|
1254 char *msg = output_buf.str (); |
|
|
1255 |
|
1090
|
1256 parse_error ("%s", msg); |
|
1005
|
1257 |
|
|
1258 delete [] msg; |
|
1
|
1259 } |
|
|
1260 |
|
666
|
1261 // Error mesages for mismatched end tokens. |
|
|
1262 |
|
496
|
1263 static void |
|
2805
|
1264 end_error (const char *type, token::end_tok_type ettype, int l, int c) |
|
496
|
1265 { |
|
2805
|
1266 static const char *fmt |
|
|
1267 = "`%s' command matched by `%s' near line %d column %d"; |
|
496
|
1268 |
|
|
1269 switch (ettype) |
|
|
1270 { |
|
|
1271 case token::simple_end: |
|
|
1272 error (fmt, type, "end", l, c); |
|
|
1273 break; |
|
777
|
1274 |
|
496
|
1275 case token::for_end: |
|
|
1276 error (fmt, type, "endfor", l, c); |
|
|
1277 break; |
|
777
|
1278 |
|
496
|
1279 case token::function_end: |
|
|
1280 error (fmt, type, "endfunction", l, c); |
|
|
1281 break; |
|
777
|
1282 |
|
496
|
1283 case token::if_end: |
|
|
1284 error (fmt, type, "endif", l, c); |
|
|
1285 break; |
|
777
|
1286 |
|
496
|
1287 case token::while_end: |
|
|
1288 error (fmt, type, "endwhile", l, c); |
|
|
1289 break; |
|
777
|
1290 |
|
1371
|
1291 case token::unwind_protect_end: |
|
|
1292 error (fmt, type, "end_unwind_protect", l, c); |
|
|
1293 break; |
|
|
1294 |
|
496
|
1295 default: |
|
|
1296 panic_impossible (); |
|
|
1297 break; |
|
|
1298 } |
|
|
1299 } |
|
|
1300 |
|
666
|
1301 // Check to see that end tokens are properly matched. |
|
|
1302 |
|
2857
|
1303 static bool |
|
|
1304 end_token_ok (token *tok, token::end_tok_type expected) |
|
143
|
1305 { |
|
2857
|
1306 bool retval = true; |
|
|
1307 |
|
143
|
1308 token::end_tok_type ettype = tok->ettype (); |
|
2857
|
1309 |
|
143
|
1310 if (ettype != expected && ettype != token::simple_end) |
|
|
1311 { |
|
2857
|
1312 retval = false; |
|
|
1313 |
|
143
|
1314 yyerror ("parse error"); |
|
|
1315 |
|
|
1316 int l = tok->line (); |
|
|
1317 int c = tok->column (); |
|
|
1318 |
|
|
1319 switch (expected) |
|
|
1320 { |
|
|
1321 case token::for_end: |
|
|
1322 end_error ("for", ettype, l, c); |
|
|
1323 break; |
|
777
|
1324 |
|
143
|
1325 case token::function_end: |
|
|
1326 end_error ("function", ettype, l, c); |
|
|
1327 break; |
|
777
|
1328 |
|
143
|
1329 case token::if_end: |
|
|
1330 end_error ("if", ettype, l, c); |
|
|
1331 break; |
|
777
|
1332 |
|
1489
|
1333 case token::try_catch_end: |
|
|
1334 end_error ("try", ettype, l, c); |
|
|
1335 break; |
|
|
1336 |
|
2764
|
1337 case token::switch_end: |
|
|
1338 end_error ("switch", ettype, l, c); |
|
|
1339 break; |
|
|
1340 |
|
1489
|
1341 case token::unwind_protect_end: |
|
|
1342 end_error ("unwind_protect", ettype, l, c); |
|
|
1343 break; |
|
|
1344 |
|
143
|
1345 case token::while_end: |
|
|
1346 end_error ("while", ettype, l, c); |
|
|
1347 break; |
|
777
|
1348 |
|
143
|
1349 default: |
|
|
1350 panic_impossible (); |
|
|
1351 break; |
|
|
1352 } |
|
|
1353 } |
|
2857
|
1354 |
|
|
1355 return retval; |
|
143
|
1356 } |
|
|
1357 |
|
666
|
1358 // Try to figure out early if an expression should become an |
|
1623
|
1359 // assignment to the built-in variable ans. |
|
666
|
1360 // |
|
2375
|
1361 // Need to make sure that the expression is not already an identifier |
|
666
|
1362 // that has a name, or an assignment expression. |
|
|
1363 // |
|
2375
|
1364 // Note that an expression can not be just an identifier now -- it |
|
666
|
1365 // must at least be an index expression (see the definition of the |
|
2375
|
1366 // non-terminal variable above). |
|
666
|
1367 |
|
496
|
1368 static tree_expression * |
|
|
1369 maybe_convert_to_ans_assign (tree_expression *expr) |
|
1
|
1370 { |
|
|
1371 if (expr->is_index_expression ()) |
|
|
1372 { |
|
195
|
1373 expr->mark_for_possible_ans_assign (); |
|
|
1374 return expr; |
|
|
1375 } |
|
|
1376 else if (expr->is_assignment_expression () |
|
|
1377 || expr->is_prefix_expression ()) |
|
|
1378 { |
|
|
1379 return expr; |
|
|
1380 } |
|
|
1381 else |
|
|
1382 { |
|
1266
|
1383 // XXX FIXME XXX -- making ans_id static, passing its address to |
|
|
1384 // tree_simple_assignment_expression along with a flag to not |
|
|
1385 // delete it seems to create a memory leak. Hmm. |
|
|
1386 |
|
2856
|
1387 static symbol_record *sr = global_sym_tab->lookup ("ans", true); |
|
1266
|
1388 tree_identifier *ans_id = new tree_identifier (sr); |
|
1
|
1389 |
|
1607
|
1390 int l = expr->line (); |
|
|
1391 int c = expr->column (); |
|
|
1392 |
|
|
1393 return new tree_simple_assignment_expression (ans_id, expr, 0, 1, l, c); |
|
1
|
1394 } |
|
|
1395 } |
|
|
1396 |
|
666
|
1397 // Maybe print a warning if an assignment expression is used as the |
|
|
1398 // test in a logical expression. |
|
|
1399 |
|
496
|
1400 static void |
|
|
1401 maybe_warn_assign_as_truth_value (tree_expression *expr) |
|
1
|
1402 { |
|
2166
|
1403 if (Vwarn_assign_as_truth_value |
|
1
|
1404 && expr->is_assignment_expression () |
|
2124
|
1405 && expr->is_in_parens () < 2) |
|
1
|
1406 { |
|
|
1407 warning ("suggest parenthesis around assignment used as truth value"); |
|
|
1408 } |
|
|
1409 } |
|
578
|
1410 |
|
2764
|
1411 // Maybe print a warning about switch labels that aren't constants. |
|
|
1412 |
|
|
1413 static void |
|
|
1414 maybe_warn_variable_switch_label (tree_expression *expr) |
|
|
1415 { |
|
|
1416 if (Vwarn_variable_switch_label && ! expr->is_constant ()) |
|
|
1417 { |
|
|
1418 warning ("variable switch label"); |
|
|
1419 } |
|
|
1420 } |
|
|
1421 |
|
1623
|
1422 // Create a plot command. |
|
|
1423 |
|
|
1424 static tree_plot_command * |
|
|
1425 make_plot_command (token *tok, plot_limits *range, subplot_list *list) |
|
|
1426 { |
|
|
1427 if (range) |
|
|
1428 { |
|
|
1429 if (tok->pttype () == token::replot) |
|
|
1430 { |
|
|
1431 yyerror ("cannot specify new ranges with replot"); |
|
|
1432 return 0; |
|
|
1433 } |
|
|
1434 } |
|
|
1435 else if (! list && tok->pttype () != token::replot) |
|
|
1436 { |
|
|
1437 yyerror ("must have something to plot"); |
|
|
1438 return 0; |
|
|
1439 } |
|
|
1440 |
|
2857
|
1441 lexer_flags.plotting = false; |
|
|
1442 lexer_flags.past_plot_range = false; |
|
|
1443 lexer_flags.in_plot_range = false; |
|
|
1444 lexer_flags.in_plot_using = false; |
|
|
1445 lexer_flags.in_plot_style = false; |
|
1623
|
1446 |
|
|
1447 return new tree_plot_command (list, range, tok->pttype ()); |
|
|
1448 } |
|
|
1449 |
|
2533
|
1450 static tree_expression * |
|
|
1451 fold (tree_binary_expression *e) |
|
|
1452 { |
|
|
1453 tree_expression *retval = 0; |
|
|
1454 |
|
|
1455 tree_expression *op1 = e->lhs (); |
|
|
1456 tree_expression *op2 = e->rhs (); |
|
|
1457 |
|
|
1458 if (op1->is_constant () && op2->is_constant ()) |
|
|
1459 { |
|
|
1460 octave_value tmp = e->eval (0); |
|
|
1461 |
|
|
1462 if (! error_state) |
|
|
1463 { |
|
|
1464 tree_constant *tc_retval = new tree_constant (tmp); |
|
|
1465 |
|
|
1466 ostrstream buf; |
|
|
1467 |
|
|
1468 tree_print_code tpc (buf); |
|
|
1469 |
|
|
1470 e->accept (tpc); |
|
|
1471 |
|
|
1472 buf << ends; |
|
|
1473 |
|
|
1474 char *s = buf.str (); |
|
|
1475 |
|
|
1476 tc_retval->stash_original_text (s); |
|
|
1477 |
|
|
1478 delete [] s; |
|
|
1479 |
|
|
1480 delete e; |
|
|
1481 |
|
|
1482 retval = tc_retval; |
|
|
1483 } |
|
|
1484 else |
|
|
1485 delete e; |
|
|
1486 } |
|
|
1487 else |
|
|
1488 retval = e; |
|
|
1489 |
|
|
1490 return retval; |
|
|
1491 } |
|
|
1492 |
|
|
1493 static tree_expression * |
|
|
1494 fold (tree_unary_expression *e) |
|
|
1495 { |
|
|
1496 tree_expression *retval = 0; |
|
|
1497 |
|
|
1498 tree_expression *op1 = e->operand (); |
|
|
1499 |
|
|
1500 if (op1->is_constant ()) |
|
|
1501 { |
|
|
1502 octave_value tmp = e->eval (0); |
|
|
1503 |
|
|
1504 if (! error_state) |
|
|
1505 { |
|
|
1506 tree_constant *tc_retval = new tree_constant (tmp); |
|
|
1507 |
|
|
1508 ostrstream buf; |
|
|
1509 |
|
|
1510 tree_print_code tpc (buf); |
|
|
1511 |
|
|
1512 e->accept (tpc); |
|
|
1513 |
|
|
1514 buf << ends; |
|
|
1515 |
|
|
1516 char *s = buf.str (); |
|
|
1517 |
|
|
1518 tc_retval->stash_original_text (s); |
|
|
1519 |
|
|
1520 delete [] s; |
|
|
1521 |
|
|
1522 delete e; |
|
|
1523 |
|
|
1524 retval = tc_retval; |
|
|
1525 } |
|
|
1526 else |
|
|
1527 delete e; |
|
|
1528 } |
|
|
1529 else |
|
|
1530 retval = e; |
|
|
1531 |
|
|
1532 return retval; |
|
|
1533 } |
|
|
1534 |
|
1623
|
1535 // Finish building a range. |
|
|
1536 |
|
|
1537 static tree_expression * |
|
|
1538 finish_colon_expression (tree_colon_expression *e) |
|
|
1539 { |
|
|
1540 tree_expression *retval = 0; |
|
|
1541 |
|
2533
|
1542 tree_expression *base = e->base (); |
|
|
1543 tree_expression *limit = e->limit (); |
|
|
1544 tree_expression *incr = e->increment (); |
|
|
1545 |
|
|
1546 if (base->is_constant () && limit->is_constant () |
|
|
1547 && (! incr || (incr && incr->is_constant ()))) |
|
1623
|
1548 { |
|
2086
|
1549 octave_value tmp = e->eval (0); |
|
1623
|
1550 |
|
2533
|
1551 if (! error_state) |
|
|
1552 { |
|
|
1553 tree_constant *tc_retval = new tree_constant (tmp); |
|
|
1554 |
|
|
1555 ostrstream buf; |
|
|
1556 |
|
|
1557 tree_print_code tpc (buf); |
|
|
1558 |
|
|
1559 e->accept (tpc); |
|
|
1560 |
|
|
1561 buf << ends; |
|
1623
|
1562 |
|
2533
|
1563 char *s = buf.str (); |
|
|
1564 |
|
|
1565 tc_retval->stash_original_text (s); |
|
|
1566 |
|
|
1567 delete [] s; |
|
|
1568 |
|
|
1569 delete e; |
|
|
1570 |
|
|
1571 retval = tc_retval; |
|
|
1572 } |
|
|
1573 else |
|
|
1574 delete e; |
|
1623
|
1575 } |
|
|
1576 else |
|
|
1577 retval = e; |
|
|
1578 |
|
|
1579 return retval; |
|
|
1580 } |
|
|
1581 |
|
1607
|
1582 // Make a constant. |
|
|
1583 |
|
2375
|
1584 static tree_constant * |
|
1607
|
1585 make_constant (int op, token *tok_val) |
|
|
1586 { |
|
|
1587 int l = tok_val->line (); |
|
|
1588 int c = tok_val->column (); |
|
|
1589 |
|
2375
|
1590 tree_constant *retval; |
|
1607
|
1591 |
|
|
1592 switch (op) |
|
|
1593 { |
|
|
1594 case NUM: |
|
2533
|
1595 { |
|
|
1596 retval = new tree_constant (tok_val->number (), l, c); |
|
|
1597 retval->stash_original_text (tok_val->text_rep ()); |
|
|
1598 } |
|
1607
|
1599 break; |
|
|
1600 |
|
|
1601 case IMAG_NUM: |
|
|
1602 { |
|
|
1603 Complex C (0.0, tok_val->number ()); |
|
2375
|
1604 retval = new tree_constant (C, l, c); |
|
1607
|
1605 retval->stash_original_text (tok_val->text_rep ()); |
|
|
1606 } |
|
|
1607 break; |
|
|
1608 |
|
|
1609 case TEXT: |
|
2375
|
1610 retval = new tree_constant (tok_val->text (), l, c); |
|
1607
|
1611 break; |
|
|
1612 |
|
|
1613 default: |
|
|
1614 panic_impossible (); |
|
|
1615 break; |
|
|
1616 } |
|
|
1617 |
|
|
1618 return retval; |
|
|
1619 } |
|
|
1620 |
|
666
|
1621 // Build a binary expression. |
|
|
1622 |
|
578
|
1623 static tree_expression * |
|
|
1624 make_binary_op (int op, tree_expression *op1, token *tok_val, |
|
|
1625 tree_expression *op2) |
|
|
1626 { |
|
2375
|
1627 tree_binary_expression::type t; |
|
1623
|
1628 |
|
578
|
1629 switch (op) |
|
|
1630 { |
|
|
1631 case POW: |
|
2375
|
1632 t = tree_binary_expression::power; |
|
578
|
1633 break; |
|
777
|
1634 |
|
578
|
1635 case EPOW: |
|
2375
|
1636 t = tree_binary_expression::elem_pow; |
|
578
|
1637 break; |
|
777
|
1638 |
|
578
|
1639 case '+': |
|
2375
|
1640 t = tree_binary_expression::add; |
|
578
|
1641 break; |
|
777
|
1642 |
|
578
|
1643 case '-': |
|
2375
|
1644 t = tree_binary_expression::subtract; |
|
578
|
1645 break; |
|
777
|
1646 |
|
578
|
1647 case '*': |
|
2375
|
1648 t = tree_binary_expression::multiply; |
|
578
|
1649 break; |
|
777
|
1650 |
|
578
|
1651 case '/': |
|
2375
|
1652 t = tree_binary_expression::divide; |
|
578
|
1653 break; |
|
777
|
1654 |
|
578
|
1655 case EMUL: |
|
2375
|
1656 t = tree_binary_expression::el_mul; |
|
578
|
1657 break; |
|
777
|
1658 |
|
578
|
1659 case EDIV: |
|
2375
|
1660 t = tree_binary_expression::el_div; |
|
578
|
1661 break; |
|
777
|
1662 |
|
578
|
1663 case LEFTDIV: |
|
2375
|
1664 t = tree_binary_expression::leftdiv; |
|
578
|
1665 break; |
|
777
|
1666 |
|
578
|
1667 case ELEFTDIV: |
|
2375
|
1668 t = tree_binary_expression::el_leftdiv; |
|
578
|
1669 break; |
|
777
|
1670 |
|
578
|
1671 case EXPR_LT: |
|
2375
|
1672 t = tree_binary_expression::cmp_lt; |
|
578
|
1673 break; |
|
777
|
1674 |
|
578
|
1675 case EXPR_LE: |
|
2375
|
1676 t = tree_binary_expression::cmp_le; |
|
578
|
1677 break; |
|
777
|
1678 |
|
578
|
1679 case EXPR_EQ: |
|
2375
|
1680 t = tree_binary_expression::cmp_eq; |
|
578
|
1681 break; |
|
777
|
1682 |
|
578
|
1683 case EXPR_GE: |
|
2375
|
1684 t = tree_binary_expression::cmp_ge; |
|
578
|
1685 break; |
|
777
|
1686 |
|
578
|
1687 case EXPR_GT: |
|
2375
|
1688 t = tree_binary_expression::cmp_gt; |
|
578
|
1689 break; |
|
777
|
1690 |
|
578
|
1691 case EXPR_NE: |
|
2375
|
1692 t = tree_binary_expression::cmp_ne; |
|
578
|
1693 break; |
|
777
|
1694 |
|
578
|
1695 case EXPR_AND: |
|
2805
|
1696 t = tree_binary_expression::el_and; |
|
578
|
1697 break; |
|
777
|
1698 |
|
578
|
1699 case EXPR_OR: |
|
2805
|
1700 t = tree_binary_expression::el_or; |
|
578
|
1701 break; |
|
777
|
1702 |
|
578
|
1703 default: |
|
|
1704 panic_impossible (); |
|
|
1705 break; |
|
|
1706 } |
|
|
1707 |
|
|
1708 int l = tok_val->line (); |
|
|
1709 int c = tok_val->column (); |
|
|
1710 |
|
2533
|
1711 tree_binary_expression *e |
|
|
1712 = new tree_binary_expression (op1, op2, l, c, t); |
|
1623
|
1713 |
|
2533
|
1714 return fold (e); |
|
578
|
1715 } |
|
|
1716 |
|
2375
|
1717 // Build a boolean expression. |
|
666
|
1718 |
|
578
|
1719 static tree_expression * |
|
2375
|
1720 make_boolean_op (int op, tree_expression *op1, token *tok_val, |
|
|
1721 tree_expression *op2) |
|
578
|
1722 { |
|
2375
|
1723 tree_boolean_expression::type t; |
|
|
1724 |
|
578
|
1725 switch (op) |
|
|
1726 { |
|
2375
|
1727 case EXPR_AND_AND: |
|
2805
|
1728 t = tree_boolean_expression::bool_and; |
|
578
|
1729 break; |
|
777
|
1730 |
|
2375
|
1731 case EXPR_OR_OR: |
|
2805
|
1732 t = tree_boolean_expression::bool_or; |
|
578
|
1733 break; |
|
777
|
1734 |
|
578
|
1735 default: |
|
|
1736 panic_impossible (); |
|
|
1737 break; |
|
|
1738 } |
|
|
1739 |
|
|
1740 int l = tok_val->line (); |
|
|
1741 int c = tok_val->column (); |
|
|
1742 |
|
2533
|
1743 tree_boolean_expression *e |
|
|
1744 = new tree_boolean_expression (op1, op2, l, c, t); |
|
2375
|
1745 |
|
2533
|
1746 return fold (e); |
|
578
|
1747 } |
|
|
1748 |
|
2375
|
1749 // Build a prefix expression. |
|
666
|
1750 |
|
578
|
1751 static tree_expression * |
|
2375
|
1752 make_prefix_op (int op, tree_identifier *op1, token *tok_val) |
|
578
|
1753 { |
|
2375
|
1754 tree_prefix_expression::type t; |
|
|
1755 |
|
578
|
1756 switch (op) |
|
|
1757 { |
|
|
1758 case PLUS_PLUS: |
|
2375
|
1759 t = tree_prefix_expression::increment; |
|
578
|
1760 break; |
|
777
|
1761 |
|
578
|
1762 case MINUS_MINUS: |
|
2375
|
1763 t = tree_prefix_expression::decrement; |
|
578
|
1764 break; |
|
777
|
1765 |
|
578
|
1766 default: |
|
|
1767 panic_impossible (); |
|
|
1768 break; |
|
|
1769 } |
|
|
1770 |
|
|
1771 int l = tok_val->line (); |
|
|
1772 int c = tok_val->column (); |
|
|
1773 |
|
2375
|
1774 return new tree_prefix_expression (op1, l, c, t); |
|
578
|
1775 } |
|
|
1776 |
|
2375
|
1777 // Build a postfix expression. |
|
666
|
1778 |
|
578
|
1779 static tree_expression * |
|
2375
|
1780 make_postfix_op (int op, tree_identifier *op1, token *tok_val) |
|
578
|
1781 { |
|
2375
|
1782 tree_postfix_expression::type t; |
|
1623
|
1783 |
|
578
|
1784 switch (op) |
|
|
1785 { |
|
2375
|
1786 case PLUS_PLUS: |
|
|
1787 t = tree_postfix_expression::increment; |
|
578
|
1788 break; |
|
777
|
1789 |
|
2375
|
1790 case MINUS_MINUS: |
|
|
1791 t = tree_postfix_expression::decrement; |
|
578
|
1792 break; |
|
777
|
1793 |
|
578
|
1794 default: |
|
|
1795 panic_impossible (); |
|
|
1796 break; |
|
|
1797 } |
|
|
1798 |
|
|
1799 int l = tok_val->line (); |
|
|
1800 int c = tok_val->column (); |
|
|
1801 |
|
2375
|
1802 return new tree_postfix_expression (op1, l, c, t); |
|
|
1803 } |
|
|
1804 |
|
|
1805 // Build a unary expression. |
|
|
1806 |
|
|
1807 static tree_expression * |
|
|
1808 make_unary_op (int op, tree_expression *op1, token *tok_val) |
|
|
1809 { |
|
|
1810 tree_unary_expression::type t; |
|
|
1811 |
|
|
1812 switch (op) |
|
|
1813 { |
|
|
1814 case QUOTE: |
|
|
1815 t = tree_unary_expression::hermitian; |
|
|
1816 break; |
|
|
1817 |
|
|
1818 case TRANSPOSE: |
|
|
1819 t = tree_unary_expression::transpose; |
|
|
1820 break; |
|
|
1821 |
|
|
1822 case EXPR_NOT: |
|
2805
|
1823 t = tree_unary_expression::unot; |
|
2375
|
1824 break; |
|
|
1825 |
|
|
1826 case '-': |
|
|
1827 t = tree_unary_expression::uminus; |
|
|
1828 break; |
|
|
1829 |
|
|
1830 default: |
|
|
1831 panic_impossible (); |
|
|
1832 break; |
|
|
1833 } |
|
|
1834 |
|
|
1835 int l = tok_val->line (); |
|
|
1836 int c = tok_val->column (); |
|
|
1837 |
|
2533
|
1838 tree_unary_expression *e |
|
|
1839 = new tree_unary_expression (op1, l, c, t); |
|
1623
|
1840 |
|
2533
|
1841 return fold (e); |
|
1623
|
1842 } |
|
|
1843 |
|
|
1844 // Build an unwind-protect command. |
|
|
1845 |
|
|
1846 static tree_command * |
|
|
1847 make_unwind_command (token *unwind_tok, tree_statement_list *body, |
|
|
1848 tree_statement_list *cleanup, token *end_tok) |
|
|
1849 { |
|
|
1850 tree_command *retval = 0; |
|
|
1851 |
|
2857
|
1852 if (end_token_ok (end_tok, token::unwind_protect_end)) |
|
1623
|
1853 { |
|
|
1854 int l = unwind_tok->line (); |
|
|
1855 int c = unwind_tok->column (); |
|
|
1856 |
|
|
1857 retval = new tree_unwind_protect_command (body, cleanup, l, c); |
|
|
1858 } |
|
|
1859 |
|
|
1860 return retval; |
|
|
1861 } |
|
|
1862 |
|
|
1863 // Build a try-catch command. |
|
|
1864 |
|
|
1865 static tree_command * |
|
|
1866 make_try_command (token *try_tok, tree_statement_list *body, |
|
|
1867 tree_statement_list *cleanup, token *end_tok) |
|
|
1868 { |
|
|
1869 tree_command *retval = 0; |
|
|
1870 |
|
2857
|
1871 if (end_token_ok (end_tok, token::try_catch_end)) |
|
1623
|
1872 { |
|
|
1873 int l = try_tok->line (); |
|
|
1874 int c = try_tok->column (); |
|
|
1875 |
|
|
1876 retval = new tree_try_catch_command (body, cleanup, l, c); |
|
|
1877 } |
|
|
1878 |
|
|
1879 return retval; |
|
|
1880 } |
|
|
1881 |
|
|
1882 // Build a while command. |
|
|
1883 |
|
|
1884 static tree_command * |
|
|
1885 make_while_command (token *while_tok, tree_expression *expr, |
|
|
1886 tree_statement_list *body, token *end_tok) |
|
|
1887 { |
|
|
1888 tree_command *retval = 0; |
|
|
1889 |
|
|
1890 maybe_warn_assign_as_truth_value (expr); |
|
|
1891 |
|
2857
|
1892 if (end_token_ok (end_tok, token::while_end)) |
|
1623
|
1893 { |
|
1826
|
1894 lexer_flags.looping--; |
|
1623
|
1895 |
|
|
1896 int l = while_tok->line (); |
|
|
1897 int c = while_tok->column (); |
|
|
1898 |
|
|
1899 retval = new tree_while_command (expr, body, l, c); |
|
|
1900 } |
|
|
1901 |
|
|
1902 return retval; |
|
|
1903 } |
|
|
1904 |
|
|
1905 // Build a for command. |
|
|
1906 |
|
|
1907 static tree_command * |
|
|
1908 make_for_command (token *for_tok, tree_index_expression *var, |
|
|
1909 tree_expression *expr, tree_statement_list *body, |
|
|
1910 token *end_tok) |
|
|
1911 { |
|
|
1912 tree_command *retval = 0; |
|
|
1913 |
|
2857
|
1914 if (end_token_ok (end_tok, token::for_end)) |
|
1623
|
1915 { |
|
1826
|
1916 lexer_flags.looping--; |
|
1623
|
1917 |
|
|
1918 int l = for_tok->line (); |
|
|
1919 int c = for_tok->column (); |
|
|
1920 |
|
|
1921 retval = new tree_for_command (var, expr, body, l, c); |
|
|
1922 } |
|
|
1923 |
|
|
1924 return retval; |
|
|
1925 } |
|
|
1926 |
|
|
1927 // Build a for command a different way. |
|
|
1928 |
|
|
1929 static tree_command * |
|
1829
|
1930 make_for_command (token *for_tok, tree_matrix_row *mr, |
|
|
1931 tree_expression *expr, tree_statement_list *body, |
|
|
1932 token *end_tok) |
|
1623
|
1933 { |
|
|
1934 tree_command *retval = 0; |
|
|
1935 |
|
2857
|
1936 if (end_token_ok (end_tok, token::for_end)) |
|
1623
|
1937 { |
|
1826
|
1938 lexer_flags.looping--; |
|
1623
|
1939 |
|
1829
|
1940 tree_return_list *id_list = mr->to_return_list (); |
|
1623
|
1941 |
|
|
1942 int l = for_tok->line (); |
|
|
1943 int c = for_tok->column (); |
|
|
1944 |
|
|
1945 retval = new tree_for_command (id_list, expr, body, l, c); |
|
|
1946 } |
|
|
1947 |
|
|
1948 return retval; |
|
|
1949 } |
|
|
1950 |
|
|
1951 // Build a break command. |
|
|
1952 |
|
|
1953 static tree_command * |
|
|
1954 make_break_command (token *break_tok) |
|
|
1955 { |
|
|
1956 tree_command *retval = 0; |
|
|
1957 |
|
2620
|
1958 int l = break_tok->line (); |
|
|
1959 int c = break_tok->column (); |
|
|
1960 |
|
|
1961 if (lexer_flags.looping || lexer_flags.defining_func || reading_script_file) |
|
|
1962 retval = new tree_break_command (l, c); |
|
1623
|
1963 else |
|
2620
|
1964 retval = new tree_no_op_command ("break", l, c); |
|
1623
|
1965 |
|
|
1966 return retval; |
|
|
1967 } |
|
|
1968 |
|
|
1969 // Build a continue command. |
|
|
1970 |
|
|
1971 static tree_command * |
|
|
1972 make_continue_command (token *continue_tok) |
|
|
1973 { |
|
|
1974 tree_command *retval = 0; |
|
|
1975 |
|
2620
|
1976 int l = continue_tok->line (); |
|
|
1977 int c = continue_tok->column (); |
|
|
1978 |
|
|
1979 if (lexer_flags.looping) |
|
|
1980 retval = new tree_continue_command (l, c); |
|
1623
|
1981 else |
|
2620
|
1982 retval = new tree_no_op_command ("continue", l, c); |
|
1623
|
1983 |
|
|
1984 return retval; |
|
|
1985 } |
|
|
1986 |
|
|
1987 // Build a return command. |
|
|
1988 |
|
|
1989 static tree_command * |
|
|
1990 make_return_command (token *return_tok) |
|
|
1991 { |
|
|
1992 tree_command *retval = 0; |
|
|
1993 |
|
2620
|
1994 int l = return_tok->line (); |
|
|
1995 int c = return_tok->column (); |
|
|
1996 |
|
|
1997 if (lexer_flags.defining_func || reading_script_file) |
|
|
1998 retval = new tree_return_command (l, c); |
|
1623
|
1999 else |
|
2620
|
2000 retval = new tree_no_op_command ("return", l, c); |
|
1623
|
2001 |
|
|
2002 return retval; |
|
|
2003 } |
|
|
2004 |
|
|
2005 // Start an if command. |
|
|
2006 |
|
|
2007 static tree_if_command_list * |
|
|
2008 start_if_command (tree_expression *expr, tree_statement_list *list) |
|
|
2009 { |
|
|
2010 maybe_warn_assign_as_truth_value (expr); |
|
|
2011 |
|
|
2012 tree_if_clause *t = new tree_if_clause (expr, list); |
|
|
2013 |
|
|
2014 return new tree_if_command_list (t); |
|
|
2015 } |
|
|
2016 |
|
|
2017 // Finish an if command. |
|
|
2018 |
|
|
2019 static tree_if_command * |
|
|
2020 finish_if_command (token *if_tok, tree_if_command_list *list, |
|
|
2021 token *end_tok) |
|
|
2022 { |
|
|
2023 tree_if_command *retval = 0; |
|
|
2024 |
|
2857
|
2025 if (end_token_ok (end_tok, token::if_end)) |
|
1623
|
2026 { |
|
|
2027 int l = if_tok->line (); |
|
|
2028 int c = if_tok->column (); |
|
|
2029 |
|
|
2030 retval = new tree_if_command (list, l, c); |
|
|
2031 } |
|
|
2032 |
|
|
2033 return retval; |
|
|
2034 } |
|
|
2035 |
|
|
2036 // Build an elseif clause. |
|
|
2037 |
|
|
2038 static tree_if_clause * |
|
|
2039 make_elseif_clause (tree_expression *expr, tree_statement_list *list) |
|
|
2040 { |
|
|
2041 maybe_warn_assign_as_truth_value (expr); |
|
|
2042 |
|
|
2043 return new tree_if_clause (expr, list); |
|
|
2044 } |
|
|
2045 |
|
2764
|
2046 // Finish a switch command. |
|
|
2047 |
|
|
2048 static tree_switch_command * |
|
|
2049 finish_switch_command (token *switch_tok, tree_expression *expr, |
|
|
2050 tree_switch_case_list *list, token *end_tok) |
|
|
2051 { |
|
|
2052 tree_switch_command *retval = 0; |
|
|
2053 |
|
2857
|
2054 if (end_token_ok (end_tok, token::switch_end)) |
|
2764
|
2055 { |
|
|
2056 int l = switch_tok->line (); |
|
|
2057 int c = switch_tok->column (); |
|
|
2058 |
|
|
2059 retval = new tree_switch_command (expr, list, l, c); |
|
|
2060 } |
|
|
2061 |
|
|
2062 return retval; |
|
|
2063 } |
|
|
2064 |
|
|
2065 // Build a switch case. |
|
|
2066 |
|
|
2067 static tree_switch_case * |
|
|
2068 make_switch_case (tree_expression *expr, tree_statement_list *list) |
|
|
2069 { |
|
|
2070 maybe_warn_variable_switch_label (expr); |
|
|
2071 |
|
|
2072 return new tree_switch_case (expr, list); |
|
|
2073 } |
|
|
2074 |
|
1623
|
2075 // Build an assignment to a variable. |
|
|
2076 |
|
|
2077 static tree_expression * |
|
|
2078 make_simple_assignment (tree_index_expression *var, token *eq_tok, |
|
|
2079 tree_expression *expr) |
|
|
2080 { |
|
|
2081 int l = eq_tok->line (); |
|
|
2082 int c = eq_tok->column (); |
|
|
2083 |
|
|
2084 return new tree_simple_assignment_expression (var, expr, 0, 0, l, c); |
|
578
|
2085 } |
|
666
|
2086 |
|
|
2087 // Make an expression that handles assignment of multiple values. |
|
|
2088 |
|
|
2089 static tree_expression * |
|
1829
|
2090 make_multi_val_ret (tree_matrix_row *mr, tree_expression *rhs, token *eq_tok) |
|
666
|
2091 { |
|
|
2092 // Convert the matrix list to a list of identifiers. If that fails, |
|
|
2093 // we can abort here, without losing anything -- no other possible |
|
|
2094 // syntax is valid if we've seen the equals sign as the next token |
|
|
2095 // after the `]'. |
|
|
2096 |
|
|
2097 tree_expression *retval = 0; |
|
|
2098 |
|
1826
|
2099 lexer_flags.maybe_screwed_again--; |
|
666
|
2100 |
|
1829
|
2101 tree_return_list *id_list = mr->to_return_list (); |
|
666
|
2102 |
|
|
2103 if (id_list) |
|
|
2104 { |
|
|
2105 int list_len = id_list->length (); |
|
|
2106 |
|
|
2107 if (list_len == 1) |
|
|
2108 { |
|
|
2109 tree_index_expression *lhs = id_list->remove_front (); |
|
1623
|
2110 |
|
|
2111 int l = eq_tok->line (); |
|
|
2112 int c = eq_tok->column (); |
|
|
2113 |
|
947
|
2114 retval = new tree_simple_assignment_expression (lhs, rhs, |
|
|
2115 0, 0, l, c); |
|
666
|
2116 } |
|
|
2117 else if (list_len > 1) |
|
|
2118 { |
|
|
2119 if (rhs->is_multi_val_ret_expression ()) |
|
|
2120 { |
|
|
2121 tree_multi_val_ret *t = (tree_multi_val_ret *) rhs; |
|
1623
|
2122 |
|
|
2123 int l = eq_tok->line (); |
|
|
2124 int c = eq_tok->column (); |
|
|
2125 |
|
1229
|
2126 retval = new tree_multi_assignment_expression (id_list, t, |
|
|
2127 0, l, c); |
|
666
|
2128 } |
|
|
2129 else |
|
1005
|
2130 yyerror ("RHS must be an expression that returns multiple values"); |
|
666
|
2131 } |
|
|
2132 else |
|
|
2133 panic_impossible (); |
|
|
2134 } |
|
|
2135 else |
|
1005
|
2136 yyerror ("invalid identifier list for assignment"); |
|
666
|
2137 |
|
|
2138 return retval; |
|
|
2139 } |
|
751
|
2140 |
|
1623
|
2141 // Begin defining a function. |
|
|
2142 |
|
|
2143 static tree_function * |
|
|
2144 start_function_def (tree_parameter_list *param_list, |
|
|
2145 tree_statement_list *body) |
|
|
2146 { |
|
|
2147 body->mark_as_function_body (); |
|
|
2148 |
|
|
2149 tree_function *fcn = new tree_function (body, curr_sym_tab); |
|
|
2150 |
|
|
2151 fcn->define_param_list (param_list); |
|
|
2152 |
|
|
2153 return fcn; |
|
|
2154 } |
|
|
2155 |
|
|
2156 // Do most of the work for defining a function. |
|
|
2157 |
|
|
2158 static tree_function * |
|
|
2159 frob_function_def (tree_identifier *id, tree_function *fcn) |
|
|
2160 { |
|
1755
|
2161 string id_name = id->name (); |
|
1623
|
2162 |
|
|
2163 // If input is coming from a file, issue a warning if the name of |
|
|
2164 // the file does not match the name of the function stated in the |
|
|
2165 // file. Matlab doesn't provide a diagnostic (it ignores the stated |
|
|
2166 // name). |
|
|
2167 |
|
|
2168 fcn->stash_function_name (id_name); |
|
|
2169 |
|
|
2170 if (reading_fcn_file) |
|
|
2171 { |
|
1755
|
2172 if (curr_fcn_file_name != id_name) |
|
1623
|
2173 { |
|
2166
|
2174 if (Vwarn_function_name_clash) |
|
1623
|
2175 warning ("function name `%s' does not agree with function\ |
|
1755
|
2176 file name `%s'", id_name.c_str (), curr_fcn_file_full_name.c_str ()); |
|
1623
|
2177 |
|
|
2178 global_sym_tab->rename (id_name, curr_fcn_file_name); |
|
|
2179 |
|
|
2180 if (error_state) |
|
|
2181 return 0; |
|
|
2182 |
|
|
2183 id_name = id->name (); |
|
|
2184 } |
|
|
2185 |
|
|
2186 fcn->stash_function_name (id_name); |
|
|
2187 fcn->stash_fcn_file_name (); |
|
|
2188 fcn->stash_fcn_file_time (time (0)); |
|
|
2189 fcn->mark_as_system_fcn_file (); |
|
|
2190 } |
|
|
2191 else if (! (input_from_tmp_history_file || input_from_startup_file) |
|
|
2192 && reading_script_file |
|
1755
|
2193 && curr_fcn_file_name == id_name) |
|
1623
|
2194 { |
|
|
2195 warning ("function `%s' defined within script file `%s'", |
|
1755
|
2196 id_name.c_str (), curr_fcn_file_full_name.c_str ()); |
|
1623
|
2197 } |
|
|
2198 |
|
|
2199 top_level_sym_tab->clear (id_name); |
|
|
2200 |
|
2856
|
2201 symbol_record *sr = global_sym_tab->lookup (id_name); |
|
2791
|
2202 |
|
|
2203 if (sr) |
|
|
2204 fcn->stash_symtab_ptr (sr); |
|
|
2205 else |
|
|
2206 panic_impossible (); |
|
|
2207 |
|
1623
|
2208 id->define (fcn); |
|
1755
|
2209 |
|
1623
|
2210 id->document (help_buf); |
|
|
2211 |
|
|
2212 return fcn; |
|
|
2213 } |
|
|
2214 |
|
|
2215 // Finish defining a function. |
|
|
2216 |
|
|
2217 static tree_function * |
|
|
2218 finish_function_def (token *var, tree_function *fcn) |
|
|
2219 { |
|
|
2220 symbol_record *sr = var->sym_rec (); |
|
|
2221 |
|
|
2222 int l = var->line (); |
|
|
2223 int c = var->column (); |
|
|
2224 |
|
|
2225 tree_identifier *tmp = new tree_identifier (sr, l, c); |
|
|
2226 |
|
|
2227 tree_parameter_list *tpl = new tree_parameter_list (tmp); |
|
|
2228 |
|
|
2229 tpl->mark_as_formal_parameters (); |
|
|
2230 |
|
|
2231 return fcn->define_ret_list (tpl); |
|
|
2232 } |
|
|
2233 |
|
|
2234 // Finish defining a function a different way. |
|
|
2235 |
|
|
2236 static tree_function * |
|
|
2237 finish_function_def (tree_parameter_list *ret_list, tree_function *fcn) |
|
|
2238 { |
|
|
2239 ret_list->mark_as_formal_parameters (); |
|
|
2240 |
|
|
2241 return fcn->define_ret_list (ret_list); |
|
|
2242 } |
|
|
2243 |
|
2846
|
2244 // Make an index expression. |
|
|
2245 |
|
751
|
2246 static tree_index_expression * |
|
|
2247 make_index_expression (tree_indirect_ref *indir, tree_argument_list *args) |
|
|
2248 { |
|
|
2249 tree_index_expression *retval = 0; |
|
|
2250 |
|
|
2251 int l = indir->line (); |
|
|
2252 int c = indir->column (); |
|
|
2253 |
|
|
2254 if (indir->is_identifier_only ()) |
|
|
2255 { |
|
|
2256 indir->preserve_identifier (); |
|
|
2257 retval = new tree_index_expression (indir->ident (), args, l, c); |
|
|
2258 delete indir; |
|
|
2259 } |
|
|
2260 else |
|
|
2261 retval = new tree_index_expression (indir, args, l, c); |
|
|
2262 |
|
|
2263 return retval; |
|
|
2264 } |
|
1511
|
2265 |
|
2846
|
2266 // Make a declaration command. |
|
|
2267 |
|
|
2268 static tree_decl_command * |
|
|
2269 make_decl_command (int tok, token *tok_val, tree_decl_init_list *lst) |
|
|
2270 { |
|
|
2271 tree_decl_command *retval = 0; |
|
|
2272 |
|
|
2273 int l = tok_val->line (); |
|
|
2274 int c = tok_val->column (); |
|
|
2275 |
|
|
2276 switch (tok) |
|
|
2277 { |
|
|
2278 case GLOBAL: |
|
|
2279 retval = new tree_global_command (lst, l, c); |
|
|
2280 break; |
|
|
2281 |
|
|
2282 case STATIC: |
|
|
2283 if (lexer_flags.defining_func) |
|
|
2284 retval = new tree_static_command (lst, l, c); |
|
|
2285 else |
|
|
2286 { |
|
|
2287 if (reading_script_file) |
|
|
2288 warning ("ignoring static declaration near line %d of file `%s'", |
|
|
2289 l, curr_fcn_file_full_name.c_str ()); |
|
|
2290 else |
|
|
2291 warning ("ignoring static declaration near line %d", l); |
|
|
2292 } |
|
|
2293 break; |
|
|
2294 |
|
|
2295 default: |
|
|
2296 panic_impossible (); |
|
|
2297 break; |
|
|
2298 } |
|
|
2299 |
|
|
2300 return retval; |
|
|
2301 } |
|
|
2302 |
|
1623
|
2303 // Finish building a matrix list. |
|
|
2304 |
|
|
2305 static tree_expression * |
|
1829
|
2306 finish_matrix (tree_matrix *m) |
|
1623
|
2307 { |
|
|
2308 tree_expression *retval = 0; |
|
|
2309 |
|
1826
|
2310 lexer_flags.maybe_screwed_again--; |
|
1623
|
2311 |
|
2533
|
2312 if (m->all_elements_are_constant ()) |
|
1829
|
2313 { |
|
2086
|
2314 octave_value tmp = m->eval (0); |
|
1623
|
2315 |
|
2533
|
2316 if (! error_state) |
|
|
2317 { |
|
|
2318 tree_constant *tc_retval = new tree_constant (tmp); |
|
|
2319 |
|
|
2320 ostrstream buf; |
|
|
2321 |
|
|
2322 tree_print_code tpc (buf); |
|
|
2323 |
|
|
2324 m->accept (tpc); |
|
|
2325 |
|
|
2326 buf << ends; |
|
1623
|
2327 |
|
2533
|
2328 char *s = buf.str (); |
|
|
2329 |
|
|
2330 tc_retval->stash_original_text (s); |
|
|
2331 |
|
|
2332 delete [] s; |
|
|
2333 |
|
|
2334 delete m; |
|
|
2335 |
|
|
2336 retval = tc_retval; |
|
|
2337 } |
|
|
2338 else |
|
|
2339 delete m; |
|
1623
|
2340 } |
|
|
2341 else |
|
1829
|
2342 retval = m; |
|
1623
|
2343 |
|
|
2344 return retval; |
|
|
2345 } |
|
|
2346 |
|
1511
|
2347 static void |
|
|
2348 maybe_warn_missing_semi (tree_statement_list *t) |
|
|
2349 { |
|
2166
|
2350 if (lexer_flags.defining_func && Vwarn_missing_semicolon) |
|
1511
|
2351 { |
|
|
2352 tree_statement *tmp = t->rear(); |
|
1607
|
2353 |
|
1511
|
2354 if (tmp->is_expression ()) |
|
1607
|
2355 warning ("missing semicolon near line %d, column %d in file `%s'", |
|
1755
|
2356 tmp->line (), tmp->column (), |
|
|
2357 curr_fcn_file_full_name.c_str ()); |
|
1511
|
2358 } |
|
|
2359 } |
|
1994
|
2360 |
|
2525
|
2361 static void |
|
|
2362 set_stmt_print_flag (tree_statement_list *list, char sep, |
|
|
2363 bool warn_missing_semi) |
|
|
2364 { |
|
|
2365 switch (sep) |
|
|
2366 { |
|
|
2367 case ';': |
|
|
2368 { |
|
|
2369 tree_statement *tmp = list->rear (); |
|
|
2370 tmp->set_print_flag (0); |
|
|
2371 } |
|
|
2372 break; |
|
|
2373 |
|
|
2374 case 0: |
|
|
2375 case ',': |
|
|
2376 case '\n': |
|
|
2377 if (warn_missing_semi) |
|
|
2378 maybe_warn_missing_semi (list); |
|
|
2379 break; |
|
|
2380 |
|
|
2381 default: |
|
|
2382 warning ("unrecognized separator type!"); |
|
|
2383 break; |
|
|
2384 } |
|
|
2385 } |
|
|
2386 |
|
2166
|
2387 static int |
|
|
2388 warn_assign_as_truth_value (void) |
|
|
2389 { |
|
|
2390 Vwarn_assign_as_truth_value |
|
|
2391 = check_preference ("warn_assign_as_truth_value"); |
|
|
2392 |
|
|
2393 return 0; |
|
|
2394 } |
|
|
2395 |
|
|
2396 static int |
|
|
2397 warn_function_name_clash (void) |
|
|
2398 { |
|
|
2399 Vwarn_function_name_clash = check_preference ("warn_function_name_clash"); |
|
|
2400 |
|
|
2401 return 0; |
|
|
2402 } |
|
|
2403 |
|
|
2404 static int |
|
|
2405 warn_missing_semicolon (void) |
|
|
2406 { |
|
|
2407 Vwarn_missing_semicolon = check_preference ("warn_missing_semicolon"); |
|
|
2408 |
|
|
2409 return 0; |
|
|
2410 } |
|
|
2411 |
|
2764
|
2412 static int |
|
|
2413 warn_variable_switch_label (void) |
|
|
2414 { |
|
|
2415 Vwarn_variable_switch_label |
|
|
2416 = check_preference ("warn_variable_switch_label"); |
|
|
2417 |
|
|
2418 return 0; |
|
|
2419 } |
|
|
2420 |
|
2166
|
2421 void |
|
|
2422 symbols_of_parse (void) |
|
|
2423 { |
|
|
2424 DEFVAR (warn_assign_as_truth_value, 1.0, 0, warn_assign_as_truth_value, |
|
|
2425 "produce warning for assignments used as truth values"); |
|
|
2426 |
|
|
2427 DEFVAR (warn_function_name_clash, 1.0, 0, warn_function_name_clash, |
|
|
2428 "produce warning if function name conflicts with file name"); |
|
|
2429 |
|
|
2430 DEFVAR (warn_missing_semicolon, 0.0, 0, warn_missing_semicolon, |
|
2764
|
2431 "produce a warning if a statement in a function file is not\n\ |
|
2166
|
2432 terminated with a semicolon"); |
|
2764
|
2433 |
|
|
2434 DEFVAR (warn_variable_switch_label, 0.0, 0, warn_variable_switch_label, |
|
|
2435 "produce warning for variables used as switch labels"); |
|
2166
|
2436 } |
|
|
2437 |
|
1994
|
2438 /* |
|
|
2439 ;;; Local Variables: *** |
|
|
2440 ;;; mode: text *** |
|
|
2441 ;;; End: *** |
|
|
2442 */ |
