|
968
|
1 /* lex.l -*- C++ -*- |
|
1
|
2 |
|
1009
|
3 Copyright (C) 1992, 1993, 1994, 1995 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 GNU CC; 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 %s TEXT_FCN |
|
|
24 %s MATRIX |
|
|
25 |
|
|
26 %{ |
|
428
|
27 #define SHORT_CIRCUIT_LOGICALS 1 |
|
1
|
28 |
|
240
|
29 #ifdef HAVE_CONFIG_H |
|
1220
|
30 #include <config.h> |
|
240
|
31 #endif |
|
|
32 |
|
1341
|
33 #include <cctype> |
|
|
34 #include <cstring> |
|
|
35 |
|
973
|
36 #include <strstream.h> |
|
522
|
37 |
|
1
|
38 #include "SLStack.h" |
|
|
39 |
|
1497
|
40 // These would be alphabetical, but y.tab.h must be included before |
|
|
41 // oct-gperf.h and y.tab.h must be included after token.h and the tree |
|
|
42 // class declarations. We can't include y.tab.h in oct-gperf.h |
|
|
43 // because it may not be protected to allow it to be included multiple |
|
|
44 // times. |
|
|
45 |
|
1355
|
46 #include "error.h" |
|
1351
|
47 #include "input.h" |
|
1355
|
48 #include "lex.h" |
|
1670
|
49 #include "toplev.h" |
|
1355
|
50 #include "parse.h" |
|
1
|
51 #include "symtab.h" |
|
1355
|
52 #include "token.h" |
|
1740
|
53 #include "pt-base.h" |
|
|
54 #include "pt-cmd.h" |
|
|
55 #include "pt-const.h" |
|
|
56 #include "pt-exp.h" |
|
|
57 #include "pt-misc.h" |
|
|
58 #include "pt-plot.h" |
|
1355
|
59 #include "user-prefs.h" |
|
|
60 #include "utils.h" |
|
|
61 #include "variables.h" |
|
1
|
62 #include "y.tab.h" |
|
1497
|
63 #include "oct-gperf.h" |
|
1
|
64 |
|
1351
|
65 // Stack to hold tokens so that we can delete them when the parser is |
|
|
66 // reset and avoid growing forever just because we are stashing some |
|
|
67 // information. This has to appear before lex.h is included, because |
|
|
68 // one of the macros defined there uses token_stack. |
|
|
69 static SLStack <token*> token_stack; |
|
|
70 |
|
1
|
71 // Nonzero means we think we are looking at a set command. |
|
|
72 static int doing_set = 0; |
|
|
73 |
|
|
74 // GAG. Stupid kludge so that [[1,2][3,4]] will work. |
|
|
75 static do_comma_insert = 0; |
|
|
76 |
|
|
77 // Brace level count. |
|
|
78 static int braceflag = 0; |
|
|
79 |
|
|
80 // Return transpose or start a string? |
|
240
|
81 int quote_is_transpose = 0; |
|
1
|
82 |
|
440
|
83 // Nonzero means we thing we are looking at the beginning of a |
|
|
84 // function definition. |
|
|
85 int beginning_of_function = 0; |
|
|
86 |
|
1
|
87 // Nonzero means that we should convert spaces to a comma inside a |
|
|
88 // matrix definition. |
|
|
89 static int convert_spaces_to_comma = 1; |
|
|
90 |
|
|
91 // Another context hack, this time for the plot command's `using', |
|
|
92 // `title', and `with' keywords. |
|
|
93 static int cant_be_identifier = 0; |
|
|
94 |
|
985
|
95 #define BRACE 1 |
|
|
96 #define PAREN 2 |
|
|
97 |
|
1088
|
98 // Did eat_whitespace() eat a space or tab, or a newline, or both? |
|
|
99 #define ATE_SPACE_OR_TAB 1 |
|
|
100 #define ATE_NEWLINE 2 |
|
|
101 |
|
1
|
102 // Is the closest nesting level a square brace or a paren? |
|
|
103 // |
|
985
|
104 // BRACE -> spaces are important (they can turn into commas) |
|
|
105 // new lines are important (they can turn into semicolons) |
|
1
|
106 // |
|
985
|
107 // PAREN -> spaces and new lines are not important |
|
|
108 |
|
|
109 static SLStack <int> nesting_level; |
|
1
|
110 |
|
146
|
111 // Forward declarations for functions defined at the bottom of this |
|
|
112 // file. |
|
|
113 |
|
1
|
114 static void do_string_escapes (char *s); |
|
|
115 static void fixup_column_count (char *s); |
|
146
|
116 static void do_comma_insert_check (void); |
|
1
|
117 static int is_plot_keyword (char *s); |
|
|
118 static int is_keyword (char *s); |
|
|
119 static char *plot_style_token (char *s); |
|
|
120 static symbol_record *lookup_identifier (char *s); |
|
|
121 static void grab_help_text (void); |
|
|
122 static int match_any (char c, char *s); |
|
|
123 static int next_token_is_bin_op (int spc_prev, char *yytext); |
|
|
124 static int next_token_is_postfix_unary_op (int spc_prev, char *yytext); |
|
|
125 static char *strip_trailing_whitespace (char *s); |
|
972
|
126 static void handle_number (char *yytext); |
|
975
|
127 static int handle_string (char delim, int text_style = 0); |
|
1001
|
128 static int handle_close_brace (int spc_gobbled); |
|
|
129 static int handle_identifier (char *tok, int spc_gobbled); |
|
1091
|
130 static int have_continuation (int trailing_comments_ok = 1); |
|
|
131 static int have_ellipsis_continuation (int trailing_comments_ok = 1); |
|
1001
|
132 static int eat_whitespace (void); |
|
|
133 static int eat_continuation (void); |
|
1
|
134 |
|
|
135 %} |
|
|
136 |
|
|
137 D [0-9] |
|
|
138 S [ \t] |
|
967
|
139 NL [\n] |
|
|
140 SNL [ \t\n] |
|
1
|
141 EL (\.\.\.) |
|
967
|
142 BS (\\) |
|
|
143 CONT ({EL}|{BS}) |
|
1
|
144 Im [iIjJ] |
|
967
|
145 CCHAR [#%] |
|
|
146 COMMENT ({CCHAR}.*{NL}) |
|
|
147 SNLCMT ({SNL}|{COMMENT}) |
|
|
148 NOTEQ ((~=)|(!=)|(<>)) |
|
|
149 POW ((\*\*)|(\^)) |
|
|
150 EPOW (\.{POW}) |
|
|
151 NOT ((\~)|(\!)) |
|
1
|
152 IDENT ([_a-zA-Z][_a-zA-Z0-9]*) |
|
|
153 EXPON ([DdEe][+-]?{D}+) |
|
968
|
154 NUMBER (({D}+\.?{D}*{EXPON}?)|(\.{D}+{EXPON}?)) |
|
1
|
155 %% |
|
|
156 |
|
968
|
157 %{ |
|
|
158 // Help and other text-style functions are a pain in the ass. This |
|
|
159 // stuff needs to be simplified. May require some changes in the |
|
|
160 // parser too. |
|
|
161 %} |
|
|
162 |
|
967
|
163 <TEXT_FCN>{NL} { |
|
|
164 BEGIN 0; |
|
|
165 current_input_column = 1; |
|
|
166 quote_is_transpose = 0; |
|
|
167 cant_be_identifier = 0; |
|
|
168 convert_spaces_to_comma = 1; |
|
|
169 return '\n'; |
|
|
170 } |
|
1
|
171 |
|
967
|
172 <TEXT_FCN>[\;\,] { |
|
|
173 if (doing_set && strcmp (yytext, ",") == 0) |
|
|
174 { |
|
1060
|
175 TOK_PUSH_AND_RETURN (yytext, TEXT); |
|
967
|
176 } |
|
|
177 else |
|
|
178 { |
|
|
179 BEGIN 0; |
|
|
180 if (strcmp (yytext, ",") == 0) |
|
|
181 TOK_RETURN (','); |
|
|
182 else |
|
|
183 TOK_RETURN (';'); |
|
|
184 } |
|
|
185 } |
|
1
|
186 |
|
975
|
187 <TEXT_FCN>[\"\'] { |
|
|
188 current_input_column++; |
|
|
189 return handle_string (yytext[0], 1); |
|
|
190 } |
|
|
191 |
|
1
|
192 <TEXT_FCN>[^ \t\n\;\,]*{S}* { |
|
1288
|
193 char *tok = strip_trailing_whitespace (yytext); |
|
1060
|
194 TOK_PUSH_AND_RETURN (tok, TEXT); |
|
967
|
195 } |
|
1
|
196 |
|
968
|
197 %{ |
|
1
|
198 // For this and the next two rules, we're looking at ']', and we |
|
971
|
199 // need to know if the next token is `=' or `=='. |
|
1
|
200 // |
|
|
201 // It would have been so much easier if the delimiters were simply |
|
|
202 // different for the expression on the left hand side of the equals |
|
|
203 // operator. |
|
971
|
204 // |
|
|
205 // It's also a pain in the ass to decide whether to insert a comma |
|
|
206 // after seeing a ']' character... |
|
968
|
207 %} |
|
|
208 |
|
967
|
209 <MATRIX>{SNL}*\]{S}* { |
|
1001
|
210 fixup_column_count (yytext); |
|
|
211 int c = yytext[yyleng-1]; |
|
|
212 int cont_is_spc = eat_continuation (); |
|
|
213 int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); |
|
|
214 return handle_close_brace (spc_gobbled); |
|
967
|
215 } |
|
1
|
216 |
|
968
|
217 %{ |
|
1088
|
218 // Commas are element separators in matrix constants. If we don't |
|
|
219 // check for continuations here we can end up inserting too many |
|
|
220 // commas. |
|
968
|
221 %} |
|
|
222 |
|
967
|
223 <MATRIX>{S}*\,{S}* { |
|
1088
|
224 current_input_column += yyleng; |
|
|
225 int tmp = eat_continuation (); |
|
|
226 quote_is_transpose = 0; |
|
|
227 cant_be_identifier = 0; |
|
|
228 convert_spaces_to_comma = 1; |
|
|
229 if (user_pref.whitespace_in_literal_matrix != 2 |
|
|
230 && (tmp & ATE_NEWLINE) == ATE_NEWLINE) |
|
|
231 unput (';'); |
|
|
232 return (','); |
|
967
|
233 } |
|
1
|
234 |
|
968
|
235 %{ |
|
|
236 // In some cases, spaces in matrix constants can turn into commas. |
|
|
237 // If commas are required, spaces are not important in matrix |
|
1088
|
238 // constants so we just eat them. If we don't check for continuations |
|
|
239 // here we can end up inserting too many commas. |
|
968
|
240 %} |
|
430
|
241 |
|
968
|
242 <MATRIX>{S}+ { |
|
1088
|
243 current_input_column += yyleng; |
|
985
|
244 if (user_pref.whitespace_in_literal_matrix != 2) |
|
967
|
245 { |
|
1088
|
246 int tmp = eat_continuation (); |
|
967
|
247 int bin_op = next_token_is_bin_op (1, yytext); |
|
|
248 int postfix_un_op = next_token_is_postfix_unary_op (1, yytext); |
|
|
249 |
|
985
|
250 if (! (postfix_un_op || bin_op || nesting_level.empty ()) |
|
|
251 && nesting_level.top () == BRACE |
|
967
|
252 && convert_spaces_to_comma) |
|
1088
|
253 { |
|
|
254 quote_is_transpose = 0; |
|
|
255 cant_be_identifier = 0; |
|
|
256 convert_spaces_to_comma = 1; |
|
|
257 if ((tmp & ATE_NEWLINE) == ATE_NEWLINE) |
|
|
258 unput (';'); |
|
|
259 return (','); |
|
|
260 } |
|
967
|
261 } |
|
|
262 } |
|
430
|
263 |
|
968
|
264 %{ |
|
1088
|
265 // Semicolons are handled as row seprators in matrix constants. If we |
|
|
266 // don't eat whitespace here we can end up inserting too many |
|
|
267 // semicolons. |
|
968
|
268 %} |
|
|
269 |
|
985
|
270 <MATRIX>{SNLCMT}*;{SNLCMT}* { |
|
967
|
271 fixup_column_count (yytext); |
|
1001
|
272 eat_whitespace (); |
|
967
|
273 quote_is_transpose = 0; |
|
|
274 cant_be_identifier = 0; |
|
|
275 convert_spaces_to_comma = 1; |
|
|
276 return ';'; |
|
|
277 } |
|
|
278 |
|
968
|
279 %{ |
|
1088
|
280 // In some cases, new lines can also become row separators. If we |
|
|
281 // don't eat whitespace here we can end up inserting too many |
|
|
282 // semicolons. |
|
985
|
283 %} |
|
|
284 |
|
|
285 <MATRIX>{SNLCMT}*\n{SNLCMT}* { |
|
1082
|
286 fixup_column_count (yytext); |
|
1088
|
287 eat_whitespace (); |
|
985
|
288 if (user_pref.whitespace_in_literal_matrix != 2) |
|
|
289 { |
|
|
290 quote_is_transpose = 0; |
|
|
291 cant_be_identifier = 0; |
|
|
292 convert_spaces_to_comma = 1; |
|
|
293 |
|
|
294 if (nesting_level.empty ()) |
|
|
295 return LEXICAL_ERROR; |
|
|
296 |
|
|
297 if (nesting_level.top () == BRACE) |
|
|
298 return ';'; |
|
|
299 } |
|
|
300 } |
|
|
301 |
|
|
302 %{ |
|
968
|
303 // Open and close brace are handled differently if we are in the range |
|
|
304 // part of a plot command. |
|
975
|
305 // |
|
968
|
306 %} |
|
1
|
307 |
|
967
|
308 \[{S}* { |
|
1082
|
309 nesting_level.push (BRACE); |
|
975
|
310 |
|
1082
|
311 current_input_column += yyleng; |
|
|
312 quote_is_transpose = 0; |
|
|
313 cant_be_identifier = 0; |
|
|
314 convert_spaces_to_comma = 1; |
|
975
|
315 |
|
|
316 promptflag--; |
|
|
317 eat_whitespace (); |
|
|
318 |
|
967
|
319 if (plotting && ! past_plot_range) |
|
|
320 { |
|
|
321 in_plot_range = 1; |
|
1082
|
322 return OPEN_BRACE; |
|
967
|
323 } |
|
|
324 else |
|
|
325 { |
|
|
326 mlnm.push (1); |
|
|
327 braceflag++; |
|
975
|
328 BEGIN MATRIX; |
|
1082
|
329 return '['; |
|
967
|
330 } |
|
|
331 } |
|
1
|
332 |
|
968
|
333 \] { |
|
985
|
334 if (! nesting_level.empty ()) |
|
|
335 nesting_level.pop (); |
|
968
|
336 |
|
|
337 if (plotting && ! past_plot_range) |
|
|
338 { |
|
|
339 in_plot_range = 0; |
|
|
340 TOK_RETURN (CLOSE_BRACE); |
|
|
341 } |
|
|
342 else |
|
|
343 TOK_RETURN (']'); |
|
|
344 } |
|
|
345 |
|
|
346 %{ |
|
|
347 // Imaginary numbers. |
|
|
348 %} |
|
|
349 |
|
|
350 {NUMBER}{Im} { |
|
972
|
351 handle_number (yytext); |
|
968
|
352 return IMAG_NUM; |
|
|
353 } |
|
|
354 |
|
|
355 %{ |
|
|
356 // Real numbers. Don't grab the `.' part of a dot operator as part of |
|
|
357 // the constant. |
|
|
358 %} |
|
|
359 |
|
|
360 {D}+/\.[\*/\\^'] | |
|
|
361 {NUMBER} { |
|
972
|
362 handle_number (yytext); |
|
968
|
363 return NUM; |
|
|
364 } |
|
|
365 |
|
|
366 %{ |
|
|
367 // Eat whitespace. Whitespace inside matrix constants is handled by |
|
|
368 // the <MATRIX> start state code above. |
|
|
369 %} |
|
|
370 |
|
967
|
371 {S}* { |
|
|
372 current_input_column += yyleng; |
|
|
373 } |
|
|
374 |
|
968
|
375 %{ |
|
|
376 // Continuation lines. Allow comments after continuations. |
|
|
377 %} |
|
|
378 |
|
967
|
379 {CONT}{S}*{NL} | |
|
|
380 {CONT}{S}*{COMMENT} { |
|
|
381 promptflag--; |
|
|
382 current_input_column = 1; |
|
|
383 } |
|
1
|
384 |
|
968
|
385 %{ |
|
|
386 // An ellipsis not at the end of a line is not a continuation, but |
|
|
387 // does have another meaning. |
|
|
388 %} |
|
|
389 |
|
967
|
390 {EL} { |
|
|
391 return ELLIPSIS; |
|
|
392 } |
|
1
|
393 |
|
968
|
394 %{ |
|
|
395 // End of file. |
|
|
396 %} |
|
|
397 |
|
967
|
398 <<EOF>> { |
|
|
399 TOK_RETURN (END_OF_INPUT); |
|
|
400 } |
|
1
|
401 |
|
968
|
402 %{ |
|
970
|
403 // Identifiers. Truncate the token at the first space or tab but |
|
|
404 // don't write directly on yytext. |
|
968
|
405 %} |
|
|
406 |
|
967
|
407 {IDENT}{S}* { |
|
1288
|
408 char *tok = strip_trailing_whitespace (yytext); |
|
1001
|
409 int c = yytext[yyleng-1]; |
|
|
410 int cont_is_spc = eat_continuation (); |
|
|
411 int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); |
|
|
412 return handle_identifier (tok, spc_gobbled); |
|
967
|
413 } |
|
1
|
414 |
|
968
|
415 %{ |
|
|
416 // A new line character. New line characters inside matrix constants |
|
985
|
417 // are handled by the <MATRIX> start state code above. If closest |
|
|
418 // nesting is inside parentheses, don't return a row separator. |
|
968
|
419 %} |
|
|
420 |
|
967
|
421 {NL} { |
|
|
422 quote_is_transpose = 0; |
|
|
423 cant_be_identifier = 0; |
|
|
424 current_input_column = 1; |
|
|
425 convert_spaces_to_comma = 1; |
|
985
|
426 |
|
|
427 if (nesting_level.empty ()) |
|
|
428 return '\n'; |
|
|
429 |
|
|
430 if (nesting_level.top () == BRACE) |
|
|
431 return LEXICAL_ERROR; |
|
967
|
432 } |
|
1
|
433 |
|
968
|
434 %{ |
|
|
435 // Single quote can either be the beginning of a string or a transpose |
|
|
436 // operator. |
|
|
437 %} |
|
|
438 |
|
967
|
439 "'" { |
|
|
440 current_input_column++; |
|
|
441 convert_spaces_to_comma = 1; |
|
1
|
442 |
|
967
|
443 if (quote_is_transpose) |
|
|
444 { |
|
|
445 do_comma_insert_check (); |
|
|
446 return QUOTE; |
|
|
447 } |
|
|
448 else |
|
973
|
449 return handle_string ('\''); |
|
967
|
450 } |
|
1
|
451 |
|
968
|
452 %{ |
|
971
|
453 // Double quotes always begin strings. |
|
|
454 %} |
|
|
455 |
|
973
|
456 \" { |
|
|
457 current_input_column++; |
|
|
458 return handle_string ('"'); |
|
|
459 } |
|
971
|
460 |
|
|
461 %{ |
|
|
462 // The colon operator is handled differently if we are in the range |
|
|
463 // part of a plot command. |
|
968
|
464 %} |
|
|
465 |
|
967
|
466 ":" { |
|
|
467 if (plotting && (in_plot_range || in_plot_using)) |
|
|
468 BIN_OP_RETURN (COLON, 1); |
|
|
469 else |
|
|
470 BIN_OP_RETURN (':', 0); |
|
|
471 } |
|
1
|
472 |
|
968
|
473 %{ |
|
985
|
474 // Gobble comments. If closest nesting is inside parentheses, don't |
|
|
475 // return a new line. |
|
|
476 %} |
|
968
|
477 |
|
967
|
478 {CCHAR} { |
|
1755
|
479 if (help_buf.empty () && beginning_of_function && nesting_level.empty ()) |
|
967
|
480 { |
|
|
481 grab_help_text (); |
|
|
482 beginning_of_function = 0; |
|
|
483 } |
|
|
484 else |
|
|
485 { |
|
|
486 int c; |
|
|
487 while ((c = yyinput ()) != EOF && c != '\n') |
|
|
488 ; // Eat comment. |
|
|
489 } |
|
440
|
490 |
|
967
|
491 quote_is_transpose = 0; |
|
|
492 cant_be_identifier = 0; |
|
|
493 current_input_column = 1; |
|
|
494 convert_spaces_to_comma = 1; |
|
985
|
495 |
|
1566
|
496 if (nesting_level.empty ()) |
|
985
|
497 return '\n'; |
|
1566
|
498 else if (nesting_level.top () == BRACE) |
|
|
499 return ';'; |
|
967
|
500 } |
|
440
|
501 |
|
968
|
502 %{ |
|
|
503 // Other operators. |
|
|
504 %} |
|
|
505 |
|
1276
|
506 ".+" { BIN_OP_RETURN (EPLUS, 0); } |
|
|
507 ".-" { BIN_OP_RETURN (EMINUS, 0); } |
|
143
|
508 ".*" { BIN_OP_RETURN (EMUL, 0); } |
|
|
509 "./" { BIN_OP_RETURN (EDIV, 0); } |
|
|
510 ".\\" { BIN_OP_RETURN (ELEFTDIV, 0); } |
|
967
|
511 {EPOW} { BIN_OP_RETURN (EPOW, 0); } |
|
146
|
512 ".'" { do_comma_insert_check (); BIN_OP_RETURN (TRANSPOSE, 1); } |
|
|
513 "++" { do_comma_insert_check (); BIN_OP_RETURN (PLUS_PLUS, 1); } |
|
|
514 "--" { do_comma_insert_check (); BIN_OP_RETURN (MINUS_MINUS, 1); } |
|
143
|
515 "<=" { BIN_OP_RETURN (EXPR_LE, 0); } |
|
|
516 "==" { BIN_OP_RETURN (EXPR_EQ, 0); } |
|
967
|
517 {NOTEQ} { BIN_OP_RETURN (EXPR_NE, 0); } |
|
143
|
518 ">=" { BIN_OP_RETURN (EXPR_GE, 0); } |
|
|
519 "|" { BIN_OP_RETURN (EXPR_OR, 0); } |
|
|
520 "&" { BIN_OP_RETURN (EXPR_AND, 0); } |
|
|
521 "<" { BIN_OP_RETURN (EXPR_LT, 0); } |
|
|
522 ">" { BIN_OP_RETURN (EXPR_GT, 0); } |
|
|
523 "*" { BIN_OP_RETURN ('*', 0); } |
|
|
524 "/" { BIN_OP_RETURN ('/', 0); } |
|
|
525 "\\" { BIN_OP_RETURN (LEFTDIV, 0); } |
|
|
526 ";" { BIN_OP_RETURN (';', 1); } |
|
|
527 "," { BIN_OP_RETURN (',', 1); } |
|
967
|
528 {POW} { BIN_OP_RETURN (POW, 0); } |
|
143
|
529 "=" { BIN_OP_RETURN ('=', 1); } |
|
967
|
530 |
|
|
531 "||" { |
|
|
532 #ifdef SHORT_CIRCUIT_LOGICALS |
|
|
533 BIN_OP_RETURN (EXPR_OR_OR, 0); |
|
|
534 #else |
|
|
535 BIN_OP_RETURN (EXPR_OR, 0); |
|
|
536 #endif |
|
|
537 } |
|
|
538 |
|
|
539 "&&" { |
|
|
540 #ifdef SHORT_CIRCUIT_LOGICALS |
|
|
541 BIN_OP_RETURN (EXPR_AND_AND, 0); |
|
|
542 #else |
|
|
543 BIN_OP_RETURN (EXPR_AND, 0); |
|
|
544 #endif |
|
|
545 } |
|
|
546 |
|
|
547 {NOT} { |
|
|
548 if (plotting && ! in_plot_range) |
|
|
549 past_plot_range = 1; |
|
|
550 BIN_OP_RETURN (EXPR_NOT, 0); |
|
|
551 } |
|
1
|
552 |
|
1276
|
553 "+" { |
|
967
|
554 if (plotting && ! in_plot_range) |
|
|
555 past_plot_range = 1; |
|
|
556 BIN_OP_RETURN ('+', 0); |
|
|
557 } |
|
|
558 |
|
1276
|
559 "-" { |
|
967
|
560 if (plotting && ! in_plot_range) |
|
|
561 past_plot_range = 1; |
|
|
562 BIN_OP_RETURN ('-', 0); |
|
|
563 } |
|
|
564 |
|
|
565 "(" { |
|
|
566 if (plotting && ! in_plot_range) |
|
|
567 past_plot_range = 1; |
|
985
|
568 nesting_level.push (PAREN); |
|
|
569 promptflag--; |
|
967
|
570 TOK_RETURN ('('); |
|
|
571 } |
|
|
572 |
|
|
573 ")" { |
|
985
|
574 if (! nesting_level.empty ()) |
|
1001
|
575 nesting_level.pop (); |
|
|
576 |
|
967
|
577 current_input_column++; |
|
|
578 cant_be_identifier = 1; |
|
|
579 quote_is_transpose = 1; |
|
985
|
580 convert_spaces_to_comma = (! nesting_level.empty () |
|
|
581 && nesting_level.top () == BRACE); |
|
1001
|
582 do_comma_insert_check (); |
|
967
|
583 return ')'; |
|
|
584 } |
|
|
585 |
|
968
|
586 %{ |
|
1
|
587 // We return everything else as single character tokens, which should |
|
|
588 // eventually result in a parse error. |
|
968
|
589 %} |
|
1
|
590 |
|
968
|
591 . { TOK_RETURN (yytext[0]); } |
|
1
|
592 |
|
|
593 %% |
|
|
594 |
|
767
|
595 // GAG. |
|
|
596 // |
|
|
597 // If we're reading a matrix and the next character is '[', make sure |
|
|
598 // that we insert a comma ahead of it. |
|
|
599 |
|
146
|
600 void |
|
1
|
601 do_comma_insert_check (void) |
|
|
602 { |
|
1001
|
603 int spc_gobbled = eat_continuation (); |
|
1
|
604 int c = yyinput (); |
|
146
|
605 yyunput (c, yytext); |
|
1001
|
606 if (spc_gobbled) |
|
|
607 yyunput (' ', yytext); |
|
1
|
608 do_comma_insert = (braceflag && c == '['); |
|
|
609 } |
|
|
610 |
|
767
|
611 // Fix things up for errors or interrupts. The parser is never called |
|
|
612 // recursively, so it is always safe to reinitialize its state before |
|
|
613 // doing any parsing. |
|
|
614 |
|
1
|
615 void |
|
|
616 reset_parser (void) |
|
|
617 { |
|
287
|
618 // Start off on the right foot. |
|
1
|
619 BEGIN 0; |
|
166
|
620 error_state = 0; |
|
287
|
621 |
|
|
622 // We do want a prompt by default. |
|
1
|
623 promptflag = 1; |
|
287
|
624 |
|
|
625 // Not initially screwed by `function [...] = f (...)' syntax. |
|
1
|
626 maybe_screwed = 0; |
|
|
627 maybe_screwed_again = 0; |
|
287
|
628 |
|
|
629 // Not initially inside a loop or if statement. |
|
1
|
630 looping = 0; |
|
|
631 iffing = 0; |
|
287
|
632 |
|
|
633 // Quote marks strings intially. |
|
|
634 quote_is_transpose = 0; |
|
|
635 |
|
|
636 // Next token can be identifier. |
|
|
637 cant_be_identifier = 0; |
|
|
638 |
|
|
639 // No need to do comma insert or convert spaces to comma at beginning |
|
|
640 // of input. |
|
|
641 do_comma_insert = 0; |
|
|
642 convert_spaces_to_comma = 1; |
|
|
643 |
|
|
644 // Not initially defining a function. |
|
|
645 beginning_of_function = 0; |
|
|
646 defining_func = 0; |
|
|
647 |
|
|
648 // Not initially doing any plotting or setting of plot attributes. |
|
|
649 plotting = 0; |
|
|
650 in_plot_range = 0; |
|
|
651 past_plot_range = 0; |
|
|
652 in_plot_using = 0; |
|
|
653 in_plot_style = 0; |
|
|
654 doing_set = 0; |
|
|
655 |
|
747
|
656 // Not initially looking at indirect references. |
|
|
657 looking_at_indirect_ref = 0; |
|
|
658 |
|
287
|
659 // Error may have occurred inside some parentheses or braces. |
|
985
|
660 nesting_level.clear (); |
|
287
|
661 |
|
|
662 // Not initially defining a matrix list. |
|
|
663 braceflag = 0; |
|
1
|
664 ml.clear (); |
|
|
665 mlnm.clear (); |
|
287
|
666 |
|
|
667 // Clear out the stack of token info used to track line and column |
|
|
668 // numbers. |
|
143
|
669 while (! token_stack.empty ()) |
|
|
670 delete token_stack.pop (); |
|
287
|
671 |
|
|
672 // Can be reset by defining a function. |
|
985
|
673 if (! (reading_script_file || reading_fcn_file)) |
|
|
674 { |
|
|
675 current_input_column = 1; |
|
|
676 input_line_number = current_command_number - 1; |
|
|
677 } |
|
287
|
678 |
|
|
679 // Only ask for input from stdin if we are expecting interactive |
|
|
680 // input. |
|
338
|
681 if (interactive && ! (reading_fcn_file || get_input_from_eval_string)) |
|
287
|
682 yyrestart (stdin); |
|
991
|
683 |
|
1755
|
684 // Clear the buffer for help text. |
|
|
685 |
|
|
686 help_buf.resize (0); |
|
1
|
687 } |
|
|
688 |
|
767
|
689 // Replace backslash escapes in a string with the real values. |
|
|
690 |
|
1
|
691 static void |
|
|
692 do_string_escapes (char *s) |
|
|
693 { |
|
|
694 char *p1 = s; |
|
|
695 char *p2 = s; |
|
|
696 while (*p2 != '\0') |
|
|
697 { |
|
|
698 if (*p2 == '\\' && *(p2+1) != '\0') |
|
|
699 { |
|
|
700 switch (*++p2) |
|
|
701 { |
|
|
702 case 'a': |
|
|
703 *p1 = '\a'; |
|
|
704 break; |
|
777
|
705 |
|
1
|
706 case 'b': // backspace |
|
|
707 *p1 = '\b'; |
|
|
708 break; |
|
777
|
709 |
|
1
|
710 case 'f': // formfeed |
|
|
711 *p1 = '\f'; |
|
|
712 break; |
|
777
|
713 |
|
1
|
714 case 'n': // newline |
|
|
715 *p1 = '\n'; |
|
|
716 break; |
|
777
|
717 |
|
1
|
718 case 'r': // carriage return |
|
|
719 *p1 = '\r'; |
|
|
720 break; |
|
777
|
721 |
|
1
|
722 case 't': // horizontal tab |
|
|
723 *p1 = '\t'; |
|
|
724 break; |
|
777
|
725 |
|
1
|
726 case 'v': // vertical tab |
|
|
727 *p1 = '\v'; |
|
|
728 break; |
|
777
|
729 |
|
1
|
730 case '\\': // backslash |
|
|
731 *p1 = '\\'; |
|
|
732 break; |
|
777
|
733 |
|
1
|
734 case '\'': // quote |
|
|
735 *p1 = '\''; |
|
|
736 break; |
|
777
|
737 |
|
1
|
738 case '"': // double quote |
|
|
739 *p1 = '"'; |
|
|
740 break; |
|
777
|
741 |
|
1
|
742 default: |
|
777
|
743 warning ("unrecognized escape sequence `\\%c' --\ |
|
|
744 converting to `%c'", *p2, *p2); |
|
1
|
745 *p1 = *p2; |
|
|
746 break; |
|
|
747 } |
|
|
748 } |
|
|
749 else |
|
|
750 { |
|
|
751 *p1 = *p2; |
|
|
752 } |
|
|
753 |
|
|
754 p1++; |
|
|
755 p2++; |
|
|
756 } |
|
|
757 |
|
|
758 *p1 = '\0'; |
|
|
759 } |
|
|
760 |
|
767
|
761 // If we read some newlines, we need figure out what column we're |
|
|
762 // really looking at. |
|
|
763 |
|
1
|
764 static void |
|
|
765 fixup_column_count (char *s) |
|
|
766 { |
|
|
767 char c; |
|
|
768 while ((c = *s++) != '\0') |
|
|
769 { |
|
|
770 if (c == '\n') |
|
143
|
771 current_input_column = 1; |
|
1
|
772 else |
|
|
773 current_input_column++; |
|
|
774 } |
|
|
775 } |
|
|
776 |
|
767
|
777 // Include these so that we don't have to link to libfl.a. |
|
246
|
778 |
|
1
|
779 #ifdef yywrap |
|
|
780 #undef yywrap |
|
|
781 #endif |
|
246
|
782 static int |
|
1
|
783 yywrap (void) |
|
|
784 { |
|
287
|
785 return 1; |
|
1
|
786 } |
|
|
787 |
|
767
|
788 // These are not needed with flex-2.4.6, but may be needed with |
|
|
789 // earlier 2.4.x versions. |
|
|
790 |
|
287
|
791 #if 0 |
|
246
|
792 static void * |
|
|
793 yy_flex_alloc (int size) |
|
|
794 { |
|
|
795 return (void *) malloc ((unsigned) size); |
|
|
796 } |
|
|
797 |
|
|
798 static void * |
|
|
799 yy_flex_realloc (void *ptr, int size) |
|
|
800 { |
|
|
801 return (void *) realloc (ptr, (unsigned) size); |
|
|
802 } |
|
|
803 |
|
|
804 static void |
|
|
805 yy_flex_free (void *ptr) |
|
|
806 { |
|
|
807 free (ptr); |
|
|
808 } |
|
287
|
809 #endif |
|
246
|
810 |
|
767
|
811 // Tell us all what the current buffer is. |
|
|
812 |
|
1
|
813 YY_BUFFER_STATE |
|
|
814 current_buffer (void) |
|
|
815 { |
|
|
816 return YY_CURRENT_BUFFER; |
|
|
817 } |
|
|
818 |
|
767
|
819 // Create a new buffer. |
|
|
820 |
|
1
|
821 YY_BUFFER_STATE |
|
|
822 create_buffer (FILE *f) |
|
|
823 { |
|
|
824 return yy_create_buffer (f, YY_BUF_SIZE); |
|
|
825 } |
|
|
826 |
|
767
|
827 // Start reading a new buffer. |
|
|
828 |
|
1
|
829 void |
|
|
830 switch_to_buffer (YY_BUFFER_STATE buf) |
|
|
831 { |
|
|
832 yy_switch_to_buffer (buf); |
|
|
833 } |
|
|
834 |
|
767
|
835 // Delete a buffer. |
|
|
836 |
|
1
|
837 void |
|
|
838 delete_buffer (YY_BUFFER_STATE buf) |
|
|
839 { |
|
|
840 yy_delete_buffer (buf); |
|
|
841 } |
|
|
842 |
|
767
|
843 // Restore a buffer (for unwind-prot). |
|
|
844 |
|
1
|
845 void |
|
|
846 restore_input_buffer (void *buf) |
|
|
847 { |
|
|
848 switch_to_buffer ((YY_BUFFER_STATE) buf); |
|
|
849 } |
|
|
850 |
|
767
|
851 // Delete a buffer (for unwind-prot). |
|
|
852 |
|
1
|
853 void |
|
|
854 delete_input_buffer (void *buf) |
|
|
855 { |
|
|
856 delete_buffer ((YY_BUFFER_STATE) buf); |
|
|
857 } |
|
|
858 |
|
767
|
859 // Check to see if a character string matches any of the possible line |
|
|
860 // styles for plots. |
|
|
861 |
|
1
|
862 static char * |
|
|
863 plot_style_token (char *s) |
|
|
864 { |
|
146
|
865 static char *plot_styles[] = |
|
|
866 { |
|
925
|
867 "boxes", |
|
924
|
868 "boxerrorbars", |
|
146
|
869 "dots", |
|
|
870 "errorbars", |
|
|
871 "impulses", |
|
|
872 "lines", |
|
|
873 "linespoints", |
|
|
874 "points", |
|
926
|
875 "steps", |
|
522
|
876 0, |
|
146
|
877 }; |
|
|
878 |
|
1
|
879 char **tmp = plot_styles; |
|
522
|
880 while (*tmp) |
|
1
|
881 { |
|
|
882 if (almost_match (*tmp, s)) |
|
|
883 return *tmp; |
|
|
884 |
|
|
885 tmp++; |
|
|
886 } |
|
|
887 |
|
522
|
888 return 0; |
|
1
|
889 } |
|
|
890 |
|
767
|
891 // Check to see if a character string matches any one of the plot |
|
941
|
892 // option keywords. Don't match abbreviations for clear, since that's |
|
|
893 // not a gnuplot keyword (users will probably only expect to be able |
|
|
894 // to abbreviate actual gnuplot keywords). |
|
767
|
895 |
|
1
|
896 static int |
|
|
897 is_plot_keyword (char *s) |
|
|
898 { |
|
|
899 if (almost_match ("title", s)) |
|
146
|
900 { |
|
|
901 return TITLE; |
|
|
902 } |
|
1
|
903 else if (almost_match ("using", s)) |
|
146
|
904 { |
|
|
905 in_plot_using = 1; |
|
|
906 return USING; |
|
|
907 } |
|
1
|
908 else if (almost_match ("with", s)) |
|
146
|
909 { |
|
|
910 in_plot_style = 1; |
|
|
911 return WITH; |
|
|
912 } |
|
941
|
913 else if (strcmp ("clear", s) == 0) |
|
883
|
914 { |
|
|
915 return CLEAR; |
|
|
916 } |
|
1
|
917 else |
|
146
|
918 { |
|
|
919 return 0; |
|
|
920 } |
|
1
|
921 } |
|
|
922 |
|
767
|
923 // Handle keywords. Could probably be more efficient... |
|
|
924 |
|
1
|
925 static int |
|
|
926 is_keyword (char *s) |
|
|
927 { |
|
|
928 if (plotting && in_plot_style) |
|
|
929 { |
|
|
930 char *sty = plot_style_token (s); |
|
522
|
931 if (sty) |
|
1
|
932 { |
|
|
933 in_plot_style = 0; |
|
143
|
934 yylval.tok_val = new token (sty); |
|
|
935 token_stack.push (yylval.tok_val); |
|
1
|
936 return STYLE; |
|
|
937 } |
|
|
938 } |
|
|
939 |
|
143
|
940 int l = input_line_number; |
|
|
941 int c = current_input_column; |
|
|
942 |
|
1497
|
943 int len = strlen (s); |
|
922
|
944 |
|
1497
|
945 const octave_kw *kw = octave_kw_lookup (s, len); |
|
191
|
946 |
|
1497
|
947 if (kw) |
|
143
|
948 { |
|
1497
|
949 yylval.tok_val = 0; |
|
|
950 |
|
|
951 switch (kw->kw_id) |
|
|
952 { |
|
|
953 case all_va_args_kw: |
|
|
954 case break_kw: |
|
|
955 case catch_kw: |
|
|
956 case continue_kw: |
|
|
957 case else_kw: |
|
|
958 case elseif_kw: |
|
|
959 case global_kw: |
|
|
960 case return_kw: |
|
|
961 case unwind_protect_cleanup_kw: |
|
|
962 break; |
|
|
963 |
|
|
964 case end_kw: |
|
|
965 yylval.tok_val = new token (token::simple_end, l, c); |
|
|
966 break; |
|
|
967 |
|
|
968 case end_try_catch_kw: |
|
|
969 yylval.tok_val = new token (token::try_catch_end, l, c); |
|
|
970 break; |
|
|
971 |
|
|
972 case end_unwind_protect_kw: |
|
|
973 yylval.tok_val = new token (token::unwind_protect_end, l, c); |
|
|
974 break; |
|
|
975 |
|
|
976 case endfor_kw: |
|
|
977 yylval.tok_val = new token (token::for_end, l, c); |
|
|
978 break; |
|
|
979 |
|
|
980 case endfunction_kw: |
|
|
981 yylval.tok_val = new token (token::function_end, l, c); |
|
|
982 break; |
|
|
983 |
|
|
984 case endif_kw: |
|
|
985 yylval.tok_val = new token (token::if_end, l, c); |
|
|
986 break; |
|
|
987 |
|
|
988 case endwhile_kw: |
|
|
989 yylval.tok_val = new token (token::while_end, l, c); |
|
|
990 break; |
|
|
991 |
|
|
992 case for_kw: |
|
|
993 case while_kw: |
|
|
994 promptflag--; |
|
|
995 looping++; |
|
|
996 break; |
|
|
997 |
|
|
998 case if_kw: |
|
|
999 iffing++; |
|
|
1000 promptflag--; |
|
|
1001 break; |
|
|
1002 |
|
|
1003 case try_kw: |
|
|
1004 case unwind_protect_kw: |
|
|
1005 promptflag--; |
|
|
1006 break; |
|
|
1007 |
|
|
1008 case gplot_kw: |
|
|
1009 plotting = 1; |
|
|
1010 yylval.tok_val = new token (token::two_dee, l, c); |
|
|
1011 break; |
|
|
1012 |
|
|
1013 case gsplot_kw: |
|
|
1014 plotting = 1; |
|
|
1015 yylval.tok_val = new token (token::three_dee, l, c); |
|
|
1016 break; |
|
|
1017 |
|
|
1018 case replot_kw: |
|
|
1019 plotting = 1; |
|
|
1020 yylval.tok_val = new token (token::replot, l, c); |
|
|
1021 break; |
|
|
1022 |
|
|
1023 case function_kw: |
|
|
1024 if (defining_func) |
|
|
1025 { |
|
|
1026 error ("function keyword invalid within a function body"); |
|
|
1027 |
|
|
1028 if ((reading_fcn_file || reading_script_file) |
|
1755
|
1029 && ! curr_fcn_file_name.empty ()) |
|
1497
|
1030 error ("defining new function near line %d of file `%s.m'", |
|
1755
|
1031 input_line_number, curr_fcn_file_name.c_str ()); |
|
1497
|
1032 else |
|
1755
|
1033 error ("defining new function near line %d", |
|
|
1034 input_line_number); |
|
1497
|
1035 |
|
|
1036 return LEXICAL_ERROR; |
|
|
1037 } |
|
|
1038 else |
|
|
1039 { |
|
|
1040 tmp_local_sym_tab = new symbol_table (); |
|
|
1041 curr_sym_tab = tmp_local_sym_tab; |
|
|
1042 defining_func = 1; |
|
|
1043 promptflag--; |
|
|
1044 beginning_of_function = 1; |
|
|
1045 if (! (reading_fcn_file || reading_script_file)) |
|
|
1046 input_line_number = 1; |
|
|
1047 } |
|
|
1048 break; |
|
|
1049 |
|
|
1050 default: |
|
|
1051 panic_impossible (); |
|
|
1052 } |
|
|
1053 |
|
|
1054 if (! yylval.tok_val) |
|
|
1055 yylval.tok_val = new token (l, c); |
|
|
1056 |
|
476
|
1057 token_stack.push (yylval.tok_val); |
|
1497
|
1058 |
|
|
1059 return kw->tok; |
|
143
|
1060 } |
|
1
|
1061 |
|
|
1062 return 0; |
|
|
1063 } |
|
|
1064 |
|
767
|
1065 // Try to find an identifier. All binding to global or builtin |
|
|
1066 // variables occurs when expressions are evaluated. |
|
|
1067 |
|
1
|
1068 static symbol_record * |
|
|
1069 lookup_identifier (char *name) |
|
|
1070 { |
|
|
1071 return curr_sym_tab->lookup (name, 1, 0); |
|
|
1072 } |
|
|
1073 |
|
1019
|
1074 // Grab the help text from an function file. Always overwrites the |
|
|
1075 // current contents of help_buf. |
|
767
|
1076 |
|
1
|
1077 static void |
|
|
1078 grab_help_text (void) |
|
|
1079 { |
|
1755
|
1080 help_buf.resize (0); |
|
1019
|
1081 |
|
|
1082 int in_comment = 1; |
|
|
1083 int c = 0; |
|
1
|
1084 |
|
1019
|
1085 while ((c = yyinput ()) != EOF) |
|
|
1086 { |
|
|
1087 if (in_comment) |
|
1
|
1088 { |
|
1755
|
1089 help_buf += (char) c; |
|
|
1090 |
|
1019
|
1091 if (c == '\n') |
|
|
1092 in_comment = 0; |
|
|
1093 } |
|
|
1094 else |
|
|
1095 { |
|
|
1096 switch (c) |
|
991
|
1097 { |
|
1019
|
1098 case '%': |
|
|
1099 case '#': |
|
|
1100 in_comment = 1; |
|
|
1101 break; |
|
777
|
1102 |
|
1019
|
1103 case ' ': |
|
|
1104 case '\t': |
|
|
1105 break; |
|
777
|
1106 |
|
1019
|
1107 default: |
|
|
1108 goto done; |
|
1
|
1109 } |
|
|
1110 } |
|
1019
|
1111 } |
|
991
|
1112 |
|
1019
|
1113 done: |
|
991
|
1114 |
|
1019
|
1115 if (c) |
|
|
1116 yyunput (c, yytext); |
|
1
|
1117 } |
|
|
1118 |
|
767
|
1119 // Return 1 if the given character matches any character in the given |
|
|
1120 // string. |
|
|
1121 |
|
1
|
1122 static int |
|
|
1123 match_any (char c, char *s) |
|
|
1124 { |
|
|
1125 char tmp; |
|
|
1126 while ((tmp = *s++) != '\0') |
|
|
1127 { |
|
|
1128 if (c == tmp) |
|
|
1129 return 1; |
|
|
1130 } |
|
|
1131 return 0; |
|
|
1132 } |
|
|
1133 |
|
767
|
1134 // Given information about the spacing surrounding an operator, |
|
|
1135 // return 1 if it looks like it should be treated as a binary |
|
|
1136 // operator. For example, |
|
|
1137 // |
|
|
1138 // [ 1 + 2 ] or [ 1+ 2] or [ 1+2 ] ==> binary |
|
|
1139 |
|
1
|
1140 static int |
|
|
1141 looks_like_bin_op (int spc_prev, int spc_next) |
|
|
1142 { |
|
608
|
1143 return ((spc_prev && spc_next) || ! spc_prev); |
|
1
|
1144 } |
|
|
1145 |
|
1488
|
1146 // Duh. This seems to no longer be needed. |
|
|
1147 #if 0 |
|
1
|
1148 static int |
|
|
1149 next_char_is_space (void) |
|
|
1150 { |
|
|
1151 int c = yyinput (); |
|
|
1152 yyunput (c, yytext); |
|
|
1153 return (c == ' ' || c == '\t'); |
|
|
1154 } |
|
1488
|
1155 #endif |
|
1
|
1156 |
|
767
|
1157 // Try to determine if the next token should be treated as a postfix |
|
|
1158 // unary operator. This is ugly, but it seems to do the right thing. |
|
|
1159 |
|
1
|
1160 static int |
|
|
1161 next_token_is_postfix_unary_op (int spc_prev, char *yytext) |
|
|
1162 { |
|
|
1163 int un_op = 0; |
|
|
1164 |
|
|
1165 int c0 = yyinput (); |
|
|
1166 int c1 = yyinput (); |
|
|
1167 |
|
|
1168 yyunput (c1, yytext); |
|
|
1169 yyunput (c0, yytext); |
|
|
1170 |
|
|
1171 int transpose = (c0 == '.' && c1 == '\''); |
|
|
1172 int hermitian = (c0 == '\''); |
|
|
1173 |
|
|
1174 un_op = (transpose || (hermitian && ! spc_prev)); |
|
|
1175 |
|
|
1176 return un_op; |
|
|
1177 } |
|
|
1178 |
|
767
|
1179 // Try to determine if the next token should be treated as a binary |
|
|
1180 // operator. This is even uglier, but it also seems to do the right |
|
1276
|
1181 // thing. Note that it is only necessary to check the spacing for `+' |
|
|
1182 // and `-', since those are the only tokens that can appear as unary |
|
|
1183 // ops too. |
|
1521
|
1184 // |
|
|
1185 // Note that this never returns true for `.', even though it can be a |
|
|
1186 // binary operator (the structure reference thing). The only time |
|
|
1187 // this appears to matter is for things like |
|
|
1188 // |
|
|
1189 // [ a . b ] |
|
|
1190 // |
|
|
1191 // which probably doesn't occur that often, can be worked around by |
|
|
1192 // eliminating the whitespace, putting the expression in parentheses, |
|
|
1193 // or using `whitespace_in_literal_matrix = "ignored"', so I think it |
|
|
1194 // is an acceptable change. It would be quite a bit harder to `fix' |
|
|
1195 // this. (Well, maybe not. the best fix would be to do away with the |
|
|
1196 // specialness of whitespace inside of `[ ... ]'). |
|
1554
|
1197 // |
|
|
1198 // However, we still do check for `.+', `.*', etc. |
|
767
|
1199 |
|
1
|
1200 static int |
|
|
1201 next_token_is_bin_op (int spc_prev, char *yytext) |
|
|
1202 { |
|
|
1203 int bin_op = 0; |
|
|
1204 |
|
|
1205 int c0 = yyinput (); |
|
|
1206 |
|
|
1207 switch (c0) |
|
|
1208 { |
|
777
|
1209 case '+': |
|
|
1210 case '-': |
|
1276
|
1211 { |
|
|
1212 int c1 = yyinput (); |
|
|
1213 yyunput (c1, yytext); |
|
|
1214 int spc_next = (c1 == ' ' || c1 == '\t'); |
|
|
1215 bin_op = looks_like_bin_op (spc_prev, spc_next); |
|
|
1216 } |
|
|
1217 break; |
|
|
1218 |
|
1554
|
1219 case '.': |
|
|
1220 { |
|
|
1221 int c1 = yyinput (); |
|
|
1222 yyunput (c1, yytext); |
|
|
1223 bin_op = match_any (c1, "+-*/\\^"); |
|
|
1224 } |
|
|
1225 break; |
|
|
1226 |
|
777
|
1227 case '/': |
|
|
1228 case ':': |
|
|
1229 case '\\': |
|
|
1230 case '^': |
|
1
|
1231 case '&': |
|
|
1232 case '*': |
|
|
1233 case '|': |
|
|
1234 case '<': |
|
|
1235 case '>': |
|
777
|
1236 case '~': |
|
|
1237 case '!': |
|
|
1238 case '=': |
|
1276
|
1239 bin_op = 1; |
|
1
|
1240 break; |
|
|
1241 |
|
|
1242 default: |
|
1276
|
1243 break; |
|
1
|
1244 } |
|
|
1245 |
|
|
1246 yyunput (c0, yytext); |
|
|
1247 |
|
|
1248 return bin_op; |
|
|
1249 } |
|
|
1250 |
|
767
|
1251 // Used to delete trailing white space from tokens. |
|
|
1252 |
|
146
|
1253 static char * |
|
1
|
1254 strip_trailing_whitespace (char *s) |
|
|
1255 { |
|
1266
|
1256 static char *retval = 0; |
|
|
1257 |
|
|
1258 delete [] retval; |
|
|
1259 |
|
|
1260 retval = strsave (s); |
|
1
|
1261 |
|
|
1262 char *t = strchr (retval, ' '); |
|
522
|
1263 if (t) |
|
1
|
1264 *t = '\0'; |
|
|
1265 |
|
|
1266 t = strchr (retval, '\t'); |
|
522
|
1267 if (t) |
|
1
|
1268 *t = '\0'; |
|
|
1269 |
|
|
1270 return retval; |
|
|
1271 } |
|
|
1272 |
|
1001
|
1273 // Discard whitespace, including comments and continuations. |
|
1088
|
1274 // |
|
|
1275 // Return value is logical OR of the following values: |
|
|
1276 // |
|
|
1277 // ATE_SPACE_OR_TAB : space or tab in input |
|
|
1278 // ATE_NEWLINE : bare new line in input |
|
1001
|
1279 |
|
|
1280 static int |
|
975
|
1281 eat_whitespace (void) |
|
|
1282 { |
|
1001
|
1283 int retval = 0; |
|
975
|
1284 int in_comment = 0; |
|
|
1285 int c; |
|
|
1286 while ((c = yyinput ()) != EOF) |
|
|
1287 { |
|
|
1288 current_input_column++; |
|
|
1289 |
|
|
1290 switch (c) |
|
|
1291 { |
|
|
1292 case ' ': |
|
|
1293 case '\t': |
|
1088
|
1294 retval |= ATE_SPACE_OR_TAB; |
|
975
|
1295 break; |
|
|
1296 |
|
|
1297 case '\n': |
|
1088
|
1298 retval |= ATE_NEWLINE; |
|
975
|
1299 in_comment = 0; |
|
|
1300 current_input_column = 0; |
|
|
1301 break; |
|
|
1302 |
|
|
1303 case '#': |
|
|
1304 case '%': |
|
|
1305 in_comment = 1; |
|
|
1306 break; |
|
|
1307 |
|
1001
|
1308 case '.': |
|
|
1309 if (in_comment) |
|
|
1310 break; |
|
|
1311 else |
|
|
1312 { |
|
|
1313 if (have_ellipsis_continuation ()) |
|
|
1314 break; |
|
|
1315 else |
|
|
1316 goto done; |
|
|
1317 } |
|
|
1318 |
|
|
1319 case '\\': |
|
|
1320 if (in_comment) |
|
|
1321 break; |
|
|
1322 else |
|
|
1323 { |
|
|
1324 if (have_continuation ()) |
|
|
1325 break; |
|
|
1326 else |
|
|
1327 goto done; |
|
|
1328 } |
|
|
1329 |
|
975
|
1330 default: |
|
|
1331 if (in_comment) |
|
|
1332 break; |
|
|
1333 else |
|
|
1334 goto done; |
|
|
1335 } |
|
|
1336 } |
|
|
1337 |
|
|
1338 done: |
|
|
1339 yyunput (c, yytext); |
|
1082
|
1340 current_input_column--; |
|
1001
|
1341 return retval; |
|
975
|
1342 } |
|
|
1343 |
|
|
1344 static void |
|
972
|
1345 handle_number (char *yytext) |
|
|
1346 { |
|
|
1347 double value; |
|
|
1348 int nread = sscanf (yytext, "%lf", &value); |
|
|
1349 |
|
985
|
1350 // If yytext doesn't contain a valid number, we are in deep doo doo. |
|
|
1351 |
|
972
|
1352 assert (nread == 1); |
|
|
1353 |
|
|
1354 quote_is_transpose = 1; |
|
|
1355 cant_be_identifier = 1; |
|
|
1356 convert_spaces_to_comma = 1; |
|
|
1357 |
|
|
1358 if (plotting && ! in_plot_range) |
|
|
1359 past_plot_range = 1; |
|
|
1360 |
|
|
1361 yylval.tok_val = new token (value, yytext, input_line_number, |
|
|
1362 current_input_column); |
|
|
1363 |
|
|
1364 token_stack.push (yylval.tok_val); |
|
|
1365 |
|
|
1366 current_input_column += yyleng; |
|
|
1367 |
|
|
1368 do_comma_insert_check (); |
|
|
1369 } |
|
|
1370 |
|
1001
|
1371 // We have seen a backslash and need to find out if it should be |
|
|
1372 // treated as a continuation character. If so, this eats it, up to |
|
|
1373 // and including the new line character. |
|
|
1374 // |
|
973
|
1375 // Match whitespace only, followed by a comment character or newline. |
|
|
1376 // Once a comment character is found, discard all input until newline. |
|
|
1377 // If non-whitespace characters are found before comment |
|
|
1378 // characters, return 0. Otherwise, return 1. |
|
|
1379 |
|
|
1380 static int |
|
1091
|
1381 have_continuation (int trailing_comments_ok) |
|
973
|
1382 { |
|
|
1383 ostrstream buf; |
|
|
1384 |
|
|
1385 int in_comment = 0; |
|
|
1386 char c; |
|
|
1387 while ((c = yyinput ()) != EOF) |
|
|
1388 { |
|
|
1389 buf << (char) c; |
|
|
1390 |
|
|
1391 switch (c) |
|
|
1392 { |
|
|
1393 case ' ': |
|
|
1394 case '\t': |
|
|
1395 break; |
|
|
1396 |
|
|
1397 case '%': |
|
|
1398 case '#': |
|
1091
|
1399 if (trailing_comments_ok) |
|
|
1400 in_comment = 1; |
|
|
1401 else |
|
|
1402 goto cleanup; |
|
973
|
1403 break; |
|
|
1404 |
|
|
1405 case '\n': |
|
975
|
1406 current_input_column = 0; |
|
1001
|
1407 promptflag--; |
|
973
|
1408 return 1; |
|
|
1409 |
|
|
1410 default: |
|
1091
|
1411 if (! in_comment) |
|
|
1412 goto cleanup; |
|
|
1413 break; |
|
973
|
1414 } |
|
|
1415 } |
|
|
1416 |
|
|
1417 yyunput (c, yytext); |
|
1091
|
1418 return 0; |
|
973
|
1419 |
|
1091
|
1420 cleanup: |
|
|
1421 buf << ends; |
|
|
1422 char *s = buf.str (); |
|
|
1423 if (s) |
|
|
1424 { |
|
|
1425 int len = strlen (s); |
|
|
1426 while (len--) |
|
|
1427 yyunput (s[len], yytext); |
|
|
1428 } |
|
|
1429 delete [] s; |
|
973
|
1430 return 0; |
|
|
1431 } |
|
|
1432 |
|
1001
|
1433 // We have seen a `.' and need to see if it is the start of a |
|
|
1434 // continuation. If so, this eats it, up to and including the new |
|
|
1435 // line character. |
|
|
1436 |
|
973
|
1437 static int |
|
1091
|
1438 have_ellipsis_continuation (int trailing_comments_ok) |
|
973
|
1439 { |
|
|
1440 char c1 = yyinput (); |
|
|
1441 if (c1 == '.') |
|
|
1442 { |
|
|
1443 char c2 = yyinput (); |
|
1091
|
1444 if (c2 == '.' && have_continuation (trailing_comments_ok)) |
|
973
|
1445 return 1; |
|
|
1446 else |
|
|
1447 { |
|
|
1448 yyunput (c2, yytext); |
|
|
1449 yyunput (c1, yytext); |
|
|
1450 } |
|
|
1451 } |
|
|
1452 else |
|
|
1453 yyunput (c1, yytext); |
|
|
1454 |
|
|
1455 return 0; |
|
|
1456 } |
|
|
1457 |
|
1001
|
1458 // See if we have a continuation line. If so, eat it and the leading |
|
|
1459 // whitespace on the next line. |
|
1088
|
1460 // |
|
|
1461 // Return value is the same as described for eat_whitespace(). |
|
1001
|
1462 |
|
|
1463 static int |
|
|
1464 eat_continuation (void) |
|
|
1465 { |
|
|
1466 int retval = 0; |
|
|
1467 int c = yyinput (); |
|
|
1468 if ((c == '.' && have_ellipsis_continuation ()) |
|
|
1469 || (c == '\\' && have_continuation ())) |
|
|
1470 retval = eat_whitespace (); |
|
|
1471 else |
|
|
1472 yyunput (c, yytext); |
|
|
1473 |
|
|
1474 return retval; |
|
|
1475 } |
|
|
1476 |
|
973
|
1477 static int |
|
975
|
1478 handle_string (char delim, int text_style) |
|
973
|
1479 { |
|
|
1480 ostrstream buf; |
|
|
1481 |
|
|
1482 int c; |
|
1031
|
1483 int escape_pending = 0; |
|
973
|
1484 |
|
|
1485 while ((c = yyinput ()) != EOF) |
|
|
1486 { |
|
|
1487 current_input_column++; |
|
|
1488 |
|
|
1489 if (c == '\\') |
|
|
1490 { |
|
1053
|
1491 if (escape_pending) |
|
|
1492 { |
|
|
1493 buf << (char) c; |
|
|
1494 escape_pending = 0; |
|
|
1495 } |
|
|
1496 else |
|
|
1497 { |
|
1091
|
1498 if (have_continuation (0)) |
|
1053
|
1499 escape_pending = 0; |
|
|
1500 else |
|
|
1501 { |
|
|
1502 buf << (char) c; |
|
|
1503 escape_pending = 1; |
|
|
1504 } |
|
|
1505 } |
|
1031
|
1506 continue; |
|
973
|
1507 } |
|
|
1508 else if (c == '.') |
|
|
1509 { |
|
1091
|
1510 if (! have_ellipsis_continuation (0)) |
|
973
|
1511 buf << (char) c; |
|
|
1512 } |
|
|
1513 else if (c == '\n') |
|
|
1514 { |
|
1053
|
1515 error ("unterminated string constant"); |
|
973
|
1516 break; |
|
|
1517 } |
|
|
1518 else if (c == delim) |
|
|
1519 { |
|
1031
|
1520 if (escape_pending) |
|
973
|
1521 buf << (char) c; |
|
|
1522 else |
|
|
1523 { |
|
|
1524 c = yyinput (); |
|
|
1525 if (c == delim) |
|
|
1526 buf << (char) c; |
|
|
1527 else |
|
|
1528 { |
|
|
1529 yyunput (c, yytext); |
|
|
1530 buf << ends; |
|
|
1531 char *tok = buf.str (); |
|
|
1532 do_string_escapes (tok); |
|
975
|
1533 |
|
|
1534 if (text_style && doing_set) |
|
|
1535 { |
|
|
1536 if (tok) |
|
|
1537 { |
|
|
1538 int len = strlen (tok) + 3; |
|
|
1539 char *tmp = tok; |
|
|
1540 tok = new char [len]; |
|
|
1541 tok[0] = delim; |
|
|
1542 strcpy (tok+1, tmp); |
|
|
1543 tok[len-2] = delim; |
|
|
1544 tok[len-1] = '\0'; |
|
|
1545 delete [] tmp; |
|
|
1546 } |
|
|
1547 } |
|
|
1548 else |
|
|
1549 { |
|
|
1550 quote_is_transpose = 1; |
|
|
1551 cant_be_identifier = 1; |
|
|
1552 convert_spaces_to_comma = 1; |
|
|
1553 } |
|
|
1554 |
|
973
|
1555 yylval.tok_val = new token (tok); |
|
|
1556 delete [] tok; |
|
|
1557 token_stack.push (yylval.tok_val); |
|
|
1558 return TEXT; |
|
|
1559 } |
|
|
1560 } |
|
|
1561 } |
|
|
1562 else |
|
|
1563 { |
|
|
1564 buf << (char) c; |
|
|
1565 } |
|
|
1566 |
|
1031
|
1567 escape_pending = 0; |
|
973
|
1568 } |
|
|
1569 |
|
|
1570 return LEXICAL_ERROR; |
|
|
1571 } |
|
|
1572 |
|
971
|
1573 static int |
|
1001
|
1574 handle_close_brace (int spc_gobbled) |
|
971
|
1575 { |
|
985
|
1576 if (! nesting_level.empty ()) |
|
971
|
1577 { |
|
985
|
1578 nesting_level.pop (); |
|
971
|
1579 braceflag--; |
|
|
1580 } |
|
|
1581 |
|
|
1582 if (braceflag == 0) |
|
1001
|
1583 BEGIN 0; |
|
|
1584 |
|
971
|
1585 int c1 = yyinput (); |
|
|
1586 if (c1 == '=') |
|
|
1587 { |
|
|
1588 quote_is_transpose = 0; |
|
|
1589 cant_be_identifier = 0; |
|
|
1590 convert_spaces_to_comma = 1; |
|
|
1591 |
|
|
1592 int c2 = yyinput (); |
|
|
1593 unput (c2); |
|
|
1594 unput (c1); |
|
|
1595 |
|
|
1596 if (c2 != '=' && maybe_screwed_again) |
|
|
1597 return SCREW_TWO; |
|
|
1598 else |
|
|
1599 return ']'; |
|
|
1600 } |
|
|
1601 else |
|
|
1602 { |
|
|
1603 unput (c1); |
|
|
1604 |
|
985
|
1605 if (braceflag && user_pref.whitespace_in_literal_matrix != 2) |
|
971
|
1606 { |
|
1001
|
1607 int bin_op = next_token_is_bin_op (spc_gobbled, yytext); |
|
971
|
1608 int postfix_un_op = next_token_is_postfix_unary_op |
|
1001
|
1609 (spc_gobbled, yytext); |
|
971
|
1610 |
|
|
1611 int other_op = match_any (c1, ",;\n]"); |
|
|
1612 |
|
|
1613 if (! (postfix_un_op || bin_op || other_op |
|
985
|
1614 || nesting_level.empty ()) |
|
|
1615 && nesting_level.top () == BRACE |
|
971
|
1616 && convert_spaces_to_comma) |
|
|
1617 { |
|
|
1618 unput (','); |
|
|
1619 return ']'; |
|
|
1620 } |
|
|
1621 } |
|
|
1622 } |
|
|
1623 |
|
|
1624 quote_is_transpose = 1; |
|
|
1625 cant_be_identifier = 0; |
|
|
1626 convert_spaces_to_comma = 1; |
|
|
1627 return ']'; |
|
|
1628 } |
|
|
1629 |
|
1072
|
1630 static void |
|
|
1631 maybe_unput_comma (int spc_gobbled) |
|
|
1632 { |
|
|
1633 if (user_pref.whitespace_in_literal_matrix != 2 |
|
|
1634 && ! nesting_level.empty () |
|
|
1635 && nesting_level.top () == BRACE) |
|
|
1636 { |
|
|
1637 int bin_op = next_token_is_bin_op (spc_gobbled, yytext); |
|
|
1638 |
|
|
1639 int postfix_un_op = next_token_is_postfix_unary_op (spc_gobbled, |
|
|
1640 yytext); |
|
|
1641 |
|
|
1642 int c1 = yyinput (); |
|
|
1643 int c2 = yyinput (); |
|
|
1644 unput (c2); |
|
|
1645 unput (c1); |
|
|
1646 int sep_op = match_any (c1, ",;\n]"); |
|
|
1647 int dot_op = (c1 == '.' |
|
|
1648 && (isalpha (c2) || isspace (c2) || c2 == '_')); |
|
|
1649 int index_op = (c1 == '(' |
|
|
1650 && (user_pref.whitespace_in_literal_matrix == 0 |
|
|
1651 || ! spc_gobbled)); |
|
|
1652 |
|
|
1653 if (! (postfix_un_op || bin_op || sep_op || dot_op || index_op)) |
|
|
1654 unput (','); |
|
|
1655 } |
|
|
1656 } |
|
|
1657 |
|
767
|
1658 // Figure out exactly what kind of token to return when we have seen |
|
|
1659 // an identifier. Handles keywords. |
|
|
1660 |
|
146
|
1661 static int |
|
1001
|
1662 handle_identifier (char *tok, int spc_gobbled) |
|
146
|
1663 { |
|
883
|
1664 // It is almost always an error for an identifier to be followed |
|
|
1665 // directly by another identifier. Special cases are handled below. |
|
|
1666 |
|
|
1667 cant_be_identifier = 1; |
|
|
1668 |
|
747
|
1669 // If we are expecting a structure element, we just want to return |
|
1072
|
1670 // TEXT_ID, which is a string that is also a valid identifier. But |
|
|
1671 // first, we have to decide whether to insert a comma. |
|
747
|
1672 |
|
|
1673 if (looking_at_indirect_ref) |
|
1072
|
1674 { |
|
|
1675 maybe_unput_comma (spc_gobbled); |
|
|
1676 TOK_PUSH_AND_RETURN (tok, TEXT_ID); |
|
|
1677 } |
|
747
|
1678 |
|
883
|
1679 // If we have a regular keyword, or a plot STYLE, return it. Keywords |
|
|
1680 // can be followed by identifiers (TOK_RETURN handles that). |
|
146
|
1681 |
|
|
1682 int kw_token = is_keyword (tok); |
|
|
1683 if (kw_token) |
|
|
1684 { |
|
|
1685 if (kw_token == STYLE) |
|
|
1686 { |
|
1060
|
1687 current_input_column += yyleng; |
|
146
|
1688 quote_is_transpose = 0; |
|
|
1689 convert_spaces_to_comma = 1; |
|
|
1690 return kw_token; |
|
|
1691 } |
|
|
1692 else |
|
|
1693 TOK_RETURN (kw_token); |
|
|
1694 } |
|
|
1695 |
|
883
|
1696 // See if we have a plot keyword (title, using, with, or clear). |
|
146
|
1697 |
|
941
|
1698 if (plotting) |
|
|
1699 { |
|
146
|
1700 // Yes, we really do need both of these plot_range variables. One |
|
|
1701 // is used to mark when we are past all possiblity of a plot range, |
|
|
1702 // the other is used to mark when we are actually between the square |
|
|
1703 // brackets that surround the range. |
|
|
1704 |
|
941
|
1705 if (! in_plot_range) |
|
|
1706 past_plot_range = 1; |
|
|
1707 |
|
1273
|
1708 // Option keywords can't appear in parentheses or braces. |
|
|
1709 |
|
|
1710 int plot_option_kw = 0; |
|
|
1711 if (nesting_level.empty ()) |
|
|
1712 plot_option_kw = is_plot_keyword (tok); |
|
941
|
1713 |
|
|
1714 if (cant_be_identifier && plot_option_kw) |
|
|
1715 TOK_RETURN (plot_option_kw); |
|
|
1716 } |
|
146
|
1717 |
|
|
1718 // If we are looking at a text style function, set up to gobble its |
|
|
1719 // arguments. These are also reserved words, but only because it |
|
|
1720 // would be very difficult to do anything intelligent with them if |
|
|
1721 // they were not reserved. |
|
|
1722 |
|
|
1723 if (is_text_function_name (tok)) |
|
|
1724 { |
|
|
1725 BEGIN TEXT_FCN; |
|
|
1726 |
|
1420
|
1727 if (strcmp (tok, "set") == 0) |
|
146
|
1728 doing_set = 1; |
|
|
1729 } |
|
|
1730 |
|
1001
|
1731 int c = yyinput (); |
|
|
1732 yyunput (c, yytext); |
|
|
1733 int next_tok_is_eq = (c == '='); |
|
|
1734 |
|
146
|
1735 // Make sure we put the return values of a function in the symbol |
|
|
1736 // table that is local to the function. |
|
|
1737 |
|
|
1738 if (next_tok_is_eq && defining_func && maybe_screwed) |
|
|
1739 curr_sym_tab = tmp_local_sym_tab; |
|
|
1740 |
|
|
1741 // Find the token in the symbol table. |
|
|
1742 |
|
|
1743 yylval.tok_val = new token (lookup_identifier (tok), |
|
|
1744 input_line_number, |
|
|
1745 current_input_column); |
|
|
1746 |
|
|
1747 token_stack.push (yylval.tok_val); |
|
|
1748 |
|
|
1749 // After seeing an identifer, it is ok to convert spaces to a comma |
|
|
1750 // (if needed). |
|
|
1751 |
|
|
1752 convert_spaces_to_comma = 1; |
|
|
1753 |
|
|
1754 // If we are defining a function and we have not seen the parameter |
|
|
1755 // list yet and the next token is `=', return a token that represents |
|
|
1756 // the only return value for the function. For example, |
|
|
1757 // |
|
|
1758 // function SCREW = f (args); |
|
|
1759 // |
|
|
1760 // The variable maybe_screwed is reset in parse.y. |
|
|
1761 |
|
|
1762 if (next_tok_is_eq) |
|
|
1763 { |
|
1060
|
1764 current_input_column += yyleng; |
|
146
|
1765 if (defining_func && maybe_screwed) |
|
|
1766 return SCREW; |
|
|
1767 else |
|
|
1768 return NAME; |
|
|
1769 } |
|
|
1770 |
|
|
1771 // At this point, we are only dealing with identifiers that are not |
|
|
1772 // followed by `=' (if the next token is `=', there is no need to |
|
|
1773 // check to see if we should insert a comma (invalid syntax), or allow |
|
|
1774 // a following `'' to be treated as a transpose (the next token is |
|
|
1775 // `=', so it can't be `''. |
|
|
1776 |
|
|
1777 quote_is_transpose = 1; |
|
|
1778 do_comma_insert_check (); |
|
|
1779 |
|
1072
|
1780 maybe_unput_comma (spc_gobbled); |
|
146
|
1781 |
|
1060
|
1782 current_input_column += yyleng; |
|
146
|
1783 return NAME; |
|
|
1784 } |
|
|
1785 |
|
767
|
1786 // Print a warning if a function file that defines a function has |
|
|
1787 // anything other than comments and whitespace following the END token |
|
|
1788 // that matches the FUNCTION statement. |
|
|
1789 |
|
1
|
1790 void |
|
|
1791 check_for_garbage_after_fcn_def (void) |
|
|
1792 { |
|
|
1793 // By making a newline be the next character to be read, we will force |
|
|
1794 // the parser to return after reading the function. Calling yyunput |
|
|
1795 // with EOF seems not to work... |
|
|
1796 |
|
|
1797 int in_comment = 0; |
|
|
1798 int lineno = input_line_number; |
|
|
1799 int c; |
|
|
1800 while ((c = yyinput ()) != EOF) |
|
|
1801 { |
|
|
1802 switch (c) |
|
|
1803 { |
|
|
1804 case ' ': |
|
|
1805 case '\t': |
|
|
1806 case ';': |
|
|
1807 case ',': |
|
|
1808 break; |
|
777
|
1809 |
|
1
|
1810 case '\n': |
|
|
1811 if (in_comment) |
|
|
1812 in_comment = 0; |
|
|
1813 break; |
|
777
|
1814 |
|
1
|
1815 case '%': |
|
|
1816 case '#': |
|
|
1817 in_comment = 1; |
|
|
1818 break; |
|
777
|
1819 |
|
1
|
1820 default: |
|
|
1821 if (in_comment) |
|
|
1822 break; |
|
|
1823 else |
|
|
1824 { |
|
|
1825 warning ("ignoring trailing garbage after end of function\n\ |
|
1755
|
1826 near line %d of file `%s.m'", lineno, curr_fcn_file_name.c_str ()); |
|
1
|
1827 |
|
|
1828 yyunput ('\n', yytext); |
|
|
1829 return; |
|
|
1830 } |
|
|
1831 } |
|
|
1832 } |
|
|
1833 yyunput ('\n', yytext); |
|
|
1834 } |
|
|
1835 |
|
767
|
1836 /* |
|
|
1837 |
|
|
1838 Maybe someday... |
|
1
|
1839 |
|
|
1840 "+=" return ADD_EQ; |
|
|
1841 "-=" return SUB_EQ; |
|
|
1842 "*=" return MUL_EQ; |
|
|
1843 "/=" return DIV_EQ; |
|
|
1844 "\\=" return LEFTDIV_EQ; |
|
|
1845 ".+=" return ADD_EQ; |
|
|
1846 ".-=" return SUB_EQ; |
|
|
1847 ".*=" return EMUL_EQ; |
|
|
1848 "./=" return EDIV_EQ; |
|
|
1849 ".\\=" return ELEFTDIV_EQ; |
|
|
1850 |
|
|
1851 */ |
