?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
[ruby/etc] bump up to 1.3.1
[ruby-80x24.org.git] / parse.y
blob794c818e34931d8df4421f517d282d4daa79b99d
1 /**********************************************************************
2
3 parse.y -
4
5 $Author$
6 created at: Fri May 28 18:02:42 JST 1993
7
8 Copyright (C) 1993-2007 Yukihiro Matsumoto
9
10 **********************************************************************/
11
12 %{
13
14 #if !YYPURE
15 # error needs pure parser
16 #endif
17 #define YYDEBUG 1
18 #define YYERROR_VERBOSE 1
19 #define YYSTACK_USE_ALLOCA 0
20 #define YYLTYPE rb_code_location_t
21 #define YYLTYPE_IS_DECLARED 1
22
23 #include "ruby/internal/config.h"
24
25 #include <ctype.h>
26 #include <errno.h>
27 #include <stdio.h>
28
29 struct lex_context;
30
31 #include "internal.h"
32 #include "internal/compile.h"
33 #include "internal/compilers.h"
34 #include "internal/complex.h"
35 #include "internal/error.h"
36 #include "internal/hash.h"
37 #include "internal/imemo.h"
38 #include "internal/io.h"
39 #include "internal/numeric.h"
40 #include "internal/parse.h"
41 #include "internal/rational.h"
42 #include "internal/re.h"
43 #include "internal/symbol.h"
44 #include "internal/thread.h"
45 #include "internal/variable.h"
46 #include "node.h"
47 #include "probes.h"
48 #include "regenc.h"
49 #include "ruby/encoding.h"
50 #include "ruby/regex.h"
51 #include "ruby/ruby.h"
52 #include "ruby/st.h"
53 #include "ruby/util.h"
54 #include "ruby/ractor.h"
55 #include "symbol.h"
56
57 enum shareability {
58 shareable_none,
59 shareable_literal,
60 shareable_copy,
61 shareable_everything,
62 };
63
64 struct lex_context {
65 unsigned int in_defined: 1;
66 unsigned int in_kwarg: 1;
67 unsigned int in_argdef: 1;
68 unsigned int in_def: 1;
69 unsigned int in_class: 1;
70 BITFIELD(enum shareability, shareable_constant_value, 2);
71 };
72
73 #include "parse.h"
74
75 #define NO_LEX_CTXT (struct lex_context){0}
76
77 #define AREF(ary, i) RARRAY_AREF(ary, i)
78
79 #ifndef WARN_PAST_SCOPE
80 # define WARN_PAST_SCOPE 0
81 #endif
82
83 #define TAB_WIDTH 8
84
85 #define yydebug (p->debug) /* disable the global variable definition */
86
87 #define YYMALLOC(size) rb_parser_malloc(p, (size))
88 #define YYREALLOC(ptr, size) rb_parser_realloc(p, (ptr), (size))
89 #define YYCALLOC(nelem, size) rb_parser_calloc(p, (nelem), (size))
90 #define YYFREE(ptr) rb_parser_free(p, (ptr))
91 #define YYFPRINTF rb_parser_printf
92 #define YY_LOCATION_PRINT(File, loc) \
93 rb_parser_printf(p, "%d.%d-%d.%d", \
94 (loc).beg_pos.lineno, (loc).beg_pos.column,\
95 (loc).end_pos.lineno, (loc).end_pos.column)
96 #define YYLLOC_DEFAULT(Current, Rhs, N) \
97 do \
98 if (N) \
99 { \
100 (Current).beg_pos = YYRHSLOC(Rhs, 1).beg_pos; \
101 (Current).end_pos = YYRHSLOC(Rhs, N).end_pos; \
102 } \
103 else \
104 { \
105 (Current).beg_pos = YYRHSLOC(Rhs, 0).end_pos; \
106 (Current).end_pos = YYRHSLOC(Rhs, 0).end_pos; \
107 } \
108 while (0)
109 #define YY_(Msgid) \
110 (((Msgid)[0] == 'm') && (strcmp((Msgid), "memory exhausted") == 0) ? \
111 "nesting too deep" : (Msgid))
112
113 #define RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(Current) \
114 rb_parser_set_location_from_strterm_heredoc(p, &p->lex.strterm->u.heredoc, &(Current))
115 #define RUBY_SET_YYLLOC_OF_NONE(Current) \
116 rb_parser_set_location_of_none(p, &(Current))
117 #define RUBY_SET_YYLLOC(Current) \
118 rb_parser_set_location(p, &(Current))
119 #define RUBY_INIT_YYLLOC() \
120 { \
121 {p->ruby_sourceline, (int)(p->lex.ptok - p->lex.pbeg)}, \
122 {p->ruby_sourceline, (int)(p->lex.pcur - p->lex.pbeg)}, \
123 }
124
125 enum lex_state_bits {
126 EXPR_BEG_bit, /* ignore newline, +/- is a sign. */
127 EXPR_END_bit, /* newline significant, +/- is an operator. */
128 EXPR_ENDARG_bit, /* ditto, and unbound braces. */
129 EXPR_ENDFN_bit, /* ditto, and unbound braces. */
130 EXPR_ARG_bit, /* newline significant, +/- is an operator. */
131 EXPR_CMDARG_bit, /* newline significant, +/- is an operator. */
132 EXPR_MID_bit, /* newline significant, +/- is an operator. */
133 EXPR_FNAME_bit, /* ignore newline, no reserved words. */
134 EXPR_DOT_bit, /* right after `.' or `::', no reserved words. */
135 EXPR_CLASS_bit, /* immediate after `class', no here document. */
136 EXPR_LABEL_bit, /* flag bit, label is allowed. */
137 EXPR_LABELED_bit, /* flag bit, just after a label. */
138 EXPR_FITEM_bit, /* symbol literal as FNAME. */
139 EXPR_MAX_STATE
140 };
141 /* examine combinations */
142 enum lex_state_e {
143 #define DEF_EXPR(n) EXPR_##n = (1 << EXPR_##n##_bit)
144 DEF_EXPR(BEG),
145 DEF_EXPR(END),
146 DEF_EXPR(ENDARG),
147 DEF_EXPR(ENDFN),
148 DEF_EXPR(ARG),
149 DEF_EXPR(CMDARG),
150 DEF_EXPR(MID),
151 DEF_EXPR(FNAME),
152 DEF_EXPR(DOT),
153 DEF_EXPR(CLASS),
154 DEF_EXPR(LABEL),
155 DEF_EXPR(LABELED),
156 DEF_EXPR(FITEM),
157 EXPR_VALUE = EXPR_BEG,
158 EXPR_BEG_ANY = (EXPR_BEG | EXPR_MID | EXPR_CLASS),
159 EXPR_ARG_ANY = (EXPR_ARG | EXPR_CMDARG),
160 EXPR_END_ANY = (EXPR_END | EXPR_ENDARG | EXPR_ENDFN),
161 EXPR_NONE = 0
162 };
163 #define IS_lex_state_for(x, ls) ((x) & (ls))
164 #define IS_lex_state_all_for(x, ls) (((x) & (ls)) == (ls))
165 #define IS_lex_state(ls) IS_lex_state_for(p->lex.state, (ls))
166 #define IS_lex_state_all(ls) IS_lex_state_all_for(p->lex.state, (ls))
167
168 # define SET_LEX_STATE(ls) \
169 parser_set_lex_state(p, ls, __LINE__)
170 static inline enum lex_state_e parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line);
171
172 typedef VALUE stack_type;
173
174 static const rb_code_location_t NULL_LOC = { {0, -1}, {0, -1} };
175
176 # define SHOW_BITSTACK(stack, name) (p->debug ? rb_parser_show_bitstack(p, stack, name, __LINE__) : (void)0)
177 # define BITSTACK_PUSH(stack, n) (((p->stack) = ((p->stack)<<1)|((n)&1)), SHOW_BITSTACK(p->stack, #stack"(push)"))
178 # define BITSTACK_POP(stack) (((p->stack) = (p->stack) >> 1), SHOW_BITSTACK(p->stack, #stack"(pop)"))
179 # define BITSTACK_SET_P(stack) (SHOW_BITSTACK(p->stack, #stack), (p->stack)&1)
180 # define BITSTACK_SET(stack, n) ((p->stack)=(n), SHOW_BITSTACK(p->stack, #stack"(set)"))
181
182 /* A flag to identify keyword_do_cond, "do" keyword after condition expression.
183 Examples: `while ... do`, `until ... do`, and `for ... in ... do` */
184 #define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
185 #define COND_POP() BITSTACK_POP(cond_stack)
186 #define COND_P() BITSTACK_SET_P(cond_stack)
187 #define COND_SET(n) BITSTACK_SET(cond_stack, (n))
188
189 /* A flag to identify keyword_do_block; "do" keyword after command_call.
190 Example: `foo 1, 2 do`. */
191 #define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
192 #define CMDARG_POP() BITSTACK_POP(cmdarg_stack)
193 #define CMDARG_P() BITSTACK_SET_P(cmdarg_stack)
194 #define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
195
196 struct vtable {
197 ID *tbl;
198 int pos;
199 int capa;
200 struct vtable *prev;
201 };
202
203 struct local_vars {
204 struct vtable *args;
205 struct vtable *vars;
206 struct vtable *used;
207 # if WARN_PAST_SCOPE
208 struct vtable *past;
209 # endif
210 struct local_vars *prev;
211 # ifndef RIPPER
212 struct {
213 NODE *outer, *inner, *current;
214 } numparam;
215 # endif
216 };
217
218 enum {
219 ORDINAL_PARAM = -1,
220 NO_PARAM = 0,
221 NUMPARAM_MAX = 9,
222 };
223
224 #define NUMPARAM_ID_P(id) numparam_id_p(id)
225 #define NUMPARAM_ID_TO_IDX(id) (unsigned int)(((id) >> ID_SCOPE_SHIFT) - tNUMPARAM_1 + 1)
226 #define NUMPARAM_IDX_TO_ID(idx) TOKEN2LOCALID((tNUMPARAM_1 + (idx) - 1))
227 static int
228 numparam_id_p(ID id)
229 {
230 if (!is_local_id(id)) return 0;
231 unsigned int idx = NUMPARAM_ID_TO_IDX(id);
232 return idx > 0 && idx <= NUMPARAM_MAX;
233 }
234 static void numparam_name(struct parser_params *p, ID id);
235
236 #define DVARS_INHERIT ((void*)1)
237 #define DVARS_TOPSCOPE NULL
238 #define DVARS_TERMINAL_P(tbl) ((tbl) == DVARS_INHERIT || (tbl) == DVARS_TOPSCOPE)
239
240 typedef struct token_info {
241 const char *token;
242 rb_code_position_t beg;
243 int indent;
244 int nonspc;
245 struct token_info *next;
246 } token_info;
247
248 typedef struct rb_strterm_struct rb_strterm_t;
249
250 /*
251 Structure of Lexer Buffer:
252
253 lex.pbeg lex.ptok lex.pcur lex.pend
254 | | | |
255 |------------+------------+------------|
256 |<---------->|
257 token
258 */
259 struct parser_params {
260 rb_imemo_tmpbuf_t *heap;
261
262 YYSTYPE *lval;
263
264 struct {
265 rb_strterm_t *strterm;
266 VALUE (*gets)(struct parser_params*,VALUE);
267 VALUE input;
268 VALUE prevline;
269 VALUE lastline;
270 VALUE nextline;
271 const char *pbeg;
272 const char *pcur;
273 const char *pend;
274 const char *ptok;
275 union {
276 long ptr;
277 VALUE (*call)(VALUE, int);
278 } gets_;
279 enum lex_state_e state;
280 /* track the nest level of any parens "()[]{}" */
281 int paren_nest;
282 /* keep p->lex.paren_nest at the beginning of lambda "->" to detect tLAMBEG and keyword_do_LAMBDA */
283 int lpar_beg;
284 /* track the nest level of only braces "{}" */
285 int brace_nest;
286 } lex;
287 stack_type cond_stack;
288 stack_type cmdarg_stack;
289 int tokidx;
290 int toksiz;
291 int tokline;
292 int heredoc_end;
293 int heredoc_indent;
294 int heredoc_line_indent;
295 char *tokenbuf;
296 struct local_vars *lvtbl;
297 st_table *pvtbl;
298 st_table *pktbl;
299 int line_count;
300 int ruby_sourceline; /* current line no. */
301 const char *ruby_sourcefile; /* current source file */
302 VALUE ruby_sourcefile_string;
303 rb_encoding *enc;
304 token_info *token_info;
305 VALUE case_labels;
306 VALUE compile_option;
307
308 VALUE debug_buffer;
309 VALUE debug_output;
310
311 ID cur_arg;
312
313 rb_ast_t *ast;
314 int node_id;
315
316 int max_numparam;
317
318 struct lex_context ctxt;
319
320 unsigned int command_start:1;
321 unsigned int eofp: 1;
322 unsigned int ruby__end__seen: 1;
323 unsigned int debug: 1;
324 unsigned int has_shebang: 1;
325 unsigned int token_seen: 1;
326 unsigned int token_info_enabled: 1;
327 # if WARN_PAST_SCOPE
328 unsigned int past_scope_enabled: 1;
329 # endif
330 unsigned int error_p: 1;
331 unsigned int cr_seen: 1;
332
333 #ifndef RIPPER
334 /* Ruby core only */
335
336 unsigned int do_print: 1;
337 unsigned int do_loop: 1;
338 unsigned int do_chomp: 1;
339 unsigned int do_split: 1;
340 unsigned int keep_script_lines: 1;
341
342 NODE *eval_tree_begin;
343 NODE *eval_tree;
344 VALUE error_buffer;
345 VALUE debug_lines;
346 const struct rb_iseq_struct *parent_iseq;
347 #else
348 /* Ripper only */
349
350 struct {
351 VALUE token;
352 int line;
353 int col;
354 } delayed;
355
356 VALUE value;
357 VALUE result;
358 VALUE parsing_thread;
359 #endif
360 };
361
362 #define intern_cstr(n,l,en) rb_intern3(n,l,en)
363
364 #define STR_NEW(ptr,len) rb_enc_str_new((ptr),(len),p->enc)
365 #define STR_NEW0() rb_enc_str_new(0,0,p->enc)
366 #define STR_NEW2(ptr) rb_enc_str_new((ptr),strlen(ptr),p->enc)
367 #define STR_NEW3(ptr,len,e,func) parser_str_new((ptr),(len),(e),(func),p->enc)
368 #define TOK_INTERN() intern_cstr(tok(p), toklen(p), p->enc)
369
370 static st_table *
371 push_pvtbl(struct parser_params *p)
372 {
373 st_table *tbl = p->pvtbl;
374 p->pvtbl = st_init_numtable();
375 return tbl;
376 }
377
378 static void
379 pop_pvtbl(struct parser_params *p, st_table *tbl)
380 {
381 st_free_table(p->pvtbl);
382 p->pvtbl = tbl;
383 }
384
385 static st_table *
386 push_pktbl(struct parser_params *p)
387 {
388 st_table *tbl = p->pktbl;
389 p->pktbl = 0;
390 return tbl;
391 }
392
393 static void
394 pop_pktbl(struct parser_params *p, st_table *tbl)
395 {
396 if (p->pktbl) st_free_table(p->pktbl);
397 p->pktbl = tbl;
398 }
399
400 RBIMPL_ATTR_NONNULL((1, 2, 3))
401 static int parser_yyerror(struct parser_params*, const YYLTYPE *yylloc, const char*);
402 RBIMPL_ATTR_NONNULL((1, 2))
403 static int parser_yyerror0(struct parser_params*, const char*);
404 #define yyerror0(msg) parser_yyerror0(p, (msg))
405 #define yyerror1(loc, msg) parser_yyerror(p, (loc), (msg))
406 #define yyerror(yylloc, p, msg) parser_yyerror(p, yylloc, msg)
407 #define token_flush(ptr) ((ptr)->lex.ptok = (ptr)->lex.pcur)
408
409 static void token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc);
410 static void token_info_push(struct parser_params*, const char *token, const rb_code_location_t *loc);
411 static void token_info_pop(struct parser_params*, const char *token, const rb_code_location_t *loc);
412 static void token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc);
413 static void token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos);
414
415 #ifdef RIPPER
416 #define compile_for_eval (0)
417 #else
418 #define compile_for_eval (p->parent_iseq != 0)
419 #endif
420
421 #define token_column ((int)(p->lex.ptok - p->lex.pbeg))
422
423 #define CALL_Q_P(q) ((q) == TOKEN2VAL(tANDDOT))
424 #define NODE_CALL_Q(q) (CALL_Q_P(q) ? NODE_QCALL : NODE_CALL)
425 #define NEW_QCALL(q,r,m,a,loc) NEW_NODE(NODE_CALL_Q(q),r,m,a,loc)
426
427 #define lambda_beginning_p() (p->lex.lpar_beg == p->lex.paren_nest)
428
429 #define ANON_BLOCK_ID '&'
430 #define ANON_REST_ID '*'
431 #define ANON_KEYWORD_REST_ID idPow
432
433 static enum yytokentype yylex(YYSTYPE*, YYLTYPE*, struct parser_params*);
434
435 #ifndef RIPPER
436 static inline void
437 rb_discard_node(struct parser_params *p, NODE *n)
438 {
439 rb_ast_delete_node(p->ast, n);
440 }
441 #endif
442
443 #ifdef RIPPER
444 static inline VALUE
445 add_mark_object(struct parser_params *p, VALUE obj)
446 {
447 if (!SPECIAL_CONST_P(obj)
448 && !RB_TYPE_P(obj, T_NODE) /* Ripper jumbles NODE objects and other objects... */
449 ) {
450 rb_ast_add_mark_object(p->ast, obj);
451 }
452 return obj;
453 }
454 #else
455 static NODE* node_newnode_with_locals(struct parser_params *, enum node_type, VALUE, VALUE, const rb_code_location_t*);
456 #endif
457
458 static NODE* node_newnode(struct parser_params *, enum node_type, VALUE, VALUE, VALUE, const rb_code_location_t*);
459 #define rb_node_newnode(type, a1, a2, a3, loc) node_newnode(p, (type), (a1), (a2), (a3), (loc))
460
461 static NODE *nd_set_loc(NODE *nd, const YYLTYPE *loc);
462
463 static int
464 parser_get_node_id(struct parser_params *p)
465 {
466 int node_id = p->node_id;
467 p->node_id++;
468 return node_id;
469 }
470
471 #ifndef RIPPER
472 static inline void
473 set_line_body(NODE *body, int line)
474 {
475 if (!body) return;
476 switch (nd_type(body)) {
477 case NODE_RESCUE:
478 case NODE_ENSURE:
479 nd_set_line(body, line);
480 }
481 }
482
483 #define yyparse ruby_yyparse
484
485 static NODE* cond(struct parser_params *p, NODE *node, const YYLTYPE *loc);
486 static NODE* method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc);
487 #define new_nil(loc) NEW_NIL(loc)
488 static NODE *new_nil_at(struct parser_params *p, const rb_code_position_t *pos);
489 static NODE *new_if(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*);
490 static NODE *new_unless(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*);
491 static NODE *logop(struct parser_params*,ID,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*);
492
493 static NODE *newline_node(NODE*);
494 static void fixpos(NODE*,NODE*);
495
496 static int value_expr_gen(struct parser_params*,NODE*);
497 static void void_expr(struct parser_params*,NODE*);
498 static NODE *remove_begin(NODE*);
499 static NODE *remove_begin_all(NODE*);
500 #define value_expr(node) value_expr_gen(p, (node))
501 static NODE *void_stmts(struct parser_params*,NODE*);
502 static void reduce_nodes(struct parser_params*,NODE**);
503 static void block_dup_check(struct parser_params*,NODE*,NODE*);
504
505 static NODE *block_append(struct parser_params*,NODE*,NODE*);
506 static NODE *list_append(struct parser_params*,NODE*,NODE*);
507 static NODE *list_concat(NODE*,NODE*);
508 static NODE *arg_append(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
509 static NODE *last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc);
510 static NODE *rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc);
511 static NODE *literal_concat(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
512 static NODE *new_evstr(struct parser_params*,NODE*,const YYLTYPE*);
513 static NODE *new_dstr(struct parser_params*,NODE*,const YYLTYPE*);
514 static NODE *evstr2dstr(struct parser_params*,NODE*);
515 static NODE *splat_array(NODE*);
516 static void mark_lvar_used(struct parser_params *p, NODE *rhs);
517
518 static NODE *call_bin_op(struct parser_params*,NODE*,ID,NODE*,const YYLTYPE*,const YYLTYPE*);
519 static NODE *call_uni_op(struct parser_params*,NODE*,ID,const YYLTYPE*,const YYLTYPE*);
520 static NODE *new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc);
521 static NODE *new_command_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, NODE *block, const YYLTYPE *op_loc, const YYLTYPE *loc);
522 static NODE *method_add_block(struct parser_params*p, NODE *m, NODE *b, const YYLTYPE *loc) {b->nd_iter = m; b->nd_loc = *loc; return b;}
523
524 static bool args_info_empty_p(struct rb_args_info *args);
525 static NODE *new_args(struct parser_params*,NODE*,NODE*,ID,NODE*,NODE*,const YYLTYPE*);
526 static NODE *new_args_tail(struct parser_params*,NODE*,ID,ID,const YYLTYPE*);
527 static NODE *new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc);
528 static NODE *new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, ID rest_arg, NODE *post_args, const YYLTYPE *loc);
529 static NODE *new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc);
530 static NODE *new_find_pattern_tail(struct parser_params *p, ID pre_rest_arg, NODE *args, ID post_rest_arg, const YYLTYPE *loc);
531 static NODE *new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc);
532 static NODE *new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc);
533
534 static NODE *new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc);
535 static NODE *args_with_numbered(struct parser_params*,NODE*,int);
536
537 static VALUE negate_lit(struct parser_params*, VALUE);
538 static NODE *ret_args(struct parser_params*,NODE*);
539 static NODE *arg_blk_pass(NODE*,NODE*);
540 static NODE *new_yield(struct parser_params*,NODE*,const YYLTYPE*);
541 static NODE *dsym_node(struct parser_params*,NODE*,const YYLTYPE*);
542
543 static NODE *gettable(struct parser_params*,ID,const YYLTYPE*);
544 static NODE *assignable(struct parser_params*,ID,NODE*,const YYLTYPE*);
545
546 static NODE *aryset(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
547 static NODE *attrset(struct parser_params*,NODE*,ID,ID,const YYLTYPE*);
548
549 static void rb_backref_error(struct parser_params*,NODE*);
550 static NODE *node_assign(struct parser_params*,NODE*,NODE*,struct lex_context,const YYLTYPE*);
551
552 static NODE *new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc);
553 static NODE *new_ary_op_assign(struct parser_params *p, NODE *ary, NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc);
554 static NODE *new_attr_op_assign(struct parser_params *p, NODE *lhs, ID atype, ID attr, ID op, NODE *rhs, const YYLTYPE *loc);
555 static NODE *new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc);
556 static NODE *new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc);
557
558 static NODE *const_decl(struct parser_params *p, NODE* path, const YYLTYPE *loc);
559
560 static NODE *opt_arg_append(NODE*, NODE*);
561 static NODE *kwd_append(NODE*, NODE*);
562
563 static NODE *new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc);
564 static NODE *new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc);
565
566 static NODE *new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc);
567
568 static NODE *new_regexp(struct parser_params *, NODE *, int, const YYLTYPE *);
569
570 #define make_list(list, loc) ((list) ? (nd_set_loc(list, loc), list) : NEW_ZLIST(loc))
571
572 static NODE *new_xstring(struct parser_params *, NODE *, const YYLTYPE *loc);
573
574 static NODE *symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol);
575
576 static NODE *match_op(struct parser_params*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*);
577
578 static rb_ast_id_table_t *local_tbl(struct parser_params*);
579
580 static VALUE reg_compile(struct parser_params*, VALUE, int);
581 static void reg_fragment_setenc(struct parser_params*, VALUE, int);
582 static int reg_fragment_check(struct parser_params*, VALUE, int);
583 static NODE *reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc);
584
585 static int literal_concat0(struct parser_params *p, VALUE head, VALUE tail);
586 static NODE *heredoc_dedent(struct parser_params*,NODE*);
587
588 static void check_literal_when(struct parser_params *p, NODE *args, const YYLTYPE *loc);
589
590 #define get_id(id) (id)
591 #define get_value(val) (val)
592 #define get_num(num) (num)
593 #else /* RIPPER */
594 #define NODE_RIPPER NODE_CDECL
595 #define NEW_RIPPER(a,b,c,loc) (VALUE)NEW_CDECL(a,b,c,loc)
596
597 static inline int ripper_is_node_yylval(VALUE n);
598
599 static inline VALUE
600 ripper_new_yylval(struct parser_params *p, ID a, VALUE b, VALUE c)
601 {
602 if (ripper_is_node_yylval(c)) c = RNODE(c)->nd_cval;
603 add_mark_object(p, b);
604 add_mark_object(p, c);
605 return NEW_RIPPER(a, b, c, &NULL_LOC);
606 }
607
608 static inline int
609 ripper_is_node_yylval(VALUE n)
610 {
611 return RB_TYPE_P(n, T_NODE) && nd_type_p(RNODE(n), NODE_RIPPER);
612 }
613
614 #define value_expr(node) ((void)(node))
615 #define remove_begin(node) (node)
616 #define void_stmts(p,x) (x)
617 #define rb_dvar_defined(id, base) 0
618 #define rb_local_defined(id, base) 0
619 static ID ripper_get_id(VALUE);
620 #define get_id(id) ripper_get_id(id)
621 static VALUE ripper_get_value(VALUE);
622 #define get_value(val) ripper_get_value(val)
623 #define get_num(num) (int)get_id(num)
624 static VALUE assignable(struct parser_params*,VALUE);
625 static int id_is_var(struct parser_params *p, ID id);
626
627 #define method_cond(p,node,loc) (node)
628 #define call_bin_op(p, recv,id,arg1,op_loc,loc) dispatch3(binary, (recv), STATIC_ID2SYM(id), (arg1))
629 #define match_op(p,node1,node2,op_loc,loc) call_bin_op(0, (node1), idEqTilde, (node2), op_loc, loc)
630 #define call_uni_op(p, recv,id,op_loc,loc) dispatch2(unary, STATIC_ID2SYM(id), (recv))
631 #define logop(p,id,node1,node2,op_loc,loc) call_bin_op(0, (node1), (id), (node2), op_loc, loc)
632
633 #define new_nil(loc) Qnil
634
635 static VALUE new_regexp(struct parser_params *, VALUE, VALUE, const YYLTYPE *);
636
637 static VALUE const_decl(struct parser_params *p, VALUE path);
638
639 static VALUE var_field(struct parser_params *p, VALUE a);
640 static VALUE assign_error(struct parser_params *p, const char *mesg, VALUE a);
641
642 static VALUE parser_reg_compile(struct parser_params*, VALUE, int, VALUE *);
643
644 static VALUE backref_error(struct parser_params*, NODE *, VALUE);
645 #endif /* !RIPPER */
646
647 /* forward declaration */
648 typedef struct rb_strterm_heredoc_struct rb_strterm_heredoc_t;
649
650 RUBY_SYMBOL_EXPORT_BEGIN
651 VALUE rb_parser_reg_compile(struct parser_params* p, VALUE str, int options);
652 int rb_reg_fragment_setenc(struct parser_params*, VALUE, int);
653 enum lex_state_e rb_parser_trace_lex_state(struct parser_params *, enum lex_state_e, enum lex_state_e, int);
654 VALUE rb_parser_lex_state_name(enum lex_state_e state);
655 void rb_parser_show_bitstack(struct parser_params *, stack_type, const char *, int);
656 PRINTF_ARGS(void rb_parser_fatal(struct parser_params *p, const char *fmt, ...), 2, 3);
657 YYLTYPE *rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc);
658 YYLTYPE *rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc);
659 YYLTYPE *rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc);
660 RUBY_SYMBOL_EXPORT_END
661
662 static void error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc);
663 static void error_duplicate_pattern_key(struct parser_params *p, ID id, const YYLTYPE *loc);
664 #ifndef RIPPER
665 static ID formal_argument(struct parser_params*, ID);
666 #else
667 static ID formal_argument(struct parser_params*, VALUE);
668 #endif
669 static ID shadowing_lvar(struct parser_params*,ID);
670 static void new_bv(struct parser_params*,ID);
671
672 static void local_push(struct parser_params*,int);
673 static void local_pop(struct parser_params*);
674 static void local_var(struct parser_params*, ID);
675 static void arg_var(struct parser_params*, ID);
676 static int local_id(struct parser_params *p, ID id);
677 static int local_id_ref(struct parser_params*, ID, ID **);
678 #ifndef RIPPER
679 static ID internal_id(struct parser_params*);
680 static NODE *new_args_forward_call(struct parser_params*, NODE*, const YYLTYPE*, const YYLTYPE*);
681 #endif
682 static int check_forwarding_args(struct parser_params*);
683 static void add_forwarding_args(struct parser_params *p);
684
685 static const struct vtable *dyna_push(struct parser_params *);
686 static void dyna_pop(struct parser_params*, const struct vtable *);
687 static int dyna_in_block(struct parser_params*);
688 #define dyna_var(p, id) local_var(p, id)
689 static int dvar_defined(struct parser_params*, ID);
690 static int dvar_defined_ref(struct parser_params*, ID, ID**);
691 static int dvar_curr(struct parser_params*,ID);
692
693 static int lvar_defined(struct parser_params*, ID);
694
695 static NODE *numparam_push(struct parser_params *p);
696 static void numparam_pop(struct parser_params *p, NODE *prev_inner);
697
698 #ifdef RIPPER
699 # define METHOD_NOT idNOT
700 #else
701 # define METHOD_NOT '!'
702 #endif
703
704 #define idFWD_REST '*'
705 #ifdef RUBY3_KEYWORDS
706 #define idFWD_KWREST idPow /* Use simple "**", as tDSTAR is "**arg" */
707 #else
708 #define idFWD_KWREST 0
709 #endif
710 #define idFWD_BLOCK '&'
711
712 #define RE_OPTION_ONCE (1<<16)
713 #define RE_OPTION_ENCODING_SHIFT 8
714 #define RE_OPTION_ENCODING(e) (((e)&0xff)<<RE_OPTION_ENCODING_SHIFT)
715 #define RE_OPTION_ENCODING_IDX(o) (((o)>>RE_OPTION_ENCODING_SHIFT)&0xff)
716 #define RE_OPTION_ENCODING_NONE(o) ((o)&RE_OPTION_ARG_ENCODING_NONE)
717 #define RE_OPTION_MASK 0xff
718 #define RE_OPTION_ARG_ENCODING_NONE 32
719
720 /* structs for managing terminator of string literal and heredocment */
721 typedef struct rb_strterm_literal_struct {
722 union {
723 VALUE dummy;
724 long nest;
725 } u0;
726 union {
727 VALUE dummy;
728 long func; /* STR_FUNC_* (e.g., STR_FUNC_ESCAPE and STR_FUNC_EXPAND) */
729 } u1;
730 union {
731 VALUE dummy;
732 long paren; /* '(' of `%q(...)` */
733 } u2;
734 union {
735 VALUE dummy;
736 long term; /* ')' of `%q(...)` */
737 } u3;
738 } rb_strterm_literal_t;
739
740 #define HERETERM_LENGTH_BITS ((SIZEOF_VALUE - 1) * CHAR_BIT - 1)
741
742 struct rb_strterm_heredoc_struct {
743 VALUE lastline; /* the string of line that contains `<<"END"` */
744 long offset; /* the column of END in `<<"END"` */
745 int sourceline; /* lineno of the line that contains `<<"END"` */
746 unsigned length /* the length of END in `<<"END"` */
747 #if HERETERM_LENGTH_BITS < SIZEOF_INT * CHAR_BIT
748 : HERETERM_LENGTH_BITS
749 # define HERETERM_LENGTH_MAX ((1U << HERETERM_LENGTH_BITS) - 1)
750 #else
751 # define HERETERM_LENGTH_MAX UINT_MAX
752 #endif
753 ;
754 #if HERETERM_LENGTH_BITS < SIZEOF_INT * CHAR_BIT
755 unsigned quote: 1;
756 unsigned func: 8;
757 #else
758 uint8_t quote;
759 uint8_t func;
760 #endif
761 };
762 STATIC_ASSERT(rb_strterm_heredoc_t, sizeof(rb_strterm_heredoc_t) <= 4 * SIZEOF_VALUE);
763
764 #define STRTERM_HEREDOC IMEMO_FL_USER0
765
766 struct rb_strterm_struct {
767 VALUE flags;
768 union {
769 rb_strterm_literal_t literal;
770 rb_strterm_heredoc_t heredoc;
771 } u;
772 };
773
774 #ifndef RIPPER
775 void
776 rb_strterm_mark(VALUE obj)
777 {
778 rb_strterm_t *strterm = (rb_strterm_t*)obj;
779 if (RBASIC(obj)->flags & STRTERM_HEREDOC) {
780 rb_strterm_heredoc_t *heredoc = &strterm->u.heredoc;
781 rb_gc_mark(heredoc->lastline);
782 }
783 }
784 #endif
785
786 #define yytnamerr(yyres, yystr) (YYSIZE_T)rb_yytnamerr(p, yyres, yystr)
787 size_t rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr);
788
789 #define TOKEN2ID(tok) ( \
790 tTOKEN_LOCAL_BEGIN<(tok)&&(tok)<tTOKEN_LOCAL_END ? TOKEN2LOCALID(tok) : \
791 tTOKEN_INSTANCE_BEGIN<(tok)&&(tok)<tTOKEN_INSTANCE_END ? TOKEN2INSTANCEID(tok) : \
792 tTOKEN_GLOBAL_BEGIN<(tok)&&(tok)<tTOKEN_GLOBAL_END ? TOKEN2GLOBALID(tok) : \
793 tTOKEN_CONST_BEGIN<(tok)&&(tok)<tTOKEN_CONST_END ? TOKEN2CONSTID(tok) : \
794 tTOKEN_CLASS_BEGIN<(tok)&&(tok)<tTOKEN_CLASS_END ? TOKEN2CLASSID(tok) : \
795 tTOKEN_ATTRSET_BEGIN<(tok)&&(tok)<tTOKEN_ATTRSET_END ? TOKEN2ATTRSETID(tok) : \
796 ((tok) / ((tok)<tPRESERVED_ID_END && ((tok)>=128 || rb_ispunct(tok)))))
797
798 /****** Ripper *******/
799
800 #ifdef RIPPER
801 #define RIPPER_VERSION "0.1.0"
802
803 static inline VALUE intern_sym(const char *name);
804
805 #include "eventids1.c"
806 #include "eventids2.c"
807
808 static VALUE ripper_dispatch0(struct parser_params*,ID);
809 static VALUE ripper_dispatch1(struct parser_params*,ID,VALUE);
810 static VALUE ripper_dispatch2(struct parser_params*,ID,VALUE,VALUE);
811 static VALUE ripper_dispatch3(struct parser_params*,ID,VALUE,VALUE,VALUE);
812 static VALUE ripper_dispatch4(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE);
813 static VALUE ripper_dispatch5(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE);
814 static VALUE ripper_dispatch7(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE);
815 static void ripper_error(struct parser_params *p);
816
817 #define dispatch0(n) ripper_dispatch0(p, TOKEN_PASTE(ripper_id_, n))
818 #define dispatch1(n,a) ripper_dispatch1(p, TOKEN_PASTE(ripper_id_, n), (a))
819 #define dispatch2(n,a,b) ripper_dispatch2(p, TOKEN_PASTE(ripper_id_, n), (a), (b))
820 #define dispatch3(n,a,b,c) ripper_dispatch3(p, TOKEN_PASTE(ripper_id_, n), (a), (b), (c))
821 #define dispatch4(n,a,b,c,d) ripper_dispatch4(p, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d))
822 #define dispatch5(n,a,b,c,d,e) ripper_dispatch5(p, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e))
823 #define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(p, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e), (f), (g))
824
825 #define yyparse ripper_yyparse
826
827 #define ID2VAL(id) STATIC_ID2SYM(id)
828 #define TOKEN2VAL(t) ID2VAL(TOKEN2ID(t))
829 #define KWD2EID(t, v) ripper_new_yylval(p, keyword_##t, get_value(v), 0)
830
831 #define params_new(pars, opts, rest, pars2, kws, kwrest, blk) \
832 dispatch7(params, (pars), (opts), (rest), (pars2), (kws), (kwrest), (blk))
833
834 #define escape_Qundef(x) ((x)==Qundef ? Qnil : (x))
835
836 static inline VALUE
837 new_args(struct parser_params *p, VALUE pre_args, VALUE opt_args, VALUE rest_arg, VALUE post_args, VALUE tail, YYLTYPE *loc)
838 {
839 NODE *t = (NODE *)tail;
840 VALUE kw_args = t->u1.value, kw_rest_arg = t->u2.value, block = t->u3.value;
841 return params_new(pre_args, opt_args, rest_arg, post_args, kw_args, kw_rest_arg, escape_Qundef(block));
842 }
843
844 static inline VALUE
845 new_args_tail(struct parser_params *p, VALUE kw_args, VALUE kw_rest_arg, VALUE block, YYLTYPE *loc)
846 {
847 NODE *t = rb_node_newnode(NODE_ARGS_AUX, kw_args, kw_rest_arg, block, &NULL_LOC);
848 add_mark_object(p, kw_args);
849 add_mark_object(p, kw_rest_arg);
850 add_mark_object(p, block);
851 return (VALUE)t;
852 }
853
854 static inline VALUE
855 args_with_numbered(struct parser_params *p, VALUE args, int max_numparam)
856 {
857 return args;
858 }
859
860 static VALUE
861 new_array_pattern(struct parser_params *p, VALUE constant, VALUE pre_arg, VALUE aryptn, const YYLTYPE *loc)
862 {
863 NODE *t = (NODE *)aryptn;
864 VALUE pre_args = t->u1.value, rest_arg = t->u2.value, post_args = t->u3.value;
865
866 if (!NIL_P(pre_arg)) {
867 if (!NIL_P(pre_args)) {
868 rb_ary_unshift(pre_args, pre_arg);
869 }
870 else {
871 pre_args = rb_ary_new_from_args(1, pre_arg);
872 }
873 }
874 return dispatch4(aryptn, constant, pre_args, rest_arg, post_args);
875 }
876
877 static VALUE
878 new_array_pattern_tail(struct parser_params *p, VALUE pre_args, VALUE has_rest, VALUE rest_arg, VALUE post_args, const YYLTYPE *loc)
879 {
880 NODE *t;
881
882 if (has_rest) {
883 rest_arg = dispatch1(var_field, rest_arg ? rest_arg : Qnil);
884 }
885 else {
886 rest_arg = Qnil;
887 }
888
889 t = rb_node_newnode(NODE_ARYPTN, pre_args, rest_arg, post_args, &NULL_LOC);
890 add_mark_object(p, pre_args);
891 add_mark_object(p, rest_arg);
892 add_mark_object(p, post_args);
893 return (VALUE)t;
894 }
895
896 static VALUE
897 new_find_pattern(struct parser_params *p, VALUE constant, VALUE fndptn, const YYLTYPE *loc)
898 {
899 NODE *t = (NODE *)fndptn;
900 VALUE pre_rest_arg = t->u1.value, args = t->u2.value, post_rest_arg = t->u3.value;
901
902 return dispatch4(fndptn, constant, pre_rest_arg, args, post_rest_arg);
903 }
904
905 static VALUE
906 new_find_pattern_tail(struct parser_params *p, VALUE pre_rest_arg, VALUE args, VALUE post_rest_arg, const YYLTYPE *loc)
907 {
908 NODE *t;
909
910 pre_rest_arg = dispatch1(var_field, pre_rest_arg ? pre_rest_arg : Qnil);
911 post_rest_arg = dispatch1(var_field, post_rest_arg ? post_rest_arg : Qnil);
912
913 t = rb_node_newnode(NODE_FNDPTN, pre_rest_arg, args, post_rest_arg, &NULL_LOC);
914 add_mark_object(p, pre_rest_arg);
915 add_mark_object(p, args);
916 add_mark_object(p, post_rest_arg);
917 return (VALUE)t;
918 }
919
920 #define new_hash(p,h,l) rb_ary_new_from_args(0)
921
922 static VALUE
923 new_unique_key_hash(struct parser_params *p, VALUE ary, const YYLTYPE *loc)
924 {
925 return ary;
926 }
927
928 static VALUE
929 new_hash_pattern(struct parser_params *p, VALUE constant, VALUE hshptn, const YYLTYPE *loc)
930 {
931 NODE *t = (NODE *)hshptn;
932 VALUE kw_args = t->u1.value, kw_rest_arg = t->u2.value;
933 return dispatch3(hshptn, constant, kw_args, kw_rest_arg);
934 }
935
936 static VALUE
937 new_hash_pattern_tail(struct parser_params *p, VALUE kw_args, VALUE kw_rest_arg, const YYLTYPE *loc)
938 {
939 NODE *t;
940 if (kw_rest_arg) {
941 kw_rest_arg = dispatch1(var_field, kw_rest_arg);
942 }
943 else {
944 kw_rest_arg = Qnil;
945 }
946 t = rb_node_newnode(NODE_HSHPTN, kw_args, kw_rest_arg, 0, &NULL_LOC);
947
948 add_mark_object(p, kw_args);
949 add_mark_object(p, kw_rest_arg);
950 return (VALUE)t;
951 }
952
953 #define new_defined(p,expr,loc) dispatch1(defined, (expr))
954
955 static VALUE heredoc_dedent(struct parser_params*,VALUE);
956
957 #else
958 #define ID2VAL(id) (id)
959 #define TOKEN2VAL(t) ID2VAL(t)
960 #define KWD2EID(t, v) keyword_##t
961
962 static NODE *
963 set_defun_body(struct parser_params *p, NODE *n, NODE *args, NODE *body, const YYLTYPE *loc)
964 {
965 body = remove_begin(body);
966 reduce_nodes(p, &body);
967 n->nd_defn = NEW_SCOPE(args, body, loc);
968 n->nd_loc = *loc;
969 nd_set_line(n->nd_defn, loc->end_pos.lineno);
970 set_line_body(body, loc->beg_pos.lineno);
971 return n;
972 }
973
974 static NODE *
975 rescued_expr(struct parser_params *p, NODE *arg, NODE *rescue,
976 const YYLTYPE *arg_loc, const YYLTYPE *mod_loc, const YYLTYPE *res_loc)
977 {
978 YYLTYPE loc = code_loc_gen(mod_loc, res_loc);
979 rescue = NEW_RESBODY(0, remove_begin(rescue), 0, &loc);
980 loc.beg_pos = arg_loc->beg_pos;
981 return NEW_RESCUE(arg, rescue, 0, &loc);
982 }
983
984 #endif /* RIPPER */
985
986 static void
987 restore_defun(struct parser_params *p, NODE *name)
988 {
989 YYSTYPE c = {.val = name->nd_cval};
990 p->cur_arg = name->nd_vid;
991 p->ctxt.in_def = c.ctxt.in_def;
992 p->ctxt.shareable_constant_value = c.ctxt.shareable_constant_value;
993 }
994
995 static void
996 endless_method_name(struct parser_params *p, NODE *defn, const YYLTYPE *loc)
997 {
998 #ifdef RIPPER
999 defn = defn->nd_defn;
1000 #endif
1001 ID mid = defn->nd_mid;
1002 if (is_attrset_id(mid)) {
1003 yyerror1(loc, "setter method cannot be defined in an endless method definition");
1004 }
1005 token_info_drop(p, "def", loc->beg_pos);
1006 }
1007
1008 #ifndef RIPPER
1009 # define Qnone 0
1010 # define Qnull 0
1011 # define ifndef_ripper(x) (x)
1012 #else
1013 # define Qnone Qnil
1014 # define Qnull Qundef
1015 # define ifndef_ripper(x)
1016 #endif
1017
1018 # define rb_warn0(fmt) WARN_CALL(WARN_ARGS(fmt, 1))
1019 # define rb_warn1(fmt,a) WARN_CALL(WARN_ARGS(fmt, 2), (a))
1020 # define rb_warn2(fmt,a,b) WARN_CALL(WARN_ARGS(fmt, 3), (a), (b))
1021 # define rb_warn3(fmt,a,b,c) WARN_CALL(WARN_ARGS(fmt, 4), (a), (b), (c))
1022 # define rb_warn4(fmt,a,b,c,d) WARN_CALL(WARN_ARGS(fmt, 5), (a), (b), (c), (d))
1023 # define rb_warning0(fmt) WARNING_CALL(WARNING_ARGS(fmt, 1))
1024 # define rb_warning1(fmt,a) WARNING_CALL(WARNING_ARGS(fmt, 2), (a))
1025 # define rb_warning2(fmt,a,b) WARNING_CALL(WARNING_ARGS(fmt, 3), (a), (b))
1026 # define rb_warning3(fmt,a,b,c) WARNING_CALL(WARNING_ARGS(fmt, 4), (a), (b), (c))
1027 # define rb_warning4(fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS(fmt, 5), (a), (b), (c), (d))
1028 # define rb_warn0L(l,fmt) WARN_CALL(WARN_ARGS_L(l, fmt, 1))
1029 # define rb_warn1L(l,fmt,a) WARN_CALL(WARN_ARGS_L(l, fmt, 2), (a))
1030 # define rb_warn2L(l,fmt,a,b) WARN_CALL(WARN_ARGS_L(l, fmt, 3), (a), (b))
1031 # define rb_warn3L(l,fmt,a,b,c) WARN_CALL(WARN_ARGS_L(l, fmt, 4), (a), (b), (c))
1032 # define rb_warn4L(l,fmt,a,b,c,d) WARN_CALL(WARN_ARGS_L(l, fmt, 5), (a), (b), (c), (d))
1033 # define rb_warning0L(l,fmt) WARNING_CALL(WARNING_ARGS_L(l, fmt, 1))
1034 # define rb_warning1L(l,fmt,a) WARNING_CALL(WARNING_ARGS_L(l, fmt, 2), (a))
1035 # define rb_warning2L(l,fmt,a,b) WARNING_CALL(WARNING_ARGS_L(l, fmt, 3), (a), (b))
1036 # define rb_warning3L(l,fmt,a,b,c) WARNING_CALL(WARNING_ARGS_L(l, fmt, 4), (a), (b), (c))
1037 # define rb_warning4L(l,fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS_L(l, fmt, 5), (a), (b), (c), (d))
1038 #ifdef RIPPER
1039 static ID id_warn, id_warning, id_gets, id_assoc;
1040 # define ERR_MESG() STR_NEW2(mesg) /* to bypass Ripper DSL */
1041 # define WARN_S_L(s,l) STR_NEW(s,l)
1042 # define WARN_S(s) STR_NEW2(s)
1043 # define WARN_I(i) INT2NUM(i)
1044 # define WARN_ID(i) rb_id2str(i)
1045 # define WARN_IVAL(i) i
1046 # define PRIsWARN "s"
1047 # define rb_warn0L_experimental(l,fmt) WARN_CALL(WARN_ARGS_L(l, fmt, 1))
1048 # define WARN_ARGS(fmt,n) p->value, id_warn, n, rb_usascii_str_new_lit(fmt)
1049 # define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
1050 # ifdef HAVE_VA_ARGS_MACRO
1051 # define WARN_CALL(...) rb_funcall(__VA_ARGS__)
1052 # else
1053 # define WARN_CALL rb_funcall
1054 # endif
1055 # define WARNING_ARGS(fmt,n) p->value, id_warning, n, rb_usascii_str_new_lit(fmt)
1056 # define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
1057 # ifdef HAVE_VA_ARGS_MACRO
1058 # define WARNING_CALL(...) rb_funcall(__VA_ARGS__)
1059 # else
1060 # define WARNING_CALL rb_funcall
1061 # endif
1062 PRINTF_ARGS(static void ripper_compile_error(struct parser_params*, const char *fmt, ...), 2, 3);
1063 # define compile_error ripper_compile_error
1064 #else
1065 # define WARN_S_L(s,l) s
1066 # define WARN_S(s) s
1067 # define WARN_I(i) i
1068 # define WARN_ID(i) rb_id2name(i)
1069 # define WARN_IVAL(i) NUM2INT(i)
1070 # define PRIsWARN PRIsVALUE
1071 # define WARN_ARGS(fmt,n) WARN_ARGS_L(p->ruby_sourceline,fmt,n)
1072 # define WARN_ARGS_L(l,fmt,n) p->ruby_sourcefile, (l), (fmt)
1073 # define WARN_CALL rb_compile_warn
1074 # define rb_warn0L_experimental(l,fmt) rb_category_compile_warn(RB_WARN_CATEGORY_EXPERIMENTAL, WARN_ARGS_L(l, fmt, 1))
1075 # define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
1076 # define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
1077 # define WARNING_CALL rb_compile_warning
1078 PRINTF_ARGS(static void parser_compile_error(struct parser_params*, const char *fmt, ...), 2, 3);
1079 # define compile_error parser_compile_error
1080 #endif
1081
1082 #define WARN_EOL(tok) \
1083 (looking_at_eol_p(p) ? \
1084 (void)rb_warning0("`" tok "' at the end of line without an expression") : \
1085 (void)0)
1086 static int looking_at_eol_p(struct parser_params *p);
1087 %}
1088
1089 %expect 0
1090 %define api.pure
1091 %define parse.error verbose
1092 %printer {
1093 #ifndef RIPPER
1094 rb_parser_printf(p, "%"PRIsVALUE, rb_id2str($$));
1095 #else
1096 rb_parser_printf(p, "%"PRIsVALUE, RNODE($$)->nd_rval);
1097 #endif
1098 } tIDENTIFIER tFID tGVAR tIVAR tCONSTANT tCVAR tLABEL tOP_ASGN
1099 %printer {
1100 #ifndef RIPPER
1101 rb_parser_printf(p, "%+"PRIsVALUE, $$->nd_lit);
1102 #else
1103 rb_parser_printf(p, "%+"PRIsVALUE, get_value($$));
1104 #endif
1105 } tINTEGER tFLOAT tRATIONAL tIMAGINARY tSTRING_CONTENT tCHAR
1106 %printer {
1107 #ifndef RIPPER
1108 rb_parser_printf(p, "$%ld", $$->nd_nth);
1109 #else
1110 rb_parser_printf(p, "%"PRIsVALUE, $$);
1111 #endif
1112 } tNTH_REF
1113 %printer {
1114 #ifndef RIPPER
1115 rb_parser_printf(p, "$%c", (int)$$->nd_nth);
1116 #else
1117 rb_parser_printf(p, "%"PRIsVALUE, $$);
1118 #endif
1119 } tBACK_REF
1120
1121 %lex-param {struct parser_params *p}
1122 %parse-param {struct parser_params *p}
1123 %initial-action
1124 {
1125 RUBY_SET_YYLLOC_OF_NONE(@$);
1126 };
1127
1128 %union {
1129 VALUE val;
1130 NODE *node;
1131 ID id;
1132 int num;
1133 st_table *tbl;
1134 const struct vtable *vars;
1135 struct rb_strterm_struct *strterm;
1136 struct lex_context ctxt;
1137 }
1138
1139 %token <id>
1140 keyword_class "`class'"
1141 keyword_module "`module'"
1142 keyword_def "`def'"
1143 keyword_undef "`undef'"
1144 keyword_begin "`begin'"
1145 keyword_rescue "`rescue'"
1146 keyword_ensure "`ensure'"
1147 keyword_end "`end'"
1148 keyword_if "`if'"
1149 keyword_unless "`unless'"
1150 keyword_then "`then'"
1151 keyword_elsif "`elsif'"
1152 keyword_else "`else'"
1153 keyword_case "`case'"
1154 keyword_when "`when'"
1155 keyword_while "`while'"
1156 keyword_until "`until'"
1157 keyword_for "`for'"
1158 keyword_break "`break'"
1159 keyword_next "`next'"
1160 keyword_redo "`redo'"
1161 keyword_retry "`retry'"
1162 keyword_in "`in'"
1163 keyword_do "`do'"
1164 keyword_do_cond "`do' for condition"
1165 keyword_do_block "`do' for block"
1166 keyword_do_LAMBDA "`do' for lambda"
1167 keyword_return "`return'"
1168 keyword_yield "`yield'"
1169 keyword_super "`super'"
1170 keyword_self "`self'"
1171 keyword_nil "`nil'"
1172 keyword_true "`true'"
1173 keyword_false "`false'"
1174 keyword_and "`and'"
1175 keyword_or "`or'"
1176 keyword_not "`not'"
1177 modifier_if "`if' modifier"
1178 modifier_unless "`unless' modifier"
1179 modifier_while "`while' modifier"
1180 modifier_until "`until' modifier"
1181 modifier_rescue "`rescue' modifier"
1182 keyword_alias "`alias'"
1183 keyword_defined "`defined?'"
1184 keyword_BEGIN "`BEGIN'"
1185 keyword_END "`END'"
1186 keyword__LINE__ "`__LINE__'"
1187 keyword__FILE__ "`__FILE__'"
1188 keyword__ENCODING__ "`__ENCODING__'"
1189
1190 %token <id> tIDENTIFIER "local variable or method"
1191 %token <id> tFID "method"
1192 %token <id> tGVAR "global variable"
1193 %token <id> tIVAR "instance variable"
1194 %token <id> tCONSTANT "constant"
1195 %token <id> tCVAR "class variable"
1196 %token <id> tLABEL "label"
1197 %token <node> tINTEGER "integer literal"
1198 %token <node> tFLOAT "float literal"
1199 %token <node> tRATIONAL "rational literal"
1200 %token <node> tIMAGINARY "imaginary literal"
1201 %token <node> tCHAR "char literal"
1202 %token <node> tNTH_REF "numbered reference"
1203 %token <node> tBACK_REF "back reference"
1204 %token <node> tSTRING_CONTENT "literal content"
1205 %token <num> tREGEXP_END
1206
1207 %type <node> singleton strings string string1 xstring regexp
1208 %type <node> string_contents xstring_contents regexp_contents string_content
1209 %type <node> words symbols symbol_list qwords qsymbols word_list qword_list qsym_list word
1210 %type <node> literal numeric simple_numeric ssym dsym symbol cpath def_name defn_head defs_head
1211 %type <node> top_compstmt top_stmts top_stmt begin_block
1212 %type <node> bodystmt compstmt stmts stmt_or_begin stmt expr arg primary command command_call method_call
1213 %type <node> expr_value expr_value_do arg_value primary_value fcall rel_expr
1214 %type <node> if_tail opt_else case_body case_args cases opt_rescue exc_list exc_var opt_ensure
1215 %type <node> args call_args opt_call_args
1216 %type <node> paren_args opt_paren_args args_tail opt_args_tail block_args_tail opt_block_args_tail
1217 %type <node> command_args aref_args opt_block_arg block_arg var_ref var_lhs
1218 %type <node> command_rhs arg_rhs
1219 %type <node> command_asgn mrhs mrhs_arg superclass block_call block_command
1220 %type <node> f_block_optarg f_block_opt
1221 %type <node> f_arglist f_opt_paren_args f_paren_args f_args f_arg f_arg_item
1222 %type <node> f_optarg f_marg f_marg_list f_margs f_rest_marg
1223 %type <node> assoc_list assocs assoc undef_list backref string_dvar for_var
1224 %type <node> block_param opt_block_param block_param_def f_opt
1225 %type <node> f_kwarg f_kw f_block_kwarg f_block_kw
1226 %type <node> bv_decls opt_bv_decl bvar
1227 %type <node> lambda f_larglist lambda_body brace_body do_body
1228 %type <node> brace_block cmd_brace_block do_block lhs none fitem
1229 %type <node> mlhs mlhs_head mlhs_basic mlhs_item mlhs_node mlhs_post mlhs_inner
1230 %type <node> p_case_body p_cases p_top_expr p_top_expr_body
1231 %type <node> p_expr p_as p_alt p_expr_basic p_find
1232 %type <node> p_args p_args_head p_args_tail p_args_post p_arg
1233 %type <node> p_value p_primitive p_variable p_var_ref p_expr_ref p_const
1234 %type <node> p_kwargs p_kwarg p_kw
1235 %type <id> keyword_variable user_variable sym operation operation2 operation3
1236 %type <id> cname fname op f_rest_arg f_block_arg opt_f_block_arg f_norm_arg f_bad_arg
1237 %type <id> f_kwrest f_label f_arg_asgn call_op call_op2 reswords relop dot_or_colon
1238 %type <id> p_rest p_kwrest p_kwnorest p_any_kwrest p_kw_label
1239 %type <id> f_no_kwarg f_any_kwrest args_forward excessed_comma nonlocal_var
1240 %type <ctxt> lex_ctxt /* keep <ctxt> in ripper */
1241 %token END_OF_INPUT 0 "end-of-input"
1242 %token <id> '.'
1243 /* escaped chars, should be ignored otherwise */
1244 %token <id> '\\' "backslash"
1245 %token tSP "escaped space"
1246 %token <id> '\t' "escaped horizontal tab"
1247 %token <id> '\f' "escaped form feed"
1248 %token <id> '\r' "escaped carriage return"
1249 %token <id> '\13' "escaped vertical tab"
1250 %token tUPLUS RUBY_TOKEN(UPLUS) "unary+"
1251 %token tUMINUS RUBY_TOKEN(UMINUS) "unary-"
1252 %token tPOW RUBY_TOKEN(POW) "**"
1253 %token tCMP RUBY_TOKEN(CMP) "<=>"
1254 %token tEQ RUBY_TOKEN(EQ) "=="
1255 %token tEQQ RUBY_TOKEN(EQQ) "==="
1256 %token tNEQ RUBY_TOKEN(NEQ) "!="
1257 %token tGEQ RUBY_TOKEN(GEQ) ">="
1258 %token tLEQ RUBY_TOKEN(LEQ) "<="
1259 %token tANDOP RUBY_TOKEN(ANDOP) "&&"
1260 %token tOROP RUBY_TOKEN(OROP) "||"
1261 %token tMATCH RUBY_TOKEN(MATCH) "=~"
1262 %token tNMATCH RUBY_TOKEN(NMATCH) "!~"
1263 %token tDOT2 RUBY_TOKEN(DOT2) ".."
1264 %token tDOT3 RUBY_TOKEN(DOT3) "..."
1265 %token tBDOT2 RUBY_TOKEN(BDOT2) "(.."
1266 %token tBDOT3 RUBY_TOKEN(BDOT3) "(..."
1267 %token tAREF RUBY_TOKEN(AREF) "[]"
1268 %token tASET RUBY_TOKEN(ASET) "[]="
1269 %token tLSHFT RUBY_TOKEN(LSHFT) "<<"
1270 %token tRSHFT RUBY_TOKEN(RSHFT) ">>"
1271 %token <id> tANDDOT RUBY_TOKEN(ANDDOT) "&."
1272 %token <id> tCOLON2 RUBY_TOKEN(COLON2) "::"
1273 %token tCOLON3 ":: at EXPR_BEG"
1274 %token <id> tOP_ASGN "operator-assignment" /* +=, -= etc. */
1275 %token tASSOC "=>"
1276 %token tLPAREN "("
1277 %token tLPAREN_ARG "( arg"
1278 %token tRPAREN ")"
1279 %token tLBRACK "["
1280 %token tLBRACE "{"
1281 %token tLBRACE_ARG "{ arg"
1282 %token tSTAR "*"
1283 %token tDSTAR "**arg"
1284 %token tAMPER "&"
1285 %token tLAMBDA "->"
1286 %token tSYMBEG "symbol literal"
1287 %token tSTRING_BEG "string literal"
1288 %token tXSTRING_BEG "backtick literal"
1289 %token tREGEXP_BEG "regexp literal"
1290 %token tWORDS_BEG "word list"
1291 %token tQWORDS_BEG "verbatim word list"
1292 %token tSYMBOLS_BEG "symbol list"
1293 %token tQSYMBOLS_BEG "verbatim symbol list"
1294 %token tSTRING_END "terminator"
1295 %token tSTRING_DEND "'}'"
1296 %token tSTRING_DBEG tSTRING_DVAR tLAMBEG tLABEL_END
1297
1298 /*
1299 * precedence table
1300 */
1301
1302 %nonassoc tLOWEST
1303 %nonassoc tLBRACE_ARG
1304
1305 %nonassoc modifier_if modifier_unless modifier_while modifier_until keyword_in
1306 %left keyword_or keyword_and
1307 %right keyword_not
1308 %nonassoc keyword_defined
1309 %right '=' tOP_ASGN
1310 %left modifier_rescue
1311 %right '?' ':'
1312 %nonassoc tDOT2 tDOT3 tBDOT2 tBDOT3
1313 %left tOROP
1314 %left tANDOP
1315 %nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH
1316 %left '>' tGEQ '<' tLEQ
1317 %left '|' '^'
1318 %left '&'
1319 %left tLSHFT tRSHFT
1320 %left '+' '-'
1321 %left '*' '/' '%'
1322 %right tUMINUS_NUM tUMINUS
1323 %right tPOW
1324 %right '!' '~' tUPLUS
1325
1326 %token tLAST_TOKEN
1327
1328 %%
1329 program : {
1330 SET_LEX_STATE(EXPR_BEG);
1331 local_push(p, ifndef_ripper(1)+0);
1332 }
1333 top_compstmt
1334 {
1335 /*%%%*/
1336 if ($2 && !compile_for_eval) {
1337 NODE *node = $2;
1338 /* last expression should not be void */
1339 if (nd_type_p(node, NODE_BLOCK)) {
1340 while (node->nd_next) {
1341 node = node->nd_next;
1342 }
1343 node = node->nd_head;
1344 }
1345 node = remove_begin(node);
1346 void_expr(p, node);
1347 }
1348 p->eval_tree = NEW_SCOPE(0, block_append(p, p->eval_tree, $2), &@$);
1349 /*% %*/
1350 /*% ripper[final]: program!($2) %*/
1351 local_pop(p);
1352 }
1353 ;
1354
1355 top_compstmt : top_stmts opt_terms
1356 {
1357 $$ = void_stmts(p, $1);
1358 }
1359 ;
1360
1361 top_stmts : none
1362 {
1363 /*%%%*/
1364 $$ = NEW_BEGIN(0, &@$);
1365 /*% %*/
1366 /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/
1367 }
1368 | top_stmt
1369 {
1370 /*%%%*/
1371 $$ = newline_node($1);
1372 /*% %*/
1373 /*% ripper: stmts_add!(stmts_new!, $1) %*/
1374 }
1375 | top_stmts terms top_stmt
1376 {
1377 /*%%%*/
1378 $$ = block_append(p, $1, newline_node($3));
1379 /*% %*/
1380 /*% ripper: stmts_add!($1, $3) %*/
1381 }
1382 | error top_stmt
1383 {
1384 $$ = remove_begin($2);
1385 }
1386 ;
1387
1388 top_stmt : stmt
1389 | keyword_BEGIN begin_block
1390 {
1391 $$ = $2;
1392 }
1393 ;
1394
1395 begin_block : '{' top_compstmt '}'
1396 {
1397 /*%%%*/
1398 p->eval_tree_begin = block_append(p, p->eval_tree_begin,
1399 NEW_BEGIN($2, &@$));
1400 $$ = NEW_BEGIN(0, &@$);
1401 /*% %*/
1402 /*% ripper: BEGIN!($2) %*/
1403 }
1404 ;
1405
1406 bodystmt : compstmt
1407 opt_rescue
1408 k_else {if (!$2) {yyerror1(&@3, "else without rescue is useless");}}
1409 compstmt
1410 opt_ensure
1411 {
1412 /*%%%*/
1413 $$ = new_bodystmt(p, $1, $2, $5, $6, &@$);
1414 /*% %*/
1415 /*% ripper: bodystmt!(escape_Qundef($1), escape_Qundef($2), escape_Qundef($5), escape_Qundef($6)) %*/
1416 }
1417 | compstmt
1418 opt_rescue
1419 opt_ensure
1420 {
1421 /*%%%*/
1422 $$ = new_bodystmt(p, $1, $2, 0, $3, &@$);
1423 /*% %*/
1424 /*% ripper: bodystmt!(escape_Qundef($1), escape_Qundef($2), Qnil, escape_Qundef($3)) %*/
1425 }
1426 ;
1427
1428 compstmt : stmts opt_terms
1429 {
1430 $$ = void_stmts(p, $1);
1431 }
1432 ;
1433
1434 stmts : none
1435 {
1436 /*%%%*/
1437 $$ = NEW_BEGIN(0, &@$);
1438 /*% %*/
1439 /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/
1440 }
1441 | stmt_or_begin
1442 {
1443 /*%%%*/
1444 $$ = newline_node($1);
1445 /*% %*/
1446 /*% ripper: stmts_add!(stmts_new!, $1) %*/
1447 }
1448 | stmts terms stmt_or_begin
1449 {
1450 /*%%%*/
1451 $$ = block_append(p, $1, newline_node($3));
1452 /*% %*/
1453 /*% ripper: stmts_add!($1, $3) %*/
1454 }
1455 | error stmt
1456 {
1457 $$ = remove_begin($2);
1458 }
1459 ;
1460
1461 stmt_or_begin : stmt
1462 {
1463 $$ = $1;
1464 }
1465 | keyword_BEGIN
1466 {
1467 yyerror1(&@1, "BEGIN is permitted only at toplevel");
1468 }
1469 begin_block
1470 {
1471 $$ = $3;
1472 }
1473 ;
1474
1475 stmt : keyword_alias fitem {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem
1476 {
1477 /*%%%*/
1478 $$ = NEW_ALIAS($2, $4, &@$);
1479 /*% %*/
1480 /*% ripper: alias!($2, $4) %*/
1481 }
1482 | keyword_alias tGVAR tGVAR
1483 {
1484 /*%%%*/
1485 $$ = NEW_VALIAS($2, $3, &@$);
1486 /*% %*/
1487 /*% ripper: var_alias!($2, $3) %*/
1488 }
1489 | keyword_alias tGVAR tBACK_REF
1490 {
1491 /*%%%*/
1492 char buf[2];
1493 buf[0] = '$';
1494 buf[1] = (char)$3->nd_nth;
1495 $$ = NEW_VALIAS($2, rb_intern2(buf, 2), &@$);
1496 /*% %*/
1497 /*% ripper: var_alias!($2, $3) %*/
1498 }
1499 | keyword_alias tGVAR tNTH_REF
1500 {
1501 static const char mesg[] = "can't make alias for the number variables";
1502 /*%%%*/
1503 yyerror1(&@3, mesg);
1504 $$ = NEW_BEGIN(0, &@$);
1505 /*% %*/
1506 /*% ripper[error]: alias_error!(ERR_MESG(), $3) %*/
1507 }
1508 | keyword_undef undef_list
1509 {
1510 /*%%%*/
1511 $$ = $2;
1512 /*% %*/
1513 /*% ripper: undef!($2) %*/
1514 }
1515 | stmt modifier_if expr_value
1516 {
1517 /*%%%*/
1518 $$ = new_if(p, $3, remove_begin($1), 0, &@$);
1519 fixpos($$, $3);
1520 /*% %*/
1521 /*% ripper: if_mod!($3, $1) %*/
1522 }
1523 | stmt modifier_unless expr_value
1524 {
1525 /*%%%*/
1526 $$ = new_unless(p, $3, remove_begin($1), 0, &@$);
1527 fixpos($$, $3);
1528 /*% %*/
1529 /*% ripper: unless_mod!($3, $1) %*/
1530 }
1531 | stmt modifier_while expr_value
1532 {
1533 /*%%%*/
1534 if ($1 && nd_type_p($1, NODE_BEGIN)) {
1535 $$ = NEW_WHILE(cond(p, $3, &@3), $1->nd_body, 0, &@$);
1536 }
1537 else {
1538 $$ = NEW_WHILE(cond(p, $3, &@3), $1, 1, &@$);
1539 }
1540 /*% %*/
1541 /*% ripper: while_mod!($3, $1) %*/
1542 }
1543 | stmt modifier_until expr_value
1544 {
1545 /*%%%*/
1546 if ($1 && nd_type_p($1, NODE_BEGIN)) {
1547 $$ = NEW_UNTIL(cond(p, $3, &@3), $1->nd_body, 0, &@$);
1548 }
1549 else {
1550 $$ = NEW_UNTIL(cond(p, $3, &@3), $1, 1, &@$);
1551 }
1552 /*% %*/
1553 /*% ripper: until_mod!($3, $1) %*/
1554 }
1555 | stmt modifier_rescue stmt
1556 {
1557 /*%%%*/
1558 NODE *resq;
1559 YYLTYPE loc = code_loc_gen(&@2, &@3);
1560 resq = NEW_RESBODY(0, remove_begin($3), 0, &loc);
1561 $$ = NEW_RESCUE(remove_begin($1), resq, 0, &@$);
1562 /*% %*/
1563 /*% ripper: rescue_mod!($1, $3) %*/
1564 }
1565 | keyword_END '{' compstmt '}'
1566 {
1567 if (p->ctxt.in_def) {
1568 rb_warn0("END in method; use at_exit");
1569 }
1570 /*%%%*/
1571 {
1572 NODE *scope = NEW_NODE(
1573 NODE_SCOPE, 0 /* tbl */, $3 /* body */, 0 /* args */, &@$);
1574 $$ = NEW_POSTEXE(scope, &@$);
1575 }
1576 /*% %*/
1577 /*% ripper: END!($3) %*/
1578 }
1579 | command_asgn
1580 | mlhs '=' lex_ctxt command_call
1581 {
1582 /*%%%*/
1583 value_expr($4);
1584 $$ = node_assign(p, $1, $4, $3, &@$);
1585 /*% %*/
1586 /*% ripper: massign!($1, $4) %*/
1587 }
1588 | lhs '=' lex_ctxt mrhs
1589 {
1590 /*%%%*/
1591 $$ = node_assign(p, $1, $4, $3, &@$);
1592 /*% %*/
1593 /*% ripper: assign!($1, $4) %*/
1594 }
1595 | mlhs '=' lex_ctxt mrhs_arg modifier_rescue stmt
1596 {
1597 /*%%%*/
1598 YYLTYPE loc = code_loc_gen(&@5, &@6);
1599 $$ = node_assign(p, $1, NEW_RESCUE($4, NEW_RESBODY(0, remove_begin($6), 0, &loc), 0, &@$), $3, &@$);
1600 /*% %*/
1601 /*% ripper: massign!($1, rescue_mod!($4, $6)) %*/
1602 }
1603 | mlhs '=' lex_ctxt mrhs_arg
1604 {
1605 /*%%%*/
1606 $$ = node_assign(p, $1, $4, $3, &@$);
1607 /*% %*/
1608 /*% ripper: massign!($1, $4) %*/
1609 }
1610 | expr
1611 ;
1612
1613 command_asgn : lhs '=' lex_ctxt command_rhs
1614 {
1615 /*%%%*/
1616 $$ = node_assign(p, $1, $4, $3, &@$);
1617 /*% %*/
1618 /*% ripper: assign!($1, $4) %*/
1619 }
1620 | var_lhs tOP_ASGN lex_ctxt command_rhs
1621 {
1622 /*%%%*/
1623 $$ = new_op_assign(p, $1, $2, $4, $3, &@$);
1624 /*% %*/
1625 /*% ripper: opassign!($1, $2, $4) %*/
1626 }
1627 | primary_value '[' opt_call_args rbracket tOP_ASGN lex_ctxt command_rhs
1628 {
1629 /*%%%*/
1630 $$ = new_ary_op_assign(p, $1, $3, $5, $7, &@3, &@$);
1631 /*% %*/
1632 /*% ripper: opassign!(aref_field!($1, escape_Qundef($3)), $5, $7) %*/
1633
1634 }
1635 | primary_value call_op tIDENTIFIER tOP_ASGN lex_ctxt command_rhs
1636 {
1637 /*%%%*/
1638 $$ = new_attr_op_assign(p, $1, $2, $3, $4, $6, &@$);
1639 /*% %*/
1640 /*% ripper: opassign!(field!($1, $2, $3), $4, $6) %*/
1641 }
1642 | primary_value call_op tCONSTANT tOP_ASGN lex_ctxt command_rhs
1643 {
1644 /*%%%*/
1645 $$ = new_attr_op_assign(p, $1, $2, $3, $4, $6, &@$);
1646 /*% %*/
1647 /*% ripper: opassign!(field!($1, $2, $3), $4, $6) %*/
1648 }
1649 | primary_value tCOLON2 tCONSTANT tOP_ASGN lex_ctxt command_rhs
1650 {
1651 /*%%%*/
1652 YYLTYPE loc = code_loc_gen(&@1, &@3);
1653 $$ = new_const_op_assign(p, NEW_COLON2($1, $3, &loc), $4, $6, $5, &@$);
1654 /*% %*/
1655 /*% ripper: opassign!(const_path_field!($1, $3), $4, $6) %*/
1656 }
1657 | primary_value tCOLON2 tIDENTIFIER tOP_ASGN lex_ctxt command_rhs
1658 {
1659 /*%%%*/
1660 $$ = new_attr_op_assign(p, $1, ID2VAL(idCOLON2), $3, $4, $6, &@$);
1661 /*% %*/
1662 /*% ripper: opassign!(field!($1, ID2VAL(idCOLON2), $3), $4, $6) %*/
1663 }
1664 | defn_head f_opt_paren_args '=' command
1665 {
1666 endless_method_name(p, $<node>1, &@1);
1667 restore_defun(p, $<node>1->nd_defn);
1668 /*%%%*/
1669 $$ = set_defun_body(p, $1, $2, $4, &@$);
1670 /*% %*/
1671 /*% ripper[$4]: bodystmt!($4, Qnil, Qnil, Qnil) %*/
1672 /*% ripper: def!(get_value($1), $2, $4) %*/
1673 local_pop(p);
1674 }
1675 | defn_head f_opt_paren_args '=' command modifier_rescue arg
1676 {
1677 endless_method_name(p, $<node>1, &@1);
1678 restore_defun(p, $<node>1->nd_defn);
1679 /*%%%*/
1680 $4 = rescued_expr(p, $4, $6, &@4, &@5, &@6);
1681 $$ = set_defun_body(p, $1, $2, $4, &@$);
1682 /*% %*/
1683 /*% ripper[$4]: bodystmt!(rescue_mod!($4, $6), Qnil, Qnil, Qnil) %*/
1684 /*% ripper: def!(get_value($1), $2, $4) %*/
1685 local_pop(p);
1686 }
1687 | defs_head f_opt_paren_args '=' command
1688 {
1689 endless_method_name(p, $<node>1, &@1);
1690 restore_defun(p, $<node>1->nd_defn);
1691 /*%%%*/
1692 $$ = set_defun_body(p, $1, $2, $4, &@$);
1693 /*%
1694 $1 = get_value($1);
1695 %*/
1696 /*% ripper[$4]: bodystmt!($4, Qnil, Qnil, Qnil) %*/
1697 /*% ripper: defs!(AREF($1, 0), AREF($1, 1), AREF($1, 2), $2, $4) %*/
1698 local_pop(p);
1699 }
1700 | defs_head f_opt_paren_args '=' command modifier_rescue arg
1701 {
1702 endless_method_name(p, $<node>1, &@1);
1703 restore_defun(p, $<node>1->nd_defn);
1704 /*%%%*/
1705 $4 = rescued_expr(p, $4, $6, &@4, &@5, &@6);
1706 $$ = set_defun_body(p, $1, $2, $4, &@$);
1707 /*%
1708 $1 = get_value($1);
1709 %*/
1710 /*% ripper[$4]: bodystmt!(rescue_mod!($4, $6), Qnil, Qnil, Qnil) %*/
1711 /*% ripper: defs!(AREF($1, 0), AREF($1, 1), AREF($1, 2), $2, $4) %*/
1712 local_pop(p);
1713 }
1714 | backref tOP_ASGN lex_ctxt command_rhs
1715 {
1716 /*%%%*/
1717 rb_backref_error(p, $1);
1718 $$ = NEW_BEGIN(0, &@$);
1719 /*% %*/
1720 /*% ripper[error]: backref_error(p, RNODE($1), assign!(var_field(p, $1), $4)) %*/
1721 }
1722 ;
1723
1724 command_rhs : command_call %prec tOP_ASGN
1725 {
1726 value_expr($1);
1727 $$ = $1;
1728 }
1729 | command_call modifier_rescue stmt
1730 {
1731 /*%%%*/
1732 YYLTYPE loc = code_loc_gen(&@2, &@3);
1733 value_expr($1);
1734 $$ = NEW_RESCUE($1, NEW_RESBODY(0, remove_begin($3), 0, &loc), 0, &@$);
1735 /*% %*/
1736 /*% ripper: rescue_mod!($1, $3) %*/
1737 }
1738 | command_asgn
1739 ;
1740
1741 expr : command_call
1742 | expr keyword_and expr
1743 {
1744 $$ = logop(p, idAND, $1, $3, &@2, &@$);
1745 }
1746 | expr keyword_or expr
1747 {
1748 $$ = logop(p, idOR, $1, $3, &@2, &@$);
1749 }
1750 | keyword_not opt_nl expr
1751 {
1752 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
1753 }
1754 | '!' command_call
1755 {
1756 $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$);
1757 }
1758 | arg tASSOC
1759 {
1760 value_expr($1);
1761 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
1762 p->command_start = FALSE;
1763 $<ctxt>2 = p->ctxt;
1764 p->ctxt.in_kwarg = 1;
1765 $<tbl>$ = push_pvtbl(p);
1766 }
1767 p_top_expr_body
1768 {
1769 pop_pvtbl(p, $<tbl>3);
1770 p->ctxt.in_kwarg = $<ctxt>2.in_kwarg;
1771 /*%%%*/
1772 $$ = NEW_CASE3($1, NEW_IN($4, 0, 0, &@4), &@$);
1773 /*% %*/
1774 /*% ripper: case!($1, in!($4, Qnil, Qnil)) %*/
1775 }
1776 | arg keyword_in
1777 {
1778 value_expr($1);
1779 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
1780 p->command_start = FALSE;
1781 $<ctxt>2 = p->ctxt;
1782 p->ctxt.in_kwarg = 1;
1783 $<tbl>$ = push_pvtbl(p);
1784 }
1785 p_top_expr_body
1786 {
1787 pop_pvtbl(p, $<tbl>3);
1788 p->ctxt.in_kwarg = $<ctxt>1.in_kwarg;
1789 /*%%%*/
1790 $$ = NEW_CASE3($1, NEW_IN($4, NEW_TRUE(&@4), NEW_FALSE(&@4), &@4), &@$);
1791 /*% %*/
1792 /*% ripper: case!($1, in!($4, Qnil, Qnil)) %*/
1793 }
1794 | arg %prec tLBRACE_ARG
1795 ;
1796
1797 def_name : fname
1798 {
1799 ID fname = get_id($1);
1800 ID cur_arg = p->cur_arg;
1801 YYSTYPE c = {.ctxt = p->ctxt};
1802 numparam_name(p, fname);
1803 local_push(p, 0);
1804 p->cur_arg = 0;
1805 p->ctxt.in_def = 1;
1806 $<node>$ = NEW_NODE(NODE_SELF, /*vid*/cur_arg, /*mid*/fname, /*cval*/c.val, &@$);
1807 /*%%%*/
1808 /*%
1809 $$ = NEW_RIPPER(fname, get_value($1), $$, &NULL_LOC);
1810 %*/
1811 }
1812 ;
1813
1814 defn_head : k_def def_name
1815 {
1816 $$ = $2;
1817 /*%%%*/
1818 $$ = NEW_NODE(NODE_DEFN, 0, $$->nd_mid, $$, &@$);
1819 /*% %*/
1820 }
1821 ;
1822
1823 defs_head : k_def singleton dot_or_colon
1824 {
1825 SET_LEX_STATE(EXPR_FNAME);
1826 p->ctxt.in_argdef = 1;
1827 }
1828 def_name
1829 {
1830 SET_LEX_STATE(EXPR_ENDFN|EXPR_LABEL); /* force for args */
1831 $$ = $5;
1832 /*%%%*/
1833 $$ = NEW_NODE(NODE_DEFS, $2, $$->nd_mid, $$, &@$);
1834 /*%
1835 VALUE ary = rb_ary_new_from_args(3, $2, $3, get_value($$));
1836 add_mark_object(p, ary);
1837 $<node>$->nd_rval = ary;
1838 %*/
1839 }
1840 ;
1841
1842 expr_value : expr
1843 {
1844 value_expr($1);
1845 $$ = $1;
1846 }
1847 ;
1848
1849 expr_value_do : {COND_PUSH(1);} expr_value do {COND_POP();}
1850 {
1851 $$ = $2;
1852 }
1853 ;
1854
1855 command_call : command
1856 | block_command
1857 ;
1858
1859 block_command : block_call
1860 | block_call call_op2 operation2 command_args
1861 {
1862 /*%%%*/
1863 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
1864 /*% %*/
1865 /*% ripper: method_add_arg!(call!($1, $2, $3), $4) %*/
1866 }
1867 ;
1868
1869 cmd_brace_block : tLBRACE_ARG brace_body '}'
1870 {
1871 $$ = $2;
1872 /*%%%*/
1873 $$->nd_body->nd_loc = code_loc_gen(&@1, &@3);
1874 nd_set_line($$, @1.end_pos.lineno);
1875 /*% %*/
1876 }
1877 ;
1878
1879 fcall : operation
1880 {
1881 /*%%%*/
1882 $$ = NEW_FCALL($1, 0, &@$);
1883 nd_set_line($$, p->tokline);
1884 /*% %*/
1885 /*% ripper: $1 %*/
1886 }
1887 ;
1888
1889 command : fcall command_args %prec tLOWEST
1890 {
1891 /*%%%*/
1892 $1->nd_args = $2;
1893 nd_set_last_loc($1, @2.end_pos);
1894 $$ = $1;
1895 /*% %*/
1896 /*% ripper: command!($1, $2) %*/
1897 }
1898 | fcall command_args cmd_brace_block
1899 {
1900 /*%%%*/
1901 block_dup_check(p, $2, $3);
1902 $1->nd_args = $2;
1903 $$ = method_add_block(p, $1, $3, &@$);
1904 fixpos($$, $1);
1905 nd_set_last_loc($1, @2.end_pos);
1906 /*% %*/
1907 /*% ripper: method_add_block!(command!($1, $2), $3) %*/
1908 }
1909 | primary_value call_op operation2 command_args %prec tLOWEST
1910 {
1911 /*%%%*/
1912 $$ = new_command_qcall(p, $2, $1, $3, $4, Qnull, &@3, &@$);
1913 /*% %*/
1914 /*% ripper: command_call!($1, $2, $3, $4) %*/
1915 }
1916 | primary_value call_op operation2 command_args cmd_brace_block
1917 {
1918 /*%%%*/
1919 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
1920 /*% %*/
1921 /*% ripper: method_add_block!(command_call!($1, $2, $3, $4), $5) %*/
1922 }
1923 | primary_value tCOLON2 operation2 command_args %prec tLOWEST
1924 {
1925 /*%%%*/
1926 $$ = new_command_qcall(p, ID2VAL(idCOLON2), $1, $3, $4, Qnull, &@3, &@$);
1927 /*% %*/
1928 /*% ripper: command_call!($1, ID2VAL(idCOLON2), $3, $4) %*/
1929 }
1930 | primary_value tCOLON2 operation2 command_args cmd_brace_block
1931 {
1932 /*%%%*/
1933 $$ = new_command_qcall(p, ID2VAL(idCOLON2), $1, $3, $4, $5, &@3, &@$);
1934 /*% %*/
1935 /*% ripper: method_add_block!(command_call!($1, ID2VAL(idCOLON2), $3, $4), $5) %*/
1936 }
1937 | keyword_super command_args
1938 {
1939 /*%%%*/
1940 $$ = NEW_SUPER($2, &@$);
1941 fixpos($$, $2);
1942 /*% %*/
1943 /*% ripper: super!($2) %*/
1944 }
1945 | keyword_yield command_args
1946 {
1947 /*%%%*/
1948 $$ = new_yield(p, $2, &@$);
1949 fixpos($$, $2);
1950 /*% %*/
1951 /*% ripper: yield!($2) %*/
1952 }
1953 | k_return call_args
1954 {
1955 /*%%%*/
1956 $$ = NEW_RETURN(ret_args(p, $2), &@$);
1957 /*% %*/
1958 /*% ripper: return!($2) %*/
1959 }
1960 | keyword_break call_args
1961 {
1962 /*%%%*/
1963 $$ = NEW_BREAK(ret_args(p, $2), &@$);
1964 /*% %*/
1965 /*% ripper: break!($2) %*/
1966 }
1967 | keyword_next call_args
1968 {
1969 /*%%%*/
1970 $$ = NEW_NEXT(ret_args(p, $2), &@$);
1971 /*% %*/
1972 /*% ripper: next!($2) %*/
1973 }
1974 ;
1975
1976 mlhs : mlhs_basic
1977 | tLPAREN mlhs_inner rparen
1978 {
1979 /*%%%*/
1980 $$ = $2;
1981 /*% %*/
1982 /*% ripper: mlhs_paren!($2) %*/
1983 }
1984 ;
1985
1986 mlhs_inner : mlhs_basic
1987 | tLPAREN mlhs_inner rparen
1988 {
1989 /*%%%*/
1990 $$ = NEW_MASGN(NEW_LIST($2, &@$), 0, &@$);
1991 /*% %*/
1992 /*% ripper: mlhs_paren!($2) %*/
1993 }
1994 ;
1995
1996 mlhs_basic : mlhs_head
1997 {
1998 /*%%%*/
1999 $$ = NEW_MASGN($1, 0, &@$);
2000 /*% %*/
2001 /*% ripper: $1 %*/
2002 }
2003 | mlhs_head mlhs_item
2004 {
2005 /*%%%*/
2006 $$ = NEW_MASGN(list_append(p, $1,$2), 0, &@$);
2007 /*% %*/
2008 /*% ripper: mlhs_add!($1, $2) %*/
2009 }
2010 | mlhs_head tSTAR mlhs_node
2011 {
2012 /*%%%*/
2013 $$ = NEW_MASGN($1, $3, &@$);
2014 /*% %*/
2015 /*% ripper: mlhs_add_star!($1, $3) %*/
2016 }
2017 | mlhs_head tSTAR mlhs_node ',' mlhs_post
2018 {
2019 /*%%%*/
2020 $$ = NEW_MASGN($1, NEW_POSTARG($3,$5,&@$), &@$);
2021 /*% %*/
2022 /*% ripper: mlhs_add_post!(mlhs_add_star!($1, $3), $5) %*/
2023 }
2024 | mlhs_head tSTAR
2025 {
2026 /*%%%*/
2027 $$ = NEW_MASGN($1, NODE_SPECIAL_NO_NAME_REST, &@$);
2028 /*% %*/
2029 /*% ripper: mlhs_add_star!($1, Qnil) %*/
2030 }
2031 | mlhs_head tSTAR ',' mlhs_post
2032 {
2033 /*%%%*/
2034 $$ = NEW_MASGN($1, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $4, &@$), &@$);
2035 /*% %*/
2036 /*% ripper: mlhs_add_post!(mlhs_add_star!($1, Qnil), $4) %*/
2037 }
2038 | tSTAR mlhs_node
2039 {
2040 /*%%%*/
2041 $$ = NEW_MASGN(0, $2, &@$);
2042 /*% %*/
2043 /*% ripper: mlhs_add_star!(mlhs_new!, $2) %*/
2044 }
2045 | tSTAR mlhs_node ',' mlhs_post
2046 {
2047 /*%%%*/
2048 $$ = NEW_MASGN(0, NEW_POSTARG($2,$4,&@$), &@$);
2049 /*% %*/
2050 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $2), $4) %*/
2051 }
2052 | tSTAR
2053 {
2054 /*%%%*/
2055 $$ = NEW_MASGN(0, NODE_SPECIAL_NO_NAME_REST, &@$);
2056 /*% %*/
2057 /*% ripper: mlhs_add_star!(mlhs_new!, Qnil) %*/
2058 }
2059 | tSTAR ',' mlhs_post
2060 {
2061 /*%%%*/
2062 $$ = NEW_MASGN(0, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $3, &@$), &@$);
2063 /*% %*/
2064 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, Qnil), $3) %*/
2065 }
2066 ;
2067
2068 mlhs_item : mlhs_node
2069 | tLPAREN mlhs_inner rparen
2070 {
2071 /*%%%*/
2072 $$ = $2;
2073 /*% %*/
2074 /*% ripper: mlhs_paren!($2) %*/
2075 }
2076 ;
2077
2078 mlhs_head : mlhs_item ','
2079 {
2080 /*%%%*/
2081 $$ = NEW_LIST($1, &@1);
2082 /*% %*/
2083 /*% ripper: mlhs_add!(mlhs_new!, $1) %*/
2084 }
2085 | mlhs_head mlhs_item ','
2086 {
2087 /*%%%*/
2088 $$ = list_append(p, $1, $2);
2089 /*% %*/
2090 /*% ripper: mlhs_add!($1, $2) %*/
2091 }
2092 ;
2093
2094 mlhs_post : mlhs_item
2095 {
2096 /*%%%*/
2097 $$ = NEW_LIST($1, &@$);
2098 /*% %*/
2099 /*% ripper: mlhs_add!(mlhs_new!, $1) %*/
2100 }
2101 | mlhs_post ',' mlhs_item
2102 {
2103 /*%%%*/
2104 $$ = list_append(p, $1, $3);
2105 /*% %*/
2106 /*% ripper: mlhs_add!($1, $3) %*/
2107 }
2108 ;
2109
2110 mlhs_node : user_variable
2111 {
2112 /*%%%*/
2113 $$ = assignable(p, $1, 0, &@$);
2114 /*% %*/
2115 /*% ripper: assignable(p, var_field(p, $1)) %*/
2116 }
2117 | keyword_variable
2118 {
2119 /*%%%*/
2120 $$ = assignable(p, $1, 0, &@$);
2121 /*% %*/
2122 /*% ripper: assignable(p, var_field(p, $1)) %*/
2123 }
2124 | primary_value '[' opt_call_args rbracket
2125 {
2126 /*%%%*/
2127 $$ = aryset(p, $1, $3, &@$);
2128 /*% %*/
2129 /*% ripper: aref_field!($1, escape_Qundef($3)) %*/
2130 }
2131 | primary_value call_op tIDENTIFIER
2132 {
2133 if ($2 == tANDDOT) {
2134 yyerror1(&@2, "&. inside multiple assignment destination");
2135 }
2136 /*%%%*/
2137 $$ = attrset(p, $1, $2, $3, &@$);
2138 /*% %*/
2139 /*% ripper: field!($1, $2, $3) %*/
2140 }
2141 | primary_value tCOLON2 tIDENTIFIER
2142 {
2143 /*%%%*/
2144 $$ = attrset(p, $1, idCOLON2, $3, &@$);
2145 /*% %*/
2146 /*% ripper: const_path_field!($1, $3) %*/
2147 }
2148 | primary_value call_op tCONSTANT
2149 {
2150 if ($2 == tANDDOT) {
2151 yyerror1(&@2, "&. inside multiple assignment destination");
2152 }
2153 /*%%%*/
2154 $$ = attrset(p, $1, $2, $3, &@$);
2155 /*% %*/
2156 /*% ripper: field!($1, $2, $3) %*/
2157 }
2158 | primary_value tCOLON2 tCONSTANT
2159 {
2160 /*%%%*/
2161 $$ = const_decl(p, NEW_COLON2($1, $3, &@$), &@$);
2162 /*% %*/
2163 /*% ripper: const_decl(p, const_path_field!($1, $3)) %*/
2164 }
2165 | tCOLON3 tCONSTANT
2166 {
2167 /*%%%*/
2168 $$ = const_decl(p, NEW_COLON3($2, &@$), &@$);
2169 /*% %*/
2170 /*% ripper: const_decl(p, top_const_field!($2)) %*/
2171 }
2172 | backref
2173 {
2174 /*%%%*/
2175 rb_backref_error(p, $1);
2176 $$ = NEW_BEGIN(0, &@$);
2177 /*% %*/
2178 /*% ripper[error]: backref_error(p, RNODE($1), var_field(p, $1)) %*/
2179 }
2180 ;
2181
2182 lhs : user_variable
2183 {
2184 /*%%%*/
2185 $$ = assignable(p, $1, 0, &@$);
2186 /*% %*/
2187 /*% ripper: assignable(p, var_field(p, $1)) %*/
2188 }
2189 | keyword_variable
2190 {
2191 /*%%%*/
2192 $$ = assignable(p, $1, 0, &@$);
2193 /*% %*/
2194 /*% ripper: assignable(p, var_field(p, $1)) %*/
2195 }
2196 | primary_value '[' opt_call_args rbracket
2197 {
2198 /*%%%*/
2199 $$ = aryset(p, $1, $3, &@$);
2200 /*% %*/
2201 /*% ripper: aref_field!($1, escape_Qundef($3)) %*/
2202 }
2203 | primary_value call_op tIDENTIFIER
2204 {
2205 /*%%%*/
2206 $$ = attrset(p, $1, $2, $3, &@$);
2207 /*% %*/
2208 /*% ripper: field!($1, $2, $3) %*/
2209 }
2210 | primary_value tCOLON2 tIDENTIFIER
2211 {
2212 /*%%%*/
2213 $$ = attrset(p, $1, idCOLON2, $3, &@$);
2214 /*% %*/
2215 /*% ripper: field!($1, ID2VAL(idCOLON2), $3) %*/
2216 }
2217 | primary_value call_op tCONSTANT
2218 {
2219 /*%%%*/
2220 $$ = attrset(p, $1, $2, $3, &@$);
2221 /*% %*/
2222 /*% ripper: field!($1, $2, $3) %*/
2223 }
2224 | primary_value tCOLON2 tCONSTANT
2225 {
2226 /*%%%*/
2227 $$ = const_decl(p, NEW_COLON2($1, $3, &@$), &@$);
2228 /*% %*/
2229 /*% ripper: const_decl(p, const_path_field!($1, $3)) %*/
2230 }
2231 | tCOLON3 tCONSTANT
2232 {
2233 /*%%%*/
2234 $$ = const_decl(p, NEW_COLON3($2, &@$), &@$);
2235 /*% %*/
2236 /*% ripper: const_decl(p, top_const_field!($2)) %*/
2237 }
2238 | backref
2239 {
2240 /*%%%*/
2241 rb_backref_error(p, $1);
2242 $$ = NEW_BEGIN(0, &@$);
2243 /*% %*/
2244 /*% ripper[error]: backref_error(p, RNODE($1), var_field(p, $1)) %*/
2245 }
2246 ;
2247
2248 cname : tIDENTIFIER
2249 {
2250 static const char mesg[] = "class/module name must be CONSTANT";
2251 /*%%%*/
2252 yyerror1(&@1, mesg);
2253 /*% %*/
2254 /*% ripper[error]: class_name_error!(ERR_MESG(), $1) %*/
2255 }
2256 | tCONSTANT
2257 ;
2258
2259 cpath : tCOLON3 cname
2260 {
2261 /*%%%*/
2262 $$ = NEW_COLON3($2, &@$);
2263 /*% %*/
2264 /*% ripper: top_const_ref!($2) %*/
2265 }
2266 | cname
2267 {
2268 /*%%%*/
2269 $$ = NEW_COLON2(0, $$, &@$);
2270 /*% %*/
2271 /*% ripper: const_ref!($1) %*/
2272 }
2273 | primary_value tCOLON2 cname
2274 {
2275 /*%%%*/
2276 $$ = NEW_COLON2($1, $3, &@$);
2277 /*% %*/
2278 /*% ripper: const_path_ref!($1, $3) %*/
2279 }
2280 ;
2281
2282 fname : tIDENTIFIER
2283 | tCONSTANT
2284 | tFID
2285 | op
2286 {
2287 SET_LEX_STATE(EXPR_ENDFN);
2288 $$ = $1;
2289 }
2290 | reswords
2291 ;
2292
2293 fitem : fname
2294 {
2295 /*%%%*/
2296 $$ = NEW_LIT(ID2SYM($1), &@$);
2297 /*% %*/
2298 /*% ripper: symbol_literal!($1) %*/
2299 }
2300 | symbol
2301 ;
2302
2303 undef_list : fitem
2304 {
2305 /*%%%*/
2306 $$ = NEW_UNDEF($1, &@$);
2307 /*% %*/
2308 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
2309 }
2310 | undef_list ',' {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem
2311 {
2312 /*%%%*/
2313 NODE *undef = NEW_UNDEF($4, &@4);
2314 $$ = block_append(p, $1, undef);
2315 /*% %*/
2316 /*% ripper: rb_ary_push($1, get_value($4)) %*/
2317 }
2318 ;
2319
2320 op : '|' { ifndef_ripper($$ = '|'); }
2321 | '^' { ifndef_ripper($$ = '^'); }
2322 | '&' { ifndef_ripper($$ = '&'); }
2323 | tCMP { ifndef_ripper($$ = tCMP); }
2324 | tEQ { ifndef_ripper($$ = tEQ); }
2325 | tEQQ { ifndef_ripper($$ = tEQQ); }
2326 | tMATCH { ifndef_ripper($$ = tMATCH); }
2327 | tNMATCH { ifndef_ripper($$ = tNMATCH); }
2328 | '>' { ifndef_ripper($$ = '>'); }
2329 | tGEQ { ifndef_ripper($$ = tGEQ); }
2330 | '<' { ifndef_ripper($$ = '<'); }
2331 | tLEQ { ifndef_ripper($$ = tLEQ); }
2332 | tNEQ { ifndef_ripper($$ = tNEQ); }
2333 | tLSHFT { ifndef_ripper($$ = tLSHFT); }
2334 | tRSHFT { ifndef_ripper($$ = tRSHFT); }
2335 | '+' { ifndef_ripper($$ = '+'); }
2336 | '-' { ifndef_ripper($$ = '-'); }
2337 | '*' { ifndef_ripper($$ = '*'); }
2338 | tSTAR { ifndef_ripper($$ = '*'); }
2339 | '/' { ifndef_ripper($$ = '/'); }
2340 | '%' { ifndef_ripper($$ = '%'); }
2341 | tPOW { ifndef_ripper($$ = tPOW); }
2342 | tDSTAR { ifndef_ripper($$ = tDSTAR); }
2343 | '!' { ifndef_ripper($$ = '!'); }
2344 | '~' { ifndef_ripper($$ = '~'); }
2345 | tUPLUS { ifndef_ripper($$ = tUPLUS); }
2346 | tUMINUS { ifndef_ripper($$ = tUMINUS); }
2347 | tAREF { ifndef_ripper($$ = tAREF); }
2348 | tASET { ifndef_ripper($$ = tASET); }
2349 | '`' { ifndef_ripper($$ = '`'); }
2350 ;
2351
2352 reswords : keyword__LINE__ | keyword__FILE__ | keyword__ENCODING__
2353 | keyword_BEGIN | keyword_END
2354 | keyword_alias | keyword_and | keyword_begin
2355 | keyword_break | keyword_case | keyword_class | keyword_def
2356 | keyword_defined | keyword_do | keyword_else | keyword_elsif
2357 | keyword_end | keyword_ensure | keyword_false
2358 | keyword_for | keyword_in | keyword_module | keyword_next
2359 | keyword_nil | keyword_not | keyword_or | keyword_redo
2360 | keyword_rescue | keyword_retry | keyword_return | keyword_self
2361 | keyword_super | keyword_then | keyword_true | keyword_undef
2362 | keyword_when | keyword_yield | keyword_if | keyword_unless
2363 | keyword_while | keyword_until
2364 ;
2365
2366 arg : lhs '=' lex_ctxt arg_rhs
2367 {
2368 /*%%%*/
2369 $$ = node_assign(p, $1, $4, $3, &@$);
2370 /*% %*/
2371 /*% ripper: assign!($1, $4) %*/
2372 }
2373 | var_lhs tOP_ASGN lex_ctxt arg_rhs
2374 {
2375 /*%%%*/
2376 $$ = new_op_assign(p, $1, $2, $4, $3, &@$);
2377 /*% %*/
2378 /*% ripper: opassign!($1, $2, $4) %*/
2379 }
2380 | primary_value '[' opt_call_args rbracket tOP_ASGN lex_ctxt arg_rhs
2381 {
2382 /*%%%*/
2383 $$ = new_ary_op_assign(p, $1, $3, $5, $7, &@3, &@$);
2384 /*% %*/
2385 /*% ripper: opassign!(aref_field!($1, escape_Qundef($3)), $5, $7) %*/
2386 }
2387 | primary_value call_op tIDENTIFIER tOP_ASGN lex_ctxt arg_rhs
2388 {
2389 /*%%%*/
2390 $$ = new_attr_op_assign(p, $1, $2, $3, $4, $6, &@$);
2391 /*% %*/
2392 /*% ripper: opassign!(field!($1, $2, $3), $4, $6) %*/
2393 }
2394 | primary_value call_op tCONSTANT tOP_ASGN lex_ctxt arg_rhs
2395 {
2396 /*%%%*/
2397 $$ = new_attr_op_assign(p, $1, $2, $3, $4, $6, &@$);
2398 /*% %*/
2399 /*% ripper: opassign!(field!($1, $2, $3), $4, $6) %*/
2400 }
2401 | primary_value tCOLON2 tIDENTIFIER tOP_ASGN lex_ctxt arg_rhs
2402 {
2403 /*%%%*/
2404 $$ = new_attr_op_assign(p, $1, ID2VAL(idCOLON2), $3, $4, $6, &@$);
2405 /*% %*/
2406 /*% ripper: opassign!(field!($1, ID2VAL(idCOLON2), $3), $4, $6) %*/
2407 }
2408 | primary_value tCOLON2 tCONSTANT tOP_ASGN lex_ctxt arg_rhs
2409 {
2410 /*%%%*/
2411 YYLTYPE loc = code_loc_gen(&@1, &@3);
2412 $$ = new_const_op_assign(p, NEW_COLON2($1, $3, &loc), $4, $6, $5, &@$);
2413 /*% %*/
2414 /*% ripper: opassign!(const_path_field!($1, $3), $4, $6) %*/
2415 }
2416 | tCOLON3 tCONSTANT tOP_ASGN lex_ctxt arg_rhs
2417 {
2418 /*%%%*/
2419 YYLTYPE loc = code_loc_gen(&@1, &@2);
2420 $$ = new_const_op_assign(p, NEW_COLON3($2, &loc), $3, $5, $4, &@$);
2421 /*% %*/
2422 /*% ripper: opassign!(top_const_field!($2), $3, $5) %*/
2423 }
2424 | backref tOP_ASGN lex_ctxt arg_rhs
2425 {
2426 /*%%%*/
2427 rb_backref_error(p, $1);
2428 $$ = NEW_BEGIN(0, &@$);
2429 /*% %*/
2430 /*% ripper[error]: backref_error(p, RNODE($1), opassign!(var_field(p, $1), $2, $4)) %*/
2431 }
2432 | arg tDOT2 arg
2433 {
2434 /*%%%*/
2435 value_expr($1);
2436 value_expr($3);
2437 $$ = NEW_DOT2($1, $3, &@$);
2438 /*% %*/
2439 /*% ripper: dot2!($1, $3) %*/
2440 }
2441 | arg tDOT3 arg
2442 {
2443 /*%%%*/
2444 value_expr($1);
2445 value_expr($3);
2446 $$ = NEW_DOT3($1, $3, &@$);
2447 /*% %*/
2448 /*% ripper: dot3!($1, $3) %*/
2449 }
2450 | arg tDOT2
2451 {
2452 /*%%%*/
2453 value_expr($1);
2454 $$ = NEW_DOT2($1, new_nil_at(p, &@2.end_pos), &@$);
2455 /*% %*/
2456 /*% ripper: dot2!($1, Qnil) %*/
2457 }
2458 | arg tDOT3
2459 {
2460 /*%%%*/
2461 value_expr($1);
2462 $$ = NEW_DOT3($1, new_nil_at(p, &@2.end_pos), &@$);
2463 /*% %*/
2464 /*% ripper: dot3!($1, Qnil) %*/
2465 }
2466 | tBDOT2 arg
2467 {
2468 /*%%%*/
2469 value_expr($2);
2470 $$ = NEW_DOT2(new_nil_at(p, &@1.beg_pos), $2, &@$);
2471 /*% %*/
2472 /*% ripper: dot2!(Qnil, $2) %*/
2473 }
2474 | tBDOT3 arg
2475 {
2476 /*%%%*/
2477 value_expr($2);
2478 $$ = NEW_DOT3(new_nil_at(p, &@1.beg_pos), $2, &@$);
2479 /*% %*/
2480 /*% ripper: dot3!(Qnil, $2) %*/
2481 }
2482 | arg '+' arg
2483 {
2484 $$ = call_bin_op(p, $1, '+', $3, &@2, &@$);
2485 }
2486 | arg '-' arg
2487 {
2488 $$ = call_bin_op(p, $1, '-', $3, &@2, &@$);
2489 }
2490 | arg '*' arg
2491 {
2492 $$ = call_bin_op(p, $1, '*', $3, &@2, &@$);
2493 }
2494 | arg '/' arg
2495 {
2496 $$ = call_bin_op(p, $1, '/', $3, &@2, &@$);
2497 }
2498 | arg '%' arg
2499 {
2500 $$ = call_bin_op(p, $1, '%', $3, &@2, &@$);
2501 }
2502 | arg tPOW arg
2503 {
2504 $$ = call_bin_op(p, $1, idPow, $3, &@2, &@$);
2505 }
2506 | tUMINUS_NUM simple_numeric tPOW arg
2507 {
2508 $$ = call_uni_op(p, call_bin_op(p, $2, idPow, $4, &@2, &@$), idUMinus, &@1, &@$);
2509 }
2510 | tUPLUS arg
2511 {
2512 $$ = call_uni_op(p, $2, idUPlus, &@1, &@$);
2513 }
2514 | tUMINUS arg
2515 {
2516 $$ = call_uni_op(p, $2, idUMinus, &@1, &@$);
2517 }
2518 | arg '|' arg
2519 {
2520 $$ = call_bin_op(p, $1, '|', $3, &@2, &@$);
2521 }
2522 | arg '^' arg
2523 {
2524 $$ = call_bin_op(p, $1, '^', $3, &@2, &@$);
2525 }
2526 | arg '&' arg
2527 {
2528 $$ = call_bin_op(p, $1, '&', $3, &@2, &@$);
2529 }
2530 | arg tCMP arg
2531 {
2532 $$ = call_bin_op(p, $1, idCmp, $3, &@2, &@$);
2533 }
2534 | rel_expr %prec tCMP
2535 | arg tEQ arg
2536 {
2537 $$ = call_bin_op(p, $1, idEq, $3, &@2, &@$);
2538 }
2539 | arg tEQQ arg
2540 {
2541 $$ = call_bin_op(p, $1, idEqq, $3, &@2, &@$);
2542 }
2543 | arg tNEQ arg
2544 {
2545 $$ = call_bin_op(p, $1, idNeq, $3, &@2, &@$);
2546 }
2547 | arg tMATCH arg
2548 {
2549 $$ = match_op(p, $1, $3, &@2, &@$);
2550 }
2551 | arg tNMATCH arg
2552 {
2553 $$ = call_bin_op(p, $1, idNeqTilde, $3, &@2, &@$);
2554 }
2555 | '!' arg
2556 {
2557 $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$);
2558 }
2559 | '~' arg
2560 {
2561 $$ = call_uni_op(p, $2, '~', &@1, &@$);
2562 }
2563 | arg tLSHFT arg
2564 {
2565 $$ = call_bin_op(p, $1, idLTLT, $3, &@2, &@$);
2566 }
2567 | arg tRSHFT arg
2568 {
2569 $$ = call_bin_op(p, $1, idGTGT, $3, &@2, &@$);
2570 }
2571 | arg tANDOP arg
2572 {
2573 $$ = logop(p, idANDOP, $1, $3, &@2, &@$);
2574 }
2575 | arg tOROP arg
2576 {
2577 $$ = logop(p, idOROP, $1, $3, &@2, &@$);
2578 }
2579 | keyword_defined opt_nl {p->ctxt.in_defined = 1;} arg
2580 {
2581 p->ctxt.in_defined = 0;
2582 $$ = new_defined(p, $4, &@$);
2583 }
2584 | arg '?' arg opt_nl ':' arg
2585 {
2586 /*%%%*/
2587 value_expr($1);
2588 $$ = new_if(p, $1, $3, $6, &@$);
2589 fixpos($$, $1);
2590 /*% %*/
2591 /*% ripper: ifop!($1, $3, $6) %*/
2592 }
2593 | defn_head f_opt_paren_args '=' arg
2594 {
2595 endless_method_name(p, $<node>1, &@1);
2596 restore_defun(p, $<node>1->nd_defn);
2597 /*%%%*/
2598 $$ = set_defun_body(p, $1, $2, $4, &@$);
2599 /*% %*/
2600 /*% ripper[$4]: bodystmt!($4, Qnil, Qnil, Qnil) %*/
2601 /*% ripper: def!(get_value($1), $2, $4) %*/
2602 local_pop(p);
2603 }
2604 | defn_head f_opt_paren_args '=' arg modifier_rescue arg
2605 {
2606 endless_method_name(p, $<node>1, &@1);
2607 restore_defun(p, $<node>1->nd_defn);
2608 /*%%%*/
2609 $4 = rescued_expr(p, $4, $6, &@4, &@5, &@6);
2610 $$ = set_defun_body(p, $1, $2, $4, &@$);
2611 /*% %*/
2612 /*% ripper[$4]: bodystmt!(rescue_mod!($4, $6), Qnil, Qnil, Qnil) %*/
2613 /*% ripper: def!(get_value($1), $2, $4) %*/
2614 local_pop(p);
2615 }
2616 | defs_head f_opt_paren_args '=' arg
2617 {
2618 endless_method_name(p, $<node>1, &@1);
2619 restore_defun(p, $<node>1->nd_defn);
2620 /*%%%*/
2621 $$ = set_defun_body(p, $1, $2, $4, &@$);
2622 /*%
2623 $1 = get_value($1);
2624 %*/
2625 /*% ripper[$4]: bodystmt!($4, Qnil, Qnil, Qnil) %*/
2626 /*% ripper: defs!(AREF($1, 0), AREF($1, 1), AREF($1, 2), $2, $4) %*/
2627 local_pop(p);
2628 }
2629 | defs_head f_opt_paren_args '=' arg modifier_rescue arg
2630 {
2631 endless_method_name(p, $<node>1, &@1);
2632 restore_defun(p, $<node>1->nd_defn);
2633 /*%%%*/
2634 $4 = rescued_expr(p, $4, $6, &@4, &@5, &@6);
2635 $$ = set_defun_body(p, $1, $2, $4, &@$);
2636 /*%
2637 $1 = get_value($1);
2638 %*/
2639 /*% ripper[$4]: bodystmt!(rescue_mod!($4, $6), Qnil, Qnil, Qnil) %*/
2640 /*% ripper: defs!(AREF($1, 0), AREF($1, 1), AREF($1, 2), $2, $4) %*/
2641 local_pop(p);
2642 }
2643 | primary
2644 {
2645 $$ = $1;
2646 }
2647 ;
2648
2649 relop : '>' {$$ = '>';}
2650 | '<' {$$ = '<';}
2651 | tGEQ {$$ = idGE;}
2652 | tLEQ {$$ = idLE;}
2653 ;
2654
2655 rel_expr : arg relop arg %prec '>'
2656 {
2657 $$ = call_bin_op(p, $1, $2, $3, &@2, &@$);
2658 }
2659 | rel_expr relop arg %prec '>'
2660 {
2661 rb_warning1("comparison '%s' after comparison", WARN_ID($2));
2662 $$ = call_bin_op(p, $1, $2, $3, &@2, &@$);
2663 }
2664 ;
2665
2666 lex_ctxt : tSP
2667 {
2668 $$ = p->ctxt;
2669 }
2670 | none
2671 {
2672 $$ = p->ctxt;
2673 }
2674 ;
2675
2676 arg_value : arg
2677 {
2678 value_expr($1);
2679 $$ = $1;
2680 }
2681 ;
2682
2683 aref_args : none
2684 | args trailer
2685 {
2686 $$ = $1;
2687 }
2688 | args ',' assocs trailer
2689 {
2690 /*%%%*/
2691 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
2692 /*% %*/
2693 /*% ripper: args_add!($1, bare_assoc_hash!($3)) %*/
2694 }
2695 | assocs trailer
2696 {
2697 /*%%%*/
2698 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@$) : 0;
2699 /*% %*/
2700 /*% ripper: args_add!(args_new!, bare_assoc_hash!($1)) %*/
2701 }
2702 ;
2703
2704 arg_rhs : arg %prec tOP_ASGN
2705 {
2706 value_expr($1);
2707 $$ = $1;
2708 }
2709 | arg modifier_rescue arg
2710 {
2711 /*%%%*/
2712 value_expr($1);
2713 $$ = rescued_expr(p, $1, $3, &@1, &@2, &@3);
2714 /*% %*/
2715 /*% ripper: rescue_mod!($1, $3) %*/
2716 }
2717 ;
2718
2719 paren_args : '(' opt_call_args rparen
2720 {
2721 /*%%%*/
2722 $$ = $2;
2723 /*% %*/
2724 /*% ripper: arg_paren!(escape_Qundef($2)) %*/
2725 }
2726 | '(' args ',' args_forward rparen
2727 {
2728 if (!check_forwarding_args(p)) {
2729 $$ = Qnone;
2730 }
2731 else {
2732 /*%%%*/
2733 $$ = new_args_forward_call(p, $2, &@4, &@$);
2734 /*% %*/
2735 /*% ripper: arg_paren!(args_add!($2, $4)) %*/
2736 }
2737 }
2738 | '(' args_forward rparen
2739 {
2740 if (!check_forwarding_args(p)) {
2741 $$ = Qnone;
2742 }
2743 else {
2744 /*%%%*/
2745 $$ = new_args_forward_call(p, 0, &@2, &@$);
2746 /*% %*/
2747 /*% ripper: arg_paren!($2) %*/
2748 }
2749 }
2750 ;
2751
2752 opt_paren_args : none
2753 | paren_args
2754 ;
2755
2756 opt_call_args : none
2757 | call_args
2758 | args ','
2759 {
2760 $$ = $1;
2761 }
2762 | args ',' assocs ','
2763 {
2764 /*%%%*/
2765 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
2766 /*% %*/
2767 /*% ripper: args_add!($1, bare_assoc_hash!($3)) %*/
2768 }
2769 | assocs ','
2770 {
2771 /*%%%*/
2772 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0;
2773 /*% %*/
2774 /*% ripper: args_add!(args_new!, bare_assoc_hash!($1)) %*/
2775 }
2776 ;
2777
2778 call_args : command
2779 {
2780 /*%%%*/
2781 value_expr($1);
2782 $$ = NEW_LIST($1, &@$);
2783 /*% %*/
2784 /*% ripper: args_add!(args_new!, $1) %*/
2785 }
2786 | args opt_block_arg
2787 {
2788 /*%%%*/
2789 $$ = arg_blk_pass($1, $2);
2790 /*% %*/
2791 /*% ripper: args_add_block!($1, $2) %*/
2792 }
2793 | assocs opt_block_arg
2794 {
2795 /*%%%*/
2796 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0;
2797 $$ = arg_blk_pass($$, $2);
2798 /*% %*/
2799 /*% ripper: args_add_block!(args_add!(args_new!, bare_assoc_hash!($1)), $2) %*/
2800 }
2801 | args ',' assocs opt_block_arg
2802 {
2803 /*%%%*/
2804 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
2805 $$ = arg_blk_pass($$, $4);
2806 /*% %*/
2807 /*% ripper: args_add_block!(args_add!($1, bare_assoc_hash!($3)), $4) %*/
2808 }
2809 | block_arg
2810 /*% ripper[brace]: args_add_block!(args_new!, $1) %*/
2811 ;
2812
2813 command_args : {
2814 /* If call_args starts with a open paren '(' or '[',
2815 * look-ahead reading of the letters calls CMDARG_PUSH(0),
2816 * but the push must be done after CMDARG_PUSH(1).
2817 * So this code makes them consistent by first cancelling
2818 * the premature CMDARG_PUSH(0), doing CMDARG_PUSH(1),
2819 * and finally redoing CMDARG_PUSH(0).
2820 */
2821 int lookahead = 0;
2822 switch (yychar) {
2823 case '(': case tLPAREN: case tLPAREN_ARG: case '[': case tLBRACK:
2824 lookahead = 1;
2825 }
2826 if (lookahead) CMDARG_POP();
2827 CMDARG_PUSH(1);
2828 if (lookahead) CMDARG_PUSH(0);
2829 }
2830 call_args
2831 {
2832 /* call_args can be followed by tLBRACE_ARG (that does CMDARG_PUSH(0) in the lexer)
2833 * but the push must be done after CMDARG_POP() in the parser.
2834 * So this code does CMDARG_POP() to pop 0 pushed by tLBRACE_ARG,
2835 * CMDARG_POP() to pop 1 pushed by command_args,
2836 * and CMDARG_PUSH(0) to restore back the flag set by tLBRACE_ARG.
2837 */
2838 int lookahead = 0;
2839 switch (yychar) {
2840 case tLBRACE_ARG:
2841 lookahead = 1;
2842 }
2843 if (lookahead) CMDARG_POP();
2844 CMDARG_POP();
2845 if (lookahead) CMDARG_PUSH(0);
2846 $$ = $2;
2847 }
2848 ;
2849
2850 block_arg : tAMPER arg_value
2851 {
2852 /*%%%*/
2853 $$ = NEW_BLOCK_PASS($2, &@$);
2854 /*% %*/
2855 /*% ripper: $2 %*/
2856 }
2857 | tAMPER
2858 {
2859 /*%%%*/
2860 if (!local_id(p, ANON_BLOCK_ID)) {
2861 compile_error(p, "no anonymous block parameter");
2862 }
2863 $$ = NEW_BLOCK_PASS(NEW_LVAR(ANON_BLOCK_ID, &@1), &@$);
2864 /*%
2865 $$ = Qnil;
2866 %*/
2867 }
2868 ;
2869
2870 opt_block_arg : ',' block_arg
2871 {
2872 $$ = $2;
2873 }
2874 | none
2875 {
2876 $$ = 0;
2877 }
2878 ;
2879
2880 /* value */
2881 args : arg_value
2882 {
2883 /*%%%*/
2884 $$ = NEW_LIST($1, &@$);
2885 /*% %*/
2886 /*% ripper: args_add!(args_new!, $1) %*/
2887 }
2888 | tSTAR arg_value
2889 {
2890 /*%%%*/
2891 $$ = NEW_SPLAT($2, &@$);
2892 /*% %*/
2893 /*% ripper: args_add_star!(args_new!, $2) %*/
2894 }
2895 | tSTAR
2896 {
2897 /*%%%*/
2898 if (!local_id(p, ANON_REST_ID)) {
2899 compile_error(p, "no anonymous rest parameter");
2900 }
2901 $$ = NEW_SPLAT(NEW_LVAR(ANON_REST_ID, &@1), &@$);
2902 /*% %*/
2903 /*% ripper: args_add_star!(args_new!, Qnil) %*/
2904 }
2905 | args ',' arg_value
2906 {
2907 /*%%%*/
2908 $$ = last_arg_append(p, $1, $3, &@$);
2909 /*% %*/
2910 /*% ripper: args_add!($1, $3) %*/
2911 }
2912 | args ',' tSTAR arg_value
2913 {
2914 /*%%%*/
2915 $$ = rest_arg_append(p, $1, $4, &@$);
2916 /*% %*/
2917 /*% ripper: args_add_star!($1, $4) %*/
2918 }
2919 | args ',' tSTAR
2920 {
2921 /*%%%*/
2922 if (!local_id(p, ANON_REST_ID)) {
2923 compile_error(p, "no anonymous rest parameter");
2924 }
2925 $$ = rest_arg_append(p, $1, NEW_LVAR(ANON_REST_ID, &@3), &@$);
2926 /*% %*/
2927 /*% ripper: args_add_star!($1, Qnil) %*/
2928 }
2929 ;
2930
2931 /* value */
2932 mrhs_arg : mrhs
2933 | arg_value
2934 ;
2935
2936 /* value */
2937 mrhs : args ',' arg_value
2938 {
2939 /*%%%*/
2940 $$ = last_arg_append(p, $1, $3, &@$);
2941 /*% %*/
2942 /*% ripper: mrhs_add!(mrhs_new_from_args!($1), $3) %*/
2943 }
2944 | args ',' tSTAR arg_value
2945 {
2946 /*%%%*/
2947 $$ = rest_arg_append(p, $1, $4, &@$);
2948 /*% %*/
2949 /*% ripper: mrhs_add_star!(mrhs_new_from_args!($1), $4) %*/
2950 }
2951 | tSTAR arg_value
2952 {
2953 /*%%%*/
2954 $$ = NEW_SPLAT($2, &@$);
2955 /*% %*/
2956 /*% ripper: mrhs_add_star!(mrhs_new!, $2) %*/
2957 }
2958 ;
2959
2960 primary : literal
2961 | strings
2962 | xstring
2963 | regexp
2964 | words
2965 | qwords
2966 | symbols
2967 | qsymbols
2968 | var_ref
2969 | backref
2970 | tFID
2971 {
2972 /*%%%*/
2973 $$ = NEW_FCALL($1, 0, &@$);
2974 /*% %*/
2975 /*% ripper: method_add_arg!(fcall!($1), args_new!) %*/
2976 }
2977 | k_begin
2978 {
2979 CMDARG_PUSH(0);
2980 }
2981 bodystmt
2982 k_end
2983 {
2984 CMDARG_POP();
2985 /*%%%*/
2986 set_line_body($3, @1.end_pos.lineno);
2987 $$ = NEW_BEGIN($3, &@$);
2988 nd_set_line($$, @1.end_pos.lineno);
2989 /*% %*/
2990 /*% ripper: begin!($3) %*/
2991 }
2992 | tLPAREN_ARG {SET_LEX_STATE(EXPR_ENDARG);} rparen
2993 {
2994 /*%%%*/
2995 $$ = NEW_BEGIN(0, &@$);
2996 /*% %*/
2997 /*% ripper: paren!(0) %*/
2998 }
2999 | tLPAREN_ARG stmt {SET_LEX_STATE(EXPR_ENDARG);} rparen
3000 {
3001 /*%%%*/
3002 if (nd_type_p($2, NODE_SELF)) $2->nd_state = 0;
3003 $$ = $2;
3004 /*% %*/
3005 /*% ripper: paren!($2) %*/
3006 }
3007 | tLPAREN compstmt ')'
3008 {
3009 /*%%%*/
3010 if (nd_type_p($2, NODE_SELF)) $2->nd_state = 0;
3011 $$ = $2;
3012 /*% %*/
3013 /*% ripper: paren!($2) %*/
3014 }
3015 | primary_value tCOLON2 tCONSTANT
3016 {
3017 /*%%%*/
3018 $$ = NEW_COLON2($1, $3, &@$);
3019 /*% %*/
3020 /*% ripper: const_path_ref!($1, $3) %*/
3021 }
3022 | tCOLON3 tCONSTANT
3023 {
3024 /*%%%*/
3025 $$ = NEW_COLON3($2, &@$);
3026 /*% %*/
3027 /*% ripper: top_const_ref!($2) %*/
3028 }
3029 | tLBRACK aref_args ']'
3030 {
3031 /*%%%*/
3032 $$ = make_list($2, &@$);
3033 /*% %*/
3034 /*% ripper: array!(escape_Qundef($2)) %*/
3035 }
3036 | tLBRACE assoc_list '}'
3037 {
3038 /*%%%*/
3039 $$ = new_hash(p, $2, &@$);
3040 $$->nd_brace = TRUE;
3041 /*% %*/
3042 /*% ripper: hash!(escape_Qundef($2)) %*/
3043 }
3044 | k_return
3045 {
3046 /*%%%*/
3047 $$ = NEW_RETURN(0, &@$);
3048 /*% %*/
3049 /*% ripper: return0! %*/
3050 }
3051 | keyword_yield '(' call_args rparen
3052 {
3053 /*%%%*/
3054 $$ = new_yield(p, $3, &@$);
3055 /*% %*/
3056 /*% ripper: yield!(paren!($3)) %*/
3057 }
3058 | keyword_yield '(' rparen
3059 {
3060 /*%%%*/
3061 $$ = NEW_YIELD(0, &@$);
3062 /*% %*/
3063 /*% ripper: yield!(paren!(args_new!)) %*/
3064 }
3065 | keyword_yield
3066 {
3067 /*%%%*/
3068 $$ = NEW_YIELD(0, &@$);
3069 /*% %*/
3070 /*% ripper: yield0! %*/
3071 }
3072 | keyword_defined opt_nl '(' {p->ctxt.in_defined = 1;} expr rparen
3073 {
3074 p->ctxt.in_defined = 0;
3075 $$ = new_defined(p, $5, &@$);
3076 }
3077 | keyword_not '(' expr rparen
3078 {
3079 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
3080 }
3081 | keyword_not '(' rparen
3082 {
3083 $$ = call_uni_op(p, method_cond(p, new_nil(&@2), &@2), METHOD_NOT, &@1, &@$);
3084 }
3085 | fcall brace_block
3086 {
3087 /*%%%*/
3088 $$ = method_add_block(p, $1, $2, &@$);
3089 /*% %*/
3090 /*% ripper: method_add_block!(method_add_arg!(fcall!($1), args_new!), $2) %*/
3091 }
3092 | method_call
3093 | method_call brace_block
3094 {
3095 /*%%%*/
3096 block_dup_check(p, $1->nd_args, $2);
3097 $$ = method_add_block(p, $1, $2, &@$);
3098 /*% %*/
3099 /*% ripper: method_add_block!($1, $2) %*/
3100 }
3101 | lambda
3102 | k_if expr_value then
3103 compstmt
3104 if_tail
3105 k_end
3106 {
3107 /*%%%*/
3108 $$ = new_if(p, $2, $4, $5, &@$);
3109 fixpos($$, $2);
3110 /*% %*/
3111 /*% ripper: if!($2, $4, escape_Qundef($5)) %*/
3112 }
3113 | k_unless expr_value then
3114 compstmt
3115 opt_else
3116 k_end
3117 {
3118 /*%%%*/
3119 $$ = new_unless(p, $2, $4, $5, &@$);
3120 fixpos($$, $2);
3121 /*% %*/
3122 /*% ripper: unless!($2, $4, escape_Qundef($5)) %*/
3123 }
3124 | k_while expr_value_do
3125 compstmt
3126 k_end
3127 {
3128 /*%%%*/
3129 $$ = NEW_WHILE(cond(p, $2, &@2), $3, 1, &@$);
3130 fixpos($$, $2);
3131 /*% %*/
3132 /*% ripper: while!($2, $3) %*/
3133 }
3134 | k_until expr_value_do
3135 compstmt
3136 k_end
3137 {
3138 /*%%%*/
3139 $$ = NEW_UNTIL(cond(p, $2, &@2), $3, 1, &@$);
3140 fixpos($$, $2);
3141 /*% %*/
3142 /*% ripper: until!($2, $3) %*/
3143 }
3144 | k_case expr_value opt_terms
3145 {
3146 $<val>$ = p->case_labels;
3147 p->case_labels = Qnil;
3148 }
3149 case_body
3150 k_end
3151 {
3152 if (RTEST(p->case_labels)) rb_hash_clear(p->case_labels);
3153 p->case_labels = $<val>4;
3154 /*%%%*/
3155 $$ = NEW_CASE($2, $5, &@$);
3156 fixpos($$, $2);
3157 /*% %*/
3158 /*% ripper: case!($2, $5) %*/
3159 }
3160 | k_case opt_terms
3161 {
3162 $<val>$ = p->case_labels;
3163 p->case_labels = 0;
3164 }
3165 case_body
3166 k_end
3167 {
3168 if (RTEST(p->case_labels)) rb_hash_clear(p->case_labels);
3169 p->case_labels = $<val>3;
3170 /*%%%*/
3171 $$ = NEW_CASE2($4, &@$);
3172 /*% %*/
3173 /*% ripper: case!(Qnil, $4) %*/
3174 }
3175 | k_case expr_value opt_terms
3176 p_case_body
3177 k_end
3178 {
3179 /*%%%*/
3180 $$ = NEW_CASE3($2, $4, &@$);
3181 /*% %*/
3182 /*% ripper: case!($2, $4) %*/
3183 }
3184 | k_for for_var keyword_in expr_value_do
3185 compstmt
3186 k_end
3187 {
3188 /*%%%*/
3189 /*
3190 * for a, b, c in e
3191 * #=>
3192 * e.each{|*x| a, b, c = x}
3193 *
3194 * for a in e
3195 * #=>
3196 * e.each{|x| a, = x}
3197 */
3198 ID id = internal_id(p);
3199 NODE *m = NEW_ARGS_AUX(0, 0, &NULL_LOC);
3200 NODE *args, *scope, *internal_var = NEW_DVAR(id, &@2);
3201 rb_ast_id_table_t *tbl = rb_ast_new_local_table(p->ast, 1);
3202 tbl->ids[0] = id; /* internal id */
3203
3204 switch (nd_type($2)) {
3205 case NODE_LASGN:
3206 case NODE_DASGN: /* e.each {|internal_var| a = internal_var; ... } */
3207 $2->nd_value = internal_var;
3208 id = 0;
3209 m->nd_plen = 1;
3210 m->nd_next = $2;
3211 break;
3212 case NODE_MASGN: /* e.each {|*internal_var| a, b, c = (internal_var.length == 1 && Array === (tmp = internal_var[0]) ? tmp : internal_var); ... } */
3213 m->nd_next = node_assign(p, $2, NEW_FOR_MASGN(internal_var, &@2), NO_LEX_CTXT, &@2);
3214 break;
3215 default: /* e.each {|*internal_var| @a, B, c[1], d.attr = internal_val; ... } */
3216 m->nd_next = node_assign(p, NEW_MASGN(NEW_LIST($2, &@2), 0, &@2), internal_var, NO_LEX_CTXT, &@2);
3217 }
3218 /* {|*internal_id| <m> = internal_id; ... } */
3219 args = new_args(p, m, 0, id, 0, new_args_tail(p, 0, 0, 0, &@2), &@2);
3220 scope = NEW_NODE(NODE_SCOPE, tbl, $5, args, &@$);
3221 $$ = NEW_FOR($4, scope, &@$);
3222 fixpos($$, $2);
3223 /*% %*/
3224 /*% ripper: for!($2, $4, $5) %*/
3225 }
3226 | k_class cpath superclass
3227 {
3228 if (p->ctxt.in_def) {
3229 YYLTYPE loc = code_loc_gen(&@1, &@2);
3230 yyerror1(&loc, "class definition in method body");
3231 }
3232 p->ctxt.in_class = 1;
3233 local_push(p, 0);
3234 }
3235 bodystmt
3236 k_end
3237 {
3238 /*%%%*/
3239 $$ = NEW_CLASS($2, $5, $3, &@$);
3240 nd_set_line($$->nd_body, @6.end_pos.lineno);
3241 set_line_body($5, @3.end_pos.lineno);
3242 nd_set_line($$, @3.end_pos.lineno);
3243 /*% %*/
3244 /*% ripper: class!($2, $3, $5) %*/
3245 local_pop(p);
3246 p->ctxt.in_class = $<ctxt>1.in_class;
3247 p->ctxt.shareable_constant_value = $<ctxt>1.shareable_constant_value;
3248 }
3249 | k_class tLSHFT expr
3250 {
3251 p->ctxt.in_def = 0;
3252 p->ctxt.in_class = 0;
3253 local_push(p, 0);
3254 }
3255 term
3256 bodystmt
3257 k_end
3258 {
3259 /*%%%*/
3260 $$ = NEW_SCLASS($3, $6, &@$);
3261 nd_set_line($$->nd_body, @7.end_pos.lineno);
3262 set_line_body($6, nd_line($3));
3263 fixpos($$, $3);
3264 /*% %*/
3265 /*% ripper: sclass!($3, $6) %*/
3266 local_pop(p);
3267 p->ctxt.in_def = $<ctxt>1.in_def;
3268 p->ctxt.in_class = $<ctxt>1.in_class;
3269 p->ctxt.shareable_constant_value = $<ctxt>1.shareable_constant_value;
3270 }
3271 | k_module cpath
3272 {
3273 if (p->ctxt.in_def) {
3274 YYLTYPE loc = code_loc_gen(&@1, &@2);
3275 yyerror1(&loc, "module definition in method body");
3276 }
3277 p->ctxt.in_class = 1;
3278 local_push(p, 0);
3279 }
3280 bodystmt
3281 k_end
3282 {
3283 /*%%%*/
3284 $$ = NEW_MODULE($2, $4, &@$);
3285 nd_set_line($$->nd_body, @5.end_pos.lineno);
3286 set_line_body($4, @2.end_pos.lineno);
3287 nd_set_line($$, @2.end_pos.lineno);
3288 /*% %*/
3289 /*% ripper: module!($2, $4) %*/
3290 local_pop(p);
3291 p->ctxt.in_class = $<ctxt>1.in_class;
3292 p->ctxt.shareable_constant_value = $<ctxt>1.shareable_constant_value;
3293 }
3294 | defn_head
3295 f_arglist
3296 bodystmt
3297 k_end
3298 {
3299 restore_defun(p, $<node>1->nd_defn);
3300 /*%%%*/
3301 $$ = set_defun_body(p, $1, $2, $3, &@$);
3302 /*% %*/
3303 /*% ripper: def!(get_value($1), $2, $3) %*/
3304 local_pop(p);
3305 }
3306 | defs_head
3307 f_arglist
3308 bodystmt
3309 k_end
3310 {
3311 restore_defun(p, $<node>1->nd_defn);
3312 /*%%%*/
3313 $$ = set_defun_body(p, $1, $2, $3, &@$);
3314 /*%
3315 $1 = get_value($1);
3316 %*/
3317 /*% ripper: defs!(AREF($1, 0), AREF($1, 1), AREF($1, 2), $2, $3) %*/
3318 local_pop(p);
3319 }
3320 | keyword_break
3321 {
3322 /*%%%*/
3323 $$ = NEW_BREAK(0, &@$);
3324 /*% %*/
3325 /*% ripper: break!(args_new!) %*/
3326 }
3327 | keyword_next
3328 {
3329 /*%%%*/
3330 $$ = NEW_NEXT(0, &@$);
3331 /*% %*/
3332 /*% ripper: next!(args_new!) %*/
3333 }
3334 | keyword_redo
3335 {
3336 /*%%%*/
3337 $$ = NEW_REDO(&@$);
3338 /*% %*/
3339 /*% ripper: redo! %*/
3340 }
3341 | keyword_retry
3342 {
3343 /*%%%*/
3344 $$ = NEW_RETRY(&@$);
3345 /*% %*/
3346 /*% ripper: retry! %*/
3347 }
3348 ;
3349
3350 primary_value : primary
3351 {
3352 value_expr($1);
3353 $$ = $1;
3354 }
3355 ;
3356
3357 k_begin : keyword_begin
3358 {
3359 token_info_push(p, "begin", &@$);
3360 }
3361 ;
3362
3363 k_if : keyword_if
3364 {
3365 WARN_EOL("if");
3366 token_info_push(p, "if", &@$);
3367 if (p->token_info && p->token_info->nonspc &&
3368 p->token_info->next && !strcmp(p->token_info->next->token, "else")) {
3369 const char *tok = p->lex.ptok;
3370 const char *beg = p->lex.pbeg + p->token_info->next->beg.column;
3371 beg += rb_strlen_lit("else");
3372 while (beg < tok && ISSPACE(*beg)) beg++;
3373 if (beg == tok) {
3374 p->token_info->nonspc = 0;
3375 }
3376 }
3377 }
3378 ;
3379
3380 k_unless : keyword_unless
3381 {
3382 token_info_push(p, "unless", &@$);
3383 }
3384 ;
3385
3386 k_while : keyword_while
3387 {
3388 token_info_push(p, "while", &@$);
3389 }
3390 ;
3391
3392 k_until : keyword_until
3393 {
3394 token_info_push(p, "until", &@$);
3395 }
3396 ;
3397
3398 k_case : keyword_case
3399 {
3400 token_info_push(p, "case", &@$);
3401 }
3402 ;
3403
3404 k_for : keyword_for
3405 {
3406 token_info_push(p, "for", &@$);
3407 }
3408 ;
3409
3410 k_class : keyword_class
3411 {
3412 token_info_push(p, "class", &@$);
3413 $<ctxt>$ = p->ctxt;
3414 }
3415 ;
3416
3417 k_module : keyword_module
3418 {
3419 token_info_push(p, "module", &@$);
3420 $<ctxt>$ = p->ctxt;
3421 }
3422 ;
3423
3424 k_def : keyword_def
3425 {
3426 token_info_push(p, "def", &@$);
3427 p->ctxt.in_argdef = 1;
3428 }
3429 ;
3430
3431 k_do : keyword_do
3432 {
3433 token_info_push(p, "do", &@$);
3434 }
3435 ;
3436
3437 k_do_block : keyword_do_block
3438 {
3439 token_info_push(p, "do", &@$);
3440 }
3441 ;
3442
3443 k_rescue : keyword_rescue
3444 {
3445 token_info_warn(p, "rescue", p->token_info, 1, &@$);
3446 }
3447 ;
3448
3449 k_ensure : keyword_ensure
3450 {
3451 token_info_warn(p, "ensure", p->token_info, 1, &@$);
3452 }
3453 ;
3454
3455 k_when : keyword_when
3456 {
3457 token_info_warn(p, "when", p->token_info, 0, &@$);
3458 }
3459 ;
3460
3461 k_else : keyword_else
3462 {
3463 token_info *ptinfo_beg = p->token_info;
3464 int same = ptinfo_beg && strcmp(ptinfo_beg->token, "case") != 0;
3465 token_info_warn(p, "else", p->token_info, same, &@$);
3466 if (same) {
3467 token_info e;
3468 e.next = ptinfo_beg->next;
3469 e.token = "else";
3470 token_info_setup(&e, p->lex.pbeg, &@$);
3471 if (!e.nonspc) *ptinfo_beg = e;
3472 }
3473 }
3474 ;
3475
3476 k_elsif : keyword_elsif
3477 {
3478 WARN_EOL("elsif");
3479 token_info_warn(p, "elsif", p->token_info, 1, &@$);
3480 }
3481 ;
3482
3483 k_end : keyword_end
3484 {
3485 token_info_pop(p, "end", &@$);
3486 }
3487 ;
3488
3489 k_return : keyword_return
3490 {
3491 if (p->ctxt.in_class && !p->ctxt.in_def && !dyna_in_block(p))
3492 yyerror1(&@1, "Invalid return in class/module body");
3493 }
3494 ;
3495
3496 then : term
3497 | keyword_then
3498 | term keyword_then
3499 ;
3500
3501 do : term
3502 | keyword_do_cond
3503 ;
3504
3505 if_tail : opt_else
3506 | k_elsif expr_value then
3507 compstmt
3508 if_tail
3509 {
3510 /*%%%*/
3511 $$ = new_if(p, $2, $4, $5, &@$);
3512 fixpos($$, $2);
3513 /*% %*/
3514 /*% ripper: elsif!($2, $4, escape_Qundef($5)) %*/
3515 }
3516 ;
3517
3518 opt_else : none
3519 | k_else compstmt
3520 {
3521 /*%%%*/
3522 $$ = $2;
3523 /*% %*/
3524 /*% ripper: else!($2) %*/
3525 }
3526 ;
3527
3528 for_var : lhs
3529 | mlhs
3530 ;
3531
3532 f_marg : f_norm_arg
3533 {
3534 /*%%%*/
3535 $$ = assignable(p, $1, 0, &@$);
3536 mark_lvar_used(p, $$);
3537 /*% %*/
3538 /*% ripper: assignable(p, $1) %*/
3539 }
3540 | tLPAREN f_margs rparen
3541 {
3542 /*%%%*/
3543 $$ = $2;
3544 /*% %*/
3545 /*% ripper: mlhs_paren!($2) %*/
3546 }
3547 ;
3548
3549 f_marg_list : f_marg
3550 {
3551 /*%%%*/
3552 $$ = NEW_LIST($1, &@$);
3553 /*% %*/
3554 /*% ripper: mlhs_add!(mlhs_new!, $1) %*/
3555 }
3556 | f_marg_list ',' f_marg
3557 {
3558 /*%%%*/
3559 $$ = list_append(p, $1, $3);
3560 /*% %*/
3561 /*% ripper: mlhs_add!($1, $3) %*/
3562 }
3563 ;
3564
3565 f_margs : f_marg_list
3566 {
3567 /*%%%*/
3568 $$ = NEW_MASGN($1, 0, &@$);
3569 /*% %*/
3570 /*% ripper: $1 %*/
3571 }
3572 | f_marg_list ',' f_rest_marg
3573 {
3574 /*%%%*/
3575 $$ = NEW_MASGN($1, $3, &@$);
3576 /*% %*/
3577 /*% ripper: mlhs_add_star!($1, $3) %*/
3578 }
3579 | f_marg_list ',' f_rest_marg ',' f_marg_list
3580 {
3581 /*%%%*/
3582 $$ = NEW_MASGN($1, NEW_POSTARG($3, $5, &@$), &@$);
3583 /*% %*/
3584 /*% ripper: mlhs_add_post!(mlhs_add_star!($1, $3), $5) %*/
3585 }
3586 | f_rest_marg
3587 {
3588 /*%%%*/
3589 $$ = NEW_MASGN(0, $1, &@$);
3590 /*% %*/
3591 /*% ripper: mlhs_add_star!(mlhs_new!, $1) %*/
3592 }
3593 | f_rest_marg ',' f_marg_list
3594 {
3595 /*%%%*/
3596 $$ = NEW_MASGN(0, NEW_POSTARG($1, $3, &@$), &@$);
3597 /*% %*/
3598 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $1), $3) %*/
3599 }
3600 ;
3601
3602 f_rest_marg : tSTAR f_norm_arg
3603 {
3604 /*%%%*/
3605 $$ = assignable(p, $2, 0, &@$);
3606 mark_lvar_used(p, $$);
3607 /*% %*/
3608 /*% ripper: assignable(p, $2) %*/
3609 }
3610 | tSTAR
3611 {
3612 /*%%%*/
3613 $$ = NODE_SPECIAL_NO_NAME_REST;
3614 /*% %*/
3615 /*% ripper: Qnil %*/
3616 }
3617 ;
3618
3619 f_any_kwrest : f_kwrest
3620 | f_no_kwarg {$$ = ID2VAL(idNil);}
3621 ;
3622
3623 f_eq : {p->ctxt.in_argdef = 0;} '=';
3624
3625 block_args_tail : f_block_kwarg ',' f_kwrest opt_f_block_arg
3626 {
3627 $$ = new_args_tail(p, $1, $3, $4, &@3);
3628 }
3629 | f_block_kwarg opt_f_block_arg
3630 {
3631 $$ = new_args_tail(p, $1, Qnone, $2, &@1);
3632 }
3633 | f_any_kwrest opt_f_block_arg
3634 {
3635 $$ = new_args_tail(p, Qnone, $1, $2, &@1);
3636 }
3637 | f_block_arg
3638 {
3639 $$ = new_args_tail(p, Qnone, Qnone, $1, &@1);
3640 }
3641 ;
3642
3643 opt_block_args_tail : ',' block_args_tail
3644 {
3645 $$ = $2;
3646 }
3647 | /* none */
3648 {
3649 $$ = new_args_tail(p, Qnone, Qnone, Qnone, &@0);
3650 }
3651 ;
3652
3653 excessed_comma : ','
3654 {
3655 /* magic number for rest_id in iseq_set_arguments() */
3656 /*%%%*/
3657 $$ = NODE_SPECIAL_EXCESSIVE_COMMA;
3658 /*% %*/
3659 /*% ripper: excessed_comma! %*/
3660 }
3661 ;
3662
3663 block_param : f_arg ',' f_block_optarg ',' f_rest_arg opt_block_args_tail
3664 {
3665 $$ = new_args(p, $1, $3, $5, Qnone, $6, &@$);
3666 }
3667 | f_arg ',' f_block_optarg ',' f_rest_arg ',' f_arg opt_block_args_tail
3668 {
3669 $$ = new_args(p, $1, $3, $5, $7, $8, &@$);
3670 }
3671 | f_arg ',' f_block_optarg opt_block_args_tail
3672 {
3673 $$ = new_args(p, $1, $3, Qnone, Qnone, $4, &@$);
3674 }
3675 | f_arg ',' f_block_optarg ',' f_arg opt_block_args_tail
3676 {
3677 $$ = new_args(p, $1, $3, Qnone, $5, $6, &@$);
3678 }
3679 | f_arg ',' f_rest_arg opt_block_args_tail
3680 {
3681 $$ = new_args(p, $1, Qnone, $3, Qnone, $4, &@$);
3682 }
3683 | f_arg excessed_comma
3684 {
3685 $$ = new_args_tail(p, Qnone, Qnone, Qnone, &@2);
3686 $$ = new_args(p, $1, Qnone, $2, Qnone, $$, &@$);
3687 }
3688 | f_arg ',' f_rest_arg ',' f_arg opt_block_args_tail
3689 {
3690 $$ = new_args(p, $1, Qnone, $3, $5, $6, &@$);
3691 }
3692 | f_arg opt_block_args_tail
3693 {
3694 $$ = new_args(p, $1, Qnone, Qnone, Qnone, $2, &@$);
3695 }
3696 | f_block_optarg ',' f_rest_arg opt_block_args_tail
3697 {
3698 $$ = new_args(p, Qnone, $1, $3, Qnone, $4, &@$);
3699 }
3700 | f_block_optarg ',' f_rest_arg ',' f_arg opt_block_args_tail
3701 {
3702 $$ = new_args(p, Qnone, $1, $3, $5, $6, &@$);
3703 }
3704 | f_block_optarg opt_block_args_tail
3705 {
3706 $$ = new_args(p, Qnone, $1, Qnone, Qnone, $2, &@$);
3707 }
3708 | f_block_optarg ',' f_arg opt_block_args_tail
3709 {
3710 $$ = new_args(p, Qnone, $1, Qnone, $3, $4, &@$);
3711 }
3712 | f_rest_arg opt_block_args_tail
3713 {
3714 $$ = new_args(p, Qnone, Qnone, $1, Qnone, $2, &@$);
3715 }
3716 | f_rest_arg ',' f_arg opt_block_args_tail
3717 {
3718 $$ = new_args(p, Qnone, Qnone, $1, $3, $4, &@$);
3719 }
3720 | block_args_tail
3721 {
3722 $$ = new_args(p, Qnone, Qnone, Qnone, Qnone, $1, &@$);
3723 }
3724 ;
3725
3726 opt_block_param : none
3727 | block_param_def
3728 {
3729 p->command_start = TRUE;
3730 }
3731 ;
3732
3733 block_param_def : '|' opt_bv_decl '|'
3734 {
3735 p->cur_arg = 0;
3736 p->max_numparam = ORDINAL_PARAM;
3737 p->ctxt.in_argdef = 0;
3738 /*%%%*/
3739 $$ = 0;
3740 /*% %*/
3741 /*% ripper: block_var!(params!(Qnil,Qnil,Qnil,Qnil,Qnil,Qnil,Qnil), escape_Qundef($2)) %*/
3742 }
3743 | '|' block_param opt_bv_decl '|'
3744 {
3745 p->cur_arg = 0;
3746 p->max_numparam = ORDINAL_PARAM;
3747 p->ctxt.in_argdef = 0;
3748 /*%%%*/
3749 $$ = $2;
3750 /*% %*/
3751 /*% ripper: block_var!(escape_Qundef($2), escape_Qundef($3)) %*/
3752 }
3753 ;
3754
3755
3756 opt_bv_decl : opt_nl
3757 {
3758 $$ = 0;
3759 }
3760 | opt_nl ';' bv_decls opt_nl
3761 {
3762 /*%%%*/
3763 $$ = 0;
3764 /*% %*/
3765 /*% ripper: $3 %*/
3766 }
3767 ;
3768
3769 bv_decls : bvar
3770 /*% ripper[brace]: rb_ary_new3(1, get_value($1)) %*/
3771 | bv_decls ',' bvar
3772 /*% ripper[brace]: rb_ary_push($1, get_value($3)) %*/
3773 ;
3774
3775 bvar : tIDENTIFIER
3776 {
3777 new_bv(p, get_id($1));
3778 /*% ripper: get_value($1) %*/
3779 }
3780 | f_bad_arg
3781 {
3782 $$ = 0;
3783 }
3784 ;
3785
3786 lambda : tLAMBDA
3787 {
3788 token_info_push(p, "->", &@1);
3789 $<vars>1 = dyna_push(p);
3790 $<num>$ = p->lex.lpar_beg;
3791 p->lex.lpar_beg = p->lex.paren_nest;
3792 }
3793 {
3794 $<num>$ = p->max_numparam;
3795 p->max_numparam = 0;
3796 }
3797 {
3798 $<node>$ = numparam_push(p);
3799 }
3800 f_larglist
3801 {
3802 CMDARG_PUSH(0);
3803 }
3804 lambda_body
3805 {
3806 int max_numparam = p->max_numparam;
3807 p->lex.lpar_beg = $<num>2;
3808 p->max_numparam = $<num>3;
3809 CMDARG_POP();
3810 $5 = args_with_numbered(p, $5, max_numparam);
3811 /*%%%*/
3812 {
3813 YYLTYPE loc = code_loc_gen(&@5, &@7);
3814 $$ = NEW_LAMBDA($5, $7, &loc);
3815 nd_set_line($$->nd_body, @7.end_pos.lineno);
3816 nd_set_line($$, @5.end_pos.lineno);
3817 nd_set_first_loc($$, @1.beg_pos);
3818 }
3819 /*% %*/
3820 /*% ripper: lambda!($5, $7) %*/
3821 numparam_pop(p, $<node>4);
3822 dyna_pop(p, $<vars>1);
3823 }
3824 ;
3825
3826 f_larglist : '(' f_args opt_bv_decl ')'
3827 {
3828 p->ctxt.in_argdef = 0;
3829 /*%%%*/
3830 $$ = $2;
3831 p->max_numparam = ORDINAL_PARAM;
3832 /*% %*/
3833 /*% ripper: paren!($2) %*/
3834 }
3835 | f_args
3836 {
3837 p->ctxt.in_argdef = 0;
3838 /*%%%*/
3839 if (!args_info_empty_p($1->nd_ainfo))
3840 p->max_numparam = ORDINAL_PARAM;
3841 /*% %*/
3842 $$ = $1;
3843 }
3844 ;
3845
3846 lambda_body : tLAMBEG compstmt '}'
3847 {
3848 token_info_pop(p, "}", &@3);
3849 $$ = $2;
3850 }
3851 | keyword_do_LAMBDA bodystmt k_end
3852 {
3853 $$ = $2;
3854 }
3855 ;
3856
3857 do_block : k_do_block do_body k_end
3858 {
3859 $$ = $2;
3860 /*%%%*/
3861 $$->nd_body->nd_loc = code_loc_gen(&@1, &@3);
3862 nd_set_line($$, @1.end_pos.lineno);
3863 /*% %*/
3864 }
3865 ;
3866
3867 block_call : command do_block
3868 {
3869 /*%%%*/
3870 if (nd_type_p($1, NODE_YIELD)) {
3871 compile_error(p, "block given to yield");
3872 }
3873 else {
3874 block_dup_check(p, $1->nd_args, $2);
3875 }
3876 $$ = method_add_block(p, $1, $2, &@$);
3877 fixpos($$, $1);
3878 /*% %*/
3879 /*% ripper: method_add_block!($1, $2) %*/
3880 }
3881 | block_call call_op2 operation2 opt_paren_args
3882 {
3883 /*%%%*/
3884 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
3885 /*% %*/
3886 /*% ripper: opt_event(:method_add_arg!, call!($1, $2, $3), $4) %*/
3887 }
3888 | block_call call_op2 operation2 opt_paren_args brace_block
3889 {
3890 /*%%%*/
3891 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
3892 /*% %*/
3893 /*% ripper: opt_event(:method_add_block!, command_call!($1, $2, $3, $4), $5) %*/
3894 }
3895 | block_call call_op2 operation2 command_args do_block
3896 {
3897 /*%%%*/
3898 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
3899 /*% %*/
3900 /*% ripper: method_add_block!(command_call!($1, $2, $3, $4), $5) %*/
3901 }
3902 ;
3903
3904 method_call : fcall paren_args
3905 {
3906 /*%%%*/
3907 $$ = $1;
3908 $$->nd_args = $2;
3909 nd_set_last_loc($1, @2.end_pos);
3910 /*% %*/
3911 /*% ripper: method_add_arg!(fcall!($1), $2) %*/
3912 }
3913 | primary_value call_op operation2 opt_paren_args
3914 {
3915 /*%%%*/
3916 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
3917 nd_set_line($$, @3.end_pos.lineno);
3918 /*% %*/
3919 /*% ripper: opt_event(:method_add_arg!, call!($1, $2, $3), $4) %*/
3920 }
3921 | primary_value tCOLON2 operation2 paren_args
3922 {
3923 /*%%%*/
3924 $$ = new_qcall(p, ID2VAL(idCOLON2), $1, $3, $4, &@3, &@$);
3925 nd_set_line($$, @3.end_pos.lineno);
3926 /*% %*/
3927 /*% ripper: method_add_arg!(call!($1, ID2VAL(idCOLON2), $3), $4) %*/
3928 }
3929 | primary_value tCOLON2 operation3
3930 {
3931 /*%%%*/
3932 $$ = new_qcall(p, ID2VAL(idCOLON2), $1, $3, Qnull, &@3, &@$);
3933 /*% %*/
3934 /*% ripper: call!($1, ID2VAL(idCOLON2), $3) %*/
3935 }
3936 | primary_value call_op paren_args
3937 {
3938 /*%%%*/
3939 $$ = new_qcall(p, $2, $1, ID2VAL(idCall), $3, &@2, &@$);
3940 nd_set_line($$, @2.end_pos.lineno);
3941 /*% %*/
3942 /*% ripper: method_add_arg!(call!($1, $2, ID2VAL(idCall)), $3) %*/
3943 }
3944 | primary_value tCOLON2 paren_args
3945 {
3946 /*%%%*/
3947 $$ = new_qcall(p, ID2VAL(idCOLON2), $1, ID2VAL(idCall), $3, &@2, &@$);
3948 nd_set_line($$, @2.end_pos.lineno);
3949 /*% %*/
3950 /*% ripper: method_add_arg!(call!($1, ID2VAL(idCOLON2), ID2VAL(idCall)), $3) %*/
3951 }
3952 | keyword_super paren_args
3953 {
3954 /*%%%*/
3955 $$ = NEW_SUPER($2, &@$);
3956 /*% %*/
3957 /*% ripper: super!($2) %*/
3958 }
3959 | keyword_super
3960 {
3961 /*%%%*/
3962 $$ = NEW_ZSUPER(&@$);
3963 /*% %*/
3964 /*% ripper: zsuper! %*/
3965 }
3966 | primary_value '[' opt_call_args rbracket
3967 {
3968 /*%%%*/
3969 if ($1 && nd_type_p($1, NODE_SELF))
3970 $$ = NEW_FCALL(tAREF, $3, &@$);
3971 else
3972 $$ = NEW_CALL($1, tAREF, $3, &@$);
3973 fixpos($$, $1);
3974 /*% %*/
3975 /*% ripper: aref!($1, escape_Qundef($3)) %*/
3976 }
3977 ;
3978
3979 brace_block : '{' brace_body '}'
3980 {
3981 $$ = $2;
3982 /*%%%*/
3983 $$->nd_body->nd_loc = code_loc_gen(&@1, &@3);
3984 nd_set_line($$, @1.end_pos.lineno);
3985 /*% %*/
3986 }
3987 | k_do do_body k_end
3988 {
3989 $$ = $2;
3990 /*%%%*/
3991 $$->nd_body->nd_loc = code_loc_gen(&@1, &@3);
3992 nd_set_line($$, @1.end_pos.lineno);
3993 /*% %*/
3994 }
3995 ;
3996
3997 brace_body : {$<vars>$ = dyna_push(p);}
3998 {
3999 $<num>$ = p->max_numparam;
4000 p->max_numparam = 0;
4001 }
4002 {
4003 $<node>$ = numparam_push(p);
4004 }
4005 opt_block_param compstmt
4006 {
4007 int max_numparam = p->max_numparam;
4008 p->max_numparam = $<num>2;
4009 $4 = args_with_numbered(p, $4, max_numparam);
4010 /*%%%*/
4011 $$ = NEW_ITER($4, $5, &@$);
4012 /*% %*/
4013 /*% ripper: brace_block!(escape_Qundef($4), $5) %*/
4014 numparam_pop(p, $<node>3);
4015 dyna_pop(p, $<vars>1);
4016 }
4017 ;
4018
4019 do_body : {$<vars>$ = dyna_push(p);}
4020 {
4021 $<num>$ = p->max_numparam;
4022 p->max_numparam = 0;
4023 }
4024 {
4025 $<node>$ = numparam_push(p);
4026 CMDARG_PUSH(0);
4027 }
4028 opt_block_param bodystmt
4029 {
4030 int max_numparam = p->max_numparam;
4031 p->max_numparam = $<num>2;
4032 $4 = args_with_numbered(p, $4, max_numparam);
4033 /*%%%*/
4034 $$ = NEW_ITER($4, $5, &@$);
4035 /*% %*/
4036 /*% ripper: do_block!(escape_Qundef($4), $5) %*/
4037 CMDARG_POP();
4038 numparam_pop(p, $<node>3);
4039 dyna_pop(p, $<vars>1);
4040 }
4041 ;
4042
4043 case_args : arg_value
4044 {
4045 /*%%%*/
4046 check_literal_when(p, $1, &@1);
4047 $$ = NEW_LIST($1, &@$);
4048 /*% %*/
4049 /*% ripper: args_add!(args_new!, $1) %*/
4050 }
4051 | tSTAR arg_value
4052 {
4053 /*%%%*/
4054 $$ = NEW_SPLAT($2, &@$);
4055 /*% %*/
4056 /*% ripper: args_add_star!(args_new!, $2) %*/
4057 }
4058 | case_args ',' arg_value
4059 {
4060 /*%%%*/
4061 check_literal_when(p, $3, &@3);
4062 $$ = last_arg_append(p, $1, $3, &@$);
4063 /*% %*/
4064 /*% ripper: args_add!($1, $3) %*/
4065 }
4066 | case_args ',' tSTAR arg_value
4067 {
4068 /*%%%*/
4069 $$ = rest_arg_append(p, $1, $4, &@$);
4070 /*% %*/
4071 /*% ripper: args_add_star!($1, $4) %*/
4072 }
4073 ;
4074
4075 case_body : k_when case_args then
4076 compstmt
4077 cases
4078 {
4079 /*%%%*/
4080 $$ = NEW_WHEN($2, $4, $5, &@$);
4081 fixpos($$, $2);
4082 /*% %*/
4083 /*% ripper: when!($2, $4, escape_Qundef($5)) %*/
4084 }
4085 ;
4086
4087 cases : opt_else
4088 | case_body
4089 ;
4090
4091 p_case_body : keyword_in
4092 {
4093 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
4094 p->command_start = FALSE;
4095 $<ctxt>1 = p->ctxt;
4096 p->ctxt.in_kwarg = 1;
4097 $<tbl>$ = push_pvtbl(p);
4098 }
4099 {
4100 $<tbl>$ = push_pktbl(p);
4101 }
4102 p_top_expr then
4103 {
4104 pop_pktbl(p, $<tbl>3);
4105 pop_pvtbl(p, $<tbl>2);
4106 p->ctxt.in_kwarg = $<ctxt>1.in_kwarg;
4107 }
4108 compstmt
4109 p_cases
4110 {
4111 /*%%%*/
4112 $$ = NEW_IN($4, $7, $8, &@$);
4113 /*% %*/
4114 /*% ripper: in!($4, $7, escape_Qundef($8)) %*/
4115 }
4116 ;
4117
4118 p_cases : opt_else
4119 | p_case_body
4120 ;
4121
4122 p_top_expr : p_top_expr_body
4123 | p_top_expr_body modifier_if expr_value
4124 {
4125 /*%%%*/
4126 $$ = new_if(p, $3, $1, 0, &@$);
4127 fixpos($$, $3);
4128 /*% %*/
4129 /*% ripper: if_mod!($3, $1) %*/
4130 }
4131 | p_top_expr_body modifier_unless expr_value
4132 {
4133 /*%%%*/
4134 $$ = new_unless(p, $3, $1, 0, &@$);
4135 fixpos($$, $3);
4136 /*% %*/
4137 /*% ripper: unless_mod!($3, $1) %*/
4138 }
4139 ;
4140
4141 p_top_expr_body : p_expr
4142 | p_expr ','
4143 {
4144 $$ = new_array_pattern_tail(p, Qnone, 1, 0, Qnone, &@$);
4145 $$ = new_array_pattern(p, Qnone, get_value($1), $$, &@$);
4146 }
4147 | p_expr ',' p_args
4148 {
4149 $$ = new_array_pattern(p, Qnone, get_value($1), $3, &@$);
4150 /*%%%*/
4151 nd_set_first_loc($$, @1.beg_pos);
4152 /*%
4153 %*/
4154 }
4155 | p_find
4156 {
4157 $$ = new_find_pattern(p, Qnone, $1, &@$);
4158 }
4159 | p_args_tail
4160 {
4161 $$ = new_array_pattern(p, Qnone, Qnone, $1, &@$);
4162 }
4163 | p_kwargs
4164 {
4165 $$ = new_hash_pattern(p, Qnone, $1, &@$);
4166 }
4167 ;
4168
4169 p_expr : p_as
4170 ;
4171
4172 p_as : p_expr tASSOC p_variable
4173 {
4174 /*%%%*/
4175 NODE *n = NEW_LIST($1, &@$);
4176 n = list_append(p, n, $3);
4177 $$ = new_hash(p, n, &@$);
4178 /*% %*/
4179 /*% ripper: binary!($1, STATIC_ID2SYM((id_assoc)), $3) %*/
4180 }
4181 | p_alt
4182 ;
4183
4184 p_alt : p_alt '|' p_expr_basic
4185 {
4186 /*%%%*/
4187 $$ = NEW_NODE(NODE_OR, $1, $3, 0, &@$);
4188 /*% %*/
4189 /*% ripper: binary!($1, STATIC_ID2SYM(idOr), $3) %*/
4190 }
4191 | p_expr_basic
4192 ;
4193
4194 p_lparen : '(' {$<tbl>$ = push_pktbl(p);};
4195 p_lbracket : '[' {$<tbl>$ = push_pktbl(p);};
4196
4197 p_expr_basic : p_value
4198 | p_variable
4199 | p_const p_lparen p_args rparen
4200 {
4201 pop_pktbl(p, $<tbl>2);
4202 $$ = new_array_pattern(p, $1, Qnone, $3, &@$);
4203 /*%%%*/
4204 nd_set_first_loc($$, @1.beg_pos);
4205 /*%
4206 %*/
4207 }
4208 | p_const p_lparen p_find rparen
4209 {
4210 pop_pktbl(p, $<tbl>2);
4211 $$ = new_find_pattern(p, $1, $3, &@$);
4212 /*%%%*/
4213 nd_set_first_loc($$, @1.beg_pos);
4214 /*%
4215 %*/
4216 }
4217 | p_const p_lparen p_kwargs rparen
4218 {
4219 pop_pktbl(p, $<tbl>2);
4220 $$ = new_hash_pattern(p, $1, $3, &@$);
4221 /*%%%*/
4222 nd_set_first_loc($$, @1.beg_pos);
4223 /*%
4224 %*/
4225 }
4226 | p_const '(' rparen
4227 {
4228 $$ = new_array_pattern_tail(p, Qnone, 0, 0, Qnone, &@$);
4229 $$ = new_array_pattern(p, $1, Qnone, $$, &@$);
4230 }
4231 | p_const p_lbracket p_args rbracket
4232 {
4233 pop_pktbl(p, $<tbl>2);
4234 $$ = new_array_pattern(p, $1, Qnone, $3, &@$);
4235 /*%%%*/
4236 nd_set_first_loc($$, @1.beg_pos);
4237 /*%
4238 %*/
4239 }
4240 | p_const p_lbracket p_find rbracket
4241 {
4242 pop_pktbl(p, $<tbl>2);
4243 $$ = new_find_pattern(p, $1, $3, &@$);
4244 /*%%%*/
4245 nd_set_first_loc($$, @1.beg_pos);
4246 /*%
4247 %*/
4248 }
4249 | p_const p_lbracket p_kwargs rbracket
4250 {
4251 pop_pktbl(p, $<tbl>2);
4252 $$ = new_hash_pattern(p, $1, $3, &@$);
4253 /*%%%*/
4254 nd_set_first_loc($$, @1.beg_pos);
4255 /*%
4256 %*/
4257 }
4258 | p_const '[' rbracket
4259 {
4260 $$ = new_array_pattern_tail(p, Qnone, 0, 0, Qnone, &@$);
4261 $$ = new_array_pattern(p, $1, Qnone, $$, &@$);
4262 }
4263 | tLBRACK p_args rbracket
4264 {
4265 $$ = new_array_pattern(p, Qnone, Qnone, $2, &@$);
4266 }
4267 | tLBRACK p_find rbracket
4268 {
4269 $$ = new_find_pattern(p, Qnone, $2, &@$);
4270 }
4271 | tLBRACK rbracket
4272 {
4273 $$ = new_array_pattern_tail(p, Qnone, 0, 0, Qnone, &@$);
4274 $$ = new_array_pattern(p, Qnone, Qnone, $$, &@$);
4275 }
4276 | tLBRACE
4277 {
4278 $<tbl>$ = push_pktbl(p);
4279 $<ctxt>1 = p->ctxt;
4280 p->ctxt.in_kwarg = 0;
4281 }
4282 p_kwargs rbrace
4283 {
4284 pop_pktbl(p, $<tbl>2);
4285 p->ctxt.in_kwarg = $<ctxt>1.in_kwarg;
4286 $$ = new_hash_pattern(p, Qnone, $3, &@$);
4287 }
4288 | tLBRACE rbrace
4289 {
4290 $$ = new_hash_pattern_tail(p, Qnone, 0, &@$);
4291 $$ = new_hash_pattern(p, Qnone, $$, &@$);
4292 }
4293 | tLPAREN {$<tbl>$ = push_pktbl(p);} p_expr rparen
4294 {
4295 pop_pktbl(p, $<tbl>2);
4296 $$ = $3;
4297 }
4298 ;
4299
4300 p_args : p_expr
4301 {
4302 /*%%%*/
4303 NODE *pre_args = NEW_LIST($1, &@$);
4304 $$ = new_array_pattern_tail(p, pre_args, 0, 0, Qnone, &@$);
4305 /*%
4306 $$ = new_array_pattern_tail(p, rb_ary_new_from_args(1, get_value($1)), 0, 0, Qnone, &@$);
4307 %*/
4308 }
4309 | p_args_head
4310 {
4311 $$ = new_array_pattern_tail(p, $1, 1, 0, Qnone, &@$);
4312 }
4313 | p_args_head p_arg
4314 {
4315 /*%%%*/
4316 $$ = new_array_pattern_tail(p, list_concat($1, $2), 0, 0, Qnone, &@$);
4317 /*%
4318 VALUE pre_args = rb_ary_concat($1, get_value($2));
4319 $$ = new_array_pattern_tail(p, pre_args, 0, 0, Qnone, &@$);
4320 %*/
4321 }
4322 | p_args_head tSTAR tIDENTIFIER
4323 {
4324 $$ = new_array_pattern_tail(p, $1, 1, $3, Qnone, &@$);
4325 }
4326 | p_args_head tSTAR tIDENTIFIER ',' p_args_post
4327 {
4328 $$ = new_array_pattern_tail(p, $1, 1, $3, $5, &@$);
4329 }
4330 | p_args_head tSTAR
4331 {
4332 $$ = new_array_pattern_tail(p, $1, 1, 0, Qnone, &@$);
4333 }
4334 | p_args_head tSTAR ',' p_args_post
4335 {
4336 $$ = new_array_pattern_tail(p, $1, 1, 0, $4, &@$);
4337 }
4338 | p_args_tail
4339 ;
4340
4341 p_args_head : p_arg ','
4342 {
4343 $$ = $1;
4344 }
4345 | p_args_head p_arg ','
4346 {
4347 /*%%%*/
4348 $$ = list_concat($1, $2);
4349 /*% %*/
4350 /*% ripper: rb_ary_concat($1, get_value($2)) %*/
4351 }
4352 ;
4353
4354 p_args_tail : p_rest
4355 {
4356 $$ = new_array_pattern_tail(p, Qnone, 1, $1, Qnone, &@$);
4357 }
4358 | p_rest ',' p_args_post
4359 {
4360 $$ = new_array_pattern_tail(p, Qnone, 1, $1, $3, &@$);
4361 }
4362 ;
4363
4364 p_find : p_rest ',' p_args_post ',' p_rest
4365 {
4366 $$ = new_find_pattern_tail(p, $1, $3, $5, &@$);
4367
4368 if (rb_warning_category_enabled_p(RB_WARN_CATEGORY_EXPERIMENTAL))
4369 rb_warn0L_experimental(nd_line($$), "Find pattern is experimental, and the behavior may change in future versions of Ruby!");
4370 }
4371 ;
4372
4373
4374 p_rest : tSTAR tIDENTIFIER
4375 {
4376 $$ = $2;
4377 }
4378 | tSTAR
4379 {
4380 $$ = 0;
4381 }
4382 ;
4383
4384 p_args_post : p_arg
4385 | p_args_post ',' p_arg
4386 {
4387 /*%%%*/
4388 $$ = list_concat($1, $3);
4389 /*% %*/
4390 /*% ripper: rb_ary_concat($1, get_value($3)) %*/
4391 }
4392 ;
4393
4394 p_arg : p_expr
4395 {
4396 /*%%%*/
4397 $$ = NEW_LIST($1, &@$);
4398 /*% %*/
4399 /*% ripper: rb_ary_new_from_args(1, get_value($1)) %*/
4400 }
4401 ;
4402
4403 p_kwargs : p_kwarg ',' p_any_kwrest
4404 {
4405 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), $3, &@$);
4406 }
4407 | p_kwarg
4408 {
4409 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$);
4410 }
4411 | p_kwarg ','
4412 {
4413 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$);
4414 }
4415 | p_any_kwrest
4416 {
4417 $$ = new_hash_pattern_tail(p, new_hash(p, Qnone, &@$), $1, &@$);
4418 }
4419 ;
4420
4421 p_kwarg : p_kw
4422 /*% ripper[brace]: rb_ary_new_from_args(1, $1) %*/
4423 | p_kwarg ',' p_kw
4424 {
4425 /*%%%*/
4426 $$ = list_concat($1, $3);
4427 /*% %*/
4428 /*% ripper: rb_ary_push($1, $3) %*/
4429 }
4430 ;
4431
4432 p_kw : p_kw_label p_expr
4433 {
4434 error_duplicate_pattern_key(p, get_id($1), &@1);
4435 /*%%%*/
4436 $$ = list_append(p, NEW_LIST(NEW_LIT(ID2SYM($1), &@$), &@$), $2);
4437 /*% %*/
4438 /*% ripper: rb_ary_new_from_args(2, get_value($1), get_value($2)) %*/
4439 }
4440 | p_kw_label
4441 {
4442 error_duplicate_pattern_key(p, get_id($1), &@1);
4443 if ($1 && !is_local_id(get_id($1))) {
4444 yyerror1(&@1, "key must be valid as local variables");
4445 }
4446 error_duplicate_pattern_variable(p, get_id($1), &@1);
4447 /*%%%*/
4448 $$ = list_append(p, NEW_LIST(NEW_LIT(ID2SYM($1), &@$), &@$), assignable(p, $1, 0, &@$));
4449 /*% %*/
4450 /*% ripper: rb_ary_new_from_args(2, get_value($1), Qnil) %*/
4451 }
4452 ;
4453
4454 p_kw_label : tLABEL
4455 | tSTRING_BEG string_contents tLABEL_END
4456 {
4457 YYLTYPE loc = code_loc_gen(&@1, &@3);
4458 /*%%%*/
4459 if (!$2 || nd_type_p($2, NODE_STR)) {
4460 NODE *node = dsym_node(p, $2, &loc);
4461 $$ = SYM2ID(node->nd_lit);
4462 }
4463 /*%
4464 if (ripper_is_node_yylval($2) && RNODE($2)->nd_cval) {
4465 VALUE label = RNODE($2)->nd_cval;
4466 VALUE rval = RNODE($2)->nd_rval;
4467 $$ = ripper_new_yylval(p, rb_intern_str(label), rval, label);
4468 RNODE($$)->nd_loc = loc;
4469 }
4470 %*/
4471 else {
4472 yyerror1(&loc, "symbol literal with interpolation is not allowed");
4473 $$ = 0;
4474 }
4475 }
4476 ;
4477
4478 p_kwrest : kwrest_mark tIDENTIFIER
4479 {
4480 $$ = $2;
4481 }
4482 | kwrest_mark
4483 {
4484 $$ = 0;
4485 }
4486 ;
4487
4488 p_kwnorest : kwrest_mark keyword_nil
4489 {
4490 $$ = 0;
4491 }
4492 ;
4493
4494 p_any_kwrest : p_kwrest
4495 | p_kwnorest {$$ = ID2VAL(idNil);}
4496 ;
4497
4498 p_value : p_primitive
4499 | p_primitive tDOT2 p_primitive
4500 {
4501 /*%%%*/
4502 value_expr($1);
4503 value_expr($3);
4504 $$ = NEW_DOT2($1, $3, &@$);
4505 /*% %*/
4506 /*% ripper: dot2!($1, $3) %*/
4507 }
4508 | p_primitive tDOT3 p_primitive
4509 {
4510 /*%%%*/
4511 value_expr($1);
4512 value_expr($3);
4513 $$ = NEW_DOT3($1, $3, &@$);
4514 /*% %*/
4515 /*% ripper: dot3!($1, $3) %*/
4516 }
4517 | p_primitive tDOT2
4518 {
4519 /*%%%*/
4520 value_expr($1);
4521 $$ = NEW_DOT2($1, new_nil_at(p, &@2.end_pos), &@$);
4522 /*% %*/
4523 /*% ripper: dot2!($1, Qnil) %*/
4524 }
4525 | p_primitive tDOT3
4526 {
4527 /*%%%*/
4528 value_expr($1);
4529 $$ = NEW_DOT3($1, new_nil_at(p, &@2.end_pos), &@$);
4530 /*% %*/
4531 /*% ripper: dot3!($1, Qnil) %*/
4532 }
4533 | p_var_ref
4534 | p_expr_ref
4535 | p_const
4536 | tBDOT2 p_primitive
4537 {
4538 /*%%%*/
4539 value_expr($2);
4540 $$ = NEW_DOT2(new_nil_at(p, &@1.beg_pos), $2, &@$);
4541 /*% %*/
4542 /*% ripper: dot2!(Qnil, $2) %*/
4543 }
4544 | tBDOT3 p_primitive
4545 {
4546 /*%%%*/
4547 value_expr($2);
4548 $$ = NEW_DOT3(new_nil_at(p, &@1.beg_pos), $2, &@$);
4549 /*% %*/
4550 /*% ripper: dot3!(Qnil, $2) %*/
4551 }
4552 ;
4553
4554 p_primitive : literal
4555 | strings
4556 | xstring
4557 | regexp
4558 | words
4559 | qwords
4560 | symbols
4561 | qsymbols
4562 | keyword_variable
4563 {
4564 /*%%%*/
4565 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_BEGIN(0, &@$);
4566 /*% %*/
4567 /*% ripper: var_ref!($1) %*/
4568 }
4569 | lambda
4570 ;
4571
4572 p_variable : tIDENTIFIER
4573 {
4574 /*%%%*/
4575 error_duplicate_pattern_variable(p, $1, &@1);
4576 $$ = assignable(p, $1, 0, &@$);
4577 /*% %*/
4578 /*% ripper: assignable(p, var_field(p, $1)) %*/
4579 }
4580 ;
4581
4582 p_var_ref : '^' tIDENTIFIER
4583 {
4584 /*%%%*/
4585 NODE *n = gettable(p, $2, &@$);
4586 if (!(nd_type_p(n, NODE_LVAR) || nd_type_p(n, NODE_DVAR))) {
4587 compile_error(p, "%"PRIsVALUE": no such local variable", rb_id2str($2));
4588 }
4589 $$ = n;
4590 /*% %*/
4591 /*% ripper: var_ref!($2) %*/
4592 }
4593 | '^' nonlocal_var
4594 {
4595 /*%%%*/
4596 if (!($$ = gettable(p, $2, &@$))) $$ = NEW_BEGIN(0, &@$);
4597 /*% %*/
4598 /*% ripper: var_ref!($2) %*/
4599 }
4600 ;
4601
4602 p_expr_ref : '^' tLPAREN expr_value ')'
4603 {
4604 /*%%%*/
4605 $$ = NEW_BEGIN($3, &@$);
4606 /*% %*/
4607 /*% ripper: begin!($3) %*/
4608 }
4609 ;
4610
4611 p_const : tCOLON3 cname
4612 {
4613 /*%%%*/
4614 $$ = NEW_COLON3($2, &@$);
4615 /*% %*/
4616 /*% ripper: top_const_ref!($2) %*/
4617 }
4618 | p_const tCOLON2 cname
4619 {
4620 /*%%%*/
4621 $$ = NEW_COLON2($1, $3, &@$);
4622 /*% %*/
4623 /*% ripper: const_path_ref!($1, $3) %*/
4624 }
4625 | tCONSTANT
4626 {
4627 /*%%%*/
4628 $$ = gettable(p, $1, &@$);
4629 /*% %*/
4630 /*% ripper: var_ref!($1) %*/
4631 }
4632 ;
4633
4634 opt_rescue : k_rescue exc_list exc_var then
4635 compstmt
4636 opt_rescue
4637 {
4638 /*%%%*/
4639 $$ = NEW_RESBODY($2,
4640 $3 ? block_append(p, node_assign(p, $3, NEW_ERRINFO(&@3), NO_LEX_CTXT, &@3), $5) : $5,
4641 $6, &@$);
4642 fixpos($$, $2?$2:$5);
4643 /*% %*/
4644 /*% ripper: rescue!(escape_Qundef($2), escape_Qundef($3), escape_Qundef($5), escape_Qundef($6)) %*/
4645 }
4646 | none
4647 ;
4648
4649 exc_list : arg_value
4650 {
4651 /*%%%*/
4652 $$ = NEW_LIST($1, &@$);
4653 /*% %*/
4654 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
4655 }
4656 | mrhs
4657 {
4658 /*%%%*/
4659 if (!($$ = splat_array($1))) $$ = $1;
4660 /*% %*/
4661 /*% ripper: $1 %*/
4662 }
4663 | none
4664 ;
4665
4666 exc_var : tASSOC lhs
4667 {
4668 $$ = $2;
4669 }
4670 | none
4671 ;
4672
4673 opt_ensure : k_ensure compstmt
4674 {
4675 /*%%%*/
4676 $$ = $2;
4677 /*% %*/
4678 /*% ripper: ensure!($2) %*/
4679 }
4680 | none
4681 ;
4682
4683 literal : numeric
4684 | symbol
4685 ;
4686
4687 strings : string
4688 {
4689 /*%%%*/
4690 NODE *node = $1;
4691 if (!node) {
4692 node = NEW_STR(STR_NEW0(), &@$);
4693 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit);
4694 }
4695 else {
4696 node = evstr2dstr(p, node);
4697 }
4698 $$ = node;
4699 /*% %*/
4700 /*% ripper: $1 %*/
4701 }
4702 ;
4703
4704 string : tCHAR
4705 | string1
4706 | string string1
4707 {
4708 /*%%%*/
4709 $$ = literal_concat(p, $1, $2, &@$);
4710 /*% %*/
4711 /*% ripper: string_concat!($1, $2) %*/
4712 }
4713 ;
4714
4715 string1 : tSTRING_BEG string_contents tSTRING_END
4716 {
4717 /*%%%*/
4718 $$ = heredoc_dedent(p, $2);
4719 if ($$) nd_set_loc($$, &@$);
4720 /*% %*/
4721 /*% ripper: string_literal!(heredoc_dedent(p, $2)) %*/
4722 }
4723 ;
4724
4725 xstring : tXSTRING_BEG xstring_contents tSTRING_END
4726 {
4727 /*%%%*/
4728 $$ = new_xstring(p, heredoc_dedent(p, $2), &@$);
4729 /*% %*/
4730 /*% ripper: xstring_literal!(heredoc_dedent(p, $2)) %*/
4731 }
4732 ;
4733
4734 regexp : tREGEXP_BEG regexp_contents tREGEXP_END
4735 {
4736 $$ = new_regexp(p, $2, $3, &@$);
4737 }
4738 ;
4739
4740 words : tWORDS_BEG ' ' word_list tSTRING_END
4741 {
4742 /*%%%*/
4743 $$ = make_list($3, &@$);
4744 /*% %*/
4745 /*% ripper: array!($3) %*/
4746 }
4747 ;
4748
4749 word_list : /* none */
4750 {
4751 /*%%%*/
4752 $$ = 0;
4753 /*% %*/
4754 /*% ripper: words_new! %*/
4755 }
4756 | word_list word ' '
4757 {
4758 /*%%%*/
4759 $$ = list_append(p, $1, evstr2dstr(p, $2));
4760 /*% %*/
4761 /*% ripper: words_add!($1, $2) %*/
4762 }
4763 ;
4764
4765 word : string_content
4766 /*% ripper[brace]: word_add!(word_new!, $1) %*/
4767 | word string_content
4768 {
4769 /*%%%*/
4770 $$ = literal_concat(p, $1, $2, &@$);
4771 /*% %*/
4772 /*% ripper: word_add!($1, $2) %*/
4773 }
4774 ;
4775
4776 symbols : tSYMBOLS_BEG ' ' symbol_list tSTRING_END
4777 {
4778 /*%%%*/
4779 $$ = make_list($3, &@$);
4780 /*% %*/
4781 /*% ripper: array!($3) %*/
4782 }
4783 ;
4784
4785 symbol_list : /* none */
4786 {
4787 /*%%%*/
4788 $$ = 0;
4789 /*% %*/
4790 /*% ripper: symbols_new! %*/
4791 }
4792 | symbol_list word ' '
4793 {
4794 /*%%%*/
4795 $$ = symbol_append(p, $1, evstr2dstr(p, $2));
4796 /*% %*/
4797 /*% ripper: symbols_add!($1, $2) %*/
4798 }
4799 ;
4800
4801 qwords : tQWORDS_BEG ' ' qword_list tSTRING_END
4802 {
4803 /*%%%*/
4804 $$ = make_list($3, &@$);
4805 /*% %*/
4806 /*% ripper: array!($3) %*/
4807 }
4808 ;
4809
4810 qsymbols : tQSYMBOLS_BEG ' ' qsym_list tSTRING_END
4811 {
4812 /*%%%*/
4813 $$ = make_list($3, &@$);
4814 /*% %*/
4815 /*% ripper: array!($3) %*/
4816 }
4817 ;
4818
4819 qword_list : /* none */
4820 {
4821 /*%%%*/
4822 $$ = 0;
4823 /*% %*/
4824 /*% ripper: qwords_new! %*/
4825 }
4826 | qword_list tSTRING_CONTENT ' '
4827 {
4828 /*%%%*/
4829 $$ = list_append(p, $1, $2);
4830 /*% %*/
4831 /*% ripper: qwords_add!($1, $2) %*/
4832 }
4833 ;
4834
4835 qsym_list : /* none */
4836 {
4837 /*%%%*/
4838 $$ = 0;
4839 /*% %*/
4840 /*% ripper: qsymbols_new! %*/
4841 }
4842 | qsym_list tSTRING_CONTENT ' '
4843 {
4844 /*%%%*/
4845 $$ = symbol_append(p, $1, $2);
4846 /*% %*/
4847 /*% ripper: qsymbols_add!($1, $2) %*/
4848 }
4849 ;
4850
4851 string_contents : /* none */
4852 {
4853 /*%%%*/
4854 $$ = 0;
4855 /*% %*/
4856 /*% ripper: string_content! %*/
4857 /*%%%*/
4858 /*%
4859 $$ = ripper_new_yylval(p, 0, $$, 0);
4860 %*/
4861 }
4862 | string_contents string_content
4863 {
4864 /*%%%*/
4865 $$ = literal_concat(p, $1, $2, &@$);
4866 /*% %*/
4867 /*% ripper: string_add!($1, $2) %*/
4868 /*%%%*/
4869 /*%
4870 if (ripper_is_node_yylval($1) && ripper_is_node_yylval($2) &&
4871 !RNODE($1)->nd_cval) {
4872 RNODE($1)->nd_cval = RNODE($2)->nd_cval;
4873 RNODE($1)->nd_rval = add_mark_object(p, $$);
4874 $$ = $1;
4875 }
4876 %*/
4877 }
4878 ;
4879
4880 xstring_contents: /* none */
4881 {
4882 /*%%%*/
4883 $$ = 0;
4884 /*% %*/
4885 /*% ripper: xstring_new! %*/
4886 }
4887 | xstring_contents string_content
4888 {
4889 /*%%%*/
4890 $$ = literal_concat(p, $1, $2, &@$);
4891 /*% %*/
4892 /*% ripper: xstring_add!($1, $2) %*/
4893 }
4894 ;
4895
4896 regexp_contents: /* none */
4897 {
4898 /*%%%*/
4899 $$ = 0;
4900 /*% %*/
4901 /*% ripper: regexp_new! %*/
4902 /*%%%*/
4903 /*%
4904 $$ = ripper_new_yylval(p, 0, $$, 0);
4905 %*/
4906 }
4907 | regexp_contents string_content
4908 {
4909 /*%%%*/
4910 NODE *head = $1, *tail = $2;
4911 if (!head) {
4912 $$ = tail;
4913 }
4914 else if (!tail) {
4915 $$ = head;
4916 }
4917 else {
4918 switch (nd_type(head)) {
4919 case NODE_STR:
4920 nd_set_type(head, NODE_DSTR);
4921 break;
4922 case NODE_DSTR:
4923 break;
4924 default:
4925 head = list_append(p, NEW_DSTR(Qnil, &@$), head);
4926 break;
4927 }
4928 $$ = list_append(p, head, tail);
4929 }
4930 /*%
4931 VALUE s1 = 1, s2 = 0, n1 = $1, n2 = $2;
4932 if (ripper_is_node_yylval(n1)) {
4933 s1 = RNODE(n1)->nd_cval;
4934 n1 = RNODE(n1)->nd_rval;
4935 }
4936 if (ripper_is_node_yylval(n2)) {
4937 s2 = RNODE(n2)->nd_cval;
4938 n2 = RNODE(n2)->nd_rval;
4939 }
4940 $$ = dispatch2(regexp_add, n1, n2);
4941 if (!s1 && s2) {
4942 $$ = ripper_new_yylval(p, 0, $$, s2);
4943 }
4944 %*/
4945 }
4946 ;
4947
4948 string_content : tSTRING_CONTENT
4949 /*% ripper[brace]: ripper_new_yylval(p, 0, get_value($1), $1) %*/
4950 | tSTRING_DVAR
4951 {
4952 /* need to backup p->lex.strterm so that a string literal `%&foo,#$&,bar&` can be parsed */
4953 $<strterm>$ = p->lex.strterm;
4954 p->lex.strterm = 0;
4955 SET_LEX_STATE(EXPR_BEG);
4956 }
4957 string_dvar
4958 {
4959 p->lex.strterm = $<strterm>2;
4960 /*%%%*/
4961 $$ = NEW_EVSTR($3, &@$);
4962 nd_set_line($$, @3.end_pos.lineno);
4963 /*% %*/
4964 /*% ripper: string_dvar!($3) %*/
4965 }
4966 | tSTRING_DBEG
4967 {
4968 CMDARG_PUSH(0);
4969 COND_PUSH(0);
4970 }
4971 {
4972 /* need to backup p->lex.strterm so that a string literal `%!foo,#{ !0 },bar!` can be parsed */
4973 $<strterm>$ = p->lex.strterm;
4974 p->lex.strterm = 0;
4975 }
4976 {
4977 $<num>$ = p->lex.state;
4978 SET_LEX_STATE(EXPR_BEG);
4979 }
4980 {
4981 $<num>$ = p->lex.brace_nest;
4982 p->lex.brace_nest = 0;
4983 }
4984 {
4985 $<num>$ = p->heredoc_indent;
4986 p->heredoc_indent = 0;
4987 }
4988 compstmt tSTRING_DEND
4989 {
4990 COND_POP();
4991 CMDARG_POP();
4992 p->lex.strterm = $<strterm>3;
4993 SET_LEX_STATE($<num>4);
4994 p->lex.brace_nest = $<num>5;
4995 p->heredoc_indent = $<num>6;
4996 p->heredoc_line_indent = -1;
4997 /*%%%*/
4998 if ($7) $7->flags &= ~NODE_FL_NEWLINE;
4999 $$ = new_evstr(p, $7, &@$);
5000 /*% %*/
5001 /*% ripper: string_embexpr!($7) %*/
5002 }
5003 ;
5004
5005 string_dvar : tGVAR
5006 {
5007 /*%%%*/
5008 $$ = NEW_GVAR($1, &@$);
5009 /*% %*/
5010 /*% ripper: var_ref!($1) %*/
5011 }
5012 | tIVAR
5013 {
5014 /*%%%*/
5015 $$ = NEW_IVAR($1, &@$);
5016 /*% %*/
5017 /*% ripper: var_ref!($1) %*/
5018 }
5019 | tCVAR
5020 {
5021 /*%%%*/
5022 $$ = NEW_CVAR($1, &@$);
5023 /*% %*/
5024 /*% ripper: var_ref!($1) %*/
5025 }
5026 | backref
5027 ;
5028
5029 symbol : ssym
5030 | dsym
5031 ;
5032
5033 ssym : tSYMBEG sym
5034 {
5035 SET_LEX_STATE(EXPR_END);
5036 /*%%%*/
5037 $$ = NEW_LIT(ID2SYM($2), &@$);
5038 /*% %*/
5039 /*% ripper: symbol_literal!(symbol!($2)) %*/
5040 }
5041 ;
5042
5043 sym : fname
5044 | tIVAR
5045 | tGVAR
5046 | tCVAR
5047 ;
5048
5049 dsym : tSYMBEG string_contents tSTRING_END
5050 {
5051 SET_LEX_STATE(EXPR_END);
5052 /*%%%*/
5053 $$ = dsym_node(p, $2, &@$);
5054 /*% %*/
5055 /*% ripper: dyna_symbol!($2) %*/
5056 }
5057 ;
5058
5059 numeric : simple_numeric
5060 | tUMINUS_NUM simple_numeric %prec tLOWEST
5061 {
5062 /*%%%*/
5063 $$ = $2;
5064 RB_OBJ_WRITE(p->ast, &$$->nd_lit, negate_lit(p, $$->nd_lit));
5065 /*% %*/
5066 /*% ripper: unary!(ID2VAL(idUMinus), $2) %*/
5067 }
5068 ;
5069
5070 simple_numeric : tINTEGER
5071 | tFLOAT
5072 | tRATIONAL
5073 | tIMAGINARY
5074 ;
5075
5076 nonlocal_var : tIVAR
5077 | tGVAR
5078 | tCVAR
5079 ;
5080
5081 user_variable : tIDENTIFIER
5082 | tIVAR
5083 | tGVAR
5084 | tCONSTANT
5085 | tCVAR
5086 ;
5087
5088 keyword_variable: keyword_nil {$$ = KWD2EID(nil, $1);}
5089 | keyword_self {$$ = KWD2EID(self, $1);}
5090 | keyword_true {$$ = KWD2EID(true, $1);}
5091 | keyword_false {$$ = KWD2EID(false, $1);}
5092 | keyword__FILE__ {$$ = KWD2EID(_FILE__, $1);}
5093 | keyword__LINE__ {$$ = KWD2EID(_LINE__, $1);}
5094 | keyword__ENCODING__ {$$ = KWD2EID(_ENCODING__, $1);}
5095 ;
5096
5097 var_ref : user_variable
5098 {
5099 /*%%%*/
5100 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_BEGIN(0, &@$);
5101 /*%
5102 if (id_is_var(p, get_id($1))) {
5103 $$ = dispatch1(var_ref, $1);
5104 }
5105 else {
5106 $$ = dispatch1(vcall, $1);
5107 }
5108 %*/
5109 }
5110 | keyword_variable
5111 {
5112 /*%%%*/
5113 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_BEGIN(0, &@$);
5114 /*% %*/
5115 /*% ripper: var_ref!($1) %*/
5116 }
5117 ;
5118
5119 var_lhs : user_variable
5120 {
5121 /*%%%*/
5122 $$ = assignable(p, $1, 0, &@$);
5123 /*% %*/
5124 /*% ripper: assignable(p, var_field(p, $1)) %*/
5125 }
5126 | keyword_variable
5127 {
5128 /*%%%*/
5129 $$ = assignable(p, $1, 0, &@$);
5130 /*% %*/
5131 /*% ripper: assignable(p, var_field(p, $1)) %*/
5132 }
5133 ;
5134
5135 backref : tNTH_REF
5136 | tBACK_REF
5137 ;
5138
5139 superclass : '<'
5140 {
5141 SET_LEX_STATE(EXPR_BEG);
5142 p->command_start = TRUE;
5143 }
5144 expr_value term
5145 {
5146 $$ = $3;
5147 }
5148 | /* none */
5149 {
5150 /*%%%*/
5151 $$ = 0;
5152 /*% %*/
5153 /*% ripper: Qnil %*/
5154 }
5155 ;
5156
5157 f_opt_paren_args: f_paren_args
5158 | none
5159 {
5160 p->ctxt.in_argdef = 0;
5161 $$ = new_args_tail(p, Qnone, Qnone, Qnone, &@0);
5162 $$ = new_args(p, Qnone, Qnone, Qnone, Qnone, $$, &@0);
5163 }
5164 ;
5165
5166 f_paren_args : '(' f_args rparen
5167 {
5168 /*%%%*/
5169 $$ = $2;
5170 /*% %*/
5171 /*% ripper: paren!($2) %*/
5172 SET_LEX_STATE(EXPR_BEG);
5173 p->command_start = TRUE;
5174 p->ctxt.in_argdef = 0;
5175 }
5176 ;
5177
5178 f_arglist : f_paren_args
5179 | {
5180 $<ctxt>$ = p->ctxt;
5181 p->ctxt.in_kwarg = 1;
5182 p->ctxt.in_argdef = 1;
5183 SET_LEX_STATE(p->lex.state|EXPR_LABEL); /* force for args */
5184 }
5185 f_args term
5186 {
5187 p->ctxt.in_kwarg = $<ctxt>1.in_kwarg;
5188 p->ctxt.in_argdef = 0;
5189 $$ = $2;
5190 SET_LEX_STATE(EXPR_BEG);
5191 p->command_start = TRUE;
5192 }
5193 ;
5194
5195 args_tail : f_kwarg ',' f_kwrest opt_f_block_arg
5196 {
5197 $$ = new_args_tail(p, $1, $3, $4, &@3);
5198 }
5199 | f_kwarg opt_f_block_arg
5200 {
5201 $$ = new_args_tail(p, $1, Qnone, $2, &@1);
5202 }
5203 | f_any_kwrest opt_f_block_arg
5204 {
5205 $$ = new_args_tail(p, Qnone, $1, $2, &@1);
5206 }
5207 | f_block_arg
5208 {
5209 $$ = new_args_tail(p, Qnone, Qnone, $1, &@1);
5210 }
5211 | args_forward
5212 {
5213 add_forwarding_args(p);
5214 $$ = new_args_tail(p, Qnone, $1, ID2VAL(idFWD_BLOCK), &@1);
5215 }
5216 ;
5217
5218 opt_args_tail : ',' args_tail
5219 {
5220 $$ = $2;
5221 }
5222 | /* none */
5223 {
5224 $$ = new_args_tail(p, Qnone, Qnone, Qnone, &@0);
5225 }
5226 ;
5227
5228 f_args : f_arg ',' f_optarg ',' f_rest_arg opt_args_tail
5229 {
5230 $$ = new_args(p, $1, $3, $5, Qnone, $6, &@$);
5231 }
5232 | f_arg ',' f_optarg ',' f_rest_arg ',' f_arg opt_args_tail
5233 {
5234 $$ = new_args(p, $1, $3, $5, $7, $8, &@$);
5235 }
5236 | f_arg ',' f_optarg opt_args_tail
5237 {
5238 $$ = new_args(p, $1, $3, Qnone, Qnone, $4, &@$);
5239 }
5240 | f_arg ',' f_optarg ',' f_arg opt_args_tail
5241 {
5242 $$ = new_args(p, $1, $3, Qnone, $5, $6, &@$);
5243 }
5244 | f_arg ',' f_rest_arg opt_args_tail
5245 {
5246 $$ = new_args(p, $1, Qnone, $3, Qnone, $4, &@$);
5247 }
5248 | f_arg ',' f_rest_arg ',' f_arg opt_args_tail
5249 {
5250 $$ = new_args(p, $1, Qnone, $3, $5, $6, &@$);
5251 }
5252 | f_arg opt_args_tail
5253 {
5254 $$ = new_args(p, $1, Qnone, Qnone, Qnone, $2, &@$);
5255 }
5256 | f_optarg ',' f_rest_arg opt_args_tail
5257 {
5258 $$ = new_args(p, Qnone, $1, $3, Qnone, $4, &@$);
5259 }
5260 | f_optarg ',' f_rest_arg ',' f_arg opt_args_tail
5261 {
5262 $$ = new_args(p, Qnone, $1, $3, $5, $6, &@$);
5263 }
5264 | f_optarg opt_args_tail
5265 {
5266 $$ = new_args(p, Qnone, $1, Qnone, Qnone, $2, &@$);
5267 }
5268 | f_optarg ',' f_arg opt_args_tail
5269 {
5270 $$ = new_args(p, Qnone, $1, Qnone, $3, $4, &@$);
5271 }
5272 | f_rest_arg opt_args_tail
5273 {
5274 $$ = new_args(p, Qnone, Qnone, $1, Qnone, $2, &@$);
5275 }
5276 | f_rest_arg ',' f_arg opt_args_tail
5277 {
5278 $$ = new_args(p, Qnone, Qnone, $1, $3, $4, &@$);
5279 }
5280 | args_tail
5281 {
5282 $$ = new_args(p, Qnone, Qnone, Qnone, Qnone, $1, &@$);
5283 }
5284 | /* none */
5285 {
5286 $$ = new_args_tail(p, Qnone, Qnone, Qnone, &@0);
5287 $$ = new_args(p, Qnone, Qnone, Qnone, Qnone, $$, &@0);
5288 }
5289 ;
5290
5291 args_forward : tBDOT3
5292 {
5293 /*%%%*/
5294 $$ = idFWD_KWREST;
5295 /*% %*/
5296 /*% ripper: args_forward! %*/
5297 }
5298 ;
5299
5300 f_bad_arg : tCONSTANT
5301 {
5302 static const char mesg[] = "formal argument cannot be a constant";
5303 /*%%%*/
5304 yyerror1(&@1, mesg);
5305 $$ = 0;
5306 /*% %*/
5307 /*% ripper[error]: param_error!(ERR_MESG(), $1) %*/
5308 }
5309 | tIVAR
5310 {
5311 static const char mesg[] = "formal argument cannot be an instance variable";
5312 /*%%%*/
5313 yyerror1(&@1, mesg);
5314 $$ = 0;
5315 /*% %*/
5316 /*% ripper[error]: param_error!(ERR_MESG(), $1) %*/
5317 }
5318 | tGVAR
5319 {
5320 static const char mesg[] = "formal argument cannot be a global variable";
5321 /*%%%*/
5322 yyerror1(&@1, mesg);
5323 $$ = 0;
5324 /*% %*/
5325 /*% ripper[error]: param_error!(ERR_MESG(), $1) %*/
5326 }
5327 | tCVAR
5328 {
5329 static const char mesg[] = "formal argument cannot be a class variable";
5330 /*%%%*/
5331 yyerror1(&@1, mesg);
5332 $$ = 0;
5333 /*% %*/
5334 /*% ripper[error]: param_error!(ERR_MESG(), $1) %*/
5335 }
5336 ;
5337
5338 f_norm_arg : f_bad_arg
5339 | tIDENTIFIER
5340 {
5341 formal_argument(p, $1);
5342 p->max_numparam = ORDINAL_PARAM;
5343 $$ = $1;
5344 }
5345 ;
5346
5347 f_arg_asgn : f_norm_arg
5348 {
5349 ID id = get_id($1);
5350 arg_var(p, id);
5351 p->cur_arg = id;
5352 $$ = $1;
5353 }
5354 ;
5355
5356 f_arg_item : f_arg_asgn
5357 {
5358 p->cur_arg = 0;
5359 /*%%%*/
5360 $$ = NEW_ARGS_AUX($1, 1, &NULL_LOC);
5361 /*% %*/
5362 /*% ripper: get_value($1) %*/
5363 }
5364 | tLPAREN f_margs rparen
5365 {
5366 /*%%%*/
5367 ID tid = internal_id(p);
5368 YYLTYPE loc;
5369 loc.beg_pos = @2.beg_pos;
5370 loc.end_pos = @2.beg_pos;
5371 arg_var(p, tid);
5372 if (dyna_in_block(p)) {
5373 $2->nd_value = NEW_DVAR(tid, &loc);
5374 }
5375 else {
5376 $2->nd_value = NEW_LVAR(tid, &loc);
5377 }
5378 $$ = NEW_ARGS_AUX(tid, 1, &NULL_LOC);
5379 $$->nd_next = $2;
5380 /*% %*/
5381 /*% ripper: mlhs_paren!($2) %*/
5382 }
5383 ;
5384
5385 f_arg : f_arg_item
5386 /*% ripper[brace]: rb_ary_new3(1, get_value($1)) %*/
5387 | f_arg ',' f_arg_item
5388 {
5389 /*%%%*/
5390 $$ = $1;
5391 $$->nd_plen++;
5392 $$->nd_next = block_append(p, $$->nd_next, $3->nd_next);
5393 rb_discard_node(p, $3);
5394 /*% %*/
5395 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5396 }
5397 ;
5398
5399
5400 f_label : tLABEL
5401 {
5402 arg_var(p, formal_argument(p, $1));
5403 p->cur_arg = get_id($1);
5404 p->max_numparam = ORDINAL_PARAM;
5405 p->ctxt.in_argdef = 0;
5406 $$ = $1;
5407 }
5408 ;
5409
5410 f_kw : f_label arg_value
5411 {
5412 p->cur_arg = 0;
5413 p->ctxt.in_argdef = 1;
5414 /*%%%*/
5415 $$ = new_kw_arg(p, assignable(p, $1, $2, &@$), &@$);
5416 /*% %*/
5417 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), get_value($2)) %*/
5418 }
5419 | f_label
5420 {
5421 p->cur_arg = 0;
5422 p->ctxt.in_argdef = 1;
5423 /*%%%*/
5424 $$ = new_kw_arg(p, assignable(p, $1, NODE_SPECIAL_REQUIRED_KEYWORD, &@$), &@$);
5425 /*% %*/
5426 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), 0) %*/
5427 }
5428 ;
5429
5430 f_block_kw : f_label primary_value
5431 {
5432 p->ctxt.in_argdef = 1;
5433 /*%%%*/
5434 $$ = new_kw_arg(p, assignable(p, $1, $2, &@$), &@$);
5435 /*% %*/
5436 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), get_value($2)) %*/
5437 }
5438 | f_label
5439 {
5440 p->ctxt.in_argdef = 1;
5441 /*%%%*/
5442 $$ = new_kw_arg(p, assignable(p, $1, NODE_SPECIAL_REQUIRED_KEYWORD, &@$), &@$);
5443 /*% %*/
5444 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), 0) %*/
5445 }
5446 ;
5447
5448 f_block_kwarg : f_block_kw
5449 {
5450 /*%%%*/
5451 $$ = $1;
5452 /*% %*/
5453 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
5454 }
5455 | f_block_kwarg ',' f_block_kw
5456 {
5457 /*%%%*/
5458 $$ = kwd_append($1, $3);
5459 /*% %*/
5460 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5461 }
5462 ;
5463
5464
5465 f_kwarg : f_kw
5466 {
5467 /*%%%*/
5468 $$ = $1;
5469 /*% %*/
5470 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
5471 }
5472 | f_kwarg ',' f_kw
5473 {
5474 /*%%%*/
5475 $$ = kwd_append($1, $3);
5476 /*% %*/
5477 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5478 }
5479 ;
5480
5481 kwrest_mark : tPOW
5482 | tDSTAR
5483 ;
5484
5485 f_no_kwarg : kwrest_mark keyword_nil
5486 {
5487 /*%%%*/
5488 /*% %*/
5489 /*% ripper: nokw_param!(Qnil) %*/
5490 }
5491 ;
5492
5493 f_kwrest : kwrest_mark tIDENTIFIER
5494 {
5495 arg_var(p, shadowing_lvar(p, get_id($2)));
5496 /*%%%*/
5497 $$ = $2;
5498 /*% %*/
5499 /*% ripper: kwrest_param!($2) %*/
5500 }
5501 | kwrest_mark
5502 {
5503 /*%%%*/
5504 arg_var(p, shadowing_lvar(p, get_id(ANON_KEYWORD_REST_ID)));
5505 /*% %*/
5506 /*% ripper: kwrest_param!(Qnil) %*/
5507 }
5508 ;
5509
5510 f_opt : f_arg_asgn f_eq arg_value
5511 {
5512 p->cur_arg = 0;
5513 p->ctxt.in_argdef = 1;
5514 /*%%%*/
5515 $$ = NEW_OPT_ARG(0, assignable(p, $1, $3, &@$), &@$);
5516 /*% %*/
5517 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), get_value($3)) %*/
5518 }
5519 ;
5520
5521 f_block_opt : f_arg_asgn f_eq primary_value
5522 {
5523 p->cur_arg = 0;
5524 p->ctxt.in_argdef = 1;
5525 /*%%%*/
5526 $$ = NEW_OPT_ARG(0, assignable(p, $1, $3, &@$), &@$);
5527 /*% %*/
5528 /*% ripper: rb_assoc_new(get_value(assignable(p, $1)), get_value($3)) %*/
5529 }
5530 ;
5531
5532 f_block_optarg : f_block_opt
5533 {
5534 /*%%%*/
5535 $$ = $1;
5536 /*% %*/
5537 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
5538 }
5539 | f_block_optarg ',' f_block_opt
5540 {
5541 /*%%%*/
5542 $$ = opt_arg_append($1, $3);
5543 /*% %*/
5544 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5545 }
5546 ;
5547
5548 f_optarg : f_opt
5549 {
5550 /*%%%*/
5551 $$ = $1;
5552 /*% %*/
5553 /*% ripper: rb_ary_new3(1, get_value($1)) %*/
5554 }
5555 | f_optarg ',' f_opt
5556 {
5557 /*%%%*/
5558 $$ = opt_arg_append($1, $3);
5559 /*% %*/
5560 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5561 }
5562 ;
5563
5564 restarg_mark : '*'
5565 | tSTAR
5566 ;
5567
5568 f_rest_arg : restarg_mark tIDENTIFIER
5569 {
5570 arg_var(p, shadowing_lvar(p, get_id($2)));
5571 /*%%%*/
5572 $$ = $2;
5573 /*% %*/
5574 /*% ripper: rest_param!($2) %*/
5575 }
5576 | restarg_mark
5577 {
5578 /*%%%*/
5579 arg_var(p, shadowing_lvar(p, get_id(ANON_REST_ID)));
5580 /*% %*/
5581 /*% ripper: rest_param!(Qnil) %*/
5582 }
5583 ;
5584
5585 blkarg_mark : '&'
5586 | tAMPER
5587 ;
5588
5589 f_block_arg : blkarg_mark tIDENTIFIER
5590 {
5591 arg_var(p, shadowing_lvar(p, get_id($2)));
5592 /*%%%*/
5593 $$ = $2;
5594 /*% %*/
5595 /*% ripper: blockarg!($2) %*/
5596 }
5597 | blkarg_mark
5598 {
5599 /*%%%*/
5600 arg_var(p, shadowing_lvar(p, get_id(ANON_BLOCK_ID)));
5601 /*%
5602 $$ = dispatch1(blockarg, Qnil);
5603 %*/
5604 }
5605 ;
5606
5607 opt_f_block_arg : ',' f_block_arg
5608 {
5609 $$ = $2;
5610 }
5611 | none
5612 {
5613 $$ = Qnull;
5614 }
5615 ;
5616
5617 singleton : var_ref
5618 {
5619 value_expr($1);
5620 $$ = $1;
5621 }
5622 | '(' {SET_LEX_STATE(EXPR_BEG);} expr rparen
5623 {
5624 /*%%%*/
5625 switch (nd_type($3)) {
5626 case NODE_STR:
5627 case NODE_DSTR:
5628 case NODE_XSTR:
5629 case NODE_DXSTR:
5630 case NODE_DREGX:
5631 case NODE_LIT:
5632 case NODE_LIST:
5633 case NODE_ZLIST:
5634 yyerror1(&@3, "can't define singleton method for literals");
5635 break;
5636 default:
5637 value_expr($3);
5638 break;
5639 }
5640 $$ = $3;
5641 /*% %*/
5642 /*% ripper: paren!($3) %*/
5643 }
5644 ;
5645
5646 assoc_list : none
5647 | assocs trailer
5648 {
5649 /*%%%*/
5650 $$ = $1;
5651 /*% %*/
5652 /*% ripper: assoclist_from_args!($1) %*/
5653 }
5654 ;
5655
5656 assocs : assoc
5657 /*% ripper[brace]: rb_ary_new3(1, get_value($1)) %*/
5658 | assocs ',' assoc
5659 {
5660 /*%%%*/
5661 NODE *assocs = $1;
5662 NODE *tail = $3;
5663 if (!assocs) {
5664 assocs = tail;
5665 }
5666 else if (tail) {
5667 if (assocs->nd_head &&
5668 !tail->nd_head && nd_type_p(tail->nd_next, NODE_LIST) &&
5669 nd_type_p(tail->nd_next->nd_head, NODE_HASH)) {
5670 /* DSTAR */
5671 tail = tail->nd_next->nd_head->nd_head;
5672 }
5673 assocs = list_concat(assocs, tail);
5674 }
5675 $$ = assocs;
5676 /*% %*/
5677 /*% ripper: rb_ary_push($1, get_value($3)) %*/
5678 }
5679 ;
5680
5681 assoc : arg_value tASSOC arg_value
5682 {
5683 /*%%%*/
5684 if (nd_type_p($1, NODE_STR)) {
5685 nd_set_type($1, NODE_LIT);
5686 RB_OBJ_WRITE(p->ast, &$1->nd_lit, rb_fstring($1->nd_lit));
5687 }
5688 $$ = list_append(p, NEW_LIST($1, &@$), $3);
5689 /*% %*/
5690 /*% ripper: assoc_new!($1, $3) %*/
5691 }
5692 | tLABEL arg_value
5693 {
5694 /*%%%*/
5695 $$ = list_append(p, NEW_LIST(NEW_LIT(ID2SYM($1), &@1), &@$), $2);
5696 /*% %*/
5697 /*% ripper: assoc_new!($1, $2) %*/
5698 }
5699 | tLABEL
5700 {
5701 /*%%%*/
5702 NODE *val = gettable(p, $1, &@$);
5703 if (!val) val = NEW_BEGIN(0, &@$);
5704 $$ = list_append(p, NEW_LIST(NEW_LIT(ID2SYM($1), &@1), &@$), val);
5705 /*% %*/
5706 /*% ripper: assoc_new!($1, Qnil) %*/
5707 }
5708 | tSTRING_BEG string_contents tLABEL_END arg_value
5709 {
5710 /*%%%*/
5711 YYLTYPE loc = code_loc_gen(&@1, &@3);
5712 $$ = list_append(p, NEW_LIST(dsym_node(p, $2, &loc), &loc), $4);
5713 /*% %*/
5714 /*% ripper: assoc_new!(dyna_symbol!($2), $4) %*/
5715 }
5716 | tDSTAR arg_value
5717 {
5718 /*%%%*/
5719 if (nd_type_p($2, NODE_HASH) &&
5720 !($2->nd_head && $2->nd_head->nd_alen)) {
5721 static VALUE empty_hash;
5722 if (!empty_hash) {
5723 empty_hash = rb_obj_freeze(rb_hash_new());
5724 rb_gc_register_mark_object(empty_hash);
5725 }
5726 $$ = list_append(p, NEW_LIST(0, &@$), NEW_LIT(empty_hash, &@$));
5727 }
5728 else
5729 $$ = list_append(p, NEW_LIST(0, &@$), $2);
5730 /*% %*/
5731 /*% ripper: assoc_splat!($2) %*/
5732 }
5733 | tDSTAR
5734 {
5735 /*%%%*/
5736 if (!local_id(p, ANON_KEYWORD_REST_ID)) {
5737 compile_error(p, "no anonymous keyword rest parameter");
5738 }
5739 $$ = list_append(p, NEW_LIST(0, &@$),
5740 NEW_LVAR(ANON_KEYWORD_REST_ID, &@$));
5741 /*% %*/
5742 /*% ripper: assoc_splat!(Qnil) %*/
5743 }
5744 ;
5745
5746 operation : tIDENTIFIER
5747 | tCONSTANT
5748 | tFID
5749 ;
5750
5751 operation2 : tIDENTIFIER
5752 | tCONSTANT
5753 | tFID
5754 | op
5755 ;
5756
5757 operation3 : tIDENTIFIER
5758 | tFID
5759 | op
5760 ;
5761
5762 dot_or_colon : '.'
5763 | tCOLON2
5764 ;
5765
5766 call_op : '.'
5767 | tANDDOT
5768 ;
5769
5770 call_op2 : call_op
5771 | tCOLON2
5772 ;
5773
5774 opt_terms : /* none */
5775 | terms
5776 ;
5777
5778 opt_nl : /* none */
5779 | '\n'
5780 ;
5781
5782 rparen : opt_nl ')'
5783 ;
5784
5785 rbracket : opt_nl ']'
5786 ;
5787
5788 rbrace : opt_nl '}'
5789 ;
5790
5791 trailer : /* none */
5792 | '\n'
5793 | ','
5794 ;
5795
5796 term : ';' {yyerrok;token_flush(p);}
5797 | '\n' {token_flush(p);}
5798 ;
5799
5800 terms : term
5801 | terms ';' {yyerrok;}
5802 ;
5803
5804 none : /* none */
5805 {
5806 $$ = Qnull;
5807 }
5808 ;
5809 %%
5810 # undef p
5811 # undef yylex
5812 # undef yylval
5813 # define yylval (*p->lval)
5814
5815 static int regx_options(struct parser_params*);
5816 static int tokadd_string(struct parser_params*,int,int,int,long*,rb_encoding**,rb_encoding**);
5817 static void tokaddmbc(struct parser_params *p, int c, rb_encoding *enc);
5818 static enum yytokentype parse_string(struct parser_params*,rb_strterm_literal_t*);
5819 static enum yytokentype here_document(struct parser_params*,rb_strterm_heredoc_t*);
5820
5821 #ifndef RIPPER
5822 # define set_yylval_node(x) { \
5823 YYLTYPE _cur_loc; \
5824 rb_parser_set_location(p, &_cur_loc); \
5825 yylval.node = (x); \
5826 }
5827 # define set_yylval_str(x) \
5828 do { \
5829 set_yylval_node(NEW_STR(x, &_cur_loc)); \
5830 RB_OBJ_WRITTEN(p->ast, Qnil, x); \
5831 } while(0)
5832 # define set_yylval_literal(x) \
5833 do { \
5834 set_yylval_node(NEW_LIT(x, &_cur_loc)); \
5835 RB_OBJ_WRITTEN(p->ast, Qnil, x); \
5836 } while(0)
5837 # define set_yylval_num(x) (yylval.num = (x))
5838 # define set_yylval_id(x) (yylval.id = (x))
5839 # define set_yylval_name(x) (yylval.id = (x))
5840 # define yylval_id() (yylval.id)
5841 #else
5842 static inline VALUE
5843 ripper_yylval_id(struct parser_params *p, ID x)
5844 {
5845 return ripper_new_yylval(p, x, ID2SYM(x), 0);
5846 }
5847 # define set_yylval_str(x) (yylval.val = add_mark_object(p, (x)))
5848 # define set_yylval_num(x) (yylval.val = ripper_new_yylval(p, (x), 0, 0))
5849 # define set_yylval_id(x) (void)(x)
5850 # define set_yylval_name(x) (void)(yylval.val = ripper_yylval_id(p, x))
5851 # define set_yylval_literal(x) add_mark_object(p, (x))
5852 # define set_yylval_node(x) (yylval.val = ripper_new_yylval(p, 0, 0, STR_NEW(p->lex.ptok, p->lex.pcur-p->lex.ptok)))
5853 # define yylval_id() yylval.id
5854 # define _cur_loc NULL_LOC /* dummy */
5855 #endif
5856
5857 #define set_yylval_noname() set_yylval_id(keyword_nil)
5858
5859 #ifndef RIPPER
5860 #define literal_flush(p, ptr) ((p)->lex.ptok = (ptr))
5861 #define dispatch_scan_event(p, t) ((void)0)
5862 #define dispatch_delayed_token(p, t) ((void)0)
5863 #define has_delayed_token(p) (0)
5864 #else
5865 #define literal_flush(p, ptr) ((void)(ptr))
5866
5867 #define yylval_rval (*(RB_TYPE_P(yylval.val, T_NODE) ? &yylval.node->nd_rval : &yylval.val))
5868
5869 static inline VALUE
5870 intern_sym(const char *name)
5871 {
5872 ID id = rb_intern_const(name);
5873 return ID2SYM(id);
5874 }
5875
5876 static int
5877 ripper_has_scan_event(struct parser_params *p)
5878 {
5879 if (p->lex.pcur < p->lex.ptok) rb_raise(rb_eRuntimeError, "lex.pcur < lex.ptok");
5880 return p->lex.pcur > p->lex.ptok;
5881 }
5882
5883 static VALUE
5884 ripper_scan_event_val(struct parser_params *p, enum yytokentype t)
5885 {
5886 VALUE str = STR_NEW(p->lex.ptok, p->lex.pcur - p->lex.ptok);
5887 VALUE rval = ripper_dispatch1(p, ripper_token2eventid(t), str);
5888 token_flush(p);
5889 return rval;
5890 }
5891
5892 static void
5893 ripper_dispatch_scan_event(struct parser_params *p, enum yytokentype t)
5894 {
5895 if (!ripper_has_scan_event(p)) return;
5896 add_mark_object(p, yylval_rval = ripper_scan_event_val(p, t));
5897 }
5898 #define dispatch_scan_event(p, t) ripper_dispatch_scan_event(p, t)
5899
5900 static void
5901 ripper_dispatch_delayed_token(struct parser_params *p, enum yytokentype t)
5902 {
5903 int saved_line = p->ruby_sourceline;
5904 const char *saved_tokp = p->lex.ptok;
5905
5906 if (NIL_P(p->delayed.token)) return;
5907 p->ruby_sourceline = p->delayed.line;
5908 p->lex.ptok = p->lex.pbeg + p->delayed.col;
5909 add_mark_object(p, yylval_rval = ripper_dispatch1(p, ripper_token2eventid(t), p->delayed.token));
5910 p->delayed.token = Qnil;
5911 p->ruby_sourceline = saved_line;
5912 p->lex.ptok = saved_tokp;
5913 }
5914 #define dispatch_delayed_token(p, t) ripper_dispatch_delayed_token(p, t)
5915 #define has_delayed_token(p) (!NIL_P(p->delayed.token))
5916 #endif /* RIPPER */
5917
5918 static inline int
5919 is_identchar(const char *ptr, const char *MAYBE_UNUSED(ptr_end), rb_encoding *enc)
5920 {
5921 return rb_enc_isalnum((unsigned char)*ptr, enc) || *ptr == '_' || !ISASCII(*ptr);
5922 }
5923
5924 static inline int
5925 parser_is_identchar(struct parser_params *p)
5926 {
5927 return !(p)->eofp && is_identchar(p->lex.pcur-1, p->lex.pend, p->enc);
5928 }
5929
5930 static inline int
5931 parser_isascii(struct parser_params *p)
5932 {
5933 return ISASCII(*(p->lex.pcur-1));
5934 }
5935
5936 static void
5937 token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc)
5938 {
5939 int column = 1, nonspc = 0, i;
5940 for (i = 0; i < loc->beg_pos.column; i++, ptr++) {
5941 if (*ptr == '\t') {
5942 column = (((column - 1) / TAB_WIDTH) + 1) * TAB_WIDTH;
5943 }
5944 column++;
5945 if (*ptr != ' ' && *ptr != '\t') {
5946 nonspc = 1;
5947 }
5948 }
5949
5950 ptinfo->beg = loc->beg_pos;
5951 ptinfo->indent = column;
5952 ptinfo->nonspc = nonspc;
5953 }
5954
5955 static void
5956 token_info_push(struct parser_params *p, const char *token, const rb_code_location_t *loc)
5957 {
5958 token_info *ptinfo;
5959
5960 if (!p->token_info_enabled) return;
5961 ptinfo = ALLOC(token_info);
5962 ptinfo->token = token;
5963 ptinfo->next = p->token_info;
5964 token_info_setup(ptinfo, p->lex.pbeg, loc);
5965
5966 p->token_info = ptinfo;
5967 }
5968
5969 static void
5970 token_info_pop(struct parser_params *p, const char *token, const rb_code_location_t *loc)
5971 {
5972 token_info *ptinfo_beg = p->token_info;
5973
5974 if (!ptinfo_beg) return;
5975 p->token_info = ptinfo_beg->next;
5976
5977 /* indentation check of matched keywords (begin..end, if..end, etc.) */
5978 token_info_warn(p, token, ptinfo_beg, 1, loc);
5979 ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg));
5980 }
5981
5982 static void
5983 token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos)
5984 {
5985 token_info *ptinfo_beg = p->token_info;
5986
5987 if (!ptinfo_beg) return;
5988 p->token_info = ptinfo_beg->next;
5989
5990 if (ptinfo_beg->beg.lineno != beg_pos.lineno ||
5991 ptinfo_beg->beg.column != beg_pos.column ||
5992 strcmp(ptinfo_beg->token, token)) {
5993 compile_error(p, "token position mismatch: %d:%d:%s expected but %d:%d:%s",
5994 beg_pos.lineno, beg_pos.column, token,
5995 ptinfo_beg->beg.lineno, ptinfo_beg->beg.column,
5996 ptinfo_beg->token);
5997 }
5998
5999 ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg));
6000 }
6001
6002 static void
6003 token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc)
6004 {
6005 token_info ptinfo_end_body, *ptinfo_end = &ptinfo_end_body;
6006 if (!p->token_info_enabled) return;
6007 if (!ptinfo_beg) return;
6008 token_info_setup(ptinfo_end, p->lex.pbeg, loc);
6009 if (ptinfo_beg->beg.lineno == ptinfo_end->beg.lineno) return; /* ignore one-line block */
6010 if (ptinfo_beg->nonspc || ptinfo_end->nonspc) return; /* ignore keyword in the middle of a line */
6011 if (ptinfo_beg->indent == ptinfo_end->indent) return; /* the indents are matched */
6012 if (!same && ptinfo_beg->indent < ptinfo_end->indent) return;
6013 rb_warn3L(ptinfo_end->beg.lineno,
6014 "mismatched indentations at '%s' with '%s' at %d",
6015 WARN_S(token), WARN_S(ptinfo_beg->token), WARN_I(ptinfo_beg->beg.lineno));
6016 }
6017
6018 static int
6019 parser_precise_mbclen(struct parser_params *p, const char *ptr)
6020 {
6021 int len = rb_enc_precise_mbclen(ptr, p->lex.pend, p->enc);
6022 if (!MBCLEN_CHARFOUND_P(len)) {
6023 compile_error(p, "invalid multibyte char (%s)", rb_enc_name(p->enc));
6024 return -1;
6025 }
6026 return len;
6027 }
6028
6029 #ifndef RIPPER
6030 static void ruby_show_error_line(VALUE errbuf, const YYLTYPE *yylloc, int lineno, VALUE str);
6031
6032 static inline void
6033 parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc)
6034 {
6035 VALUE str;
6036 int lineno = p->ruby_sourceline;
6037 if (!yylloc) {
6038 return;
6039 }
6040 else if (yylloc->beg_pos.lineno == lineno) {
6041 str = p->lex.lastline;
6042 }
6043 else {
6044 return;
6045 }
6046 ruby_show_error_line(p->error_buffer, yylloc, lineno, str);
6047 }
6048
6049 static int
6050 parser_yyerror(struct parser_params *p, const YYLTYPE *yylloc, const char *msg)
6051 {
6052 #if 0
6053 YYLTYPE current;
6054
6055 if (!yylloc) {
6056 yylloc = RUBY_SET_YYLLOC(current);
6057 }
6058 else if ((p->ruby_sourceline != yylloc->beg_pos.lineno &&
6059 p->ruby_sourceline != yylloc->end_pos.lineno)) {
6060 yylloc = 0;
6061 }
6062 #endif
6063 compile_error(p, "%s", msg);
6064 parser_show_error_line(p, yylloc);
6065 return 0;
6066 }
6067
6068 static int
6069 parser_yyerror0(struct parser_params *p, const char *msg)
6070 {
6071 YYLTYPE current;
6072 return parser_yyerror(p, RUBY_SET_YYLLOC(current), msg);
6073 }
6074
6075 static void
6076 ruby_show_error_line(VALUE errbuf, const YYLTYPE *yylloc, int lineno, VALUE str)
6077 {
6078 VALUE mesg;
6079 const int max_line_margin = 30;
6080 const char *ptr, *ptr_end, *pt, *pb;
6081 const char *pre = "", *post = "", *pend;
6082 const char *code = "", *caret = "";
6083 const char *lim;
6084 const char *const pbeg = RSTRING_PTR(str);
6085 char *buf;
6086 long len;
6087 int i;
6088
6089 if (!yylloc) return;
6090 pend = RSTRING_END(str);
6091 if (pend > pbeg && pend[-1] == '\n') {
6092 if (--pend > pbeg && pend[-1] == '\r') --pend;
6093 }
6094
6095 pt = pend;
6096 if (lineno == yylloc->end_pos.lineno &&
6097 (pend - pbeg) > yylloc->end_pos.column) {
6098 pt = pbeg + yylloc->end_pos.column;
6099 }
6100
6101 ptr = ptr_end = pt;
6102 lim = ptr - pbeg > max_line_margin ? ptr - max_line_margin : pbeg;
6103 while ((lim < ptr) && (*(ptr-1) != '\n')) ptr--;
6104
6105 lim = pend - ptr_end > max_line_margin ? ptr_end + max_line_margin : pend;
6106 while ((ptr_end < lim) && (*ptr_end != '\n') && (*ptr_end != '\r')) ptr_end++;
6107
6108 len = ptr_end - ptr;
6109 if (len > 4) {
6110 if (ptr > pbeg) {
6111 ptr = rb_enc_prev_char(pbeg, ptr, pt, rb_enc_get(str));
6112 if (ptr > pbeg) pre = "...";
6113 }
6114 if (ptr_end < pend) {
6115 ptr_end = rb_enc_prev_char(pt, ptr_end, pend, rb_enc_get(str));
6116 if (ptr_end < pend) post = "...";
6117 }
6118 }
6119 pb = pbeg;
6120 if (lineno == yylloc->beg_pos.lineno) {
6121 pb += yylloc->beg_pos.column;
6122 if (pb > pt) pb = pt;
6123 }
6124 if (pb < ptr) pb = ptr;
6125 if (len <= 4 && yylloc->beg_pos.lineno == yylloc->end_pos.lineno) {
6126 return;
6127 }
6128 if (RTEST(errbuf)) {
6129 mesg = rb_attr_get(errbuf, idMesg);
6130 if (RSTRING_LEN(mesg) > 0 && *(RSTRING_END(mesg)-1) != '\n')
6131 rb_str_cat_cstr(mesg, "\n");
6132 }
6133 else {
6134 mesg = rb_enc_str_new(0, 0, rb_enc_get(str));
6135 }
6136 if (!errbuf && rb_stderr_tty_p()) {
6137 #define CSI_BEGIN "\033["
6138 #define CSI_SGR "m"
6139 rb_str_catf(mesg,
6140 CSI_BEGIN""CSI_SGR"%s" /* pre */
6141 CSI_BEGIN"1"CSI_SGR"%.*s"
6142 CSI_BEGIN"1;4"CSI_SGR"%.*s"
6143 CSI_BEGIN";1"CSI_SGR"%.*s"
6144 CSI_BEGIN""CSI_SGR"%s" /* post */
6145 "\n",
6146 pre,
6147 (int)(pb - ptr), ptr,
6148 (int)(pt - pb), pb,
6149 (int)(ptr_end - pt), pt,
6150 post);
6151 }
6152 else {
6153 char *p2;
6154
6155 len = ptr_end - ptr;
6156 lim = pt < pend ? pt : pend;
6157 i = (int)(lim - ptr);
6158 buf = ALLOCA_N(char, i+2);
6159 code = ptr;
6160 caret = p2 = buf;
6161 if (ptr <= pb) {
6162 while (ptr < pb) {
6163 *p2++ = *ptr++ == '\t' ? '\t' : ' ';
6164 }
6165 *p2++ = '^';
6166 ptr++;
6167 }
6168 if (lim > ptr) {
6169 memset(p2, '~', (lim - ptr));
6170 p2 += (lim - ptr);
6171 }
6172 *p2 = '\0';
6173 rb_str_catf(mesg, "%s%.*s%s\n""%s%s\n",
6174 pre, (int)len, code, post,
6175 pre, caret);
6176 }
6177 if (!errbuf) rb_write_error_str(mesg);
6178 }
6179 #else
6180 static int
6181 parser_yyerror(struct parser_params *p, const YYLTYPE *yylloc, const char *msg)
6182 {
6183 const char *pcur = 0, *ptok = 0;
6184 if (p->ruby_sourceline == yylloc->beg_pos.lineno &&
6185 p->ruby_sourceline == yylloc->end_pos.lineno) {
6186 pcur = p->lex.pcur;
6187 ptok = p->lex.ptok;
6188 p->lex.ptok = p->lex.pbeg + yylloc->beg_pos.column;
6189 p->lex.pcur = p->lex.pbeg + yylloc->end_pos.column;
6190 }
6191 parser_yyerror0(p, msg);
6192 if (pcur) {
6193 p->lex.ptok = ptok;
6194 p->lex.pcur = pcur;
6195 }
6196 return 0;
6197 }
6198
6199 static int
6200 parser_yyerror0(struct parser_params *p, const char *msg)
6201 {
6202 dispatch1(parse_error, STR_NEW2(msg));
6203 ripper_error(p);
6204 return 0;
6205 }
6206
6207 static inline void
6208 parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc)
6209 {
6210 }
6211 #endif /* !RIPPER */
6212
6213 #ifndef RIPPER
6214 static int
6215 vtable_size(const struct vtable *tbl)
6216 {
6217 if (!DVARS_TERMINAL_P(tbl)) {
6218 return tbl->pos;
6219 }
6220 else {
6221 return 0;
6222 }
6223 }
6224 #endif
6225
6226 static struct vtable *
6227 vtable_alloc_gen(struct parser_params *p, int line, struct vtable *prev)
6228 {
6229 struct vtable *tbl = ALLOC(struct vtable);
6230 tbl->pos = 0;
6231 tbl->capa = 8;
6232 tbl->tbl = ALLOC_N(ID, tbl->capa);
6233 tbl->prev = prev;
6234 #ifndef RIPPER
6235 if (p->debug) {
6236 rb_parser_printf(p, "vtable_alloc:%d: %p\n", line, (void *)tbl);
6237 }
6238 #endif
6239 return tbl;
6240 }
6241 #define vtable_alloc(prev) vtable_alloc_gen(p, __LINE__, prev)
6242
6243 static void
6244 vtable_free_gen(struct parser_params *p, int line, const char *name,
6245 struct vtable *tbl)
6246 {
6247 #ifndef RIPPER
6248 if (p->debug) {
6249 rb_parser_printf(p, "vtable_free:%d: %s(%p)\n", line, name, (void *)tbl);
6250 }
6251 #endif
6252 if (!DVARS_TERMINAL_P(tbl)) {
6253 if (tbl->tbl) {
6254 ruby_sized_xfree(tbl->tbl, tbl->capa * sizeof(ID));
6255 }
6256 ruby_sized_xfree(tbl, sizeof(*tbl));
6257 }
6258 }
6259 #define vtable_free(tbl) vtable_free_gen(p, __LINE__, #tbl, tbl)
6260
6261 static void
6262 vtable_add_gen(struct parser_params *p, int line, const char *name,
6263 struct vtable *tbl, ID id)
6264 {
6265 #ifndef RIPPER
6266 if (p->debug) {
6267 rb_parser_printf(p, "vtable_add:%d: %s(%p), %s\n",
6268 line, name, (void *)tbl, rb_id2name(id));
6269 }
6270 #endif
6271 if (DVARS_TERMINAL_P(tbl)) {
6272 rb_parser_fatal(p, "vtable_add: vtable is not allocated (%p)", (void *)tbl);
6273 return;
6274 }
6275 if (tbl->pos == tbl->capa) {
6276 tbl->capa = tbl->capa * 2;
6277 SIZED_REALLOC_N(tbl->tbl, ID, tbl->capa, tbl->pos);
6278 }
6279 tbl->tbl[tbl->pos++] = id;
6280 }
6281 #define vtable_add(tbl, id) vtable_add_gen(p, __LINE__, #tbl, tbl, id)
6282
6283 #ifndef RIPPER
6284 static void
6285 vtable_pop_gen(struct parser_params *p, int line, const char *name,
6286 struct vtable *tbl, int n)
6287 {
6288 if (p->debug) {
6289 rb_parser_printf(p, "vtable_pop:%d: %s(%p), %d\n",
6290 line, name, (void *)tbl, n);
6291 }
6292 if (tbl->pos < n) {
6293 rb_parser_fatal(p, "vtable_pop: unreachable (%d < %d)", tbl->pos, n);
6294 return;
6295 }
6296 tbl->pos -= n;
6297 }
6298 #define vtable_pop(tbl, n) vtable_pop_gen(p, __LINE__, #tbl, tbl, n)
6299 #endif
6300
6301 static int
6302 vtable_included(const struct vtable * tbl, ID id)
6303 {
6304 int i;
6305
6306 if (!DVARS_TERMINAL_P(tbl)) {
6307 for (i = 0; i < tbl->pos; i++) {
6308 if (tbl->tbl[i] == id) {
6309 return i+1;
6310 }
6311 }
6312 }
6313 return 0;
6314 }
6315
6316 static void parser_prepare(struct parser_params *p);
6317
6318 #ifndef RIPPER
6319 static NODE *parser_append_options(struct parser_params *p, NODE *node);
6320
6321 static VALUE
6322 debug_lines(VALUE fname)
6323 {
6324 ID script_lines;
6325 CONST_ID(script_lines, "SCRIPT_LINES__");
6326 if (rb_const_defined_at(rb_cObject, script_lines)) {
6327 VALUE hash = rb_const_get_at(rb_cObject, script_lines);
6328 if (RB_TYPE_P(hash, T_HASH)) {
6329 VALUE lines = rb_ary_new();
6330 rb_hash_aset(hash, fname, lines);
6331 return lines;
6332 }
6333 }
6334 return 0;
6335 }
6336
6337 static int
6338 e_option_supplied(struct parser_params *p)
6339 {
6340 return strcmp(p->ruby_sourcefile, "-e") == 0;
6341 }
6342
6343 static VALUE
6344 yycompile0(VALUE arg)
6345 {
6346 int n;
6347 NODE *tree;
6348 struct parser_params *p = (struct parser_params *)arg;
6349 VALUE cov = Qfalse;
6350
6351 if (!compile_for_eval && !NIL_P(p->ruby_sourcefile_string)) {
6352 p->debug_lines = debug_lines(p->ruby_sourcefile_string);
6353 if (p->debug_lines && p->ruby_sourceline > 0) {
6354 VALUE str = rb_default_rs;
6355 n = p->ruby_sourceline;
6356 do {
6357 rb_ary_push(p->debug_lines, str);
6358 } while (--n);
6359 }
6360
6361 if (!e_option_supplied(p)) {
6362 cov = Qtrue;
6363 }
6364 }
6365
6366 if (p->keep_script_lines || ruby_vm_keep_script_lines) {
6367 if (!p->debug_lines) {
6368 p->debug_lines = rb_ary_new();
6369 }
6370
6371 RB_OBJ_WRITE(p->ast, &p->ast->body.script_lines, p->debug_lines);
6372 }
6373
6374 parser_prepare(p);
6375 #define RUBY_DTRACE_PARSE_HOOK(name) \
6376 if (RUBY_DTRACE_PARSE_##name##_ENABLED()) { \
6377 RUBY_DTRACE_PARSE_##name(p->ruby_sourcefile, p->ruby_sourceline); \
6378 }
6379 RUBY_DTRACE_PARSE_HOOK(BEGIN);
6380 n = yyparse(p);
6381 RUBY_DTRACE_PARSE_HOOK(END);
6382 p->debug_lines = 0;
6383
6384 p->lex.strterm = 0;
6385 p->lex.pcur = p->lex.pbeg = p->lex.pend = 0;
6386 p->lex.prevline = p->lex.lastline = p->lex.nextline = 0;
6387 if (n || p->error_p) {
6388 VALUE mesg = p->error_buffer;
6389 if (!mesg) {
6390 mesg = rb_class_new_instance(0, 0, rb_eSyntaxError);
6391 }
6392 rb_set_errinfo(mesg);
6393 return FALSE;
6394 }
6395 tree = p->eval_tree;
6396 if (!tree) {
6397 tree = NEW_NIL(&NULL_LOC);
6398 }
6399 else {
6400 VALUE opt = p->compile_option;
6401 NODE *prelude;
6402 NODE *body = parser_append_options(p, tree->nd_body);
6403 if (!opt) opt = rb_obj_hide(rb_ident_hash_new());
6404 rb_hash_aset(opt, rb_sym_intern_ascii_cstr("coverage_enabled"), cov);
6405 prelude = block_append(p, p->eval_tree_begin, body);
6406 tree->nd_body = prelude;
6407 RB_OBJ_WRITE(p->ast, &p->ast->body.compile_option, opt);
6408 }
6409 p->ast->body.root = tree;
6410 if (!p->ast->body.script_lines) p->ast->body.script_lines = INT2FIX(p->line_count);
6411 return TRUE;
6412 }
6413
6414 static rb_ast_t *
6415 yycompile(VALUE vparser, struct parser_params *p, VALUE fname, int line)
6416 {
6417 rb_ast_t *ast;
6418 if (NIL_P(fname)) {
6419 p->ruby_sourcefile_string = Qnil;
6420 p->ruby_sourcefile = "(none)";
6421 }
6422 else {
6423 p->ruby_sourcefile_string = rb_fstring(fname);
6424 p->ruby_sourcefile = StringValueCStr(fname);
6425 }
6426 p->ruby_sourceline = line - 1;
6427
6428 p->lvtbl = NULL;
6429
6430 p->ast = ast = rb_ast_new();
6431 rb_suppress_tracing(yycompile0, (VALUE)p);
6432 p->ast = 0;
6433 RB_GC_GUARD(vparser); /* prohibit tail call optimization */
6434
6435 while (p->lvtbl) {
6436 local_pop(p);
6437 }
6438
6439 return ast;
6440 }
6441 #endif /* !RIPPER */
6442
6443 static rb_encoding *
6444 must_be_ascii_compatible(VALUE s)
6445 {
6446 rb_encoding *enc = rb_enc_get(s);
6447 if (!rb_enc_asciicompat(enc)) {
6448 rb_raise(rb_eArgError, "invalid source encoding");
6449 }
6450 return enc;
6451 }
6452
6453 static VALUE
6454 lex_get_str(struct parser_params *p, VALUE s)
6455 {
6456 char *beg, *end, *start;
6457 long len;
6458
6459 beg = RSTRING_PTR(s);
6460 len = RSTRING_LEN(s);
6461 start = beg;
6462 if (p->lex.gets_.ptr) {
6463 if (len == p->lex.gets_.ptr) return Qnil;
6464 beg += p->lex.gets_.ptr;
6465 len -= p->lex.gets_.ptr;
6466 }
6467 end = memchr(beg, '\n', len);
6468 if (end) len = ++end - beg;
6469 p->lex.gets_.ptr += len;
6470 return rb_str_subseq(s, beg - start, len);
6471 }
6472
6473 static VALUE
6474 lex_getline(struct parser_params *p)
6475 {
6476 VALUE line = (*p->lex.gets)(p, p->lex.input);
6477 if (NIL_P(line)) return line;
6478 must_be_ascii_compatible(line);
6479 if (RB_OBJ_FROZEN(line)) line = rb_str_dup(line); // needed for RubyVM::AST.of because script_lines in iseq is deep-frozen
6480 #ifndef RIPPER
6481 if (p->debug_lines) {
6482 rb_enc_associate(line, p->enc);
6483 rb_ary_push(p->debug_lines, line);
6484 }
6485 #endif
6486 p->line_count++;
6487 return line;
6488 }
6489
6490 static const rb_data_type_t parser_data_type;
6491
6492 #ifndef RIPPER
6493 static rb_ast_t*
6494 parser_compile_string(VALUE vparser, VALUE fname, VALUE s, int line)
6495 {
6496 struct parser_params *p;
6497
6498 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
6499
6500 p->lex.gets = lex_get_str;
6501 p->lex.gets_.ptr = 0;
6502 p->lex.input = rb_str_new_frozen(s);
6503 p->lex.pbeg = p->lex.pcur = p->lex.pend = 0;
6504
6505 return yycompile(vparser, p, fname, line);
6506 }
6507
6508 rb_ast_t*
6509 rb_parser_compile_string(VALUE vparser, const char *f, VALUE s, int line)
6510 {
6511 return rb_parser_compile_string_path(vparser, rb_filesystem_str_new_cstr(f), s, line);
6512 }
6513
6514 rb_ast_t*
6515 rb_parser_compile_string_path(VALUE vparser, VALUE f, VALUE s, int line)
6516 {
6517 must_be_ascii_compatible(s);
6518 return parser_compile_string(vparser, f, s, line);
6519 }
6520
6521 VALUE rb_io_gets_internal(VALUE io);
6522
6523 static VALUE
6524 lex_io_gets(struct parser_params *p, VALUE io)
6525 {
6526 return rb_io_gets_internal(io);
6527 }
6528
6529 rb_ast_t*
6530 rb_parser_compile_file_path(VALUE vparser, VALUE fname, VALUE file, int start)
6531 {
6532 struct parser_params *p;
6533
6534 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
6535
6536 p->lex.gets = lex_io_gets;
6537 p->lex.input = file;
6538 p->lex.pbeg = p->lex.pcur = p->lex.pend = 0;
6539
6540 return yycompile(vparser, p, fname, start);
6541 }
6542
6543 static VALUE
6544 lex_generic_gets(struct parser_params *p, VALUE input)
6545 {
6546 return (*p->lex.gets_.call)(input, p->line_count);
6547 }
6548
6549 rb_ast_t*
6550 rb_parser_compile_generic(VALUE vparser, VALUE (*lex_gets)(VALUE, int), VALUE fname, VALUE input, int start)
6551 {
6552 struct parser_params *p;
6553
6554 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
6555
6556 p->lex.gets = lex_generic_gets;
6557 p->lex.gets_.call = lex_gets;
6558 p->lex.input = input;
6559 p->lex.pbeg = p->lex.pcur = p->lex.pend = 0;
6560
6561 return yycompile(vparser, p, fname, start);
6562 }
6563 #endif /* !RIPPER */
6564
6565 #define STR_FUNC_ESCAPE 0x01
6566 #define STR_FUNC_EXPAND 0x02
6567 #define STR_FUNC_REGEXP 0x04
6568 #define STR_FUNC_QWORDS 0x08
6569 #define STR_FUNC_SYMBOL 0x10
6570 #define STR_FUNC_INDENT 0x20
6571 #define STR_FUNC_LABEL 0x40
6572 #define STR_FUNC_LIST 0x4000
6573 #define STR_FUNC_TERM 0x8000
6574
6575 enum string_type {
6576 str_label = STR_FUNC_LABEL,
6577 str_squote = (0),
6578 str_dquote = (STR_FUNC_EXPAND),
6579 str_xquote = (STR_FUNC_EXPAND),
6580 str_regexp = (STR_FUNC_REGEXP|STR_FUNC_ESCAPE|STR_FUNC_EXPAND),
6581 str_sword = (STR_FUNC_QWORDS|STR_FUNC_LIST),
6582 str_dword = (STR_FUNC_QWORDS|STR_FUNC_EXPAND|STR_FUNC_LIST),
6583 str_ssym = (STR_FUNC_SYMBOL),
6584 str_dsym = (STR_FUNC_SYMBOL|STR_FUNC_EXPAND)
6585 };
6586
6587 static VALUE
6588 parser_str_new(const char *ptr, long len, rb_encoding *enc, int func, rb_encoding *enc0)
6589 {
6590 VALUE str;
6591
6592 str = rb_enc_str_new(ptr, len, enc);
6593 if (!(func & STR_FUNC_REGEXP) && rb_enc_asciicompat(enc)) {
6594 if (rb_enc_str_coderange(str) == ENC_CODERANGE_7BIT) {
6595 }
6596 else if (enc0 == rb_usascii_encoding() && enc != rb_utf8_encoding()) {
6597 rb_enc_associate(str, rb_ascii8bit_encoding());
6598 }
6599 }
6600
6601 return str;
6602 }
6603
6604 #define lex_goto_eol(p) ((p)->lex.pcur = (p)->lex.pend)
6605 #define lex_eol_p(p) ((p)->lex.pcur >= (p)->lex.pend)
6606 #define lex_eol_n_p(p,n) ((p)->lex.pcur+(n) >= (p)->lex.pend)
6607 #define peek(p,c) peek_n(p, (c), 0)
6608 #define peek_n(p,c,n) (!lex_eol_n_p(p, n) && (c) == (unsigned char)(p)->lex.pcur[n])
6609 #define peekc(p) peekc_n(p, 0)
6610 #define peekc_n(p,n) (lex_eol_n_p(p, n) ? -1 : (unsigned char)(p)->lex.pcur[n])
6611
6612 #ifdef RIPPER
6613 static void
6614 add_delayed_token(struct parser_params *p, const char *tok, const char *end)
6615 {
6616 if (tok < end) {
6617 if (!has_delayed_token(p)) {
6618 p->delayed.token = rb_str_buf_new(end - tok);
6619 rb_enc_associate(p->delayed.token, p->enc);
6620 p->delayed.line = p->ruby_sourceline;
6621 p->delayed.col = rb_long2int(tok - p->lex.pbeg);
6622 }
6623 rb_str_buf_cat(p->delayed.token, tok, end - tok);
6624 p->lex.ptok = end;
6625 }
6626 }
6627 #else
6628 #define add_delayed_token(p, tok, end) ((void)(tok), (void)(end))
6629 #endif
6630
6631 static int
6632 nextline(struct parser_params *p)
6633 {
6634 VALUE v = p->lex.nextline;
6635 p->lex.nextline = 0;
6636 if (!v) {
6637 if (p->eofp)
6638 return -1;
6639
6640 if (p->lex.pend > p->lex.pbeg && *(p->lex.pend-1) != '\n') {
6641 goto end_of_input;
6642 }
6643
6644 if (!p->lex.input || NIL_P(v = lex_getline(p))) {
6645 end_of_input:
6646 p->eofp = 1;
6647 lex_goto_eol(p);
6648 return -1;
6649 }
6650 p->cr_seen = FALSE;
6651 }
6652 else if (NIL_P(v)) {
6653 /* after here-document without terminator */
6654 goto end_of_input;
6655 }
6656 add_delayed_token(p, p->lex.ptok, p->lex.pend);
6657 if (p->heredoc_end > 0) {
6658 p->ruby_sourceline = p->heredoc_end;
6659 p->heredoc_end = 0;
6660 }
6661 p->ruby_sourceline++;
6662 p->lex.pbeg = p->lex.pcur = RSTRING_PTR(v);
6663 p->lex.pend = p->lex.pcur + RSTRING_LEN(v);
6664 token_flush(p);
6665 p->lex.prevline = p->lex.lastline;
6666 p->lex.lastline = v;
6667 return 0;
6668 }
6669
6670 static int
6671 parser_cr(struct parser_params *p, int c)
6672 {
6673 if (peek(p, '\n')) {
6674 p->lex.pcur++;
6675 c = '\n';
6676 }
6677 return c;
6678 }
6679
6680 static inline int
6681 nextc(struct parser_params *p)
6682 {
6683 int c;
6684
6685 if (UNLIKELY((p->lex.pcur == p->lex.pend) || p->eofp || RTEST(p->lex.nextline))) {
6686 if (nextline(p)) return -1;
6687 }
6688 c = (unsigned char)*p->lex.pcur++;
6689 if (UNLIKELY(c == '\r')) {
6690 c = parser_cr(p, c);
6691 }
6692
6693 return c;
6694 }
6695
6696 static void
6697 pushback(struct parser_params *p, int c)
6698 {
6699 if (c == -1) return;
6700 p->lex.pcur--;
6701 if (p->lex.pcur > p->lex.pbeg && p->lex.pcur[0] == '\n' && p->lex.pcur[-1] == '\r') {
6702 p->lex.pcur--;
6703 }
6704 }
6705
6706 #define was_bol(p) ((p)->lex.pcur == (p)->lex.pbeg + 1)
6707
6708 #define tokfix(p) ((p)->tokenbuf[(p)->tokidx]='\0')
6709 #define tok(p) (p)->tokenbuf
6710 #define toklen(p) (p)->tokidx
6711
6712 static int
6713 looking_at_eol_p(struct parser_params *p)
6714 {
6715 const char *ptr = p->lex.pcur;
6716 while (ptr < p->lex.pend) {
6717 int c = (unsigned char)*ptr++;
6718 int eol = (c == '\n' || c == '#');
6719 if (eol || !ISSPACE(c)) {
6720 return eol;
6721 }
6722 }
6723 return TRUE;
6724 }
6725
6726 static char*
6727 newtok(struct parser_params *p)
6728 {
6729 p->tokidx = 0;
6730 p->tokline = p->ruby_sourceline;
6731 if (!p->tokenbuf) {
6732 p->toksiz = 60;
6733 p->tokenbuf = ALLOC_N(char, 60);
6734 }
6735 if (p->toksiz > 4096) {
6736 p->toksiz = 60;
6737 REALLOC_N(p->tokenbuf, char, 60);
6738 }
6739 return p->tokenbuf;
6740 }
6741
6742 static char *
6743 tokspace(struct parser_params *p, int n)
6744 {
6745 p->tokidx += n;
6746
6747 if (p->tokidx >= p->toksiz) {
6748 do {p->toksiz *= 2;} while (p->toksiz < p->tokidx);
6749 REALLOC_N(p->tokenbuf, char, p->toksiz);
6750 }
6751 return &p->tokenbuf[p->tokidx-n];
6752 }
6753
6754 static void
6755 tokadd(struct parser_params *p, int c)
6756 {
6757 p->tokenbuf[p->tokidx++] = (char)c;
6758 if (p->tokidx >= p->toksiz) {
6759 p->toksiz *= 2;
6760 REALLOC_N(p->tokenbuf, char, p->toksiz);
6761 }
6762 }
6763
6764 static int
6765 tok_hex(struct parser_params *p, size_t *numlen)
6766 {
6767 int c;
6768
6769 c = scan_hex(p->lex.pcur, 2, numlen);
6770 if (!*numlen) {
6771 yyerror0("invalid hex escape");
6772 token_flush(p);
6773 return 0;
6774 }
6775 p->lex.pcur += *numlen;
6776 return c;
6777 }
6778
6779 #define tokcopy(p, n) memcpy(tokspace(p, n), (p)->lex.pcur - (n), (n))
6780
6781 static int
6782 escaped_control_code(int c)
6783 {
6784 int c2 = 0;
6785 switch (c) {
6786 case ' ':
6787 c2 = 's';
6788 break;
6789 case '\n':
6790 c2 = 'n';
6791 break;
6792 case '\t':
6793 c2 = 't';
6794 break;
6795 case '\v':
6796 c2 = 'v';
6797 break;
6798 case '\r':
6799 c2 = 'r';
6800 break;
6801 case '\f':
6802 c2 = 'f';
6803 break;
6804 }
6805 return c2;
6806 }
6807
6808 #define WARN_SPACE_CHAR(c, prefix) \
6809 rb_warn1("invalid character syntax; use "prefix"\\%c", WARN_I(c2))
6810
6811 static int
6812 tokadd_codepoint(struct parser_params *p, rb_encoding **encp,
6813 int regexp_literal, int wide)
6814 {
6815 size_t numlen;
6816 int codepoint = scan_hex(p->lex.pcur, wide ? p->lex.pend - p->lex.pcur : 4, &numlen);
6817 literal_flush(p, p->lex.pcur);
6818 p->lex.pcur += numlen;
6819 if (wide ? (numlen == 0 || numlen > 6) : (numlen < 4)) {
6820 yyerror0("invalid Unicode escape");
6821 return wide && numlen > 0;
6822 }
6823 if (codepoint > 0x10ffff) {
6824 yyerror0("invalid Unicode codepoint (too large)");
6825 return wide;
6826 }
6827 if ((codepoint & 0xfffff800) == 0xd800) {
6828 yyerror0("invalid Unicode codepoint");
6829 return wide;
6830 }
6831 if (regexp_literal) {
6832 tokcopy(p, (int)numlen);
6833 }
6834 else if (codepoint >= 0x80) {
6835 rb_encoding *utf8 = rb_utf8_encoding();
6836 if (*encp && utf8 != *encp) {
6837 YYLTYPE loc = RUBY_INIT_YYLLOC();
6838 compile_error(p, "UTF-8 mixed within %s source", rb_enc_name(*encp));
6839 parser_show_error_line(p, &loc);
6840 return wide;
6841 }
6842 *encp = utf8;
6843 tokaddmbc(p, codepoint, *encp);
6844 }
6845 else {
6846 tokadd(p, codepoint);
6847 }
6848 return TRUE;
6849 }
6850
6851 /* return value is for ?\u3042 */
6852 static void
6853 tokadd_utf8(struct parser_params *p, rb_encoding **encp,
6854 int term, int symbol_literal, int regexp_literal)
6855 {
6856 /*
6857 * If `term` is not -1, then we allow multiple codepoints in \u{}
6858 * upto `term` byte, otherwise we're parsing a character literal.
6859 * And then add the codepoints to the current token.
6860 */
6861 static const char multiple_codepoints[] = "Multiple codepoints at single character literal";
6862
6863 const int open_brace = '{', close_brace = '}';
6864
6865 if (regexp_literal) { tokadd(p, '\\'); tokadd(p, 'u'); }
6866
6867 if (peek(p, open_brace)) { /* handle \u{...} form */
6868 const char *second = NULL;
6869 int c, last = nextc(p);
6870 if (p->lex.pcur >= p->lex.pend) goto unterminated;
6871 while (ISSPACE(c = *p->lex.pcur) && ++p->lex.pcur < p->lex.pend);
6872 while (c != close_brace) {
6873 if (c == term) goto unterminated;
6874 if (second == multiple_codepoints)
6875 second = p->lex.pcur;
6876 if (regexp_literal) tokadd(p, last);
6877 if (!tokadd_codepoint(p, encp, regexp_literal, TRUE)) {
6878 break;
6879 }
6880 while (ISSPACE(c = *p->lex.pcur)) {
6881 if (++p->lex.pcur >= p->lex.pend) goto unterminated;
6882 last = c;
6883 }
6884 if (term == -1 && !second)
6885 second = multiple_codepoints;
6886 }
6887
6888 if (c != close_brace) {
6889 unterminated:
6890 token_flush(p);
6891 yyerror0("unterminated Unicode escape");
6892 return;
6893 }
6894 if (second && second != multiple_codepoints) {
6895 const char *pcur = p->lex.pcur;
6896 p->lex.pcur = second;
6897 dispatch_scan_event(p, tSTRING_CONTENT);
6898 token_flush(p);
6899 p->lex.pcur = pcur;
6900 yyerror0(multiple_codepoints);
6901 token_flush(p);
6902 }
6903
6904 if (regexp_literal) tokadd(p, close_brace);
6905 nextc(p);
6906 }
6907 else { /* handle \uxxxx form */
6908 if (!tokadd_codepoint(p, encp, regexp_literal, FALSE)) {
6909 token_flush(p);
6910 return;
6911 }
6912 }
6913 }
6914
6915 #define ESCAPE_CONTROL 1
6916 #define ESCAPE_META 2
6917
6918 static int
6919 read_escape(struct parser_params *p, int flags, rb_encoding **encp)
6920 {
6921 int c;
6922 size_t numlen;
6923
6924 switch (c = nextc(p)) {
6925 case '\\': /* Backslash */
6926 return c;
6927
6928 case 'n': /* newline */
6929 return '\n';
6930
6931 case 't': /* horizontal tab */
6932 return '\t';
6933
6934 case 'r': /* carriage-return */
6935 return '\r';
6936
6937 case 'f': /* form-feed */
6938 return '\f';
6939
6940 case 'v': /* vertical tab */
6941 return '\13';
6942
6943 case 'a': /* alarm(bell) */
6944 return '\007';
6945
6946 case 'e': /* escape */
6947 return 033;
6948
6949 case '0': case '1': case '2': case '3': /* octal constant */
6950 case '4': case '5': case '6': case '7':
6951 pushback(p, c);
6952 c = scan_oct(p->lex.pcur, 3, &numlen);
6953 p->lex.pcur += numlen;
6954 return c;
6955
6956 case 'x': /* hex constant */
6957 c = tok_hex(p, &numlen);
6958 if (numlen == 0) return 0;
6959 return c;
6960
6961 case 'b': /* backspace */
6962 return '\010';
6963
6964 case 's': /* space */
6965 return ' ';
6966
6967 case 'M':
6968 if (flags & ESCAPE_META) goto eof;
6969 if ((c = nextc(p)) != '-') {
6970 goto eof;
6971 }
6972 if ((c = nextc(p)) == '\\') {
6973 switch (peekc(p)) {
6974 case 'u': case 'U':
6975 nextc(p);
6976 goto eof;
6977 }
6978 return read_escape(p, flags|ESCAPE_META, encp) | 0x80;
6979 }
6980 else if (c == -1 || !ISASCII(c)) goto eof;
6981 else {
6982 int c2 = escaped_control_code(c);
6983 if (c2) {
6984 if (ISCNTRL(c) || !(flags & ESCAPE_CONTROL)) {
6985 WARN_SPACE_CHAR(c2, "\\M-");
6986 }
6987 else {
6988 WARN_SPACE_CHAR(c2, "\\C-\\M-");
6989 }
6990 }
6991 else if (ISCNTRL(c)) goto eof;
6992 return ((c & 0xff) | 0x80);
6993 }
6994
6995 case 'C':
6996 if ((c = nextc(p)) != '-') {
6997 goto eof;
6998 }
6999 case 'c':
7000 if (flags & ESCAPE_CONTROL) goto eof;
7001 if ((c = nextc(p))== '\\') {
7002 switch (peekc(p)) {
7003 case 'u': case 'U':
7004 nextc(p);
7005 goto eof;
7006 }
7007 c = read_escape(p, flags|ESCAPE_CONTROL, encp);
7008 }
7009 else if (c == '?')
7010 return 0177;
7011 else if (c == -1 || !ISASCII(c)) goto eof;
7012 else {
7013 int c2 = escaped_control_code(c);
7014 if (c2) {
7015 if (ISCNTRL(c)) {
7016 if (flags & ESCAPE_META) {
7017 WARN_SPACE_CHAR(c2, "\\M-");
7018 }
7019 else {
7020 WARN_SPACE_CHAR(c2, "");
7021 }
7022 }
7023 else {
7024 if (flags & ESCAPE_META) {
7025 WARN_SPACE_CHAR(c2, "\\M-\\C-");
7026 }
7027 else {
7028 WARN_SPACE_CHAR(c2, "\\C-");
7029 }
7030 }
7031 }
7032 else if (ISCNTRL(c)) goto eof;
7033 }
7034 return c & 0x9f;
7035
7036 eof:
7037 case -1:
7038 yyerror0("Invalid escape character syntax");
7039 token_flush(p);
7040 return '\0';
7041
7042 default:
7043 return c;
7044 }
7045 }
7046
7047 static void
7048 tokaddmbc(struct parser_params *p, int c, rb_encoding *enc)
7049 {
7050 int len = rb_enc_codelen(c, enc);
7051 rb_enc_mbcput(c, tokspace(p, len), enc);
7052 }
7053
7054 static int
7055 tokadd_escape(struct parser_params *p, rb_encoding **encp)
7056 {
7057 int c;
7058 size_t numlen;
7059
7060 switch (c = nextc(p)) {
7061 case '\n':
7062 return 0; /* just ignore */
7063
7064 case '0': case '1': case '2': case '3': /* octal constant */
7065 case '4': case '5': case '6': case '7':
7066 {
7067 ruby_scan_oct(--p->lex.pcur, 3, &numlen);
7068 if (numlen == 0) goto eof;
7069 p->lex.pcur += numlen;
7070 tokcopy(p, (int)numlen + 1);
7071 }
7072 return 0;
7073
7074 case 'x': /* hex constant */
7075 {
7076 tok_hex(p, &numlen);
7077 if (numlen == 0) return -1;
7078 tokcopy(p, (int)numlen + 2);
7079 }
7080 return 0;
7081
7082 eof:
7083 case -1:
7084 yyerror0("Invalid escape character syntax");
7085 token_flush(p);
7086 return -1;
7087
7088 default:
7089 tokadd(p, '\\');
7090 tokadd(p, c);
7091 }
7092 return 0;
7093 }
7094
7095 static int
7096 regx_options(struct parser_params *p)
7097 {
7098 int kcode = 0;
7099 int kopt = 0;
7100 int options = 0;
7101 int c, opt, kc;
7102
7103 newtok(p);
7104 while (c = nextc(p), ISALPHA(c)) {
7105 if (c == 'o') {
7106 options |= RE_OPTION_ONCE;
7107 }
7108 else if (rb_char_to_option_kcode(c, &opt, &kc)) {
7109 if (kc >= 0) {
7110 if (kc != rb_ascii8bit_encindex()) kcode = c;
7111 kopt = opt;
7112 }
7113 else {
7114 options |= opt;
7115 }
7116 }
7117 else {
7118 tokadd(p, c);
7119 }
7120 }
7121 options |= kopt;
7122 pushback(p, c);
7123 if (toklen(p)) {
7124 YYLTYPE loc = RUBY_INIT_YYLLOC();
7125 tokfix(p);
7126 compile_error(p, "unknown regexp option%s - %*s",
7127 toklen(p) > 1 ? "s" : "", toklen(p), tok(p));
7128 parser_show_error_line(p, &loc);
7129 }
7130 return options | RE_OPTION_ENCODING(kcode);
7131 }
7132
7133 static int
7134 tokadd_mbchar(struct parser_params *p, int c)
7135 {
7136 int len = parser_precise_mbclen(p, p->lex.pcur-1);
7137 if (len < 0) return -1;
7138 tokadd(p, c);
7139 p->lex.pcur += --len;
7140 if (len > 0) tokcopy(p, len);
7141 return c;
7142 }
7143
7144 static inline int
7145 simple_re_meta(int c)
7146 {
7147 switch (c) {
7148 case '$': case '*': case '+': case '.':
7149 case '?': case '^': case '|':
7150 case ')': case ']': case '}': case '>':
7151 return TRUE;
7152 default:
7153 return FALSE;
7154 }
7155 }
7156
7157 static int
7158 parser_update_heredoc_indent(struct parser_params *p, int c)
7159 {
7160 if (p->heredoc_line_indent == -1) {
7161 if (c == '\n') p->heredoc_line_indent = 0;
7162 }
7163 else {
7164 if (c == ' ') {
7165 p->heredoc_line_indent++;
7166 return TRUE;
7167 }
7168 else if (c == '\t') {
7169 int w = (p->heredoc_line_indent / TAB_WIDTH) + 1;
7170 p->heredoc_line_indent = w * TAB_WIDTH;
7171 return TRUE;
7172 }
7173 else if (c != '\n') {
7174 if (p->heredoc_indent > p->heredoc_line_indent) {
7175 p->heredoc_indent = p->heredoc_line_indent;
7176 }
7177 p->heredoc_line_indent = -1;
7178 }
7179 }
7180 return FALSE;
7181 }
7182
7183 static void
7184 parser_mixed_error(struct parser_params *p, rb_encoding *enc1, rb_encoding *enc2)
7185 {
7186 YYLTYPE loc = RUBY_INIT_YYLLOC();
7187 const char *n1 = rb_enc_name(enc1), *n2 = rb_enc_name(enc2);
7188 compile_error(p, "%s mixed within %s source", n1, n2);
7189 parser_show_error_line(p, &loc);
7190 }
7191
7192 static void
7193 parser_mixed_escape(struct parser_params *p, const char *beg, rb_encoding *enc1, rb_encoding *enc2)
7194 {
7195 const char *pos = p->lex.pcur;
7196 p->lex.pcur = beg;
7197 parser_mixed_error(p, enc1, enc2);
7198 p->lex.pcur = pos;
7199 }
7200
7201 static int
7202 tokadd_string(struct parser_params *p,
7203 int func, int term, int paren, long *nest,
7204 rb_encoding **encp, rb_encoding **enc)
7205 {
7206 int c;
7207 bool erred = false;
7208
7209 #define mixed_error(enc1, enc2) \
7210 (void)(erred || (parser_mixed_error(p, enc1, enc2), erred = true))
7211 #define mixed_escape(beg, enc1, enc2) \
7212 (void)(erred || (parser_mixed_escape(p, beg, enc1, enc2), erred = true))
7213
7214 while ((c = nextc(p)) != -1) {
7215 if (p->heredoc_indent > 0) {
7216 parser_update_heredoc_indent(p, c);
7217 }
7218
7219 if (paren && c == paren) {
7220 ++*nest;
7221 }
7222 else if (c == term) {
7223 if (!nest || !*nest) {
7224 pushback(p, c);
7225 break;
7226 }
7227 --*nest;
7228 }
7229 else if ((func & STR_FUNC_EXPAND) && c == '#' && p->lex.pcur < p->lex.pend) {
7230 int c2 = *p->lex.pcur;
7231 if (c2 == '$' || c2 == '@' || c2 == '{') {
7232 pushback(p, c);
7233 break;
7234 }
7235 }
7236 else if (c == '\\') {
7237 literal_flush(p, p->lex.pcur - 1);
7238 c = nextc(p);
7239 switch (c) {
7240 case '\n':
7241 if (func & STR_FUNC_QWORDS) break;
7242 if (func & STR_FUNC_EXPAND) {
7243 if (!(func & STR_FUNC_INDENT) || (p->heredoc_indent < 0))
7244 continue;
7245 if (c == term) {
7246 c = '\\';
7247 goto terminate;
7248 }
7249 }
7250 tokadd(p, '\\');
7251 break;
7252
7253 case '\\':
7254 if (func & STR_FUNC_ESCAPE) tokadd(p, c);
7255 break;
7256
7257 case 'u':
7258 if ((func & STR_FUNC_EXPAND) == 0) {
7259 tokadd(p, '\\');
7260 break;
7261 }
7262 tokadd_utf8(p, enc, term,
7263 func & STR_FUNC_SYMBOL,
7264 func & STR_FUNC_REGEXP);
7265 continue;
7266
7267 default:
7268 if (c == -1) return -1;
7269 if (!ISASCII(c)) {
7270 if ((func & STR_FUNC_EXPAND) == 0) tokadd(p, '\\');
7271 goto non_ascii;
7272 }
7273 if (func & STR_FUNC_REGEXP) {
7274 switch (c) {
7275 case 'c':
7276 case 'C':
7277 case 'M': {
7278 pushback(p, c);
7279 c = read_escape(p, 0, enc);
7280
7281 int i;
7282 char escbuf[5];
7283 snprintf(escbuf, sizeof(escbuf), "\\x%02X", c);
7284 for (i = 0; i < 4; i++) {
7285 tokadd(p, escbuf[i]);
7286 }
7287 continue;
7288 }
7289 }
7290
7291 if (c == term && !simple_re_meta(c)) {
7292 tokadd(p, c);
7293 continue;
7294 }
7295 pushback(p, c);
7296 if ((c = tokadd_escape(p, enc)) < 0)
7297 return -1;
7298 if (*enc && *enc != *encp) {
7299 mixed_escape(p->lex.ptok+2, *enc, *encp);
7300 }
7301 continue;
7302 }
7303 else if (func & STR_FUNC_EXPAND) {
7304 pushback(p, c);
7305 if (func & STR_FUNC_ESCAPE) tokadd(p, '\\');
7306 c = read_escape(p, 0, enc);
7307 }
7308 else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
7309 /* ignore backslashed spaces in %w */
7310 }
7311 else if (c != term && !(paren && c == paren)) {
7312 tokadd(p, '\\');
7313 pushback(p, c);
7314 continue;
7315 }
7316 }
7317 }
7318 else if (!parser_isascii(p)) {
7319 non_ascii:
7320 if (!*enc) {
7321 *enc = *encp;
7322 }
7323 else if (*enc != *encp) {
7324 mixed_error(*enc, *encp);
7325 continue;
7326 }
7327 if (tokadd_mbchar(p, c) == -1) return -1;
7328 continue;
7329 }
7330 else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
7331 pushback(p, c);
7332 break;
7333 }
7334 if (c & 0x80) {
7335 if (!*enc) {
7336 *enc = *encp;
7337 }
7338 else if (*enc != *encp) {
7339 mixed_error(*enc, *encp);
7340 continue;
7341 }
7342 }
7343 tokadd(p, c);
7344 }
7345 terminate:
7346 if (*enc) *encp = *enc;
7347 return c;
7348 }
7349
7350 static inline rb_strterm_t *
7351 new_strterm(VALUE v1, VALUE v2, VALUE v3, VALUE v0)
7352 {
7353 return (rb_strterm_t*)rb_imemo_new(imemo_parser_strterm, v1, v2, v3, v0);
7354 }
7355
7356 /* imemo_parser_strterm for literal */
7357 #define NEW_STRTERM(func, term, paren) \
7358 new_strterm((VALUE)(func), (VALUE)(paren), (VALUE)(term), 0)
7359
7360 #ifdef RIPPER
7361 static void
7362 flush_string_content(struct parser_params *p, rb_encoding *enc)
7363 {
7364 VALUE content = yylval.val;
7365 if (!ripper_is_node_yylval(content))
7366 content = ripper_new_yylval(p, 0, 0, content);
7367 if (has_delayed_token(p)) {
7368 ptrdiff_t len = p->lex.pcur - p->lex.ptok;
7369 if (len > 0) {
7370 rb_enc_str_buf_cat(p->delayed.token, p->lex.ptok, len, enc);
7371 }
7372 dispatch_delayed_token(p, tSTRING_CONTENT);
7373 p->lex.ptok = p->lex.pcur;
7374 RNODE(content)->nd_rval = yylval.val;
7375 }
7376 dispatch_scan_event(p, tSTRING_CONTENT);
7377 if (yylval.val != content)
7378 RNODE(content)->nd_rval = yylval.val;
7379 yylval.val = content;
7380 }
7381 #else
7382 #define flush_string_content(p, enc) ((void)(enc))
7383 #endif
7384
7385 RUBY_FUNC_EXPORTED const unsigned int ruby_global_name_punct_bits[(0x7e - 0x20 + 31) / 32];
7386 /* this can be shared with ripper, since it's independent from struct
7387 * parser_params. */
7388 #ifndef RIPPER
7389 #define BIT(c, idx) (((c) / 32 - 1 == idx) ? (1U << ((c) % 32)) : 0)
7390 #define SPECIAL_PUNCT(idx) ( \
7391 BIT('~', idx) | BIT('*', idx) | BIT('$', idx) | BIT('?', idx) | \
7392 BIT('!', idx) | BIT('@', idx) | BIT('/', idx) | BIT('\\', idx) | \
7393 BIT(';', idx) | BIT(',', idx) | BIT('.', idx) | BIT('=', idx) | \
7394 BIT(':', idx) | BIT('<', idx) | BIT('>', idx) | BIT('\"', idx) | \
7395 BIT('&', idx) | BIT('`', idx) | BIT('\'', idx) | BIT('+', idx) | \
7396 BIT('0', idx))
7397 const unsigned int ruby_global_name_punct_bits[] = {
7398 SPECIAL_PUNCT(0),
7399 SPECIAL_PUNCT(1),
7400 SPECIAL_PUNCT(2),
7401 };
7402 #undef BIT
7403 #undef SPECIAL_PUNCT
7404 #endif
7405
7406 static enum yytokentype
7407 parser_peek_variable_name(struct parser_params *p)
7408 {
7409 int c;
7410 const char *ptr = p->lex.pcur;
7411
7412 if (ptr + 1 >= p->lex.pend) return 0;
7413 c = *ptr++;
7414 switch (c) {
7415 case '$':
7416 if ((c = *ptr) == '-') {
7417 if (++ptr >= p->lex.pend) return 0;
7418 c = *ptr;
7419 }
7420 else if (is_global_name_punct(c) || ISDIGIT(c)) {
7421 return tSTRING_DVAR;
7422 }
7423 break;
7424 case '@':
7425 if ((c = *ptr) == '@') {
7426 if (++ptr >= p->lex.pend) return 0;
7427 c = *ptr;
7428 }
7429 break;
7430 case '{':
7431 p->lex.pcur = ptr;
7432 p->command_start = TRUE;
7433 return tSTRING_DBEG;
7434 default:
7435 return 0;
7436 }
7437 if (!ISASCII(c) || c == '_' || ISALPHA(c))
7438 return tSTRING_DVAR;
7439 return 0;
7440 }
7441
7442 #define IS_ARG() IS_lex_state(EXPR_ARG_ANY)
7443 #define IS_END() IS_lex_state(EXPR_END_ANY)
7444 #define IS_BEG() (IS_lex_state(EXPR_BEG_ANY) || IS_lex_state_all(EXPR_ARG|EXPR_LABELED))
7445 #define IS_SPCARG(c) (IS_ARG() && space_seen && !ISSPACE(c))
7446 #define IS_LABEL_POSSIBLE() (\
7447 (IS_lex_state(EXPR_LABEL|EXPR_ENDFN) && !cmd_state) || \
7448 IS_ARG())
7449 #define IS_LABEL_SUFFIX(n) (peek_n(p, ':',(n)) && !peek_n(p, ':', (n)+1))
7450 #define IS_AFTER_OPERATOR() IS_lex_state(EXPR_FNAME | EXPR_DOT)
7451
7452 static inline enum yytokentype
7453 parser_string_term(struct parser_params *p, int func)
7454 {
7455 p->lex.strterm = 0;
7456 if (func & STR_FUNC_REGEXP) {
7457 set_yylval_num(regx_options(p));
7458 dispatch_scan_event(p, tREGEXP_END);
7459 SET_LEX_STATE(EXPR_END);
7460 return tREGEXP_END;
7461 }
7462 if ((func & STR_FUNC_LABEL) && IS_LABEL_SUFFIX(0)) {
7463 nextc(p);
7464 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
7465 return tLABEL_END;
7466 }
7467 SET_LEX_STATE(EXPR_END);
7468 return tSTRING_END;
7469 }
7470
7471 static enum yytokentype
7472 parse_string(struct parser_params *p, rb_strterm_literal_t *quote)
7473 {
7474 int func = (int)quote->u1.func;
7475 int term = (int)quote->u3.term;
7476 int paren = (int)quote->u2.paren;
7477 int c, space = 0;
7478 rb_encoding *enc = p->enc;
7479 rb_encoding *base_enc = 0;
7480 VALUE lit;
7481
7482 if (func & STR_FUNC_TERM) {
7483 if (func & STR_FUNC_QWORDS) nextc(p); /* delayed term */
7484 SET_LEX_STATE(EXPR_END);
7485 p->lex.strterm = 0;
7486 return func & STR_FUNC_REGEXP ? tREGEXP_END : tSTRING_END;
7487 }
7488 c = nextc(p);
7489 if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
7490 do {c = nextc(p);} while (ISSPACE(c));
7491 space = 1;
7492 }
7493 if (func & STR_FUNC_LIST) {
7494 quote->u1.func &= ~STR_FUNC_LIST;
7495 space = 1;
7496 }
7497 if (c == term && !quote->u0.nest) {
7498 if (func & STR_FUNC_QWORDS) {
7499 quote->u1.func |= STR_FUNC_TERM;
7500 pushback(p, c); /* dispatch the term at tSTRING_END */
7501 add_delayed_token(p, p->lex.ptok, p->lex.pcur);
7502 return ' ';
7503 }
7504 return parser_string_term(p, func);
7505 }
7506 if (space) {
7507 pushback(p, c);
7508 add_delayed_token(p, p->lex.ptok, p->lex.pcur);
7509 return ' ';
7510 }
7511 newtok(p);
7512 if ((func & STR_FUNC_EXPAND) && c == '#') {
7513 int t = parser_peek_variable_name(p);
7514 if (t) return t;
7515 tokadd(p, '#');
7516 c = nextc(p);
7517 }
7518 pushback(p, c);
7519 if (tokadd_string(p, func, term, paren, &quote->u0.nest,
7520 &enc, &base_enc) == -1) {
7521 if (p->eofp) {
7522 #ifndef RIPPER
7523 # define unterminated_literal(mesg) yyerror0(mesg)
7524 #else
7525 # define unterminated_literal(mesg) compile_error(p, mesg)
7526 #endif
7527 literal_flush(p, p->lex.pcur);
7528 if (func & STR_FUNC_QWORDS) {
7529 /* no content to add, bailing out here */
7530 unterminated_literal("unterminated list meets end of file");
7531 p->lex.strterm = 0;
7532 return tSTRING_END;
7533 }
7534 if (func & STR_FUNC_REGEXP) {
7535 unterminated_literal("unterminated regexp meets end of file");
7536 }
7537 else {
7538 unterminated_literal("unterminated string meets end of file");
7539 }
7540 quote->u1.func |= STR_FUNC_TERM;
7541 }
7542 }
7543
7544 tokfix(p);
7545 lit = STR_NEW3(tok(p), toklen(p), enc, func);
7546 set_yylval_str(lit);
7547 flush_string_content(p, enc);
7548
7549 return tSTRING_CONTENT;
7550 }
7551
7552 static enum yytokentype
7553 heredoc_identifier(struct parser_params *p)
7554 {
7555 /*
7556 * term_len is length of `<<"END"` except `END`,
7557 * in this case term_len is 4 (<, <, " and ").
7558 */
7559 long len, offset = p->lex.pcur - p->lex.pbeg;
7560 int c = nextc(p), term, func = 0, quote = 0;
7561 enum yytokentype token = tSTRING_BEG;
7562 int indent = 0;
7563
7564 if (c == '-') {
7565 c = nextc(p);
7566 func = STR_FUNC_INDENT;
7567 offset++;
7568 }
7569 else if (c == '~') {
7570 c = nextc(p);
7571 func = STR_FUNC_INDENT;
7572 offset++;
7573 indent = INT_MAX;
7574 }
7575 switch (c) {
7576 case '\'':
7577 func |= str_squote; goto quoted;
7578 case '"':
7579 func |= str_dquote; goto quoted;
7580 case '`':
7581 token = tXSTRING_BEG;
7582 func |= str_xquote; goto quoted;
7583
7584 quoted:
7585 quote++;
7586 offset++;
7587 term = c;
7588 len = 0;
7589 while ((c = nextc(p)) != term) {
7590 if (c == -1 || c == '\r' || c == '\n') {
7591 yyerror0("unterminated here document identifier");
7592 return -1;
7593 }
7594 }
7595 break;
7596
7597 default:
7598 if (!parser_is_identchar(p)) {
7599 pushback(p, c);
7600 if (func & STR_FUNC_INDENT) {
7601 pushback(p, indent > 0 ? '~' : '-');
7602 }
7603 return 0;
7604 }
7605 func |= str_dquote;
7606 do {
7607 int n = parser_precise_mbclen(p, p->lex.pcur-1);
7608 if (n < 0) return 0;
7609 p->lex.pcur += --n;
7610 } while ((c = nextc(p)) != -1 && parser_is_identchar(p));
7611 pushback(p, c);
7612 break;
7613 }
7614
7615 len = p->lex.pcur - (p->lex.pbeg + offset) - quote;
7616 if ((unsigned long)len >= HERETERM_LENGTH_MAX)
7617 yyerror0("too long here document identifier");
7618 dispatch_scan_event(p, tHEREDOC_BEG);
7619 lex_goto_eol(p);
7620
7621 p->lex.strterm = new_strterm(0, 0, 0, p->lex.lastline);
7622 p->lex.strterm->flags |= STRTERM_HEREDOC;
7623 rb_strterm_heredoc_t *here = &p->lex.strterm->u.heredoc;
7624 here->offset = offset;
7625 here->sourceline = p->ruby_sourceline;
7626 here->length = (int)len;
7627 here->quote = quote;
7628 here->func = func;
7629
7630 token_flush(p);
7631 p->heredoc_indent = indent;
7632 p->heredoc_line_indent = 0;
7633 return token;
7634 }
7635
7636 static void
7637 heredoc_restore(struct parser_params *p, rb_strterm_heredoc_t *here)
7638 {
7639 VALUE line;
7640
7641 p->lex.strterm = 0;
7642 line = here->lastline;
7643 p->lex.lastline = line;
7644 p->lex.pbeg = RSTRING_PTR(line);
7645 p->lex.pend = p->lex.pbeg + RSTRING_LEN(line);
7646 p->lex.pcur = p->lex.pbeg + here->offset + here->length + here->quote;
7647 p->lex.ptok = p->lex.pbeg + here->offset - here->quote;
7648 p->heredoc_end = p->ruby_sourceline;
7649 p->ruby_sourceline = (int)here->sourceline;
7650 if (p->eofp) p->lex.nextline = Qnil;
7651 p->eofp = 0;
7652 }
7653
7654 static int
7655 dedent_string(VALUE string, int width)
7656 {
7657 char *str;
7658 long len;
7659 int i, col = 0;
7660
7661 RSTRING_GETMEM(string, str, len);
7662 for (i = 0; i < len && col < width; i++) {
7663 if (str[i] == ' ') {
7664 col++;
7665 }
7666 else if (str[i] == '\t') {
7667 int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
7668 if (n > width) break;
7669 col = n;
7670 }
7671 else {
7672 break;
7673 }
7674 }
7675 if (!i) return 0;
7676 rb_str_modify(string);
7677 str = RSTRING_PTR(string);
7678 if (RSTRING_LEN(string) != len)
7679 rb_fatal("literal string changed: %+"PRIsVALUE, string);
7680 MEMMOVE(str, str + i, char, len - i);
7681 rb_str_set_len(string, len - i);
7682 return i;
7683 }
7684
7685 #ifndef RIPPER
7686 static NODE *
7687 heredoc_dedent(struct parser_params *p, NODE *root)
7688 {
7689 NODE *node, *str_node, *prev_node;
7690 int indent = p->heredoc_indent;
7691 VALUE prev_lit = 0;
7692
7693 if (indent <= 0) return root;
7694 p->heredoc_indent = 0;
7695 if (!root) return root;
7696
7697 prev_node = node = str_node = root;
7698 if (nd_type_p(root, NODE_LIST)) str_node = root->nd_head;
7699
7700 while (str_node) {
7701 VALUE lit = str_node->nd_lit;
7702 if (str_node->flags & NODE_FL_NEWLINE) {
7703 dedent_string(lit, indent);
7704 }
7705 if (!prev_lit) {
7706 prev_lit = lit;
7707 }
7708 else if (!literal_concat0(p, prev_lit, lit)) {
7709 return 0;
7710 }
7711 else {
7712 NODE *end = node->nd_end;
7713 node = prev_node->nd_next = node->nd_next;
7714 if (!node) {
7715 if (nd_type_p(prev_node, NODE_DSTR))
7716 nd_set_type(prev_node, NODE_STR);
7717 break;
7718 }
7719 node->nd_end = end;
7720 goto next_str;
7721 }
7722
7723 str_node = 0;
7724 while ((node = (prev_node = node)->nd_next) != 0) {
7725 next_str:
7726 if (!nd_type_p(node, NODE_LIST)) break;
7727 if ((str_node = node->nd_head) != 0) {
7728 enum node_type type = nd_type(str_node);
7729 if (type == NODE_STR || type == NODE_DSTR) break;
7730 prev_lit = 0;
7731 str_node = 0;
7732 }
7733 }
7734 }
7735 return root;
7736 }
7737 #else /* RIPPER */
7738 static VALUE
7739 heredoc_dedent(struct parser_params *p, VALUE array)
7740 {
7741 int indent = p->heredoc_indent;
7742
7743 if (indent <= 0) return array;
7744 p->heredoc_indent = 0;
7745 dispatch2(heredoc_dedent, array, INT2NUM(indent));
7746 return array;
7747 }
7748
7749 /*
7750 * call-seq:
7751 * Ripper.dedent_string(input, width) -> Integer
7752 *
7753 * USE OF RIPPER LIBRARY ONLY.
7754 *
7755 * Strips up to +width+ leading whitespaces from +input+,
7756 * and returns the stripped column width.
7757 */
7758 static VALUE
7759 parser_dedent_string(VALUE self, VALUE input, VALUE width)
7760 {
7761 int wid, col;
7762
7763 StringValue(input);
7764 wid = NUM2UINT(width);
7765 col = dedent_string(input, wid);
7766 return INT2NUM(col);
7767 }
7768 #endif
7769
7770 static int
7771 whole_match_p(struct parser_params *p, const char *eos, long len, int indent)
7772 {
7773 const char *ptr = p->lex.pbeg;
7774 long n;
7775
7776 if (indent) {
7777 while (*ptr && ISSPACE(*ptr)) ptr++;
7778 }
7779 n = p->lex.pend - (ptr + len);
7780 if (n < 0) return FALSE;
7781 if (n > 0 && ptr[len] != '\n') {
7782 if (ptr[len] != '\r') return FALSE;
7783 if (n <= 1 || ptr[len+1] != '\n') return FALSE;
7784 }
7785 return strncmp(eos, ptr, len) == 0;
7786 }
7787
7788 static int
7789 word_match_p(struct parser_params *p, const char *word, long len)
7790 {
7791 if (strncmp(p->lex.pcur, word, len)) return 0;
7792 if (p->lex.pcur + len == p->lex.pend) return 1;
7793 int c = (unsigned char)p->lex.pcur[len];
7794 if (ISSPACE(c)) return 1;
7795 switch (c) {
7796 case '\0': case '\004': case '\032': return 1;
7797 }
7798 return 0;
7799 }
7800
7801 #define NUM_SUFFIX_R (1<<0)
7802 #define NUM_SUFFIX_I (1<<1)
7803 #define NUM_SUFFIX_ALL 3
7804
7805 static int
7806 number_literal_suffix(struct parser_params *p, int mask)
7807 {
7808 int c, result = 0;
7809 const char *lastp = p->lex.pcur;
7810
7811 while ((c = nextc(p)) != -1) {
7812 if ((mask & NUM_SUFFIX_I) && c == 'i') {
7813 result |= (mask & NUM_SUFFIX_I);
7814 mask &= ~NUM_SUFFIX_I;
7815 /* r after i, rational of complex is disallowed */
7816 mask &= ~NUM_SUFFIX_R;
7817 continue;
7818 }
7819 if ((mask & NUM_SUFFIX_R) && c == 'r') {
7820 result |= (mask & NUM_SUFFIX_R);
7821 mask &= ~NUM_SUFFIX_R;
7822 continue;
7823 }
7824 if (!ISASCII(c) || ISALPHA(c) || c == '_') {
7825 p->lex.pcur = lastp;
7826 literal_flush(p, p->lex.pcur);
7827 return 0;
7828 }
7829 pushback(p, c);
7830 break;
7831 }
7832 return result;
7833 }
7834
7835 static enum yytokentype
7836 set_number_literal(struct parser_params *p, VALUE v,
7837 enum yytokentype type, int suffix)
7838 {
7839 if (suffix & NUM_SUFFIX_I) {
7840 v = rb_complex_raw(INT2FIX(0), v);
7841 type = tIMAGINARY;
7842 }
7843 set_yylval_literal(v);
7844 SET_LEX_STATE(EXPR_END);
7845 return type;
7846 }
7847
7848 static enum yytokentype
7849 set_integer_literal(struct parser_params *p, VALUE v, int suffix)
7850 {
7851 enum yytokentype type = tINTEGER;
7852 if (suffix & NUM_SUFFIX_R) {
7853 v = rb_rational_raw1(v);
7854 type = tRATIONAL;
7855 }
7856 return set_number_literal(p, v, type, suffix);
7857 }
7858
7859 #ifdef RIPPER
7860 static void
7861 dispatch_heredoc_end(struct parser_params *p)
7862 {
7863 VALUE str;
7864 if (has_delayed_token(p))
7865 dispatch_delayed_token(p, tSTRING_CONTENT);
7866 str = STR_NEW(p->lex.ptok, p->lex.pend - p->lex.ptok);
7867 ripper_dispatch1(p, ripper_token2eventid(tHEREDOC_END), str);
7868 lex_goto_eol(p);
7869 token_flush(p);
7870 }
7871
7872 #else
7873 #define dispatch_heredoc_end(p) ((void)0)
7874 #endif
7875
7876 static enum yytokentype
7877 here_document(struct parser_params *p, rb_strterm_heredoc_t *here)
7878 {
7879 int c, func, indent = 0;
7880 const char *eos, *ptr, *ptr_end;
7881 long len;
7882 VALUE str = 0;
7883 rb_encoding *enc = p->enc;
7884 rb_encoding *base_enc = 0;
7885 int bol;
7886
7887 eos = RSTRING_PTR(here->lastline) + here->offset;
7888 len = here->length;
7889 indent = (func = here->func) & STR_FUNC_INDENT;
7890
7891 if ((c = nextc(p)) == -1) {
7892 error:
7893 #ifdef RIPPER
7894 if (!has_delayed_token(p)) {
7895 dispatch_scan_event(p, tSTRING_CONTENT);
7896 }
7897 else {
7898 if ((len = p->lex.pcur - p->lex.ptok) > 0) {
7899 if (!(func & STR_FUNC_REGEXP) && rb_enc_asciicompat(enc)) {
7900 int cr = ENC_CODERANGE_UNKNOWN;
7901 rb_str_coderange_scan_restartable(p->lex.ptok, p->lex.pcur, enc, &cr);
7902 if (cr != ENC_CODERANGE_7BIT &&
7903 p->enc == rb_usascii_encoding() &&
7904 enc != rb_utf8_encoding()) {
7905 enc = rb_ascii8bit_encoding();
7906 }
7907 }
7908 rb_enc_str_buf_cat(p->delayed.token, p->lex.ptok, len, enc);
7909 }
7910 dispatch_delayed_token(p, tSTRING_CONTENT);
7911 }
7912 lex_goto_eol(p);
7913 #endif
7914 heredoc_restore(p, &p->lex.strterm->u.heredoc);
7915 compile_error(p, "can't find string \"%.*s\" anywhere before EOF",
7916 (int)len, eos);
7917 token_flush(p);
7918 p->lex.strterm = 0;
7919 SET_LEX_STATE(EXPR_END);
7920 return tSTRING_END;
7921 }
7922 bol = was_bol(p);
7923 if (!bol) {
7924 /* not beginning of line, cannot be the terminator */
7925 }
7926 else if (p->heredoc_line_indent == -1) {
7927 /* `heredoc_line_indent == -1` means
7928 * - "after an interpolation in the same line", or
7929 * - "in a continuing line"
7930 */
7931 p->heredoc_line_indent = 0;
7932 }
7933 else if (whole_match_p(p, eos, len, indent)) {
7934 dispatch_heredoc_end(p);
7935 restore:
7936 heredoc_restore(p, &p->lex.strterm->u.heredoc);
7937 token_flush(p);
7938 p->lex.strterm = 0;
7939 SET_LEX_STATE(EXPR_END);
7940 return tSTRING_END;
7941 }
7942
7943 if (!(func & STR_FUNC_EXPAND)) {
7944 do {
7945 ptr = RSTRING_PTR(p->lex.lastline);
7946 ptr_end = p->lex.pend;
7947 if (ptr_end > ptr) {
7948 switch (ptr_end[-1]) {
7949 case '\n':
7950 if (--ptr_end == ptr || ptr_end[-1] != '\r') {
7951 ptr_end++;
7952 break;
7953 }
7954 case '\r':
7955 --ptr_end;
7956 }
7957 }
7958
7959 if (p->heredoc_indent > 0) {
7960 long i = 0;
7961 while (ptr + i < ptr_end && parser_update_heredoc_indent(p, ptr[i]))
7962 i++;
7963 p->heredoc_line_indent = 0;
7964 }
7965
7966 if (str)
7967 rb_str_cat(str, ptr, ptr_end - ptr);
7968 else
7969 str = STR_NEW(ptr, ptr_end - ptr);
7970 if (ptr_end < p->lex.pend) rb_str_cat(str, "\n", 1);
7971 lex_goto_eol(p);
7972 if (p->heredoc_indent > 0) {
7973 goto flush_str;
7974 }
7975 if (nextc(p) == -1) {
7976 if (str) {
7977 str = 0;
7978 }
7979 goto error;
7980 }
7981 } while (!whole_match_p(p, eos, len, indent));
7982 }
7983 else {
7984 /* int mb = ENC_CODERANGE_7BIT, *mbp = &mb;*/
7985 newtok(p);
7986 if (c == '#') {
7987 int t = parser_peek_variable_name(p);
7988 if (p->heredoc_line_indent != -1) {
7989 if (p->heredoc_indent > p->heredoc_line_indent) {
7990 p->heredoc_indent = p->heredoc_line_indent;
7991 }
7992 p->heredoc_line_indent = -1;
7993 }
7994 if (t) return t;
7995 tokadd(p, '#');
7996 c = nextc(p);
7997 }
7998 do {
7999 pushback(p, c);
8000 enc = p->enc;
8001 if ((c = tokadd_string(p, func, '\n', 0, NULL, &enc, &base_enc)) == -1) {
8002 if (p->eofp) goto error;
8003 goto restore;
8004 }
8005 if (c != '\n') {
8006 if (c == '\\') p->heredoc_line_indent = -1;
8007 flush:
8008 str = STR_NEW3(tok(p), toklen(p), enc, func);
8009 flush_str:
8010 set_yylval_str(str);
8011 #ifndef RIPPER
8012 if (bol) yylval.node->flags |= NODE_FL_NEWLINE;
8013 #endif
8014 flush_string_content(p, enc);
8015 return tSTRING_CONTENT;
8016 }
8017 tokadd(p, nextc(p));
8018 if (p->heredoc_indent > 0) {
8019 lex_goto_eol(p);
8020 goto flush;
8021 }
8022 /* if (mbp && mb == ENC_CODERANGE_UNKNOWN) mbp = 0;*/
8023 if ((c = nextc(p)) == -1) goto error;
8024 } while (!whole_match_p(p, eos, len, indent));
8025 str = STR_NEW3(tok(p), toklen(p), enc, func);
8026 }
8027 dispatch_heredoc_end(p);
8028 #ifdef RIPPER
8029 str = ripper_new_yylval(p, ripper_token2eventid(tSTRING_CONTENT),
8030 yylval.val, str);
8031 #endif
8032 heredoc_restore(p, &p->lex.strterm->u.heredoc);
8033 token_flush(p);
8034 p->lex.strterm = NEW_STRTERM(func | STR_FUNC_TERM, 0, 0);
8035 set_yylval_str(str);
8036 #ifndef RIPPER
8037 if (bol) yylval.node->flags |= NODE_FL_NEWLINE;
8038 #endif
8039 return tSTRING_CONTENT;
8040 }
8041
8042 #include "lex.c"
8043
8044 static int
8045 arg_ambiguous(struct parser_params *p, char c)
8046 {
8047 #ifndef RIPPER
8048 if (c == '/') {
8049 rb_warning1("ambiguity between regexp and two divisions: wrap regexp in parentheses or add a space after `%c' operator", WARN_I(c));
8050 }
8051 else {
8052 rb_warning1("ambiguous first argument; put parentheses or a space even after `%c' operator", WARN_I(c));
8053 }
8054 #else
8055 dispatch1(arg_ambiguous, rb_usascii_str_new(&c, 1));
8056 #endif
8057 return TRUE;
8058 }
8059
8060 static ID
8061 #ifndef RIPPER
8062 formal_argument(struct parser_params *p, ID lhs)
8063 #else
8064 formal_argument(struct parser_params *p, VALUE lhs)
8065 #endif
8066 {
8067 ID id = get_id(lhs);
8068
8069 switch (id_type(id)) {
8070 case ID_LOCAL:
8071 break;
8072 #ifndef RIPPER
8073 # define ERR(mesg) yyerror0(mesg)
8074 #else
8075 # define ERR(mesg) (dispatch2(param_error, WARN_S(mesg), lhs), ripper_error(p))
8076 #endif
8077 case ID_CONST:
8078 ERR("formal argument cannot be a constant");
8079 return 0;
8080 case ID_INSTANCE:
8081 ERR("formal argument cannot be an instance variable");
8082 return 0;
8083 case ID_GLOBAL:
8084 ERR("formal argument cannot be a global variable");
8085 return 0;
8086 case ID_CLASS:
8087 ERR("formal argument cannot be a class variable");
8088 return 0;
8089 default:
8090 ERR("formal argument must be local variable");
8091 return 0;
8092 #undef ERR
8093 }
8094 shadowing_lvar(p, id);
8095 return lhs;
8096 }
8097
8098 static int
8099 lvar_defined(struct parser_params *p, ID id)
8100 {
8101 return (dyna_in_block(p) && dvar_defined(p, id)) || local_id(p, id);
8102 }
8103
8104 /* emacsen -*- hack */
8105 static long
8106 parser_encode_length(struct parser_params *p, const char *name, long len)
8107 {
8108 long nlen;
8109
8110 if (len > 5 && name[nlen = len - 5] == '-') {
8111 if (rb_memcicmp(name + nlen + 1, "unix", 4) == 0)
8112 return nlen;
8113 }
8114 if (len > 4 && name[nlen = len - 4] == '-') {
8115 if (rb_memcicmp(name + nlen + 1, "dos", 3) == 0)
8116 return nlen;
8117 if (rb_memcicmp(name + nlen + 1, "mac", 3) == 0 &&
8118 !(len == 8 && rb_memcicmp(name, "utf8-mac", len) == 0))
8119 /* exclude UTF8-MAC because the encoding named "UTF8" doesn't exist in Ruby */
8120 return nlen;
8121 }
8122 return len;
8123 }
8124
8125 static void
8126 parser_set_encode(struct parser_params *p, const char *name)
8127 {
8128 int idx = rb_enc_find_index(name);
8129 rb_encoding *enc;
8130 VALUE excargs[3];
8131
8132 if (idx < 0) {
8133 excargs[1] = rb_sprintf("unknown encoding name: %s", name);
8134 error:
8135 excargs[0] = rb_eArgError;
8136 excargs[2] = rb_make_backtrace();
8137 rb_ary_unshift(excargs[2], rb_sprintf("%"PRIsVALUE":%d", p->ruby_sourcefile_string, p->ruby_sourceline));
8138 rb_exc_raise(rb_make_exception(3, excargs));
8139 }
8140 enc = rb_enc_from_index(idx);
8141 if (!rb_enc_asciicompat(enc)) {
8142 excargs[1] = rb_sprintf("%s is not ASCII compatible", rb_enc_name(enc));
8143 goto error;
8144 }
8145 p->enc = enc;
8146 #ifndef RIPPER
8147 if (p->debug_lines) {
8148 VALUE lines = p->debug_lines;
8149 long i, n = RARRAY_LEN(lines);
8150 for (i = 0; i < n; ++i) {
8151 rb_enc_associate_index(RARRAY_AREF(lines, i), idx);
8152 }
8153 }
8154 #endif
8155 }
8156
8157 static int
8158 comment_at_top(struct parser_params *p)
8159 {
8160 const char *ptr = p->lex.pbeg, *ptr_end = p->lex.pcur - 1;
8161 if (p->line_count != (p->has_shebang ? 2 : 1)) return 0;
8162 while (ptr < ptr_end) {
8163 if (!ISSPACE(*ptr)) return 0;
8164 ptr++;
8165 }
8166 return 1;
8167 }
8168
8169 typedef long (*rb_magic_comment_length_t)(struct parser_params *p, const char *name, long len);
8170 typedef void (*rb_magic_comment_setter_t)(struct parser_params *p, const char *name, const char *val);
8171
8172 static int parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val);
8173
8174 static void
8175 magic_comment_encoding(struct parser_params *p, const char *name, const char *val)
8176 {
8177 if (!comment_at_top(p)) {
8178 return;
8179 }
8180 parser_set_encode(p, val);
8181 }
8182
8183 static int
8184 parser_get_bool(struct parser_params *p, const char *name, const char *val)
8185 {
8186 switch (*val) {
8187 case 't': case 'T':
8188 if (STRCASECMP(val, "true") == 0) {
8189 return TRUE;
8190 }
8191 break;
8192 case 'f': case 'F':
8193 if (STRCASECMP(val, "false") == 0) {
8194 return FALSE;
8195 }
8196 break;
8197 }
8198 return parser_invalid_pragma_value(p, name, val);
8199 }
8200
8201 static int
8202 parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val)
8203 {
8204 rb_warning2("invalid value for %s: %s", WARN_S(name), WARN_S(val));
8205 return -1;
8206 }
8207
8208 static void
8209 parser_set_token_info(struct parser_params *p, const char *name, const char *val)
8210 {
8211 int b = parser_get_bool(p, name, val);
8212 if (b >= 0) p->token_info_enabled = b;
8213 }
8214
8215 static void
8216 parser_set_compile_option_flag(struct parser_params *p, const char *name, const char *val)
8217 {
8218 int b;
8219
8220 if (p->token_seen) {
8221 rb_warning1("`%s' is ignored after any tokens", WARN_S(name));
8222 return;
8223 }
8224
8225 b = parser_get_bool(p, name, val);
8226 if (b < 0) return;
8227
8228 if (!p->compile_option)
8229 p->compile_option = rb_obj_hide(rb_ident_hash_new());
8230 rb_hash_aset(p->compile_option, ID2SYM(rb_intern(name)),
8231 RBOOL(b));
8232 }
8233
8234 static void
8235 parser_set_shareable_constant_value(struct parser_params *p, const char *name, const char *val)
8236 {
8237 for (const char *s = p->lex.pbeg, *e = p->lex.pcur; s < e; ++s) {
8238 if (*s == ' ' || *s == '\t') continue;
8239 if (*s == '#') break;
8240 rb_warning1("`%s' is ignored unless in comment-only line", WARN_S(name));
8241 return;
8242 }
8243
8244 switch (*val) {
8245 case 'n': case 'N':
8246 if (STRCASECMP(val, "none") == 0) {
8247 p->ctxt.shareable_constant_value = shareable_none;
8248 return;
8249 }
8250 break;
8251 case 'l': case 'L':
8252 if (STRCASECMP(val, "literal") == 0) {
8253 p->ctxt.shareable_constant_value = shareable_literal;
8254 return;
8255 }
8256 break;
8257 case 'e': case 'E':
8258 if (STRCASECMP(val, "experimental_copy") == 0) {
8259 p->ctxt.shareable_constant_value = shareable_copy;
8260 return;
8261 }
8262 if (STRCASECMP(val, "experimental_everything") == 0) {
8263 p->ctxt.shareable_constant_value = shareable_everything;
8264 return;
8265 }
8266 break;
8267 }
8268 parser_invalid_pragma_value(p, name, val);
8269 }
8270
8271 # if WARN_PAST_SCOPE
8272 static void
8273 parser_set_past_scope(struct parser_params *p, const char *name, const char *val)
8274 {
8275 int b = parser_get_bool(p, name, val);
8276 if (b >= 0) p->past_scope_enabled = b;
8277 }
8278 # endif
8279
8280 struct magic_comment {
8281 const char *name;
8282 rb_magic_comment_setter_t func;
8283 rb_magic_comment_length_t length;
8284 };
8285
8286 static const struct magic_comment magic_comments[] = {
8287 {"coding", magic_comment_encoding, parser_encode_length},
8288 {"encoding", magic_comment_encoding, parser_encode_length},
8289 {"frozen_string_literal", parser_set_compile_option_flag},
8290 {"shareable_constant_value", parser_set_shareable_constant_value},
8291 {"warn_indent", parser_set_token_info},
8292 # if WARN_PAST_SCOPE
8293 {"warn_past_scope", parser_set_past_scope},
8294 # endif
8295 };
8296
8297 static const char *
8298 magic_comment_marker(const char *str, long len)
8299 {
8300 long i = 2;
8301
8302 while (i < len) {
8303 switch (str[i]) {
8304 case '-':
8305 if (str[i-1] == '*' && str[i-2] == '-') {
8306 return str + i + 1;
8307 }
8308 i += 2;
8309 break;
8310 case '*':
8311 if (i + 1 >= len) return 0;
8312 if (str[i+1] != '-') {
8313 i += 4;
8314 }
8315 else if (str[i-1] != '-') {
8316 i += 2;
8317 }
8318 else {
8319 return str + i + 2;
8320 }
8321 break;
8322 default:
8323 i += 3;
8324 break;
8325 }
8326 }
8327 return 0;
8328 }
8329
8330 static int
8331 parser_magic_comment(struct parser_params *p, const char *str, long len)
8332 {
8333 int indicator = 0;
8334 VALUE name = 0, val = 0;
8335 const char *beg, *end, *vbeg, *vend;
8336 #define str_copy(_s, _p, _n) ((_s) \
8337 ? (void)(rb_str_resize((_s), (_n)), \
8338 MEMCPY(RSTRING_PTR(_s), (_p), char, (_n)), (_s)) \
8339 : (void)((_s) = STR_NEW((_p), (_n))))
8340
8341 if (len <= 7) return FALSE;
8342 if (!!(beg = magic_comment_marker(str, len))) {
8343 if (!(end = magic_comment_marker(beg, str + len - beg)))
8344 return FALSE;
8345 indicator = TRUE;
8346 str = beg;
8347 len = end - beg - 3;
8348 }
8349
8350 /* %r"([^\\s\'\":;]+)\\s*:\\s*(\"(?:\\\\.|[^\"])*\"|[^\"\\s;]+)[\\s;]*" */
8351 while (len > 0) {
8352 const struct magic_comment *mc = magic_comments;
8353 char *s;
8354 int i;
8355 long n = 0;
8356
8357 for (; len > 0 && *str; str++, --len) {
8358 switch (*str) {
8359 case '\'': case '"': case ':': case ';':
8360 continue;
8361 }
8362 if (!ISSPACE(*str)) break;
8363 }
8364 for (beg = str; len > 0; str++, --len) {
8365 switch (*str) {
8366 case '\'': case '"': case ':': case ';':
8367 break;
8368 default:
8369 if (ISSPACE(*str)) break;
8370 continue;
8371 }
8372 break;
8373 }
8374 for (end = str; len > 0 && ISSPACE(*str); str++, --len);
8375 if (!len) break;
8376 if (*str != ':') {
8377 if (!indicator) return FALSE;
8378 continue;
8379 }
8380
8381 do str++; while (--len > 0 && ISSPACE(*str));
8382 if (!len) break;
8383 if (*str == '"') {
8384 for (vbeg = ++str; --len > 0 && *str != '"'; str++) {
8385 if (*str == '\\') {
8386 --len;
8387 ++str;
8388 }
8389 }
8390 vend = str;
8391 if (len) {
8392 --len;
8393 ++str;
8394 }
8395 }
8396 else {
8397 for (vbeg = str; len > 0 && *str != '"' && *str != ';' && !ISSPACE(*str); --len, str++);
8398 vend = str;
8399 }
8400 if (indicator) {
8401 while (len > 0 && (*str == ';' || ISSPACE(*str))) --len, str++;
8402 }
8403 else {
8404 while (len > 0 && (ISSPACE(*str))) --len, str++;
8405 if (len) return FALSE;
8406 }
8407
8408 n = end - beg;
8409 str_copy(name, beg, n);
8410 s = RSTRING_PTR(name);
8411 for (i = 0; i < n; ++i) {
8412 if (s[i] == '-') s[i] = '_';
8413 }
8414 do {
8415 if (STRNCASECMP(mc->name, s, n) == 0 && !mc->name[n]) {
8416 n = vend - vbeg;
8417 if (mc->length) {
8418 n = (*mc->length)(p, vbeg, n);
8419 }
8420 str_copy(val, vbeg, n);
8421 (*mc->func)(p, mc->name, RSTRING_PTR(val));
8422 break;
8423 }
8424 } while (++mc < magic_comments + numberof(magic_comments));
8425 #ifdef RIPPER
8426 str_copy(val, vbeg, vend - vbeg);
8427 dispatch2(magic_comment, name, val);
8428 #endif
8429 }
8430
8431 return TRUE;
8432 }
8433
8434 static void
8435 set_file_encoding(struct parser_params *p, const char *str, const char *send)
8436 {
8437 int sep = 0;
8438 const char *beg = str;
8439 VALUE s;
8440
8441 for (;;) {
8442 if (send - str <= 6) return;
8443 switch (str[6]) {
8444 case 'C': case 'c': str += 6; continue;
8445 case 'O': case 'o': str += 5; continue;
8446 case 'D': case 'd': str += 4; continue;
8447 case 'I': case 'i': str += 3; continue;
8448 case 'N': case 'n': str += 2; continue;
8449 case 'G': case 'g': str += 1; continue;
8450 case '=': case ':':
8451 sep = 1;
8452 str += 6;
8453 break;
8454 default:
8455 str += 6;
8456 if (ISSPACE(*str)) break;
8457 continue;
8458 }
8459 if (STRNCASECMP(str-6, "coding", 6) == 0) break;
8460 sep = 0;
8461 }
8462 for (;;) {
8463 do {
8464 if (++str >= send) return;
8465 } while (ISSPACE(*str));
8466 if (sep) break;
8467 if (*str != '=' && *str != ':') return;
8468 sep = 1;
8469 str++;
8470 }
8471 beg = str;
8472 while ((*str == '-' || *str == '_' || ISALNUM(*str)) && ++str < send);
8473 s = rb_str_new(beg, parser_encode_length(p, beg, str - beg));
8474 parser_set_encode(p, RSTRING_PTR(s));
8475 rb_str_resize(s, 0);
8476 }
8477
8478 static void
8479 parser_prepare(struct parser_params *p)
8480 {
8481 int c = nextc(p);
8482 p->token_info_enabled = !compile_for_eval && RTEST(ruby_verbose);
8483 switch (c) {
8484 case '#':
8485 if (peek(p, '!')) p->has_shebang = 1;
8486 break;
8487 case 0xef: /* UTF-8 BOM marker */
8488 if (p->lex.pend - p->lex.pcur >= 2 &&
8489 (unsigned char)p->lex.pcur[0] == 0xbb &&
8490 (unsigned char)p->lex.pcur[1] == 0xbf) {
8491 p->enc = rb_utf8_encoding();
8492 p->lex.pcur += 2;
8493 p->lex.pbeg = p->lex.pcur;
8494 return;
8495 }
8496 break;
8497 case EOF:
8498 return;
8499 }
8500 pushback(p, c);
8501 p->enc = rb_enc_get(p->lex.lastline);
8502 }
8503
8504 #ifndef RIPPER
8505 #define ambiguous_operator(tok, op, syn) ( \
8506 rb_warning0("`"op"' after local variable or literal is interpreted as binary operator"), \
8507 rb_warning0("even though it seems like "syn""))
8508 #else
8509 #define ambiguous_operator(tok, op, syn) \
8510 dispatch2(operator_ambiguous, TOKEN2VAL(tok), rb_str_new_cstr(syn))
8511 #endif
8512 #define warn_balanced(tok, op, syn) ((void) \
8513 (!IS_lex_state_for(last_state, EXPR_CLASS|EXPR_DOT|EXPR_FNAME|EXPR_ENDFN) && \
8514 space_seen && !ISSPACE(c) && \
8515 (ambiguous_operator(tok, op, syn), 0)), \
8516 (enum yytokentype)(tok))
8517
8518 static VALUE
8519 parse_rational(struct parser_params *p, char *str, int len, int seen_point)
8520 {
8521 VALUE v;
8522 char *point = &str[seen_point];
8523 size_t fraclen = len-seen_point-1;
8524 memmove(point, point+1, fraclen+1);
8525 v = rb_cstr_to_inum(str, 10, FALSE);
8526 return rb_rational_new(v, rb_int_positive_pow(10, fraclen));
8527 }
8528
8529 static enum yytokentype
8530 no_digits(struct parser_params *p)
8531 {
8532 yyerror0("numeric literal without digits");
8533 if (peek(p, '_')) nextc(p);
8534 /* dummy 0, for tUMINUS_NUM at numeric */
8535 return set_integer_literal(p, INT2FIX(0), 0);
8536 }
8537
8538 static enum yytokentype
8539 parse_numeric(struct parser_params *p, int c)
8540 {
8541 int is_float, seen_point, seen_e, nondigit;
8542 int suffix;
8543
8544 is_float = seen_point = seen_e = nondigit = 0;
8545 SET_LEX_STATE(EXPR_END);
8546 newtok(p);
8547 if (c == '-' || c == '+') {
8548 tokadd(p, c);
8549 c = nextc(p);
8550 }
8551 if (c == '0') {
8552 int start = toklen(p);
8553 c = nextc(p);
8554 if (c == 'x' || c == 'X') {
8555 /* hexadecimal */
8556 c = nextc(p);
8557 if (c != -1 && ISXDIGIT(c)) {
8558 do {
8559 if (c == '_') {
8560 if (nondigit) break;
8561 nondigit = c;
8562 continue;
8563 }
8564 if (!ISXDIGIT(c)) break;
8565 nondigit = 0;
8566 tokadd(p, c);
8567 } while ((c = nextc(p)) != -1);
8568 }
8569 pushback(p, c);
8570 tokfix(p);
8571 if (toklen(p) == start) {
8572 return no_digits(p);
8573 }
8574 else if (nondigit) goto trailing_uc;
8575 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8576 return set_integer_literal(p, rb_cstr_to_inum(tok(p), 16, FALSE), suffix);
8577 }
8578 if (c == 'b' || c == 'B') {
8579 /* binary */
8580 c = nextc(p);
8581 if (c == '0' || c == '1') {
8582 do {
8583 if (c == '_') {
8584 if (nondigit) break;
8585 nondigit = c;
8586 continue;
8587 }
8588 if (c != '0' && c != '1') break;
8589 nondigit = 0;
8590 tokadd(p, c);
8591 } while ((c = nextc(p)) != -1);
8592 }
8593 pushback(p, c);
8594 tokfix(p);
8595 if (toklen(p) == start) {
8596 return no_digits(p);
8597 }
8598 else if (nondigit) goto trailing_uc;
8599 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8600 return set_integer_literal(p, rb_cstr_to_inum(tok(p), 2, FALSE), suffix);
8601 }
8602 if (c == 'd' || c == 'D') {
8603 /* decimal */
8604 c = nextc(p);
8605 if (c != -1 && ISDIGIT(c)) {
8606 do {
8607 if (c == '_') {
8608 if (nondigit) break;
8609 nondigit = c;
8610 continue;
8611 }
8612 if (!ISDIGIT(c)) break;
8613 nondigit = 0;
8614 tokadd(p, c);
8615 } while ((c = nextc(p)) != -1);
8616 }
8617 pushback(p, c);
8618 tokfix(p);
8619 if (toklen(p) == start) {
8620 return no_digits(p);
8621 }
8622 else if (nondigit) goto trailing_uc;
8623 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8624 return set_integer_literal(p, rb_cstr_to_inum(tok(p), 10, FALSE), suffix);
8625 }
8626 if (c == '_') {
8627 /* 0_0 */
8628 goto octal_number;
8629 }
8630 if (c == 'o' || c == 'O') {
8631 /* prefixed octal */
8632 c = nextc(p);
8633 if (c == -1 || c == '_' || !ISDIGIT(c)) {
8634 return no_digits(p);
8635 }
8636 }
8637 if (c >= '0' && c <= '7') {
8638 /* octal */
8639 octal_number:
8640 do {
8641 if (c == '_') {
8642 if (nondigit) break;
8643 nondigit = c;
8644 continue;
8645 }
8646 if (c < '0' || c > '9') break;
8647 if (c > '7') goto invalid_octal;
8648 nondigit = 0;
8649 tokadd(p, c);
8650 } while ((c = nextc(p)) != -1);
8651 if (toklen(p) > start) {
8652 pushback(p, c);
8653 tokfix(p);
8654 if (nondigit) goto trailing_uc;
8655 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8656 return set_integer_literal(p, rb_cstr_to_inum(tok(p), 8, FALSE), suffix);
8657 }
8658 if (nondigit) {
8659 pushback(p, c);
8660 goto trailing_uc;
8661 }
8662 }
8663 if (c > '7' && c <= '9') {
8664 invalid_octal:
8665 yyerror0("Invalid octal digit");
8666 }
8667 else if (c == '.' || c == 'e' || c == 'E') {
8668 tokadd(p, '0');
8669 }
8670 else {
8671 pushback(p, c);
8672 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8673 return set_integer_literal(p, INT2FIX(0), suffix);
8674 }
8675 }
8676
8677 for (;;) {
8678 switch (c) {
8679 case '0': case '1': case '2': case '3': case '4':
8680 case '5': case '6': case '7': case '8': case '9':
8681 nondigit = 0;
8682 tokadd(p, c);
8683 break;
8684
8685 case '.':
8686 if (nondigit) goto trailing_uc;
8687 if (seen_point || seen_e) {
8688 goto decode_num;
8689 }
8690 else {
8691 int c0 = nextc(p);
8692 if (c0 == -1 || !ISDIGIT(c0)) {
8693 pushback(p, c0);
8694 goto decode_num;
8695 }
8696 c = c0;
8697 }
8698 seen_point = toklen(p);
8699 tokadd(p, '.');
8700 tokadd(p, c);
8701 is_float++;
8702 nondigit = 0;
8703 break;
8704
8705 case 'e':
8706 case 'E':
8707 if (nondigit) {
8708 pushback(p, c);
8709 c = nondigit;
8710 goto decode_num;
8711 }
8712 if (seen_e) {
8713 goto decode_num;
8714 }
8715 nondigit = c;
8716 c = nextc(p);
8717 if (c != '-' && c != '+' && !ISDIGIT(c)) {
8718 pushback(p, c);
8719 nondigit = 0;
8720 goto decode_num;
8721 }
8722 tokadd(p, nondigit);
8723 seen_e++;
8724 is_float++;
8725 tokadd(p, c);
8726 nondigit = (c == '-' || c == '+') ? c : 0;
8727 break;
8728
8729 case '_': /* `_' in number just ignored */
8730 if (nondigit) goto decode_num;
8731 nondigit = c;
8732 break;
8733
8734 default:
8735 goto decode_num;
8736 }
8737 c = nextc(p);
8738 }
8739
8740 decode_num:
8741 pushback(p, c);
8742 if (nondigit) {
8743 trailing_uc:
8744 literal_flush(p, p->lex.pcur - 1);
8745 YYLTYPE loc = RUBY_INIT_YYLLOC();
8746 compile_error(p, "trailing `%c' in number", nondigit);
8747 parser_show_error_line(p, &loc);
8748 }
8749 tokfix(p);
8750 if (is_float) {
8751 enum yytokentype type = tFLOAT;
8752 VALUE v;
8753
8754 suffix = number_literal_suffix(p, seen_e ? NUM_SUFFIX_I : NUM_SUFFIX_ALL);
8755 if (suffix & NUM_SUFFIX_R) {
8756 type = tRATIONAL;
8757 v = parse_rational(p, tok(p), toklen(p), seen_point);
8758 }
8759 else {
8760 double d = strtod(tok(p), 0);
8761 if (errno == ERANGE) {
8762 rb_warning1("Float %s out of range", WARN_S(tok(p)));
8763 errno = 0;
8764 }
8765 v = DBL2NUM(d);
8766 }
8767 return set_number_literal(p, v, type, suffix);
8768 }
8769 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
8770 return set_integer_literal(p, rb_cstr_to_inum(tok(p), 10, FALSE), suffix);
8771 }
8772
8773 static enum yytokentype
8774 parse_qmark(struct parser_params *p, int space_seen)
8775 {
8776 rb_encoding *enc;
8777 register int c;
8778 VALUE lit;
8779
8780 if (IS_END()) {
8781 SET_LEX_STATE(EXPR_VALUE);
8782 return '?';
8783 }
8784 c = nextc(p);
8785 if (c == -1) {
8786 compile_error(p, "incomplete character syntax");
8787 return 0;
8788 }
8789 if (rb_enc_isspace(c, p->enc)) {
8790 if (!IS_ARG()) {
8791 int c2 = escaped_control_code(c);
8792 if (c2) {
8793 WARN_SPACE_CHAR(c2, "?");
8794 }
8795 }
8796 ternary:
8797 pushback(p, c);
8798 SET_LEX_STATE(EXPR_VALUE);
8799 return '?';
8800 }
8801 newtok(p);
8802 enc = p->enc;
8803 if (!parser_isascii(p)) {
8804 if (tokadd_mbchar(p, c) == -1) return 0;
8805 }
8806 else if ((rb_enc_isalnum(c, p->enc) || c == '_') &&
8807 p->lex.pcur < p->lex.pend && is_identchar(p->lex.pcur, p->lex.pend, p->enc)) {
8808 if (space_seen) {
8809 const char *start = p->lex.pcur - 1, *ptr = start;
8810 do {
8811 int n = parser_precise_mbclen(p, ptr);
8812 if (n < 0) return -1;
8813 ptr += n;
8814 } while (ptr < p->lex.pend && is_identchar(ptr, p->lex.pend, p->enc));
8815 rb_warn2("`?' just followed by `%.*s' is interpreted as" \
8816 " a conditional operator, put a space after `?'",
8817 WARN_I((int)(ptr - start)), WARN_S_L(start, (ptr - start)));
8818 }
8819 goto ternary;
8820 }
8821 else if (c == '\\') {
8822 if (peek(p, 'u')) {
8823 nextc(p);
8824 enc = rb_utf8_encoding();
8825 tokadd_utf8(p, &enc, -1, 0, 0);
8826 }
8827 else if (!lex_eol_p(p) && !(c = *p->lex.pcur, ISASCII(c))) {
8828 nextc(p);
8829 if (tokadd_mbchar(p, c) == -1) return 0;
8830 }
8831 else {
8832 c = read_escape(p, 0, &enc);
8833 tokadd(p, c);
8834 }
8835 }
8836 else {
8837 tokadd(p, c);
8838 }
8839 tokfix(p);
8840 lit = STR_NEW3(tok(p), toklen(p), enc, 0);
8841 set_yylval_str(lit);
8842 SET_LEX_STATE(EXPR_END);
8843 return tCHAR;
8844 }
8845
8846 static enum yytokentype
8847 parse_percent(struct parser_params *p, const int space_seen, const enum lex_state_e last_state)
8848 {
8849 register int c;
8850 const char *ptok = p->lex.pcur;
8851
8852 if (IS_BEG()) {
8853 int term;
8854 int paren;
8855
8856 c = nextc(p);
8857 quotation:
8858 if (c == -1) goto unterminated;
8859 if (!ISALNUM(c)) {
8860 term = c;
8861 if (!ISASCII(c)) goto unknown;
8862 c = 'Q';
8863 }
8864 else {
8865 term = nextc(p);
8866 if (rb_enc_isalnum(term, p->enc) || !parser_isascii(p)) {
8867 unknown:
8868 pushback(p, term);
8869 c = parser_precise_mbclen(p, p->lex.pcur);
8870 if (c < 0) return 0;
8871 p->lex.pcur += c;
8872 yyerror0("unknown type of %string");
8873 return 0;
8874 }
8875 }
8876 if (term == -1) {
8877 unterminated:
8878 compile_error(p, "unterminated quoted string meets end of file");
8879 return 0;
8880 }
8881 paren = term;
8882 if (term == '(') term = ')';
8883 else if (term == '[') term = ']';
8884 else if (term == '{') term = '}';
8885 else if (term == '<') term = '>';
8886 else paren = 0;
8887
8888 p->lex.ptok = ptok-1;
8889 switch (c) {
8890 case 'Q':
8891 p->lex.strterm = NEW_STRTERM(str_dquote, term, paren);
8892 return tSTRING_BEG;
8893
8894 case 'q':
8895 p->lex.strterm = NEW_STRTERM(str_squote, term, paren);
8896 return tSTRING_BEG;
8897
8898 case 'W':
8899 p->lex.strterm = NEW_STRTERM(str_dword, term, paren);
8900 return tWORDS_BEG;
8901
8902 case 'w':
8903 p->lex.strterm = NEW_STRTERM(str_sword, term, paren);
8904 return tQWORDS_BEG;
8905
8906 case 'I':
8907 p->lex.strterm = NEW_STRTERM(str_dword, term, paren);
8908 return tSYMBOLS_BEG;
8909
8910 case 'i':
8911 p->lex.strterm = NEW_STRTERM(str_sword, term, paren);
8912 return tQSYMBOLS_BEG;
8913
8914 case 'x':
8915 p->lex.strterm = NEW_STRTERM(str_xquote, term, paren);
8916 return tXSTRING_BEG;
8917
8918 case 'r':
8919 p->lex.strterm = NEW_STRTERM(str_regexp, term, paren);
8920 return tREGEXP_BEG;
8921
8922 case 's':
8923 p->lex.strterm = NEW_STRTERM(str_ssym, term, paren);
8924 SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);
8925 return tSYMBEG;
8926
8927 default:
8928 yyerror0("unknown type of %string");
8929 return 0;
8930 }
8931 }
8932 if ((c = nextc(p)) == '=') {
8933 set_yylval_id('%');
8934 SET_LEX_STATE(EXPR_BEG);
8935 return tOP_ASGN;
8936 }
8937 if (IS_SPCARG(c) || (IS_lex_state(EXPR_FITEM) && c == 's')) {
8938 goto quotation;
8939 }
8940 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
8941 pushback(p, c);
8942 return warn_balanced('%', "%%", "string literal");
8943 }
8944
8945 static int
8946 tokadd_ident(struct parser_params *p, int c)
8947 {
8948 do {
8949 if (tokadd_mbchar(p, c) == -1) return -1;
8950 c = nextc(p);
8951 } while (parser_is_identchar(p));
8952 pushback(p, c);
8953 return 0;
8954 }
8955
8956 static ID
8957 tokenize_ident(struct parser_params *p, const enum lex_state_e last_state)
8958 {
8959 ID ident = TOK_INTERN();
8960
8961 set_yylval_name(ident);
8962
8963 return ident;
8964 }
8965
8966 static int
8967 parse_numvar(struct parser_params *p)
8968 {
8969 size_t len;
8970 int overflow;
8971 unsigned long n = ruby_scan_digits(tok(p)+1, toklen(p)-1, 10, &len, &overflow);
8972 const unsigned long nth_ref_max =
8973 ((FIXNUM_MAX < INT_MAX) ? FIXNUM_MAX : INT_MAX) >> 1;
8974 /* NTH_REF is left-shifted to be ORed with back-ref flag and
8975 * turned into a Fixnum, in compile.c */
8976
8977 if (overflow || n > nth_ref_max) {
8978 /* compile_error()? */
8979 rb_warn1("`%s' is too big for a number variable, always nil", WARN_S(tok(p)));
8980 return 0; /* $0 is $PROGRAM_NAME, not NTH_REF */
8981 }
8982 else {
8983 return (int)n;
8984 }
8985 }
8986
8987 static enum yytokentype
8988 parse_gvar(struct parser_params *p, const enum lex_state_e last_state)
8989 {
8990 const char *ptr = p->lex.pcur;
8991 register int c;
8992
8993 SET_LEX_STATE(EXPR_END);
8994 p->lex.ptok = ptr - 1; /* from '$' */
8995 newtok(p);
8996 c = nextc(p);
8997 switch (c) {
8998 case '_': /* $_: last read line string */
8999 c = nextc(p);
9000 if (parser_is_identchar(p)) {
9001 tokadd(p, '$');
9002 tokadd(p, '_');
9003 break;
9004 }
9005 pushback(p, c);
9006 c = '_';
9007 /* fall through */
9008 case '~': /* $~: match-data */
9009 case '*': /* $*: argv */
9010 case '$': /* $$: pid */
9011 case '?': /* $?: last status */
9012 case '!': /* $!: error string */
9013 case '@': /* $@: error position */
9014 case '/': /* $/: input record separator */
9015 case '\\': /* $\: output record separator */
9016 case ';': /* $;: field separator */
9017 case ',': /* $,: output field separator */
9018 case '.': /* $.: last read line number */
9019 case '=': /* $=: ignorecase */
9020 case ':': /* $:: load path */
9021 case '<': /* $<: reading filename */
9022 case '>': /* $>: default output handle */
9023 case '\"': /* $": already loaded files */
9024 tokadd(p, '$');
9025 tokadd(p, c);
9026 goto gvar;
9027
9028 case '-':
9029 tokadd(p, '$');
9030 tokadd(p, c);
9031 c = nextc(p);
9032 if (parser_is_identchar(p)) {
9033 if (tokadd_mbchar(p, c) == -1) return 0;
9034 }
9035 else {
9036 pushback(p, c);
9037 pushback(p, '-');
9038 return '$';
9039 }
9040 gvar:
9041 set_yylval_name(TOK_INTERN());
9042 return tGVAR;
9043
9044 case '&': /* $&: last match */
9045 case '`': /* $`: string before last match */
9046 case '\'': /* $': string after last match */
9047 case '+': /* $+: string matches last paren. */
9048 if (IS_lex_state_for(last_state, EXPR_FNAME)) {
9049 tokadd(p, '$');
9050 tokadd(p, c);
9051 goto gvar;
9052 }
9053 set_yylval_node(NEW_BACK_REF(c, &_cur_loc));
9054 return tBACK_REF;
9055
9056 case '1': case '2': case '3':
9057 case '4': case '5': case '6':
9058 case '7': case '8': case '9':
9059 tokadd(p, '$');
9060 do {
9061 tokadd(p, c);
9062 c = nextc(p);
9063 } while (c != -1 && ISDIGIT(c));
9064 pushback(p, c);
9065 if (IS_lex_state_for(last_state, EXPR_FNAME)) goto gvar;
9066 tokfix(p);
9067 c = parse_numvar(p);
9068 set_yylval_node(NEW_NTH_REF(c, &_cur_loc));
9069 return tNTH_REF;
9070
9071 default:
9072 if (!parser_is_identchar(p)) {
9073 YYLTYPE loc = RUBY_INIT_YYLLOC();
9074 if (c == -1 || ISSPACE(c)) {
9075 compile_error(p, "`$' without identifiers is not allowed as a global variable name");
9076 }
9077 else {
9078 pushback(p, c);
9079 compile_error(p, "`$%c' is not allowed as a global variable name", c);
9080 }
9081 parser_show_error_line(p, &loc);
9082 set_yylval_noname();
9083 return tGVAR;
9084 }
9085 /* fall through */
9086 case '0':
9087 tokadd(p, '$');
9088 }
9089
9090 if (tokadd_ident(p, c)) return 0;
9091 SET_LEX_STATE(EXPR_END);
9092 tokenize_ident(p, last_state);
9093 return tGVAR;
9094 }
9095
9096 #ifndef RIPPER
9097 static bool
9098 parser_numbered_param(struct parser_params *p, int n)
9099 {
9100 if (n < 0) return false;
9101
9102 if (DVARS_TERMINAL_P(p->lvtbl->args) || DVARS_TERMINAL_P(p->lvtbl->args->prev)) {
9103 return false;
9104 }
9105 if (p->max_numparam == ORDINAL_PARAM) {
9106 compile_error(p, "ordinary parameter is defined");
9107 return false;
9108 }
9109 struct vtable *args = p->lvtbl->args;
9110 if (p->max_numparam < n) {
9111 p->max_numparam = n;
9112 }
9113 while (n > args->pos) {
9114 vtable_add(args, NUMPARAM_IDX_TO_ID(args->pos+1));
9115 }
9116 return true;
9117 }
9118 #endif
9119
9120 static enum yytokentype
9121 parse_atmark(struct parser_params *p, const enum lex_state_e last_state)
9122 {
9123 const char *ptr = p->lex.pcur;
9124 enum yytokentype result = tIVAR;
9125 register int c = nextc(p);
9126 YYLTYPE loc;
9127
9128 p->lex.ptok = ptr - 1; /* from '@' */
9129 newtok(p);
9130 tokadd(p, '@');
9131 if (c == '@') {
9132 result = tCVAR;
9133 tokadd(p, '@');
9134 c = nextc(p);
9135 }
9136 SET_LEX_STATE(IS_lex_state_for(last_state, EXPR_FNAME) ? EXPR_ENDFN : EXPR_END);
9137 if (c == -1 || !parser_is_identchar(p)) {
9138 pushback(p, c);
9139 RUBY_SET_YYLLOC(loc);
9140 if (result == tIVAR) {
9141 compile_error(p, "`@' without identifiers is not allowed as an instance variable name");
9142 }
9143 else {
9144 compile_error(p, "`@@' without identifiers is not allowed as a class variable name");
9145 }
9146 parser_show_error_line(p, &loc);
9147 set_yylval_noname();
9148 SET_LEX_STATE(EXPR_END);
9149 return result;
9150 }
9151 else if (ISDIGIT(c)) {
9152 pushback(p, c);
9153 RUBY_SET_YYLLOC(loc);
9154 if (result == tIVAR) {
9155 compile_error(p, "`@%c' is not allowed as an instance variable name", c);
9156 }
9157 else {
9158 compile_error(p, "`@@%c' is not allowed as a class variable name", c);
9159 }
9160 parser_show_error_line(p, &loc);
9161 set_yylval_noname();
9162 SET_LEX_STATE(EXPR_END);
9163 return result;
9164 }
9165
9166 if (tokadd_ident(p, c)) return 0;
9167 tokenize_ident(p, last_state);
9168 return result;
9169 }
9170
9171 static enum yytokentype
9172 parse_ident(struct parser_params *p, int c, int cmd_state)
9173 {
9174 enum yytokentype result;
9175 int mb = ENC_CODERANGE_7BIT;
9176 const enum lex_state_e last_state = p->lex.state;
9177 ID ident;
9178
9179 do {
9180 if (!ISASCII(c)) mb = ENC_CODERANGE_UNKNOWN;
9181 if (tokadd_mbchar(p, c) == -1) return 0;
9182 c = nextc(p);
9183 } while (parser_is_identchar(p));
9184 if ((c == '!' || c == '?') && !peek(p, '=')) {
9185 result = tFID;
9186 tokadd(p, c);
9187 }
9188 else if (c == '=' && IS_lex_state(EXPR_FNAME) &&
9189 (!peek(p, '~') && !peek(p, '>') && (!peek(p, '=') || (peek_n(p, '>', 1))))) {
9190 result = tIDENTIFIER;
9191 tokadd(p, c);
9192 }
9193 else {
9194 result = tCONSTANT; /* assume provisionally */
9195 pushback(p, c);
9196 }
9197 tokfix(p);
9198
9199 if (IS_LABEL_POSSIBLE()) {
9200 if (IS_LABEL_SUFFIX(0)) {
9201 SET_LEX_STATE(EXPR_ARG|EXPR_LABELED);
9202 nextc(p);
9203 set_yylval_name(TOK_INTERN());
9204 return tLABEL;
9205 }
9206 }
9207 if (mb == ENC_CODERANGE_7BIT && !IS_lex_state(EXPR_DOT)) {
9208 const struct kwtable *kw;
9209
9210 /* See if it is a reserved word. */
9211 kw = rb_reserved_word(tok(p), toklen(p));
9212 if (kw) {
9213 enum lex_state_e state = p->lex.state;
9214 if (IS_lex_state_for(state, EXPR_FNAME)) {
9215 SET_LEX_STATE(EXPR_ENDFN);
9216 set_yylval_name(rb_intern2(tok(p), toklen(p)));
9217 return kw->id[0];
9218 }
9219 SET_LEX_STATE(kw->state);
9220 if (IS_lex_state(EXPR_BEG)) {
9221 p->command_start = TRUE;
9222 }
9223 if (kw->id[0] == keyword_do) {
9224 if (lambda_beginning_p()) {
9225 p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE in the body of "-> do ... end" */
9226 return keyword_do_LAMBDA;
9227 }
9228 if (COND_P()) return keyword_do_cond;
9229 if (CMDARG_P() && !IS_lex_state_for(state, EXPR_CMDARG))
9230 return keyword_do_block;
9231 return keyword_do;
9232 }
9233 if (IS_lex_state_for(state, (EXPR_BEG | EXPR_LABELED)))
9234 return kw->id[0];
9235 else {
9236 if (kw->id[0] != kw->id[1])
9237 SET_LEX_STATE(EXPR_BEG | EXPR_LABEL);
9238 return kw->id[1];
9239 }
9240 }
9241 }
9242
9243 if (IS_lex_state(EXPR_BEG_ANY | EXPR_ARG_ANY | EXPR_DOT)) {
9244 if (cmd_state) {
9245 SET_LEX_STATE(EXPR_CMDARG);
9246 }
9247 else {
9248 SET_LEX_STATE(EXPR_ARG);
9249 }
9250 }
9251 else if (p->lex.state == EXPR_FNAME) {
9252 SET_LEX_STATE(EXPR_ENDFN);
9253 }
9254 else {
9255 SET_LEX_STATE(EXPR_END);
9256 }
9257
9258 ident = tokenize_ident(p, last_state);
9259 if (result == tCONSTANT && is_local_id(ident)) result = tIDENTIFIER;
9260 if (!IS_lex_state_for(last_state, EXPR_DOT|EXPR_FNAME) &&
9261 (result == tIDENTIFIER) && /* not EXPR_FNAME, not attrasgn */
9262 lvar_defined(p, ident)) {
9263 SET_LEX_STATE(EXPR_END|EXPR_LABEL);
9264 }
9265 return result;
9266 }
9267
9268 static enum yytokentype
9269 parser_yylex(struct parser_params *p)
9270 {
9271 register int c;
9272 int space_seen = 0;
9273 int cmd_state;
9274 int label;
9275 enum lex_state_e last_state;
9276 int fallthru = FALSE;
9277 int token_seen = p->token_seen;
9278
9279 if (p->lex.strterm) {
9280 if (p->lex.strterm->flags & STRTERM_HEREDOC) {
9281 return here_document(p, &p->lex.strterm->u.heredoc);
9282 }
9283 else {
9284 token_flush(p);
9285 return parse_string(p, &p->lex.strterm->u.literal);
9286 }
9287 }
9288 cmd_state = p->command_start;
9289 p->command_start = FALSE;
9290 p->token_seen = TRUE;
9291 retry:
9292 last_state = p->lex.state;
9293 #ifndef RIPPER
9294 token_flush(p);
9295 #endif
9296 switch (c = nextc(p)) {
9297 case '\0': /* NUL */
9298 case '\004': /* ^D */
9299 case '\032': /* ^Z */
9300 case -1: /* end of script. */
9301 return 0;
9302
9303 /* white spaces */
9304 case '\r':
9305 if (!p->cr_seen) {
9306 p->cr_seen = TRUE;
9307 /* carried over with p->lex.nextline for nextc() */
9308 rb_warn0("encountered \\r in middle of line, treated as a mere space");
9309 }
9310 /* fall through */
9311 case ' ': case '\t': case '\f':
9312 case '\13': /* '\v' */
9313 space_seen = 1;
9314 #ifdef RIPPER
9315 while ((c = nextc(p))) {
9316 switch (c) {
9317 case ' ': case '\t': case '\f': case '\r':
9318 case '\13': /* '\v' */
9319 break;
9320 default:
9321 goto outofloop;
9322 }
9323 }
9324 outofloop:
9325 pushback(p, c);
9326 dispatch_scan_event(p, tSP);
9327 #endif
9328 goto retry;
9329
9330 case '#': /* it's a comment */
9331 p->token_seen = token_seen;
9332 /* no magic_comment in shebang line */
9333 if (!parser_magic_comment(p, p->lex.pcur, p->lex.pend - p->lex.pcur)) {
9334 if (comment_at_top(p)) {
9335 set_file_encoding(p, p->lex.pcur, p->lex.pend);
9336 }
9337 }
9338 lex_goto_eol(p);
9339 dispatch_scan_event(p, tCOMMENT);
9340 fallthru = TRUE;
9341 /* fall through */
9342 case '\n':
9343 p->token_seen = token_seen;
9344 c = (IS_lex_state(EXPR_BEG|EXPR_CLASS|EXPR_FNAME|EXPR_DOT) &&
9345 !IS_lex_state(EXPR_LABELED));
9346 if (c || IS_lex_state_all(EXPR_ARG|EXPR_LABELED)) {
9347 if (!fallthru) {
9348 dispatch_scan_event(p, tIGNORED_NL);
9349 }
9350 fallthru = FALSE;
9351 if (!c && p->ctxt.in_kwarg) {
9352 goto normal_newline;
9353 }
9354 goto retry;
9355 }
9356 while (1) {
9357 switch (c = nextc(p)) {
9358 case ' ': case '\t': case '\f': case '\r':
9359 case '\13': /* '\v' */
9360 space_seen = 1;
9361 break;
9362 case '#':
9363 pushback(p, c);
9364 if (space_seen) dispatch_scan_event(p, tSP);
9365 goto retry;
9366 case '&':
9367 case '.': {
9368 dispatch_delayed_token(p, tIGNORED_NL);
9369 if (peek(p, '.') == (c == '&')) {
9370 pushback(p, c);
9371 dispatch_scan_event(p, tSP);
9372 goto retry;
9373 }
9374 }
9375 default:
9376 p->ruby_sourceline--;
9377 p->lex.nextline = p->lex.lastline;
9378 case -1: /* EOF no decrement*/
9379 #ifndef RIPPER
9380 if (p->lex.prevline && !p->eofp) p->lex.lastline = p->lex.prevline;
9381 p->lex.pbeg = RSTRING_PTR(p->lex.lastline);
9382 p->lex.pend = p->lex.pcur = p->lex.pbeg + RSTRING_LEN(p->lex.lastline);
9383 pushback(p, 1); /* always pushback */
9384 p->lex.ptok = p->lex.pcur;
9385 #else
9386 lex_goto_eol(p);
9387 if (c != -1) {
9388 p->lex.ptok = p->lex.pcur;
9389 }
9390 #endif
9391 goto normal_newline;
9392 }
9393 }
9394 normal_newline:
9395 p->command_start = TRUE;
9396 SET_LEX_STATE(EXPR_BEG);
9397 return '\n';
9398
9399 case '*':
9400 if ((c = nextc(p)) == '*') {
9401 if ((c = nextc(p)) == '=') {
9402 set_yylval_id(idPow);
9403 SET_LEX_STATE(EXPR_BEG);
9404 return tOP_ASGN;
9405 }
9406 pushback(p, c);
9407 if (IS_SPCARG(c)) {
9408 rb_warning0("`**' interpreted as argument prefix");
9409 c = tDSTAR;
9410 }
9411 else if (IS_BEG()) {
9412 c = tDSTAR;
9413 }
9414 else {
9415 c = warn_balanced((enum ruby_method_ids)tPOW, "**", "argument prefix");
9416 }
9417 }
9418 else {
9419 if (c == '=') {
9420 set_yylval_id('*');
9421 SET_LEX_STATE(EXPR_BEG);
9422 return tOP_ASGN;
9423 }
9424 pushback(p, c);
9425 if (IS_SPCARG(c)) {
9426 rb_warning0("`*' interpreted as argument prefix");
9427 c = tSTAR;
9428 }
9429 else if (IS_BEG()) {
9430 c = tSTAR;
9431 }
9432 else {
9433 c = warn_balanced('*', "*", "argument prefix");
9434 }
9435 }
9436 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9437 return c;
9438
9439 case '!':
9440 c = nextc(p);
9441 if (IS_AFTER_OPERATOR()) {
9442 SET_LEX_STATE(EXPR_ARG);
9443 if (c == '@') {
9444 return '!';
9445 }
9446 }
9447 else {
9448 SET_LEX_STATE(EXPR_BEG);
9449 }
9450 if (c == '=') {
9451 return tNEQ;
9452 }
9453 if (c == '~') {
9454 return tNMATCH;
9455 }
9456 pushback(p, c);
9457 return '!';
9458
9459 case '=':
9460 if (was_bol(p)) {
9461 /* skip embedded rd document */
9462 if (word_match_p(p, "begin", 5)) {
9463 int first_p = TRUE;
9464
9465 lex_goto_eol(p);
9466 dispatch_scan_event(p, tEMBDOC_BEG);
9467 for (;;) {
9468 lex_goto_eol(p);
9469 if (!first_p) {
9470 dispatch_scan_event(p, tEMBDOC);
9471 }
9472 first_p = FALSE;
9473 c = nextc(p);
9474 if (c == -1) {
9475 compile_error(p, "embedded document meets end of file");
9476 return 0;
9477 }
9478 if (c == '=' && word_match_p(p, "end", 3)) {
9479 break;
9480 }
9481 pushback(p, c);
9482 }
9483 lex_goto_eol(p);
9484 dispatch_scan_event(p, tEMBDOC_END);
9485 goto retry;
9486 }
9487 }
9488
9489 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9490 if ((c = nextc(p)) == '=') {
9491 if ((c = nextc(p)) == '=') {
9492 return tEQQ;
9493 }
9494 pushback(p, c);
9495 return tEQ;
9496 }
9497 if (c == '~') {
9498 return tMATCH;
9499 }
9500 else if (c == '>') {
9501 return tASSOC;
9502 }
9503 pushback(p, c);
9504 return '=';
9505
9506 case '<':
9507 c = nextc(p);
9508 if (c == '<' &&
9509 !IS_lex_state(EXPR_DOT | EXPR_CLASS) &&
9510 !IS_END() &&
9511 (!IS_ARG() || IS_lex_state(EXPR_LABELED) || space_seen)) {
9512 int token = heredoc_identifier(p);
9513 if (token) return token < 0 ? 0 : token;
9514 }
9515 if (IS_AFTER_OPERATOR()) {
9516 SET_LEX_STATE(EXPR_ARG);
9517 }
9518 else {
9519 if (IS_lex_state(EXPR_CLASS))
9520 p->command_start = TRUE;
9521 SET_LEX_STATE(EXPR_BEG);
9522 }
9523 if (c == '=') {
9524 if ((c = nextc(p)) == '>') {
9525 return tCMP;
9526 }
9527 pushback(p, c);
9528 return tLEQ;
9529 }
9530 if (c == '<') {
9531 if ((c = nextc(p)) == '=') {
9532 set_yylval_id(idLTLT);
9533 SET_LEX_STATE(EXPR_BEG);
9534 return tOP_ASGN;
9535 }
9536 pushback(p, c);
9537 return warn_balanced((enum ruby_method_ids)tLSHFT, "<<", "here document");
9538 }
9539 pushback(p, c);
9540 return '<';
9541
9542 case '>':
9543 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9544 if ((c = nextc(p)) == '=') {
9545 return tGEQ;
9546 }
9547 if (c == '>') {
9548 if ((c = nextc(p)) == '=') {
9549 set_yylval_id(idGTGT);
9550 SET_LEX_STATE(EXPR_BEG);
9551 return tOP_ASGN;
9552 }
9553 pushback(p, c);
9554 return tRSHFT;
9555 }
9556 pushback(p, c);
9557 return '>';
9558
9559 case '"':
9560 label = (IS_LABEL_POSSIBLE() ? str_label : 0);
9561 p->lex.strterm = NEW_STRTERM(str_dquote | label, '"', 0);
9562 p->lex.ptok = p->lex.pcur-1;
9563 return tSTRING_BEG;
9564
9565 case '`':
9566 if (IS_lex_state(EXPR_FNAME)) {
9567 SET_LEX_STATE(EXPR_ENDFN);
9568 return c;
9569 }
9570 if (IS_lex_state(EXPR_DOT)) {
9571 if (cmd_state)
9572 SET_LEX_STATE(EXPR_CMDARG);
9573 else
9574 SET_LEX_STATE(EXPR_ARG);
9575 return c;
9576 }
9577 p->lex.strterm = NEW_STRTERM(str_xquote, '`', 0);
9578 return tXSTRING_BEG;
9579
9580 case '\'':
9581 label = (IS_LABEL_POSSIBLE() ? str_label : 0);
9582 p->lex.strterm = NEW_STRTERM(str_squote | label, '\'', 0);
9583 p->lex.ptok = p->lex.pcur-1;
9584 return tSTRING_BEG;
9585
9586 case '?':
9587 return parse_qmark(p, space_seen);
9588
9589 case '&':
9590 if ((c = nextc(p)) == '&') {
9591 SET_LEX_STATE(EXPR_BEG);
9592 if ((c = nextc(p)) == '=') {
9593 set_yylval_id(idANDOP);
9594 SET_LEX_STATE(EXPR_BEG);
9595 return tOP_ASGN;
9596 }
9597 pushback(p, c);
9598 return tANDOP;
9599 }
9600 else if (c == '=') {
9601 set_yylval_id('&');
9602 SET_LEX_STATE(EXPR_BEG);
9603 return tOP_ASGN;
9604 }
9605 else if (c == '.') {
9606 set_yylval_id(idANDDOT);
9607 SET_LEX_STATE(EXPR_DOT);
9608 return tANDDOT;
9609 }
9610 pushback(p, c);
9611 if (IS_SPCARG(c)) {
9612 if ((c != ':') ||
9613 (c = peekc_n(p, 1)) == -1 ||
9614 !(c == '\'' || c == '"' ||
9615 is_identchar((p->lex.pcur+1), p->lex.pend, p->enc))) {
9616 rb_warning0("`&' interpreted as argument prefix");
9617 }
9618 c = tAMPER;
9619 }
9620 else if (IS_BEG()) {
9621 c = tAMPER;
9622 }
9623 else {
9624 c = warn_balanced('&', "&", "argument prefix");
9625 }
9626 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9627 return c;
9628
9629 case '|':
9630 if ((c = nextc(p)) == '|') {
9631 SET_LEX_STATE(EXPR_BEG);
9632 if ((c = nextc(p)) == '=') {
9633 set_yylval_id(idOROP);
9634 SET_LEX_STATE(EXPR_BEG);
9635 return tOP_ASGN;
9636 }
9637 pushback(p, c);
9638 if (IS_lex_state_for(last_state, EXPR_BEG)) {
9639 c = '|';
9640 pushback(p, '|');
9641 return c;
9642 }
9643 return tOROP;
9644 }
9645 if (c == '=') {
9646 set_yylval_id('|');
9647 SET_LEX_STATE(EXPR_BEG);
9648 return tOP_ASGN;
9649 }
9650 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG|EXPR_LABEL);
9651 pushback(p, c);
9652 return '|';
9653
9654 case '+':
9655 c = nextc(p);
9656 if (IS_AFTER_OPERATOR()) {
9657 SET_LEX_STATE(EXPR_ARG);
9658 if (c == '@') {
9659 return tUPLUS;
9660 }
9661 pushback(p, c);
9662 return '+';
9663 }
9664 if (c == '=') {
9665 set_yylval_id('+');
9666 SET_LEX_STATE(EXPR_BEG);
9667 return tOP_ASGN;
9668 }
9669 if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '+'))) {
9670 SET_LEX_STATE(EXPR_BEG);
9671 pushback(p, c);
9672 if (c != -1 && ISDIGIT(c)) {
9673 return parse_numeric(p, '+');
9674 }
9675 return tUPLUS;
9676 }
9677 SET_LEX_STATE(EXPR_BEG);
9678 pushback(p, c);
9679 return warn_balanced('+', "+", "unary operator");
9680
9681 case '-':
9682 c = nextc(p);
9683 if (IS_AFTER_OPERATOR()) {
9684 SET_LEX_STATE(EXPR_ARG);
9685 if (c == '@') {
9686 return tUMINUS;
9687 }
9688 pushback(p, c);
9689 return '-';
9690 }
9691 if (c == '=') {
9692 set_yylval_id('-');
9693 SET_LEX_STATE(EXPR_BEG);
9694 return tOP_ASGN;
9695 }
9696 if (c == '>') {
9697 SET_LEX_STATE(EXPR_ENDFN);
9698 return tLAMBDA;
9699 }
9700 if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '-'))) {
9701 SET_LEX_STATE(EXPR_BEG);
9702 pushback(p, c);
9703 if (c != -1 && ISDIGIT(c)) {
9704 return tUMINUS_NUM;
9705 }
9706 return tUMINUS;
9707 }
9708 SET_LEX_STATE(EXPR_BEG);
9709 pushback(p, c);
9710 return warn_balanced('-', "-", "unary operator");
9711
9712 case '.': {
9713 int is_beg = IS_BEG();
9714 SET_LEX_STATE(EXPR_BEG);
9715 if ((c = nextc(p)) == '.') {
9716 if ((c = nextc(p)) == '.') {
9717 if (p->ctxt.in_argdef) {
9718 SET_LEX_STATE(EXPR_ENDARG);
9719 return tBDOT3;
9720 }
9721 if (p->lex.paren_nest == 0 && looking_at_eol_p(p)) {
9722 rb_warn0("... at EOL, should be parenthesized?");
9723 }
9724 else if (p->lex.lpar_beg >= 0 && p->lex.lpar_beg+1 == p->lex.paren_nest) {
9725 if (IS_lex_state_for(last_state, EXPR_LABEL))
9726 return tDOT3;
9727 }
9728 return is_beg ? tBDOT3 : tDOT3;
9729 }
9730 pushback(p, c);
9731 return is_beg ? tBDOT2 : tDOT2;
9732 }
9733 pushback(p, c);
9734 if (c != -1 && ISDIGIT(c)) {
9735 char prev = p->lex.pcur-1 > p->lex.pbeg ? *(p->lex.pcur-2) : 0;
9736 parse_numeric(p, '.');
9737 if (ISDIGIT(prev)) {
9738 yyerror0("unexpected fraction part after numeric literal");
9739 }
9740 else {
9741 yyerror0("no .<digit> floating literal anymore; put 0 before dot");
9742 }
9743 SET_LEX_STATE(EXPR_END);
9744 p->lex.ptok = p->lex.pcur;
9745 goto retry;
9746 }
9747 set_yylval_id('.');
9748 SET_LEX_STATE(EXPR_DOT);
9749 return '.';
9750 }
9751
9752 case '0': case '1': case '2': case '3': case '4':
9753 case '5': case '6': case '7': case '8': case '9':
9754 return parse_numeric(p, c);
9755
9756 case ')':
9757 COND_POP();
9758 CMDARG_POP();
9759 SET_LEX_STATE(EXPR_ENDFN);
9760 p->lex.paren_nest--;
9761 return c;
9762
9763 case ']':
9764 COND_POP();
9765 CMDARG_POP();
9766 SET_LEX_STATE(EXPR_END);
9767 p->lex.paren_nest--;
9768 return c;
9769
9770 case '}':
9771 /* tSTRING_DEND does COND_POP and CMDARG_POP in the yacc's rule */
9772 if (!p->lex.brace_nest--) return tSTRING_DEND;
9773 COND_POP();
9774 CMDARG_POP();
9775 SET_LEX_STATE(EXPR_END);
9776 p->lex.paren_nest--;
9777 return c;
9778
9779 case ':':
9780 c = nextc(p);
9781 if (c == ':') {
9782 if (IS_BEG() || IS_lex_state(EXPR_CLASS) || IS_SPCARG(-1)) {
9783 SET_LEX_STATE(EXPR_BEG);
9784 return tCOLON3;
9785 }
9786 set_yylval_id(idCOLON2);
9787 SET_LEX_STATE(EXPR_DOT);
9788 return tCOLON2;
9789 }
9790 if (IS_END() || ISSPACE(c) || c == '#') {
9791 pushback(p, c);
9792 c = warn_balanced(':', ":", "symbol literal");
9793 SET_LEX_STATE(EXPR_BEG);
9794 return c;
9795 }
9796 switch (c) {
9797 case '\'':
9798 p->lex.strterm = NEW_STRTERM(str_ssym, c, 0);
9799 break;
9800 case '"':
9801 p->lex.strterm = NEW_STRTERM(str_dsym, c, 0);
9802 break;
9803 default:
9804 pushback(p, c);
9805 break;
9806 }
9807 SET_LEX_STATE(EXPR_FNAME);
9808 return tSYMBEG;
9809
9810 case '/':
9811 if (IS_BEG()) {
9812 p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0);
9813 return tREGEXP_BEG;
9814 }
9815 if ((c = nextc(p)) == '=') {
9816 set_yylval_id('/');
9817 SET_LEX_STATE(EXPR_BEG);
9818 return tOP_ASGN;
9819 }
9820 pushback(p, c);
9821 if (IS_SPCARG(c)) {
9822 arg_ambiguous(p, '/');
9823 p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0);
9824 return tREGEXP_BEG;
9825 }
9826 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9827 return warn_balanced('/', "/", "regexp literal");
9828
9829 case '^':
9830 if ((c = nextc(p)) == '=') {
9831 set_yylval_id('^');
9832 SET_LEX_STATE(EXPR_BEG);
9833 return tOP_ASGN;
9834 }
9835 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
9836 pushback(p, c);
9837 return '^';
9838
9839 case ';':
9840 SET_LEX_STATE(EXPR_BEG);
9841 p->command_start = TRUE;
9842 return ';';
9843
9844 case ',':
9845 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
9846 return ',';
9847
9848 case '~':
9849 if (IS_AFTER_OPERATOR()) {
9850 if ((c = nextc(p)) != '@') {
9851 pushback(p, c);
9852 }
9853 SET_LEX_STATE(EXPR_ARG);
9854 }
9855 else {
9856 SET_LEX_STATE(EXPR_BEG);
9857 }
9858 return '~';
9859
9860 case '(':
9861 if (IS_BEG()) {
9862 c = tLPAREN;
9863 }
9864 else if (!space_seen) {
9865 /* foo( ... ) => method call, no ambiguity */
9866 }
9867 else if (IS_ARG() || IS_lex_state_all(EXPR_END|EXPR_LABEL)) {
9868 c = tLPAREN_ARG;
9869 }
9870 else if (IS_lex_state(EXPR_ENDFN) && !lambda_beginning_p()) {
9871 rb_warning0("parentheses after method name is interpreted as "
9872 "an argument list, not a decomposed argument");
9873 }
9874 p->lex.paren_nest++;
9875 COND_PUSH(0);
9876 CMDARG_PUSH(0);
9877 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
9878 return c;
9879
9880 case '[':
9881 p->lex.paren_nest++;
9882 if (IS_AFTER_OPERATOR()) {
9883 if ((c = nextc(p)) == ']') {
9884 p->lex.paren_nest--;
9885 SET_LEX_STATE(EXPR_ARG);
9886 if ((c = nextc(p)) == '=') {
9887 return tASET;
9888 }
9889 pushback(p, c);
9890 return tAREF;
9891 }
9892 pushback(p, c);
9893 SET_LEX_STATE(EXPR_ARG|EXPR_LABEL);
9894 return '[';
9895 }
9896 else if (IS_BEG()) {
9897 c = tLBRACK;
9898 }
9899 else if (IS_ARG() && (space_seen || IS_lex_state(EXPR_LABELED))) {
9900 c = tLBRACK;
9901 }
9902 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
9903 COND_PUSH(0);
9904 CMDARG_PUSH(0);
9905 return c;
9906
9907 case '{':
9908 ++p->lex.brace_nest;
9909 if (lambda_beginning_p())
9910 c = tLAMBEG;
9911 else if (IS_lex_state(EXPR_LABELED))
9912 c = tLBRACE; /* hash */
9913 else if (IS_lex_state(EXPR_ARG_ANY | EXPR_END | EXPR_ENDFN))
9914 c = '{'; /* block (primary) */
9915 else if (IS_lex_state(EXPR_ENDARG))
9916 c = tLBRACE_ARG; /* block (expr) */
9917 else
9918 c = tLBRACE; /* hash */
9919 if (c != tLBRACE) {
9920 p->command_start = TRUE;
9921 SET_LEX_STATE(EXPR_BEG);
9922 }
9923 else {
9924 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
9925 }
9926 ++p->lex.paren_nest; /* after lambda_beginning_p() */
9927 COND_PUSH(0);
9928 CMDARG_PUSH(0);
9929 return c;
9930
9931 case '\\':
9932 c = nextc(p);
9933 if (c == '\n') {
9934 space_seen = 1;
9935 dispatch_scan_event(p, tSP);
9936 goto retry; /* skip \\n */
9937 }
9938 if (c == ' ') return tSP;
9939 if (ISSPACE(c)) return c;
9940 pushback(p, c);
9941 return '\\';
9942
9943 case '%':
9944 return parse_percent(p, space_seen, last_state);
9945
9946 case '$':
9947 return parse_gvar(p, last_state);
9948
9949 case '@':
9950 return parse_atmark(p, last_state);
9951
9952 case '_':
9953 if (was_bol(p) && whole_match_p(p, "__END__", 7, 0)) {
9954 p->ruby__end__seen = 1;
9955 p->eofp = 1;
9956 #ifndef RIPPER
9957 return -1;
9958 #else
9959 lex_goto_eol(p);
9960 dispatch_scan_event(p, k__END__);
9961 return 0;
9962 #endif
9963 }
9964 newtok(p);
9965 break;
9966
9967 default:
9968 if (!parser_is_identchar(p)) {
9969 compile_error(p, "Invalid char `\\x%02X' in expression", c);
9970 token_flush(p);
9971 goto retry;
9972 }
9973
9974 newtok(p);
9975 break;
9976 }
9977
9978 return parse_ident(p, c, cmd_state);
9979 }
9980
9981 static enum yytokentype
9982 yylex(YYSTYPE *lval, YYLTYPE *yylloc, struct parser_params *p)
9983 {
9984 enum yytokentype t;
9985
9986 p->lval = lval;
9987 lval->val = Qundef;
9988 t = parser_yylex(p);
9989
9990 if (p->lex.strterm && (p->lex.strterm->flags & STRTERM_HEREDOC))
9991 RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(*yylloc);
9992 else
9993 RUBY_SET_YYLLOC(*yylloc);
9994
9995 if (has_delayed_token(p))
9996 dispatch_delayed_token(p, t);
9997 else if (t != 0)
9998 dispatch_scan_event(p, t);
9999
10000 return t;
10001 }
10002
10003 #define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
10004
10005 static NODE*
10006 node_newnode(struct parser_params *p, enum node_type type, VALUE a0, VALUE a1, VALUE a2, const rb_code_location_t *loc)
10007 {
10008 NODE *n = rb_ast_newnode(p->ast, type);
10009
10010 rb_node_init(n, type, a0, a1, a2);
10011
10012 nd_set_loc(n, loc);
10013 nd_set_node_id(n, parser_get_node_id(p));
10014 return n;
10015 }
10016
10017 static NODE *
10018 nd_set_loc(NODE *nd, const YYLTYPE *loc)
10019 {
10020 nd->nd_loc = *loc;
10021 nd_set_line(nd, loc->beg_pos.lineno);
10022 return nd;
10023 }
10024
10025 #ifndef RIPPER
10026 static enum node_type
10027 nodetype(NODE *node) /* for debug */
10028 {
10029 return (enum node_type)nd_type(node);
10030 }
10031
10032 static int
10033 nodeline(NODE *node)
10034 {
10035 return nd_line(node);
10036 }
10037
10038 static NODE*
10039 newline_node(NODE *node)
10040 {
10041 if (node) {
10042 node = remove_begin(node);
10043 node->flags |= NODE_FL_NEWLINE;
10044 }
10045 return node;
10046 }
10047
10048 static void
10049 fixpos(NODE *node, NODE *orig)
10050 {
10051 if (!node) return;
10052 if (!orig) return;
10053 nd_set_line(node, nd_line(orig));
10054 }
10055
10056 static void
10057 parser_warning(struct parser_params *p, NODE *node, const char *mesg)
10058 {
10059 rb_compile_warning(p->ruby_sourcefile, nd_line(node), "%s", mesg);
10060 }
10061
10062 static void
10063 parser_warn(struct parser_params *p, NODE *node, const char *mesg)
10064 {
10065 rb_compile_warn(p->ruby_sourcefile, nd_line(node), "%s", mesg);
10066 }
10067
10068 static NODE*
10069 block_append(struct parser_params *p, NODE *head, NODE *tail)
10070 {
10071 NODE *end, *h = head, *nd;
10072
10073 if (tail == 0) return head;
10074
10075 if (h == 0) return tail;
10076 switch (nd_type(h)) {
10077 case NODE_LIT:
10078 case NODE_STR:
10079 case NODE_SELF:
10080 case NODE_TRUE:
10081 case NODE_FALSE:
10082 case NODE_NIL:
10083 parser_warning(p, h, "unused literal ignored");
10084 return tail;
10085 default:
10086 h = end = NEW_BLOCK(head, &head->nd_loc);
10087 end->nd_end = end;
10088 head = end;
10089 break;
10090 case NODE_BLOCK:
10091 end = h->nd_end;
10092 break;
10093 }
10094
10095 nd = end->nd_head;
10096 switch (nd_type(nd)) {
10097 case NODE_RETURN:
10098 case NODE_BREAK:
10099 case NODE_NEXT:
10100 case NODE_REDO:
10101 case NODE_RETRY:
10102 if (RTEST(ruby_verbose)) {
10103 parser_warning(p, tail, "statement not reached");
10104 }
10105 break;
10106
10107 default:
10108 break;
10109 }
10110
10111 if (!nd_type_p(tail, NODE_BLOCK)) {
10112 tail = NEW_BLOCK(tail, &tail->nd_loc);
10113 tail->nd_end = tail;
10114 }
10115 end->nd_next = tail;
10116 h->nd_end = tail->nd_end;
10117 nd_set_last_loc(head, nd_last_loc(tail));
10118 return head;
10119 }
10120
10121 /* append item to the list */
10122 static NODE*
10123 list_append(struct parser_params *p, NODE *list, NODE *item)
10124 {
10125 NODE *last;
10126
10127 if (list == 0) return NEW_LIST(item, &item->nd_loc);
10128 if (list->nd_next) {
10129 last = list->nd_next->nd_end;
10130 }
10131 else {
10132 last = list;
10133 }
10134
10135 list->nd_alen += 1;
10136 last->nd_next = NEW_LIST(item, &item->nd_loc);
10137 list->nd_next->nd_end = last->nd_next;
10138
10139 nd_set_last_loc(list, nd_last_loc(item));
10140
10141 return list;
10142 }
10143
10144 /* concat two lists */
10145 static NODE*
10146 list_concat(NODE *head, NODE *tail)
10147 {
10148 NODE *last;
10149
10150 if (head->nd_next) {
10151 last = head->nd_next->nd_end;
10152 }
10153 else {
10154 last = head;
10155 }
10156
10157 head->nd_alen += tail->nd_alen;
10158 last->nd_next = tail;
10159 if (tail->nd_next) {
10160 head->nd_next->nd_end = tail->nd_next->nd_end;
10161 }
10162 else {
10163 head->nd_next->nd_end = tail;
10164 }
10165
10166 nd_set_last_loc(head, nd_last_loc(tail));
10167
10168 return head;
10169 }
10170
10171 static int
10172 literal_concat0(struct parser_params *p, VALUE head, VALUE tail)
10173 {
10174 if (NIL_P(tail)) return 1;
10175 if (!rb_enc_compatible(head, tail)) {
10176 compile_error(p, "string literal encodings differ (%s / %s)",
10177 rb_enc_name(rb_enc_get(head)),
10178 rb_enc_name(rb_enc_get(tail)));
10179 rb_str_resize(head, 0);
10180 rb_str_resize(tail, 0);
10181 return 0;
10182 }
10183 rb_str_buf_append(head, tail);
10184 return 1;
10185 }
10186
10187 static VALUE
10188 string_literal_head(enum node_type htype, NODE *head)
10189 {
10190 if (htype != NODE_DSTR) return Qfalse;
10191 if (head->nd_next) {
10192 head = head->nd_next->nd_end->nd_head;
10193 if (!head || !nd_type_p(head, NODE_STR)) return Qfalse;
10194 }
10195 const VALUE lit = head->nd_lit;
10196 ASSUME(lit != Qfalse);
10197 return lit;
10198 }
10199
10200 /* concat two string literals */
10201 static NODE *
10202 literal_concat(struct parser_params *p, NODE *head, NODE *tail, const YYLTYPE *loc)
10203 {
10204 enum node_type htype;
10205 VALUE lit;
10206
10207 if (!head) return tail;
10208 if (!tail) return head;
10209
10210 htype = nd_type(head);
10211 if (htype == NODE_EVSTR) {
10212 head = new_dstr(p, head, loc);
10213 htype = NODE_DSTR;
10214 }
10215 if (p->heredoc_indent > 0) {
10216 switch (htype) {
10217 case NODE_STR:
10218 nd_set_type(head, NODE_DSTR);
10219 case NODE_DSTR:
10220 return list_append(p, head, tail);
10221 default:
10222 break;
10223 }
10224 }
10225 switch (nd_type(tail)) {
10226 case NODE_STR:
10227 if ((lit = string_literal_head(htype, head)) != Qfalse) {
10228 htype = NODE_STR;
10229 }
10230 else {
10231 lit = head->nd_lit;
10232 }
10233 if (htype == NODE_STR) {
10234 if (!literal_concat0(p, lit, tail->nd_lit)) {
10235 error:
10236 rb_discard_node(p, head);
10237 rb_discard_node(p, tail);
10238 return 0;
10239 }
10240 rb_discard_node(p, tail);
10241 }
10242 else {
10243 list_append(p, head, tail);
10244 }
10245 break;
10246
10247 case NODE_DSTR:
10248 if (htype == NODE_STR) {
10249 if (!literal_concat0(p, head->nd_lit, tail->nd_lit))
10250 goto error;
10251 tail->nd_lit = head->nd_lit;
10252 rb_discard_node(p, head);
10253 head = tail;
10254 }
10255 else if (NIL_P(tail->nd_lit)) {
10256 append:
10257 head->nd_alen += tail->nd_alen - 1;
10258 if (!head->nd_next) {
10259 head->nd_next = tail->nd_next;
10260 }
10261 else if (tail->nd_next) {
10262 head->nd_next->nd_end->nd_next = tail->nd_next;
10263 head->nd_next->nd_end = tail->nd_next->nd_end;
10264 }
10265 rb_discard_node(p, tail);
10266 }
10267 else if ((lit = string_literal_head(htype, head)) != Qfalse) {
10268 if (!literal_concat0(p, lit, tail->nd_lit))
10269 goto error;
10270 tail->nd_lit = Qnil;
10271 goto append;
10272 }
10273 else {
10274 list_concat(head, NEW_NODE(NODE_LIST, NEW_STR(tail->nd_lit, loc), tail->nd_alen, tail->nd_next, loc));
10275 }
10276 break;
10277
10278 case NODE_EVSTR:
10279 if (htype == NODE_STR) {
10280 nd_set_type(head, NODE_DSTR);
10281 head->nd_alen = 1;
10282 }
10283 list_append(p, head, tail);
10284 break;
10285 }
10286 return head;
10287 }
10288
10289 static NODE *
10290 evstr2dstr(struct parser_params *p, NODE *node)
10291 {
10292 if (nd_type_p(node, NODE_EVSTR)) {
10293 node = new_dstr(p, node, &node->nd_loc);
10294 }
10295 return node;
10296 }
10297
10298 static NODE *
10299 new_evstr(struct parser_params *p, NODE *node, const YYLTYPE *loc)
10300 {
10301 NODE *head = node;
10302
10303 if (node) {
10304 switch (nd_type(node)) {
10305 case NODE_STR:
10306 nd_set_type(node, NODE_DSTR);
10307 return node;
10308 case NODE_DSTR:
10309 break;
10310 case NODE_EVSTR:
10311 return node;
10312 }
10313 }
10314 return NEW_EVSTR(head, loc);
10315 }
10316
10317 static NODE *
10318 new_dstr(struct parser_params *p, NODE *node, const YYLTYPE *loc)
10319 {
10320 VALUE lit = STR_NEW0();
10321 NODE *dstr = NEW_DSTR(lit, loc);
10322 RB_OBJ_WRITTEN(p->ast, Qnil, lit);
10323 return list_append(p, dstr, node);
10324 }
10325
10326 static NODE *
10327 call_bin_op(struct parser_params *p, NODE *recv, ID id, NODE *arg1,
10328 const YYLTYPE *op_loc, const YYLTYPE *loc)
10329 {
10330 NODE *expr;
10331 value_expr(recv);
10332 value_expr(arg1);
10333 expr = NEW_OPCALL(recv, id, NEW_LIST(arg1, &arg1->nd_loc), loc);
10334 nd_set_line(expr, op_loc->beg_pos.lineno);
10335 return expr;
10336 }
10337
10338 static NODE *
10339 call_uni_op(struct parser_params *p, NODE *recv, ID id, const YYLTYPE *op_loc, const YYLTYPE *loc)
10340 {
10341 NODE *opcall;
10342 value_expr(recv);
10343 opcall = NEW_OPCALL(recv, id, 0, loc);
10344 nd_set_line(opcall, op_loc->beg_pos.lineno);
10345 return opcall;
10346 }
10347
10348 static NODE *
10349 new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc)
10350 {
10351 NODE *qcall = NEW_QCALL(atype, recv, mid, args, loc);
10352 nd_set_line(qcall, op_loc->beg_pos.lineno);
10353 return qcall;
10354 }
10355
10356 static NODE*
10357 new_command_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, NODE *block, const YYLTYPE *op_loc, const YYLTYPE *loc)
10358 {
10359 NODE *ret;
10360 if (block) block_dup_check(p, args, block);
10361 ret = new_qcall(p, atype, recv, mid, args, op_loc, loc);
10362 if (block) ret = method_add_block(p, ret, block, loc);
10363 fixpos(ret, recv);
10364 return ret;
10365 }
10366
10367 #define nd_once_body(node) (nd_type_p((node), NODE_ONCE) ? (node)->nd_body : node)
10368 static NODE*
10369 match_op(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *op_loc, const YYLTYPE *loc)
10370 {
10371 NODE *n;
10372 int line = op_loc->beg_pos.lineno;
10373
10374 value_expr(node1);
10375 value_expr(node2);
10376 if (node1 && (n = nd_once_body(node1)) != 0) {
10377 switch (nd_type(n)) {
10378 case NODE_DREGX:
10379 {
10380 NODE *match = NEW_MATCH2(node1, node2, loc);
10381 nd_set_line(match, line);
10382 return match;
10383 }
10384
10385 case NODE_LIT:
10386 if (RB_TYPE_P(n->nd_lit, T_REGEXP)) {
10387 const VALUE lit = n->nd_lit;
10388 NODE *match = NEW_MATCH2(node1, node2, loc);
10389 match->nd_args = reg_named_capture_assign(p, lit, loc);
10390 nd_set_line(match, line);
10391 return match;
10392 }
10393 }
10394 }
10395
10396 if (node2 && (n = nd_once_body(node2)) != 0) {
10397 NODE *match3;
10398
10399 switch (nd_type(n)) {
10400 case NODE_LIT:
10401 if (!RB_TYPE_P(n->nd_lit, T_REGEXP)) break;
10402 /* fallthru */
10403 case NODE_DREGX:
10404 match3 = NEW_MATCH3(node2, node1, loc);
10405 return match3;
10406 }
10407 }
10408
10409 n = NEW_CALL(node1, tMATCH, NEW_LIST(node2, &node2->nd_loc), loc);
10410 nd_set_line(n, line);
10411 return n;
10412 }
10413
10414 # if WARN_PAST_SCOPE
10415 static int
10416 past_dvar_p(struct parser_params *p, ID id)
10417 {
10418 struct vtable *past = p->lvtbl->past;
10419 while (past) {
10420 if (vtable_included(past, id)) return 1;
10421 past = past->prev;
10422 }
10423 return 0;
10424 }
10425 # endif
10426
10427 static int
10428 numparam_nested_p(struct parser_params *p)
10429 {
10430 struct local_vars *local = p->lvtbl;
10431 NODE *outer = local->numparam.outer;
10432 NODE *inner = local->numparam.inner;
10433 if (outer || inner) {
10434 NODE *used = outer ? outer : inner;
10435 compile_error(p, "numbered parameter is already used in\n"
10436 "%s:%d: %s block here",
10437 p->ruby_sourcefile, nd_line(used),
10438 outer ? "outer" : "inner");
10439 parser_show_error_line(p, &used->nd_loc);
10440 return 1;
10441 }
10442 return 0;
10443 }
10444
10445 static NODE*
10446 gettable(struct parser_params *p, ID id, const YYLTYPE *loc)
10447 {
10448 ID *vidp = NULL;
10449 NODE *node;
10450 switch (id) {
10451 case keyword_self:
10452 return NEW_SELF(loc);
10453 case keyword_nil:
10454 return NEW_NIL(loc);
10455 case keyword_true:
10456 return NEW_TRUE(loc);
10457 case keyword_false:
10458 return NEW_FALSE(loc);
10459 case keyword__FILE__:
10460 {
10461 VALUE file = p->ruby_sourcefile_string;
10462 if (NIL_P(file))
10463 file = rb_str_new(0, 0);
10464 else
10465 file = rb_str_dup(file);
10466 node = NEW_STR(file, loc);
10467 RB_OBJ_WRITTEN(p->ast, Qnil, file);
10468 }
10469 return node;
10470 case keyword__LINE__:
10471 return NEW_LIT(INT2FIX(p->tokline), loc);
10472 case keyword__ENCODING__:
10473 node = NEW_LIT(rb_enc_from_encoding(p->enc), loc);
10474 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit);
10475 return node;
10476
10477 }
10478 switch (id_type(id)) {
10479 case ID_LOCAL:
10480 if (dyna_in_block(p) && dvar_defined_ref(p, id, &vidp)) {
10481 if (NUMPARAM_ID_P(id) && numparam_nested_p(p)) return 0;
10482 if (id == p->cur_arg) {
10483 compile_error(p, "circular argument reference - %"PRIsWARN, rb_id2str(id));
10484 return 0;
10485 }
10486 if (vidp) *vidp |= LVAR_USED;
10487 node = NEW_DVAR(id, loc);
10488 return node;
10489 }
10490 if (local_id_ref(p, id, &vidp)) {
10491 if (id == p->cur_arg) {
10492 compile_error(p, "circular argument reference - %"PRIsWARN, rb_id2str(id));
10493 return 0;
10494 }
10495 if (vidp) *vidp |= LVAR_USED;
10496 node = NEW_LVAR(id, loc);
10497 return node;
10498 }
10499 if (dyna_in_block(p) && NUMPARAM_ID_P(id) &&
10500 parser_numbered_param(p, NUMPARAM_ID_TO_IDX(id))) {
10501 if (numparam_nested_p(p)) return 0;
10502 node = NEW_DVAR(id, loc);
10503 struct local_vars *local = p->lvtbl;
10504 if (!local->numparam.current) local->numparam.current = node;
10505 return node;
10506 }
10507 # if WARN_PAST_SCOPE
10508 if (!p->ctxt.in_defined && RTEST(ruby_verbose) && past_dvar_p(p, id)) {
10509 rb_warning1("possible reference to past scope - %"PRIsWARN, rb_id2str(id));
10510 }
10511 # endif
10512 /* method call without arguments */
10513 return NEW_VCALL(id, loc);
10514 case ID_GLOBAL:
10515 return NEW_GVAR(id, loc);
10516 case ID_INSTANCE:
10517 return NEW_IVAR(id, loc);
10518 case ID_CONST:
10519 return NEW_CONST(id, loc);
10520 case ID_CLASS:
10521 return NEW_CVAR(id, loc);
10522 }
10523 compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id));
10524 return 0;
10525 }
10526
10527 static NODE *
10528 opt_arg_append(NODE *opt_list, NODE *opt)
10529 {
10530 NODE *opts = opt_list;
10531 opts->nd_loc.end_pos = opt->nd_loc.end_pos;
10532
10533 while (opts->nd_next) {
10534 opts = opts->nd_next;
10535 opts->nd_loc.end_pos = opt->nd_loc.end_pos;
10536 }
10537 opts->nd_next = opt;
10538
10539 return opt_list;
10540 }
10541
10542 static NODE *
10543 kwd_append(NODE *kwlist, NODE *kw)
10544 {
10545 if (kwlist) {
10546 NODE *kws = kwlist;
10547 kws->nd_loc.end_pos = kw->nd_loc.end_pos;
10548 while (kws->nd_next) {
10549 kws = kws->nd_next;
10550 kws->nd_loc.end_pos = kw->nd_loc.end_pos;
10551 }
10552 kws->nd_next = kw;
10553 }
10554 return kwlist;
10555 }
10556
10557 static NODE *
10558 new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc)
10559 {
10560 return NEW_DEFINED(remove_begin_all(expr), loc);
10561 }
10562
10563 static NODE*
10564 symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol)
10565 {
10566 enum node_type type = nd_type(symbol);
10567 switch (type) {
10568 case NODE_DSTR:
10569 nd_set_type(symbol, NODE_DSYM);
10570 break;
10571 case NODE_STR:
10572 nd_set_type(symbol, NODE_LIT);
10573 RB_OBJ_WRITTEN(p->ast, Qnil, symbol->nd_lit = rb_str_intern(symbol->nd_lit));
10574 break;
10575 default:
10576 compile_error(p, "unexpected node as symbol: %s", ruby_node_name(type));
10577 }
10578 return list_append(p, symbols, symbol);
10579 }
10580
10581 static NODE *
10582 new_regexp(struct parser_params *p, NODE *node, int options, const YYLTYPE *loc)
10583 {
10584 NODE *list, *prev;
10585 VALUE lit;
10586
10587 if (!node) {
10588 node = NEW_LIT(reg_compile(p, STR_NEW0(), options), loc);
10589 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit);
10590 return node;
10591 }
10592 switch (nd_type(node)) {
10593 case NODE_STR:
10594 {
10595 VALUE src = node->nd_lit;
10596 nd_set_type(node, NODE_LIT);
10597 nd_set_loc(node, loc);
10598 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit = reg_compile(p, src, options));
10599 }
10600 break;
10601 default:
10602 lit = STR_NEW0();
10603 node = NEW_NODE(NODE_DSTR, lit, 1, NEW_LIST(node, loc), loc);
10604 RB_OBJ_WRITTEN(p->ast, Qnil, lit);
10605 /* fall through */
10606 case NODE_DSTR:
10607 nd_set_type(node, NODE_DREGX);
10608 nd_set_loc(node, loc);
10609 node->nd_cflag = options & RE_OPTION_MASK;
10610 if (!NIL_P(node->nd_lit)) reg_fragment_check(p, node->nd_lit, options);
10611 for (list = (prev = node)->nd_next; list; list = list->nd_next) {
10612 NODE *frag = list->nd_head;
10613 enum node_type type = nd_type(frag);
10614 if (type == NODE_STR || (type == NODE_DSTR && !frag->nd_next)) {
10615 VALUE tail = frag->nd_lit;
10616 if (reg_fragment_check(p, tail, options) && prev && !NIL_P(prev->nd_lit)) {
10617 VALUE lit = prev == node ? prev->nd_lit : prev->nd_head->nd_lit;
10618 if (!literal_concat0(p, lit, tail)) {
10619 return NEW_NIL(loc); /* dummy node on error */
10620 }
10621 rb_str_resize(tail, 0);
10622 prev->nd_next = list->nd_next;
10623 rb_discard_node(p, list->nd_head);
10624 rb_discard_node(p, list);
10625 list = prev;
10626 }
10627 else {
10628 prev = list;
10629 }
10630 }
10631 else {
10632 prev = 0;
10633 }
10634 }
10635 if (!node->nd_next) {
10636 VALUE src = node->nd_lit;
10637 nd_set_type(node, NODE_LIT);
10638 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit = reg_compile(p, src, options));
10639 }
10640 if (options & RE_OPTION_ONCE) {
10641 node = NEW_NODE(NODE_ONCE, 0, node, 0, loc);
10642 }
10643 break;
10644 }
10645 return node;
10646 }
10647
10648 static NODE *
10649 new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc)
10650 {
10651 if (!k) return 0;
10652 return NEW_KW_ARG(0, (k), loc);
10653 }
10654
10655 static NODE *
10656 new_xstring(struct parser_params *p, NODE *node, const YYLTYPE *loc)
10657 {
10658 if (!node) {
10659 VALUE lit = STR_NEW0();
10660 NODE *xstr = NEW_XSTR(lit, loc);
10661 RB_OBJ_WRITTEN(p->ast, Qnil, lit);
10662 return xstr;
10663 }
10664 switch (nd_type(node)) {
10665 case NODE_STR:
10666 nd_set_type(node, NODE_XSTR);
10667 nd_set_loc(node, loc);
10668 break;
10669 case NODE_DSTR:
10670 nd_set_type(node, NODE_DXSTR);
10671 nd_set_loc(node, loc);
10672 break;
10673 default:
10674 node = NEW_NODE(NODE_DXSTR, Qnil, 1, NEW_LIST(node, loc), loc);
10675 break;
10676 }
10677 return node;
10678 }
10679
10680 static void
10681 check_literal_when(struct parser_params *p, NODE *arg, const YYLTYPE *loc)
10682 {
10683 VALUE lit;
10684
10685 if (!arg || !p->case_labels) return;
10686
10687 lit = rb_node_case_when_optimizable_literal(arg);
10688 if (lit == Qundef) return;
10689 if (nd_type_p(arg, NODE_STR)) {
10690 RB_OBJ_WRITTEN(p->ast, Qnil, arg->nd_lit = lit);
10691 }
10692
10693 if (NIL_P(p->case_labels)) {
10694 p->case_labels = rb_obj_hide(rb_hash_new());
10695 }
10696 else {
10697 VALUE line = rb_hash_lookup(p->case_labels, lit);
10698 if (!NIL_P(line)) {
10699 rb_warning1("duplicated `when' clause with line %d is ignored",
10700 WARN_IVAL(line));
10701 return;
10702 }
10703 }
10704 rb_hash_aset(p->case_labels, lit, INT2NUM(p->ruby_sourceline));
10705 }
10706
10707 #else /* !RIPPER */
10708 static int
10709 id_is_var(struct parser_params *p, ID id)
10710 {
10711 if (is_notop_id(id)) {
10712 switch (id & ID_SCOPE_MASK) {
10713 case ID_GLOBAL: case ID_INSTANCE: case ID_CONST: case ID_CLASS:
10714 return 1;
10715 case ID_LOCAL:
10716 if (dyna_in_block(p)) {
10717 if (NUMPARAM_ID_P(id) || dvar_defined(p, id)) return 1;
10718 }
10719 if (local_id(p, id)) return 1;
10720 /* method call without arguments */
10721 return 0;
10722 }
10723 }
10724 compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id));
10725 return 0;
10726 }
10727
10728 static VALUE
10729 new_regexp(struct parser_params *p, VALUE re, VALUE opt, const YYLTYPE *loc)
10730 {
10731 VALUE src = 0, err;
10732 int options = 0;
10733 if (ripper_is_node_yylval(re)) {
10734 src = RNODE(re)->nd_cval;
10735 re = RNODE(re)->nd_rval;
10736 }
10737 if (ripper_is_node_yylval(opt)) {
10738 options = (int)RNODE(opt)->nd_tag;
10739 opt = RNODE(opt)->nd_rval;
10740 }
10741 if (src && NIL_P(parser_reg_compile(p, src, options, &err))) {
10742 compile_error(p, "%"PRIsVALUE, err);
10743 }
10744 return dispatch2(regexp_literal, re, opt);
10745 }
10746 #endif /* !RIPPER */
10747
10748 static inline enum lex_state_e
10749 parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line)
10750 {
10751 if (p->debug) {
10752 ls = rb_parser_trace_lex_state(p, p->lex.state, ls, line);
10753 }
10754 return p->lex.state = ls;
10755 }
10756
10757 #ifndef RIPPER
10758 static const char rb_parser_lex_state_names[][8] = {
10759 "BEG", "END", "ENDARG", "ENDFN", "ARG",
10760 "CMDARG", "MID", "FNAME", "DOT", "CLASS",
10761 "LABEL", "LABELED","FITEM",
10762 };
10763
10764 static VALUE
10765 append_lex_state_name(enum lex_state_e state, VALUE buf)
10766 {
10767 int i, sep = 0;
10768 unsigned int mask = 1;
10769 static const char none[] = "NONE";
10770
10771 for (i = 0; i < EXPR_MAX_STATE; ++i, mask <<= 1) {
10772 if ((unsigned)state & mask) {
10773 if (sep) {
10774 rb_str_cat(buf, "|", 1);
10775 }
10776 sep = 1;
10777 rb_str_cat_cstr(buf, rb_parser_lex_state_names[i]);
10778 }
10779 }
10780 if (!sep) {
10781 rb_str_cat(buf, none, sizeof(none)-1);
10782 }
10783 return buf;
10784 }
10785
10786 static void
10787 flush_debug_buffer(struct parser_params *p, VALUE out, VALUE str)
10788 {
10789 VALUE mesg = p->debug_buffer;
10790
10791 if (!NIL_P(mesg) && RSTRING_LEN(mesg)) {
10792 p->debug_buffer = Qnil;
10793 rb_io_puts(1, &mesg, out);
10794 }
10795 if (!NIL_P(str) && RSTRING_LEN(str)) {
10796 rb_io_write(p->debug_output, str);
10797 }
10798 }
10799
10800 enum lex_state_e
10801 rb_parser_trace_lex_state(struct parser_params *p, enum lex_state_e from,
10802 enum lex_state_e to, int line)
10803 {
10804 VALUE mesg;
10805 mesg = rb_str_new_cstr("lex_state: ");
10806 append_lex_state_name(from, mesg);
10807 rb_str_cat_cstr(mesg, " -> ");
10808 append_lex_state_name(to, mesg);
10809 rb_str_catf(mesg, " at line %d\n", line);
10810 flush_debug_buffer(p, p->debug_output, mesg);
10811 return to;
10812 }
10813
10814 VALUE
10815 rb_parser_lex_state_name(enum lex_state_e state)
10816 {
10817 return rb_fstring(append_lex_state_name(state, rb_str_new(0, 0)));
10818 }
10819
10820 static void
10821 append_bitstack_value(stack_type stack, VALUE mesg)
10822 {
10823 if (stack == 0) {
10824 rb_str_cat_cstr(mesg, "0");
10825 }
10826 else {
10827 stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
10828 for (; mask && !(stack & mask); mask >>= 1) continue;
10829 for (; mask; mask >>= 1) rb_str_cat(mesg, stack & mask ? "1" : "0", 1);
10830 }
10831 }
10832
10833 void
10834 rb_parser_show_bitstack(struct parser_params *p, stack_type stack,
10835 const char *name, int line)
10836 {
10837 VALUE mesg = rb_sprintf("%s: ", name);
10838 append_bitstack_value(stack, mesg);
10839 rb_str_catf(mesg, " at line %d\n", line);
10840 flush_debug_buffer(p, p->debug_output, mesg);
10841 }
10842
10843 void
10844 rb_parser_fatal(struct parser_params *p, const char *fmt, ...)
10845 {
10846 va_list ap;
10847 VALUE mesg = rb_str_new_cstr("internal parser error: ");
10848
10849 va_start(ap, fmt);
10850 rb_str_vcatf(mesg, fmt, ap);
10851 va_end(ap);
10852 yyerror0(RSTRING_PTR(mesg));
10853 RB_GC_GUARD(mesg);
10854
10855 mesg = rb_str_new(0, 0);
10856 append_lex_state_name(p->lex.state, mesg);
10857 compile_error(p, "lex.state: %"PRIsVALUE, mesg);
10858 rb_str_resize(mesg, 0);
10859 append_bitstack_value(p->cond_stack, mesg);
10860 compile_error(p, "cond_stack: %"PRIsVALUE, mesg);
10861 rb_str_resize(mesg, 0);
10862 append_bitstack_value(p->cmdarg_stack, mesg);
10863 compile_error(p, "cmdarg_stack: %"PRIsVALUE, mesg);
10864 if (p->debug_output == rb_ractor_stdout())
10865 p->debug_output = rb_ractor_stderr();
10866 p->debug = TRUE;
10867 }
10868
10869 static YYLTYPE *
10870 rb_parser_set_pos(YYLTYPE *yylloc, int sourceline, int beg_pos, int end_pos)
10871 {
10872 yylloc->beg_pos.lineno = sourceline;
10873 yylloc->beg_pos.column = beg_pos;
10874 yylloc->end_pos.lineno = sourceline;
10875 yylloc->end_pos.column = end_pos;
10876 return yylloc;
10877 }
10878
10879 YYLTYPE *
10880 rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc)
10881 {
10882 int sourceline = here->sourceline;
10883 int beg_pos = (int)here->offset - here->quote
10884 - (rb_strlen_lit("<<-") - !(here->func & STR_FUNC_INDENT));
10885 int end_pos = (int)here->offset + here->length + here->quote;
10886
10887 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
10888 }
10889
10890 YYLTYPE *
10891 rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc)
10892 {
10893 int sourceline = p->ruby_sourceline;
10894 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
10895 int end_pos = (int)(p->lex.ptok - p->lex.pbeg);
10896 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
10897 }
10898
10899 YYLTYPE *
10900 rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc)
10901 {
10902 int sourceline = p->ruby_sourceline;
10903 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
10904 int end_pos = (int)(p->lex.pcur - p->lex.pbeg);
10905 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
10906 }
10907 #endif /* !RIPPER */
10908
10909 static int
10910 assignable0(struct parser_params *p, ID id, const char **err)
10911 {
10912 if (!id) return -1;
10913 switch (id) {
10914 case keyword_self:
10915 *err = "Can't change the value of self";
10916 return -1;
10917 case keyword_nil:
10918 *err = "Can't assign to nil";
10919 return -1;
10920 case keyword_true:
10921 *err = "Can't assign to true";
10922 return -1;
10923 case keyword_false:
10924 *err = "Can't assign to false";
10925 return -1;
10926 case keyword__FILE__:
10927 *err = "Can't assign to __FILE__";
10928 return -1;
10929 case keyword__LINE__:
10930 *err = "Can't assign to __LINE__";
10931 return -1;
10932 case keyword__ENCODING__:
10933 *err = "Can't assign to __ENCODING__";
10934 return -1;
10935 }
10936 switch (id_type(id)) {
10937 case ID_LOCAL:
10938 if (dyna_in_block(p)) {
10939 if (p->max_numparam > NO_PARAM && NUMPARAM_ID_P(id)) {
10940 compile_error(p, "Can't assign to numbered parameter _%d",
10941 NUMPARAM_ID_TO_IDX(id));
10942 return -1;
10943 }
10944 if (dvar_curr(p, id)) return NODE_DASGN;
10945 if (dvar_defined(p, id)) return NODE_DASGN;
10946 if (local_id(p, id)) return NODE_LASGN;
10947 dyna_var(p, id);
10948 return NODE_DASGN;
10949 }
10950 else {
10951 if (!local_id(p, id)) local_var(p, id);
10952 return NODE_LASGN;
10953 }
10954 break;
10955 case ID_GLOBAL: return NODE_GASGN;
10956 case ID_INSTANCE: return NODE_IASGN;
10957 case ID_CONST:
10958 if (!p->ctxt.in_def) return NODE_CDECL;
10959 *err = "dynamic constant assignment";
10960 return -1;
10961 case ID_CLASS: return NODE_CVASGN;
10962 default:
10963 compile_error(p, "identifier %"PRIsVALUE" is not valid to set", rb_id2str(id));
10964 }
10965 return -1;
10966 }
10967
10968 #ifndef RIPPER
10969 static NODE*
10970 assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc)
10971 {
10972 const char *err = 0;
10973 int node_type = assignable0(p, id, &err);
10974 switch (node_type) {
10975 case NODE_DASGN: return NEW_DASGN(id, val, loc);
10976 case NODE_LASGN: return NEW_LASGN(id, val, loc);
10977 case NODE_GASGN: return NEW_GASGN(id, val, loc);
10978 case NODE_IASGN: return NEW_IASGN(id, val, loc);
10979 case NODE_CDECL: return NEW_CDECL(id, val, 0, loc);
10980 case NODE_CVASGN: return NEW_CVASGN(id, val, loc);
10981 }
10982 if (err) yyerror1(loc, err);
10983 return NEW_BEGIN(0, loc);
10984 }
10985 #else
10986 static VALUE
10987 assignable(struct parser_params *p, VALUE lhs)
10988 {
10989 const char *err = 0;
10990 assignable0(p, get_id(lhs), &err);
10991 if (err) lhs = assign_error(p, err, lhs);
10992 return lhs;
10993 }
10994 #endif
10995
10996 static int
10997 is_private_local_id(ID name)
10998 {
10999 VALUE s;
11000 if (name == idUScore) return 1;
11001 if (!is_local_id(name)) return 0;
11002 s = rb_id2str(name);
11003 if (!s) return 0;
11004 return RSTRING_PTR(s)[0] == '_';
11005 }
11006
11007 static int
11008 shadowing_lvar_0(struct parser_params *p, ID name)
11009 {
11010 if (is_private_local_id(name)) return 1;
11011 if (dyna_in_block(p)) {
11012 if (dvar_curr(p, name)) {
11013 yyerror0("duplicated argument name");
11014 }
11015 else if (dvar_defined(p, name) || local_id(p, name)) {
11016 vtable_add(p->lvtbl->vars, name);
11017 if (p->lvtbl->used) {
11018 vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline | LVAR_USED);
11019 }
11020 return 0;
11021 }
11022 }
11023 else {
11024 if (local_id(p, name)) {
11025 yyerror0("duplicated argument name");
11026 }
11027 }
11028 return 1;
11029 }
11030
11031 static ID
11032 shadowing_lvar(struct parser_params *p, ID name)
11033 {
11034 shadowing_lvar_0(p, name);
11035 return name;
11036 }
11037
11038 static void
11039 new_bv(struct parser_params *p, ID name)
11040 {
11041 if (!name) return;
11042 if (!is_local_id(name)) {
11043 compile_error(p, "invalid local variable - %"PRIsVALUE,
11044 rb_id2str(name));
11045 return;
11046 }
11047 if (!shadowing_lvar_0(p, name)) return;
11048 dyna_var(p, name);
11049 }
11050
11051 #ifndef RIPPER
11052 static NODE *
11053 aryset(struct parser_params *p, NODE *recv, NODE *idx, const YYLTYPE *loc)
11054 {
11055 return NEW_ATTRASGN(recv, tASET, idx, loc);
11056 }
11057
11058 static void
11059 block_dup_check(struct parser_params *p, NODE *node1, NODE *node2)
11060 {
11061 if (node2 && node1 && nd_type_p(node1, NODE_BLOCK_PASS)) {
11062 compile_error(p, "both block arg and actual block given");
11063 }
11064 }
11065
11066 static NODE *
11067 attrset(struct parser_params *p, NODE *recv, ID atype, ID id, const YYLTYPE *loc)
11068 {
11069 if (!CALL_Q_P(atype)) id = rb_id_attrset(id);
11070 return NEW_ATTRASGN(recv, id, 0, loc);
11071 }
11072
11073 static void
11074 rb_backref_error(struct parser_params *p, NODE *node)
11075 {
11076 switch (nd_type(node)) {
11077 case NODE_NTH_REF:
11078 compile_error(p, "Can't set variable $%ld", node->nd_nth);
11079 break;
11080 case NODE_BACK_REF:
11081 compile_error(p, "Can't set variable $%c", (int)node->nd_nth);
11082 break;
11083 }
11084 }
11085 #else
11086 static VALUE
11087 backref_error(struct parser_params *p, NODE *ref, VALUE expr)
11088 {
11089 VALUE mesg = rb_str_new_cstr("Can't set variable ");
11090 rb_str_append(mesg, ref->nd_cval);
11091 return dispatch2(assign_error, mesg, expr);
11092 }
11093 #endif
11094
11095 #ifndef RIPPER
11096 static NODE *
11097 arg_append(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc)
11098 {
11099 if (!node1) return NEW_LIST(node2, &node2->nd_loc);
11100 switch (nd_type(node1)) {
11101 case NODE_LIST:
11102 return list_append(p, node1, node2);
11103 case NODE_BLOCK_PASS:
11104 node1->nd_head = arg_append(p, node1->nd_head, node2, loc);
11105 node1->nd_loc.end_pos = node1->nd_head->nd_loc.end_pos;
11106 return node1;
11107 case NODE_ARGSPUSH:
11108 node1->nd_body = list_append(p, NEW_LIST(node1->nd_body, &node1->nd_body->nd_loc), node2);
11109 node1->nd_loc.end_pos = node1->nd_body->nd_loc.end_pos;
11110 nd_set_type(node1, NODE_ARGSCAT);
11111 return node1;
11112 case NODE_ARGSCAT:
11113 if (!nd_type_p(node1->nd_body, NODE_LIST)) break;
11114 node1->nd_body = list_append(p, node1->nd_body, node2);
11115 node1->nd_loc.end_pos = node1->nd_body->nd_loc.end_pos;
11116 return node1;
11117 }
11118 return NEW_ARGSPUSH(node1, node2, loc);
11119 }
11120
11121 static NODE *
11122 arg_concat(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc)
11123 {
11124 if (!node2) return node1;
11125 switch (nd_type(node1)) {
11126 case NODE_BLOCK_PASS:
11127 if (node1->nd_head)
11128 node1->nd_head = arg_concat(p, node1->nd_head, node2, loc);
11129 else
11130 node1->nd_head = NEW_LIST(node2, loc);
11131 return node1;
11132 case NODE_ARGSPUSH:
11133 if (!nd_type_p(node2, NODE_LIST)) break;
11134 node1->nd_body = list_concat(NEW_LIST(node1->nd_body, loc), node2);
11135 nd_set_type(node1, NODE_ARGSCAT);
11136 return node1;
11137 case NODE_ARGSCAT:
11138 if (!nd_type_p(node2, NODE_LIST) ||
11139 !nd_type_p(node1->nd_body, NODE_LIST)) break;
11140 node1->nd_body = list_concat(node1->nd_body, node2);
11141 return node1;
11142 }
11143 return NEW_ARGSCAT(node1, node2, loc);
11144 }
11145
11146 static NODE *
11147 last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc)
11148 {
11149 NODE *n1;
11150 if ((n1 = splat_array(args)) != 0) {
11151 return list_append(p, n1, last_arg);
11152 }
11153 return arg_append(p, args, last_arg, loc);
11154 }
11155
11156 static NODE *
11157 rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc)
11158 {
11159 NODE *n1;
11160 if ((nd_type_p(rest_arg, NODE_LIST)) && (n1 = splat_array(args)) != 0) {
11161 return list_concat(n1, rest_arg);
11162 }
11163 return arg_concat(p, args, rest_arg, loc);
11164 }
11165
11166 static NODE *
11167 splat_array(NODE* node)
11168 {
11169 if (nd_type_p(node, NODE_SPLAT)) node = node->nd_head;
11170 if (nd_type_p(node, NODE_LIST)) return node;
11171 return 0;
11172 }
11173
11174 static void
11175 mark_lvar_used(struct parser_params *p, NODE *rhs)
11176 {
11177 ID *vidp = NULL;
11178 if (!rhs) return;
11179 switch (nd_type(rhs)) {
11180 case NODE_LASGN:
11181 if (local_id_ref(p, rhs->nd_vid, &vidp)) {
11182 if (vidp) *vidp |= LVAR_USED;
11183 }
11184 break;
11185 case NODE_DASGN:
11186 if (dvar_defined_ref(p, rhs->nd_vid, &vidp)) {
11187 if (vidp) *vidp |= LVAR_USED;
11188 }
11189 break;
11190 #if 0
11191 case NODE_MASGN:
11192 for (rhs = rhs->nd_head; rhs; rhs = rhs->nd_next) {
11193 mark_lvar_used(p, rhs->nd_head);
11194 }
11195 break;
11196 #endif
11197 }
11198 }
11199
11200 static NODE *
11201 const_decl_path(struct parser_params *p, NODE **dest)
11202 {
11203 NODE *n = *dest;
11204 if (!nd_type_p(n, NODE_CALL)) {
11205 const YYLTYPE *loc = &n->nd_loc;
11206 VALUE path;
11207 if (n->nd_vid) {
11208 path = rb_id2str(n->nd_vid);
11209 }
11210 else {
11211 n = n->nd_else;
11212 path = rb_ary_new();
11213 for (; n && nd_type_p(n, NODE_COLON2); n = n->nd_head) {
11214 rb_ary_push(path, rb_id2str(n->nd_mid));
11215 }
11216 if (n && nd_type_p(n, NODE_CONST)) {
11217 // Const::Name
11218 rb_ary_push(path, rb_id2str(n->nd_vid));
11219 }
11220 else if (n && nd_type_p(n, NODE_COLON3)) {
11221 // ::Const::Name
11222 rb_ary_push(path, rb_str_new(0, 0));
11223 }
11224 else {
11225 // expression::Name
11226 rb_ary_push(path, rb_str_new_cstr("..."));
11227 }
11228 path = rb_ary_join(rb_ary_reverse(path), rb_str_new_cstr("::"));
11229 path = rb_fstring(path);
11230 }
11231 *dest = n = NEW_LIT(path, loc);
11232 RB_OBJ_WRITTEN(p->ast, Qnil, n->nd_lit);
11233 }
11234 return n;
11235 }
11236
11237 extern VALUE rb_mRubyVMFrozenCore;
11238
11239 static NODE *
11240 make_shareable_node(struct parser_params *p, NODE *value, bool copy, const YYLTYPE *loc)
11241 {
11242 NODE *fcore = NEW_LIT(rb_mRubyVMFrozenCore, loc);
11243
11244 if (copy) {
11245 return NEW_CALL(fcore, rb_intern("make_shareable_copy"),
11246 NEW_LIST(value, loc), loc);
11247 }
11248 else {
11249 return NEW_CALL(fcore, rb_intern("make_shareable"),
11250 NEW_LIST(value, loc), loc);
11251 }
11252 }
11253
11254 static NODE *
11255 ensure_shareable_node(struct parser_params *p, NODE **dest, NODE *value, const YYLTYPE *loc)
11256 {
11257 NODE *fcore = NEW_LIT(rb_mRubyVMFrozenCore, loc);
11258 NODE *args = NEW_LIST(value, loc);
11259 args = list_append(p, args, const_decl_path(p, dest));
11260 return NEW_CALL(fcore, rb_intern("ensure_shareable"), args, loc);
11261 }
11262
11263 static int is_static_content(NODE *node);
11264
11265 static VALUE
11266 shareable_literal_value(NODE *node)
11267 {
11268 if (!node) return Qnil;
11269 enum node_type type = nd_type(node);
11270 switch (type) {
11271 case NODE_TRUE:
11272 return Qtrue;
11273 case NODE_FALSE:
11274 return Qfalse;
11275 case NODE_NIL:
11276 return Qnil;
11277 case NODE_LIT:
11278 return node->nd_lit;
11279 default:
11280 return Qundef;
11281 }
11282 }
11283
11284 #ifndef SHAREABLE_BARE_EXPRESSION
11285 #define SHAREABLE_BARE_EXPRESSION 1
11286 #endif
11287
11288 static NODE *
11289 shareable_literal_constant(struct parser_params *p, enum shareability shareable,
11290 NODE **dest, NODE *value, const YYLTYPE *loc, size_t level)
11291 {
11292 # define shareable_literal_constant_next(n) \
11293 shareable_literal_constant(p, shareable, dest, (n), &(n)->nd_loc, level+1)
11294 VALUE lit = Qnil;
11295
11296 if (!value) return 0;
11297 enum node_type type = nd_type(value);
11298 switch (type) {
11299 case NODE_TRUE:
11300 case NODE_FALSE:
11301 case NODE_NIL:
11302 case NODE_LIT:
11303 return value;
11304
11305 case NODE_DSTR:
11306 if (shareable == shareable_literal) {
11307 value = NEW_CALL(value, idUMinus, 0, loc);
11308 }
11309 return value;
11310
11311 case NODE_STR:
11312 lit = rb_fstring(value->nd_lit);
11313 nd_set_type(value, NODE_LIT);
11314 RB_OBJ_WRITE(p->ast, &value->nd_lit, lit);
11315 return value;
11316
11317 case NODE_ZLIST:
11318 lit = rb_ary_new();
11319 OBJ_FREEZE_RAW(lit);
11320 NODE *n = NEW_LIT(lit, loc);
11321 RB_OBJ_WRITTEN(p->ast, Qnil, n->nd_lit);
11322 return n;
11323
11324 case NODE_LIST:
11325 lit = rb_ary_new();
11326 for (NODE *n = value; n; n = n->nd_next) {
11327 NODE *elt = n->nd_head;
11328 if (elt) {
11329 elt = shareable_literal_constant_next(elt);
11330 if (elt) {
11331 n->nd_head = elt;
11332 }
11333 else if (RTEST(lit)) {
11334 rb_ary_clear(lit);
11335 lit = Qfalse;
11336 }
11337 }
11338 if (RTEST(lit)) {
11339 VALUE e = shareable_literal_value(elt);
11340 if (e != Qundef) {
11341 rb_ary_push(lit, e);
11342 }
11343 else {
11344 rb_ary_clear(lit);
11345 lit = Qnil; /* make shareable at runtime */
11346 }
11347 }
11348 }
11349 break;
11350
11351 case NODE_HASH:
11352 if (!value->nd_brace) return 0;
11353 lit = rb_hash_new();
11354 for (NODE *n = value->nd_head; n; n = n->nd_next->nd_next) {
11355 NODE *key = n->nd_head;
11356 NODE *val = n->nd_next->nd_head;
11357 if (key) {
11358 key = shareable_literal_constant_next(key);
11359 if (key) {
11360 n->nd_head = key;
11361 }
11362 else if (RTEST(lit)) {
11363 rb_hash_clear(lit);
11364 lit = Qfalse;
11365 }
11366 }
11367 if (val) {
11368 val = shareable_literal_constant_next(val);
11369 if (val) {
11370 n->nd_next->nd_head = val;
11371 }
11372 else if (RTEST(lit)) {
11373 rb_hash_clear(lit);
11374 lit = Qfalse;
11375 }
11376 }
11377 if (RTEST(lit)) {
11378 VALUE k = shareable_literal_value(key);
11379 VALUE v = shareable_literal_value(val);
11380 if (k != Qundef && v != Qundef) {
11381 rb_hash_aset(lit, k, v);
11382 }
11383 else {
11384 rb_hash_clear(lit);
11385 lit = Qnil; /* make shareable at runtime */
11386 }
11387 }
11388 }
11389 break;
11390
11391 default:
11392 if (shareable == shareable_literal &&
11393 (SHAREABLE_BARE_EXPRESSION || level > 0)) {
11394 return ensure_shareable_node(p, dest, value, loc);
11395 }
11396 return 0;
11397 }
11398
11399 /* Array or Hash */
11400 if (!lit) return 0;
11401 if (NIL_P(lit)) {
11402 // if shareable_literal, all elements should have been ensured
11403 // as shareable
11404 value = make_shareable_node(p, value, false, loc);
11405 }
11406 else {
11407 value = NEW_LIT(rb_ractor_make_shareable(lit), loc);
11408 RB_OBJ_WRITTEN(p->ast, Qnil, value->nd_lit);
11409 }
11410
11411 return value;
11412 # undef shareable_literal_constant_next
11413 }
11414
11415 static NODE *
11416 shareable_constant_value(struct parser_params *p, enum shareability shareable,
11417 NODE *lhs, NODE *value, const YYLTYPE *loc)
11418 {
11419 if (!value) return 0;
11420 switch (shareable) {
11421 case shareable_none:
11422 return value;
11423
11424 case shareable_literal:
11425 {
11426 NODE *lit = shareable_literal_constant(p, shareable, &lhs, value, loc, 0);
11427 if (lit) return lit;
11428 return value;
11429 }
11430 break;
11431
11432 case shareable_copy:
11433 case shareable_everything:
11434 {
11435 NODE *lit = shareable_literal_constant(p, shareable, &lhs, value, loc, 0);
11436 if (lit) return lit;
11437 return make_shareable_node(p, value, shareable == shareable_copy, loc);
11438 }
11439 break;
11440
11441 default:
11442 UNREACHABLE_RETURN(0);
11443 }
11444 }
11445
11446 static NODE *
11447 node_assign(struct parser_params *p, NODE *lhs, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
11448 {
11449 if (!lhs) return 0;
11450
11451 switch (nd_type(lhs)) {
11452 case NODE_CDECL:
11453 rhs = shareable_constant_value(p, ctxt.shareable_constant_value, lhs, rhs, loc);
11454 /* fallthru */
11455
11456 case NODE_GASGN:
11457 case NODE_IASGN:
11458 case NODE_LASGN:
11459 case NODE_DASGN:
11460 case NODE_MASGN:
11461 case NODE_CVASGN:
11462 lhs->nd_value = rhs;
11463 nd_set_loc(lhs, loc);
11464 break;
11465
11466 case NODE_ATTRASGN:
11467 lhs->nd_args = arg_append(p, lhs->nd_args, rhs, loc);
11468 nd_set_loc(lhs, loc);
11469 break;
11470
11471 default:
11472 /* should not happen */
11473 break;
11474 }
11475
11476 return lhs;
11477 }
11478
11479 static NODE *
11480 value_expr_check(struct parser_params *p, NODE *node)
11481 {
11482 NODE *void_node = 0, *vn;
11483
11484 if (!node) {
11485 rb_warning0("empty expression");
11486 }
11487 while (node) {
11488 switch (nd_type(node)) {
11489 case NODE_RETURN:
11490 case NODE_BREAK:
11491 case NODE_NEXT:
11492 case NODE_REDO:
11493 case NODE_RETRY:
11494 return void_node ? void_node : node;
11495
11496 case NODE_CASE3:
11497 if (!node->nd_body || !nd_type_p(node->nd_body, NODE_IN)) {
11498 compile_error(p, "unexpected node");
11499 return NULL;
11500 }
11501 if (node->nd_body->nd_body) {
11502 return NULL;
11503 }
11504 /* single line pattern matching */
11505 return void_node ? void_node : node;
11506
11507 case NODE_BLOCK:
11508 while (node->nd_next) {
11509 node = node->nd_next;
11510 }
11511 node = node->nd_head;
11512 break;
11513
11514 case NODE_BEGIN:
11515 node = node->nd_body;
11516 break;
11517
11518 case NODE_IF:
11519 case NODE_UNLESS:
11520 if (!node->nd_body) {
11521 return NULL;
11522 }
11523 else if (!node->nd_else) {
11524 return NULL;
11525 }
11526 vn = value_expr_check(p, node->nd_body);
11527 if (!vn) return NULL;
11528 if (!void_node) void_node = vn;
11529 node = node->nd_else;
11530 break;
11531
11532 case NODE_AND:
11533 case NODE_OR:
11534 node = node->nd_1st;
11535 break;
11536
11537 case NODE_LASGN:
11538 case NODE_DASGN:
11539 case NODE_MASGN:
11540 mark_lvar_used(p, node);
11541 return NULL;
11542
11543 default:
11544 return NULL;
11545 }
11546 }
11547
11548 return NULL;
11549 }
11550
11551 static int
11552 value_expr_gen(struct parser_params *p, NODE *node)
11553 {
11554 NODE *void_node = value_expr_check(p, node);
11555 if (void_node) {
11556 yyerror1(&void_node->nd_loc, "void value expression");
11557 /* or "control never reach"? */
11558 return FALSE;
11559 }
11560 return TRUE;
11561 }
11562 static void
11563 void_expr(struct parser_params *p, NODE *node)
11564 {
11565 const char *useless = 0;
11566
11567 if (!RTEST(ruby_verbose)) return;
11568
11569 if (!node || !(node = nd_once_body(node))) return;
11570 switch (nd_type(node)) {
11571 case NODE_OPCALL:
11572 switch (node->nd_mid) {
11573 case '+':
11574 case '-':
11575 case '*':
11576 case '/':
11577 case '%':
11578 case tPOW:
11579 case tUPLUS:
11580 case tUMINUS:
11581 case '|':
11582 case '^':
11583 case '&':
11584 case tCMP:
11585 case '>':
11586 case tGEQ:
11587 case '<':
11588 case tLEQ:
11589 case tEQ:
11590 case tNEQ:
11591 useless = rb_id2name(node->nd_mid);
11592 break;
11593 }
11594 break;
11595
11596 case NODE_LVAR:
11597 case NODE_DVAR:
11598 case NODE_GVAR:
11599 case NODE_IVAR:
11600 case NODE_CVAR:
11601 case NODE_NTH_REF:
11602 case NODE_BACK_REF:
11603 useless = "a variable";
11604 break;
11605 case NODE_CONST:
11606 useless = "a constant";
11607 break;
11608 case NODE_LIT:
11609 case NODE_STR:
11610 case NODE_DSTR:
11611 case NODE_DREGX:
11612 useless = "a literal";
11613 break;
11614 case NODE_COLON2:
11615 case NODE_COLON3:
11616 useless = "::";
11617 break;
11618 case NODE_DOT2:
11619 useless = "..";
11620 break;
11621 case NODE_DOT3:
11622 useless = "...";
11623 break;
11624 case NODE_SELF:
11625 useless = "self";
11626 break;
11627 case NODE_NIL:
11628 useless = "nil";
11629 break;
11630 case NODE_TRUE:
11631 useless = "true";
11632 break;
11633 case NODE_FALSE:
11634 useless = "false";
11635 break;
11636 case NODE_DEFINED:
11637 useless = "defined?";
11638 break;
11639 }
11640
11641 if (useless) {
11642 rb_warn1L(nd_line(node), "possibly useless use of %s in void context", WARN_S(useless));
11643 }
11644 }
11645
11646 static NODE *
11647 void_stmts(struct parser_params *p, NODE *node)
11648 {
11649 NODE *const n = node;
11650 if (!RTEST(ruby_verbose)) return n;
11651 if (!node) return n;
11652 if (!nd_type_p(node, NODE_BLOCK)) return n;
11653
11654 while (node->nd_next) {
11655 void_expr(p, node->nd_head);
11656 node = node->nd_next;
11657 }
11658 return n;
11659 }
11660
11661 static NODE *
11662 remove_begin(NODE *node)
11663 {
11664 NODE **n = &node, *n1 = node;
11665 while (n1 && nd_type_p(n1, NODE_BEGIN) && n1->nd_body) {
11666 *n = n1 = n1->nd_body;
11667 }
11668 return node;
11669 }
11670
11671 static NODE *
11672 remove_begin_all(NODE *node)
11673 {
11674 NODE **n = &node, *n1 = node;
11675 while (n1 && nd_type_p(n1, NODE_BEGIN)) {
11676 *n = n1 = n1->nd_body;
11677 }
11678 return node;
11679 }
11680
11681 static void
11682 reduce_nodes(struct parser_params *p, NODE **body)
11683 {
11684 NODE *node = *body;
11685
11686 if (!node) {
11687 *body = NEW_NIL(&NULL_LOC);
11688 return;
11689 }
11690 #define subnodes(n1, n2) \
11691 ((!node->n1) ? (node->n2 ? (body = &node->n2, 1) : 0) : \
11692 (!node->n2) ? (body = &node->n1, 1) : \
11693 (reduce_nodes(p, &node->n1), body = &node->n2, 1))
11694
11695 while (node) {
11696 int newline = (int)(node->flags & NODE_FL_NEWLINE);
11697 switch (nd_type(node)) {
11698 end:
11699 case NODE_NIL:
11700 *body = 0;
11701 return;
11702 case NODE_RETURN:
11703 *body = node = node->nd_stts;
11704 if (newline && node) node->flags |= NODE_FL_NEWLINE;
11705 continue;
11706 case NODE_BEGIN:
11707 *body = node = node->nd_body;
11708 if (newline && node) node->flags |= NODE_FL_NEWLINE;
11709 continue;
11710 case NODE_BLOCK:
11711 body = &node->nd_end->nd_head;
11712 break;
11713 case NODE_IF:
11714 case NODE_UNLESS:
11715 if (subnodes(nd_body, nd_else)) break;
11716 return;
11717 case NODE_CASE:
11718 body = &node->nd_body;
11719 break;
11720 case NODE_WHEN:
11721 if (!subnodes(nd_body, nd_next)) goto end;
11722 break;
11723 case NODE_ENSURE:
11724 if (!subnodes(nd_head, nd_resq)) goto end;
11725 break;
11726 case NODE_RESCUE:
11727 if (node->nd_else) {
11728 body = &node->nd_resq;
11729 break;
11730 }
11731 if (!subnodes(nd_head, nd_resq)) goto end;
11732 break;
11733 default:
11734 return;
11735 }
11736 node = *body;
11737 if (newline && node) node->flags |= NODE_FL_NEWLINE;
11738 }
11739
11740 #undef subnodes
11741 }
11742
11743 static int
11744 is_static_content(NODE *node)
11745 {
11746 if (!node) return 1;
11747 switch (nd_type(node)) {
11748 case NODE_HASH:
11749 if (!(node = node->nd_head)) break;
11750 case NODE_LIST:
11751 do {
11752 if (!is_static_content(node->nd_head)) return 0;
11753 } while ((node = node->nd_next) != 0);
11754 case NODE_LIT:
11755 case NODE_STR:
11756 case NODE_NIL:
11757 case NODE_TRUE:
11758 case NODE_FALSE:
11759 case NODE_ZLIST:
11760 break;
11761 default:
11762 return 0;
11763 }
11764 return 1;
11765 }
11766
11767 static int
11768 assign_in_cond(struct parser_params *p, NODE *node)
11769 {
11770 switch (nd_type(node)) {
11771 case NODE_MASGN:
11772 case NODE_LASGN:
11773 case NODE_DASGN:
11774 case NODE_GASGN:
11775 case NODE_IASGN:
11776 break;
11777
11778 default:
11779 return 0;
11780 }
11781
11782 if (!node->nd_value) return 1;
11783 if (is_static_content(node->nd_value)) {
11784 /* reports always */
11785 parser_warn(p, node->nd_value, "found `= literal' in conditional, should be ==");
11786 }
11787 return 1;
11788 }
11789
11790 enum cond_type {
11791 COND_IN_OP,
11792 COND_IN_COND,
11793 COND_IN_FF
11794 };
11795
11796 #define SWITCH_BY_COND_TYPE(t, w, arg) \
11797 switch (t) { \
11798 case COND_IN_OP: break; \
11799 case COND_IN_COND: rb_##w##0(arg "literal in condition"); break; \
11800 case COND_IN_FF: rb_##w##0(arg "literal in flip-flop"); break; \
11801 }
11802
11803 static NODE *cond0(struct parser_params*,NODE*,enum cond_type,const YYLTYPE*);
11804
11805 static NODE*
11806 range_op(struct parser_params *p, NODE *node, const YYLTYPE *loc)
11807 {
11808 enum node_type type;
11809
11810 if (node == 0) return 0;
11811
11812 type = nd_type(node);
11813 value_expr(node);
11814 if (type == NODE_LIT && FIXNUM_P(node->nd_lit)) {
11815 if (!e_option_supplied(p)) parser_warn(p, node, "integer literal in flip-flop");
11816 ID lineno = rb_intern("$.");
11817 return NEW_CALL(node, tEQ, NEW_LIST(NEW_GVAR(lineno, loc), loc), loc);
11818 }
11819 return cond0(p, node, COND_IN_FF, loc);
11820 }
11821
11822 static NODE*
11823 cond0(struct parser_params *p, NODE *node, enum cond_type type, const YYLTYPE *loc)
11824 {
11825 if (node == 0) return 0;
11826 if (!(node = nd_once_body(node))) return 0;
11827 assign_in_cond(p, node);
11828
11829 switch (nd_type(node)) {
11830 case NODE_DSTR:
11831 case NODE_EVSTR:
11832 case NODE_STR:
11833 SWITCH_BY_COND_TYPE(type, warn, "string ")
11834 break;
11835
11836 case NODE_DREGX:
11837 if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warning, "regex ")
11838
11839 return NEW_MATCH2(node, NEW_GVAR(idLASTLINE, loc), loc);
11840
11841 case NODE_AND:
11842 case NODE_OR:
11843 node->nd_1st = cond0(p, node->nd_1st, COND_IN_COND, loc);
11844 node->nd_2nd = cond0(p, node->nd_2nd, COND_IN_COND, loc);
11845 break;
11846
11847 case NODE_DOT2:
11848 case NODE_DOT3:
11849 node->nd_beg = range_op(p, node->nd_beg, loc);
11850 node->nd_end = range_op(p, node->nd_end, loc);
11851 if (nd_type_p(node, NODE_DOT2)) nd_set_type(node,NODE_FLIP2);
11852 else if (nd_type_p(node, NODE_DOT3)) nd_set_type(node, NODE_FLIP3);
11853 break;
11854
11855 case NODE_DSYM:
11856 warn_symbol:
11857 SWITCH_BY_COND_TYPE(type, warning, "symbol ")
11858 break;
11859
11860 case NODE_LIT:
11861 if (RB_TYPE_P(node->nd_lit, T_REGEXP)) {
11862 if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warn, "regex ")
11863 nd_set_type(node, NODE_MATCH);
11864 }
11865 else if (node->nd_lit == Qtrue ||
11866 node->nd_lit == Qfalse) {
11867 /* booleans are OK, e.g., while true */
11868 }
11869 else if (SYMBOL_P(node->nd_lit)) {
11870 goto warn_symbol;
11871 }
11872 else {
11873 SWITCH_BY_COND_TYPE(type, warning, "")
11874 }
11875 default:
11876 break;
11877 }
11878 return node;
11879 }
11880
11881 static NODE*
11882 cond(struct parser_params *p, NODE *node, const YYLTYPE *loc)
11883 {
11884 if (node == 0) return 0;
11885 return cond0(p, node, COND_IN_COND, loc);
11886 }
11887
11888 static NODE*
11889 method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc)
11890 {
11891 if (node == 0) return 0;
11892 return cond0(p, node, COND_IN_OP, loc);
11893 }
11894
11895 static NODE*
11896 new_nil_at(struct parser_params *p, const rb_code_position_t *pos)
11897 {
11898 YYLTYPE loc = {*pos, *pos};
11899 return NEW_NIL(&loc);
11900 }
11901
11902 static NODE*
11903 new_if(struct parser_params *p, NODE *cc, NODE *left, NODE *right, const YYLTYPE *loc)
11904 {
11905 if (!cc) return right;
11906 cc = cond0(p, cc, COND_IN_COND, loc);
11907 return newline_node(NEW_IF(cc, left, right, loc));
11908 }
11909
11910 static NODE*
11911 new_unless(struct parser_params *p, NODE *cc, NODE *left, NODE *right, const YYLTYPE *loc)
11912 {
11913 if (!cc) return right;
11914 cc = cond0(p, cc, COND_IN_COND, loc);
11915 return newline_node(NEW_UNLESS(cc, left, right, loc));
11916 }
11917
11918 static NODE*
11919 logop(struct parser_params *p, ID id, NODE *left, NODE *right,
11920 const YYLTYPE *op_loc, const YYLTYPE *loc)
11921 {
11922 enum node_type type = id == idAND || id == idANDOP ? NODE_AND : NODE_OR;
11923 NODE *op;
11924 value_expr(left);
11925 if (left && nd_type_p(left, type)) {
11926 NODE *node = left, *second;
11927 while ((second = node->nd_2nd) != 0 && nd_type_p(second, type)) {
11928 node = second;
11929 }
11930 node->nd_2nd = NEW_NODE(type, second, right, 0, loc);
11931 nd_set_line(node->nd_2nd, op_loc->beg_pos.lineno);
11932 left->nd_loc.end_pos = loc->end_pos;
11933 return left;
11934 }
11935 op = NEW_NODE(type, left, right, 0, loc);
11936 nd_set_line(op, op_loc->beg_pos.lineno);
11937 return op;
11938 }
11939
11940 static void
11941 no_blockarg(struct parser_params *p, NODE *node)
11942 {
11943 if (node && nd_type_p(node, NODE_BLOCK_PASS)) {
11944 compile_error(p, "block argument should not be given");
11945 }
11946 }
11947
11948 static NODE *
11949 ret_args(struct parser_params *p, NODE *node)
11950 {
11951 if (node) {
11952 no_blockarg(p, node);
11953 if (nd_type_p(node, NODE_LIST)) {
11954 if (node->nd_next == 0) {
11955 node = node->nd_head;
11956 }
11957 else {
11958 nd_set_type(node, NODE_VALUES);
11959 }
11960 }
11961 }
11962 return node;
11963 }
11964
11965 static NODE *
11966 new_yield(struct parser_params *p, NODE *node, const YYLTYPE *loc)
11967 {
11968 if (node) no_blockarg(p, node);
11969
11970 return NEW_YIELD(node, loc);
11971 }
11972
11973 static VALUE
11974 negate_lit(struct parser_params *p, VALUE lit)
11975 {
11976 if (FIXNUM_P(lit)) {
11977 return LONG2FIX(-FIX2LONG(lit));
11978 }
11979 if (SPECIAL_CONST_P(lit)) {
11980 #if USE_FLONUM
11981 if (FLONUM_P(lit)) {
11982 return DBL2NUM(-RFLOAT_VALUE(lit));
11983 }
11984 #endif
11985 goto unknown;
11986 }
11987 switch (BUILTIN_TYPE(lit)) {
11988 case T_BIGNUM:
11989 BIGNUM_NEGATE(lit);
11990 lit = rb_big_norm(lit);
11991 break;
11992 case T_RATIONAL:
11993 RATIONAL_SET_NUM(lit, negate_lit(p, RRATIONAL(lit)->num));
11994 break;
11995 case T_COMPLEX:
11996 RCOMPLEX_SET_REAL(lit, negate_lit(p, RCOMPLEX(lit)->real));
11997 RCOMPLEX_SET_IMAG(lit, negate_lit(p, RCOMPLEX(lit)->imag));
11998 break;
11999 case T_FLOAT:
12000 lit = DBL2NUM(-RFLOAT_VALUE(lit));
12001 break;
12002 unknown:
12003 default:
12004 rb_parser_fatal(p, "unknown literal type (%s) passed to negate_lit",
12005 rb_builtin_class_name(lit));
12006 break;
12007 }
12008 return lit;
12009 }
12010
12011 static NODE *
12012 arg_blk_pass(NODE *node1, NODE *node2)
12013 {
12014 if (node2) {
12015 if (!node1) return node2;
12016 node2->nd_head = node1;
12017 nd_set_first_lineno(node2, nd_first_lineno(node1));
12018 nd_set_first_column(node2, nd_first_column(node1));
12019 return node2;
12020 }
12021 return node1;
12022 }
12023
12024 static bool
12025 args_info_empty_p(struct rb_args_info *args)
12026 {
12027 if (args->pre_args_num) return false;
12028 if (args->post_args_num) return false;
12029 if (args->rest_arg) return false;
12030 if (args->opt_args) return false;
12031 if (args->block_arg) return false;
12032 if (args->kw_args) return false;
12033 if (args->kw_rest_arg) return false;
12034 return true;
12035 }
12036
12037 static NODE*
12038 new_args(struct parser_params *p, NODE *pre_args, NODE *opt_args, ID rest_arg, NODE *post_args, NODE *tail, const YYLTYPE *loc)
12039 {
12040 int saved_line = p->ruby_sourceline;
12041 struct rb_args_info *args = tail->nd_ainfo;
12042
12043 if (args->block_arg == idFWD_BLOCK) {
12044 if (rest_arg) {
12045 yyerror1(&tail->nd_loc, "... after rest argument");
12046 return tail;
12047 }
12048 rest_arg = idFWD_REST;
12049 }
12050
12051 args->pre_args_num = pre_args ? rb_long2int(pre_args->nd_plen) : 0;
12052 args->pre_init = pre_args ? pre_args->nd_next : 0;
12053
12054 args->post_args_num = post_args ? rb_long2int(post_args->nd_plen) : 0;
12055 args->post_init = post_args ? post_args->nd_next : 0;
12056 args->first_post_arg = post_args ? post_args->nd_pid : 0;
12057
12058 args->rest_arg = rest_arg;
12059
12060 args->opt_args = opt_args;
12061
12062 args->ruby2_keywords = rest_arg == idFWD_REST;
12063
12064 p->ruby_sourceline = saved_line;
12065 nd_set_loc(tail, loc);
12066
12067 return tail;
12068 }
12069
12070 static NODE*
12071 new_args_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, ID block, const YYLTYPE *kw_rest_loc)
12072 {
12073 int saved_line = p->ruby_sourceline;
12074 NODE *node;
12075 VALUE tmpbuf = rb_imemo_tmpbuf_auto_free_pointer();
12076 struct rb_args_info *args = ZALLOC(struct rb_args_info);
12077 rb_imemo_tmpbuf_set_ptr(tmpbuf, args);
12078 args->imemo = tmpbuf;
12079 node = NEW_NODE(NODE_ARGS, 0, 0, args, &NULL_LOC);
12080 RB_OBJ_WRITTEN(p->ast, Qnil, tmpbuf);
12081 if (p->error_p) return node;
12082
12083 args->block_arg = block;
12084 args->kw_args = kw_args;
12085
12086 if (kw_args) {
12087 /*
12088 * def foo(k1: 1, kr1:, k2: 2, **krest, &b)
12089 * variable order: k1, kr1, k2, &b, internal_id, krest
12090 * #=> <reorder>
12091 * variable order: kr1, k1, k2, internal_id, krest, &b
12092 */
12093 ID kw_bits = internal_id(p), *required_kw_vars, *kw_vars;
12094 struct vtable *vtargs = p->lvtbl->args;
12095 NODE *kwn = kw_args;
12096
12097 vtable_pop(vtargs, !!block + !!kw_rest_arg);
12098 required_kw_vars = kw_vars = &vtargs->tbl[vtargs->pos];
12099 while (kwn) {
12100 if (!NODE_REQUIRED_KEYWORD_P(kwn->nd_body))
12101 --kw_vars;
12102 --required_kw_vars;
12103 kwn = kwn->nd_next;
12104 }
12105
12106 for (kwn = kw_args; kwn; kwn = kwn->nd_next) {
12107 ID vid = kwn->nd_body->nd_vid;
12108 if (NODE_REQUIRED_KEYWORD_P(kwn->nd_body)) {
12109 *required_kw_vars++ = vid;
12110 }
12111 else {
12112 *kw_vars++ = vid;
12113 }
12114 }
12115
12116 arg_var(p, kw_bits);
12117 if (kw_rest_arg) arg_var(p, kw_rest_arg);
12118 if (block) arg_var(p, block);
12119
12120 args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc);
12121 args->kw_rest_arg->nd_cflag = kw_bits;
12122 }
12123 else if (kw_rest_arg == idNil) {
12124 args->no_kwarg = 1;
12125 }
12126 else if (kw_rest_arg) {
12127 args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc);
12128 }
12129
12130 p->ruby_sourceline = saved_line;
12131 return node;
12132 }
12133
12134 static NODE *
12135 args_with_numbered(struct parser_params *p, NODE *args, int max_numparam)
12136 {
12137 if (max_numparam > NO_PARAM) {
12138 if (!args) {
12139 YYLTYPE loc = RUBY_INIT_YYLLOC();
12140 args = new_args_tail(p, 0, 0, 0, 0);
12141 nd_set_loc(args, &loc);
12142 }
12143 args->nd_ainfo->pre_args_num = max_numparam;
12144 }
12145 return args;
12146 }
12147
12148 static NODE*
12149 new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc)
12150 {
12151 struct rb_ary_pattern_info *apinfo = aryptn->nd_apinfo;
12152
12153 aryptn->nd_pconst = constant;
12154
12155 if (pre_arg) {
12156 NODE *pre_args = NEW_LIST(pre_arg, loc);
12157 if (apinfo->pre_args) {
12158 apinfo->pre_args = list_concat(pre_args, apinfo->pre_args);
12159 }
12160 else {
12161 apinfo->pre_args = pre_args;
12162 }
12163 }
12164 return aryptn;
12165 }
12166
12167 static NODE*
12168 new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, ID rest_arg, NODE *post_args, const YYLTYPE *loc)
12169 {
12170 int saved_line = p->ruby_sourceline;
12171 NODE *node;
12172 VALUE tmpbuf = rb_imemo_tmpbuf_auto_free_pointer();
12173 struct rb_ary_pattern_info *apinfo = ZALLOC(struct rb_ary_pattern_info);
12174 rb_imemo_tmpbuf_set_ptr(tmpbuf, apinfo);
12175 node = NEW_NODE(NODE_ARYPTN, 0, tmpbuf, apinfo, loc);
12176 RB_OBJ_WRITTEN(p->ast, Qnil, tmpbuf);
12177
12178 apinfo->pre_args = pre_args;
12179
12180 if (has_rest) {
12181 if (rest_arg) {
12182 apinfo->rest_arg = assignable(p, rest_arg, 0, loc);
12183 }
12184 else {
12185 apinfo->rest_arg = NODE_SPECIAL_NO_NAME_REST;
12186 }
12187 }
12188 else {
12189 apinfo->rest_arg = NULL;
12190 }
12191
12192 apinfo->post_args = post_args;
12193
12194 p->ruby_sourceline = saved_line;
12195 return node;
12196 }
12197
12198 static NODE*
12199 new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc)
12200 {
12201 fndptn->nd_pconst = constant;
12202
12203 return fndptn;
12204 }
12205
12206 static NODE*
12207 new_find_pattern_tail(struct parser_params *p, ID pre_rest_arg, NODE *args, ID post_rest_arg, const YYLTYPE *loc)
12208 {
12209 int saved_line = p->ruby_sourceline;
12210 NODE *node;
12211 VALUE tmpbuf = rb_imemo_tmpbuf_auto_free_pointer();
12212 struct rb_fnd_pattern_info *fpinfo = ZALLOC(struct rb_fnd_pattern_info);
12213 rb_imemo_tmpbuf_set_ptr(tmpbuf, fpinfo);
12214 node = NEW_NODE(NODE_FNDPTN, 0, tmpbuf, fpinfo, loc);
12215 RB_OBJ_WRITTEN(p->ast, Qnil, tmpbuf);
12216
12217 fpinfo->pre_rest_arg = pre_rest_arg ? assignable(p, pre_rest_arg, 0, loc) : NODE_SPECIAL_NO_NAME_REST;
12218 fpinfo->args = args;
12219 fpinfo->post_rest_arg = post_rest_arg ? assignable(p, post_rest_arg, 0, loc) : NODE_SPECIAL_NO_NAME_REST;
12220
12221 p->ruby_sourceline = saved_line;
12222 return node;
12223 }
12224
12225 static NODE*
12226 new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc)
12227 {
12228 hshptn->nd_pconst = constant;
12229 return hshptn;
12230 }
12231
12232 static NODE*
12233 new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc)
12234 {
12235 int saved_line = p->ruby_sourceline;
12236 NODE *node, *kw_rest_arg_node;
12237
12238 if (kw_rest_arg == idNil) {
12239 kw_rest_arg_node = NODE_SPECIAL_NO_REST_KEYWORD;
12240 }
12241 else if (kw_rest_arg) {
12242 kw_rest_arg_node = assignable(p, kw_rest_arg, 0, loc);
12243 }
12244 else {
12245 kw_rest_arg_node = NULL;
12246 }
12247
12248 node = NEW_NODE(NODE_HSHPTN, 0, kw_args, kw_rest_arg_node, loc);
12249
12250 p->ruby_sourceline = saved_line;
12251 return node;
12252 }
12253
12254 static NODE*
12255 dsym_node(struct parser_params *p, NODE *node, const YYLTYPE *loc)
12256 {
12257 VALUE lit;
12258
12259 if (!node) {
12260 return NEW_LIT(ID2SYM(idNULL), loc);
12261 }
12262
12263 switch (nd_type(node)) {
12264 case NODE_DSTR:
12265 nd_set_type(node, NODE_DSYM);
12266 nd_set_loc(node, loc);
12267 break;
12268 case NODE_STR:
12269 lit = node->nd_lit;
12270 RB_OBJ_WRITTEN(p->ast, Qnil, node->nd_lit = ID2SYM(rb_intern_str(lit)));
12271 nd_set_type(node, NODE_LIT);
12272 nd_set_loc(node, loc);
12273 break;
12274 default:
12275 node = NEW_NODE(NODE_DSYM, Qnil, 1, NEW_LIST(node, loc), loc);
12276 break;
12277 }
12278 return node;
12279 }
12280
12281 static int
12282 append_literal_keys(st_data_t k, st_data_t v, st_data_t h)
12283 {
12284 NODE *node = (NODE *)v;
12285 NODE **result = (NODE **)h;
12286 node->nd_alen = 2;
12287 node->nd_next->nd_end = node->nd_next;
12288 node->nd_next->nd_next = 0;
12289 if (*result)
12290 list_concat(*result, node);
12291 else
12292 *result = node;
12293 return ST_CONTINUE;
12294 }
12295
12296 static bool
12297 hash_literal_key_p(VALUE k)
12298 {
12299 switch (OBJ_BUILTIN_TYPE(k)) {
12300 case T_NODE:
12301 return false;
12302 default:
12303 return true;
12304 }
12305 }
12306
12307 static int
12308 literal_cmp(VALUE val, VALUE lit)
12309 {
12310 if (val == lit) return 0;
12311 if (!hash_literal_key_p(val) || !hash_literal_key_p(lit)) return -1;
12312 return rb_iseq_cdhash_cmp(val, lit);
12313 }
12314
12315 static st_index_t
12316 literal_hash(VALUE a)
12317 {
12318 if (!hash_literal_key_p(a)) return (st_index_t)a;
12319 return rb_iseq_cdhash_hash(a);
12320 }
12321
12322 static const struct st_hash_type literal_type = {
12323 literal_cmp,
12324 literal_hash,
12325 };
12326
12327 static NODE *
12328 remove_duplicate_keys(struct parser_params *p, NODE *hash)
12329 {
12330 st_table *literal_keys = st_init_table_with_size(&literal_type, hash->nd_alen / 2);
12331 NODE *result = 0;
12332 NODE *last_expr = 0;
12333 rb_code_location_t loc = hash->nd_loc;
12334 while (hash && hash->nd_head && hash->nd_next) {
12335 NODE *head = hash->nd_head;
12336 NODE *value = hash->nd_next;
12337 NODE *next = value->nd_next;
12338 st_data_t key = (st_data_t)head;
12339 st_data_t data;
12340 value->nd_next = 0;
12341 if (nd_type_p(head, NODE_LIT) &&
12342 st_delete(literal_keys, (key = (st_data_t)head->nd_lit, &key), &data)) {
12343 NODE *dup_value = ((NODE *)data)->nd_next;
12344 rb_compile_warn(p->ruby_sourcefile, nd_line((NODE *)data),
12345 "key %+"PRIsVALUE" is duplicated and overwritten on line %d",
12346 head->nd_lit, nd_line(head));
12347 if (dup_value == last_expr) {
12348 value->nd_head = block_append(p, dup_value->nd_head, value->nd_head);
12349 }
12350 else {
12351 last_expr->nd_head = block_append(p, dup_value->nd_head, last_expr->nd_head);
12352 }
12353 }
12354 st_insert(literal_keys, (st_data_t)key, (st_data_t)hash);
12355 last_expr = nd_type_p(head, NODE_LIT) ? value : head;
12356 hash = next;
12357 }
12358 st_foreach(literal_keys, append_literal_keys, (st_data_t)&result);
12359 st_free_table(literal_keys);
12360 if (hash) {
12361 if (!result) result = hash;
12362 else list_concat(result, hash);
12363 }
12364 result->nd_loc = loc;
12365 return result;
12366 }
12367
12368 static NODE *
12369 new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc)
12370 {
12371 if (hash) hash = remove_duplicate_keys(p, hash);
12372 return NEW_HASH(hash, loc);
12373 }
12374 #endif
12375
12376 static void
12377 error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc)
12378 {
12379 if (is_private_local_id(id)) {
12380 return;
12381 }
12382 if (st_is_member(p->pvtbl, id)) {
12383 yyerror1(loc, "duplicated variable name");
12384 }
12385 else {
12386 st_insert(p->pvtbl, (st_data_t)id, 0);
12387 }
12388 }
12389
12390 static void
12391 error_duplicate_pattern_key(struct parser_params *p, VALUE key, const YYLTYPE *loc)
12392 {
12393 if (!p->pktbl) {
12394 p->pktbl = st_init_numtable();
12395 }
12396 else if (st_is_member(p->pktbl, key)) {
12397 yyerror1(loc, "duplicated key name");
12398 return;
12399 }
12400 st_insert(p->pktbl, (st_data_t)key, 0);
12401 }
12402
12403 #ifndef RIPPER
12404 static NODE *
12405 new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc)
12406 {
12407 return NEW_HASH(hash, loc);
12408 }
12409 #endif /* !RIPPER */
12410
12411 #ifndef RIPPER
12412 static NODE *
12413 new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
12414 {
12415 NODE *asgn;
12416
12417 if (lhs) {
12418 ID vid = lhs->nd_vid;
12419 YYLTYPE lhs_loc = lhs->nd_loc;
12420 int shareable = ctxt.shareable_constant_value;
12421 if (shareable) {
12422 switch (nd_type(lhs)) {
12423 case NODE_CDECL:
12424 case NODE_COLON2:
12425 case NODE_COLON3:
12426 break;
12427 default:
12428 shareable = 0;
12429 break;
12430 }
12431 }
12432 if (op == tOROP) {
12433 rhs = shareable_constant_value(p, shareable, lhs, rhs, &rhs->nd_loc);
12434 lhs->nd_value = rhs;
12435 nd_set_loc(lhs, loc);
12436 asgn = NEW_OP_ASGN_OR(gettable(p, vid, &lhs_loc), lhs, loc);
12437 if (is_notop_id(vid)) {
12438 switch (id_type(vid)) {
12439 case ID_GLOBAL:
12440 case ID_INSTANCE:
12441 case ID_CLASS:
12442 asgn->nd_aid = vid;
12443 }
12444 }
12445 }
12446 else if (op == tANDOP) {
12447 if (shareable) {
12448 rhs = shareable_constant_value(p, shareable, lhs, rhs, &rhs->nd_loc);
12449 }
12450 lhs->nd_value = rhs;
12451 nd_set_loc(lhs, loc);
12452 asgn = NEW_OP_ASGN_AND(gettable(p, vid, &lhs_loc), lhs, loc);
12453 }
12454 else {
12455 asgn = lhs;
12456 rhs = NEW_CALL(gettable(p, vid, &lhs_loc), op, NEW_LIST(rhs, &rhs->nd_loc), loc);
12457 if (shareable) {
12458 rhs = shareable_constant_value(p, shareable, lhs, rhs, &rhs->nd_loc);
12459 }
12460 asgn->nd_value = rhs;
12461 nd_set_loc(asgn, loc);
12462 }
12463 }
12464 else {
12465 asgn = NEW_BEGIN(0, loc);
12466 }
12467 return asgn;
12468 }
12469
12470 static NODE *
12471 new_ary_op_assign(struct parser_params *p, NODE *ary,
12472 NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc)
12473 {
12474 NODE *asgn;
12475
12476 args = make_list(args, args_loc);
12477 if (nd_type_p(args, NODE_BLOCK_PASS)) {
12478 args = NEW_ARGSCAT(args, rhs, loc);
12479 }
12480 else {
12481 args = arg_concat(p, args, rhs, loc);
12482 }
12483 asgn = NEW_OP_ASGN1(ary, op, args, loc);
12484 fixpos(asgn, ary);
12485 return asgn;
12486 }
12487
12488 static NODE *
12489 new_attr_op_assign(struct parser_params *p, NODE *lhs,
12490 ID atype, ID attr, ID op, NODE *rhs, const YYLTYPE *loc)
12491 {
12492 NODE *asgn;
12493
12494 asgn = NEW_OP_ASGN2(lhs, CALL_Q_P(atype), attr, op, rhs, loc);
12495 fixpos(asgn, lhs);
12496 return asgn;
12497 }
12498
12499 static NODE *
12500 new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
12501 {
12502 NODE *asgn;
12503
12504 if (lhs) {
12505 rhs = shareable_constant_value(p, ctxt.shareable_constant_value, lhs, rhs, loc);
12506 asgn = NEW_OP_CDECL(lhs, op, rhs, loc);
12507 }
12508 else {
12509 asgn = NEW_BEGIN(0, loc);
12510 }
12511 fixpos(asgn, lhs);
12512 return asgn;
12513 }
12514
12515 static NODE *
12516 const_decl(struct parser_params *p, NODE *path, const YYLTYPE *loc)
12517 {
12518 if (p->ctxt.in_def) {
12519 yyerror1(loc, "dynamic constant assignment");
12520 }
12521 return NEW_CDECL(0, 0, (path), loc);
12522 }
12523 #else
12524 static VALUE
12525 const_decl(struct parser_params *p, VALUE path)
12526 {
12527 if (p->ctxt.in_def) {
12528 path = assign_error(p, "dynamic constant assignment", path);
12529 }
12530 return path;
12531 }
12532
12533 static VALUE
12534 assign_error(struct parser_params *p, const char *mesg, VALUE a)
12535 {
12536 a = dispatch2(assign_error, ERR_MESG(), a);
12537 ripper_error(p);
12538 return a;
12539 }
12540
12541 static VALUE
12542 var_field(struct parser_params *p, VALUE a)
12543 {
12544 return ripper_new_yylval(p, get_id(a), dispatch1(var_field, a), 0);
12545 }
12546 #endif
12547
12548 #ifndef RIPPER
12549 static NODE *
12550 new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc)
12551 {
12552 NODE *result = head;
12553 if (rescue) {
12554 NODE *tmp = rescue_else ? rescue_else : rescue;
12555 YYLTYPE rescue_loc = code_loc_gen(&head->nd_loc, &tmp->nd_loc);
12556
12557 result = NEW_RESCUE(head, rescue, rescue_else, &rescue_loc);
12558 nd_set_line(result, rescue->nd_loc.beg_pos.lineno);
12559 }
12560 else if (rescue_else) {
12561 result = block_append(p, result, rescue_else);
12562 }
12563 if (ensure) {
12564 result = NEW_ENSURE(result, ensure, loc);
12565 }
12566 fixpos(result, head);
12567 return result;
12568 }
12569 #endif
12570
12571 static void
12572 warn_unused_var(struct parser_params *p, struct local_vars *local)
12573 {
12574 int cnt;
12575
12576 if (!local->used) return;
12577 cnt = local->used->pos;
12578 if (cnt != local->vars->pos) {
12579 rb_parser_fatal(p, "local->used->pos != local->vars->pos");
12580 }
12581 #ifndef RIPPER
12582 ID *v = local->vars->tbl;
12583 ID *u = local->used->tbl;
12584 for (int i = 0; i < cnt; ++i) {
12585 if (!v[i] || (u[i] & LVAR_USED)) continue;
12586 if (is_private_local_id(v[i])) continue;
12587 rb_warn1L((int)u[i], "assigned but unused variable - %"PRIsWARN, rb_id2str(v[i]));
12588 }
12589 #endif
12590 }
12591
12592 static void
12593 local_push(struct parser_params *p, int toplevel_scope)
12594 {
12595 struct local_vars *local;
12596 int inherits_dvars = toplevel_scope && compile_for_eval;
12597 int warn_unused_vars = RTEST(ruby_verbose);
12598
12599 local = ALLOC(struct local_vars);
12600 local->prev = p->lvtbl;
12601 local->args = vtable_alloc(0);
12602 local->vars = vtable_alloc(inherits_dvars ? DVARS_INHERIT : DVARS_TOPSCOPE);
12603 #ifndef RIPPER
12604 if (toplevel_scope && compile_for_eval) warn_unused_vars = 0;
12605 if (toplevel_scope && e_option_supplied(p)) warn_unused_vars = 0;
12606 local->numparam.outer = 0;
12607 local->numparam.inner = 0;
12608 local->numparam.current = 0;
12609 #endif
12610 local->used = warn_unused_vars ? vtable_alloc(0) : 0;
12611
12612 # if WARN_PAST_SCOPE
12613 local->past = 0;
12614 # endif
12615 CMDARG_PUSH(0);
12616 COND_PUSH(0);
12617 p->lvtbl = local;
12618 }
12619
12620 static void
12621 local_pop(struct parser_params *p)
12622 {
12623 struct local_vars *local = p->lvtbl->prev;
12624 if (p->lvtbl->used) {
12625 warn_unused_var(p, p->lvtbl);
12626 vtable_free(p->lvtbl->used);
12627 }
12628 # if WARN_PAST_SCOPE
12629 while (p->lvtbl->past) {
12630 struct vtable *past = p->lvtbl->past;
12631 p->lvtbl->past = past->prev;
12632 vtable_free(past);
12633 }
12634 # endif
12635 vtable_free(p->lvtbl->args);
12636 vtable_free(p->lvtbl->vars);
12637 CMDARG_POP();
12638 COND_POP();
12639 ruby_sized_xfree(p->lvtbl, sizeof(*p->lvtbl));
12640 p->lvtbl = local;
12641 }
12642
12643 #ifndef RIPPER
12644 static rb_ast_id_table_t *
12645 local_tbl(struct parser_params *p)
12646 {
12647 int cnt_args = vtable_size(p->lvtbl->args);
12648 int cnt_vars = vtable_size(p->lvtbl->vars);
12649 int cnt = cnt_args + cnt_vars;
12650 int i, j;
12651 rb_ast_id_table_t *tbl;
12652
12653 if (cnt <= 0) return 0;
12654 tbl = rb_ast_new_local_table(p->ast, cnt);
12655 MEMCPY(tbl->ids, p->lvtbl->args->tbl, ID, cnt_args);
12656 /* remove IDs duplicated to warn shadowing */
12657 for (i = 0, j = cnt_args; i < cnt_vars; ++i) {
12658 ID id = p->lvtbl->vars->tbl[i];
12659 if (!vtable_included(p->lvtbl->args, id)) {
12660 tbl->ids[j++] = id;
12661 }
12662 }
12663 if (j < cnt) {
12664 tbl = rb_ast_resize_latest_local_table(p->ast, j);
12665 }
12666
12667 return tbl;
12668 }
12669
12670 static NODE*
12671 node_newnode_with_locals(struct parser_params *p, enum node_type type, VALUE a1, VALUE a2, const rb_code_location_t *loc)
12672 {
12673 rb_ast_id_table_t *a0;
12674 NODE *n;
12675
12676 a0 = local_tbl(p);
12677 n = NEW_NODE(type, a0, a1, a2, loc);
12678 return n;
12679 }
12680
12681 #endif
12682
12683 static void
12684 numparam_name(struct parser_params *p, ID id)
12685 {
12686 if (!NUMPARAM_ID_P(id)) return;
12687 compile_error(p, "_%d is reserved for numbered parameter",
12688 NUMPARAM_ID_TO_IDX(id));
12689 }
12690
12691 static void
12692 arg_var(struct parser_params *p, ID id)
12693 {
12694 numparam_name(p, id);
12695 vtable_add(p->lvtbl->args, id);
12696 }
12697
12698 static void
12699 local_var(struct parser_params *p, ID id)
12700 {
12701 numparam_name(p, id);
12702 vtable_add(p->lvtbl->vars, id);
12703 if (p->lvtbl->used) {
12704 vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline);
12705 }
12706 }
12707
12708 static int
12709 local_id_ref(struct parser_params *p, ID id, ID **vidrefp)
12710 {
12711 struct vtable *vars, *args, *used;
12712
12713 vars = p->lvtbl->vars;
12714 args = p->lvtbl->args;
12715 used = p->lvtbl->used;
12716
12717 while (vars && !DVARS_TERMINAL_P(vars->prev)) {
12718 vars = vars->prev;
12719 args = args->prev;
12720 if (used) used = used->prev;
12721 }
12722
12723 if (vars && vars->prev == DVARS_INHERIT) {
12724 return rb_local_defined(id, p->parent_iseq);
12725 }
12726 else if (vtable_included(args, id)) {
12727 return 1;
12728 }
12729 else {
12730 int i = vtable_included(vars, id);
12731 if (i && used && vidrefp) *vidrefp = &used->tbl[i-1];
12732 return i != 0;
12733 }
12734 }
12735
12736 static int
12737 local_id(struct parser_params *p, ID id)
12738 {
12739 return local_id_ref(p, id, NULL);
12740 }
12741
12742 static int
12743 check_forwarding_args(struct parser_params *p)
12744 {
12745 if (local_id(p, idFWD_REST) &&
12746 #if idFWD_KWREST
12747 local_id(p, idFWD_KWREST) &&
12748 #endif
12749 local_id(p, idFWD_BLOCK)) return TRUE;
12750 compile_error(p, "unexpected ...");
12751 return FALSE;
12752 }
12753
12754 static void
12755 add_forwarding_args(struct parser_params *p)
12756 {
12757 arg_var(p, idFWD_REST);
12758 #if idFWD_KWREST
12759 arg_var(p, idFWD_KWREST);
12760 #endif
12761 arg_var(p, idFWD_BLOCK);
12762 }
12763
12764 #ifndef RIPPER
12765 static NODE *
12766 new_args_forward_call(struct parser_params *p, NODE *leading, const YYLTYPE *loc, const YYLTYPE *argsloc)
12767 {
12768 NODE *splat = NEW_SPLAT(NEW_LVAR(idFWD_REST, loc), loc);
12769 #if idFWD_KWREST
12770 NODE *kwrest = list_append(p, NEW_LIST(0, loc), NEW_LVAR(idFWD_KWREST, loc));
12771 #endif
12772 NODE *block = NEW_BLOCK_PASS(NEW_LVAR(idFWD_BLOCK, loc), loc);
12773 NODE *args = leading ? rest_arg_append(p, leading, splat, argsloc) : splat;
12774 #if idFWD_KWREST
12775 args = arg_append(p, splat, new_hash(p, kwrest, loc), loc);
12776 #endif
12777 return arg_blk_pass(args, block);
12778 }
12779 #endif
12780
12781 static NODE *
12782 numparam_push(struct parser_params *p)
12783 {
12784 #ifndef RIPPER
12785 struct local_vars *local = p->lvtbl;
12786 NODE *inner = local->numparam.inner;
12787 if (!local->numparam.outer) {
12788 local->numparam.outer = local->numparam.current;
12789 }
12790 local->numparam.inner = 0;
12791 local->numparam.current = 0;
12792 return inner;
12793 #else
12794 return 0;
12795 #endif
12796 }
12797
12798 static void
12799 numparam_pop(struct parser_params *p, NODE *prev_inner)
12800 {
12801 #ifndef RIPPER
12802 struct local_vars *local = p->lvtbl;
12803 if (prev_inner) {
12804 /* prefer first one */
12805 local->numparam.inner = prev_inner;
12806 }
12807 else if (local->numparam.current) {
12808 /* current and inner are exclusive */
12809 local->numparam.inner = local->numparam.current;
12810 }
12811 if (p->max_numparam > NO_PARAM) {
12812 /* current and outer are exclusive */
12813 local->numparam.current = local->numparam.outer;
12814 local->numparam.outer = 0;
12815 }
12816 else {
12817 /* no numbered parameter */
12818 local->numparam.current = 0;
12819 }
12820 #endif
12821 }
12822
12823 static const struct vtable *
12824 dyna_push(struct parser_params *p)
12825 {
12826 p->lvtbl->args = vtable_alloc(p->lvtbl->args);
12827 p->lvtbl->vars = vtable_alloc(p->lvtbl->vars);
12828 if (p->lvtbl->used) {
12829 p->lvtbl->used = vtable_alloc(p->lvtbl->used);
12830 }
12831 return p->lvtbl->args;
12832 }
12833
12834 static void
12835 dyna_pop_vtable(struct parser_params *p, struct vtable **vtblp)
12836 {
12837 struct vtable *tmp = *vtblp;
12838 *vtblp = tmp->prev;
12839 # if WARN_PAST_SCOPE
12840 if (p->past_scope_enabled) {
12841 tmp->prev = p->lvtbl->past;
12842 p->lvtbl->past = tmp;
12843 return;
12844 }
12845 # endif
12846 vtable_free(tmp);
12847 }
12848
12849 static void
12850 dyna_pop_1(struct parser_params *p)
12851 {
12852 struct vtable *tmp;
12853
12854 if ((tmp = p->lvtbl->used) != 0) {
12855 warn_unused_var(p, p->lvtbl);
12856 p->lvtbl->used = p->lvtbl->used->prev;
12857 vtable_free(tmp);
12858 }
12859 dyna_pop_vtable(p, &p->lvtbl->args);
12860 dyna_pop_vtable(p, &p->lvtbl->vars);
12861 }
12862
12863 static void
12864 dyna_pop(struct parser_params *p, const struct vtable *lvargs)
12865 {
12866 while (p->lvtbl->args != lvargs) {
12867 dyna_pop_1(p);
12868 if (!p->lvtbl->args) {
12869 struct local_vars *local = p->lvtbl->prev;
12870 ruby_sized_xfree(p->lvtbl, sizeof(*p->lvtbl));
12871 p->lvtbl = local;
12872 }
12873 }
12874 dyna_pop_1(p);
12875 }
12876
12877 static int
12878 dyna_in_block(struct parser_params *p)
12879 {
12880 return !DVARS_TERMINAL_P(p->lvtbl->vars) && p->lvtbl->vars->prev != DVARS_TOPSCOPE;
12881 }
12882
12883 static int
12884 dvar_defined_ref(struct parser_params *p, ID id, ID **vidrefp)
12885 {
12886 struct vtable *vars, *args, *used;
12887 int i;
12888
12889 args = p->lvtbl->args;
12890 vars = p->lvtbl->vars;
12891 used = p->lvtbl->used;
12892
12893 while (!DVARS_TERMINAL_P(vars)) {
12894 if (vtable_included(args, id)) {
12895 return 1;
12896 }
12897 if ((i = vtable_included(vars, id)) != 0) {
12898 if (used && vidrefp) *vidrefp = &used->tbl[i-1];
12899 return 1;
12900 }
12901 args = args->prev;
12902 vars = vars->prev;
12903 if (!vidrefp) used = 0;
12904 if (used) used = used->prev;
12905 }
12906
12907 if (vars == DVARS_INHERIT && !NUMPARAM_ID_P(id)) {
12908 return rb_dvar_defined(id, p->parent_iseq);
12909 }
12910
12911 return 0;
12912 }
12913
12914 static int
12915 dvar_defined(struct parser_params *p, ID id)
12916 {
12917 return dvar_defined_ref(p, id, NULL);
12918 }
12919
12920 static int
12921 dvar_curr(struct parser_params *p, ID id)
12922 {
12923 return (vtable_included(p->lvtbl->args, id) ||
12924 vtable_included(p->lvtbl->vars, id));
12925 }
12926
12927 static void
12928 reg_fragment_enc_error(struct parser_params* p, VALUE str, int c)
12929 {
12930 compile_error(p,
12931 "regexp encoding option '%c' differs from source encoding '%s'",
12932 c, rb_enc_name(rb_enc_get(str)));
12933 }
12934
12935 #ifndef RIPPER
12936 int
12937 rb_reg_fragment_setenc(struct parser_params* p, VALUE str, int options)
12938 {
12939 int c = RE_OPTION_ENCODING_IDX(options);
12940
12941 if (c) {
12942 int opt, idx;
12943 rb_char_to_option_kcode(c, &opt, &idx);
12944 if (idx != ENCODING_GET(str) &&
12945 rb_enc_str_coderange(str) != ENC_CODERANGE_7BIT) {
12946 goto error;
12947 }
12948 ENCODING_SET(str, idx);
12949 }
12950 else if (RE_OPTION_ENCODING_NONE(options)) {
12951 if (!ENCODING_IS_ASCII8BIT(str) &&
12952 rb_enc_str_coderange(str) != ENC_CODERANGE_7BIT) {
12953 c = 'n';
12954 goto error;
12955 }
12956 rb_enc_associate(str, rb_ascii8bit_encoding());
12957 }
12958 else if (p->enc == rb_usascii_encoding()) {
12959 if (rb_enc_str_coderange(str) != ENC_CODERANGE_7BIT) {
12960 /* raise in re.c */
12961 rb_enc_associate(str, rb_usascii_encoding());
12962 }
12963 else {
12964 rb_enc_associate(str, rb_ascii8bit_encoding());
12965 }
12966 }
12967 return 0;
12968
12969 error:
12970 return c;
12971 }
12972
12973 static void
12974 reg_fragment_setenc(struct parser_params* p, VALUE str, int options)
12975 {
12976 int c = rb_reg_fragment_setenc(p, str, options);
12977 if (c) reg_fragment_enc_error(p, str, c);
12978 }
12979
12980 static int
12981 reg_fragment_check(struct parser_params* p, VALUE str, int options)
12982 {
12983 VALUE err;
12984 reg_fragment_setenc(p, str, options);
12985 err = rb_reg_check_preprocess(str);
12986 if (err != Qnil) {
12987 err = rb_obj_as_string(err);
12988 compile_error(p, "%"PRIsVALUE, err);
12989 return 0;
12990 }
12991 return 1;
12992 }
12993
12994 typedef struct {
12995 struct parser_params* parser;
12996 rb_encoding *enc;
12997 NODE *succ_block;
12998 const YYLTYPE *loc;
12999 } reg_named_capture_assign_t;
13000
13001 static int
13002 reg_named_capture_assign_iter(const OnigUChar *name, const OnigUChar *name_end,
13003 int back_num, int *back_refs, OnigRegex regex, void *arg0)
13004 {
13005 reg_named_capture_assign_t *arg = (reg_named_capture_assign_t*)arg0;
13006 struct parser_params* p = arg->parser;
13007 rb_encoding *enc = arg->enc;
13008 long len = name_end - name;
13009 const char *s = (const char *)name;
13010 ID var;
13011 NODE *node, *succ;
13012
13013 if (!len) return ST_CONTINUE;
13014 if (rb_enc_symname_type(s, len, enc, (1U<<ID_LOCAL)) != ID_LOCAL)
13015 return ST_CONTINUE;
13016
13017 var = intern_cstr(s, len, enc);
13018 if (len < MAX_WORD_LENGTH && rb_reserved_word(s, (int)len)) {
13019 if (!lvar_defined(p, var)) return ST_CONTINUE;
13020 }
13021 node = node_assign(p, assignable(p, var, 0, arg->loc), NEW_LIT(ID2SYM(var), arg->loc), NO_LEX_CTXT, arg->loc);
13022 succ = arg->succ_block;
13023 if (!succ) succ = NEW_BEGIN(0, arg->loc);
13024 succ = block_append(p, succ, node);
13025 arg->succ_block = succ;
13026 return ST_CONTINUE;
13027 }
13028
13029 static NODE *
13030 reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc)
13031 {
13032 reg_named_capture_assign_t arg;
13033
13034 arg.parser = p;
13035 arg.enc = rb_enc_get(regexp);
13036 arg.succ_block = 0;
13037 arg.loc = loc;
13038 onig_foreach_name(RREGEXP_PTR(regexp), reg_named_capture_assign_iter, &arg);
13039
13040 if (!arg.succ_block) return 0;
13041 return arg.succ_block->nd_next;
13042 }
13043
13044 static VALUE
13045 parser_reg_compile(struct parser_params* p, VALUE str, int options)
13046 {
13047 reg_fragment_setenc(p, str, options);
13048 return rb_parser_reg_compile(p, str, options);
13049 }
13050
13051 VALUE
13052 rb_parser_reg_compile(struct parser_params* p, VALUE str, int options)
13053 {
13054 return rb_reg_compile(str, options & RE_OPTION_MASK, p->ruby_sourcefile, p->ruby_sourceline);
13055 }
13056
13057 static VALUE
13058 reg_compile(struct parser_params* p, VALUE str, int options)
13059 {
13060 VALUE re;
13061 VALUE err;
13062
13063 err = rb_errinfo();
13064 re = parser_reg_compile(p, str, options);
13065 if (NIL_P(re)) {
13066 VALUE m = rb_attr_get(rb_errinfo(), idMesg);
13067 rb_set_errinfo(err);
13068 compile_error(p, "%"PRIsVALUE, m);
13069 return Qnil;
13070 }
13071 return re;
13072 }
13073 #else
13074 static VALUE
13075 parser_reg_compile(struct parser_params* p, VALUE str, int options, VALUE *errmsg)
13076 {
13077 VALUE err = rb_errinfo();
13078 VALUE re;
13079 str = ripper_is_node_yylval(str) ? RNODE(str)->nd_cval : str;
13080 int c = rb_reg_fragment_setenc(p, str, options);
13081 if (c) reg_fragment_enc_error(p, str, c);
13082 re = rb_parser_reg_compile(p, str, options);
13083 if (NIL_P(re)) {
13084 *errmsg = rb_attr_get(rb_errinfo(), idMesg);
13085 rb_set_errinfo(err);
13086 }
13087 return re;
13088 }
13089 #endif
13090
13091 #ifndef RIPPER
13092 void
13093 rb_parser_set_options(VALUE vparser, int print, int loop, int chomp, int split)
13094 {
13095 struct parser_params *p;
13096 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13097 p->do_print = print;
13098 p->do_loop = loop;
13099 p->do_chomp = chomp;
13100 p->do_split = split;
13101 }
13102
13103 static NODE *
13104 parser_append_options(struct parser_params *p, NODE *node)
13105 {
13106 static const YYLTYPE default_location = {{1, 0}, {1, 0}};
13107 const YYLTYPE *const LOC = &default_location;
13108
13109 if (p->do_print) {
13110 NODE *print = NEW_FCALL(rb_intern("print"),
13111 NEW_LIST(NEW_GVAR(idLASTLINE, LOC), LOC),
13112 LOC);
13113 node = block_append(p, node, print);
13114 }
13115
13116 if (p->do_loop) {
13117 if (p->do_split) {
13118 ID ifs = rb_intern("$;");
13119 ID fields = rb_intern("$F");
13120 NODE *args = NEW_LIST(NEW_GVAR(ifs, LOC), LOC);
13121 NODE *split = NEW_GASGN(fields,
13122 NEW_CALL(NEW_GVAR(idLASTLINE, LOC),
13123 rb_intern("split"), args, LOC),
13124 LOC);
13125 node = block_append(p, split, node);
13126 }
13127 if (p->do_chomp) {
13128 NODE *chomp = NEW_CALL(NEW_GVAR(idLASTLINE, LOC),
13129 rb_intern("chomp!"), 0, LOC);
13130 node = block_append(p, chomp, node);
13131 }
13132
13133 node = NEW_WHILE(NEW_VCALL(idGets, LOC), node, 1, LOC);
13134 }
13135
13136 return node;
13137 }
13138
13139 void
13140 rb_init_parse(void)
13141 {
13142 /* just to suppress unused-function warnings */
13143 (void)nodetype;
13144 (void)nodeline;
13145 }
13146
13147 static ID
13148 internal_id(struct parser_params *p)
13149 {
13150 return rb_make_temporary_id(vtable_size(p->lvtbl->args) + vtable_size(p->lvtbl->vars));
13151 }
13152 #endif /* !RIPPER */
13153
13154 static void
13155 parser_initialize(struct parser_params *p)
13156 {
13157 /* note: we rely on TypedData_Make_Struct to set most fields to 0 */
13158 p->command_start = TRUE;
13159 p->ruby_sourcefile_string = Qnil;
13160 p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE at first */
13161 p->node_id = 0;
13162 #ifdef RIPPER
13163 p->delayed.token = Qnil;
13164 p->result = Qnil;
13165 p->parsing_thread = Qnil;
13166 #else
13167 p->error_buffer = Qfalse;
13168 #endif
13169 p->debug_buffer = Qnil;
13170 p->debug_output = rb_ractor_stdout();
13171 p->enc = rb_utf8_encoding();
13172 }
13173
13174 #ifdef RIPPER
13175 #define parser_mark ripper_parser_mark
13176 #define parser_free ripper_parser_free
13177 #endif
13178
13179 static void
13180 parser_mark(void *ptr)
13181 {
13182 struct parser_params *p = (struct parser_params*)ptr;
13183
13184 rb_gc_mark(p->lex.input);
13185 rb_gc_mark(p->lex.prevline);
13186 rb_gc_mark(p->lex.lastline);
13187 rb_gc_mark(p->lex.nextline);
13188 rb_gc_mark(p->ruby_sourcefile_string);
13189 rb_gc_mark((VALUE)p->lex.strterm);
13190 rb_gc_mark((VALUE)p->ast);
13191 rb_gc_mark(p->case_labels);
13192 #ifndef RIPPER
13193 rb_gc_mark(p->debug_lines);
13194 rb_gc_mark(p->compile_option);
13195 rb_gc_mark(p->error_buffer);
13196 #else
13197 rb_gc_mark(p->delayed.token);
13198 rb_gc_mark(p->value);
13199 rb_gc_mark(p->result);
13200 rb_gc_mark(p->parsing_thread);
13201 #endif
13202 rb_gc_mark(p->debug_buffer);
13203 rb_gc_mark(p->debug_output);
13204 #ifdef YYMALLOC
13205 rb_gc_mark((VALUE)p->heap);
13206 #endif
13207 }
13208
13209 static void
13210 parser_free(void *ptr)
13211 {
13212 struct parser_params *p = (struct parser_params*)ptr;
13213 struct local_vars *local, *prev;
13214
13215 if (p->tokenbuf) {
13216 ruby_sized_xfree(p->tokenbuf, p->toksiz);
13217 }
13218 for (local = p->lvtbl; local; local = prev) {
13219 if (local->vars) xfree(local->vars);
13220 prev = local->prev;
13221 xfree(local);
13222 }
13223 {
13224 token_info *ptinfo;
13225 while ((ptinfo = p->token_info) != 0) {
13226 p->token_info = ptinfo->next;
13227 xfree(ptinfo);
13228 }
13229 }
13230 xfree(ptr);
13231 }
13232
13233 static size_t
13234 parser_memsize(const void *ptr)
13235 {
13236 struct parser_params *p = (struct parser_params*)ptr;
13237 struct local_vars *local;
13238 size_t size = sizeof(*p);
13239
13240 size += p->toksiz;
13241 for (local = p->lvtbl; local; local = local->prev) {
13242 size += sizeof(*local);
13243 if (local->vars) size += local->vars->capa * sizeof(ID);
13244 }
13245 return size;
13246 }
13247
13248 static const rb_data_type_t parser_data_type = {
13249 #ifndef RIPPER
13250 "parser",
13251 #else
13252 "ripper",
13253 #endif
13254 {
13255 parser_mark,
13256 parser_free,
13257 parser_memsize,
13258 },
13259 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
13260 };
13261
13262 #ifndef RIPPER
13263 #undef rb_reserved_word
13264
13265 const struct kwtable *
13266 rb_reserved_word(const char *str, unsigned int len)
13267 {
13268 return reserved_word(str, len);
13269 }
13270
13271 VALUE
13272 rb_parser_new(void)
13273 {
13274 struct parser_params *p;
13275 VALUE parser = TypedData_Make_Struct(0, struct parser_params,
13276 &parser_data_type, p);
13277 parser_initialize(p);
13278 return parser;
13279 }
13280
13281 VALUE
13282 rb_parser_set_context(VALUE vparser, const struct rb_iseq_struct *base, int main)
13283 {
13284 struct parser_params *p;
13285
13286 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13287 p->error_buffer = main ? Qfalse : Qnil;
13288 p->parent_iseq = base;
13289 return vparser;
13290 }
13291
13292 void
13293 rb_parser_keep_script_lines(VALUE vparser)
13294 {
13295 struct parser_params *p;
13296
13297 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13298 p->keep_script_lines = 1;
13299 }
13300 #endif
13301
13302 #ifdef RIPPER
13303 #define rb_parser_end_seen_p ripper_parser_end_seen_p
13304 #define rb_parser_encoding ripper_parser_encoding
13305 #define rb_parser_get_yydebug ripper_parser_get_yydebug
13306 #define rb_parser_set_yydebug ripper_parser_set_yydebug
13307 #define rb_parser_get_debug_output ripper_parser_get_debug_output
13308 #define rb_parser_set_debug_output ripper_parser_set_debug_output
13309 static VALUE ripper_parser_end_seen_p(VALUE vparser);
13310 static VALUE ripper_parser_encoding(VALUE vparser);
13311 static VALUE ripper_parser_get_yydebug(VALUE self);
13312 static VALUE ripper_parser_set_yydebug(VALUE self, VALUE flag);
13313 static VALUE ripper_parser_get_debug_output(VALUE self);
13314 static VALUE ripper_parser_set_debug_output(VALUE self, VALUE output);
13315
13316 /*
13317 * call-seq:
13318 * ripper.error? -> Boolean
13319 *
13320 * Return true if parsed source has errors.
13321 */
13322 static VALUE
13323 ripper_error_p(VALUE vparser)
13324 {
13325 struct parser_params *p;
13326
13327 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13328 return RBOOL(p->error_p);
13329 }
13330 #endif
13331
13332 /*
13333 * call-seq:
13334 * ripper.end_seen? -> Boolean
13335 *
13336 * Return true if parsed source ended by +\_\_END\_\_+.
13337 */
13338 VALUE
13339 rb_parser_end_seen_p(VALUE vparser)
13340 {
13341 struct parser_params *p;
13342
13343 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13344 return RBOOL(p->ruby__end__seen);
13345 }
13346
13347 /*
13348 * call-seq:
13349 * ripper.encoding -> encoding
13350 *
13351 * Return encoding of the source.
13352 */
13353 VALUE
13354 rb_parser_encoding(VALUE vparser)
13355 {
13356 struct parser_params *p;
13357
13358 TypedData_Get_Struct(vparser, struct parser_params, &parser_data_type, p);
13359 return rb_enc_from_encoding(p->enc);
13360 }
13361
13362 #ifdef RIPPER
13363 /*
13364 * call-seq:
13365 * ripper.yydebug -> true or false
13366 *
13367 * Get yydebug.
13368 */
13369 VALUE
13370 rb_parser_get_yydebug(VALUE self)
13371 {
13372 struct parser_params *p;
13373
13374 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13375 return RBOOL(p->debug);
13376 }
13377 #endif
13378
13379 /*
13380 * call-seq:
13381 * ripper.yydebug = flag
13382 *
13383 * Set yydebug.
13384 */
13385 VALUE
13386 rb_parser_set_yydebug(VALUE self, VALUE flag)
13387 {
13388 struct parser_params *p;
13389
13390 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13391 p->debug = RTEST(flag);
13392 return flag;
13393 }
13394
13395 /*
13396 * call-seq:
13397 * ripper.debug_output -> obj
13398 *
13399 * Get debug output.
13400 */
13401 VALUE
13402 rb_parser_get_debug_output(VALUE self)
13403 {
13404 struct parser_params *p;
13405
13406 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13407 return p->debug_output;
13408 }
13409
13410 /*
13411 * call-seq:
13412 * ripper.debug_output = obj
13413 *
13414 * Set debug output.
13415 */
13416 VALUE
13417 rb_parser_set_debug_output(VALUE self, VALUE output)
13418 {
13419 struct parser_params *p;
13420
13421 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13422 return p->debug_output = output;
13423 }
13424
13425 #ifndef RIPPER
13426 #ifdef YYMALLOC
13427 #define HEAPCNT(n, size) ((n) * (size) / sizeof(YYSTYPE))
13428 /* Keep the order; NEWHEAP then xmalloc and ADD2HEAP to get rid of
13429 * potential memory leak */
13430 #define NEWHEAP() rb_imemo_tmpbuf_parser_heap(0, p->heap, 0)
13431 #define ADD2HEAP(new, cnt, ptr) ((p->heap = (new))->ptr = (ptr), \
13432 (new)->cnt = (cnt), (ptr))
13433
13434 void *
13435 rb_parser_malloc(struct parser_params *p, size_t size)
13436 {
13437 size_t cnt = HEAPCNT(1, size);
13438 rb_imemo_tmpbuf_t *n = NEWHEAP();
13439 void *ptr = xmalloc(size);
13440
13441 return ADD2HEAP(n, cnt, ptr);
13442 }
13443
13444 void *
13445 rb_parser_calloc(struct parser_params *p, size_t nelem, size_t size)
13446 {
13447 size_t cnt = HEAPCNT(nelem, size);
13448 rb_imemo_tmpbuf_t *n = NEWHEAP();
13449 void *ptr = xcalloc(nelem, size);
13450
13451 return ADD2HEAP(n, cnt, ptr);
13452 }
13453
13454 void *
13455 rb_parser_realloc(struct parser_params *p, void *ptr, size_t size)
13456 {
13457 rb_imemo_tmpbuf_t *n;
13458 size_t cnt = HEAPCNT(1, size);
13459
13460 if (ptr && (n = p->heap) != NULL) {
13461 do {
13462 if (n->ptr == ptr) {
13463 n->ptr = ptr = xrealloc(ptr, size);
13464 if (n->cnt) n->cnt = cnt;
13465 return ptr;
13466 }
13467 } while ((n = n->next) != NULL);
13468 }
13469 n = NEWHEAP();
13470 ptr = xrealloc(ptr, size);
13471 return ADD2HEAP(n, cnt, ptr);
13472 }
13473
13474 void
13475 rb_parser_free(struct parser_params *p, void *ptr)
13476 {
13477 rb_imemo_tmpbuf_t **prev = &p->heap, *n;
13478
13479 while ((n = *prev) != NULL) {
13480 if (n->ptr == ptr) {
13481 *prev = n->next;
13482 break;
13483 }
13484 prev = &n->next;
13485 }
13486 }
13487 #endif
13488
13489 void
13490 rb_parser_printf(struct parser_params *p, const char *fmt, ...)
13491 {
13492 va_list ap;
13493 VALUE mesg = p->debug_buffer;
13494
13495 if (NIL_P(mesg)) p->debug_buffer = mesg = rb_str_new(0, 0);
13496 va_start(ap, fmt);
13497 rb_str_vcatf(mesg, fmt, ap);
13498 va_end(ap);
13499 if (RSTRING_END(mesg)[-1] == '\n') {
13500 rb_io_write(p->debug_output, mesg);
13501 p->debug_buffer = Qnil;
13502 }
13503 }
13504
13505 static void
13506 parser_compile_error(struct parser_params *p, const char *fmt, ...)
13507 {
13508 va_list ap;
13509
13510 rb_io_flush(p->debug_output);
13511 p->error_p = 1;
13512 va_start(ap, fmt);
13513 p->error_buffer =
13514 rb_syntax_error_append(p->error_buffer,
13515 p->ruby_sourcefile_string,
13516 p->ruby_sourceline,
13517 rb_long2int(p->lex.pcur - p->lex.pbeg),
13518 p->enc, fmt, ap);
13519 va_end(ap);
13520 }
13521
13522 static size_t
13523 count_char(const char *str, int c)
13524 {
13525 int n = 0;
13526 while (str[n] == c) ++n;
13527 return n;
13528 }
13529
13530 /*
13531 * strip enclosing double-quotes, same as the default yytnamerr except
13532 * for that single-quotes matching back-quotes do not stop stripping.
13533 *
13534 * "\"`class' keyword\"" => "`class' keyword"
13535 */
13536 RUBY_FUNC_EXPORTED size_t
13537 rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr)
13538 {
13539 if (*yystr == '"') {
13540 size_t yyn = 0, bquote = 0;
13541 const char *yyp = yystr;
13542
13543 while (*++yyp) {
13544 switch (*yyp) {
13545 case '`':
13546 if (!bquote) {
13547 bquote = count_char(yyp+1, '`') + 1;
13548 if (yyres) memcpy(&yyres[yyn], yyp, bquote);
13549 yyn += bquote;
13550 yyp += bquote - 1;
13551 break;
13552 }
13553 goto default_char;
13554
13555 case '\'':
13556 if (bquote && count_char(yyp+1, '\'') + 1 == bquote) {
13557 if (yyres) memcpy(yyres + yyn, yyp, bquote);
13558 yyn += bquote;
13559 yyp += bquote - 1;
13560 bquote = 0;
13561 break;
13562 }
13563 if (yyp[1] && yyp[1] != '\'' && yyp[2] == '\'') {
13564 if (yyres) memcpy(yyres + yyn, yyp, 3);
13565 yyn += 3;
13566 yyp += 2;
13567 break;
13568 }
13569 goto do_not_strip_quotes;
13570
13571 case ',':
13572 goto do_not_strip_quotes;
13573
13574 case '\\':
13575 if (*++yyp != '\\')
13576 goto do_not_strip_quotes;
13577 /* Fall through. */
13578 default_char:
13579 default:
13580 if (yyres)
13581 yyres[yyn] = *yyp;
13582 yyn++;
13583 break;
13584
13585 case '"':
13586 case '\0':
13587 if (yyres)
13588 yyres[yyn] = '\0';
13589 return yyn;
13590 }
13591 }
13592 do_not_strip_quotes: ;
13593 }
13594
13595 if (!yyres) return strlen(yystr);
13596
13597 return (YYSIZE_T)(yystpcpy(yyres, yystr) - yyres);
13598 }
13599 #endif
13600
13601 #ifdef RIPPER
13602 #ifdef RIPPER_DEBUG
13603 /* :nodoc: */
13604 static VALUE
13605 ripper_validate_object(VALUE self, VALUE x)
13606 {
13607 if (x == Qfalse) return x;
13608 if (x == Qtrue) return x;
13609 if (x == Qnil) return x;
13610 if (x == Qundef)
13611 rb_raise(rb_eArgError, "Qundef given");
13612 if (FIXNUM_P(x)) return x;
13613 if (SYMBOL_P(x)) return x;
13614 switch (BUILTIN_TYPE(x)) {
13615 case T_STRING:
13616 case T_OBJECT:
13617 case T_ARRAY:
13618 case T_BIGNUM:
13619 case T_FLOAT:
13620 case T_COMPLEX:
13621 case T_RATIONAL:
13622 break;
13623 case T_NODE:
13624 if (!nd_type_p((NODE *)x, NODE_RIPPER)) {
13625 rb_raise(rb_eArgError, "NODE given: %p", (void *)x);
13626 }
13627 x = ((NODE *)x)->nd_rval;
13628 break;
13629 default:
13630 rb_raise(rb_eArgError, "wrong type of ruby object: %p (%s)",
13631 (void *)x, rb_obj_classname(x));
13632 }
13633 if (!RBASIC_CLASS(x)) {
13634 rb_raise(rb_eArgError, "hidden ruby object: %p (%s)",
13635 (void *)x, rb_builtin_type_name(TYPE(x)));
13636 }
13637 return x;
13638 }
13639 #endif
13640
13641 #define validate(x) ((x) = get_value(x))
13642
13643 static VALUE
13644 ripper_dispatch0(struct parser_params *p, ID mid)
13645 {
13646 return rb_funcall(p->value, mid, 0);
13647 }
13648
13649 static VALUE
13650 ripper_dispatch1(struct parser_params *p, ID mid, VALUE a)
13651 {
13652 validate(a);
13653 return rb_funcall(p->value, mid, 1, a);
13654 }
13655
13656 static VALUE
13657 ripper_dispatch2(struct parser_params *p, ID mid, VALUE a, VALUE b)
13658 {
13659 validate(a);
13660 validate(b);
13661 return rb_funcall(p->value, mid, 2, a, b);
13662 }
13663
13664 static VALUE
13665 ripper_dispatch3(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c)
13666 {
13667 validate(a);
13668 validate(b);
13669 validate(c);
13670 return rb_funcall(p->value, mid, 3, a, b, c);
13671 }
13672
13673 static VALUE
13674 ripper_dispatch4(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d)
13675 {
13676 validate(a);
13677 validate(b);
13678 validate(c);
13679 validate(d);
13680 return rb_funcall(p->value, mid, 4, a, b, c, d);
13681 }
13682
13683 static VALUE
13684 ripper_dispatch5(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e)
13685 {
13686 validate(a);
13687 validate(b);
13688 validate(c);
13689 validate(d);
13690 validate(e);
13691 return rb_funcall(p->value, mid, 5, a, b, c, d, e);
13692 }
13693
13694 static VALUE
13695 ripper_dispatch7(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e, VALUE f, VALUE g)
13696 {
13697 validate(a);
13698 validate(b);
13699 validate(c);
13700 validate(d);
13701 validate(e);
13702 validate(f);
13703 validate(g);
13704 return rb_funcall(p->value, mid, 7, a, b, c, d, e, f, g);
13705 }
13706
13707 static ID
13708 ripper_get_id(VALUE v)
13709 {
13710 NODE *nd;
13711 if (!RB_TYPE_P(v, T_NODE)) return 0;
13712 nd = (NODE *)v;
13713 if (!nd_type_p(nd, NODE_RIPPER)) return 0;
13714 return nd->nd_vid;
13715 }
13716
13717 static VALUE
13718 ripper_get_value(VALUE v)
13719 {
13720 NODE *nd;
13721 if (v == Qundef) return Qnil;
13722 if (!RB_TYPE_P(v, T_NODE)) return v;
13723 nd = (NODE *)v;
13724 if (!nd_type_p(nd, NODE_RIPPER)) return Qnil;
13725 return nd->nd_rval;
13726 }
13727
13728 static void
13729 ripper_error(struct parser_params *p)
13730 {
13731 p->error_p = TRUE;
13732 }
13733
13734 static void
13735 ripper_compile_error(struct parser_params *p, const char *fmt, ...)
13736 {
13737 VALUE str;
13738 va_list args;
13739
13740 va_start(args, fmt);
13741 str = rb_vsprintf(fmt, args);
13742 va_end(args);
13743 rb_funcall(p->value, rb_intern("compile_error"), 1, str);
13744 ripper_error(p);
13745 }
13746
13747 static VALUE
13748 ripper_lex_get_generic(struct parser_params *p, VALUE src)
13749 {
13750 VALUE line = rb_funcallv_public(src, id_gets, 0, 0);
13751 if (!NIL_P(line) && !RB_TYPE_P(line, T_STRING)) {
13752 rb_raise(rb_eTypeError,
13753 "gets returned %"PRIsVALUE" (expected String or nil)",
13754 rb_obj_class(line));
13755 }
13756 return line;
13757 }
13758
13759 static VALUE
13760 ripper_lex_io_get(struct parser_params *p, VALUE src)
13761 {
13762 return rb_io_gets(src);
13763 }
13764
13765 static VALUE
13766 ripper_s_allocate(VALUE klass)
13767 {
13768 struct parser_params *p;
13769 VALUE self = TypedData_Make_Struct(klass, struct parser_params,
13770 &parser_data_type, p);
13771 p->value = self;
13772 return self;
13773 }
13774
13775 #define ripper_initialized_p(r) ((r)->lex.input != 0)
13776
13777 /*
13778 * call-seq:
13779 * Ripper.new(src, filename="(ripper)", lineno=1) -> ripper
13780 *
13781 * Create a new Ripper object.
13782 * _src_ must be a String, an IO, or an Object which has #gets method.
13783 *
13784 * This method does not starts parsing.
13785 * See also Ripper#parse and Ripper.parse.
13786 */
13787 static VALUE
13788 ripper_initialize(int argc, VALUE *argv, VALUE self)
13789 {
13790 struct parser_params *p;
13791 VALUE src, fname, lineno;
13792
13793 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13794 rb_scan_args(argc, argv, "12", &src, &fname, &lineno);
13795 if (RB_TYPE_P(src, T_FILE)) {
13796 p->lex.gets = ripper_lex_io_get;
13797 }
13798 else if (rb_respond_to(src, id_gets)) {
13799 p->lex.gets = ripper_lex_get_generic;
13800 }
13801 else {
13802 StringValue(src);
13803 p->lex.gets = lex_get_str;
13804 }
13805 p->lex.input = src;
13806 p->eofp = 0;
13807 if (NIL_P(fname)) {
13808 fname = STR_NEW2("(ripper)");
13809 OBJ_FREEZE(fname);
13810 }
13811 else {
13812 StringValueCStr(fname);
13813 fname = rb_str_new_frozen(fname);
13814 }
13815 parser_initialize(p);
13816
13817 p->ruby_sourcefile_string = fname;
13818 p->ruby_sourcefile = RSTRING_PTR(fname);
13819 p->ruby_sourceline = NIL_P(lineno) ? 0 : NUM2INT(lineno) - 1;
13820
13821 return Qnil;
13822 }
13823
13824 static VALUE
13825 ripper_parse0(VALUE parser_v)
13826 {
13827 struct parser_params *p;
13828
13829 TypedData_Get_Struct(parser_v, struct parser_params, &parser_data_type, p);
13830 parser_prepare(p);
13831 p->ast = rb_ast_new();
13832 ripper_yyparse((void*)p);
13833 rb_ast_dispose(p->ast);
13834 p->ast = 0;
13835 return p->result;
13836 }
13837
13838 static VALUE
13839 ripper_ensure(VALUE parser_v)
13840 {
13841 struct parser_params *p;
13842
13843 TypedData_Get_Struct(parser_v, struct parser_params, &parser_data_type, p);
13844 p->parsing_thread = Qnil;
13845 return Qnil;
13846 }
13847
13848 /*
13849 * call-seq:
13850 * ripper.parse
13851 *
13852 * Start parsing and returns the value of the root action.
13853 */
13854 static VALUE
13855 ripper_parse(VALUE self)
13856 {
13857 struct parser_params *p;
13858
13859 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13860 if (!ripper_initialized_p(p)) {
13861 rb_raise(rb_eArgError, "method called for uninitialized object");
13862 }
13863 if (!NIL_P(p->parsing_thread)) {
13864 if (p->parsing_thread == rb_thread_current())
13865 rb_raise(rb_eArgError, "Ripper#parse is not reentrant");
13866 else
13867 rb_raise(rb_eArgError, "Ripper#parse is not multithread-safe");
13868 }
13869 p->parsing_thread = rb_thread_current();
13870 rb_ensure(ripper_parse0, self, ripper_ensure, self);
13871
13872 return p->result;
13873 }
13874
13875 /*
13876 * call-seq:
13877 * ripper.column -> Integer
13878 *
13879 * Return column number of current parsing line.
13880 * This number starts from 0.
13881 */
13882 static VALUE
13883 ripper_column(VALUE self)
13884 {
13885 struct parser_params *p;
13886 long col;
13887
13888 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13889 if (!ripper_initialized_p(p)) {
13890 rb_raise(rb_eArgError, "method called for uninitialized object");
13891 }
13892 if (NIL_P(p->parsing_thread)) return Qnil;
13893 col = p->lex.ptok - p->lex.pbeg;
13894 return LONG2NUM(col);
13895 }
13896
13897 /*
13898 * call-seq:
13899 * ripper.filename -> String
13900 *
13901 * Return current parsing filename.
13902 */
13903 static VALUE
13904 ripper_filename(VALUE self)
13905 {
13906 struct parser_params *p;
13907
13908 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13909 if (!ripper_initialized_p(p)) {
13910 rb_raise(rb_eArgError, "method called for uninitialized object");
13911 }
13912 return p->ruby_sourcefile_string;
13913 }
13914
13915 /*
13916 * call-seq:
13917 * ripper.lineno -> Integer
13918 *
13919 * Return line number of current parsing line.
13920 * This number starts from 1.
13921 */
13922 static VALUE
13923 ripper_lineno(VALUE self)
13924 {
13925 struct parser_params *p;
13926
13927 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13928 if (!ripper_initialized_p(p)) {
13929 rb_raise(rb_eArgError, "method called for uninitialized object");
13930 }
13931 if (NIL_P(p->parsing_thread)) return Qnil;
13932 return INT2NUM(p->ruby_sourceline);
13933 }
13934
13935 /*
13936 * call-seq:
13937 * ripper.state -> Integer
13938 *
13939 * Return scanner state of current token.
13940 */
13941 static VALUE
13942 ripper_state(VALUE self)
13943 {
13944 struct parser_params *p;
13945
13946 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13947 if (!ripper_initialized_p(p)) {
13948 rb_raise(rb_eArgError, "method called for uninitialized object");
13949 }
13950 if (NIL_P(p->parsing_thread)) return Qnil;
13951 return INT2NUM(p->lex.state);
13952 }
13953
13954 /*
13955 * call-seq:
13956 * ripper.token -> String
13957 *
13958 * Return the current token string.
13959 */
13960 static VALUE
13961 ripper_token(VALUE self)
13962 {
13963 struct parser_params *p;
13964 long pos, len;
13965
13966 TypedData_Get_Struct(self, struct parser_params, &parser_data_type, p);
13967 if (!ripper_initialized_p(p)) {
13968 rb_raise(rb_eArgError, "method called for uninitialized object");
13969 }
13970 if (NIL_P(p->parsing_thread)) return Qnil;
13971 pos = p->lex.ptok - p->lex.pbeg;
13972 len = p->lex.pcur - p->lex.ptok;
13973 return rb_str_subseq(p->lex.lastline, pos, len);
13974 }
13975
13976 #ifdef RIPPER_DEBUG
13977 /* :nodoc: */
13978 static VALUE
13979 ripper_assert_Qundef(VALUE self, VALUE obj, VALUE msg)
13980 {
13981 StringValue(msg);
13982 if (obj == Qundef) {
13983 rb_raise(rb_eArgError, "%"PRIsVALUE, msg);
13984 }
13985 return Qnil;
13986 }
13987
13988 /* :nodoc: */
13989 static VALUE
13990 ripper_value(VALUE self, VALUE obj)
13991 {
13992 return ULONG2NUM(obj);
13993 }
13994 #endif
13995
13996 /*
13997 * call-seq:
13998 * Ripper.lex_state_name(integer) -> string
13999 *
14000 * Returns a string representation of lex_state.
14001 */
14002 static VALUE
14003 ripper_lex_state_name(VALUE self, VALUE state)
14004 {
14005 return rb_parser_lex_state_name(NUM2INT(state));
14006 }
14007
14008 void
14009 Init_ripper(void)
14010 {
14011 ripper_init_eventids1();
14012 ripper_init_eventids2();
14013 id_warn = rb_intern_const("warn");
14014 id_warning = rb_intern_const("warning");
14015 id_gets = rb_intern_const("gets");
14016 id_assoc = rb_intern_const("=>");
14017
14018 (void)yystpcpy; /* may not used in newer bison */
14019
14020 InitVM(ripper);
14021 }
14022
14023 void
14024 InitVM_ripper(void)
14025 {
14026 VALUE Ripper;
14027
14028 Ripper = rb_define_class("Ripper", rb_cObject);
14029 /* version of Ripper */
14030 rb_define_const(Ripper, "Version", rb_usascii_str_new2(RIPPER_VERSION));
14031 rb_define_alloc_func(Ripper, ripper_s_allocate);
14032 rb_define_method(Ripper, "initialize", ripper_initialize, -1);
14033 rb_define_method(Ripper, "parse", ripper_parse, 0);
14034 rb_define_method(Ripper, "column", ripper_column, 0);
14035 rb_define_method(Ripper, "filename", ripper_filename, 0);
14036 rb_define_method(Ripper, "lineno", ripper_lineno, 0);
14037 rb_define_method(Ripper, "state", ripper_state, 0);
14038 rb_define_method(Ripper, "token", ripper_token, 0);
14039 rb_define_method(Ripper, "end_seen?", rb_parser_end_seen_p, 0);
14040 rb_define_method(Ripper, "encoding", rb_parser_encoding, 0);
14041 rb_define_method(Ripper, "yydebug", rb_parser_get_yydebug, 0);
14042 rb_define_method(Ripper, "yydebug=", rb_parser_set_yydebug, 1);
14043 rb_define_method(Ripper, "debug_output", rb_parser_get_debug_output, 0);
14044 rb_define_method(Ripper, "debug_output=", rb_parser_set_debug_output, 1);
14045 rb_define_method(Ripper, "error?", ripper_error_p, 0);
14046 #ifdef RIPPER_DEBUG
14047 rb_define_method(Ripper, "assert_Qundef", ripper_assert_Qundef, 2);
14048 rb_define_method(Ripper, "rawVALUE", ripper_value, 1);
14049 rb_define_method(Ripper, "validate_object", ripper_validate_object, 1);
14050 #endif
14051
14052 rb_define_singleton_method(Ripper, "dedent_string", parser_dedent_string, 2);
14053 rb_define_private_method(Ripper, "dedent_string", parser_dedent_string, 2);
14054
14055 rb_define_singleton_method(Ripper, "lex_state_name", ripper_lex_state_name, 1);
14056
14057 <% @exprs.each do |expr, desc| -%>
14058 /* <%=desc%> */
14059 rb_define_const(Ripper, "<%=expr%>", INT2NUM(<%=expr%>));
14060 <% end %>
14061 ripper_init_eventids1_table(Ripper);
14062 ripper_init_eventids2_table(Ripper);
14063
14064 # if 0
14065 /* Hack to let RDoc document SCRIPT_LINES__ */
14066
14067 /*
14068 * When a Hash is assigned to +SCRIPT_LINES__+ the contents of files loaded
14069 * after the assignment will be added as an Array of lines with the file
14070 * name as the key.
14071 */
14072 rb_define_global_const("SCRIPT_LINES__", Qnil);
14073 #endif
14074
14075 }
14076 #endif /* RIPPER */
14077
14078 /*
14079 * Local variables:
14080 * mode: c
14081 * c-file-style: "ruby"
14082 * End:
14083 */
Ruby programming language (80x24.org development)