Ruby 4.0.5p0 (2026-05-20 revision 64336ffd0ee9e1f4c05891695a3d7b49cb709721)
parse.y
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
21/* For Ripper */
22#ifdef RUBY_EXTCONF_H
23# include RUBY_EXTCONF_H
24#endif
25
26#include "ruby/internal/config.h"
27
28#include <errno.h>
29
30#ifdef UNIVERSAL_PARSER
31
32#include "internal/ruby_parser.h"
33#include "parser_node.h"
34#include "universal_parser.c"
35
36#ifdef RIPPER
37#define STATIC_ID2SYM p->config->static_id2sym
38#define rb_str_coderange_scan_restartable p->config->str_coderange_scan_restartable
39#endif
40
41#else
42
43#include "internal.h"
44#include "internal/compile.h"
45#include "internal/compilers.h"
46#include "internal/complex.h"
47#include "internal/encoding.h"
48#include "internal/error.h"
49#include "internal/hash.h"
50#include "internal/io.h"
51#include "internal/numeric.h"
52#include "internal/parse.h"
53#include "internal/rational.h"
54#include "internal/re.h"
55#include "internal/ruby_parser.h"
56#include "internal/symbol.h"
57#include "internal/thread.h"
58#include "internal/variable.h"
59#include "node.h"
60#include "parser_node.h"
61#include "probes.h"
62#include "regenc.h"
63#include "ruby/encoding.h"
64#include "ruby/regex.h"
65#include "ruby/ruby.h"
66#include "ruby/st.h"
67#include "ruby/util.h"
68#include "ruby/ractor.h"
69#include "symbol.h"
70
71#ifndef RIPPER
72static VALUE
73syntax_error_new(void)
74{
75 return rb_class_new_instance(0, 0, rb_eSyntaxError);
76}
77#endif
78
79static NODE *reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc, rb_parser_assignable_func assignable);
80
81#define compile_callback rb_suppress_tracing
82#endif /* !UNIVERSAL_PARSER */
83
84#define NODE_SPECIAL_EMPTY_ARGS ((NODE *)-1)
85#define NODE_EMPTY_ARGS_P(node) ((node) == NODE_SPECIAL_EMPTY_ARGS)
86
87static int rb_parser_string_hash_cmp(rb_parser_string_t *str1, rb_parser_string_t *str2);
88
89#ifndef RIPPER
90static rb_parser_string_t *rb_parser_string_deep_copy(struct parser_params *p, const rb_parser_string_t *original);
91#endif
92
93static int
94node_integer_cmp(rb_node_integer_t *n1, rb_node_integer_t *n2)
95{
96 return (n1->minus != n2->minus ||
97 n1->base != n2->base ||
98 strcmp(n1->val, n2->val));
99}
100
101static int
102node_float_cmp(rb_node_float_t *n1, rb_node_float_t *n2)
103{
104 return (n1->minus != n2->minus ||
105 strcmp(n1->val, n2->val));
106}
107
108static int
109node_rational_cmp(rb_node_rational_t *n1, rb_node_rational_t *n2)
110{
111 return (n1->minus != n2->minus ||
112 n1->base != n2->base ||
113 n1->seen_point != n2->seen_point ||
114 strcmp(n1->val, n2->val));
115}
116
117static int
118node_imaginary_cmp(rb_node_imaginary_t *n1, rb_node_imaginary_t *n2)
119{
120 return (n1->minus != n2->minus ||
121 n1->base != n2->base ||
122 n1->seen_point != n2->seen_point ||
123 n1->type != n2->type ||
124 strcmp(n1->val, n2->val));
125}
126
127static int
128rb_parser_regx_hash_cmp(rb_node_regx_t *n1, rb_node_regx_t *n2)
129{
130 return (n1->options != n2->options ||
131 rb_parser_string_hash_cmp(n1->string, n2->string));
132}
133
134static st_index_t rb_parser_str_hash(rb_parser_string_t *str);
135static st_index_t rb_char_p_hash(const char *c);
136
137static int
138literal_cmp(st_data_t val, st_data_t lit)
139{
140 if (val == lit) return 0;
141
142 NODE *node_val = RNODE(val);
143 NODE *node_lit = RNODE(lit);
144 enum node_type type_val = nd_type(node_val);
145 enum node_type type_lit = nd_type(node_lit);
146
147 if (type_val != type_lit) {
148 return -1;
149 }
150
151 switch (type_lit) {
152 case NODE_INTEGER:
153 return node_integer_cmp(RNODE_INTEGER(node_val), RNODE_INTEGER(node_lit));
154 case NODE_FLOAT:
155 return node_float_cmp(RNODE_FLOAT(node_val), RNODE_FLOAT(node_lit));
156 case NODE_RATIONAL:
157 return node_rational_cmp(RNODE_RATIONAL(node_val), RNODE_RATIONAL(node_lit));
158 case NODE_IMAGINARY:
159 return node_imaginary_cmp(RNODE_IMAGINARY(node_val), RNODE_IMAGINARY(node_lit));
160 case NODE_STR:
161 return rb_parser_string_hash_cmp(RNODE_STR(node_val)->string, RNODE_STR(node_lit)->string);
162 case NODE_SYM:
163 return rb_parser_string_hash_cmp(RNODE_SYM(node_val)->string, RNODE_SYM(node_lit)->string);
164 case NODE_REGX:
165 return rb_parser_regx_hash_cmp(RNODE_REGX(node_val), RNODE_REGX(node_lit));
166 case NODE_LINE:
167 return node_val->nd_loc.beg_pos.lineno != node_lit->nd_loc.beg_pos.lineno;
168 case NODE_FILE:
169 return rb_parser_string_hash_cmp(RNODE_FILE(node_val)->path, RNODE_FILE(node_lit)->path);
170 case NODE_ENCODING:
171 return RNODE_ENCODING(node_val)->enc != RNODE_ENCODING(node_lit)->enc;
172 default:
173#ifdef UNIVERSAL_PARSER
174 abort();
175#else
176 rb_bug("unexpected node: %s, %s", ruby_node_name(type_val), ruby_node_name(type_lit));
177#endif
178 }
179}
180
181static st_index_t
182literal_hash(st_data_t a)
183{
184 NODE *node = (NODE *)a;
185 enum node_type type = nd_type(node);
186
187 switch (type) {
188 case NODE_INTEGER:
189 return rb_char_p_hash(RNODE_INTEGER(node)->val);
190 case NODE_FLOAT:
191 return rb_char_p_hash(RNODE_FLOAT(node)->val);
192 case NODE_RATIONAL:
193 return rb_char_p_hash(RNODE_RATIONAL(node)->val);
194 case NODE_IMAGINARY:
195 return rb_char_p_hash(RNODE_IMAGINARY(node)->val);
196 case NODE_STR:
197 return rb_parser_str_hash(RNODE_STR(node)->string);
198 case NODE_SYM:
199 return rb_parser_str_hash(RNODE_SYM(node)->string);
200 case NODE_REGX:
201 return rb_parser_str_hash(RNODE_REGX(node)->string);
202 case NODE_LINE:
203 return (st_index_t)node->nd_loc.beg_pos.lineno;
204 case NODE_FILE:
205 return rb_parser_str_hash(RNODE_FILE(node)->path);
206 case NODE_ENCODING:
207 return (st_index_t)RNODE_ENCODING(node)->enc;
208 default:
209#ifdef UNIVERSAL_PARSER
210 abort();
211#else
212 rb_bug("unexpected node: %s", ruby_node_name(type));
213#endif
214 }
215}
216
217static inline int
218parse_isascii(int c)
219{
220 return '\0' <= c && c <= '\x7f';
221}
222
223#undef ISASCII
224#define ISASCII parse_isascii
225
226static inline int
227parse_isspace(int c)
228{
229 return c == ' ' || ('\t' <= c && c <= '\r');
230}
231
232#undef ISSPACE
233#define ISSPACE parse_isspace
234
235static inline int
236parse_iscntrl(int c)
237{
238 return ('\0' <= c && c < ' ') || c == '\x7f';
239}
240
241#undef ISCNTRL
242#define ISCNTRL(c) parse_iscntrl(c)
243
244static inline int
245parse_isupper(int c)
246{
247 return 'A' <= c && c <= 'Z';
248}
249
250static inline int
251parse_islower(int c)
252{
253 return 'a' <= c && c <= 'z';
254}
255
256static inline int
257parse_isalpha(int c)
258{
259 return parse_isupper(c) || parse_islower(c);
260}
261
262#undef ISALPHA
263#define ISALPHA(c) parse_isalpha(c)
264
265static inline int
266parse_isdigit(int c)
267{
268 return '0' <= c && c <= '9';
269}
270
271#undef ISDIGIT
272#define ISDIGIT(c) parse_isdigit(c)
273
274static inline int
275parse_isalnum(int c)
276{
277 return ISALPHA(c) || ISDIGIT(c);
278}
279
280#undef ISALNUM
281#define ISALNUM(c) parse_isalnum(c)
282
283static inline int
284parse_isxdigit(int c)
285{
286 return ISDIGIT(c) || ('A' <= c && c <= 'F') || ('a' <= c && c <= 'f');
287}
288
289#undef ISXDIGIT
290#define ISXDIGIT(c) parse_isxdigit(c)
291
292#include "parser_st.h"
293
294#undef STRCASECMP
295#define STRCASECMP rb_parser_st_locale_insensitive_strcasecmp
296
297#undef STRNCASECMP
298#define STRNCASECMP rb_parser_st_locale_insensitive_strncasecmp
299
300#ifdef RIPPER
301#include "ripper_init.h"
302#endif
303
304enum rescue_context {
305 before_rescue,
306 after_rescue,
307 after_else,
308 after_ensure,
309};
310
311struct lex_context {
312 unsigned int in_defined: 1;
313 unsigned int in_kwarg: 1;
314 unsigned int in_argdef: 1;
315 unsigned int in_def: 1;
316 unsigned int in_class: 1;
317 unsigned int has_trailing_semicolon: 1;
318 BITFIELD(enum rb_parser_shareability, shareable_constant_value, 2);
319 BITFIELD(enum rescue_context, in_rescue, 2);
320 unsigned int cant_return: 1;
321 unsigned int in_alt_pattern: 1;
322 unsigned int capture_in_pattern: 1;
323};
324
325typedef struct RNode_DEF_TEMP rb_node_def_temp_t;
326
327#if defined(__GNUC__) && !defined(__clang__)
328// Suppress "parameter passing for argument of type 'struct
329// lex_context' changed" notes. `struct lex_context` is file scope,
330// and has no ABI compatibility issue.
331RBIMPL_WARNING_PUSH()
332RBIMPL_WARNING_IGNORED(-Wpsabi)
333RBIMPL_WARNING_POP()
334// Not sure why effective even after popped.
335#endif
336
337#include "parse.h"
338
339#define NO_LEX_CTXT (struct lex_context){0}
340
341#ifndef WARN_PAST_SCOPE
342# define WARN_PAST_SCOPE 0
343#endif
344
345#define TAB_WIDTH 8
346
347#define yydebug (p->debug) /* disable the global variable definition */
348
349#define YYFPRINTF(out, ...) rb_parser_printf(p, __VA_ARGS__)
350#define YY_LOCATION_PRINT(File, loc, p) \
351 rb_parser_printf(p, "%d.%d-%d.%d", \
352 (loc).beg_pos.lineno, (loc).beg_pos.column,\
353 (loc).end_pos.lineno, (loc).end_pos.column)
354#define YYLLOC_DEFAULT(Current, Rhs, N) \
355 do \
356 if (N) \
357 { \
358 (Current).beg_pos = YYRHSLOC(Rhs, 1).beg_pos; \
359 (Current).end_pos = YYRHSLOC(Rhs, N).end_pos; \
360 } \
361 else \
362 { \
363 (Current).beg_pos = YYRHSLOC(Rhs, 0).end_pos; \
364 (Current).end_pos = YYRHSLOC(Rhs, 0).end_pos; \
365 } \
366 while (0)
367#define YY_(Msgid) \
368 (((Msgid)[0] == 'm') && (strcmp((Msgid), "memory exhausted") == 0) ? \
369 "nesting too deep" : (Msgid))
370
371#define RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(Current) \
372 rb_parser_set_location_from_strterm_heredoc(p, &p->lex.strterm->u.heredoc, &(Current))
373#define RUBY_SET_YYLLOC_OF_DELAYED_TOKEN(Current) \
374 rb_parser_set_location_of_delayed_token(p, &(Current))
375#define RUBY_SET_YYLLOC_OF_HEREDOC_END(Current) \
376 rb_parser_set_location_of_heredoc_end(p, &(Current))
377#define RUBY_SET_YYLLOC_OF_DUMMY_END(Current) \
378 rb_parser_set_location_of_dummy_end(p, &(Current))
379#define RUBY_SET_YYLLOC_OF_NONE(Current) \
380 rb_parser_set_location_of_none(p, &(Current))
381#define RUBY_SET_YYLLOC(Current) \
382 rb_parser_set_location(p, &(Current))
383#define RUBY_INIT_YYLLOC() \
384 { \
385 {p->ruby_sourceline, (int)(p->lex.ptok - p->lex.pbeg)}, \
386 {p->ruby_sourceline, (int)(p->lex.pcur - p->lex.pbeg)}, \
387 }
388
389#define IS_lex_state_for(x, ls) ((x) & (ls))
390#define IS_lex_state_all_for(x, ls) (((x) & (ls)) == (ls))
391#define IS_lex_state(ls) IS_lex_state_for(p->lex.state, (ls))
392#define IS_lex_state_all(ls) IS_lex_state_all_for(p->lex.state, (ls))
393
394# define SET_LEX_STATE(ls) \
395 parser_set_lex_state(p, ls, __LINE__)
396static inline enum lex_state_e parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line);
397
398typedef VALUE stack_type;
399
400static const rb_code_location_t NULL_LOC = { {0, -1}, {0, -1} };
401
402# define SHOW_BITSTACK(stack, name) (p->debug ? rb_parser_show_bitstack(p, stack, name, __LINE__) : (void)0)
403# define BITSTACK_PUSH(stack, n) (((p->stack) = ((p->stack)<<1)|((n)&1)), SHOW_BITSTACK(p->stack, #stack"(push)"))
404# define BITSTACK_POP(stack) (((p->stack) = (p->stack) >> 1), SHOW_BITSTACK(p->stack, #stack"(pop)"))
405# define BITSTACK_SET_P(stack) (SHOW_BITSTACK(p->stack, #stack), (p->stack)&1)
406# define BITSTACK_SET(stack, n) ((p->stack)=(n), SHOW_BITSTACK(p->stack, #stack"(set)"))
407
408/* A flag to identify keyword_do_cond, "do" keyword after condition expression.
409 Examples: `while ... do`, `until ... do`, and `for ... in ... do` */
410#define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
411#define COND_POP() BITSTACK_POP(cond_stack)
412#define COND_P() BITSTACK_SET_P(cond_stack)
413#define COND_SET(n) BITSTACK_SET(cond_stack, (n))
414
415/* A flag to identify keyword_do_block; "do" keyword after command_call.
416 Example: `foo 1, 2 do`. */
417#define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
418#define CMDARG_POP() BITSTACK_POP(cmdarg_stack)
419#define CMDARG_P() BITSTACK_SET_P(cmdarg_stack)
420#define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
421
422struct vtable {
423 ID *tbl;
424 int pos;
425 int capa;
426 struct vtable *prev;
427};
428
429struct local_vars {
430 struct vtable *args;
431 struct vtable *vars;
432 struct vtable *used;
433# if WARN_PAST_SCOPE
434 struct vtable *past;
435# endif
436 struct local_vars *prev;
437 struct {
438 NODE *outer, *inner, *current;
439 } numparam;
440 NODE *it;
441};
442
443typedef struct rb_locations_lambda_body_t {
444 NODE *node;
445 YYLTYPE opening_loc;
446 YYLTYPE closing_loc;
447} rb_locations_lambda_body_t;
448
449enum {
450 ORDINAL_PARAM = -1,
451 NO_PARAM = 0,
452 NUMPARAM_MAX = 9,
453};
454
455#define DVARS_INHERIT ((void*)1)
456#define DVARS_TOPSCOPE NULL
457#define DVARS_TERMINAL_P(tbl) ((tbl) == DVARS_INHERIT || (tbl) == DVARS_TOPSCOPE)
458
459typedef struct token_info {
460 const char *token;
461 rb_code_position_t beg;
462 int indent;
463 int nonspc;
464 struct token_info *next;
465} token_info;
466
467typedef struct end_expect_token_locations {
468 const rb_code_position_t *pos;
469 struct end_expect_token_locations *prev;
470} end_expect_token_locations_t;
471
472typedef struct parser_string_buffer_elem {
473 struct parser_string_buffer_elem *next;
474 long len; /* Total length of allocated buf */
475 long used; /* Current usage of buf */
476 rb_parser_string_t *buf[FLEX_ARY_LEN];
477} parser_string_buffer_elem_t;
478
479typedef struct parser_string_buffer {
480 parser_string_buffer_elem_t *head;
481 parser_string_buffer_elem_t *last;
482} parser_string_buffer_t;
483
484#define AFTER_HEREDOC_WITHOUT_TERMINATOR ((rb_parser_string_t *)1)
485
486/*
487 Structure of Lexer Buffer:
488
489 lex.pbeg lex.ptok lex.pcur lex.pend
490 | | | |
491 |------------+------------+------------|
492 |<---------->|
493 token
494*/
495struct parser_params {
496 YYSTYPE *lval;
497 YYLTYPE *yylloc;
498
499 struct {
500 rb_strterm_t *strterm;
501 rb_parser_lex_gets_func *gets;
502 rb_parser_input_data input;
503 parser_string_buffer_t string_buffer;
504 rb_parser_string_t *lastline;
505 rb_parser_string_t *nextline;
506 const char *pbeg;
507 const char *pcur;
508 const char *pend;
509 const char *ptok;
510 enum lex_state_e state;
511 /* track the nest level of any parens "()[]{}" */
512 int paren_nest;
513 /* keep p->lex.paren_nest at the beginning of lambda "->" to detect tLAMBEG and keyword_do_LAMBDA */
514 int lpar_beg;
515 /* track the nest level of only braces "{}" */
516 int brace_nest;
517 } lex;
518 stack_type cond_stack;
519 stack_type cmdarg_stack;
520 int tokidx;
521 int toksiz;
522 int heredoc_end;
523 int heredoc_indent;
524 int heredoc_line_indent;
525 char *tokenbuf;
526 struct local_vars *lvtbl;
527 st_table *pvtbl;
528 st_table *pktbl;
529 int line_count;
530 int ruby_sourceline; /* current line no. */
531 const char *ruby_sourcefile; /* current source file */
532 VALUE ruby_sourcefile_string;
533 rb_encoding *enc;
534 token_info *token_info;
535 st_table *case_labels;
536 rb_node_exits_t *exits;
537
538 VALUE debug_buffer;
539 VALUE debug_output;
540
541 struct {
542 rb_parser_string_t *token;
543 int beg_line;
544 int beg_col;
545 int end_line;
546 int end_col;
547 } delayed;
548
549 rb_ast_t *ast;
550 int node_id;
551
552 st_table *warn_duplicate_keys_table;
553
554 int max_numparam;
555 ID it_id;
556
557 struct lex_context ctxt;
558
559 NODE *eval_tree_begin;
560 NODE *eval_tree;
561 const struct rb_iseq_struct *parent_iseq;
562
563#ifdef UNIVERSAL_PARSER
564 const rb_parser_config_t *config;
565#endif
566 /* compile_option */
567 signed int frozen_string_literal:2; /* -1: not specified, 0: false, 1: true */
568
569 unsigned int command_start:1;
570 unsigned int eofp: 1;
571 unsigned int ruby__end__seen: 1;
572 unsigned int debug: 1;
573 unsigned int has_shebang: 1;
574 unsigned int token_seen: 1;
575 unsigned int token_info_enabled: 1;
576# if WARN_PAST_SCOPE
577 unsigned int past_scope_enabled: 1;
578# endif
579 unsigned int error_p: 1;
580 unsigned int cr_seen: 1;
581
582#ifndef RIPPER
583 /* Ruby core only */
584
585 unsigned int do_print: 1;
586 unsigned int do_loop: 1;
587 unsigned int do_chomp: 1;
588 unsigned int do_split: 1;
589 unsigned int error_tolerant: 1;
590 unsigned int keep_tokens: 1;
591
592 VALUE error_buffer;
593 rb_parser_ary_t *debug_lines;
594 /*
595 * Store specific keyword locations to generate dummy end token.
596 * Refer to the tail of list element.
597 */
598 end_expect_token_locations_t *end_expect_token_locations;
599 /* id for terms */
600 int token_id;
601 /* Array for term tokens */
602 rb_parser_ary_t *tokens;
603#else
604 /* Ripper only */
605
606 VALUE value;
607 VALUE result;
608 VALUE parsing_thread;
609 VALUE s_value; /* Token VALUE */
610 VALUE s_lvalue; /* VALUE generated by rule action (reduce) */
611 VALUE s_value_stack;
612#endif
613};
614
615#define NUMPARAM_ID_P(id) numparam_id_p(p, id)
616#define NUMPARAM_ID_TO_IDX(id) (unsigned int)(((id) >> ID_SCOPE_SHIFT) - (tNUMPARAM_1 - 1))
617#define NUMPARAM_IDX_TO_ID(idx) TOKEN2LOCALID((tNUMPARAM_1 - 1 + (idx)))
618static int
619numparam_id_p(struct parser_params *p, ID id)
620{
621 if (!is_local_id(id) || id < (tNUMPARAM_1 << ID_SCOPE_SHIFT)) return 0;
622 unsigned int idx = NUMPARAM_ID_TO_IDX(id);
623 return idx > 0 && idx <= NUMPARAM_MAX;
624}
625static void numparam_name(struct parser_params *p, ID id);
626
627#ifdef RIPPER
628static void
629after_shift(struct parser_params *p)
630{
631 if (p->debug) {
632 rb_parser_printf(p, "after-shift: %+"PRIsVALUE"\n", p->s_value);
633 }
634 rb_ary_push(p->s_value_stack, p->s_value);
635 p->s_value = Qnil;
636}
637
638static void
639before_reduce(int len, struct parser_params *p)
640{
641 // Initialize $$ with $1.
642 if (len) p->s_lvalue = rb_ary_entry(p->s_value_stack, -len);
643}
644
645static void
646after_reduce(int len, struct parser_params *p)
647{
648 for (int i = 0; i < len; i++) {
649 VALUE tos = rb_ary_pop(p->s_value_stack);
650 if (p->debug) {
651 rb_parser_printf(p, "after-reduce pop: %+"PRIsVALUE"\n", tos);
652 }
653 }
654 if (p->debug) {
655 rb_parser_printf(p, "after-reduce push: %+"PRIsVALUE"\n", p->s_lvalue);
656 }
657 rb_ary_push(p->s_value_stack, p->s_lvalue);
658 p->s_lvalue = Qnil;
659}
660
661static void
662after_shift_error_token(struct parser_params *p)
663{
664 if (p->debug) {
665 rb_parser_printf(p, "after-shift-error-token:\n");
666 }
667 rb_ary_push(p->s_value_stack, Qnil);
668}
669
670static void
671after_pop_stack(int len, struct parser_params *p)
672{
673 for (int i = 0; i < len; i++) {
674 VALUE tos = rb_ary_pop(p->s_value_stack);
675 if (p->debug) {
676 rb_parser_printf(p, "after-pop-stack pop: %+"PRIsVALUE"\n", tos);
677 }
678 }
679}
680#else
681static void
682after_shift(struct parser_params *p)
683{
684}
685
686static void
687before_reduce(int len, struct parser_params *p)
688{
689}
690
691static void
692after_reduce(int len, struct parser_params *p)
693{
694}
695
696static void
697after_shift_error_token(struct parser_params *p)
698{
699}
700
701static void
702after_pop_stack(int len, struct parser_params *p)
703{
704}
705#endif
706
707#define intern_cstr(n,l,en) rb_intern3(n,l,en)
708
709#define STRING_NEW0() rb_parser_encoding_string_new(p,0,0,p->enc)
710
711#define STR_NEW(ptr,len) rb_enc_str_new((ptr),(len),p->enc)
712#define STR_NEW0() rb_enc_str_new(0,0,p->enc)
713#define STR_NEW2(ptr) rb_enc_str_new((ptr),strlen(ptr),p->enc)
714#define STR_NEW3(ptr,len,e,func) parser_str_new(p, (ptr),(len),(e),(func),p->enc)
715#define TOK_INTERN() intern_cstr(tok(p), toklen(p), p->enc)
716#define VALID_SYMNAME_P(s, l, enc, type) (rb_enc_symname_type(s, l, enc, (1U<<(type))) == (int)(type))
717
718#ifndef RIPPER
719static inline int
720char_at_end(struct parser_params *p, VALUE str, int when_empty)
721{
722 long len = RSTRING_LEN(str);
723 return len > 0 ? (unsigned char)RSTRING_PTR(str)[len-1] : when_empty;
724}
725#endif
726
727static void
728pop_pvtbl(struct parser_params *p, st_table *tbl)
729{
730 st_free_table(p->pvtbl);
731 p->pvtbl = tbl;
732}
733
734static void
735pop_pktbl(struct parser_params *p, st_table *tbl)
736{
737 if (p->pktbl) st_free_table(p->pktbl);
738 p->pktbl = tbl;
739}
740
741#define STRING_BUF_DEFAULT_LEN 16
742
743static void
744string_buffer_init(struct parser_params *p)
745{
746 parser_string_buffer_t *buf = &p->lex.string_buffer;
747 const size_t size = offsetof(parser_string_buffer_elem_t, buf) + sizeof(rb_parser_string_t *) * STRING_BUF_DEFAULT_LEN;
748
749 buf->head = buf->last = xmalloc(size);
750 buf->head->len = STRING_BUF_DEFAULT_LEN;
751 buf->head->used = 0;
752 buf->head->next = NULL;
753}
754
755static void
756string_buffer_append(struct parser_params *p, rb_parser_string_t *str)
757{
758 parser_string_buffer_t *buf = &p->lex.string_buffer;
759
760 if (buf->head->used >= buf->head->len) {
761 parser_string_buffer_elem_t *elem;
762 long n = buf->head->len * 2;
763 const size_t size = offsetof(parser_string_buffer_elem_t, buf) + sizeof(rb_parser_string_t *) * n;
764
765 elem = xmalloc(size);
766 elem->len = n;
767 elem->used = 0;
768 elem->next = NULL;
769 buf->last->next = elem;
770 buf->last = elem;
771 }
772 buf->last->buf[buf->last->used++] = str;
773}
774
775static void
776string_buffer_free(struct parser_params *p)
777{
778 parser_string_buffer_elem_t *elem = p->lex.string_buffer.head;
779
780 while (elem) {
781 parser_string_buffer_elem_t *next_elem = elem->next;
782
783 for (long i = 0; i < elem->used; i++) {
784 rb_parser_string_free(p, elem->buf[i]);
785 }
786
787 xfree(elem);
788 elem = next_elem;
789 }
790}
791
792#ifndef RIPPER
793static void flush_debug_buffer(struct parser_params *p, VALUE out, VALUE str);
794
795static void
796debug_end_expect_token_locations(struct parser_params *p, const char *name)
797{
798 if(p->debug) {
799 VALUE mesg = rb_sprintf("%s: [", name);
800 int i = 0;
801 for (end_expect_token_locations_t *loc = p->end_expect_token_locations; loc; loc = loc->prev) {
802 if (i > 0)
803 rb_str_cat_cstr(mesg, ", ");
804 rb_str_catf(mesg, "[%d, %d]", loc->pos->lineno, loc->pos->column);
805 i++;
806 }
807 rb_str_cat_cstr(mesg, "]\n");
808 flush_debug_buffer(p, p->debug_output, mesg);
809 }
810}
811
812static void
813push_end_expect_token_locations(struct parser_params *p, const rb_code_position_t *pos)
814{
815 if(!p->error_tolerant) return;
816
817 end_expect_token_locations_t *locations;
818 locations = ALLOC(end_expect_token_locations_t);
819 locations->pos = pos;
820 locations->prev = p->end_expect_token_locations;
821 p->end_expect_token_locations = locations;
822
823 debug_end_expect_token_locations(p, "push_end_expect_token_locations");
824}
825
826static void
827pop_end_expect_token_locations(struct parser_params *p)
828{
829 if(!p->end_expect_token_locations) return;
830
831 end_expect_token_locations_t *locations = p->end_expect_token_locations->prev;
832 ruby_sized_xfree(p->end_expect_token_locations, sizeof(end_expect_token_locations_t));
833 p->end_expect_token_locations = locations;
834
835 debug_end_expect_token_locations(p, "pop_end_expect_token_locations");
836}
837
838static end_expect_token_locations_t *
839peek_end_expect_token_locations(struct parser_params *p)
840{
841 return p->end_expect_token_locations;
842}
843
844static const char *
845parser_token2char(struct parser_params *p, enum yytokentype tok)
846{
847 switch ((int) tok) {
848#define TOKEN2CHAR(tok) case tok: return (#tok);
849#define TOKEN2CHAR2(tok, name) case tok: return (name);
850 TOKEN2CHAR2(' ', "word_sep");
851 TOKEN2CHAR2('!', "!")
852 TOKEN2CHAR2('%', "%");
853 TOKEN2CHAR2('&', "&");
854 TOKEN2CHAR2('*', "*");
855 TOKEN2CHAR2('+', "+");
856 TOKEN2CHAR2('-', "-");
857 TOKEN2CHAR2('/', "/");
858 TOKEN2CHAR2('<', "<");
859 TOKEN2CHAR2('=', "=");
860 TOKEN2CHAR2('>', ">");
861 TOKEN2CHAR2('?', "?");
862 TOKEN2CHAR2('^', "^");
863 TOKEN2CHAR2('|', "|");
864 TOKEN2CHAR2('~', "~");
865 TOKEN2CHAR2(':', ":");
866 TOKEN2CHAR2(',', ",");
867 TOKEN2CHAR2('.', ".");
868 TOKEN2CHAR2(';', ";");
869 TOKEN2CHAR2('`', "`");
870 TOKEN2CHAR2('\n', "nl");
871 TOKEN2CHAR2('{', "\"{\"");
872 TOKEN2CHAR2('}', "\"}\"");
873 TOKEN2CHAR2('[', "\"[\"");
874 TOKEN2CHAR2(']', "\"]\"");
875 TOKEN2CHAR2('(', "\"(\"");
876 TOKEN2CHAR2(')', "\")\"");
877 TOKEN2CHAR2('\\', "backslash");
878 TOKEN2CHAR(keyword_class);
879 TOKEN2CHAR(keyword_module);
880 TOKEN2CHAR(keyword_def);
881 TOKEN2CHAR(keyword_undef);
882 TOKEN2CHAR(keyword_begin);
883 TOKEN2CHAR(keyword_rescue);
884 TOKEN2CHAR(keyword_ensure);
885 TOKEN2CHAR(keyword_end);
886 TOKEN2CHAR(keyword_if);
887 TOKEN2CHAR(keyword_unless);
888 TOKEN2CHAR(keyword_then);
889 TOKEN2CHAR(keyword_elsif);
890 TOKEN2CHAR(keyword_else);
891 TOKEN2CHAR(keyword_case);
892 TOKEN2CHAR(keyword_when);
893 TOKEN2CHAR(keyword_while);
894 TOKEN2CHAR(keyword_until);
895 TOKEN2CHAR(keyword_for);
896 TOKEN2CHAR(keyword_break);
897 TOKEN2CHAR(keyword_next);
898 TOKEN2CHAR(keyword_redo);
899 TOKEN2CHAR(keyword_retry);
900 TOKEN2CHAR(keyword_in);
901 TOKEN2CHAR(keyword_do);
902 TOKEN2CHAR(keyword_do_cond);
903 TOKEN2CHAR(keyword_do_block);
904 TOKEN2CHAR(keyword_do_LAMBDA);
905 TOKEN2CHAR(keyword_return);
906 TOKEN2CHAR(keyword_yield);
907 TOKEN2CHAR(keyword_super);
908 TOKEN2CHAR(keyword_self);
909 TOKEN2CHAR(keyword_nil);
910 TOKEN2CHAR(keyword_true);
911 TOKEN2CHAR(keyword_false);
912 TOKEN2CHAR(keyword_and);
913 TOKEN2CHAR(keyword_or);
914 TOKEN2CHAR(keyword_not);
915 TOKEN2CHAR(modifier_if);
916 TOKEN2CHAR(modifier_unless);
917 TOKEN2CHAR(modifier_while);
918 TOKEN2CHAR(modifier_until);
919 TOKEN2CHAR(modifier_rescue);
920 TOKEN2CHAR(keyword_alias);
921 TOKEN2CHAR(keyword_defined);
922 TOKEN2CHAR(keyword_BEGIN);
923 TOKEN2CHAR(keyword_END);
924 TOKEN2CHAR(keyword__LINE__);
925 TOKEN2CHAR(keyword__FILE__);
926 TOKEN2CHAR(keyword__ENCODING__);
927 TOKEN2CHAR(tIDENTIFIER);
928 TOKEN2CHAR(tFID);
929 TOKEN2CHAR(tGVAR);
930 TOKEN2CHAR(tIVAR);
931 TOKEN2CHAR(tCONSTANT);
932 TOKEN2CHAR(tCVAR);
933 TOKEN2CHAR(tLABEL);
934 TOKEN2CHAR(tINTEGER);
935 TOKEN2CHAR(tFLOAT);
936 TOKEN2CHAR(tRATIONAL);
937 TOKEN2CHAR(tIMAGINARY);
938 TOKEN2CHAR(tCHAR);
939 TOKEN2CHAR(tNTH_REF);
940 TOKEN2CHAR(tBACK_REF);
941 TOKEN2CHAR(tSTRING_CONTENT);
942 TOKEN2CHAR(tREGEXP_END);
943 TOKEN2CHAR(tDUMNY_END);
944 TOKEN2CHAR(tSP);
945 TOKEN2CHAR(tUPLUS);
946 TOKEN2CHAR(tUMINUS);
947 TOKEN2CHAR(tPOW);
948 TOKEN2CHAR(tCMP);
949 TOKEN2CHAR(tEQ);
950 TOKEN2CHAR(tEQQ);
951 TOKEN2CHAR(tNEQ);
952 TOKEN2CHAR(tGEQ);
953 TOKEN2CHAR(tLEQ);
954 TOKEN2CHAR(tANDOP);
955 TOKEN2CHAR(tOROP);
956 TOKEN2CHAR(tMATCH);
957 TOKEN2CHAR(tNMATCH);
958 TOKEN2CHAR(tDOT2);
959 TOKEN2CHAR(tDOT3);
960 TOKEN2CHAR(tBDOT2);
961 TOKEN2CHAR(tBDOT3);
962 TOKEN2CHAR(tAREF);
963 TOKEN2CHAR(tASET);
964 TOKEN2CHAR(tLSHFT);
965 TOKEN2CHAR(tRSHFT);
966 TOKEN2CHAR(tANDDOT);
967 TOKEN2CHAR(tCOLON2);
968 TOKEN2CHAR(tCOLON3);
969 TOKEN2CHAR(tOP_ASGN);
970 TOKEN2CHAR(tASSOC);
971 TOKEN2CHAR(tLPAREN);
972 TOKEN2CHAR(tLPAREN_ARG);
973 TOKEN2CHAR(tLBRACK);
974 TOKEN2CHAR(tLBRACE);
975 TOKEN2CHAR(tLBRACE_ARG);
976 TOKEN2CHAR(tSTAR);
977 TOKEN2CHAR(tDSTAR);
978 TOKEN2CHAR(tAMPER);
979 TOKEN2CHAR(tLAMBDA);
980 TOKEN2CHAR(tSYMBEG);
981 TOKEN2CHAR(tSTRING_BEG);
982 TOKEN2CHAR(tXSTRING_BEG);
983 TOKEN2CHAR(tREGEXP_BEG);
984 TOKEN2CHAR(tWORDS_BEG);
985 TOKEN2CHAR(tQWORDS_BEG);
986 TOKEN2CHAR(tSYMBOLS_BEG);
987 TOKEN2CHAR(tQSYMBOLS_BEG);
988 TOKEN2CHAR(tSTRING_END);
989 TOKEN2CHAR(tSTRING_DEND);
990 TOKEN2CHAR(tSTRING_DBEG);
991 TOKEN2CHAR(tSTRING_DVAR);
992 TOKEN2CHAR(tLAMBEG);
993 TOKEN2CHAR(tLABEL_END);
994 TOKEN2CHAR(tIGNORED_NL);
995 TOKEN2CHAR(tCOMMENT);
996 TOKEN2CHAR(tEMBDOC_BEG);
997 TOKEN2CHAR(tEMBDOC);
998 TOKEN2CHAR(tEMBDOC_END);
999 TOKEN2CHAR(tHEREDOC_BEG);
1000 TOKEN2CHAR(tHEREDOC_END);
1001 TOKEN2CHAR(k__END__);
1002 TOKEN2CHAR(tLOWEST);
1003 TOKEN2CHAR(tUMINUS_NUM);
1004 TOKEN2CHAR(tLAST_TOKEN);
1005#undef TOKEN2CHAR
1006#undef TOKEN2CHAR2
1007 }
1008
1009 rb_bug("parser_token2id: unknown token %d", tok);
1010
1011 UNREACHABLE_RETURN(0);
1012}
1013#else
1014static void
1015push_end_expect_token_locations(struct parser_params *p, const rb_code_position_t *pos)
1016{
1017}
1018
1019static void
1020pop_end_expect_token_locations(struct parser_params *p)
1021{
1022}
1023#endif
1024
1025RBIMPL_ATTR_NONNULL((1, 2, 3))
1026static int parser_yyerror(struct parser_params*, const YYLTYPE *yylloc, const char*);
1027RBIMPL_ATTR_NONNULL((1, 2))
1028static int parser_yyerror0(struct parser_params*, const char*);
1029#define yyerror0(msg) parser_yyerror0(p, (msg))
1030#define yyerror1(loc, msg) parser_yyerror(p, (loc), (msg))
1031#define yyerror(yylloc, p, msg) parser_yyerror(p, yylloc, msg)
1032#define token_flush(ptr) ((ptr)->lex.ptok = (ptr)->lex.pcur)
1033#define lex_goto_eol(p) ((p)->lex.pcur = (p)->lex.pend)
1034#define lex_eol_p(p) lex_eol_n_p(p, 0)
1035#define lex_eol_n_p(p,n) lex_eol_ptr_n_p(p, (p)->lex.pcur, n)
1036#define lex_eol_ptr_p(p,ptr) lex_eol_ptr_n_p(p,ptr,0)
1037#define lex_eol_ptr_n_p(p,ptr,n) ((ptr)+(n) >= (p)->lex.pend)
1038
1039static void token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc);
1040static void token_info_push(struct parser_params*, const char *token, const rb_code_location_t *loc);
1041static void token_info_pop(struct parser_params*, const char *token, const rb_code_location_t *loc);
1042static void token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc);
1043static void token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos);
1044
1045#ifdef RIPPER
1046#define compile_for_eval (0)
1047#else
1048#define compile_for_eval (p->parent_iseq != 0)
1049#endif
1050
1051#define token_column ((int)(p->lex.ptok - p->lex.pbeg))
1052
1053#define CALL_Q_P(q) ((q) == tANDDOT)
1054#define NEW_QCALL(q,r,m,a,loc) (CALL_Q_P(q) ? NEW_QCALL0(r,m,a,loc) : NEW_CALL(r,m,a,loc))
1055
1056#define lambda_beginning_p() (p->lex.lpar_beg == p->lex.paren_nest)
1057
1058static enum yytokentype yylex(YYSTYPE*, YYLTYPE*, struct parser_params*);
1059
1060static inline void
1061rb_discard_node(struct parser_params *p, NODE *n)
1062{
1063 rb_ast_delete_node(p->ast, n);
1064}
1065
1066static rb_node_scope_t *rb_node_scope_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, NODE *nd_parent, const YYLTYPE *loc);
1067static rb_node_scope_t *rb_node_scope_new2(struct parser_params *p, rb_ast_id_table_t *nd_tbl, rb_node_args_t *nd_args, NODE *nd_body, NODE *nd_parent, const YYLTYPE *loc);
1068static rb_node_block_t *rb_node_block_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc);
1069static rb_node_if_t *rb_node_if_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, NODE *nd_else, const YYLTYPE *loc, const YYLTYPE* if_keyword_loc, const YYLTYPE* then_keyword_loc, const YYLTYPE* end_keyword_loc);
1070static rb_node_unless_t *rb_node_unless_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, NODE *nd_else, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *then_keyword_loc, const YYLTYPE *end_keyword_loc);
1071static rb_node_case_t *rb_node_case_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc);
1072static rb_node_case2_t *rb_node_case2_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc);
1073static rb_node_case3_t *rb_node_case3_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc);
1074static rb_node_when_t *rb_node_when_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *then_keyword_loc);
1075static rb_node_in_t *rb_node_in_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc, const YYLTYPE *in_keyword_loc, const YYLTYPE *then_keyword_loc, const YYLTYPE *operator_loc);
1076static rb_node_while_t *rb_node_while_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, long nd_state, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *closing_loc);
1077static rb_node_until_t *rb_node_until_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, long nd_state, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *closing_loc);
1078static rb_node_iter_t *rb_node_iter_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc);
1079static rb_node_for_t *rb_node_for_new(struct parser_params *p, NODE *nd_iter, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *for_keyword_loc, const YYLTYPE *in_keyword_loc, const YYLTYPE *do_keyword_loc, const YYLTYPE *end_keyword_loc);
1080static rb_node_for_masgn_t *rb_node_for_masgn_new(struct parser_params *p, NODE *nd_var, const YYLTYPE *loc);
1081static rb_node_retry_t *rb_node_retry_new(struct parser_params *p, const YYLTYPE *loc);
1082static rb_node_begin_t *rb_node_begin_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc);
1083static rb_node_rescue_t *rb_node_rescue_new(struct parser_params *p, NODE *nd_head, NODE *nd_resq, NODE *nd_else, const YYLTYPE *loc);
1084static rb_node_resbody_t *rb_node_resbody_new(struct parser_params *p, NODE *nd_args, NODE *nd_exc_var, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc);
1085static rb_node_ensure_t *rb_node_ensure_new(struct parser_params *p, NODE *nd_head, NODE *nd_ensr, const YYLTYPE *loc);
1086static rb_node_and_t *rb_node_and_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1087static rb_node_or_t *rb_node_or_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1088static rb_node_masgn_t *rb_node_masgn_new(struct parser_params *p, NODE *nd_head, NODE *nd_args, const YYLTYPE *loc);
1089static rb_node_lasgn_t *rb_node_lasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc);
1090static rb_node_dasgn_t *rb_node_dasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc);
1091static rb_node_gasgn_t *rb_node_gasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc);
1092static rb_node_iasgn_t *rb_node_iasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc);
1093static rb_node_cdecl_t *rb_node_cdecl_new(struct parser_params *p, ID nd_vid, NODE *nd_value, NODE *nd_else, enum rb_parser_shareability shareability, const YYLTYPE *loc);
1094static rb_node_cvasgn_t *rb_node_cvasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc);
1095static rb_node_op_asgn1_t *rb_node_op_asgn1_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *index, NODE *rvalue, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc);
1096static rb_node_op_asgn2_t *rb_node_op_asgn2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, ID nd_vid, ID nd_mid, bool nd_aid, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *message_loc, const YYLTYPE *binary_operator_loc);
1097static rb_node_op_asgn_or_t *rb_node_op_asgn_or_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, const YYLTYPE *loc);
1098static rb_node_op_asgn_and_t *rb_node_op_asgn_and_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, const YYLTYPE *loc);
1099static rb_node_op_cdecl_t *rb_node_op_cdecl_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, ID nd_aid, enum rb_parser_shareability shareability, const YYLTYPE *loc);
1100static rb_node_call_t *rb_node_call_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc);
1101static rb_node_opcall_t *rb_node_opcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc);
1102static rb_node_fcall_t *rb_node_fcall_new(struct parser_params *p, ID nd_mid, NODE *nd_args, const YYLTYPE *loc);
1103static rb_node_vcall_t *rb_node_vcall_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc);
1104static rb_node_qcall_t *rb_node_qcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc);
1105static rb_node_super_t *rb_node_super_new(struct parser_params *p, NODE *nd_args, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *lparen_loc, const YYLTYPE *rparen_loc);
1106static rb_node_zsuper_t * rb_node_zsuper_new(struct parser_params *p, const YYLTYPE *loc);
1107static rb_node_list_t *rb_node_list_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc);
1108static rb_node_list_t *rb_node_list_new2(struct parser_params *p, NODE *nd_head, long nd_alen, NODE *nd_next, const YYLTYPE *loc);
1109static rb_node_zlist_t *rb_node_zlist_new(struct parser_params *p, const YYLTYPE *loc);
1110static rb_node_hash_t *rb_node_hash_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc);
1111static rb_node_return_t *rb_node_return_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1112static rb_node_yield_t *rb_node_yield_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *lparen_loc, const YYLTYPE *rparen_loc);
1113static rb_node_lvar_t *rb_node_lvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1114static rb_node_dvar_t *rb_node_dvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1115static rb_node_gvar_t *rb_node_gvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1116static rb_node_ivar_t *rb_node_ivar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1117static rb_node_const_t *rb_node_const_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1118static rb_node_cvar_t *rb_node_cvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc);
1119static rb_node_nth_ref_t *rb_node_nth_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc);
1120static rb_node_back_ref_t *rb_node_back_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc);
1121static rb_node_match2_t *rb_node_match2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc);
1122static rb_node_match3_t *rb_node_match3_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc);
1123static rb_node_integer_t * rb_node_integer_new(struct parser_params *p, char* val, int base, const YYLTYPE *loc);
1124static rb_node_float_t * rb_node_float_new(struct parser_params *p, char* val, const YYLTYPE *loc);
1125static rb_node_rational_t * rb_node_rational_new(struct parser_params *p, char* val, int base, int seen_point, const YYLTYPE *loc);
1126static rb_node_imaginary_t * rb_node_imaginary_new(struct parser_params *p, char* val, int base, int seen_point, enum rb_numeric_type, const YYLTYPE *loc);
1127static rb_node_str_t *rb_node_str_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc);
1128static rb_node_dstr_t *rb_node_dstr_new0(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc);
1129static rb_node_dstr_t *rb_node_dstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc);
1130static rb_node_xstr_t *rb_node_xstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc);
1131static rb_node_dxstr_t *rb_node_dxstr_new(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc);
1132static rb_node_evstr_t *rb_node_evstr_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc);
1133static rb_node_regx_t *rb_node_regx_new(struct parser_params *p, rb_parser_string_t *string, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc);
1134static rb_node_once_t *rb_node_once_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc);
1135static rb_node_args_t *rb_node_args_new(struct parser_params *p, const YYLTYPE *loc);
1136static rb_node_args_aux_t *rb_node_args_aux_new(struct parser_params *p, ID nd_pid, int nd_plen, const YYLTYPE *loc);
1137static rb_node_opt_arg_t *rb_node_opt_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc);
1138static rb_node_kw_arg_t *rb_node_kw_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc);
1139static rb_node_postarg_t *rb_node_postarg_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc);
1140static rb_node_argscat_t *rb_node_argscat_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc);
1141static rb_node_argspush_t *rb_node_argspush_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc);
1142static rb_node_splat_t *rb_node_splat_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1143static rb_node_block_pass_t *rb_node_block_pass_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1144static rb_node_defn_t *rb_node_defn_new(struct parser_params *p, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc);
1145static rb_node_defs_t *rb_node_defs_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc);
1146static rb_node_alias_t *rb_node_alias_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1147static rb_node_valias_t *rb_node_valias_new(struct parser_params *p, ID nd_alias, ID nd_orig, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1148static rb_node_undef_t *rb_node_undef_new(struct parser_params *p, NODE *nd_undef, const YYLTYPE *loc);
1149static rb_node_class_t *rb_node_class_new(struct parser_params *p, NODE *nd_cpath, NODE *nd_body, NODE *nd_super, const YYLTYPE *loc, const YYLTYPE *class_keyword_loc, const YYLTYPE *inheritance_operator_loc, const YYLTYPE *end_keyword_loc);
1150static rb_node_module_t *rb_node_module_new(struct parser_params *p, NODE *nd_cpath, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *module_keyword_loc, const YYLTYPE *end_keyword_loc);
1151static rb_node_sclass_t *rb_node_sclass_new(struct parser_params *p, NODE *nd_recv, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *class_keyword_loc, const YYLTYPE *operator_loc, const YYLTYPE *end_keyword_loc);
1152static rb_node_colon2_t *rb_node_colon2_new(struct parser_params *p, NODE *nd_head, ID nd_mid, const YYLTYPE *loc, const YYLTYPE *delimiter_loc, const YYLTYPE *name_loc);
1153static rb_node_colon3_t *rb_node_colon3_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc, const YYLTYPE *delimiter_loc, const YYLTYPE *name_loc);
1154static rb_node_dot2_t *rb_node_dot2_new(struct parser_params *p, NODE *nd_beg, NODE *nd_end, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1155static rb_node_dot3_t *rb_node_dot3_new(struct parser_params *p, NODE *nd_beg, NODE *nd_end, const YYLTYPE *loc, const YYLTYPE *operator_loc);
1156static rb_node_self_t *rb_node_self_new(struct parser_params *p, const YYLTYPE *loc);
1157static rb_node_nil_t *rb_node_nil_new(struct parser_params *p, const YYLTYPE *loc);
1158static rb_node_true_t *rb_node_true_new(struct parser_params *p, const YYLTYPE *loc);
1159static rb_node_false_t *rb_node_false_new(struct parser_params *p, const YYLTYPE *loc);
1160static rb_node_errinfo_t *rb_node_errinfo_new(struct parser_params *p, const YYLTYPE *loc);
1161static rb_node_defined_t *rb_node_defined_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1162static rb_node_postexe_t *rb_node_postexe_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc);
1163static rb_node_sym_t *rb_node_sym_new(struct parser_params *p, VALUE str, const YYLTYPE *loc);
1164static rb_node_dsym_t *rb_node_dsym_new(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc);
1165static rb_node_attrasgn_t *rb_node_attrasgn_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc);
1166static rb_node_lambda_t *rb_node_lambda_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc);
1167static rb_node_aryptn_t *rb_node_aryptn_new(struct parser_params *p, NODE *pre_args, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc);
1168static rb_node_hshptn_t *rb_node_hshptn_new(struct parser_params *p, NODE *nd_pconst, NODE *nd_pkwargs, NODE *nd_pkwrestarg, const YYLTYPE *loc);
1169static rb_node_fndptn_t *rb_node_fndptn_new(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc);
1170static rb_node_line_t *rb_node_line_new(struct parser_params *p, const YYLTYPE *loc);
1171static rb_node_file_t *rb_node_file_new(struct parser_params *p, VALUE str, const YYLTYPE *loc);
1172static rb_node_error_t *rb_node_error_new(struct parser_params *p, const YYLTYPE *loc);
1173
1174#define NEW_SCOPE(a,b,c,loc) (NODE *)rb_node_scope_new(p,a,b,c,loc)
1175#define NEW_SCOPE2(t,a,b,c,loc) (NODE *)rb_node_scope_new2(p,t,a,b,c,loc)
1176#define NEW_BLOCK(a,loc) (NODE *)rb_node_block_new(p,a,loc)
1177#define NEW_IF(c,t,e,loc,ik_loc,tk_loc,ek_loc) (NODE *)rb_node_if_new(p,c,t,e,loc,ik_loc,tk_loc,ek_loc)
1178#define NEW_UNLESS(c,t,e,loc,k_loc,t_loc,e_loc) (NODE *)rb_node_unless_new(p,c,t,e,loc,k_loc,t_loc,e_loc)
1179#define NEW_CASE(h,b,loc,ck_loc,ek_loc) (NODE *)rb_node_case_new(p,h,b,loc,ck_loc,ek_loc)
1180#define NEW_CASE2(b,loc,ck_loc,ek_loc) (NODE *)rb_node_case2_new(p,b,loc,ck_loc,ek_loc)
1181#define NEW_CASE3(h,b,loc,ck_loc,ek_loc) (NODE *)rb_node_case3_new(p,h,b,loc,ck_loc,ek_loc)
1182#define NEW_WHEN(c,t,e,loc,k_loc,t_loc) (NODE *)rb_node_when_new(p,c,t,e,loc,k_loc,t_loc)
1183#define NEW_IN(c,t,e,loc,ik_loc,tk_loc,o_loc) (NODE *)rb_node_in_new(p,c,t,e,loc,ik_loc,tk_loc,o_loc)
1184#define NEW_WHILE(c,b,n,loc,k_loc,c_loc) (NODE *)rb_node_while_new(p,c,b,n,loc,k_loc,c_loc)
1185#define NEW_UNTIL(c,b,n,loc,k_loc,c_loc) (NODE *)rb_node_until_new(p,c,b,n,loc,k_loc,c_loc)
1186#define NEW_ITER(a,b,loc) (NODE *)rb_node_iter_new(p,a,b,loc)
1187#define NEW_FOR(i,b,loc,f_loc,i_loc,d_loc,e_loc) (NODE *)rb_node_for_new(p,i,b,loc,f_loc,i_loc,d_loc,e_loc)
1188#define NEW_FOR_MASGN(v,loc) (NODE *)rb_node_for_masgn_new(p,v,loc)
1189#define NEW_RETRY(loc) (NODE *)rb_node_retry_new(p,loc)
1190#define NEW_BEGIN(b,loc) (NODE *)rb_node_begin_new(p,b,loc)
1191#define NEW_RESCUE(b,res,e,loc) (NODE *)rb_node_rescue_new(p,b,res,e,loc)
1192#define NEW_RESBODY(a,v,ex,n,loc) (NODE *)rb_node_resbody_new(p,a,v,ex,n,loc)
1193#define NEW_ENSURE(b,en,loc) (NODE *)rb_node_ensure_new(p,b,en,loc)
1194#define NEW_AND(f,s,loc,op_loc) (NODE *)rb_node_and_new(p,f,s,loc,op_loc)
1195#define NEW_OR(f,s,loc,op_loc) (NODE *)rb_node_or_new(p,f,s,loc,op_loc)
1196#define NEW_MASGN(l,r,loc) rb_node_masgn_new(p,l,r,loc)
1197#define NEW_LASGN(v,val,loc) (NODE *)rb_node_lasgn_new(p,v,val,loc)
1198#define NEW_DASGN(v,val,loc) (NODE *)rb_node_dasgn_new(p,v,val,loc)
1199#define NEW_GASGN(v,val,loc) (NODE *)rb_node_gasgn_new(p,v,val,loc)
1200#define NEW_IASGN(v,val,loc) (NODE *)rb_node_iasgn_new(p,v,val,loc)
1201#define NEW_CDECL(v,val,path,share,loc) (NODE *)rb_node_cdecl_new(p,v,val,path,share,loc)
1202#define NEW_CVASGN(v,val,loc) (NODE *)rb_node_cvasgn_new(p,v,val,loc)
1203#define NEW_OP_ASGN1(r,id,idx,rval,loc,c_op_loc,o_loc,c_loc,b_op_loc) (NODE *)rb_node_op_asgn1_new(p,r,id,idx,rval,loc,c_op_loc,o_loc,c_loc,b_op_loc)
1204#define NEW_OP_ASGN2(r,t,i,o,val,loc,c_op_loc,m_loc,b_op_loc) (NODE *)rb_node_op_asgn2_new(p,r,val,i,o,t,loc,c_op_loc,m_loc,b_op_loc)
1205#define NEW_OP_ASGN_OR(i,val,loc) (NODE *)rb_node_op_asgn_or_new(p,i,val,loc)
1206#define NEW_OP_ASGN_AND(i,val,loc) (NODE *)rb_node_op_asgn_and_new(p,i,val,loc)
1207#define NEW_OP_CDECL(v,op,val,share,loc) (NODE *)rb_node_op_cdecl_new(p,v,val,op,share,loc)
1208#define NEW_CALL(r,m,a,loc) (NODE *)rb_node_call_new(p,r,m,a,loc)
1209#define NEW_OPCALL(r,m,a,loc) (NODE *)rb_node_opcall_new(p,r,m,a,loc)
1210#define NEW_FCALL(m,a,loc) rb_node_fcall_new(p,m,a,loc)
1211#define NEW_VCALL(m,loc) (NODE *)rb_node_vcall_new(p,m,loc)
1212#define NEW_QCALL0(r,m,a,loc) (NODE *)rb_node_qcall_new(p,r,m,a,loc)
1213#define NEW_SUPER(a,loc,k_loc,l_loc,r_loc) (NODE *)rb_node_super_new(p,a,loc,k_loc,l_loc,r_loc)
1214#define NEW_ZSUPER(loc) (NODE *)rb_node_zsuper_new(p,loc)
1215#define NEW_LIST(a,loc) (NODE *)rb_node_list_new(p,a,loc)
1216#define NEW_LIST2(h,l,n,loc) (NODE *)rb_node_list_new2(p,h,l,n,loc)
1217#define NEW_ZLIST(loc) (NODE *)rb_node_zlist_new(p,loc)
1218#define NEW_HASH(a,loc) (NODE *)rb_node_hash_new(p,a,loc)
1219#define NEW_RETURN(s,loc,k_loc) (NODE *)rb_node_return_new(p,s,loc,k_loc)
1220#define NEW_YIELD(a,loc,k_loc,l_loc,r_loc) (NODE *)rb_node_yield_new(p,a,loc,k_loc,l_loc,r_loc)
1221#define NEW_LVAR(v,loc) (NODE *)rb_node_lvar_new(p,v,loc)
1222#define NEW_DVAR(v,loc) (NODE *)rb_node_dvar_new(p,v,loc)
1223#define NEW_GVAR(v,loc) (NODE *)rb_node_gvar_new(p,v,loc)
1224#define NEW_IVAR(v,loc) (NODE *)rb_node_ivar_new(p,v,loc)
1225#define NEW_CONST(v,loc) (NODE *)rb_node_const_new(p,v,loc)
1226#define NEW_CVAR(v,loc) (NODE *)rb_node_cvar_new(p,v,loc)
1227#define NEW_NTH_REF(n,loc) (NODE *)rb_node_nth_ref_new(p,n,loc)
1228#define NEW_BACK_REF(n,loc) (NODE *)rb_node_back_ref_new(p,n,loc)
1229#define NEW_MATCH2(n1,n2,loc) (NODE *)rb_node_match2_new(p,n1,n2,loc)
1230#define NEW_MATCH3(r,n2,loc) (NODE *)rb_node_match3_new(p,r,n2,loc)
1231#define NEW_INTEGER(val, base,loc) (NODE *)rb_node_integer_new(p,val,base,loc)
1232#define NEW_FLOAT(val,loc) (NODE *)rb_node_float_new(p,val,loc)
1233#define NEW_RATIONAL(val,base,seen_point,loc) (NODE *)rb_node_rational_new(p,val,base,seen_point,loc)
1234#define NEW_IMAGINARY(val,base,seen_point,numeric_type,loc) (NODE *)rb_node_imaginary_new(p,val,base,seen_point,numeric_type,loc)
1235#define NEW_STR(s,loc) (NODE *)rb_node_str_new(p,s,loc)
1236#define NEW_DSTR0(s,l,n,loc) (NODE *)rb_node_dstr_new0(p,s,l,n,loc)
1237#define NEW_DSTR(s,loc) (NODE *)rb_node_dstr_new(p,s,loc)
1238#define NEW_XSTR(s,loc) (NODE *)rb_node_xstr_new(p,s,loc)
1239#define NEW_DXSTR(s,l,n,loc) (NODE *)rb_node_dxstr_new(p,s,l,n,loc)
1240#define NEW_EVSTR(n,loc,o_loc,c_loc) (NODE *)rb_node_evstr_new(p,n,loc,o_loc,c_loc)
1241#define NEW_REGX(str,opts,loc,o_loc,ct_loc,c_loc) (NODE *)rb_node_regx_new(p,str,opts,loc,o_loc,ct_loc,c_loc)
1242#define NEW_ONCE(b,loc) (NODE *)rb_node_once_new(p,b,loc)
1243#define NEW_ARGS(loc) rb_node_args_new(p,loc)
1244#define NEW_ARGS_AUX(r,b,loc) rb_node_args_aux_new(p,r,b,loc)
1245#define NEW_OPT_ARG(v,loc) rb_node_opt_arg_new(p,v,loc)
1246#define NEW_KW_ARG(v,loc) rb_node_kw_arg_new(p,v,loc)
1247#define NEW_POSTARG(i,v,loc) (NODE *)rb_node_postarg_new(p,i,v,loc)
1248#define NEW_ARGSCAT(a,b,loc) (NODE *)rb_node_argscat_new(p,a,b,loc)
1249#define NEW_ARGSPUSH(a,b,loc) (NODE *)rb_node_argspush_new(p,a,b,loc)
1250#define NEW_SPLAT(a,loc,op_loc) (NODE *)rb_node_splat_new(p,a,loc,op_loc)
1251#define NEW_BLOCK_PASS(b,loc,o_loc) rb_node_block_pass_new(p,b,loc,o_loc)
1252#define NEW_DEFN(i,s,loc) (NODE *)rb_node_defn_new(p,i,s,loc)
1253#define NEW_DEFS(r,i,s,loc) (NODE *)rb_node_defs_new(p,r,i,s,loc)
1254#define NEW_ALIAS(n,o,loc,k_loc) (NODE *)rb_node_alias_new(p,n,o,loc,k_loc)
1255#define NEW_VALIAS(n,o,loc,k_loc) (NODE *)rb_node_valias_new(p,n,o,loc,k_loc)
1256#define NEW_UNDEF(i,loc) (NODE *)rb_node_undef_new(p,i,loc)
1257#define NEW_CLASS(n,b,s,loc,ck_loc,io_loc,ek_loc) (NODE *)rb_node_class_new(p,n,b,s,loc,ck_loc,io_loc,ek_loc)
1258#define NEW_MODULE(n,b,loc,mk_loc,ek_loc) (NODE *)rb_node_module_new(p,n,b,loc,mk_loc,ek_loc)
1259#define NEW_SCLASS(r,b,loc,ck_loc,op_loc,ek_loc) (NODE *)rb_node_sclass_new(p,r,b,loc,ck_loc,op_loc,ek_loc)
1260#define NEW_COLON2(c,i,loc,d_loc,n_loc) (NODE *)rb_node_colon2_new(p,c,i,loc,d_loc,n_loc)
1261#define NEW_COLON3(i,loc,d_loc,n_loc) (NODE *)rb_node_colon3_new(p,i,loc,d_loc,n_loc)
1262#define NEW_DOT2(b,e,loc,op_loc) (NODE *)rb_node_dot2_new(p,b,e,loc,op_loc)
1263#define NEW_DOT3(b,e,loc,op_loc) (NODE *)rb_node_dot3_new(p,b,e,loc,op_loc)
1264#define NEW_SELF(loc) (NODE *)rb_node_self_new(p,loc)
1265#define NEW_NIL(loc) (NODE *)rb_node_nil_new(p,loc)
1266#define NEW_TRUE(loc) (NODE *)rb_node_true_new(p,loc)
1267#define NEW_FALSE(loc) (NODE *)rb_node_false_new(p,loc)
1268#define NEW_ERRINFO(loc) (NODE *)rb_node_errinfo_new(p,loc)
1269#define NEW_DEFINED(e,loc,k_loc) (NODE *)rb_node_defined_new(p,e,loc, k_loc)
1270#define NEW_POSTEXE(b,loc,k_loc,o_loc,c_loc) (NODE *)rb_node_postexe_new(p,b,loc,k_loc,o_loc,c_loc)
1271#define NEW_SYM(str,loc) (NODE *)rb_node_sym_new(p,str,loc)
1272#define NEW_DSYM(s,l,n,loc) (NODE *)rb_node_dsym_new(p,s,l,n,loc)
1273#define NEW_ATTRASGN(r,m,a,loc) (NODE *)rb_node_attrasgn_new(p,r,m,a,loc)
1274#define NEW_LAMBDA(a,b,loc,op_loc,o_loc,c_loc) (NODE *)rb_node_lambda_new(p,a,b,loc,op_loc,o_loc,c_loc)
1275#define NEW_ARYPTN(pre,r,post,loc) (NODE *)rb_node_aryptn_new(p,pre,r,post,loc)
1276#define NEW_HSHPTN(c,kw,kwrest,loc) (NODE *)rb_node_hshptn_new(p,c,kw,kwrest,loc)
1277#define NEW_FNDPTN(pre,a,post,loc) (NODE *)rb_node_fndptn_new(p,pre,a,post,loc)
1278#define NEW_LINE(loc) (NODE *)rb_node_line_new(p,loc)
1279#define NEW_FILE(str,loc) (NODE *)rb_node_file_new(p,str,loc)
1280#define NEW_ENCODING(loc) (NODE *)rb_node_encoding_new(p,loc)
1281#define NEW_ERROR(loc) (NODE *)rb_node_error_new(p,loc)
1282
1283enum internal_node_type {
1284 NODE_INTERNAL_ONLY = NODE_LAST,
1285 NODE_DEF_TEMP,
1286 NODE_EXITS,
1287 NODE_INTERNAL_LAST
1288};
1289
1290static const char *
1291parser_node_name(int node)
1292{
1293 switch (node) {
1294 case NODE_DEF_TEMP:
1295 return "NODE_DEF_TEMP";
1296 case NODE_EXITS:
1297 return "NODE_EXITS";
1298 default:
1299 return ruby_node_name(node);
1300 }
1301}
1302
1303/* This node is parse.y internal */
1304struct RNode_DEF_TEMP {
1305 NODE node;
1306
1307 /* for NODE_DEFN/NODE_DEFS */
1308
1309 struct RNode *nd_def;
1310 ID nd_mid;
1311
1312 struct {
1313 int max_numparam;
1314 NODE *numparam_save;
1315 struct lex_context ctxt;
1316 } save;
1317};
1318
1319#define RNODE_DEF_TEMP(node) ((struct RNode_DEF_TEMP *)(node))
1320
1321static rb_node_break_t *rb_node_break_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1322static rb_node_next_t *rb_node_next_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1323static rb_node_redo_t *rb_node_redo_new(struct parser_params *p, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1324static rb_node_def_temp_t *rb_node_def_temp_new(struct parser_params *p, const YYLTYPE *loc);
1325static rb_node_def_temp_t *def_head_save(struct parser_params *p, rb_node_def_temp_t *n);
1326
1327#define NEW_BREAK(s,loc,k_loc) (NODE *)rb_node_break_new(p,s,loc,k_loc)
1328#define NEW_NEXT(s,loc,k_loc) (NODE *)rb_node_next_new(p,s,loc,k_loc)
1329#define NEW_REDO(loc,k_loc) (NODE *)rb_node_redo_new(p,loc,k_loc)
1330#define NEW_DEF_TEMP(loc) rb_node_def_temp_new(p,loc)
1331
1332/* Make a new internal node, which should not be appeared in the
1333 * result AST and does not have node_id and location. */
1334static NODE* node_new_internal(struct parser_params *p, enum node_type type, size_t size, size_t alignment);
1335#define NODE_NEW_INTERNAL(ndtype, type) (type *)node_new_internal(p, (enum node_type)(ndtype), sizeof(type), RUBY_ALIGNOF(type))
1336
1337static NODE *nd_set_loc(NODE *nd, const YYLTYPE *loc);
1338
1339static int
1340parser_get_node_id(struct parser_params *p)
1341{
1342 int node_id = p->node_id;
1343 p->node_id++;
1344 return node_id;
1345}
1346
1347static void
1348anddot_multiple_assignment_check(struct parser_params* p, const YYLTYPE *loc, ID id)
1349{
1350 if (id == tANDDOT) {
1351 yyerror1(loc, "&. inside multiple assignment destination");
1352 }
1353}
1354
1355static inline void
1356set_line_body(NODE *body, int line)
1357{
1358 if (!body) return;
1359 switch (nd_type(body)) {
1360 case NODE_RESCUE:
1361 case NODE_ENSURE:
1362 nd_set_line(body, line);
1363 }
1364}
1365
1366static void
1367set_embraced_location(NODE *node, const rb_code_location_t *beg, const rb_code_location_t *end)
1368{
1369 RNODE_ITER(node)->nd_body->nd_loc = code_loc_gen(beg, end);
1370 nd_set_line(node, beg->end_pos.lineno);
1371}
1372
1373static NODE *
1374last_expr_node(NODE *expr)
1375{
1376 while (expr) {
1377 if (nd_type_p(expr, NODE_BLOCK)) {
1378 expr = RNODE_BLOCK(RNODE_BLOCK(expr)->nd_end)->nd_head;
1379 }
1380 else if (nd_type_p(expr, NODE_BEGIN) && RNODE_BEGIN(expr)->nd_body) {
1381 expr = RNODE_BEGIN(expr)->nd_body;
1382 }
1383 else {
1384 break;
1385 }
1386 }
1387 return expr;
1388}
1389
1390#ifndef RIPPER
1391#define yyparse ruby_yyparse
1392#endif
1393
1394static NODE* cond(struct parser_params *p, NODE *node, const YYLTYPE *loc);
1395static NODE* method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc);
1396static NODE *new_nil_at(struct parser_params *p, const rb_code_position_t *pos);
1397static NODE *new_if(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*);
1398static NODE *new_unless(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*);
1399static NODE *logop(struct parser_params*,ID,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*);
1400
1401static NODE *newline_node(NODE*);
1402static void fixpos(NODE*,NODE*);
1403
1404static int value_expr(struct parser_params*,NODE*);
1405static void void_expr(struct parser_params*,NODE*);
1406static NODE *remove_begin(NODE*);
1407static NODE *void_stmts(struct parser_params*,NODE*);
1408static void reduce_nodes(struct parser_params*,NODE**);
1409static void block_dup_check(struct parser_params*,NODE*,NODE*);
1410
1411static NODE *block_append(struct parser_params*,NODE*,NODE*);
1412static NODE *list_append(struct parser_params*,NODE*,NODE*);
1413static NODE *list_concat(NODE*,NODE*);
1414static NODE *arg_append(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
1415static NODE *last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc);
1416static NODE *rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc);
1417static NODE *literal_concat(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
1418static NODE *new_evstr(struct parser_params*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*);
1419static NODE *new_dstr(struct parser_params*,NODE*,const YYLTYPE*);
1420static NODE *str2dstr(struct parser_params*,NODE*);
1421static NODE *evstr2dstr(struct parser_params*,NODE*);
1422static NODE *splat_array(NODE*);
1423static void mark_lvar_used(struct parser_params *p, NODE *rhs);
1424
1425static NODE *call_bin_op(struct parser_params*,NODE*,ID,NODE*,const YYLTYPE*,const YYLTYPE*);
1426static NODE *call_uni_op(struct parser_params*,NODE*,ID,const YYLTYPE*,const YYLTYPE*);
1427static NODE *new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc);
1428static 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);
1429static NODE *method_add_block(struct parser_params*p, NODE *m, NODE *b, const YYLTYPE *loc) {RNODE_ITER(b)->nd_iter = m; b->nd_loc = *loc; return b;}
1430
1431static bool args_info_empty_p(struct rb_args_info *args);
1432static rb_node_args_t *new_args(struct parser_params*,rb_node_args_aux_t*,rb_node_opt_arg_t*,ID,rb_node_args_aux_t*,rb_node_args_t*,const YYLTYPE*);
1433static rb_node_args_t *new_args_tail(struct parser_params*,rb_node_kw_arg_t*,ID,ID,const YYLTYPE*);
1434static NODE *new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc);
1435static NODE *new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc);
1436static NODE *new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc);
1437static NODE *new_find_pattern_tail(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc);
1438static NODE *new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc);
1439static NODE *new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc);
1440
1441static rb_node_kw_arg_t *new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc);
1442static rb_node_args_t *args_with_numbered(struct parser_params*,rb_node_args_t*,int,ID);
1443
1444static NODE* negate_lit(struct parser_params*, NODE*,const YYLTYPE*);
1445static void no_blockarg(struct parser_params*,NODE*);
1446static NODE *ret_args(struct parser_params*,NODE*);
1447static NODE *arg_blk_pass(NODE*,rb_node_block_pass_t*);
1448static NODE *dsym_node(struct parser_params*,NODE*,const YYLTYPE*);
1449
1450static NODE *gettable(struct parser_params*,ID,const YYLTYPE*);
1451static NODE *assignable(struct parser_params*,ID,NODE*,const YYLTYPE*);
1452
1453static NODE *aryset(struct parser_params*,NODE*,NODE*,const YYLTYPE*);
1454static NODE *attrset(struct parser_params*,NODE*,ID,ID,const YYLTYPE*);
1455
1456static VALUE rb_backref_error(struct parser_params*,NODE*);
1457static NODE *node_assign(struct parser_params*,NODE*,NODE*,struct lex_context,const YYLTYPE*);
1458
1459static NODE *new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc);
1460static NODE *new_ary_op_assign(struct parser_params *p, NODE *ary, NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc);
1461static NODE *new_attr_op_assign(struct parser_params *p, NODE *lhs, ID atype, ID attr, ID op, NODE *rhs, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *message_loc, const YYLTYPE *binary_operator_loc);
1462static NODE *new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc);
1463static NODE *new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc);
1464
1465static NODE *const_decl(struct parser_params *p, NODE* path, const YYLTYPE *loc);
1466
1467static rb_node_opt_arg_t *opt_arg_append(rb_node_opt_arg_t*, rb_node_opt_arg_t*);
1468static rb_node_kw_arg_t *kwd_append(rb_node_kw_arg_t*, rb_node_kw_arg_t*);
1469
1470static NODE *new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc);
1471static NODE *new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc);
1472
1473static NODE *new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc, const YYLTYPE *keyword_loc);
1474
1475static NODE *new_regexp(struct parser_params *, NODE *, int, const YYLTYPE *, const YYLTYPE *, const YYLTYPE *, const YYLTYPE *);
1476
1477#define make_list(list, loc) ((list) ? (nd_set_loc(list, loc), list) : NEW_ZLIST(loc))
1478
1479static NODE *new_xstring(struct parser_params *, NODE *, const YYLTYPE *loc);
1480
1481static NODE *symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol);
1482
1483static NODE *match_op(struct parser_params*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*);
1484
1485static rb_ast_id_table_t *local_tbl(struct parser_params*);
1486
1487static VALUE reg_compile(struct parser_params*, rb_parser_string_t*, int);
1488static void reg_fragment_setenc(struct parser_params*, rb_parser_string_t*, int);
1489
1490static int literal_concat0(struct parser_params *p, rb_parser_string_t *head, rb_parser_string_t *tail);
1491static NODE *heredoc_dedent(struct parser_params*,NODE*);
1492
1493static void check_literal_when(struct parser_params *p, NODE *args, const YYLTYPE *loc);
1494
1495static rb_locations_lambda_body_t* new_locations_lambda_body(struct parser_params *p, NODE *node, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc);
1496
1497#ifdef RIPPER
1498#define get_value(idx) (rb_ary_entry(p->s_value_stack, idx))
1499#define set_value(val) (p->s_lvalue = val)
1500static VALUE assign_error(struct parser_params *p, const char *mesg, VALUE a);
1501static int id_is_var(struct parser_params *p, ID id);
1502#endif
1503
1504RUBY_SYMBOL_EXPORT_BEGIN
1505VALUE rb_parser_reg_compile(struct parser_params* p, VALUE str, int options);
1506int rb_reg_fragment_setenc(struct parser_params*, rb_parser_string_t *, int);
1507enum lex_state_e rb_parser_trace_lex_state(struct parser_params *, enum lex_state_e, enum lex_state_e, int);
1508VALUE rb_parser_lex_state_name(struct parser_params *p, enum lex_state_e state);
1509void rb_parser_show_bitstack(struct parser_params *, stack_type, const char *, int);
1510PRINTF_ARGS(void rb_parser_fatal(struct parser_params *p, const char *fmt, ...), 2, 3);
1511YYLTYPE *rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc);
1512YYLTYPE *rb_parser_set_location_of_delayed_token(struct parser_params *p, YYLTYPE *yylloc);
1513YYLTYPE *rb_parser_set_location_of_heredoc_end(struct parser_params *p, YYLTYPE *yylloc);
1514YYLTYPE *rb_parser_set_location_of_dummy_end(struct parser_params *p, YYLTYPE *yylloc);
1515YYLTYPE *rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc);
1516YYLTYPE *rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc);
1517void ruby_show_error_line(struct parser_params *p, VALUE errbuf, const YYLTYPE *yylloc, int lineno, rb_parser_string_t *str);
1518RUBY_SYMBOL_EXPORT_END
1519
1520static void flush_string_content(struct parser_params *p, rb_encoding *enc, size_t back);
1521static void error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc);
1522static void error_duplicate_pattern_key(struct parser_params *p, ID id, const YYLTYPE *loc);
1523static VALUE formal_argument_error(struct parser_params*, ID);
1524static ID shadowing_lvar(struct parser_params*,ID);
1525static void new_bv(struct parser_params*,ID);
1526
1527static void local_push(struct parser_params*,int);
1528static void local_pop(struct parser_params*);
1529static void local_var(struct parser_params*, ID);
1530static void arg_var(struct parser_params*, ID);
1531static int local_id(struct parser_params *p, ID id);
1532static int local_id_ref(struct parser_params*, ID, ID **);
1533#define internal_id rb_parser_internal_id
1534ID internal_id(struct parser_params*);
1535static NODE *new_args_forward_call(struct parser_params*, NODE*, const YYLTYPE*, const YYLTYPE*);
1536static int check_forwarding_args(struct parser_params*);
1537static void add_forwarding_args(struct parser_params *p);
1538static void forwarding_arg_check(struct parser_params *p, ID arg, ID all, const char *var);
1539
1540static const struct vtable *dyna_push(struct parser_params *);
1541static void dyna_pop(struct parser_params*, const struct vtable *);
1542static int dyna_in_block(struct parser_params*);
1543#define dyna_var(p, id) local_var(p, id)
1544static int dvar_defined(struct parser_params*, ID);
1545#define dvar_defined_ref rb_parser_dvar_defined_ref
1546int dvar_defined_ref(struct parser_params*, ID, ID**);
1547static int dvar_curr(struct parser_params*,ID);
1548
1549static int lvar_defined(struct parser_params*, ID);
1550
1551static NODE *numparam_push(struct parser_params *p);
1552static void numparam_pop(struct parser_params *p, NODE *prev_inner);
1553
1554#define METHOD_NOT '!'
1555
1556#define idFWD_REST '*'
1557#define idFWD_KWREST idPow /* Use simple "**", as tDSTAR is "**arg" */
1558#define idFWD_BLOCK '&'
1559#define idFWD_ALL idDot3
1560#define arg_FWD_BLOCK idFWD_BLOCK
1561
1562#define RE_ONIG_OPTION_IGNORECASE 1
1563#define RE_ONIG_OPTION_EXTEND (RE_ONIG_OPTION_IGNORECASE<<1)
1564#define RE_ONIG_OPTION_MULTILINE (RE_ONIG_OPTION_EXTEND<<1)
1565#define RE_OPTION_ONCE (1<<16)
1566#define RE_OPTION_ENCODING_SHIFT 8
1567#define RE_OPTION_ENCODING(e) (((e)&0xff)<<RE_OPTION_ENCODING_SHIFT)
1568#define RE_OPTION_ENCODING_IDX(o) (((o)>>RE_OPTION_ENCODING_SHIFT)&0xff)
1569#define RE_OPTION_ENCODING_NONE(o) ((o)&RE_OPTION_ARG_ENCODING_NONE)
1570#define RE_OPTION_MASK 0xff
1571#define RE_OPTION_ARG_ENCODING_NONE 32
1572
1573#define CHECK_LITERAL_WHEN (st_table *)1
1574#define CASE_LABELS_ENABLED_P(case_labels) (case_labels && case_labels != CHECK_LITERAL_WHEN)
1575
1576#define yytnamerr(yyres, yystr) (YYSIZE_T)rb_yytnamerr(p, yyres, yystr)
1577RUBY_FUNC_EXPORTED size_t rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr);
1578
1579#define TOKEN2ID(tok) ( \
1580 tTOKEN_LOCAL_BEGIN<(tok)&&(tok)<tTOKEN_LOCAL_END ? TOKEN2LOCALID(tok) : \
1581 tTOKEN_INSTANCE_BEGIN<(tok)&&(tok)<tTOKEN_INSTANCE_END ? TOKEN2INSTANCEID(tok) : \
1582 tTOKEN_GLOBAL_BEGIN<(tok)&&(tok)<tTOKEN_GLOBAL_END ? TOKEN2GLOBALID(tok) : \
1583 tTOKEN_CONST_BEGIN<(tok)&&(tok)<tTOKEN_CONST_END ? TOKEN2CONSTID(tok) : \
1584 tTOKEN_CLASS_BEGIN<(tok)&&(tok)<tTOKEN_CLASS_END ? TOKEN2CLASSID(tok) : \
1585 tTOKEN_ATTRSET_BEGIN<(tok)&&(tok)<tTOKEN_ATTRSET_END ? TOKEN2ATTRSETID(tok) : \
1586 ((tok) / ((tok)<tPRESERVED_ID_END && ((tok)>=128 || rb_ispunct(tok)))))
1587
1588/****** Ripper *******/
1589
1590#ifdef RIPPER
1591
1592#include "eventids1.h"
1593#include "eventids2.h"
1594
1595extern const struct ripper_parser_ids ripper_parser_ids;
1596
1597static VALUE ripper_dispatch0(struct parser_params*,ID);
1598static VALUE ripper_dispatch1(struct parser_params*,ID,VALUE);
1599static VALUE ripper_dispatch2(struct parser_params*,ID,VALUE,VALUE);
1600static VALUE ripper_dispatch3(struct parser_params*,ID,VALUE,VALUE,VALUE);
1601static VALUE ripper_dispatch4(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE);
1602static VALUE ripper_dispatch5(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE);
1603static VALUE ripper_dispatch7(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE);
1604void ripper_error(struct parser_params *p);
1605
1606#define dispatch0(n) ripper_dispatch0(p, RIPPER_ID(n))
1607#define dispatch1(n,a) ripper_dispatch1(p, RIPPER_ID(n), (a))
1608#define dispatch2(n,a,b) ripper_dispatch2(p, RIPPER_ID(n), (a), (b))
1609#define dispatch3(n,a,b,c) ripper_dispatch3(p, RIPPER_ID(n), (a), (b), (c))
1610#define dispatch4(n,a,b,c,d) ripper_dispatch4(p, RIPPER_ID(n), (a), (b), (c), (d))
1611#define dispatch5(n,a,b,c,d,e) ripper_dispatch5(p, RIPPER_ID(n), (a), (b), (c), (d), (e))
1612#define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(p, RIPPER_ID(n), (a), (b), (c), (d), (e), (f), (g))
1613
1614#define yyparse ripper_yyparse
1615
1616static VALUE
1617aryptn_pre_args(struct parser_params *p, VALUE pre_arg, VALUE pre_args)
1618{
1619 if (!NIL_P(pre_arg)) {
1620 if (!NIL_P(pre_args)) {
1621 rb_ary_unshift(pre_args, pre_arg);
1622 }
1623 else {
1624 pre_args = rb_ary_new_from_args(1, pre_arg);
1625 }
1626 }
1627 return pre_args;
1628}
1629
1630#define ID2VAL(id) STATIC_ID2SYM(id)
1631#define TOKEN2VAL(t) ID2VAL(TOKEN2ID(t))
1632#endif /* RIPPER */
1633
1634#define KWD2EID(t, v) keyword_##t
1635
1636static NODE *
1637new_scope_body(struct parser_params *p, rb_node_args_t *args, NODE *body, NODE *parent, const YYLTYPE *loc)
1638{
1639 body = remove_begin(body);
1640 reduce_nodes(p, &body);
1641 NODE *n = NEW_SCOPE(args, body, parent, loc);
1642 nd_set_line(n, loc->end_pos.lineno);
1643 set_line_body(body, loc->beg_pos.lineno);
1644 return n;
1645}
1646
1647static NODE *
1648rescued_expr(struct parser_params *p, NODE *arg, NODE *rescue,
1649 const YYLTYPE *arg_loc, const YYLTYPE *mod_loc, const YYLTYPE *res_loc)
1650{
1651 YYLTYPE loc = code_loc_gen(mod_loc, res_loc);
1652 rescue = NEW_RESBODY(0, 0, remove_begin(rescue), 0, &loc);
1653 loc.beg_pos = arg_loc->beg_pos;
1654 return NEW_RESCUE(arg, rescue, 0, &loc);
1655}
1656
1657static NODE *add_block_exit(struct parser_params *p, NODE *node);
1658static rb_node_exits_t *init_block_exit(struct parser_params *p);
1659static rb_node_exits_t *allow_block_exit(struct parser_params *p);
1660static void restore_block_exit(struct parser_params *p, rb_node_exits_t *exits);
1661static void clear_block_exit(struct parser_params *p, bool error);
1662
1663static void
1664next_rescue_context(struct lex_context *next, const struct lex_context *outer, enum rescue_context def)
1665{
1666 next->in_rescue = outer->in_rescue == after_rescue ? after_rescue : def;
1667}
1668
1669static void
1670restore_defun(struct parser_params *p, rb_node_def_temp_t *temp)
1671{
1672 /* See: def_name action */
1673 struct lex_context ctxt = temp->save.ctxt;
1674 p->ctxt.in_def = ctxt.in_def;
1675 p->ctxt.shareable_constant_value = ctxt.shareable_constant_value;
1676 p->ctxt.in_rescue = ctxt.in_rescue;
1677 p->max_numparam = temp->save.max_numparam;
1678 numparam_pop(p, temp->save.numparam_save);
1679 clear_block_exit(p, true);
1680}
1681
1682static void
1683endless_method_name(struct parser_params *p, ID mid, const YYLTYPE *loc)
1684{
1685 if (is_attrset_id(mid)) {
1686 yyerror1(loc, "setter method cannot be defined in an endless method definition");
1687 }
1688 token_info_drop(p, "def", loc->beg_pos);
1689}
1690
1691#define debug_token_line(p, name, line) do { \
1692 if (p->debug) { \
1693 const char *const pcur = p->lex.pcur; \
1694 const char *const ptok = p->lex.ptok; \
1695 rb_parser_printf(p, name ":%d (%d: %"PRIdPTRDIFF"|%"PRIdPTRDIFF"|%"PRIdPTRDIFF")\n", \
1696 line, p->ruby_sourceline, \
1697 ptok - p->lex.pbeg, pcur - ptok, p->lex.pend - pcur); \
1698 } \
1699 } while (0)
1700
1701#define begin_definition(k, loc_beg, loc_end) \
1702 do { \
1703 if (!(p->ctxt.in_class = (k)[0] != 0)) { \
1704 /* singleton class */ \
1705 p->ctxt.cant_return = !p->ctxt.in_def; \
1706 p->ctxt.in_def = 0; \
1707 } \
1708 else if (p->ctxt.in_def) { \
1709 YYLTYPE loc = code_loc_gen(loc_beg, loc_end); \
1710 yyerror1(&loc, k " definition in method body"); \
1711 } \
1712 else { \
1713 p->ctxt.cant_return = 1; \
1714 } \
1715 local_push(p, 0); \
1716 } while (0)
1717
1718#ifndef RIPPER
1719# define ifndef_ripper(x) (x)
1720# define ifdef_ripper(r,x) (x)
1721#else
1722# define ifndef_ripper(x)
1723# define ifdef_ripper(r,x) (r)
1724#endif
1725
1726# define rb_warn0(fmt) WARN_CALL(WARN_ARGS(fmt, 1))
1727# define rb_warn1(fmt,a) WARN_CALL(WARN_ARGS(fmt, 2), (a))
1728# define rb_warn2(fmt,a,b) WARN_CALL(WARN_ARGS(fmt, 3), (a), (b))
1729# define rb_warn3(fmt,a,b,c) WARN_CALL(WARN_ARGS(fmt, 4), (a), (b), (c))
1730# define rb_warn4(fmt,a,b,c,d) WARN_CALL(WARN_ARGS(fmt, 5), (a), (b), (c), (d))
1731# define rb_warning0(fmt) WARNING_CALL(WARNING_ARGS(fmt, 1))
1732# define rb_warning1(fmt,a) WARNING_CALL(WARNING_ARGS(fmt, 2), (a))
1733# define rb_warning2(fmt,a,b) WARNING_CALL(WARNING_ARGS(fmt, 3), (a), (b))
1734# define rb_warning3(fmt,a,b,c) WARNING_CALL(WARNING_ARGS(fmt, 4), (a), (b), (c))
1735# define rb_warning4(fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS(fmt, 5), (a), (b), (c), (d))
1736# define rb_warn0L(l,fmt) WARN_CALL(WARN_ARGS_L(l, fmt, 1))
1737# define rb_warn1L(l,fmt,a) WARN_CALL(WARN_ARGS_L(l, fmt, 2), (a))
1738# define rb_warn2L(l,fmt,a,b) WARN_CALL(WARN_ARGS_L(l, fmt, 3), (a), (b))
1739# define rb_warn3L(l,fmt,a,b,c) WARN_CALL(WARN_ARGS_L(l, fmt, 4), (a), (b), (c))
1740# define rb_warn4L(l,fmt,a,b,c,d) WARN_CALL(WARN_ARGS_L(l, fmt, 5), (a), (b), (c), (d))
1741# define rb_warning0L(l,fmt) WARNING_CALL(WARNING_ARGS_L(l, fmt, 1))
1742# define rb_warning1L(l,fmt,a) WARNING_CALL(WARNING_ARGS_L(l, fmt, 2), (a))
1743# define rb_warning2L(l,fmt,a,b) WARNING_CALL(WARNING_ARGS_L(l, fmt, 3), (a), (b))
1744# define rb_warning3L(l,fmt,a,b,c) WARNING_CALL(WARNING_ARGS_L(l, fmt, 4), (a), (b), (c))
1745# define rb_warning4L(l,fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS_L(l, fmt, 5), (a), (b), (c), (d))
1746#ifdef RIPPER
1747extern const ID id_warn, id_warning, id_gets, id_assoc;
1748# define ERR_MESG() STR_NEW2(mesg) /* to bypass Ripper DSL */
1749# define WARN_S_L(s,l) STR_NEW(s,l)
1750# define WARN_S(s) STR_NEW2(s)
1751# define WARN_I(i) INT2NUM(i)
1752# define WARN_ID(i) rb_id2str(i)
1753# define PRIsWARN PRIsVALUE
1754# define WARN_ARGS(fmt,n) p->value, id_warn, n, rb_usascii_str_new_lit(fmt)
1755# define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
1756# ifdef HAVE_VA_ARGS_MACRO
1757# define WARN_CALL(...) rb_funcall(__VA_ARGS__)
1758# else
1759# define WARN_CALL rb_funcall
1760# endif
1761# define WARNING_ARGS(fmt,n) p->value, id_warning, n, rb_usascii_str_new_lit(fmt)
1762# define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
1763# ifdef HAVE_VA_ARGS_MACRO
1764# define WARNING_CALL(...) rb_funcall(__VA_ARGS__)
1765# else
1766# define WARNING_CALL rb_funcall
1767# endif
1768# define compile_error ripper_compile_error
1769#else
1770# define WARN_S_L(s,l) s
1771# define WARN_S(s) s
1772# define WARN_I(i) i
1773# define WARN_ID(i) rb_id2name(i)
1774# define PRIsWARN PRIsVALUE
1775# define WARN_ARGS(fmt,n) WARN_ARGS_L(p->ruby_sourceline,fmt,n)
1776# define WARN_ARGS_L(l,fmt,n) p->ruby_sourcefile, (l), (fmt)
1777# define WARN_CALL rb_compile_warn
1778# define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
1779# define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
1780# define WARNING_CALL rb_compile_warning
1781PRINTF_ARGS(static void parser_compile_error(struct parser_params*, const rb_code_location_t *loc, const char *fmt, ...), 3, 4);
1782# define compile_error(p, ...) parser_compile_error(p, NULL, __VA_ARGS__)
1783#endif
1784
1785#define RNODE_EXITS(node) ((rb_node_exits_t*)(node))
1786
1787static NODE *
1788add_block_exit(struct parser_params *p, NODE *node)
1789{
1790 if (!node) {
1791 compile_error(p, "unexpected null node");
1792 return 0;
1793 }
1794 switch (nd_type(node)) {
1795 case NODE_BREAK: case NODE_NEXT: case NODE_REDO: break;
1796 default:
1797 compile_error(p, "add_block_exit: unexpected node: %s", parser_node_name(nd_type(node)));
1798 return node;
1799 }
1800 if (!p->ctxt.in_defined) {
1801 rb_node_exits_t *exits = p->exits;
1802 if (exits) {
1803 RNODE_EXITS(exits->nd_stts)->nd_chain = node;
1804 exits->nd_stts = node;
1805 }
1806 }
1807 return node;
1808}
1809
1810static rb_node_exits_t *
1811init_block_exit(struct parser_params *p)
1812{
1813 rb_node_exits_t *old = p->exits;
1814 rb_node_exits_t *exits = NODE_NEW_INTERNAL(NODE_EXITS, rb_node_exits_t);
1815 exits->nd_chain = 0;
1816 exits->nd_stts = RNODE(exits);
1817 p->exits = exits;
1818 return old;
1819}
1820
1821static rb_node_exits_t *
1822allow_block_exit(struct parser_params *p)
1823{
1824 rb_node_exits_t *exits = p->exits;
1825 p->exits = 0;
1826 return exits;
1827}
1828
1829static void
1830restore_block_exit(struct parser_params *p, rb_node_exits_t *exits)
1831{
1832 p->exits = exits;
1833}
1834
1835static void
1836clear_block_exit(struct parser_params *p, bool error)
1837{
1838 rb_node_exits_t *exits = p->exits;
1839 if (!exits) return;
1840 if (error) {
1841 for (NODE *e = RNODE(exits); (e = RNODE_EXITS(e)->nd_chain) != 0; ) {
1842 switch (nd_type(e)) {
1843 case NODE_BREAK:
1844 yyerror1(&e->nd_loc, "Invalid break");
1845 break;
1846 case NODE_NEXT:
1847 yyerror1(&e->nd_loc, "Invalid next");
1848 break;
1849 case NODE_REDO:
1850 yyerror1(&e->nd_loc, "Invalid redo");
1851 break;
1852 default:
1853 yyerror1(&e->nd_loc, "unexpected node");
1854 goto end_checks; /* no nd_chain */
1855 }
1856 }
1857 end_checks:;
1858 }
1859 exits->nd_stts = RNODE(exits);
1860 exits->nd_chain = 0;
1861}
1862
1863#define WARN_EOL(tok) \
1864 (looking_at_eol_p(p) ? \
1865 (void)rb_warning0("'" tok "' at the end of line without an expression") : \
1866 (void)0)
1867static int looking_at_eol_p(struct parser_params *p);
1868
1869static NODE *
1870get_nd_value(struct parser_params *p, NODE *node)
1871{
1872 switch (nd_type(node)) {
1873 case NODE_GASGN:
1874 return RNODE_GASGN(node)->nd_value;
1875 case NODE_IASGN:
1876 return RNODE_IASGN(node)->nd_value;
1877 case NODE_LASGN:
1878 return RNODE_LASGN(node)->nd_value;
1879 case NODE_DASGN:
1880 return RNODE_DASGN(node)->nd_value;
1881 case NODE_MASGN:
1882 return RNODE_MASGN(node)->nd_value;
1883 case NODE_CVASGN:
1884 return RNODE_CVASGN(node)->nd_value;
1885 case NODE_CDECL:
1886 return RNODE_CDECL(node)->nd_value;
1887 default:
1888 compile_error(p, "get_nd_value: unexpected node: %s", parser_node_name(nd_type(node)));
1889 return 0;
1890 }
1891}
1892
1893static void
1894set_nd_value(struct parser_params *p, NODE *node, NODE *rhs)
1895{
1896 switch (nd_type(node)) {
1897 case NODE_CDECL:
1898 RNODE_CDECL(node)->nd_value = rhs;
1899 break;
1900 case NODE_GASGN:
1901 RNODE_GASGN(node)->nd_value = rhs;
1902 break;
1903 case NODE_IASGN:
1904 RNODE_IASGN(node)->nd_value = rhs;
1905 break;
1906 case NODE_LASGN:
1907 RNODE_LASGN(node)->nd_value = rhs;
1908 break;
1909 case NODE_DASGN:
1910 RNODE_DASGN(node)->nd_value = rhs;
1911 break;
1912 case NODE_MASGN:
1913 RNODE_MASGN(node)->nd_value = rhs;
1914 break;
1915 case NODE_CVASGN:
1916 RNODE_CVASGN(node)->nd_value = rhs;
1917 break;
1918 default:
1919 compile_error(p, "set_nd_value: unexpected node: %s", parser_node_name(nd_type(node)));
1920 break;
1921 }
1922}
1923
1924static ID
1925get_nd_vid(struct parser_params *p, NODE *node)
1926{
1927 switch (nd_type(node)) {
1928 case NODE_CDECL:
1929 return RNODE_CDECL(node)->nd_vid;
1930 case NODE_GASGN:
1931 return RNODE_GASGN(node)->nd_vid;
1932 case NODE_IASGN:
1933 return RNODE_IASGN(node)->nd_vid;
1934 case NODE_LASGN:
1935 return RNODE_LASGN(node)->nd_vid;
1936 case NODE_DASGN:
1937 return RNODE_DASGN(node)->nd_vid;
1938 case NODE_CVASGN:
1939 return RNODE_CVASGN(node)->nd_vid;
1940 default:
1941 compile_error(p, "get_nd_vid: unexpected node: %s", parser_node_name(nd_type(node)));
1942 return 0;
1943 }
1944}
1945
1946static NODE *
1947get_nd_args(struct parser_params *p, NODE *node)
1948{
1949 switch (nd_type(node)) {
1950 case NODE_CALL:
1951 return RNODE_CALL(node)->nd_args;
1952 case NODE_OPCALL:
1953 return RNODE_OPCALL(node)->nd_args;
1954 case NODE_FCALL:
1955 return RNODE_FCALL(node)->nd_args;
1956 case NODE_QCALL:
1957 return RNODE_QCALL(node)->nd_args;
1958 case NODE_SUPER:
1959 return RNODE_SUPER(node)->nd_args;
1960 case NODE_VCALL:
1961 case NODE_ZSUPER:
1962 case NODE_YIELD:
1963 case NODE_RETURN:
1964 case NODE_BREAK:
1965 case NODE_NEXT:
1966 return 0;
1967 default:
1968 compile_error(p, "get_nd_args: unexpected node: %s", parser_node_name(nd_type(node)));
1969 return 0;
1970 }
1971}
1972
1973static st_index_t
1974djb2(const uint8_t *str, size_t len)
1975{
1976 st_index_t hash = 5381;
1977
1978 for (size_t i = 0; i < len; i++) {
1979 hash = ((hash << 5) + hash) + str[i];
1980 }
1981
1982 return hash;
1983}
1984
1985static st_index_t
1986parser_memhash(const void *ptr, long len)
1987{
1988 return djb2(ptr, len);
1989}
1990
1991#define PARSER_STRING_PTR(str) (str->ptr)
1992#define PARSER_STRING_LEN(str) (str->len)
1993#define PARSER_STRING_END(str) (&str->ptr[str->len])
1994#define STRING_SIZE(str) ((size_t)str->len + 1)
1995#define STRING_TERM_LEN(str) (1)
1996#define STRING_TERM_FILL(str) (str->ptr[str->len] = '\0')
1997#define PARSER_STRING_RESIZE_CAPA_TERM(p,str,capacity,termlen) do {\
1998 SIZED_REALLOC_N(str->ptr, char, (size_t)total + termlen, STRING_SIZE(str)); \
1999 str->len = total; \
2000} while (0)
2001#define STRING_SET_LEN(str, n) do { \
2002 (str)->len = (n); \
2003} while (0)
2004#define PARSER_STRING_GETMEM(str, ptrvar, lenvar) \
2005 ((ptrvar) = str->ptr, \
2006 (lenvar) = str->len)
2007
2008static inline int
2009parser_string_char_at_end(struct parser_params *p, rb_parser_string_t *str, int when_empty)
2010{
2011 return PARSER_STRING_LEN(str) > 0 ? (unsigned char)PARSER_STRING_END(str)[-1] : when_empty;
2012}
2013
2014static rb_parser_string_t *
2015rb_parser_string_new(rb_parser_t *p, const char *ptr, long len)
2016{
2017 rb_parser_string_t *str;
2018
2019 if (len < 0) {
2020 rb_bug("negative string size (or size too big): %ld", len);
2021 }
2022
2023 str = xcalloc(1, sizeof(rb_parser_string_t));
2024 str->ptr = xcalloc(len + 1, sizeof(char));
2025
2026 if (ptr) {
2027 memcpy(PARSER_STRING_PTR(str), ptr, len);
2028 }
2029 STRING_SET_LEN(str, len);
2030 STRING_TERM_FILL(str);
2031 return str;
2032}
2033
2034static rb_parser_string_t *
2035rb_parser_encoding_string_new(rb_parser_t *p, const char *ptr, long len, rb_encoding *enc)
2036{
2037 rb_parser_string_t *str = rb_parser_string_new(p, ptr, len);
2038 str->coderange = RB_PARSER_ENC_CODERANGE_UNKNOWN;
2039 str->enc = enc;
2040 return str;
2041}
2042
2043#ifndef RIPPER
2044rb_parser_string_t *
2045rb_str_to_parser_string(rb_parser_t *p, VALUE str)
2046{
2047 /* Type check */
2048 rb_parser_string_t *ret = rb_parser_encoding_string_new(p, RSTRING_PTR(str), RSTRING_LEN(str), rb_enc_get(str));
2049 RB_GC_GUARD(str);
2050 return ret;
2051}
2052
2053void
2054rb_parser_string_free(rb_parser_t *p, rb_parser_string_t *str)
2055{
2056 if (!str) return;
2057 xfree(PARSER_STRING_PTR(str));
2058 xfree(str);
2059}
2060#endif
2061
2062static st_index_t
2063rb_parser_str_hash(rb_parser_string_t *str)
2064{
2065 return parser_memhash((const void *)PARSER_STRING_PTR(str), PARSER_STRING_LEN(str));
2066}
2067
2068static st_index_t
2069rb_char_p_hash(const char *c)
2070{
2071 return parser_memhash((const void *)c, strlen(c));
2072}
2073
2074static size_t
2075rb_parser_str_capacity(rb_parser_string_t *str, const int termlen)
2076{
2077 return PARSER_STRING_LEN(str);
2078}
2079
2080#ifndef RIPPER
2081static char *
2082rb_parser_string_end(rb_parser_string_t *str)
2083{
2084 return &str->ptr[str->len];
2085}
2086#endif
2087
2088static void
2089rb_parser_string_set_encoding(rb_parser_string_t *str, rb_encoding *enc)
2090{
2091 str->enc = enc;
2092}
2093
2094static rb_encoding *
2095rb_parser_str_get_encoding(rb_parser_string_t *str)
2096{
2097 return str->enc;
2098}
2099
2100#ifndef RIPPER
2101static bool
2102PARSER_ENCODING_IS_ASCII8BIT(struct parser_params *p, rb_parser_string_t *str)
2103{
2104 return rb_parser_str_get_encoding(str) == rb_ascii8bit_encoding();
2105}
2106#endif
2107
2108static int
2109PARSER_ENC_CODERANGE(rb_parser_string_t *str)
2110{
2111 return str->coderange;
2112}
2113
2114static void
2115PARSER_ENC_CODERANGE_SET(rb_parser_string_t *str, int coderange)
2116{
2117 str->coderange = coderange;
2118}
2119
2120static void
2121PARSER_ENCODING_CODERANGE_SET(rb_parser_string_t *str, rb_encoding *enc, enum rb_parser_string_coderange_type cr)
2122{
2123 rb_parser_string_set_encoding(str, enc);
2124 PARSER_ENC_CODERANGE_SET(str, cr);
2125}
2126
2127static void
2128PARSER_ENC_CODERANGE_CLEAR(rb_parser_string_t *str)
2129{
2130 str->coderange = RB_PARSER_ENC_CODERANGE_UNKNOWN;
2131}
2132
2133static bool
2134PARSER_ENC_CODERANGE_ASCIIONLY(rb_parser_string_t *str)
2135{
2136 return PARSER_ENC_CODERANGE(str) == RB_PARSER_ENC_CODERANGE_7BIT;
2137}
2138
2139static bool
2140PARSER_ENC_CODERANGE_CLEAN_P(int cr)
2141{
2142 return cr == RB_PARSER_ENC_CODERANGE_7BIT || cr == RB_PARSER_ENC_CODERANGE_VALID;
2143}
2144
2145static const char *
2146rb_parser_search_nonascii(const char *p, const char *e)
2147{
2148 const char *s = p;
2149
2150 for (; s < e; s++) {
2151 if (*s & 0x80) return s;
2152 }
2153
2154 return NULL;
2155}
2156
2157static int
2158rb_parser_coderange_scan(struct parser_params *p, const char *ptr, long len, rb_encoding *enc)
2159{
2160 const char *e = ptr + len;
2161
2162 if (enc == rb_ascii8bit_encoding()) {
2163 /* enc is ASCII-8BIT. ASCII-8BIT string never be broken. */
2164 ptr = rb_parser_search_nonascii(ptr, e);
2165 return ptr ? RB_PARSER_ENC_CODERANGE_VALID : RB_PARSER_ENC_CODERANGE_7BIT;
2166 }
2167
2168 /* parser string encoding is always asciicompat */
2169 ptr = rb_parser_search_nonascii(ptr, e);
2170 if (!ptr) return RB_PARSER_ENC_CODERANGE_7BIT;
2171 for (;;) {
2172 int ret = rb_enc_precise_mbclen(ptr, e, enc);
2173 if (!MBCLEN_CHARFOUND_P(ret)) return RB_PARSER_ENC_CODERANGE_BROKEN;
2174 ptr += MBCLEN_CHARFOUND_LEN(ret);
2175 if (ptr == e) break;
2176 ptr = rb_parser_search_nonascii(ptr, e);
2177 if (!ptr) break;
2178 }
2179
2180 return RB_PARSER_ENC_CODERANGE_VALID;
2181}
2182
2183static int
2184rb_parser_enc_coderange_scan(struct parser_params *p, rb_parser_string_t *str, rb_encoding *enc)
2185{
2186 return rb_parser_coderange_scan(p, PARSER_STRING_PTR(str), PARSER_STRING_LEN(str), enc);
2187}
2188
2189static int
2190rb_parser_enc_str_coderange(struct parser_params *p, rb_parser_string_t *str)
2191{
2192 int cr = PARSER_ENC_CODERANGE(str);
2193
2194 if (cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2195 cr = rb_parser_enc_coderange_scan(p, str, rb_parser_str_get_encoding(str));
2196 PARSER_ENC_CODERANGE_SET(str, cr);
2197 }
2198
2199 return cr;
2200}
2201
2202static rb_parser_string_t *
2203rb_parser_enc_associate(struct parser_params *p, rb_parser_string_t *str, rb_encoding *enc)
2204{
2205 if (rb_parser_str_get_encoding(str) == enc)
2206 return str;
2207 if (!PARSER_ENC_CODERANGE_ASCIIONLY(str)) {
2208 PARSER_ENC_CODERANGE_CLEAR(str);
2209 }
2210 rb_parser_string_set_encoding(str, enc);
2211 return str;
2212}
2213
2214static bool
2215rb_parser_is_ascii_string(struct parser_params *p, rb_parser_string_t *str)
2216{
2217 return rb_parser_enc_str_coderange(p, str) == RB_PARSER_ENC_CODERANGE_7BIT;
2218}
2219
2220static rb_encoding *
2221rb_parser_enc_compatible(struct parser_params *p, rb_parser_string_t *str1, rb_parser_string_t *str2)
2222{
2223 rb_encoding *enc1 = rb_parser_str_get_encoding(str1);
2224 rb_encoding *enc2 = rb_parser_str_get_encoding(str2);
2225
2226 if (enc1 == NULL || enc2 == NULL)
2227 return 0;
2228
2229 if (enc1 == enc2) {
2230 return enc1;
2231 }
2232
2233 if (PARSER_STRING_LEN(str2) == 0)
2234 return enc1;
2235 if (PARSER_STRING_LEN(str1) == 0)
2236 return rb_parser_is_ascii_string(p, str2) ? enc1 : enc2;
2237
2238 int cr1, cr2;
2239
2240 cr1 = rb_parser_enc_str_coderange(p, str1);
2241 cr2 = rb_parser_enc_str_coderange(p, str2);
2242
2243 if (cr1 != cr2) {
2244 if (cr1 == RB_PARSER_ENC_CODERANGE_7BIT) return enc2;
2245 if (cr2 == RB_PARSER_ENC_CODERANGE_7BIT) return enc1;
2246 }
2247
2248 if (cr2 == RB_PARSER_ENC_CODERANGE_7BIT) {
2249 return enc1;
2250 }
2251
2252 if (cr1 == RB_PARSER_ENC_CODERANGE_7BIT) {
2253 return enc2;
2254 }
2255
2256 return 0;
2257}
2258
2259static void
2260rb_parser_str_modify(rb_parser_string_t *str)
2261{
2262 PARSER_ENC_CODERANGE_CLEAR(str);
2263}
2264
2265static void
2266rb_parser_str_set_len(struct parser_params *p, rb_parser_string_t *str, long len)
2267{
2268 long capa;
2269 const int termlen = STRING_TERM_LEN(str);
2270
2271 if (len > (capa = (long)(rb_parser_str_capacity(str, termlen))) || len < 0) {
2272 rb_bug("probable buffer overflow: %ld for %ld", len, capa);
2273 }
2274
2275 int cr = PARSER_ENC_CODERANGE(str);
2276 if (cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2277 /* Leave unknown. */
2278 }
2279 else if (len > PARSER_STRING_LEN(str)) {
2280 PARSER_ENC_CODERANGE_SET(str, RB_PARSER_ENC_CODERANGE_UNKNOWN);
2281 }
2282 else if (len < PARSER_STRING_LEN(str)) {
2283 if (cr != RB_PARSER_ENC_CODERANGE_7BIT) {
2284 /* ASCII-only string is keeping after truncated. Valid
2285 * and broken may be invalid or valid, leave unknown. */
2286 PARSER_ENC_CODERANGE_SET(str, RB_PARSER_ENC_CODERANGE_UNKNOWN);
2287 }
2288 }
2289
2290 STRING_SET_LEN(str, len);
2291 STRING_TERM_FILL(str);
2292}
2293
2294static rb_parser_string_t *
2295rb_parser_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len)
2296{
2297 rb_parser_str_modify(str);
2298 if (len == 0) return 0;
2299
2300 long total, olen, off = -1;
2301 char *sptr;
2302 const int termlen = STRING_TERM_LEN(str);
2303
2304 PARSER_STRING_GETMEM(str, sptr, olen);
2305 if (ptr >= sptr && ptr <= sptr + olen) {
2306 off = ptr - sptr;
2307 }
2308
2309 if (olen > LONG_MAX - len) {
2310 compile_error(p, "string sizes too big");
2311 return 0;
2312 }
2313 total = olen + len;
2314 PARSER_STRING_RESIZE_CAPA_TERM(p, str, total, termlen);
2315 sptr = PARSER_STRING_PTR(str);
2316 if (off != -1) {
2317 ptr = sptr + off;
2318 }
2319 memcpy(sptr + olen, ptr, len);
2320 STRING_SET_LEN(str, total);
2321 STRING_TERM_FILL(str);
2322
2323 return str;
2324}
2325
2326#define parser_str_cat(str, ptr, len) rb_parser_str_buf_cat(p, str, ptr, len)
2327#define parser_str_cat_cstr(str, lit) rb_parser_str_buf_cat(p, str, lit, strlen(lit))
2328
2329static rb_parser_string_t *
2330rb_parser_enc_cr_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len,
2331 rb_encoding *ptr_enc, int ptr_cr, int *ptr_cr_ret)
2332{
2333 int str_cr, res_cr;
2334 rb_encoding *str_enc, *res_enc;
2335
2336 str_enc = rb_parser_str_get_encoding(str);
2337 str_cr = PARSER_STRING_LEN(str) ? PARSER_ENC_CODERANGE(str) : RB_PARSER_ENC_CODERANGE_7BIT;
2338
2339 if (str_enc == ptr_enc) {
2340 if (str_cr != RB_PARSER_ENC_CODERANGE_UNKNOWN && ptr_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2341 ptr_cr = rb_parser_coderange_scan(p, ptr, len, ptr_enc);
2342 }
2343 }
2344 else {
2345 /* parser string encoding is always asciicompat */
2346 if (ptr_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2347 ptr_cr = rb_parser_coderange_scan(p, ptr, len, ptr_enc);
2348 }
2349 if (str_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2350 if (str_enc == rb_ascii8bit_encoding() || ptr_cr != RB_PARSER_ENC_CODERANGE_7BIT) {
2351 str_cr = rb_parser_enc_str_coderange(p, str);
2352 }
2353 }
2354 }
2355 if (ptr_cr_ret)
2356 *ptr_cr_ret = ptr_cr;
2357
2358 if (str_enc != ptr_enc &&
2359 str_cr != RB_PARSER_ENC_CODERANGE_7BIT &&
2360 ptr_cr != RB_PARSER_ENC_CODERANGE_7BIT) {
2361 goto incompatible;
2362 }
2363
2364 if (str_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) {
2365 res_enc = str_enc;
2366 res_cr = RB_PARSER_ENC_CODERANGE_UNKNOWN;
2367 }
2368 else if (str_cr == RB_PARSER_ENC_CODERANGE_7BIT) {
2369 if (ptr_cr == RB_PARSER_ENC_CODERANGE_7BIT) {
2370 res_enc = str_enc;
2371 res_cr = RB_PARSER_ENC_CODERANGE_7BIT;
2372 }
2373 else {
2374 res_enc = ptr_enc;
2375 res_cr = ptr_cr;
2376 }
2377 }
2378 else if (str_cr == RB_PARSER_ENC_CODERANGE_VALID) {
2379 res_enc = str_enc;
2380 if (PARSER_ENC_CODERANGE_CLEAN_P(ptr_cr))
2381 res_cr = str_cr;
2382 else
2383 res_cr = ptr_cr;
2384 }
2385 else { /* str_cr == RB_PARSER_ENC_CODERANGE_BROKEN */
2386 res_enc = str_enc;
2387 res_cr = str_cr;
2388 if (0 < len) res_cr = RB_PARSER_ENC_CODERANGE_UNKNOWN;
2389 }
2390
2391 if (len < 0) {
2392 compile_error(p, "negative string size (or size too big)");
2393 }
2394 parser_str_cat(str, ptr, len);
2395 PARSER_ENCODING_CODERANGE_SET(str, res_enc, res_cr);
2396 return str;
2397
2398 incompatible:
2399 compile_error(p, "incompatible character encodings: %s and %s",
2400 rb_enc_name(str_enc), rb_enc_name(ptr_enc));
2401 UNREACHABLE_RETURN(0);
2402
2403}
2404
2405static rb_parser_string_t *
2406rb_parser_enc_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len,
2407 rb_encoding *ptr_enc)
2408{
2409 return rb_parser_enc_cr_str_buf_cat(p, str, ptr, len, ptr_enc, RB_PARSER_ENC_CODERANGE_UNKNOWN, NULL);
2410}
2411
2412static rb_parser_string_t *
2413rb_parser_str_buf_append(struct parser_params *p, rb_parser_string_t *str, rb_parser_string_t *str2)
2414{
2415 int str2_cr = rb_parser_enc_str_coderange(p, str2);
2416
2417 rb_parser_enc_cr_str_buf_cat(p, str, PARSER_STRING_PTR(str2), PARSER_STRING_LEN(str2),
2418 rb_parser_str_get_encoding(str2), str2_cr, &str2_cr);
2419
2420 PARSER_ENC_CODERANGE_SET(str2, str2_cr);
2421
2422 return str;
2423}
2424
2425static rb_parser_string_t *
2426rb_parser_str_resize(struct parser_params *p, rb_parser_string_t *str, long len)
2427{
2428 if (len < 0) {
2429 rb_bug("negative string size (or size too big)");
2430 }
2431
2432 long slen = PARSER_STRING_LEN(str);
2433
2434 if (slen > len && PARSER_ENC_CODERANGE(str) != RB_PARSER_ENC_CODERANGE_7BIT) {
2435 PARSER_ENC_CODERANGE_CLEAR(str);
2436 }
2437
2438 {
2439 long capa;
2440 const int termlen = STRING_TERM_LEN(str);
2441
2442 if ((capa = slen) < len) {
2443 SIZED_REALLOC_N(str->ptr, char, (size_t)len + termlen, STRING_SIZE(str));
2444 }
2445 else if (len == slen) return str;
2446 STRING_SET_LEN(str, len);
2447 STRING_TERM_FILL(str);
2448 }
2449 return str;
2450}
2451
2452# define PARSER_ENC_STRING_GETMEM(str, ptrvar, lenvar, encvar) \
2453 ((ptrvar) = str->ptr, \
2454 (lenvar) = str->len, \
2455 (encvar) = str->enc)
2456
2457static int
2458rb_parser_string_hash_cmp(rb_parser_string_t *str1, rb_parser_string_t *str2)
2459{
2460 long len1, len2;
2461 const char *ptr1, *ptr2;
2462 rb_encoding *enc1, *enc2;
2463
2464 PARSER_ENC_STRING_GETMEM(str1, ptr1, len1, enc1);
2465 PARSER_ENC_STRING_GETMEM(str2, ptr2, len2, enc2);
2466
2467 return (len1 != len2 ||
2468 enc1 != enc2 ||
2469 memcmp(ptr1, ptr2, len1) != 0);
2470}
2471
2472static void
2473rb_parser_ary_extend(rb_parser_t *p, rb_parser_ary_t *ary, long len)
2474{
2475 long i;
2476 if (ary->capa < len) {
2477 ary->capa = len;
2478 ary->data = (rb_parser_ary_data *)xrealloc(ary->data, sizeof(rb_parser_ary_data) * len);
2479 for (i = ary->len; i < len; i++) {
2480 ary->data[i] = 0;
2481 }
2482 }
2483}
2484
2485/*
2486 * Do not call this directly.
2487 * Use rb_parser_ary_new_capa_for_XXX() instead.
2488 */
2489static rb_parser_ary_t *
2490parser_ary_new_capa(rb_parser_t *p, long len)
2491{
2492 if (len < 0) {
2493 rb_bug("negative array size (or size too big): %ld", len);
2494 }
2495 rb_parser_ary_t *ary = xcalloc(1, sizeof(rb_parser_ary_t));
2496 ary->data_type = 0;
2497 ary->len = 0;
2498 ary->capa = len;
2499 if (0 < len) {
2500 ary->data = (rb_parser_ary_data *)xcalloc(len, sizeof(rb_parser_ary_data));
2501 }
2502 else {
2503 ary->data = NULL;
2504 }
2505 return ary;
2506}
2507
2508#ifndef RIPPER
2509static rb_parser_ary_t *
2510rb_parser_ary_new_capa_for_script_line(rb_parser_t *p, long len)
2511{
2512 rb_parser_ary_t *ary = parser_ary_new_capa(p, len);
2513 ary->data_type = PARSER_ARY_DATA_SCRIPT_LINE;
2514 return ary;
2515}
2516
2517static rb_parser_ary_t *
2518rb_parser_ary_new_capa_for_ast_token(rb_parser_t *p, long len)
2519{
2520 rb_parser_ary_t *ary = parser_ary_new_capa(p, len);
2521 ary->data_type = PARSER_ARY_DATA_AST_TOKEN;
2522 return ary;
2523}
2524#endif
2525
2526static rb_parser_ary_t *
2527rb_parser_ary_new_capa_for_node(rb_parser_t *p, long len)
2528{
2529 rb_parser_ary_t *ary = parser_ary_new_capa(p, len);
2530 ary->data_type = PARSER_ARY_DATA_NODE;
2531 return ary;
2532}
2533
2534/*
2535 * Do not call this directly.
2536 * Use rb_parser_ary_push_XXX() instead.
2537 */
2538static rb_parser_ary_t *
2539parser_ary_push(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_ary_data val)
2540{
2541 if (ary->len == ary->capa) {
2542 rb_parser_ary_extend(p, ary, ary->len == 0 ? 1 : ary->len * 2);
2543 }
2544 ary->data[ary->len++] = val;
2545 return ary;
2546}
2547
2548#ifndef RIPPER
2549static rb_parser_ary_t *
2550rb_parser_ary_push_ast_token(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_ast_token_t *val)
2551{
2552 if (ary->data_type != PARSER_ARY_DATA_AST_TOKEN) {
2553 rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type);
2554 }
2555 return parser_ary_push(p, ary, val);
2556}
2557
2558static rb_parser_ary_t *
2559rb_parser_ary_push_script_line(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_string_t *val)
2560{
2561 if (ary->data_type != PARSER_ARY_DATA_SCRIPT_LINE) {
2562 rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type);
2563 }
2564 return parser_ary_push(p, ary, val);
2565}
2566#endif
2567
2568static rb_parser_ary_t *
2569rb_parser_ary_push_node(rb_parser_t *p, rb_parser_ary_t *ary, NODE *val)
2570{
2571 if (ary->data_type != PARSER_ARY_DATA_NODE) {
2572 rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type);
2573 }
2574 return parser_ary_push(p, ary, val);
2575}
2576
2577#ifndef RIPPER
2578static void
2579rb_parser_ast_token_free(rb_parser_t *p, rb_parser_ast_token_t *token)
2580{
2581 if (!token) return;
2582 rb_parser_string_free(p, token->str);
2583 xfree(token);
2584}
2585
2586static void
2587rb_parser_ary_free(rb_parser_t *p, rb_parser_ary_t *ary)
2588{
2589# define foreach_ary(ptr) \
2590 for (rb_parser_ary_data *ptr = ary->data, *const end_ary_data = ptr + ary->len; \
2591 ptr < end_ary_data; ptr++)
2592 switch (ary->data_type) {
2593 case PARSER_ARY_DATA_AST_TOKEN:
2594 foreach_ary(data) {rb_parser_ast_token_free(p, *data);}
2595 break;
2596 case PARSER_ARY_DATA_SCRIPT_LINE:
2597 foreach_ary(data) {rb_parser_string_free(p, *data);}
2598 break;
2599 case PARSER_ARY_DATA_NODE:
2600 /* Do nothing because nodes are freed when rb_ast_t is freed */
2601 break;
2602 default:
2603 rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type);
2604 break;
2605 }
2606# undef foreach_ary
2607 xfree(ary->data);
2608 xfree(ary);
2609}
2610
2611#endif /* !RIPPER */
2612%}
2613
2614%expect 0
2615%define api.pure
2616%define parse.error verbose
2617%printer {
2618 if ((NODE *)$$ == (NODE *)-1) {
2619 rb_parser_printf(p, "NODE_SPECIAL");
2620 }
2621 else if ($$) {
2622 rb_parser_printf(p, "%s", parser_node_name(nd_type(RNODE($$))));
2623 }
2624} <node> <node_fcall> <node_args> <node_args_aux> <node_opt_arg>
2625 <node_kw_arg> <node_block_pass> <node_masgn> <node_def_temp> <node_exits>
2626%printer {
2627 rb_parser_printf(p, "%"PRIsVALUE, rb_id2str($$));
2628} <id>
2629%printer {
2630 switch (nd_type(RNODE($$))) {
2631 case NODE_INTEGER:
2632 rb_parser_printf(p, "%+"PRIsVALUE, rb_node_integer_literal_val($$));
2633 break;
2634 case NODE_FLOAT:
2635 rb_parser_printf(p, "%+"PRIsVALUE, rb_node_float_literal_val($$));
2636 break;
2637 case NODE_RATIONAL:
2638 rb_parser_printf(p, "%+"PRIsVALUE, rb_node_rational_literal_val($$));
2639 break;
2640 case NODE_IMAGINARY:
2641 rb_parser_printf(p, "%+"PRIsVALUE, rb_node_imaginary_literal_val($$));
2642 break;
2643 default:
2644 break;
2645 }
2646} tINTEGER tFLOAT tRATIONAL tIMAGINARY tSTRING_CONTENT tCHAR
2647%printer {
2648 rb_parser_printf(p, "$%ld", RNODE_NTH_REF($$)->nd_nth);
2649} tNTH_REF
2650%printer {
2651 rb_parser_printf(p, "$%c", (int)RNODE_BACK_REF($$)->nd_nth);
2652} tBACK_REF
2653
2654%destructor {
2655 if (CASE_LABELS_ENABLED_P($$)) st_free_table($$);
2656} <labels>
2657
2658%lex-param {struct parser_params *p}
2659%parse-param {struct parser_params *p}
2660%initial-action
2661{
2662 RUBY_SET_YYLLOC_OF_NONE(@$);
2663};
2664%after-shift after_shift
2665%before-reduce before_reduce
2666%after-reduce after_reduce
2667%after-shift-error-token after_shift_error_token
2668%after-pop-stack after_pop_stack
2669
2670%union {
2671 NODE *node;
2672 rb_node_fcall_t *node_fcall;
2673 rb_node_args_t *node_args;
2674 rb_node_args_aux_t *node_args_aux;
2675 rb_node_opt_arg_t *node_opt_arg;
2676 rb_node_kw_arg_t *node_kw_arg;
2677 rb_node_block_pass_t *node_block_pass;
2678 rb_node_masgn_t *node_masgn;
2679 rb_node_def_temp_t *node_def_temp;
2680 rb_node_exits_t *node_exits;
2681 struct rb_locations_lambda_body_t *locations_lambda_body;
2682 ID id;
2683 int num;
2684 st_table *tbl;
2685 st_table *labels;
2686 const struct vtable *vars;
2687 struct rb_strterm_struct *strterm;
2688 struct lex_context ctxt;
2689 enum lex_state_e state;
2690}
2691
2692%token <id>
2693 keyword_class "'class'"
2694 keyword_module "'module'"
2695 keyword_def "'def'"
2696 keyword_undef "'undef'"
2697 keyword_begin "'begin'"
2698 keyword_rescue "'rescue'"
2699 keyword_ensure "'ensure'"
2700 keyword_end "'end'"
2701 keyword_if "'if'"
2702 keyword_unless "'unless'"
2703 keyword_then "'then'"
2704 keyword_elsif "'elsif'"
2705 keyword_else "'else'"
2706 keyword_case "'case'"
2707 keyword_when "'when'"
2708 keyword_while "'while'"
2709 keyword_until "'until'"
2710 keyword_for "'for'"
2711 keyword_break "'break'"
2712 keyword_next "'next'"
2713 keyword_redo "'redo'"
2714 keyword_retry "'retry'"
2715 keyword_in "'in'"
2716 keyword_do "'do'"
2717 keyword_do_cond "'do' for condition"
2718 keyword_do_block "'do' for block"
2719 keyword_do_LAMBDA "'do' for lambda"
2720 keyword_return "'return'"
2721 keyword_yield "'yield'"
2722 keyword_super "'super'"
2723 keyword_self "'self'"
2724 keyword_nil "'nil'"
2725 keyword_true "'true'"
2726 keyword_false "'false'"
2727 keyword_and "'and'"
2728 keyword_or "'or'"
2729 keyword_not "'not'"
2730 modifier_if "'if' modifier"
2731 modifier_unless "'unless' modifier"
2732 modifier_while "'while' modifier"
2733 modifier_until "'until' modifier"
2734 modifier_rescue "'rescue' modifier"
2735 keyword_alias "'alias'"
2736 keyword_defined "'defined?'"
2737 keyword_BEGIN "'BEGIN'"
2738 keyword_END "'END'"
2739 keyword__LINE__ "'__LINE__'"
2740 keyword__FILE__ "'__FILE__'"
2741 keyword__ENCODING__ "'__ENCODING__'"
2742
2743%token <id> tIDENTIFIER "local variable or method"
2744%token <id> tFID "method"
2745%token <id> tGVAR "global variable"
2746%token <id> tIVAR "instance variable"
2747%token <id> tCONSTANT "constant"
2748%token <id> tCVAR "class variable"
2749%token <id> tLABEL "label"
2750%token <node> tINTEGER "integer literal"
2751%token <node> tFLOAT "float literal"
2752%token <node> tRATIONAL "rational literal"
2753%token <node> tIMAGINARY "imaginary literal"
2754%token <node> tCHAR "char literal"
2755%token <node> tNTH_REF "numbered reference"
2756%token <node> tBACK_REF "back reference"
2757%token <node> tSTRING_CONTENT "literal content"
2758%token <num> tREGEXP_END
2759%token <num> tDUMNY_END "dummy end"
2760
2761%type <node> singleton singleton_expr strings string string1 xstring regexp
2762%type <node> string_contents xstring_contents regexp_contents string_content
2763%type <node> words symbols symbol_list qwords qsymbols word_list qword_list qsym_list word
2764%type <node> literal numeric simple_numeric ssym dsym symbol cpath
2765%type <node_def_temp> defn_head defs_head k_def
2766%type <node_exits> block_open k_while k_until k_for allow_exits
2767%type <node> top_stmts top_stmt begin_block endless_arg endless_command
2768%type <node> bodystmt stmts stmt_or_begin stmt expr arg ternary primary
2769%type <node> command command_call command_call_value method_call
2770%type <node> expr_value expr_value_do arg_value primary_value rel_expr
2771%type <node_fcall> fcall
2772%type <node> if_tail opt_else case_body case_args cases opt_rescue exc_list exc_var opt_ensure
2773%type <node> args arg_splat call_args opt_call_args
2774%type <node> paren_args opt_paren_args
2775%type <node_args> args_tail block_args_tail
2776%type <node> command_args aref_args
2777%type <node_block_pass> opt_block_arg block_arg
2778%type <node> var_ref var_lhs
2779%type <node> command_rhs arg_rhs
2780%type <node> command_asgn mrhs mrhs_arg superclass block_call block_command
2781%type <node_args> f_arglist f_opt_paren_args f_paren_args f_args
2782%type <node_args_aux> f_arg f_arg_item
2783%type <node> f_marg f_rest_marg
2784%type <node_masgn> f_margs
2785%type <node> assoc_list assocs assoc undef_list backref string_dvar for_var
2786%type <node_args> block_param opt_block_param_def block_param_def opt_block_param
2787%type <id> do bv_decls opt_bv_decl bvar
2788%type <node> lambda brace_body do_body
2789%type <locations_lambda_body> lambda_body
2790%type <node_args> f_larglist
2791%type <node> brace_block cmd_brace_block do_block lhs none fitem
2792%type <node> mlhs_head mlhs_item mlhs_node
2793%type <node_masgn> mlhs mlhs_basic mlhs_inner
2794%type <node> p_case_body p_cases p_top_expr p_top_expr_body
2795%type <node> p_expr p_as p_alt p_expr_basic p_find
2796%type <node> p_args p_args_head p_args_tail p_args_post p_arg p_rest
2797%type <node> p_value p_primitive p_variable p_var_ref p_expr_ref p_const
2798%type <node> p_kwargs p_kwarg p_kw
2799%type <id> keyword_variable user_variable sym operation2 operation3
2800%type <id> cname fname op f_rest_arg f_block_arg opt_f_block_arg f_norm_arg f_bad_arg
2801%type <id> f_kwrest f_label f_arg_asgn call_op call_op2 reswords relop dot_or_colon
2802%type <id> p_kwrest p_kwnorest p_any_kwrest p_kw_label
2803%type <id> f_no_kwarg f_any_kwrest args_forward excessed_comma nonlocal_var def_name
2804%type <ctxt> lex_ctxt begin_defined k_class k_module k_END k_rescue k_ensure after_rescue
2805%type <ctxt> p_in_kwarg
2806%type <tbl> p_lparen p_lbracket p_pktbl p_pvtbl
2807%type <num> max_numparam
2808%type <node> numparam
2809%type <id> it_id
2810%token END_OF_INPUT 0 "end-of-input"
2811%token <id> '.'
2812
2813/* escaped chars, should be ignored otherwise */
2814%token <id> '\\' "backslash"
2815%token tSP "escaped space"
2816%token <id> '\t' "escaped horizontal tab"
2817%token <id> '\f' "escaped form feed"
2818%token <id> '\r' "escaped carriage return"
2819%token <id> '\13' "escaped vertical tab"
2820%token tUPLUS RUBY_TOKEN(UPLUS) "unary+"
2821%token tUMINUS RUBY_TOKEN(UMINUS) "unary-"
2822%token tPOW RUBY_TOKEN(POW) "**"
2823%token tCMP RUBY_TOKEN(CMP) "<=>"
2824%token tEQ RUBY_TOKEN(EQ) "=="
2825%token tEQQ RUBY_TOKEN(EQQ) "==="
2826%token tNEQ RUBY_TOKEN(NEQ) "!="
2827%token tGEQ RUBY_TOKEN(GEQ) ">="
2828%token tLEQ RUBY_TOKEN(LEQ) "<="
2829%token tANDOP RUBY_TOKEN(ANDOP) "&&"
2830%token tOROP RUBY_TOKEN(OROP) "||"
2831%token tMATCH RUBY_TOKEN(MATCH) "=~"
2832%token tNMATCH RUBY_TOKEN(NMATCH) "!~"
2833%token tDOT2 RUBY_TOKEN(DOT2) ".."
2834%token tDOT3 RUBY_TOKEN(DOT3) "..."
2835%token tBDOT2 RUBY_TOKEN(BDOT2) "(.."
2836%token tBDOT3 RUBY_TOKEN(BDOT3) "(..."
2837%token tAREF RUBY_TOKEN(AREF) "[]"
2838%token tASET RUBY_TOKEN(ASET) "[]="
2839%token tLSHFT RUBY_TOKEN(LSHFT) "<<"
2840%token tRSHFT RUBY_TOKEN(RSHFT) ">>"
2841%token <id> tANDDOT RUBY_TOKEN(ANDDOT) "&."
2842%token <id> tCOLON2 RUBY_TOKEN(COLON2) "::"
2843%token tCOLON3 ":: at EXPR_BEG"
2844%token <id> tOP_ASGN "operator-assignment" /* +=, -= etc. */
2845%token tASSOC "=>"
2846%token tLPAREN "("
2847%token tLPAREN_ARG "( arg"
2848%token tLBRACK "["
2849%token tLBRACE "{"
2850%token tLBRACE_ARG "{ arg"
2851%token tSTAR "*"
2852%token tDSTAR "**arg"
2853%token tAMPER "&"
2854%token <num> tLAMBDA "->"
2855%token tSYMBEG "symbol literal"
2856%token tSTRING_BEG "string literal"
2857%token tXSTRING_BEG "backtick literal"
2858%token tREGEXP_BEG "regexp literal"
2859%token tWORDS_BEG "word list"
2860%token tQWORDS_BEG "verbatim word list"
2861%token tSYMBOLS_BEG "symbol list"
2862%token tQSYMBOLS_BEG "verbatim symbol list"
2863%token tSTRING_END "terminator"
2864%token tSTRING_DEND "'}'"
2865%token <state> tSTRING_DBEG "'#{'"
2866%token tSTRING_DVAR tLAMBEG tLABEL_END
2867
2868%token tIGNORED_NL tCOMMENT tEMBDOC_BEG tEMBDOC tEMBDOC_END
2869%token tHEREDOC_BEG tHEREDOC_END k__END__
2870
2871/*
2872 * precedence table
2873 */
2874
2875%nonassoc tLOWEST
2876%nonassoc tLBRACE_ARG
2877
2878%nonassoc modifier_if modifier_unless modifier_while modifier_until keyword_in
2879%left keyword_or keyword_and
2880%right keyword_not
2881%nonassoc keyword_defined
2882%right '=' tOP_ASGN
2883%left modifier_rescue
2884%right '?' ':'
2885%nonassoc tDOT2 tDOT3 tBDOT2 tBDOT3
2886%left tOROP
2887%left tANDOP
2888%nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH
2889%left '>' tGEQ '<' tLEQ
2890%left '|' '^'
2891%left '&'
2892%left tLSHFT tRSHFT
2893%left '+' '-'
2894%left '*' '/' '%'
2895%right tUMINUS_NUM tUMINUS
2896%right tPOW
2897%right '!' '~' tUPLUS
2898
2899%token tLAST_TOKEN
2900
2901/*
2902 * inlining rules
2903 */
2904%rule %inline ident_or_const
2905 : tIDENTIFIER
2906 | tCONSTANT
2907 ;
2908
2909%rule %inline user_or_keyword_variable
2910 : user_variable
2911 | keyword_variable
2912 ;
2913
2914/*
2915 * parameterizing rules
2916 */
2917%rule asgn(rhs) <node>
2918 : lhs '=' lex_ctxt rhs
2919 {
2920 $$ = node_assign(p, (NODE *)$lhs, $rhs, $lex_ctxt, &@$);
2921 /*% ripper: assign!($:1, $:4) %*/
2922 }
2923 ;
2924
2925%rule args_tail_basic(value) <node_args>
2926 : f_kwarg(value) ',' f_kwrest opt_f_block_arg
2927 {
2928 $$ = new_args_tail(p, $1, $3, $4, &@3);
2929 /*% ripper: [$:1, $:3, $:4] %*/
2930 }
2931 | f_kwarg(value) opt_f_block_arg
2932 {
2933 $$ = new_args_tail(p, $1, 0, $2, &@1);
2934 /*% ripper: [$:1, Qnil, $:2] %*/
2935 }
2936 | f_any_kwrest opt_f_block_arg
2937 {
2938 $$ = new_args_tail(p, 0, $1, $2, &@1);
2939 /*% ripper: [Qnil, $:1, $:2] %*/
2940 }
2941 | f_block_arg
2942 {
2943 $$ = new_args_tail(p, 0, 0, $1, &@1);
2944 /*% ripper: [Qnil, Qnil, $:1] %*/
2945 }
2946 ;
2947
2948%rule def_endless_method(bodystmt) <node>
2949 : defn_head[head] f_opt_paren_args[args] '=' bodystmt
2950 {
2951 endless_method_name(p, $head->nd_mid, &@head);
2952 restore_defun(p, $head);
2953 ($$ = $head->nd_def)->nd_loc = @$;
2954 $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$);
2955 RNODE_DEFN($$)->nd_defn = $bodystmt;
2956 /*% ripper: bodystmt!($:bodystmt, Qnil, Qnil, Qnil) %*/
2957 /*% ripper: def!($:head, $:args, $:$) %*/
2958 local_pop(p);
2959 }
2960 | defs_head[head] f_opt_paren_args[args] '=' bodystmt
2961 {
2962 endless_method_name(p, $head->nd_mid, &@head);
2963 restore_defun(p, $head);
2964 ($$ = $head->nd_def)->nd_loc = @$;
2965 $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$);
2966 RNODE_DEFS($$)->nd_defn = $bodystmt;
2967 /*% ripper: bodystmt!($:bodystmt, Qnil, Qnil, Qnil) %*/
2968 /*% ripper: defs!(*$:head[0..2], $:args, $:$) %*/
2969 local_pop(p);
2970 }
2971 ;
2972
2973%rule compstmt(stmts) <node>
2974 : stmts terms?
2975 {
2976 void_stmts(p, $$ = $stmts);
2977 }
2978 ;
2979
2980%rule f_opt(value) <node_opt_arg>
2981 : f_arg_asgn f_eq value
2982 {
2983 p->ctxt.in_argdef = 1;
2984 $$ = NEW_OPT_ARG(assignable(p, $f_arg_asgn, $value, &@$), &@$);
2985 /*% ripper: [$:$, $:3] %*/
2986 }
2987 ;
2988
2989%rule f_opt_arg(value) <node_opt_arg>
2990 : f_opt(value)
2991 {
2992 $$ = $f_opt;
2993 /*% ripper: rb_ary_new3(1, $:1) %*/
2994 }
2995 | f_opt_arg(value) ',' f_opt(value)
2996 {
2997 $$ = opt_arg_append($f_opt_arg, $f_opt);
2998 /*% ripper: rb_ary_push($:1, $:3) %*/
2999 }
3000 ;
3001
3002%rule f_kw(value) <node_kw_arg>
3003 : f_label value
3004 {
3005 p->ctxt.in_argdef = 1;
3006 $$ = new_kw_arg(p, assignable(p, $f_label, $value, &@$), &@$);
3007 /*% ripper: [$:$, $:value] %*/
3008 }
3009 | f_label
3010 {
3011 p->ctxt.in_argdef = 1;
3012 $$ = new_kw_arg(p, assignable(p, $f_label, NODE_SPECIAL_REQUIRED_KEYWORD, &@$), &@$);
3013 /*% ripper: [$:$, 0] %*/
3014 }
3015 ;
3016
3017%rule f_kwarg(value) <node_kw_arg>
3018 : f_kw(value)
3019 {
3020 $$ = $f_kw;
3021 /*% ripper: rb_ary_new3(1, $:1) %*/
3022 }
3023 | f_kwarg(value) ',' f_kw(value)
3024 {
3025 $$ = kwd_append($f_kwarg, $f_kw);
3026 /*% ripper: rb_ary_push($:1, $:3) %*/
3027 }
3028 ;
3029
3030%rule mlhs_items(item) <node>
3031 : item
3032 {
3033 $$ = NEW_LIST($1, &@$);
3034 /*% ripper: mlhs_add!(mlhs_new!, $:1) %*/
3035 }
3036 | mlhs_items(item) ',' item
3037 {
3038 $$ = list_append(p, $1, $3);
3039 /*% ripper: mlhs_add!($:1, $:3) %*/
3040 }
3041 ;
3042
3043%rule op_asgn(rhs) <node>
3044 : var_lhs tOP_ASGN lex_ctxt rhs
3045 {
3046 $$ = new_op_assign(p, $var_lhs, $tOP_ASGN, $rhs, $lex_ctxt, &@$);
3047 /*% ripper: opassign!($:1, $:2, $:4) %*/
3048 }
3049 | primary_value '['[lbracket] opt_call_args rbracket tOP_ASGN lex_ctxt rhs
3050 {
3051 $$ = new_ary_op_assign(p, $primary_value, $opt_call_args, $tOP_ASGN, $rhs, &@opt_call_args, &@$, &NULL_LOC, &@lbracket, &@rbracket, &@tOP_ASGN);
3052 /*% ripper: opassign!(aref_field!($:1, $:3), $:5, $:7) %*/
3053 }
3054 | primary_value call_op tIDENTIFIER tOP_ASGN lex_ctxt rhs
3055 {
3056 $$ = new_attr_op_assign(p, $primary_value, $call_op, $tIDENTIFIER, $tOP_ASGN, $rhs, &@$, &@call_op, &@tIDENTIFIER, &@tOP_ASGN);
3057 /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/
3058 }
3059 | primary_value call_op tCONSTANT tOP_ASGN lex_ctxt rhs
3060 {
3061 $$ = new_attr_op_assign(p, $primary_value, $call_op, $tCONSTANT, $tOP_ASGN, $rhs, &@$, &@call_op, &@tCONSTANT, &@tOP_ASGN);
3062 /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/
3063 }
3064 | primary_value tCOLON2 tIDENTIFIER tOP_ASGN lex_ctxt rhs
3065 {
3066 $$ = new_attr_op_assign(p, $primary_value, idCOLON2, $tIDENTIFIER, $tOP_ASGN, $rhs, &@$, &@tCOLON2, &@tIDENTIFIER, &@tOP_ASGN);
3067 /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/
3068 }
3069 | primary_value tCOLON2 tCONSTANT tOP_ASGN lex_ctxt rhs
3070 {
3071 YYLTYPE loc = code_loc_gen(&@primary_value, &@tCONSTANT);
3072 $$ = new_const_op_assign(p, NEW_COLON2($primary_value, $tCONSTANT, &loc, &@tCOLON2, &@tCONSTANT), $tOP_ASGN, $rhs, $lex_ctxt, &@$);
3073 /*% ripper: opassign!(const_path_field!($:1, $:3), $:4, $:6) %*/
3074 }
3075 | tCOLON3 tCONSTANT tOP_ASGN lex_ctxt rhs
3076 {
3077 YYLTYPE loc = code_loc_gen(&@tCOLON3, &@tCONSTANT);
3078 $$ = new_const_op_assign(p, NEW_COLON3($tCONSTANT, &loc, &@tCOLON3, &@tCONSTANT), $tOP_ASGN, $rhs, $lex_ctxt, &@$);
3079 /*% ripper: opassign!(top_const_field!($:2), $:3, $:5) %*/
3080 }
3081 | backref tOP_ASGN lex_ctxt rhs
3082 {
3083 VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $backref);
3084 $$ = NEW_ERROR(&@$);
3085 /*% ripper[error]: assign_error!(?e, opassign!(var_field!($:1), $:2, $:4)) %*/
3086 }
3087 ;
3088
3089%rule opt_args_tail(tail) <node_args>
3090 : ',' tail
3091 {
3092 $$ = $tail;
3093 /*% ripper: $:2 %*/
3094 }
3095 | /* none */
3096 {
3097 $$ = new_args_tail(p, 0, 0, 0, &@0);
3098 /*% ripper: [Qnil, Qnil, Qnil] %*/
3099 }
3100 ;
3101
3102%rule range_expr(range) <node>
3103 : range tDOT2 range
3104 {
3105 value_expr(p, $1);
3106 value_expr(p, $3);
3107 $$ = NEW_DOT2($1, $3, &@$, &@2);
3108 /*% ripper: dot2!($:1, $:3) %*/
3109 }
3110 | range tDOT3 range
3111 {
3112 value_expr(p, $1);
3113 value_expr(p, $3);
3114 $$ = NEW_DOT3($1, $3, &@$, &@2);
3115 /*% ripper: dot3!($:1, $:3) %*/
3116 }
3117 | range tDOT2
3118 {
3119 value_expr(p, $1);
3120 $$ = NEW_DOT2($1, new_nil_at(p, &@2.end_pos), &@$, &@2);
3121 /*% ripper: dot2!($:1, Qnil) %*/
3122 }
3123 | range tDOT3
3124 {
3125 value_expr(p, $1);
3126 $$ = NEW_DOT3($1, new_nil_at(p, &@2.end_pos), &@$, &@2);
3127 /*% ripper: dot3!($:1, Qnil) %*/
3128 }
3129 | tBDOT2 range
3130 {
3131 value_expr(p, $2);
3132 $$ = NEW_DOT2(new_nil_at(p, &@1.beg_pos), $2, &@$, &@1);
3133 /*% ripper: dot2!(Qnil, $:2) %*/
3134 }
3135 | tBDOT3 range
3136 {
3137 value_expr(p, $2);
3138 $$ = NEW_DOT3(new_nil_at(p, &@1.beg_pos), $2, &@$, &@1);
3139 /*% ripper: dot3!(Qnil, $:2) %*/
3140 }
3141 ;
3142
3143%rule value_expr(value) <node>
3144 : value
3145 {
3146 value_expr(p, $1);
3147 $$ = $1;
3148 }
3149 ;
3150
3151%rule words(begin, word_list) <node>
3152 : begin ' '+ word_list tSTRING_END
3153 {
3154 $$ = make_list($word_list, &@$);
3155 /*% ripper: array!($:3) %*/
3156 }
3157 ;
3158
3159%%
3160program : {
3161 SET_LEX_STATE(EXPR_BEG);
3162 local_push(p, ifndef_ripper(1)+0);
3163 /* jumps are possible in the top-level loop. */
3164 if (!ifndef_ripper(p->do_loop) + 0) init_block_exit(p);
3165 }
3166 compstmt(top_stmts)
3167 {
3168 if ($2 && !compile_for_eval) {
3169 NODE *node = $2;
3170 /* last expression should not be void */
3171 if (nd_type_p(node, NODE_BLOCK)) {
3172 while (RNODE_BLOCK(node)->nd_next) {
3173 node = RNODE_BLOCK(node)->nd_next;
3174 }
3175 node = RNODE_BLOCK(node)->nd_head;
3176 }
3177 node = remove_begin(node);
3178 void_expr(p, node);
3179 }
3180 p->eval_tree = NEW_SCOPE(0, block_append(p, p->eval_tree, $2), NULL, &@$);
3181 /*% ripper[final]: program!($:2) %*/
3182 local_pop(p);
3183 }
3184 ;
3185
3186top_stmts : none
3187 {
3188 $$ = NEW_BEGIN(0, &@$);
3189 /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/
3190 }
3191 | top_stmt
3192 {
3193 $$ = newline_node($1);
3194 /*% ripper: stmts_add!(stmts_new!, $:1) %*/
3195 }
3196 | top_stmts terms top_stmt
3197 {
3198 $$ = block_append(p, $1, newline_node($3));
3199 /*% ripper: stmts_add!($:1, $:3) %*/
3200 }
3201 ;
3202
3203top_stmt : stmt
3204 {
3205 clear_block_exit(p, true);
3206 $$ = $1;
3207 }
3208 | keyword_BEGIN begin_block
3209 {
3210 $$ = $2;
3211 /*% ripper: $:2 %*/
3212 }
3213 ;
3214
3215block_open : '{' {$$ = init_block_exit(p);};
3216
3217begin_block : block_open compstmt(top_stmts) '}'
3218 {
3219 restore_block_exit(p, $block_open);
3220 p->eval_tree_begin = block_append(p, p->eval_tree_begin,
3221 NEW_BEGIN($2, &@$));
3222 $$ = NEW_BEGIN(0, &@$);
3223 /*% ripper: BEGIN!($:2) %*/
3224 }
3225 ;
3226
3227bodystmt : compstmt(stmts)[body]
3228 lex_ctxt[ctxt]
3229 opt_rescue
3230 k_else
3231 {
3232 if (!$opt_rescue) yyerror1(&@k_else, "else without rescue is useless");
3233 next_rescue_context(&p->ctxt, &$ctxt, after_else);
3234 }
3235 compstmt(stmts)[elsebody]
3236 {
3237 next_rescue_context(&p->ctxt, &$ctxt, after_ensure);
3238 }
3239 opt_ensure
3240 {
3241 $$ = new_bodystmt(p, $body, $opt_rescue, $elsebody, $opt_ensure, &@$);
3242 /*% ripper: bodystmt!($:body, $:opt_rescue, $:elsebody, $:opt_ensure) %*/
3243 }
3244 | compstmt(stmts)[body]
3245 lex_ctxt[ctxt]
3246 opt_rescue
3247 {
3248 next_rescue_context(&p->ctxt, &$ctxt, after_ensure);
3249 }
3250 opt_ensure
3251 {
3252 $$ = new_bodystmt(p, $body, $opt_rescue, 0, $opt_ensure, &@$);
3253 /*% ripper: bodystmt!($:body, $:opt_rescue, Qnil, $:opt_ensure) %*/
3254 }
3255 ;
3256
3257stmts : none
3258 {
3259 $$ = NEW_BEGIN(0, &@$);
3260 /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/
3261 }
3262 | stmt_or_begin
3263 {
3264 $$ = newline_node($1);
3265 /*% ripper: stmts_add!(stmts_new!, $:1) %*/
3266 }
3267 | stmts terms stmt_or_begin
3268 {
3269 $$ = block_append(p, $1, newline_node($3));
3270 /*% ripper: stmts_add!($:1, $:3) %*/
3271 }
3272 ;
3273
3274stmt_or_begin : stmt
3275 | keyword_BEGIN
3276 {
3277 yyerror1(&@1, "BEGIN is permitted only at toplevel");
3278 }
3279 begin_block
3280 {
3281 $$ = $3;
3282 }
3283 ;
3284
3285allow_exits : {$$ = allow_block_exit(p);};
3286
3287k_END : keyword_END lex_ctxt
3288 {
3289 $$ = $2;
3290 p->ctxt.in_rescue = before_rescue;
3291 /*% ripper: $:2 %*/
3292 };
3293
3294stmt : keyword_alias fitem {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem
3295 {
3296 $$ = NEW_ALIAS($2, $4, &@$, &@1);
3297 /*% ripper: alias!($:2, $:4) %*/
3298 }
3299 | keyword_alias tGVAR tGVAR
3300 {
3301 $$ = NEW_VALIAS($2, $3, &@$, &@1);
3302 /*% ripper: var_alias!($:2, $:3) %*/
3303 }
3304 | keyword_alias tGVAR tBACK_REF
3305 {
3306 char buf[2];
3307 buf[0] = '$';
3308 buf[1] = (char)RNODE_BACK_REF($3)->nd_nth;
3309 $$ = NEW_VALIAS($2, rb_intern2(buf, 2), &@$, &@1);
3310 /*% ripper: var_alias!($:2, $:3) %*/
3311 }
3312 | keyword_alias tGVAR tNTH_REF
3313 {
3314 static const char mesg[] = "can't make alias for the number variables";
3315 /*%%%*/
3316 yyerror1(&@3, mesg);
3317 /*% %*/
3318 $$ = NEW_ERROR(&@$);
3319 /*% ripper[error]: alias_error!(ERR_MESG(), $:3) %*/
3320 }
3321 | keyword_undef undef_list
3322 {
3323 nd_set_first_loc($2, @1.beg_pos);
3324 RNODE_UNDEF($2)->keyword_loc = @1;
3325 $$ = $2;
3326 /*% ripper: undef!($:2) %*/
3327 }
3328 | stmt modifier_if expr_value
3329 {
3330 $$ = new_if(p, $3, remove_begin($1), 0, &@$, &@2, &NULL_LOC, &NULL_LOC);
3331 fixpos($$, $3);
3332 /*% ripper: if_mod!($:3, $:1) %*/
3333 }
3334 | stmt modifier_unless expr_value
3335 {
3336 $$ = new_unless(p, $3, remove_begin($1), 0, &@$, &@2, &NULL_LOC, &NULL_LOC);
3337 fixpos($$, $3);
3338 /*% ripper: unless_mod!($:3, $:1) %*/
3339 }
3340 | stmt modifier_while expr_value
3341 {
3342 clear_block_exit(p, false);
3343 if ($1 && nd_type_p($1, NODE_BEGIN)) {
3344 $$ = NEW_WHILE(cond(p, $3, &@3), RNODE_BEGIN($1)->nd_body, 0, &@$, &@2, &NULL_LOC);
3345 }
3346 else {
3347 $$ = NEW_WHILE(cond(p, $3, &@3), $1, 1, &@$, &@2, &NULL_LOC);
3348 }
3349 /*% ripper: while_mod!($:3, $:1) %*/
3350 }
3351 | stmt modifier_until expr_value
3352 {
3353 clear_block_exit(p, false);
3354 if ($1 && nd_type_p($1, NODE_BEGIN)) {
3355 $$ = NEW_UNTIL(cond(p, $3, &@3), RNODE_BEGIN($1)->nd_body, 0, &@$, &@2, &NULL_LOC);
3356 }
3357 else {
3358 $$ = NEW_UNTIL(cond(p, $3, &@3), $1, 1, &@$, &@2, &NULL_LOC);
3359 }
3360 /*% ripper: until_mod!($:3, $:1) %*/
3361 }
3362 | stmt modifier_rescue after_rescue stmt
3363 {
3364 p->ctxt.in_rescue = $3.in_rescue;
3365 NODE *resq;
3366 YYLTYPE loc = code_loc_gen(&@2, &@4);
3367 resq = NEW_RESBODY(0, 0, remove_begin($4), 0, &loc);
3368 $$ = NEW_RESCUE(remove_begin($1), resq, 0, &@$);
3369 /*% ripper: rescue_mod!($:1, $:4) %*/
3370 }
3371 | k_END allow_exits '{' compstmt(stmts) '}'
3372 {
3373 if (p->ctxt.in_def) {
3374 rb_warn0("END in method; use at_exit");
3375 }
3376 restore_block_exit(p, $allow_exits);
3377 p->ctxt = $k_END;
3378 {
3379 NODE *scope = NEW_SCOPE2(0 /* tbl */, 0 /* args */, $compstmt /* body */, NULL /* parent */, &@$);
3380 $$ = NEW_POSTEXE(scope, &@$, &@1, &@3, &@5);
3381 RNODE_SCOPE(scope)->nd_parent = $$;
3382 }
3383 /*% ripper: END!($:compstmt) %*/
3384 }
3385 | command_asgn
3386 | mlhs '=' lex_ctxt command_call_value
3387 {
3388 $$ = node_assign(p, (NODE *)$1, $4, $3, &@$);
3389 /*% ripper: massign!($:1, $:4) %*/
3390 }
3391 | asgn(mrhs)
3392 | mlhs '=' lex_ctxt mrhs_arg modifier_rescue
3393 after_rescue stmt[resbody]
3394 {
3395 p->ctxt.in_rescue = $3.in_rescue;
3396 YYLTYPE loc = code_loc_gen(&@modifier_rescue, &@resbody);
3397 $resbody = NEW_RESBODY(0, 0, remove_begin($resbody), 0, &loc);
3398 loc.beg_pos = @mrhs_arg.beg_pos;
3399 $mrhs_arg = NEW_RESCUE($mrhs_arg, $resbody, 0, &loc);
3400 $$ = node_assign(p, (NODE *)$mlhs, $mrhs_arg, $lex_ctxt, &@$);
3401 /*% ripper: massign!($:1, rescue_mod!($:4, $:7)) %*/
3402 }
3403 | mlhs '=' lex_ctxt mrhs_arg
3404 {
3405 $$ = node_assign(p, (NODE *)$1, $4, $3, &@$);
3406 /*% ripper: massign!($:1, $:4) %*/
3407 }
3408 | expr
3409 | error
3410 {
3411 (void)yynerrs;
3412 $$ = NEW_ERROR(&@$);
3413 }
3414 ;
3415
3416command_asgn : asgn(command_rhs)
3417 | op_asgn(command_rhs)
3418 | def_endless_method(endless_command)
3419 ;
3420
3421endless_command : command
3422 | endless_command modifier_rescue after_rescue arg
3423 {
3424 p->ctxt.in_rescue = $3.in_rescue;
3425 $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4);
3426 /*% ripper: rescue_mod!($:1, $:4) %*/
3427 }
3428 | keyword_not '\n'? endless_command
3429 {
3430 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
3431 /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/
3432 }
3433 ;
3434
3435command_rhs : command_call_value %prec tOP_ASGN
3436 | command_call_value modifier_rescue after_rescue stmt
3437 {
3438 p->ctxt.in_rescue = $3.in_rescue;
3439 YYLTYPE loc = code_loc_gen(&@2, &@4);
3440 $$ = NEW_RESCUE($1, NEW_RESBODY(0, 0, remove_begin($4), 0, &loc), 0, &@$);
3441 /*% ripper: rescue_mod!($:1, $:4) %*/
3442 }
3443 | command_asgn
3444 ;
3445
3446expr : command_call
3447 | expr keyword_and expr
3448 {
3449 $$ = logop(p, idAND, $1, $3, &@2, &@$);
3450 /*% ripper: binary!($:1, ID2VAL(idAND), $:3) %*/
3451 }
3452 | expr keyword_or expr
3453 {
3454 $$ = logop(p, idOR, $1, $3, &@2, &@$);
3455 /*% ripper: binary!($:1, ID2VAL(idOR), $:3) %*/
3456 }
3457 | keyword_not '\n'? expr
3458 {
3459 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
3460 /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/
3461 }
3462 | '!' command_call
3463 {
3464 $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$);
3465 /*% ripper: unary!(ID2VAL('\'!\''), $:2) %*/
3466 }
3467 | arg tASSOC
3468 {
3469 value_expr(p, $arg);
3470 }
3471 p_in_kwarg[ctxt] p_pvtbl p_pktbl
3472 p_top_expr_body[body]
3473 {
3474 pop_pktbl(p, $p_pktbl);
3475 pop_pvtbl(p, $p_pvtbl);
3476 p->ctxt.in_kwarg = $ctxt.in_kwarg;
3477 p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern;
3478 p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern;
3479 $$ = NEW_CASE3($arg, NEW_IN($body, 0, 0, &@body, &NULL_LOC, &NULL_LOC, &@2), &@$, &NULL_LOC, &NULL_LOC);
3480 /*% ripper: case!($:arg, in!($:body, Qnil, Qnil)) %*/
3481 }
3482 | arg keyword_in
3483 {
3484 value_expr(p, $arg);
3485 }
3486 p_in_kwarg[ctxt] p_pvtbl p_pktbl
3487 p_top_expr_body[body]
3488 {
3489 pop_pktbl(p, $p_pktbl);
3490 pop_pvtbl(p, $p_pvtbl);
3491 p->ctxt.in_kwarg = $ctxt.in_kwarg;
3492 p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern;
3493 p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern;
3494 $$ = NEW_CASE3($arg, NEW_IN($body, NEW_TRUE(&@body), NEW_FALSE(&@body), &@body, &@keyword_in, &NULL_LOC, &NULL_LOC), &@$, &NULL_LOC, &NULL_LOC);
3495 /*% ripper: case!($:arg, in!($:body, Qnil, Qnil)) %*/
3496 }
3497 | arg %prec tLBRACE_ARG
3498 ;
3499
3500def_name : fname
3501 {
3502 numparam_name(p, $fname);
3503 local_push(p, 0);
3504 p->ctxt.in_def = 1;
3505 p->ctxt.in_rescue = before_rescue;
3506 p->ctxt.cant_return = 0;
3507 $$ = $fname;
3508 }
3509 ;
3510
3511defn_head : k_def def_name
3512 {
3513 $$ = def_head_save(p, $k_def);
3514 $$->nd_mid = $def_name;
3515 $$->nd_def = NEW_DEFN($def_name, 0, &@$);
3516 /*% ripper: $:def_name %*/
3517 }
3518 ;
3519
3520defs_head : k_def singleton dot_or_colon
3521 {
3522 SET_LEX_STATE(EXPR_FNAME);
3523 }
3524 def_name
3525 {
3526 SET_LEX_STATE(EXPR_ENDFN|EXPR_LABEL); /* force for args */
3527 $$ = def_head_save(p, $k_def);
3528 $$->nd_mid = $def_name;
3529 $$->nd_def = NEW_DEFS($singleton, $def_name, 0, &@$);
3530 /*% ripper: [$:singleton, $:dot_or_colon, $:def_name] %*/
3531 }
3532 ;
3533
3534expr_value : value_expr(expr)
3535 | error
3536 {
3537 $$ = NEW_ERROR(&@$);
3538 }
3539 ;
3540
3541expr_value_do : {COND_PUSH(1);} expr_value do {COND_POP();}
3542 {
3543 $$ = $2;
3544 /*% ripper: $:2 %*/
3545 }
3546 ;
3547
3548command_call : command
3549 | block_command
3550 ;
3551
3552command_call_value : value_expr(command_call)
3553 ;
3554
3555block_command : block_call
3556 | block_call call_op2 operation2 command_args
3557 {
3558 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
3559 /*% ripper: method_add_arg!(call!($:1, $:2, $:3), $:4) %*/
3560 }
3561 ;
3562
3563cmd_brace_block : tLBRACE_ARG brace_body '}'
3564 {
3565 $$ = $2;
3566 set_embraced_location($$, &@1, &@3);
3567 /*% ripper: $:2 %*/
3568 }
3569 ;
3570
3571fcall : operation
3572 {
3573 $$ = NEW_FCALL($1, 0, &@$);
3574 /*% ripper: $:1 %*/
3575 }
3576 ;
3577
3578command : fcall command_args %prec tLOWEST
3579 {
3580 $1->nd_args = $2;
3581 nd_set_last_loc($1, @2.end_pos);
3582 $$ = (NODE *)$1;
3583 /*% ripper: command!($:1, $:2) %*/
3584 }
3585 | fcall command_args cmd_brace_block
3586 {
3587 block_dup_check(p, $2, $3);
3588 $1->nd_args = $2;
3589 $$ = method_add_block(p, (NODE *)$1, $3, &@$);
3590 fixpos($$, RNODE($1));
3591 nd_set_last_loc($1, @2.end_pos);
3592 /*% ripper: method_add_block!(command!($:1, $:2), $:3) %*/
3593 }
3594 | primary_value call_op operation2 command_args %prec tLOWEST
3595 {
3596 $$ = new_command_qcall(p, $2, $1, $3, $4, 0, &@3, &@$);
3597 /*% ripper: command_call!($:1, $:2, $:3, $:4) %*/
3598 }
3599 | primary_value call_op operation2 command_args cmd_brace_block
3600 {
3601 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
3602 /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/
3603 }
3604 | primary_value tCOLON2 operation2 command_args %prec tLOWEST
3605 {
3606 $$ = new_command_qcall(p, idCOLON2, $1, $3, $4, 0, &@3, &@$);
3607 /*% ripper: command_call!($:1, $:2, $:3, $:4) %*/
3608 }
3609 | primary_value tCOLON2 operation2 command_args cmd_brace_block
3610 {
3611 $$ = new_command_qcall(p, idCOLON2, $1, $3, $4, $5, &@3, &@$);
3612 /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/
3613 }
3614 | primary_value tCOLON2 tCONSTANT '{' brace_body '}'
3615 {
3616 set_embraced_location($5, &@4, &@6);
3617 $$ = new_command_qcall(p, idCOLON2, $1, $3, 0, $5, &@3, &@$);
3618 /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, Qnil), $:5) %*/
3619 }
3620 | keyword_super command_args
3621 {
3622 $$ = NEW_SUPER($2, &@$, &@1, &NULL_LOC, &NULL_LOC);
3623 fixpos($$, $2);
3624 /*% ripper: super!($:2) %*/
3625 }
3626 | k_yield command_args
3627 {
3628 $$ = NEW_YIELD($2, &@$, &@1, &NULL_LOC, &NULL_LOC);
3629 fixpos($$, $2);
3630 /*% ripper: yield!($:2) %*/
3631 }
3632 | k_return call_args
3633 {
3634 $$ = NEW_RETURN(ret_args(p, $2), &@$, &@1);
3635 /*% ripper: return!($:2) %*/
3636 }
3637 | keyword_break call_args
3638 {
3639 NODE *args = 0;
3640 args = ret_args(p, $2);
3641 $$ = add_block_exit(p, NEW_BREAK(args, &@$, &@1));
3642 /*% ripper: break!($:2) %*/
3643 }
3644 | keyword_next call_args
3645 {
3646 NODE *args = 0;
3647 args = ret_args(p, $2);
3648 $$ = add_block_exit(p, NEW_NEXT(args, &@$, &@1));
3649 /*% ripper: next!($:2) %*/
3650 }
3651 ;
3652
3653mlhs : mlhs_basic
3654 | tLPAREN mlhs_inner rparen
3655 {
3656 $$ = $2;
3657 /*% ripper: mlhs_paren!($:2) %*/
3658 }
3659 ;
3660
3661mlhs_inner : mlhs_basic
3662 | tLPAREN mlhs_inner rparen
3663 {
3664 $$ = NEW_MASGN(NEW_LIST((NODE *)$2, &@$), 0, &@$);
3665 /*% ripper: mlhs_paren!($:2) %*/
3666 }
3667 ;
3668
3669mlhs_basic : mlhs_head
3670 {
3671 $$ = NEW_MASGN($1, 0, &@$);
3672 /*% ripper: $:1 %*/
3673 }
3674 | mlhs_head mlhs_item
3675 {
3676 $$ = NEW_MASGN(list_append(p, $1, $2), 0, &@$);
3677 /*% ripper: mlhs_add!($:1, $:2) %*/
3678 }
3679 | mlhs_head tSTAR mlhs_node
3680 {
3681 $$ = NEW_MASGN($1, $3, &@$);
3682 /*% ripper: mlhs_add_star!($:1, $:3) %*/
3683 }
3684 | mlhs_head tSTAR mlhs_node ',' mlhs_items(mlhs_item)
3685 {
3686 $$ = NEW_MASGN($1, NEW_POSTARG($3,$5,&@$), &@$);
3687 /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, $:3), $:5) %*/
3688 }
3689 | mlhs_head tSTAR
3690 {
3691 $$ = NEW_MASGN($1, NODE_SPECIAL_NO_NAME_REST, &@$);
3692 /*% ripper: mlhs_add_star!($:1, Qnil) %*/
3693 }
3694 | mlhs_head tSTAR ',' mlhs_items(mlhs_item)
3695 {
3696 $$ = NEW_MASGN($1, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $4, &@$), &@$);
3697 /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, Qnil), $:4) %*/
3698 }
3699 | tSTAR mlhs_node
3700 {
3701 $$ = NEW_MASGN(0, $2, &@$);
3702 /*% ripper: mlhs_add_star!(mlhs_new!, $:2) %*/
3703 }
3704 | tSTAR mlhs_node ',' mlhs_items(mlhs_item)
3705 {
3706 $$ = NEW_MASGN(0, NEW_POSTARG($2,$4,&@$), &@$);
3707 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $:2), $:4) %*/
3708 }
3709 | tSTAR
3710 {
3711 $$ = NEW_MASGN(0, NODE_SPECIAL_NO_NAME_REST, &@$);
3712 /*% ripper: mlhs_add_star!(mlhs_new!, Qnil) %*/
3713 }
3714 | tSTAR ',' mlhs_items(mlhs_item)
3715 {
3716 $$ = NEW_MASGN(0, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $3, &@$), &@$);
3717 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, Qnil), $:3) %*/
3718 }
3719 ;
3720
3721mlhs_item : mlhs_node
3722 | tLPAREN mlhs_inner rparen
3723 {
3724 $$ = (NODE *)$2;
3725 /*% ripper: mlhs_paren!($:2) %*/
3726 }
3727 ;
3728
3729mlhs_head : mlhs_item ','
3730 {
3731 $$ = NEW_LIST($1, &@1);
3732 /*% ripper: mlhs_add!(mlhs_new!, $:1) %*/
3733 }
3734 | mlhs_head mlhs_item ','
3735 {
3736 $$ = list_append(p, $1, $2);
3737 /*% ripper: mlhs_add!($:1, $:2) %*/
3738 }
3739 ;
3740
3741
3742mlhs_node : user_or_keyword_variable
3743 {
3744 /*% ripper: var_field!($:1) %*/
3745 $$ = assignable(p, $1, 0, &@$);
3746 }
3747 | primary_value '[' opt_call_args rbracket
3748 {
3749 $$ = aryset(p, $1, $3, &@$);
3750 /*% ripper: aref_field!($:1, $:3) %*/
3751 }
3752 | primary_value call_op ident_or_const
3753 {
3754 anddot_multiple_assignment_check(p, &@2, $2);
3755 $$ = attrset(p, $1, $2, $3, &@$);
3756 /*% ripper: field!($:1, $:2, $:3) %*/
3757 }
3758 | primary_value tCOLON2 tIDENTIFIER
3759 {
3760 $$ = attrset(p, $1, idCOLON2, $3, &@$);
3761 /*% ripper: const_path_field!($:1, $:3) %*/
3762 }
3763 | primary_value tCOLON2 tCONSTANT
3764 {
3765 /*% ripper: const_path_field!($:1, $:3) %*/
3766 $$ = const_decl(p, NEW_COLON2($1, $3, &@$, &@2, &@3), &@$);
3767 }
3768 | tCOLON3 tCONSTANT
3769 {
3770 /*% ripper: top_const_field!($:2) %*/
3771 $$ = const_decl(p, NEW_COLON3($2, &@$, &@1, &@2), &@$);
3772 }
3773 | backref
3774 {
3775 VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $1);
3776 $$ = NEW_ERROR(&@$);
3777 /*% ripper[error]: assign_error!(?e, var_field!($:1)) %*/
3778 }
3779 ;
3780
3781lhs : user_or_keyword_variable
3782 {
3783 /*% ripper: var_field!($:1) %*/
3784 $$ = assignable(p, $1, 0, &@$);
3785 }
3786 | primary_value '[' opt_call_args rbracket
3787 {
3788 $$ = aryset(p, $1, $3, &@$);
3789 /*% ripper: aref_field!($:1, $:3) %*/
3790 }
3791 | primary_value call_op ident_or_const
3792 {
3793 $$ = attrset(p, $1, $2, $3, &@$);
3794 /*% ripper: field!($:1, $:2, $:3) %*/
3795 }
3796 | primary_value tCOLON2 tIDENTIFIER
3797 {
3798 $$ = attrset(p, $1, idCOLON2, $3, &@$);
3799 /*% ripper: field!($:1, $:2, $:3) %*/
3800 }
3801 | primary_value tCOLON2 tCONSTANT
3802 {
3803 /*% ripper: const_path_field!($:1, $:3) %*/
3804 $$ = const_decl(p, NEW_COLON2($1, $3, &@$, &@2, &@3), &@$);
3805 }
3806 | tCOLON3 tCONSTANT
3807 {
3808 /*% ripper: top_const_field!($:2) %*/
3809 $$ = const_decl(p, NEW_COLON3($2, &@$, &@1, &@2), &@$);
3810 }
3811 | backref
3812 {
3813 VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $1);
3814 $$ = NEW_ERROR(&@$);
3815 /*% ripper[error]: assign_error!(?e, var_field!($:1)) %*/
3816 }
3817 ;
3818
3819cname : tIDENTIFIER
3820 {
3821 static const char mesg[] = "class/module name must be CONSTANT";
3822 /*%%%*/
3823 yyerror1(&@1, mesg);
3824 /*% %*/
3825 /*% ripper[error]: class_name_error!(ERR_MESG(), $:1) %*/
3826 }
3827 | tCONSTANT
3828 ;
3829
3830cpath : tCOLON3 cname
3831 {
3832 $$ = NEW_COLON3($2, &@$, &@1, &@2);
3833 /*% ripper: top_const_ref!($:2) %*/
3834 }
3835 | cname
3836 {
3837 $$ = NEW_COLON2(0, $1, &@$, &NULL_LOC, &@1);
3838 /*% ripper: const_ref!($:1) %*/
3839 }
3840 | primary_value tCOLON2 cname
3841 {
3842 $$ = NEW_COLON2($1, $3, &@$, &@2, &@3);
3843 /*% ripper: const_path_ref!($:1, $:3) %*/
3844 }
3845 ;
3846
3847fname : operation
3848 | op
3849 {
3850 SET_LEX_STATE(EXPR_ENDFN);
3851 $$ = $1;
3852 }
3853 | reswords
3854 ;
3855
3856fitem : fname
3857 {
3858 $$ = NEW_SYM(rb_id2str($1), &@$);
3859 /*% ripper: symbol_literal!($:1) %*/
3860 }
3861 | symbol
3862 ;
3863
3864undef_list : fitem
3865 {
3866 $$ = NEW_UNDEF($1, &@$);
3867 /*% ripper: rb_ary_new3(1, $:1) %*/
3868 }
3869 | undef_list ',' {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem
3870 {
3871 nd_set_last_loc($1, @4.end_pos);
3872 rb_parser_ary_push_node(p, RNODE_UNDEF($1)->nd_undefs, $4);
3873 /*% ripper: rb_ary_push($:1, $:4) %*/
3874 }
3875 ;
3876
3877op : '|' { $$ = '|'; }
3878 | '^' { $$ = '^'; }
3879 | '&' { $$ = '&'; }
3880 | tCMP { $$ = tCMP; }
3881 | tEQ { $$ = tEQ; }
3882 | tEQQ { $$ = tEQQ; }
3883 | tMATCH { $$ = tMATCH; }
3884 | tNMATCH { $$ = tNMATCH; }
3885 | '>' { $$ = '>'; }
3886 | tGEQ { $$ = tGEQ; }
3887 | '<' { $$ = '<'; }
3888 | tLEQ { $$ = tLEQ; }
3889 | tNEQ { $$ = tNEQ; }
3890 | tLSHFT { $$ = tLSHFT; }
3891 | tRSHFT { $$ = tRSHFT; }
3892 | '+' { $$ = '+'; }
3893 | '-' { $$ = '-'; }
3894 | '*' { $$ = '*'; }
3895 | tSTAR { $$ = '*'; }
3896 | '/' { $$ = '/'; }
3897 | '%' { $$ = '%'; }
3898 | tPOW { $$ = tPOW; }
3899 | tDSTAR { $$ = tDSTAR; }
3900 | '!' { $$ = '!'; }
3901 | '~' { $$ = '~'; }
3902 | tUPLUS { $$ = tUPLUS; }
3903 | tUMINUS { $$ = tUMINUS; }
3904 | tAREF { $$ = tAREF; }
3905 | tASET { $$ = tASET; }
3906 | '`' { $$ = '`'; }
3907 ;
3908
3909reswords : keyword__LINE__ | keyword__FILE__ | keyword__ENCODING__
3910 | keyword_BEGIN | keyword_END
3911 | keyword_alias | keyword_and | keyword_begin
3912 | keyword_break | keyword_case | keyword_class | keyword_def
3913 | keyword_defined | keyword_do | keyword_else | keyword_elsif
3914 | keyword_end | keyword_ensure | keyword_false
3915 | keyword_for | keyword_in | keyword_module | keyword_next
3916 | keyword_nil | keyword_not | keyword_or | keyword_redo
3917 | keyword_rescue | keyword_retry | keyword_return | keyword_self
3918 | keyword_super | keyword_then | keyword_true | keyword_undef
3919 | keyword_when | keyword_yield | keyword_if | keyword_unless
3920 | keyword_while | keyword_until
3921 ;
3922
3923arg : asgn(arg_rhs)
3924 | op_asgn(arg_rhs)
3925 | range_expr(arg)
3926 | arg '+' arg
3927 {
3928 $$ = call_bin_op(p, $1, '+', $3, &@2, &@$);
3929 /*% ripper: binary!($:1, ID2VAL('\'+\''), $:3) %*/
3930 }
3931 | arg '-' arg
3932 {
3933 $$ = call_bin_op(p, $1, '-', $3, &@2, &@$);
3934 /*% ripper: binary!($:1, ID2VAL('\'-\''), $:3) %*/
3935 }
3936 | arg '*' arg
3937 {
3938 $$ = call_bin_op(p, $1, '*', $3, &@2, &@$);
3939 /*% ripper: binary!($:1, ID2VAL('\'*\''), $:3) %*/
3940 }
3941 | arg '/' arg
3942 {
3943 $$ = call_bin_op(p, $1, '/', $3, &@2, &@$);
3944 /*% ripper: binary!($:1, ID2VAL('\'/\''), $:3) %*/
3945 }
3946 | arg '%' arg
3947 {
3948 $$ = call_bin_op(p, $1, '%', $3, &@2, &@$);
3949 /*% ripper: binary!($:1, ID2VAL('\'%\''), $:3) %*/
3950 }
3951 | arg tPOW arg
3952 {
3953 $$ = call_bin_op(p, $1, idPow, $3, &@2, &@$);
3954 /*% ripper: binary!($:1, ID2VAL(idPow), $:3) %*/
3955 }
3956 | tUMINUS_NUM simple_numeric tPOW arg
3957 {
3958 $$ = call_uni_op(p, call_bin_op(p, $2, idPow, $4, &@2, &@$), idUMinus, &@1, &@$);
3959 /*% ripper: unary!(ID2VAL(idUMinus), binary!($:2, ID2VAL(idPow), $:4)) %*/
3960 }
3961 | tUPLUS arg
3962 {
3963 $$ = call_uni_op(p, $2, idUPlus, &@1, &@$);
3964 /*% ripper: unary!(ID2VAL(idUPlus), $:2) %*/
3965 }
3966 | tUMINUS arg
3967 {
3968 $$ = call_uni_op(p, $2, idUMinus, &@1, &@$);
3969 /*% ripper: unary!(ID2VAL(idUMinus), $:2) %*/
3970 }
3971 | arg '|' arg
3972 {
3973 $$ = call_bin_op(p, $1, '|', $3, &@2, &@$);
3974 /*% ripper: binary!($:1, ID2VAL('\'|\''), $:3) %*/
3975 }
3976 | arg '^' arg
3977 {
3978 $$ = call_bin_op(p, $1, '^', $3, &@2, &@$);
3979 /*% ripper: binary!($:1, ID2VAL('\'^\''), $:3) %*/
3980 }
3981 | arg '&' arg
3982 {
3983 $$ = call_bin_op(p, $1, '&', $3, &@2, &@$);
3984 /*% ripper: binary!($:1, ID2VAL('\'&\''), $:3) %*/
3985 }
3986 | arg tCMP arg
3987 {
3988 $$ = call_bin_op(p, $1, idCmp, $3, &@2, &@$);
3989 /*% ripper: binary!($:1, ID2VAL(idCmp), $:3) %*/
3990 }
3991 | rel_expr %prec tCMP
3992 | arg tEQ arg
3993 {
3994 $$ = call_bin_op(p, $1, idEq, $3, &@2, &@$);
3995 /*% ripper: binary!($:1, ID2VAL(idEq), $:3) %*/
3996 }
3997 | arg tEQQ arg
3998 {
3999 $$ = call_bin_op(p, $1, idEqq, $3, &@2, &@$);
4000 /*% ripper: binary!($:1, ID2VAL(idEqq), $:3) %*/
4001 }
4002 | arg tNEQ arg
4003 {
4004 $$ = call_bin_op(p, $1, idNeq, $3, &@2, &@$);
4005 /*% ripper: binary!($:1, ID2VAL(idNeq), $:3) %*/
4006 }
4007 | arg tMATCH arg
4008 {
4009 $$ = match_op(p, $1, $3, &@2, &@$);
4010 /*% ripper: binary!($:1, ID2VAL(idEqTilde), $:3) %*/
4011 }
4012 | arg tNMATCH arg
4013 {
4014 $$ = call_bin_op(p, $1, idNeqTilde, $3, &@2, &@$);
4015 /*% ripper: binary!($:1, ID2VAL(idNeqTilde), $:3) %*/
4016 }
4017 | '!' arg
4018 {
4019 $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$);
4020 /*% ripper: unary!(ID2VAL('\'!\''), $:2) %*/
4021 }
4022 | '~' arg
4023 {
4024 $$ = call_uni_op(p, $2, '~', &@1, &@$);
4025 /*% ripper: unary!(ID2VAL('\'~\''), $:2) %*/
4026 }
4027 | arg tLSHFT arg
4028 {
4029 $$ = call_bin_op(p, $1, idLTLT, $3, &@2, &@$);
4030 /*% ripper: binary!($:1, ID2VAL(idLTLT), $:3) %*/
4031 }
4032 | arg tRSHFT arg
4033 {
4034 $$ = call_bin_op(p, $1, idGTGT, $3, &@2, &@$);
4035 /*% ripper: binary!($:1, ID2VAL(idGTGT), $:3) %*/
4036 }
4037 | arg tANDOP arg
4038 {
4039 $$ = logop(p, idANDOP, $1, $3, &@2, &@$);
4040 /*% ripper: binary!($:1, ID2VAL(idANDOP), $:3) %*/
4041 }
4042 | arg tOROP arg
4043 {
4044 $$ = logop(p, idOROP, $1, $3, &@2, &@$);
4045 /*% ripper: binary!($:1, ID2VAL(idOROP), $:3) %*/
4046 }
4047 | keyword_defined '\n'? begin_defined arg
4048 {
4049 p->ctxt.in_defined = $3.in_defined;
4050 $$ = new_defined(p, $4, &@$, &@1);
4051 p->ctxt.has_trailing_semicolon = $3.has_trailing_semicolon;
4052 /*% ripper: defined!($:4) %*/
4053 }
4054 | def_endless_method(endless_arg)
4055 | ternary
4056 | primary
4057 ;
4058
4059ternary : arg '?' arg '\n'? ':' arg
4060 {
4061 value_expr(p, $1);
4062 $$ = new_if(p, $1, $3, $6, &@$, &NULL_LOC, &@5, &NULL_LOC);
4063 fixpos($$, $1);
4064 /*% ripper: ifop!($:1, $:3, $:6) %*/
4065 }
4066 ;
4067
4068endless_arg : arg %prec modifier_rescue
4069 | endless_arg modifier_rescue after_rescue arg
4070 {
4071 p->ctxt.in_rescue = $3.in_rescue;
4072 $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4);
4073 /*% ripper: rescue_mod!($:1, $:4) %*/
4074 }
4075 | keyword_not '\n'? endless_arg
4076 {
4077 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
4078 /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/
4079 }
4080 ;
4081
4082relop : '>' {$$ = '>';}
4083 | '<' {$$ = '<';}
4084 | tGEQ {$$ = idGE;}
4085 | tLEQ {$$ = idLE;}
4086 ;
4087
4088rel_expr : arg relop arg %prec '>'
4089 {
4090 $$ = call_bin_op(p, $1, $2, $3, &@2, &@$);
4091 /*% ripper: binary!($:1, ID2VAL($2), $:3) %*/
4092 }
4093 | rel_expr relop arg %prec '>'
4094 {
4095 rb_warning1("comparison '%s' after comparison", WARN_ID($2));
4096 $$ = call_bin_op(p, $1, $2, $3, &@2, &@$);
4097 /*% ripper: binary!($:1, ID2VAL($2), $:3) %*/
4098 }
4099 ;
4100
4101lex_ctxt : none
4102 {
4103 $$ = p->ctxt;
4104 }
4105 ;
4106
4107begin_defined : lex_ctxt
4108 {
4109 p->ctxt.in_defined = 1;
4110 $$ = $1;
4111 }
4112 ;
4113
4114after_rescue : lex_ctxt
4115 {
4116 p->ctxt.in_rescue = after_rescue;
4117 $$ = $1;
4118 }
4119 ;
4120
4121arg_value : value_expr(arg)
4122 ;
4123
4124aref_args : none
4125 | args trailer
4126 | args ',' assocs trailer
4127 {
4128 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
4129 /*% ripper: args_add!($:1, bare_assoc_hash!($:3)) %*/
4130 }
4131 | assocs trailer
4132 {
4133 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@$) : 0;
4134 /*% ripper: args_add!(args_new!, bare_assoc_hash!($:1)) %*/
4135 }
4136 ;
4137
4138arg_rhs : arg %prec tOP_ASGN
4139 {
4140 value_expr(p, $1);
4141 $$ = $1;
4142 }
4143 | arg modifier_rescue after_rescue arg
4144 {
4145 p->ctxt.in_rescue = $3.in_rescue;
4146 value_expr(p, $1);
4147 $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4);
4148 /*% ripper: rescue_mod!($:1, $:4) %*/
4149 }
4150 ;
4151
4152paren_args : '(' opt_call_args rparen
4153 {
4154 $$ = $2;
4155 /*% ripper: arg_paren!($:2) %*/
4156 }
4157 | '(' args ',' args_forward rparen
4158 {
4159 if (!check_forwarding_args(p)) {
4160 $$ = 0;
4161 }
4162 else {
4163 $$ = new_args_forward_call(p, $2, &@4, &@$);
4164 /*% ripper: arg_paren!(args_add!($:2, $:4)) %*/
4165 }
4166 }
4167 | '(' args_forward rparen
4168 {
4169 if (!check_forwarding_args(p)) {
4170 $$ = 0;
4171 }
4172 else {
4173 $$ = new_args_forward_call(p, 0, &@2, &@$);
4174 /*% ripper: arg_paren!($:2) %*/
4175 }
4176 }
4177 ;
4178
4179opt_paren_args : none
4180 | paren_args
4181 {
4182 $$ = $1 ? $1 : NODE_SPECIAL_EMPTY_ARGS;
4183 }
4184 ;
4185
4186opt_call_args : none
4187 | call_args
4188 | args ','
4189 | args ',' assocs ','
4190 {
4191 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
4192 /*% ripper: args_add!($:1, bare_assoc_hash!($:3)) %*/
4193 }
4194 | assocs ','
4195 {
4196 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0;
4197 /*% ripper: args_add!(args_new!, bare_assoc_hash!($:1)) %*/
4198 }
4199 ;
4200
4201call_args : value_expr(command)
4202 {
4203 $$ = NEW_LIST($1, &@$);
4204 /*% ripper: args_add!(args_new!, $:1) %*/
4205 }
4206 | def_endless_method(endless_command)
4207 {
4208 $$ = NEW_LIST($1, &@$);
4209 /*% ripper: args_add!(args_new!, $:1) %*/
4210 }
4211 | args opt_block_arg
4212 {
4213 $$ = arg_blk_pass($1, $2);
4214 /*% ripper: args_add_block!($:1, $:2) %*/
4215 }
4216 | assocs opt_block_arg
4217 {
4218 $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0;
4219 $$ = arg_blk_pass($$, $2);
4220 /*% ripper: args_add_block!(args_add!(args_new!, bare_assoc_hash!($:1)), $:2) %*/
4221 }
4222 | args ',' assocs opt_block_arg
4223 {
4224 $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1;
4225 $$ = arg_blk_pass($$, $4);
4226 /*% ripper: args_add_block!(args_add!($:1, bare_assoc_hash!($:3)), $:4) %*/
4227 }
4228 | block_arg
4229 /*% ripper: args_add_block!(args_new!, $:1) %*/
4230 ;
4231
4232command_args : {
4233 /* If call_args starts with a open paren '(' or '[',
4234 * look-ahead reading of the letters calls CMDARG_PUSH(0),
4235 * but the push must be done after CMDARG_PUSH(1).
4236 * So this code makes them consistent by first cancelling
4237 * the premature CMDARG_PUSH(0), doing CMDARG_PUSH(1),
4238 * and finally redoing CMDARG_PUSH(0).
4239 */
4240 int lookahead = 0;
4241 switch (yychar) {
4242 case '(': case tLPAREN: case tLPAREN_ARG: case '[': case tLBRACK:
4243 lookahead = 1;
4244 }
4245 if (lookahead) CMDARG_POP();
4246 CMDARG_PUSH(1);
4247 if (lookahead) CMDARG_PUSH(0);
4248 }
4249 call_args
4250 {
4251 /* call_args can be followed by tLBRACE_ARG (that does CMDARG_PUSH(0) in the lexer)
4252 * but the push must be done after CMDARG_POP() in the parser.
4253 * So this code does CMDARG_POP() to pop 0 pushed by tLBRACE_ARG,
4254 * CMDARG_POP() to pop 1 pushed by command_args,
4255 * and CMDARG_PUSH(0) to restore back the flag set by tLBRACE_ARG.
4256 */
4257 int lookahead = 0;
4258 switch (yychar) {
4259 case tLBRACE_ARG:
4260 lookahead = 1;
4261 }
4262 if (lookahead) CMDARG_POP();
4263 CMDARG_POP();
4264 if (lookahead) CMDARG_PUSH(0);
4265 $$ = $2;
4266 /*% ripper: $:2 %*/
4267 }
4268 ;
4269
4270block_arg : tAMPER arg_value
4271 {
4272 $$ = NEW_BLOCK_PASS($2, &@$, &@1);
4273 /*% ripper: $:2 %*/
4274 }
4275 | tAMPER
4276 {
4277 forwarding_arg_check(p, idFWD_BLOCK, idFWD_ALL, "block");
4278 $$ = NEW_BLOCK_PASS(NEW_LVAR(idFWD_BLOCK, &@1), &@$, &@1);
4279 /*% ripper: Qnil %*/
4280 }
4281 ;
4282
4283opt_block_arg : ',' block_arg
4284 {
4285 $$ = $2;
4286 /*% ripper: $:2 %*/
4287 }
4288 | none
4289 {
4290 $$ = 0;
4291 /*% ripper: Qfalse %*/
4292 }
4293 ;
4294
4295/* value */
4296args : arg_value
4297 {
4298 $$ = NEW_LIST($arg_value, &@$);
4299 /*% ripper: args_add!(args_new!, $:arg_value) %*/
4300 }
4301 | arg_splat
4302 {
4303 $$ = $arg_splat;
4304 /*% ripper: args_add_star!(args_new!, $:arg_splat) %*/
4305 }
4306 | args[non_last_args] ',' arg_value
4307 {
4308 $$ = last_arg_append(p, $non_last_args, $arg_value, &@$);
4309 /*% ripper: args_add!($:non_last_args, $:arg_value) %*/
4310 }
4311 | args[non_last_args] ',' arg_splat
4312 {
4313 $$ = rest_arg_append(p, $non_last_args, RNODE_SPLAT($arg_splat)->nd_head, &@$);
4314 /*% ripper: args_add_star!($:non_last_args, $:arg_splat) %*/
4315 }
4316 ;
4317
4318/* value */
4319arg_splat : tSTAR arg_value
4320 {
4321 $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR);
4322 /*% ripper: $:arg_value %*/
4323 }
4324 | tSTAR /* none */
4325 {
4326 forwarding_arg_check(p, idFWD_REST, idFWD_ALL, "rest");
4327 $$ = NEW_SPLAT(NEW_LVAR(idFWD_REST, &@tSTAR), &@$, &@tSTAR);
4328 /*% ripper: Qnil %*/
4329 }
4330 ;
4331
4332/* value */
4333mrhs_arg : mrhs
4334 | arg_value
4335 ;
4336
4337/* value */
4338mrhs : args ',' arg_value
4339 {
4340 $$ = last_arg_append(p, $args, $arg_value, &@$);
4341 /*% ripper: mrhs_add!(mrhs_new_from_args!($:args), $:arg_value) %*/
4342 }
4343 | args ',' tSTAR arg_value
4344 {
4345 $$ = rest_arg_append(p, $args, $arg_value, &@$);
4346 /*% ripper: mrhs_add_star!(mrhs_new_from_args!($:args), $:arg_value) %*/
4347 }
4348 | tSTAR arg_value
4349 {
4350 $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR);
4351 /*% ripper: mrhs_add_star!(mrhs_new!, $:arg_value) %*/
4352 }
4353 ;
4354
4355%rule %inline inline_primary
4356 : literal
4357 | strings
4358 | xstring
4359 | regexp
4360 | words
4361 | qwords
4362 | symbols
4363 | qsymbols
4364 ;
4365
4366primary : inline_primary
4367 | var_ref
4368 | backref
4369 | tFID
4370 {
4371 $$ = (NODE *)NEW_FCALL($1, 0, &@$);
4372 /*% ripper: method_add_arg!(fcall!($:1), args_new!) %*/
4373 }
4374 | k_begin
4375 {
4376 CMDARG_PUSH(0);
4377 }
4378 bodystmt
4379 k_end
4380 {
4381 CMDARG_POP();
4382 set_line_body($3, @1.end_pos.lineno);
4383 $$ = NEW_BEGIN($3, &@$);
4384 nd_set_line($$, @1.end_pos.lineno);
4385 /*% ripper: begin!($:3) %*/
4386 }
4387 | tLPAREN_ARG compstmt(stmts) {SET_LEX_STATE(EXPR_ENDARG);} ')'
4388 {
4389 if (nd_type_p($2, NODE_SELF)) RNODE_SELF($2)->nd_state = 0;
4390 $$ = $2;
4391 /*% ripper: paren!($:2) %*/
4392 }
4393 | tLPAREN compstmt(stmts) ')'
4394 {
4395 if (nd_type_p($2, NODE_SELF)) RNODE_SELF($2)->nd_state = 0;
4396 $$ = NEW_BLOCK($2, &@$);
4397 /*% ripper: paren!($:2) %*/
4398 }
4399 | primary_value tCOLON2 tCONSTANT
4400 {
4401 $$ = NEW_COLON2($1, $3, &@$, &@2, &@3);
4402 /*% ripper: const_path_ref!($:1, $:3) %*/
4403 }
4404 | tCOLON3 tCONSTANT
4405 {
4406 $$ = NEW_COLON3($2, &@$, &@1, &@2);
4407 /*% ripper: top_const_ref!($:2) %*/
4408 }
4409 | tLBRACK aref_args ']'
4410 {
4411 $$ = make_list($2, &@$);
4412 /*% ripper: array!($:2) %*/
4413 }
4414 | tLBRACE assoc_list '}'
4415 {
4416 $$ = new_hash(p, $2, &@$);
4417 RNODE_HASH($$)->nd_brace = TRUE;
4418 /*% ripper: hash!($:2) %*/
4419 }
4420 | k_return
4421 {
4422 $$ = NEW_RETURN(0, &@$, &@1);
4423 /*% ripper: return0! %*/
4424 }
4425 | k_yield '(' call_args rparen
4426 {
4427 $$ = NEW_YIELD($3, &@$, &@1, &@2, &@4);
4428 /*% ripper: yield!(paren!($:3)) %*/
4429 }
4430 | k_yield '(' rparen
4431 {
4432 $$ = NEW_YIELD(0, &@$, &@1, &@2, &@3);
4433 /*% ripper: yield!(paren!(args_new!)) %*/
4434 }
4435 | k_yield
4436 {
4437 $$ = NEW_YIELD(0, &@$, &@1, &NULL_LOC, &NULL_LOC);
4438 /*% ripper: yield0! %*/
4439 }
4440 | keyword_defined '\n'? '(' begin_defined expr rparen
4441 {
4442 p->ctxt.in_defined = $4.in_defined;
4443 $$ = new_defined(p, $5, &@$, &@1);
4444 p->ctxt.has_trailing_semicolon = $4.has_trailing_semicolon;
4445 /*% ripper: defined!($:5) %*/
4446 }
4447 | keyword_not '(' expr rparen
4448 {
4449 $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$);
4450 /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/
4451 }
4452 | keyword_not '(' rparen
4453 {
4454 $$ = call_uni_op(p, method_cond(p, NEW_NIL(&@2), &@2), METHOD_NOT, &@1, &@$);
4455 /*% ripper: unary!(ID2VAL(idNOT), Qnil) %*/
4456 }
4457 | fcall brace_block
4458 {
4459 $$ = method_add_block(p, (NODE *)$1, $2, &@$);
4460 /*% ripper: method_add_block!(method_add_arg!(fcall!($:1), args_new!), $:2) %*/
4461 }
4462 | method_call
4463 | method_call brace_block
4464 {
4465 block_dup_check(p, get_nd_args(p, $1), $2);
4466 $$ = method_add_block(p, $1, $2, &@$);
4467 /*% ripper: method_add_block!($:1, $:2) %*/
4468 }
4469 | lambda
4470 | k_if expr_value then
4471 compstmt(stmts)
4472 if_tail
4473 k_end
4474 {
4475 if ($5 && nd_type_p($5, NODE_IF))
4476 RNODE_IF($5)->end_keyword_loc = @6;
4477
4478 $$ = new_if(p, $2, $4, $5, &@$, &@1, &@3, &@6);
4479 fixpos($$, $2);
4480 /*% ripper: if!($:2, $:4, $:5) %*/
4481 }
4482 | k_unless expr_value then
4483 compstmt(stmts)
4484 opt_else
4485 k_end
4486 {
4487 $$ = new_unless(p, $2, $4, $5, &@$, &@1, &@3, &@6);
4488 fixpos($$, $2);
4489 /*% ripper: unless!($:2, $:4, $:5) %*/
4490 }
4491 | k_while expr_value_do
4492 compstmt(stmts)
4493 k_end
4494 {
4495 restore_block_exit(p, $1);
4496 $$ = NEW_WHILE(cond(p, $2, &@2), $3, 1, &@$, &@1, &@4);
4497 fixpos($$, $2);
4498 /*% ripper: while!($:2, $:3) %*/
4499 }
4500 | k_until expr_value_do
4501 compstmt(stmts)
4502 k_end
4503 {
4504 restore_block_exit(p, $1);
4505 $$ = NEW_UNTIL(cond(p, $2, &@2), $3, 1, &@$, &@1, &@4);
4506 fixpos($$, $2);
4507 /*% ripper: until!($:2, $:3) %*/
4508 }
4509 | k_case expr_value terms?
4510 {
4511 $$ = p->case_labels;
4512 p->case_labels = CHECK_LITERAL_WHEN;
4513 }<labels>
4514 case_body
4515 k_end
4516 {
4517 if (CASE_LABELS_ENABLED_P(p->case_labels)) st_free_table(p->case_labels);
4518 p->case_labels = $4;
4519 $$ = NEW_CASE($2, $5, &@$, &@1, &@6);
4520 fixpos($$, $2);
4521 /*% ripper: case!($:2, $:5) %*/
4522 }
4523 | k_case terms?
4524 {
4525 $$ = p->case_labels;
4526 p->case_labels = 0;
4527 }<labels>
4528 case_body
4529 k_end
4530 {
4531 if (p->case_labels) st_free_table(p->case_labels);
4532 p->case_labels = $3;
4533 $$ = NEW_CASE2($4, &@$, &@1, &@5);
4534 /*% ripper: case!(Qnil, $:4) %*/
4535 }
4536 | k_case expr_value terms?
4537 p_case_body
4538 k_end
4539 {
4540 $$ = NEW_CASE3($2, $4, &@$, &@1, &@5);
4541 /*% ripper: case!($:2, $:4) %*/
4542 }
4543 | k_for for_var keyword_in
4544 {COND_PUSH(1);} expr_value do {COND_POP();}
4545 compstmt(stmts)
4546 k_end
4547 {
4548 restore_block_exit(p, $k_for);
4549 /*
4550 * for a, b, c in e
4551 * #=>
4552 * e.each{|*x| a, b, c = x}
4553 *
4554 * for a in e
4555 * #=>
4556 * e.each{|x| a, = x}
4557 */
4558 ID id = internal_id(p);
4559 rb_node_args_aux_t *m = NEW_ARGS_AUX(0, 0, &NULL_LOC);
4560 rb_node_args_t *args;
4561 NODE *scope, *internal_var = NEW_DVAR(id, &@for_var);
4562 rb_ast_id_table_t *tbl = rb_ast_new_local_table(p->ast, 1);
4563 tbl->ids[0] = id; /* internal id */
4564
4565 switch (nd_type($for_var)) {
4566 case NODE_LASGN:
4567 case NODE_DASGN: /* e.each {|internal_var| a = internal_var; ... } */
4568 set_nd_value(p, $for_var, internal_var);
4569 id = 0;
4570 m->nd_plen = 1;
4571 m->nd_next = $for_var;
4572 break;
4573 case NODE_MASGN: /* e.each {|*internal_var| a, b, c = (internal_var.length == 1 && Array === (tmp = internal_var[0]) ? tmp : internal_var); ... } */
4574 m->nd_next = node_assign(p, $for_var, NEW_FOR_MASGN(internal_var, &@for_var), NO_LEX_CTXT, &@for_var);
4575 break;
4576 default: /* e.each {|*internal_var| @a, B, c[1], d.attr = internal_val; ... } */
4577 m->nd_next = node_assign(p, (NODE *)NEW_MASGN(NEW_LIST($for_var, &@for_var), 0, &@for_var), internal_var, NO_LEX_CTXT, &@for_var);
4578 }
4579 /* {|*internal_id| <m> = internal_id; ... } */
4580 args = new_args(p, m, 0, id, 0, new_args_tail(p, 0, 0, 0, &@for_var), &@for_var);
4581 scope = NEW_SCOPE2(tbl, args, $compstmt, NULL, &@$);
4582 YYLTYPE do_keyword_loc = $do == keyword_do_cond ? @do : NULL_LOC;
4583 $$ = NEW_FOR($5, scope, &@$, &@k_for, &@keyword_in, &do_keyword_loc, &@k_end);
4584 RNODE_SCOPE(scope)->nd_parent = $$;
4585 fixpos($$, $for_var);
4586 /*% ripper: for!($:for_var, $:expr_value, $:compstmt) %*/
4587 }
4588 | k_class cpath superclass
4589 {
4590 begin_definition("class", &@k_class, &@cpath);
4591 }
4592 bodystmt
4593 k_end
4594 {
4595 YYLTYPE inheritance_operator_loc = NULL_LOC;
4596 if ($superclass) {
4597 inheritance_operator_loc = @superclass;
4598 inheritance_operator_loc.end_pos.column = inheritance_operator_loc.beg_pos.column + 1;
4599 }
4600 $$ = NEW_CLASS($cpath, $bodystmt, $superclass, &@$, &@k_class, &inheritance_operator_loc, &@k_end);
4601 nd_set_line(RNODE_CLASS($$)->nd_body, @k_end.end_pos.lineno);
4602 set_line_body($bodystmt, @superclass.end_pos.lineno);
4603 nd_set_line($$, @superclass.end_pos.lineno);
4604 /*% ripper: class!($:cpath, $:superclass, $:bodystmt) %*/
4605 local_pop(p);
4606 p->ctxt.in_class = $k_class.in_class;
4607 p->ctxt.cant_return = $k_class.cant_return;
4608 p->ctxt.shareable_constant_value = $k_class.shareable_constant_value;
4609 }
4610 | k_class tLSHFT expr_value
4611 {
4612 begin_definition("", &@k_class, &@tLSHFT);
4613 }
4614 term
4615 bodystmt
4616 k_end
4617 {
4618 $$ = NEW_SCLASS($expr_value, $bodystmt, &@$, &@k_class, &@tLSHFT, &@k_end);
4619 nd_set_line(RNODE_SCLASS($$)->nd_body, @k_end.end_pos.lineno);
4620 set_line_body($bodystmt, nd_line($expr_value));
4621 fixpos($$, $expr_value);
4622 /*% ripper: sclass!($:expr_value, $:bodystmt) %*/
4623 local_pop(p);
4624 p->ctxt.in_def = $k_class.in_def;
4625 p->ctxt.in_class = $k_class.in_class;
4626 p->ctxt.cant_return = $k_class.cant_return;
4627 p->ctxt.shareable_constant_value = $k_class.shareable_constant_value;
4628 }
4629 | k_module cpath
4630 {
4631 begin_definition("module", &@k_module, &@cpath);
4632 }
4633 bodystmt
4634 k_end
4635 {
4636 $$ = NEW_MODULE($cpath, $bodystmt, &@$, &@k_module, &@k_end);
4637 nd_set_line(RNODE_MODULE($$)->nd_body, @k_end.end_pos.lineno);
4638 set_line_body($bodystmt, @cpath.end_pos.lineno);
4639 nd_set_line($$, @cpath.end_pos.lineno);
4640 /*% ripper: module!($:cpath, $:bodystmt) %*/
4641 local_pop(p);
4642 p->ctxt.in_class = $k_module.in_class;
4643 p->ctxt.cant_return = $k_module.cant_return;
4644 p->ctxt.shareable_constant_value = $k_module.shareable_constant_value;
4645 }
4646 | defn_head[head]
4647 f_arglist[args]
4648 {
4649 push_end_expect_token_locations(p, &@head.beg_pos);
4650 }
4651 bodystmt
4652 k_end
4653 {
4654 restore_defun(p, $head);
4655 ($$ = $head->nd_def)->nd_loc = @$;
4656 $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$);
4657 RNODE_DEFN($$)->nd_defn = $bodystmt;
4658 /*% ripper: def!($:head, $:args, $:bodystmt) %*/
4659 local_pop(p);
4660 }
4661 | defs_head[head]
4662 f_arglist[args]
4663 {
4664 push_end_expect_token_locations(p, &@head.beg_pos);
4665 }
4666 bodystmt
4667 k_end
4668 {
4669 restore_defun(p, $head);
4670 ($$ = $head->nd_def)->nd_loc = @$;
4671 $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$);
4672 RNODE_DEFS($$)->nd_defn = $bodystmt;
4673 /*% ripper: defs!(*$:head[0..2], $:args, $:bodystmt) %*/
4674 local_pop(p);
4675 }
4676 | keyword_break
4677 {
4678 $$ = add_block_exit(p, NEW_BREAK(0, &@$, &@1));
4679 /*% ripper: break!(args_new!) %*/
4680 }
4681 | keyword_next
4682 {
4683 $$ = add_block_exit(p, NEW_NEXT(0, &@$, &@1));
4684 /*% ripper: next!(args_new!) %*/
4685 }
4686 | keyword_redo
4687 {
4688 $$ = add_block_exit(p, NEW_REDO(&@$, &@1));
4689 /*% ripper: redo! %*/
4690 }
4691 | keyword_retry
4692 {
4693 if (!p->ctxt.in_defined) {
4694 switch (p->ctxt.in_rescue) {
4695 case before_rescue: yyerror1(&@1, "Invalid retry without rescue"); break;
4696 case after_rescue: /* ok */ break;
4697 case after_else: yyerror1(&@1, "Invalid retry after else"); break;
4698 case after_ensure: yyerror1(&@1, "Invalid retry after ensure"); break;
4699 }
4700 }
4701 $$ = NEW_RETRY(&@$);
4702 /*% ripper: retry! %*/
4703 }
4704 ;
4705
4706primary_value : value_expr(primary)
4707 ;
4708
4709k_begin : keyword_begin
4710 {
4711 token_info_push(p, "begin", &@$);
4712 push_end_expect_token_locations(p, &@1.beg_pos);
4713 }
4714 ;
4715
4716k_if : keyword_if
4717 {
4718 WARN_EOL("if");
4719 token_info_push(p, "if", &@$);
4720 if (p->token_info && p->token_info->nonspc &&
4721 p->token_info->next && !strcmp(p->token_info->next->token, "else")) {
4722 const char *tok = p->lex.ptok - rb_strlen_lit("if");
4723 const char *beg = p->lex.pbeg + p->token_info->next->beg.column;
4724 beg += rb_strlen_lit("else");
4725 while (beg < tok && ISSPACE(*beg)) beg++;
4726 if (beg == tok) {
4727 p->token_info->nonspc = 0;
4728 }
4729 }
4730 push_end_expect_token_locations(p, &@1.beg_pos);
4731 }
4732 ;
4733
4734k_unless : keyword_unless
4735 {
4736 token_info_push(p, "unless", &@$);
4737 push_end_expect_token_locations(p, &@1.beg_pos);
4738 }
4739 ;
4740
4741k_while : keyword_while allow_exits
4742 {
4743 $$ = $allow_exits;
4744 token_info_push(p, "while", &@$);
4745 push_end_expect_token_locations(p, &@1.beg_pos);
4746 }
4747 ;
4748
4749k_until : keyword_until allow_exits
4750 {
4751 $$ = $allow_exits;
4752 token_info_push(p, "until", &@$);
4753 push_end_expect_token_locations(p, &@1.beg_pos);
4754 }
4755 ;
4756
4757k_case : keyword_case
4758 {
4759 token_info_push(p, "case", &@$);
4760 push_end_expect_token_locations(p, &@1.beg_pos);
4761 }
4762 ;
4763
4764k_for : keyword_for allow_exits
4765 {
4766 $$ = $allow_exits;
4767 token_info_push(p, "for", &@$);
4768 push_end_expect_token_locations(p, &@1.beg_pos);
4769 }
4770 ;
4771
4772k_class : keyword_class
4773 {
4774 token_info_push(p, "class", &@$);
4775 $$ = p->ctxt;
4776 p->ctxt.in_rescue = before_rescue;
4777 push_end_expect_token_locations(p, &@1.beg_pos);
4778 }
4779 ;
4780
4781k_module : keyword_module
4782 {
4783 token_info_push(p, "module", &@$);
4784 $$ = p->ctxt;
4785 p->ctxt.in_rescue = before_rescue;
4786 push_end_expect_token_locations(p, &@1.beg_pos);
4787 }
4788 ;
4789
4790k_def : keyword_def
4791 {
4792 token_info_push(p, "def", &@$);
4793 $$ = NEW_DEF_TEMP(&@$);
4794 p->ctxt.in_argdef = 1;
4795 }
4796 ;
4797
4798k_do : keyword_do
4799 {
4800 token_info_push(p, "do", &@$);
4801 push_end_expect_token_locations(p, &@1.beg_pos);
4802 }
4803 ;
4804
4805k_do_block : keyword_do_block
4806 {
4807 token_info_push(p, "do", &@$);
4808 push_end_expect_token_locations(p, &@1.beg_pos);
4809 }
4810 ;
4811
4812k_rescue : keyword_rescue
4813 {
4814 token_info_warn(p, "rescue", p->token_info, 1, &@$);
4815 $$ = p->ctxt;
4816 p->ctxt.in_rescue = after_rescue;
4817 }
4818 ;
4819
4820k_ensure : keyword_ensure
4821 {
4822 token_info_warn(p, "ensure", p->token_info, 1, &@$);
4823 $$ = p->ctxt;
4824 }
4825 ;
4826
4827k_when : keyword_when
4828 {
4829 token_info_warn(p, "when", p->token_info, 0, &@$);
4830 }
4831 ;
4832
4833k_else : keyword_else
4834 {
4835 token_info *ptinfo_beg = p->token_info;
4836 int same = ptinfo_beg && strcmp(ptinfo_beg->token, "case") != 0;
4837 token_info_warn(p, "else", p->token_info, same, &@$);
4838 if (same) {
4839 token_info e;
4840 e.next = ptinfo_beg->next;
4841 e.token = "else";
4842 token_info_setup(&e, p->lex.pbeg, &@$);
4843 if (!e.nonspc) *ptinfo_beg = e;
4844 }
4845 }
4846 ;
4847
4848k_elsif : keyword_elsif
4849 {
4850 WARN_EOL("elsif");
4851 token_info_warn(p, "elsif", p->token_info, 1, &@$);
4852 }
4853 ;
4854
4855k_end : keyword_end
4856 {
4857 token_info_pop(p, "end", &@$);
4858 pop_end_expect_token_locations(p);
4859 }
4860 | tDUMNY_END
4861 {
4862 compile_error(p, "syntax error, unexpected end-of-input");
4863 }
4864 ;
4865
4866k_return : keyword_return
4867 {
4868 if (p->ctxt.cant_return && !dyna_in_block(p))
4869 yyerror1(&@1, "Invalid return in class/module body");
4870 }
4871 ;
4872
4873k_yield : keyword_yield
4874 {
4875 if (!p->ctxt.in_defined && !p->ctxt.in_def && !compile_for_eval)
4876 yyerror1(&@1, "Invalid yield");
4877 }
4878 ;
4879
4880then : term
4881 | keyword_then
4882 | term keyword_then
4883 ;
4884
4885do : term
4886 | keyword_do_cond { $$ = keyword_do_cond; }
4887 ;
4888
4889if_tail : opt_else
4890 | k_elsif expr_value then
4891 compstmt(stmts)
4892 if_tail
4893 {
4894 $$ = new_if(p, $2, $4, $5, &@$, &@1, &@3, &NULL_LOC);
4895 fixpos($$, $2);
4896 /*% ripper: elsif!($:2, $:4, $:5) %*/
4897 }
4898 ;
4899
4900opt_else : none
4901 | k_else compstmt(stmts)
4902 {
4903 $$ = $2;
4904 /*% ripper: else!($:2) %*/
4905 }
4906 ;
4907
4908for_var : lhs
4909 | mlhs
4910 ;
4911
4912f_marg : f_norm_arg
4913 {
4914 $$ = assignable(p, $1, 0, &@$);
4915 mark_lvar_used(p, $$);
4916 }
4917 | tLPAREN f_margs rparen
4918 {
4919 $$ = (NODE *)$2;
4920 /*% ripper: mlhs_paren!($:2) %*/
4921 }
4922 ;
4923
4924
4925f_margs : mlhs_items(f_marg)
4926 {
4927 $$ = NEW_MASGN($1, 0, &@$);
4928 /*% ripper: $:1 %*/
4929 }
4930 | mlhs_items(f_marg) ',' f_rest_marg
4931 {
4932 $$ = NEW_MASGN($1, $3, &@$);
4933 /*% ripper: mlhs_add_star!($:1, $:3) %*/
4934 }
4935 | mlhs_items(f_marg) ',' f_rest_marg ',' mlhs_items(f_marg)
4936 {
4937 $$ = NEW_MASGN($1, NEW_POSTARG($3, $5, &@$), &@$);
4938 /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, $:3), $:5) %*/
4939 }
4940 | f_rest_marg
4941 {
4942 $$ = NEW_MASGN(0, $1, &@$);
4943 /*% ripper: mlhs_add_star!(mlhs_new!, $:1) %*/
4944 }
4945 | f_rest_marg ',' mlhs_items(f_marg)
4946 {
4947 $$ = NEW_MASGN(0, NEW_POSTARG($1, $3, &@$), &@$);
4948 /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $:1), $:3) %*/
4949 }
4950 ;
4951
4952f_rest_marg : tSTAR f_norm_arg
4953 {
4954 /*% ripper: $:2 %*/
4955 $$ = assignable(p, $2, 0, &@$);
4956 mark_lvar_used(p, $$);
4957 }
4958 | tSTAR
4959 {
4960 $$ = NODE_SPECIAL_NO_NAME_REST;
4961 /*% ripper: Qnil %*/
4962 }
4963 ;
4964
4965f_any_kwrest : f_kwrest
4966 | f_no_kwarg
4967 {
4968 $$ = idNil;
4969 /*% ripper: ID2VAL(idNil) %*/
4970 }
4971 ;
4972
4973f_eq : {p->ctxt.in_argdef = 0;} '=';
4974
4975block_args_tail : args_tail_basic(primary_value)
4976 ;
4977
4978excessed_comma : ','
4979 {
4980 /* magic number for rest_id in iseq_set_arguments() */
4981 $$ = NODE_SPECIAL_EXCESSIVE_COMMA;
4982 /*% ripper: excessed_comma! %*/
4983 }
4984 ;
4985
4986block_param : f_arg ',' f_opt_arg(primary_value) ',' f_rest_arg opt_args_tail(block_args_tail)
4987 {
4988 $$ = new_args(p, $1, $3, $5, 0, $6, &@$);
4989 /*% ripper: params!($:1, $:3, $:5, Qnil, *$:6[0..2]) %*/
4990 }
4991 | f_arg ',' f_opt_arg(primary_value) ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail)
4992 {
4993 $$ = new_args(p, $1, $3, $5, $7, $8, &@$);
4994 /*% ripper: params!($:1, $:3, $:5, $:7, *$:8[0..2]) %*/
4995 }
4996 | f_arg ',' f_opt_arg(primary_value) opt_args_tail(block_args_tail)
4997 {
4998 $$ = new_args(p, $1, $3, 0, 0, $4, &@$);
4999 /*% ripper: params!($:1, $:3, Qnil, Qnil, *$:4[0..2]) %*/
5000 }
5001 | f_arg ',' f_opt_arg(primary_value) ',' f_arg opt_args_tail(block_args_tail)
5002 {
5003 $$ = new_args(p, $1, $3, 0, $5, $6, &@$);
5004 /*% ripper: params!($:1, $:3, Qnil, $:5, *$:6[0..2]) %*/
5005 }
5006 | f_arg ',' f_rest_arg opt_args_tail(block_args_tail)
5007 {
5008 $$ = new_args(p, $1, 0, $3, 0, $4, &@$);
5009 /*% ripper: params!($:1, Qnil, $:3, Qnil, *$:4[0..2]) %*/
5010 }
5011 | f_arg excessed_comma
5012 {
5013 $$ = new_args_tail(p, 0, 0, 0, &@2);
5014 $$ = new_args(p, $1, 0, $2, 0, $$, &@$);
5015 /*% ripper: params!($:1, Qnil, $:2, Qnil, Qnil, Qnil, Qnil) %*/
5016 }
5017 | f_arg ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail)
5018 {
5019 $$ = new_args(p, $1, 0, $3, $5, $6, &@$);
5020 /*% ripper: params!($:1, Qnil, $:3, $:5, *$:6[0..2]) %*/
5021 }
5022 | f_arg opt_args_tail(block_args_tail)
5023 {
5024 $$ = new_args(p, $1, 0, 0, 0, $2, &@$);
5025 /*% ripper: params!($:1, Qnil, Qnil, Qnil, *$:2[0..2]) %*/
5026 }
5027 | f_opt_arg(primary_value) ',' f_rest_arg opt_args_tail(block_args_tail)
5028 {
5029 $$ = new_args(p, 0, $1, $3, 0, $4, &@$);
5030 /*% ripper: params!(Qnil, $:1, $:3, Qnil, *$:4[0..2]) %*/
5031 }
5032 | f_opt_arg(primary_value) ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail)
5033 {
5034 $$ = new_args(p, 0, $1, $3, $5, $6, &@$);
5035 /*% ripper: params!(Qnil, $:1, $:3, $:5, *$:6[0..2]) %*/
5036 }
5037 | f_opt_arg(primary_value) opt_args_tail(block_args_tail)
5038 {
5039 $$ = new_args(p, 0, $1, 0, 0, $2, &@$);
5040 /*% ripper: params!(Qnil, $:1, Qnil, Qnil, *$:2[0..2]) %*/
5041 }
5042 | f_opt_arg(primary_value) ',' f_arg opt_args_tail(block_args_tail)
5043 {
5044 $$ = new_args(p, 0, $1, 0, $3, $4, &@$);
5045 /*% ripper: params!(Qnil, $:1, Qnil, $:3, *$:4[0..2]) %*/
5046 }
5047 | f_rest_arg opt_args_tail(block_args_tail)
5048 {
5049 $$ = new_args(p, 0, 0, $1, 0, $2, &@$);
5050 /*% ripper: params!(Qnil, Qnil, $:1, Qnil, *$:2[0..2]) %*/
5051 }
5052 | f_rest_arg ',' f_arg opt_args_tail(block_args_tail)
5053 {
5054 $$ = new_args(p, 0, 0, $1, $3, $4, &@$);
5055 /*% ripper: params!(Qnil, Qnil, $:1, $:3, *$:4[0..2]) %*/
5056 }
5057 | block_args_tail
5058 {
5059 $$ = new_args(p, 0, 0, 0, 0, $1, &@$);
5060 /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, *$:1[0..2]) %*/
5061 }
5062 ;
5063
5064opt_block_param_def : none
5065 | block_param_def
5066 {
5067 p->command_start = TRUE;
5068 }
5069 ;
5070
5071block_param_def : '|' opt_block_param opt_bv_decl '|'
5072 {
5073 p->max_numparam = ORDINAL_PARAM;
5074 p->ctxt.in_argdef = 0;
5075 $$ = $2;
5076 /*% ripper: block_var!($:2, $:3) %*/
5077 }
5078 ;
5079
5080opt_block_param : /* none */
5081 {
5082 $$ = 0;
5083 /*% ripper: params!(Qnil,Qnil,Qnil,Qnil,Qnil,Qnil,Qnil) %*/
5084 }
5085 | block_param
5086 ;
5087
5088opt_bv_decl : '\n'?
5089 {
5090 $$ = 0;
5091 /*% ripper: Qfalse %*/
5092 }
5093 | '\n'? ';' bv_decls '\n'?
5094 {
5095 $$ = 0;
5096 /*% ripper: $:3 %*/
5097 }
5098 ;
5099
5100bv_decls : bvar
5101 /*% ripper[brace]: rb_ary_new3(1, $:1) %*/
5102 | bv_decls ',' bvar
5103 /*% ripper[brace]: rb_ary_push($:1, $:3) %*/
5104 ;
5105
5106bvar : tIDENTIFIER
5107 {
5108 new_bv(p, $1);
5109 /*% ripper: $:1 %*/
5110 }
5111 | f_bad_arg
5112 ;
5113
5114max_numparam : {
5115 $$ = p->max_numparam;
5116 p->max_numparam = 0;
5117 }
5118 ;
5119
5120numparam : {
5121 $$ = numparam_push(p);
5122 }
5123 ;
5124
5125it_id : {
5126 $$ = p->it_id;
5127 p->it_id = 0;
5128 }
5129 ;
5130
5131lambda : tLAMBDA[lpar]
5132 {
5133 token_info_push(p, "->", &@1);
5134 $$ = dyna_push(p);
5135 }[dyna]<vars>
5136 max_numparam numparam it_id allow_exits
5137 f_larglist[args]
5138 {
5139 CMDARG_PUSH(0);
5140 }
5141 lambda_body[body]
5142 {
5143 int max_numparam = p->max_numparam;
5144 ID it_id = p->it_id;
5145 p->lex.lpar_beg = $lpar;
5146 p->max_numparam = $max_numparam;
5147 p->it_id = $it_id;
5148 restore_block_exit(p, $allow_exits);
5149 CMDARG_POP();
5150 $args = args_with_numbered(p, $args, max_numparam, it_id);
5151 {
5152 YYLTYPE loc = code_loc_gen(&@args, &@body);
5153 $$ = NEW_LAMBDA($args, $body->node, &loc, &@lpar, &$body->opening_loc, &$body->closing_loc);
5154 nd_set_line(RNODE_LAMBDA($$)->nd_body, @body.end_pos.lineno);
5155 nd_set_line($$, @args.end_pos.lineno);
5156 nd_set_first_loc($$, @1.beg_pos);
5157 xfree($body);
5158 }
5159 /*% ripper: lambda!($:args, $:body) %*/
5160 numparam_pop(p, $numparam);
5161 dyna_pop(p, $dyna);
5162 }
5163 ;
5164
5165f_larglist : '(' f_args opt_bv_decl ')'
5166 {
5167 p->ctxt.in_argdef = 0;
5168 $$ = $f_args;
5169 p->max_numparam = ORDINAL_PARAM;
5170 /*% ripper: paren!($:2) %*/
5171 }
5172 | f_args
5173 {
5174 p->ctxt.in_argdef = 0;
5175 if (!args_info_empty_p(&$1->nd_ainfo))
5176 p->max_numparam = ORDINAL_PARAM;
5177 $$ = $f_args;
5178 }
5179 ;
5180
5181lambda_body : tLAMBEG compstmt(stmts) '}'
5182 {
5183 token_info_pop(p, "}", &@3);
5184 $$ = new_locations_lambda_body(p, $2, &@2, &@1, &@3);
5185 /*% ripper: $:2 %*/
5186 }
5187 | keyword_do_LAMBDA
5188 {
5189 push_end_expect_token_locations(p, &@1.beg_pos);
5190 }
5191 bodystmt k_end
5192 {
5193 $$ = new_locations_lambda_body(p, $3, &@3, &@1, &@4);
5194 /*% ripper: $:3 %*/
5195 }
5196 ;
5197
5198do_block : k_do_block do_body k_end
5199 {
5200 $$ = $2;
5201 set_embraced_location($$, &@1, &@3);
5202 /*% ripper: $:2 %*/
5203 }
5204 ;
5205
5206block_call : command do_block
5207 {
5208 if (nd_type_p($1, NODE_YIELD)) {
5209 compile_error(p, "block given to yield");
5210 }
5211 else {
5212 block_dup_check(p, get_nd_args(p, $1), $2);
5213 }
5214 $$ = method_add_block(p, $1, $2, &@$);
5215 fixpos($$, $1);
5216 /*% ripper: method_add_block!($:1, $:2) %*/
5217 }
5218 | block_call call_op2 operation2 opt_paren_args
5219 {
5220 bool has_args = $4 != 0;
5221 if (NODE_EMPTY_ARGS_P($4)) $4 = 0;
5222 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
5223 /*% ripper: call!($:1, $:2, $:3) %*/
5224 if (has_args) {
5225 /*% ripper: method_add_arg!($:$, $:4) %*/
5226 }
5227 }
5228 | block_call call_op2 operation2 opt_paren_args brace_block
5229 {
5230 if (NODE_EMPTY_ARGS_P($4)) $4 = 0;
5231 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
5232 /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/
5233 }
5234 | block_call call_op2 operation2 command_args do_block
5235 {
5236 $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$);
5237 /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/
5238 }
5239 | block_call call_op2 paren_args
5240 {
5241 $$ = new_qcall(p, $2, $1, idCall, $3, &@2, &@$);
5242 nd_set_line($$, @2.end_pos.lineno);
5243 /*% ripper: method_add_arg!(call!($:1, $:2, ID2VAL(idCall)), $:3) %*/
5244 }
5245 ;
5246
5247method_call : fcall paren_args
5248 {
5249 $1->nd_args = $2;
5250 $$ = (NODE *)$1;
5251 nd_set_last_loc($1, @2.end_pos);
5252 /*% ripper: method_add_arg!(fcall!($:1), $:2) %*/
5253 }
5254 | primary_value call_op operation2 opt_paren_args
5255 {
5256 bool has_args = $4 != 0;
5257 if (NODE_EMPTY_ARGS_P($4)) $4 = 0;
5258 $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$);
5259 nd_set_line($$, @3.end_pos.lineno);
5260 /*% ripper: call!($:1, $:2, $:3) %*/
5261 if (has_args) {
5262 /*% ripper: method_add_arg!($:$, $:4) %*/
5263 }
5264 }
5265 | primary_value tCOLON2 operation2 paren_args
5266 {
5267 $$ = new_qcall(p, idCOLON2, $1, $3, $4, &@3, &@$);
5268 nd_set_line($$, @3.end_pos.lineno);
5269 /*% ripper: method_add_arg!(call!($:1, $:2, $:3), $:4) %*/
5270 }
5271 | primary_value tCOLON2 operation3
5272 {
5273 $$ = new_qcall(p, idCOLON2, $1, $3, 0, &@3, &@$);
5274 /*% ripper: call!($:1, $:2, $:3) %*/
5275 }
5276 | primary_value call_op2 paren_args
5277 {
5278 $$ = new_qcall(p, $2, $1, idCall, $3, &@2, &@$);
5279 nd_set_line($$, @2.end_pos.lineno);
5280 /*% ripper: method_add_arg!(call!($:1, $:2, ID2VAL(idCall)), $:3) %*/
5281 }
5282 | keyword_super paren_args
5283 {
5284 rb_code_location_t lparen_loc = @2;
5285 rb_code_location_t rparen_loc = @2;
5286 lparen_loc.end_pos.column = lparen_loc.beg_pos.column + 1;
5287 rparen_loc.beg_pos.column = rparen_loc.end_pos.column - 1;
5288
5289 $$ = NEW_SUPER($2, &@$, &@1, &lparen_loc, &rparen_loc);
5290 /*% ripper: super!($:2) %*/
5291 }
5292 | keyword_super
5293 {
5294 $$ = NEW_ZSUPER(&@$);
5295 /*% ripper: zsuper! %*/
5296 }
5297 | primary_value '[' opt_call_args rbracket
5298 {
5299 $$ = NEW_CALL($1, tAREF, $3, &@$);
5300 fixpos($$, $1);
5301 /*% ripper: aref!($:1, $:3) %*/
5302 }
5303 ;
5304
5305brace_block : '{' brace_body '}'
5306 {
5307 $$ = $2;
5308 set_embraced_location($$, &@1, &@3);
5309 /*% ripper: $:2 %*/
5310 }
5311 | k_do do_body k_end
5312 {
5313 $$ = $2;
5314 set_embraced_location($$, &@1, &@3);
5315 /*% ripper: $:2 %*/
5316 }
5317 ;
5318
5319brace_body : {$$ = dyna_push(p);}[dyna]<vars>
5320 max_numparam numparam it_id allow_exits
5321 opt_block_param_def[args] compstmt(stmts)
5322 {
5323 int max_numparam = p->max_numparam;
5324 ID it_id = p->it_id;
5325 p->max_numparam = $max_numparam;
5326 p->it_id = $it_id;
5327 $args = args_with_numbered(p, $args, max_numparam, it_id);
5328 $$ = NEW_ITER($args, $compstmt, &@$);
5329 /*% ripper: brace_block!($:args, $:compstmt) %*/
5330 restore_block_exit(p, $allow_exits);
5331 numparam_pop(p, $numparam);
5332 dyna_pop(p, $dyna);
5333 }
5334 ;
5335
5336do_body : {
5337 $$ = dyna_push(p);
5338 CMDARG_PUSH(0);
5339 }[dyna]<vars>
5340 max_numparam numparam it_id allow_exits
5341 opt_block_param_def[args] bodystmt
5342 {
5343 int max_numparam = p->max_numparam;
5344 ID it_id = p->it_id;
5345 p->max_numparam = $max_numparam;
5346 p->it_id = $it_id;
5347 $args = args_with_numbered(p, $args, max_numparam, it_id);
5348 $$ = NEW_ITER($args, $bodystmt, &@$);
5349 /*% ripper: do_block!($:args, $:bodystmt) %*/
5350 CMDARG_POP();
5351 restore_block_exit(p, $allow_exits);
5352 numparam_pop(p, $numparam);
5353 dyna_pop(p, $dyna);
5354 }
5355 ;
5356
5357case_args : arg_value
5358 {
5359 check_literal_when(p, $arg_value, &@arg_value);
5360 $$ = NEW_LIST($arg_value, &@$);
5361 /*% ripper: args_add!(args_new!, $:arg_value) %*/
5362 }
5363 | tSTAR arg_value
5364 {
5365 $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR);
5366 /*% ripper: args_add_star!(args_new!, $:arg_value) %*/
5367 }
5368 | case_args[non_last_args] ',' arg_value
5369 {
5370 check_literal_when(p, $arg_value, &@arg_value);
5371 $$ = last_arg_append(p, $non_last_args, $arg_value, &@$);
5372 /*% ripper: args_add!($:non_last_args, $:arg_value) %*/
5373 }
5374 | case_args[non_last_args] ',' tSTAR arg_value
5375 {
5376 $$ = rest_arg_append(p, $non_last_args, $arg_value, &@$);
5377 /*% ripper: args_add_star!($:non_last_args, $:arg_value) %*/
5378 }
5379 ;
5380
5381case_body : k_when case_args then
5382 compstmt(stmts)
5383 cases
5384 {
5385 $$ = NEW_WHEN($2, $4, $5, &@$, &@1, &@3);
5386 fixpos($$, $2);
5387 /*% ripper: when!($:2, $:4, $:5) %*/
5388 }
5389 ;
5390
5391cases : opt_else
5392 | case_body
5393 ;
5394
5395p_pvtbl : {$$ = p->pvtbl; p->pvtbl = st_init_numtable();};
5396p_pktbl : {$$ = p->pktbl; p->pktbl = 0;};
5397
5398p_in_kwarg : {
5399 $$ = p->ctxt;
5400 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
5401 p->command_start = FALSE;
5402 p->ctxt.in_kwarg = 1;
5403 p->ctxt.in_alt_pattern = 0;
5404 p->ctxt.capture_in_pattern = 0;
5405 }
5406 ;
5407
5408p_case_body : keyword_in
5409 p_in_kwarg[ctxt] p_pvtbl p_pktbl
5410 p_top_expr[expr] then
5411 {
5412 pop_pktbl(p, $p_pktbl);
5413 pop_pvtbl(p, $p_pvtbl);
5414 p->ctxt.in_kwarg = $ctxt.in_kwarg;
5415 p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern;
5416 p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern;
5417 }
5418 compstmt(stmts)
5419 p_cases[cases]
5420 {
5421 $$ = NEW_IN($expr, $compstmt, $cases, &@$, &@keyword_in, &@then, &NULL_LOC);
5422 /*% ripper: in!($:expr, $:compstmt, $:cases) %*/
5423 }
5424 ;
5425
5426p_cases : opt_else
5427 | p_case_body
5428 ;
5429
5430p_top_expr : p_top_expr_body
5431 | p_top_expr_body modifier_if expr_value
5432 {
5433 $$ = new_if(p, $3, $1, 0, &@$, &@2, &NULL_LOC, &NULL_LOC);
5434 fixpos($$, $3);
5435 /*% ripper: if_mod!($:3, $:1) %*/
5436 }
5437 | p_top_expr_body modifier_unless expr_value
5438 {
5439 $$ = new_unless(p, $3, $1, 0, &@$, &@2, &NULL_LOC, &NULL_LOC);
5440 fixpos($$, $3);
5441 /*% ripper: unless_mod!($:3, $:1) %*/
5442 }
5443 ;
5444
5445p_top_expr_body : p_expr
5446 | p_expr ','
5447 {
5448 $$ = new_array_pattern_tail(p, 0, 1, 0, 0, &@$);
5449 $$ = new_array_pattern(p, 0, $1, $$, &@$);
5450 /*% ripper: aryptn!(Qnil, [$:1], Qnil, Qnil) %*/
5451 }
5452 | p_expr ',' p_args
5453 {
5454 $$ = new_array_pattern(p, 0, $1, $3, &@$);
5455 nd_set_first_loc($$, @1.beg_pos);
5456 /*% ripper: aryptn!(Qnil, aryptn_pre_args(p, $:1, $:3[0]), *$:3[1..2]) %*/
5457 }
5458 | p_find
5459 {
5460 $$ = new_find_pattern(p, 0, $1, &@$);
5461 /*% ripper: fndptn!(Qnil, *$:1[0..2]) %*/
5462 }
5463 | p_args_tail
5464 {
5465 $$ = new_array_pattern(p, 0, 0, $1, &@$);
5466 /*% ripper: aryptn!(Qnil, *$:1[0..2]) %*/
5467 }
5468 | p_kwargs
5469 {
5470 $$ = new_hash_pattern(p, 0, $1, &@$);
5471 /*% ripper: hshptn!(Qnil, *$:1[0..1]) %*/
5472 }
5473 ;
5474
5475p_expr : p_as
5476 ;
5477
5478p_as : p_expr tASSOC p_variable
5479 {
5480 NODE *n = NEW_LIST($1, &@$);
5481 n = list_append(p, n, $3);
5482 $$ = new_hash(p, n, &@$);
5483 /*% ripper: binary!($:1, ID2VAL((id_assoc)), $:3) %*/
5484 }
5485 | p_alt
5486 ;
5487
5488p_alt : p_alt[left] '|'[alt]
5489 {
5490 p->ctxt.in_alt_pattern = 1;
5491 }
5492 p_expr_basic[right]
5493 {
5494 if (p->ctxt.capture_in_pattern) {
5495 yyerror1(&@alt, "alternative pattern after variable capture");
5496 }
5497 p->ctxt.in_alt_pattern = 0;
5498 $$ = NEW_OR($left, $right, &@$, &@alt);
5499 /*% ripper: binary!($:left, ID2VAL(idOr), $:right) %*/
5500 }
5501 | p_expr_basic
5502 ;
5503
5504p_lparen : '(' p_pktbl
5505 {
5506 $$ = $2;
5507 /*% ripper: $:2 %*/
5508 }
5509 ;
5510
5511p_lbracket : '[' p_pktbl
5512 {
5513 $$ = $2;
5514 /*% ripper: $:2 %*/
5515 }
5516 ;
5517
5518p_expr_basic : p_value
5519 | p_variable
5520 | p_const p_lparen[p_pktbl] p_args rparen
5521 {
5522 pop_pktbl(p, $p_pktbl);
5523 $$ = new_array_pattern(p, $p_const, 0, $p_args, &@$);
5524 nd_set_first_loc($$, @p_const.beg_pos);
5525 /*% ripper: aryptn!($:p_const, *$:p_args[0..2]) %*/
5526 }
5527 | p_const p_lparen[p_pktbl] p_find rparen
5528 {
5529 pop_pktbl(p, $p_pktbl);
5530 $$ = new_find_pattern(p, $p_const, $p_find, &@$);
5531 nd_set_first_loc($$, @p_const.beg_pos);
5532 /*% ripper: fndptn!($:p_const, *$:p_find[0..2]) %*/
5533 }
5534 | p_const p_lparen[p_pktbl] p_kwargs rparen
5535 {
5536 pop_pktbl(p, $p_pktbl);
5537 $$ = new_hash_pattern(p, $p_const, $p_kwargs, &@$);
5538 nd_set_first_loc($$, @p_const.beg_pos);
5539 /*% ripper: hshptn!($:p_const, *$:p_kwargs[0..1]) %*/
5540 }
5541 | p_const '(' rparen
5542 {
5543 $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$);
5544 $$ = new_array_pattern(p, $p_const, 0, $$, &@$);
5545 /*% ripper: aryptn!($:p_const, Qnil, Qnil, Qnil) %*/
5546 }
5547 | p_const p_lbracket[p_pktbl] p_args rbracket
5548 {
5549 pop_pktbl(p, $p_pktbl);
5550 $$ = new_array_pattern(p, $p_const, 0, $p_args, &@$);
5551 nd_set_first_loc($$, @p_const.beg_pos);
5552 /*% ripper: aryptn!($:p_const, *$:p_args[0..2]) %*/
5553 }
5554 | p_const p_lbracket[p_pktbl] p_find rbracket
5555 {
5556 pop_pktbl(p, $p_pktbl);
5557 $$ = new_find_pattern(p, $p_const, $p_find, &@$);
5558 nd_set_first_loc($$, @p_const.beg_pos);
5559 /*% ripper: fndptn!($:p_const, *$:p_find[0..2]) %*/
5560 }
5561 | p_const p_lbracket[p_pktbl] p_kwargs rbracket
5562 {
5563 pop_pktbl(p, $p_pktbl);
5564 $$ = new_hash_pattern(p, $p_const, $p_kwargs, &@$);
5565 nd_set_first_loc($$, @p_const.beg_pos);
5566 /*% ripper: hshptn!($:p_const, *$:p_kwargs[0..1]) %*/
5567 }
5568 | p_const '[' rbracket
5569 {
5570 $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$);
5571 $$ = new_array_pattern(p, $1, 0, $$, &@$);
5572 /*% ripper: aryptn!($:1, Qnil, Qnil, Qnil) %*/
5573 }
5574 | tLBRACK p_args rbracket
5575 {
5576 $$ = new_array_pattern(p, 0, 0, $p_args, &@$);
5577 /*% ripper: aryptn!(Qnil, *$:p_args[0..2]) %*/
5578 }
5579 | tLBRACK p_find rbracket
5580 {
5581 $$ = new_find_pattern(p, 0, $p_find, &@$);
5582 /*% ripper: fndptn!(Qnil, *$:p_find[0..2]) %*/
5583 }
5584 | tLBRACK rbracket
5585 {
5586 $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$);
5587 $$ = new_array_pattern(p, 0, 0, $$, &@$);
5588 /*% ripper: aryptn!(Qnil, Qnil, Qnil, Qnil) %*/
5589 }
5590 | tLBRACE p_pktbl lex_ctxt[ctxt]
5591 {
5592 p->ctxt.in_kwarg = 0;
5593 }
5594 p_kwargs rbrace
5595 {
5596 pop_pktbl(p, $p_pktbl);
5597 p->ctxt.in_kwarg = $ctxt.in_kwarg;
5598 $$ = new_hash_pattern(p, 0, $p_kwargs, &@$);
5599 /*% ripper: hshptn!(Qnil, *$:p_kwargs[0..1]) %*/
5600 }
5601 | tLBRACE rbrace
5602 {
5603 $$ = new_hash_pattern_tail(p, 0, 0, &@$);
5604 $$ = new_hash_pattern(p, 0, $$, &@$);
5605 /*% ripper: hshptn!(Qnil, Qnil, Qnil) %*/
5606 }
5607 | tLPAREN p_pktbl p_expr rparen
5608 {
5609 pop_pktbl(p, $p_pktbl);
5610 $$ = $p_expr;
5611 /*% ripper: $:p_expr %*/
5612 }
5613 ;
5614
5615p_args : p_expr
5616 {
5617 NODE *pre_args = NEW_LIST($1, &@$);
5618 $$ = new_array_pattern_tail(p, pre_args, 0, 0, 0, &@$);
5619 /*% ripper: [[$:1], Qnil, Qnil] %*/
5620 }
5621 | p_args_head
5622 {
5623 $$ = new_array_pattern_tail(p, $1, 1, 0, 0, &@$);
5624 /*% ripper: [$:1, Qnil, Qnil] %*/
5625 }
5626 | p_args_head p_arg
5627 {
5628 $$ = new_array_pattern_tail(p, list_concat($1, $2), 0, 0, 0, &@$);
5629 /*% ripper: [rb_ary_concat($:1, $:2), Qnil, Qnil] %*/
5630 }
5631 | p_args_head p_rest
5632 {
5633 $$ = new_array_pattern_tail(p, $1, 1, $2, 0, &@$);
5634 /*% ripper: [$:1, $:2, Qnil] %*/
5635 }
5636 | p_args_head p_rest ',' p_args_post
5637 {
5638 $$ = new_array_pattern_tail(p, $1, 1, $2, $4, &@$);
5639 /*% ripper: [$:1, $:2, $:4] %*/
5640 }
5641 | p_args_tail
5642 ;
5643
5644p_args_head : p_arg ','
5645 | p_args_head p_arg ','
5646 {
5647 $$ = list_concat($1, $2);
5648 /*% ripper: rb_ary_concat($:1, $:2) %*/
5649 }
5650 ;
5651
5652p_args_tail : p_rest
5653 {
5654 $$ = new_array_pattern_tail(p, 0, 1, $1, 0, &@$);
5655 /*% ripper: [Qnil, $:1, Qnil] %*/
5656 }
5657 | p_rest ',' p_args_post
5658 {
5659 $$ = new_array_pattern_tail(p, 0, 1, $1, $3, &@$);
5660 /*% ripper: [Qnil, $:1, $:3] %*/
5661 }
5662 ;
5663
5664p_find : p_rest ',' p_args_post ',' p_rest
5665 {
5666 $$ = new_find_pattern_tail(p, $1, $3, $5, &@$);
5667 /*% ripper: [$:1, $:3, $:5] %*/
5668 }
5669 ;
5670
5671
5672p_rest : tSTAR tIDENTIFIER
5673 {
5674 error_duplicate_pattern_variable(p, $2, &@2);
5675 /*% ripper: var_field!($:2) %*/
5676 $$ = assignable(p, $2, 0, &@$);
5677 }
5678 | tSTAR
5679 {
5680 $$ = 0;
5681 /*% ripper: var_field!(Qnil) %*/
5682 }
5683 ;
5684
5685p_args_post : p_arg
5686 | p_args_post ',' p_arg
5687 {
5688 $$ = list_concat($1, $3);
5689 /*% ripper: rb_ary_concat($:1, $:3) %*/
5690 }
5691 ;
5692
5693p_arg : p_expr
5694 {
5695 $$ = NEW_LIST($1, &@$);
5696 /*% ripper: [$:1] %*/
5697 }
5698 ;
5699
5700p_kwargs : p_kwarg ',' p_any_kwrest
5701 {
5702 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), $3, &@$);
5703 /*% ripper: [$:1, $:3] %*/
5704 }
5705 | p_kwarg
5706 {
5707 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$);
5708 /*% ripper: [$:1, Qnil] %*/
5709 }
5710 | p_kwarg ','
5711 {
5712 $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$);
5713 /*% ripper: [$:1, Qnil] %*/
5714 }
5715 | p_any_kwrest
5716 {
5717 $$ = new_hash_pattern_tail(p, new_hash(p, 0, &@$), $1, &@$);
5718 /*% ripper: [[], $:1] %*/
5719 }
5720 ;
5721
5722p_kwarg : p_kw
5723 /*% ripper[brace]: [$:1] %*/
5724 | p_kwarg ',' p_kw
5725 {
5726 $$ = list_concat($1, $3);
5727 /*% ripper: rb_ary_push($:1, $:3) %*/
5728 }
5729 ;
5730
5731p_kw : p_kw_label p_expr
5732 {
5733 error_duplicate_pattern_key(p, $1, &@1);
5734 $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), $2);
5735 /*% ripper: [$:1, $:2] %*/
5736 }
5737 | p_kw_label
5738 {
5739 error_duplicate_pattern_key(p, $1, &@1);
5740 if ($1 && !is_local_id($1)) {
5741 yyerror1(&@1, "key must be valid as local variables");
5742 }
5743 error_duplicate_pattern_variable(p, $1, &@1);
5744 $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@$), &@$), assignable(p, $1, 0, &@$));
5745 /*% ripper: [$:1, Qnil] %*/
5746 }
5747 ;
5748
5749p_kw_label : tLABEL
5750 | tSTRING_BEG string_contents tLABEL_END
5751 {
5752 YYLTYPE loc = code_loc_gen(&@1, &@3);
5753 if (!$2 || nd_type_p($2, NODE_STR)) {
5754 NODE *node = dsym_node(p, $2, &loc);
5755 $$ = rb_sym2id(rb_node_sym_string_val(node));
5756 }
5757 else {
5758 yyerror1(&loc, "symbol literal with interpolation is not allowed");
5759 $$ = rb_intern_str(STR_NEW0());
5760 }
5761 /*% ripper: $:2 %*/
5762 }
5763 ;
5764
5765p_kwrest : kwrest_mark tIDENTIFIER
5766 {
5767 $$ = $2;
5768 /*% ripper: var_field!($:2) %*/
5769 }
5770 | kwrest_mark
5771 {
5772 $$ = 0;
5773 /*% ripper: Qnil %*/
5774 }
5775 ;
5776
5777p_kwnorest : kwrest_mark keyword_nil
5778 {
5779 $$ = 0;
5780 }
5781 ;
5782
5783p_any_kwrest : p_kwrest
5784 | p_kwnorest
5785 {
5786 $$ = idNil;
5787 /*% ripper: var_field!(ID2VAL(idNil)) %*/
5788 }
5789 ;
5790
5791p_value : p_primitive
5792 | range_expr(p_primitive)
5793 | p_var_ref
5794 | p_expr_ref
5795 | p_const
5796 ;
5797
5798p_primitive : inline_primary
5799 | keyword_variable
5800 {
5801 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$);
5802 /*% ripper: var_ref!($:1) %*/
5803 }
5804 | lambda
5805 ;
5806
5807p_variable : tIDENTIFIER
5808 {
5809 error_duplicate_pattern_variable(p, $1, &@1);
5810 /*% ripper: var_field!($:1) %*/
5811 $$ = assignable(p, $1, 0, &@$);
5812 }
5813 ;
5814
5815p_var_ref : '^' tIDENTIFIER
5816 {
5817 NODE *n = gettable(p, $2, &@$);
5818 if (!n) {
5819 n = NEW_ERROR(&@$);
5820 }
5821 else if (!(nd_type_p(n, NODE_LVAR) || nd_type_p(n, NODE_DVAR))) {
5822 compile_error(p, "%"PRIsVALUE": no such local variable", rb_id2str($2));
5823 }
5824 $$ = n;
5825 /*% ripper: var_ref!($:2) %*/
5826 }
5827 | '^' nonlocal_var
5828 {
5829 if (!($$ = gettable(p, $2, &@$))) $$ = NEW_ERROR(&@$);
5830 /*% ripper: var_ref!($:2) %*/
5831 }
5832 ;
5833
5834p_expr_ref : '^' tLPAREN expr_value rparen
5835 {
5836 $$ = NEW_BLOCK($3, &@$);
5837 /*% ripper: begin!($:3) %*/
5838 }
5839 ;
5840
5841p_const : tCOLON3 cname
5842 {
5843 $$ = NEW_COLON3($2, &@$, &@1, &@2);
5844 /*% ripper: top_const_ref!($:2) %*/
5845 }
5846 | p_const tCOLON2 cname
5847 {
5848 $$ = NEW_COLON2($1, $3, &@$, &@2, &@3);
5849 /*% ripper: const_path_ref!($:1, $:3) %*/
5850 }
5851 | tCONSTANT
5852 {
5853 $$ = gettable(p, $1, &@$);
5854 /*% ripper: var_ref!($:1) %*/
5855 }
5856 ;
5857
5858opt_rescue : k_rescue exc_list exc_var then
5859 compstmt(stmts)
5860 opt_rescue
5861 {
5862 NODE *err = $3;
5863 if ($3) {
5864 err = NEW_ERRINFO(&@3);
5865 err = node_assign(p, $3, err, NO_LEX_CTXT, &@3);
5866 }
5867 $$ = NEW_RESBODY($2, $3, $5, $6, &@$);
5868 if ($2) {
5869 fixpos($$, $2);
5870 }
5871 else if ($3) {
5872 fixpos($$, $3);
5873 }
5874 else {
5875 fixpos($$, $5);
5876 }
5877 /*% ripper: rescue!($:2, $:3, $:5, $:6) %*/
5878 }
5879 | none
5880 ;
5881
5882exc_list : arg_value
5883 {
5884 $$ = NEW_LIST($1, &@$);
5885 /*% ripper: rb_ary_new3(1, $:1) %*/
5886 }
5887 | mrhs
5888 {
5889 if (!($$ = splat_array($1))) $$ = $1;
5890 }
5891 | none
5892 ;
5893
5894exc_var : tASSOC lhs
5895 {
5896 $$ = $2;
5897 /*% ripper: $:2 %*/
5898 }
5899 | none
5900 ;
5901
5902opt_ensure : k_ensure stmts terms?
5903 {
5904 p->ctxt.in_rescue = $1.in_rescue;
5905 $$ = $2;
5906 void_expr(p, void_stmts(p, $$));
5907 /*% ripper: ensure!($:2) %*/
5908 }
5909 | none
5910 ;
5911
5912literal : numeric
5913 | symbol
5914 ;
5915
5916strings : string
5917 {
5918 if (!$1) {
5919 $$ = NEW_STR(STRING_NEW0(), &@$);
5920 }
5921 else {
5922 $$ = evstr2dstr(p, $1);
5923 }
5924 /*% ripper: $:1 %*/
5925 }
5926 ;
5927
5928string : tCHAR
5929 | string1
5930 | string string1
5931 {
5932 $$ = literal_concat(p, $1, $2, &@$);
5933 /*% ripper: string_concat!($:1, $:2) %*/
5934 }
5935 ;
5936
5937string1 : tSTRING_BEG string_contents tSTRING_END
5938 {
5939 $$ = heredoc_dedent(p, $2);
5940 if ($$) nd_set_loc($$, &@$);
5941 /*% ripper: $:2 %*/
5942 if (p->heredoc_indent > 0) {
5943 /*% ripper: heredoc_dedent!($:$, INT2NUM(%{p->heredoc_indent})) %*/
5944 p->heredoc_indent = 0;
5945 }
5946 /*% ripper: string_literal!($:$) %*/
5947 }
5948 ;
5949
5950xstring : tXSTRING_BEG xstring_contents tSTRING_END
5951 {
5952 $$ = new_xstring(p, heredoc_dedent(p, $2), &@$);
5953 /*% ripper: $:2 %*/
5954 if (p->heredoc_indent > 0) {
5955 /*% ripper: heredoc_dedent!($:$, INT2NUM(%{p->heredoc_indent})) %*/
5956 p->heredoc_indent = 0;
5957 }
5958 /*% ripper: xstring_literal!($:$) %*/
5959 }
5960 ;
5961
5962regexp : tREGEXP_BEG regexp_contents tREGEXP_END
5963 {
5964 $$ = new_regexp(p, $2, $3, &@$, &@1, &@2, &@3);
5965 /*% ripper: regexp_literal!($:2, $:3) %*/
5966 }
5967 ;
5968
5969words : words(tWORDS_BEG, word_list)
5970 ;
5971
5972word_list : /* none */
5973 {
5974 $$ = 0;
5975 /*% ripper: words_new! %*/
5976 }
5977 | word_list word ' '+
5978 {
5979 $$ = list_append(p, $1, evstr2dstr(p, $2));
5980 /*% ripper: words_add!($:1, $:2) %*/
5981 }
5982 ;
5983
5984word : string_content
5985 /*% ripper[brace]: word_add!(word_new!, $:1) %*/
5986 | word string_content
5987 {
5988 $$ = literal_concat(p, $1, $2, &@$);
5989 /*% ripper: word_add!($:1, $:2) %*/
5990 }
5991 ;
5992
5993symbols : words(tSYMBOLS_BEG, symbol_list)
5994 ;
5995
5996symbol_list : /* none */
5997 {
5998 $$ = 0;
5999 /*% ripper: symbols_new! %*/
6000 }
6001 | symbol_list word ' '+
6002 {
6003 $$ = symbol_append(p, $1, evstr2dstr(p, $2));
6004 /*% ripper: symbols_add!($:1, $:2) %*/
6005 }
6006 ;
6007
6008qwords : words(tQWORDS_BEG, qword_list)
6009 ;
6010
6011qsymbols : words(tQSYMBOLS_BEG, qsym_list)
6012 ;
6013
6014qword_list : /* none */
6015 {
6016 $$ = 0;
6017 /*% ripper: qwords_new! %*/
6018 }
6019 | qword_list tSTRING_CONTENT ' '+
6020 {
6021 $$ = list_append(p, $1, $2);
6022 /*% ripper: qwords_add!($:1, $:2) %*/
6023 }
6024 ;
6025
6026qsym_list : /* none */
6027 {
6028 $$ = 0;
6029 /*% ripper: qsymbols_new! %*/
6030 }
6031 | qsym_list tSTRING_CONTENT ' '+
6032 {
6033 $$ = symbol_append(p, $1, $2);
6034 /*% ripper: qsymbols_add!($:1, $:2) %*/
6035 }
6036 ;
6037
6038string_contents : /* none */
6039 {
6040 $$ = 0;
6041 /*% ripper: string_content! %*/
6042 }
6043 | string_contents string_content
6044 {
6045 $$ = literal_concat(p, $1, $2, &@$);
6046 /*% ripper: string_add!($:1, $:2) %*/
6047 }
6048 ;
6049
6050xstring_contents: /* none */
6051 {
6052 $$ = 0;
6053 /*% ripper: xstring_new! %*/
6054 }
6055 | xstring_contents string_content
6056 {
6057 $$ = literal_concat(p, $1, $2, &@$);
6058 /*% ripper: xstring_add!($:1, $:2) %*/
6059 }
6060 ;
6061
6062regexp_contents : /* none */
6063 {
6064 $$ = 0;
6065 /*% ripper: regexp_new! %*/
6066 }
6067 | regexp_contents string_content
6068 {
6069 NODE *head = $1, *tail = $2;
6070 if (!head) {
6071 $$ = tail;
6072 }
6073 else if (!tail) {
6074 $$ = head;
6075 }
6076 else {
6077 switch (nd_type(head)) {
6078 case NODE_STR:
6079 head = str2dstr(p, head);
6080 break;
6081 case NODE_DSTR:
6082 break;
6083 default:
6084 head = list_append(p, NEW_DSTR(0, &@$), head);
6085 break;
6086 }
6087 $$ = list_append(p, head, tail);
6088 }
6089 /*% ripper: regexp_add!($:1, $:2) %*/
6090 }
6091 ;
6092
6093string_content : tSTRING_CONTENT
6094 /*% ripper[brace]: $:1 %*/
6095 | tSTRING_DVAR
6096 {
6097 /* need to backup p->lex.strterm so that a string literal `%&foo,#$&,bar&` can be parsed */
6098 $$ = p->lex.strterm;
6099 p->lex.strterm = 0;
6100 SET_LEX_STATE(EXPR_BEG);
6101 }<strterm>
6102 string_dvar
6103 {
6104 p->lex.strterm = $2;
6105 $$ = NEW_EVSTR($3, &@$, &@1, &NULL_LOC);
6106 nd_set_line($$, @3.end_pos.lineno);
6107 /*% ripper: string_dvar!($:3) %*/
6108 }
6109 | tSTRING_DBEG[state]
6110 {
6111 CMDARG_PUSH(0);
6112 COND_PUSH(0);
6113 /* need to backup p->lex.strterm so that a string literal `%!foo,#{ !0 },bar!` can be parsed */
6114 $$ = p->lex.strterm;
6115 p->lex.strterm = 0;
6116 SET_LEX_STATE(EXPR_BEG);
6117 }[term]<strterm>
6118 {
6119 $$ = p->lex.brace_nest;
6120 p->lex.brace_nest = 0;
6121 }[brace]<num>
6122 {
6123 $$ = p->heredoc_indent;
6124 p->heredoc_indent = 0;
6125 }[indent]<num>
6126 compstmt(stmts) string_dend
6127 {
6128 COND_POP();
6129 CMDARG_POP();
6130 p->lex.strterm = $term;
6131 SET_LEX_STATE($state);
6132 p->lex.brace_nest = $brace;
6133 p->heredoc_indent = $indent;
6134 p->heredoc_line_indent = -1;
6135 if ($compstmt) nd_unset_fl_newline($compstmt);
6136 $$ = new_evstr(p, $compstmt, &@$, &@state, &@string_dend);
6137 /*% ripper: string_embexpr!($:compstmt) %*/
6138 }
6139 ;
6140
6141string_dend : tSTRING_DEND
6142 | END_OF_INPUT
6143 ;
6144
6145string_dvar : nonlocal_var
6146 {
6147 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$);
6148 /*% ripper: var_ref!($:1) %*/
6149 }
6150 | backref
6151 ;
6152
6153symbol : ssym
6154 | dsym
6155 ;
6156
6157ssym : tSYMBEG sym
6158 {
6159 SET_LEX_STATE(EXPR_END);
6160 VALUE str = rb_id2str($2);
6161 /*
6162 * TODO:
6163 * set_yylval_noname sets invalid id to yylval.
6164 * This branch can be removed once yylval is changed to
6165 * hold lexed string.
6166 */
6167 if (!str) str = STR_NEW0();
6168 $$ = NEW_SYM(str, &@$);
6169 /*% ripper: symbol_literal!(symbol!($:2)) %*/
6170 }
6171 ;
6172
6173sym : fname
6174 | nonlocal_var
6175 ;
6176
6177dsym : tSYMBEG string_contents tSTRING_END
6178 {
6179 SET_LEX_STATE(EXPR_END);
6180 $$ = dsym_node(p, $2, &@$);
6181 /*% ripper: dyna_symbol!($:2) %*/
6182 }
6183 ;
6184
6185numeric : simple_numeric
6186 | tUMINUS_NUM simple_numeric %prec tLOWEST
6187 {
6188 $$ = $2;
6189 negate_lit(p, $$, &@$);
6190 /*% ripper: unary!(ID2VAL(idUMinus), $:2) %*/
6191 }
6192 ;
6193
6194simple_numeric : tINTEGER
6195 | tFLOAT
6196 | tRATIONAL
6197 | tIMAGINARY
6198 ;
6199
6200nonlocal_var : tIVAR
6201 | tGVAR
6202 | tCVAR
6203 ;
6204
6205user_variable : ident_or_const
6206 | nonlocal_var
6207 ;
6208
6209keyword_variable: keyword_nil {$$ = KWD2EID(nil, $1);}
6210 | keyword_self {$$ = KWD2EID(self, $1);}
6211 | keyword_true {$$ = KWD2EID(true, $1);}
6212 | keyword_false {$$ = KWD2EID(false, $1);}
6213 | keyword__FILE__ {$$ = KWD2EID(_FILE__, $1);}
6214 | keyword__LINE__ {$$ = KWD2EID(_LINE__, $1);}
6215 | keyword__ENCODING__ {$$ = KWD2EID(_ENCODING__, $1);}
6216 ;
6217
6218var_ref : user_variable
6219 {
6220 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$);
6221 if (ifdef_ripper(id_is_var(p, $1), false)) {
6222 /*% ripper: var_ref!($:1) %*/
6223 }
6224 else {
6225 /*% ripper: vcall!($:1) %*/
6226 }
6227 }
6228 | keyword_variable
6229 {
6230 if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$);
6231 /*% ripper: var_ref!($:1) %*/
6232 }
6233 ;
6234
6235var_lhs : user_or_keyword_variable
6236 {
6237 /*% ripper: var_field!($:1) %*/
6238 $$ = assignable(p, $1, 0, &@$);
6239 }
6240 ;
6241
6242backref : tNTH_REF
6243 | tBACK_REF
6244 ;
6245
6246superclass : '<'
6247 {
6248 SET_LEX_STATE(EXPR_BEG);
6249 p->command_start = TRUE;
6250 }
6251 expr_value term
6252 {
6253 $$ = $3;
6254 /*% ripper: $:3 %*/
6255 }
6256 | none
6257 ;
6258
6259f_opt_paren_args: f_paren_args
6260 | none
6261 {
6262 p->ctxt.in_argdef = 0;
6263 $$ = new_args_tail(p, 0, 0, 0, &@0);
6264 $$ = new_args(p, 0, 0, 0, 0, $$, &@0);
6265 /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, Qnil, Qnil, Qnil) %*/
6266 }
6267 ;
6268
6269f_paren_args : '(' f_args rparen
6270 {
6271 $$ = $2;
6272 /*% ripper: paren!($:2) %*/
6273 SET_LEX_STATE(EXPR_BEG);
6274 p->command_start = TRUE;
6275 p->ctxt.in_argdef = 0;
6276 }
6277 ;
6278
6279f_arglist : f_paren_args
6280 | {
6281 $$ = p->ctxt;
6282 p->ctxt.in_kwarg = 1;
6283 p->ctxt.in_argdef = 1;
6284 SET_LEX_STATE(p->lex.state|EXPR_LABEL); /* force for args */
6285 }<ctxt>
6286 f_args term
6287 {
6288 p->ctxt.in_kwarg = $1.in_kwarg;
6289 p->ctxt.in_argdef = 0;
6290 $$ = $2;
6291 SET_LEX_STATE(EXPR_BEG);
6292 p->command_start = TRUE;
6293 /*% ripper: $:2 %*/
6294 }
6295 ;
6296
6297args_tail : args_tail_basic(arg_value)
6298 | args_forward
6299 {
6300 ID fwd = $args_forward;
6301 if (lambda_beginning_p() ||
6302 (p->lex.lpar_beg >= 0 && p->lex.lpar_beg+1 == p->lex.paren_nest)) {
6303 yyerror0("unexpected ... in lambda argument");
6304 fwd = 0;
6305 }
6306 else {
6307 add_forwarding_args(p);
6308 }
6309 $$ = new_args_tail(p, 0, fwd, arg_FWD_BLOCK, &@1);
6310 $$->nd_ainfo.forwarding = 1;
6311 /*% ripper: [Qnil, $:1, Qnil] %*/
6312 }
6313 ;
6314
6315f_args : f_arg ',' f_opt_arg(arg_value) ',' f_rest_arg opt_args_tail(args_tail)
6316 {
6317 $$ = new_args(p, $1, $3, $5, 0, $6, &@$);
6318 /*% ripper: params!($:1, $:3, $:5, Qnil, *$:6[0..2]) %*/
6319 }
6320 | f_arg ',' f_opt_arg(arg_value) ',' f_rest_arg ',' f_arg opt_args_tail(args_tail)
6321 {
6322 $$ = new_args(p, $1, $3, $5, $7, $8, &@$);
6323 /*% ripper: params!($:1, $:3, $:5, $:7, *$:8[0..2]) %*/
6324 }
6325 | f_arg ',' f_opt_arg(arg_value) opt_args_tail(args_tail)
6326 {
6327 $$ = new_args(p, $1, $3, 0, 0, $4, &@$);
6328 /*% ripper: params!($:1, $:3, Qnil, Qnil, *$:4[0..2]) %*/
6329 }
6330 | f_arg ',' f_opt_arg(arg_value) ',' f_arg opt_args_tail(args_tail)
6331 {
6332 $$ = new_args(p, $1, $3, 0, $5, $6, &@$);
6333 /*% ripper: params!($:1, $:3, Qnil, $:5, *$:6[0..2]) %*/
6334 }
6335 | f_arg ',' f_rest_arg opt_args_tail(args_tail)
6336 {
6337 $$ = new_args(p, $1, 0, $3, 0, $4, &@$);
6338 /*% ripper: params!($:1, Qnil, $:3, Qnil, *$:4[0..2]) %*/
6339 }
6340 | f_arg ',' f_rest_arg ',' f_arg opt_args_tail(args_tail)
6341 {
6342 $$ = new_args(p, $1, 0, $3, $5, $6, &@$);
6343 /*% ripper: params!($:1, Qnil, $:3, $:5, *$:6[0..2]) %*/
6344 }
6345 | f_arg opt_args_tail(args_tail)
6346 {
6347 $$ = new_args(p, $1, 0, 0, 0, $2, &@$);
6348 /*% ripper: params!($:1, Qnil, Qnil, Qnil, *$:2[0..2]) %*/
6349 }
6350 | f_opt_arg(arg_value) ',' f_rest_arg opt_args_tail(args_tail)
6351 {
6352 $$ = new_args(p, 0, $1, $3, 0, $4, &@$);
6353 /*% ripper: params!(Qnil, $:1, $:3, Qnil, *$:4[0..2]) %*/
6354 }
6355 | f_opt_arg(arg_value) ',' f_rest_arg ',' f_arg opt_args_tail(args_tail)
6356 {
6357 $$ = new_args(p, 0, $1, $3, $5, $6, &@$);
6358 /*% ripper: params!(Qnil, $:1, $:3, $:5, *$:6[0..2]) %*/
6359 }
6360 | f_opt_arg(arg_value) opt_args_tail(args_tail)
6361 {
6362 $$ = new_args(p, 0, $1, 0, 0, $2, &@$);
6363 /*% ripper: params!(Qnil, $:1, Qnil, Qnil, *$:2[0..2]) %*/
6364 }
6365 | f_opt_arg(arg_value) ',' f_arg opt_args_tail(args_tail)
6366 {
6367 $$ = new_args(p, 0, $1, 0, $3, $4, &@$);
6368 /*% ripper: params!(Qnil, $:1, Qnil, $:3, *$:4[0..2]) %*/
6369 }
6370 | f_rest_arg opt_args_tail(args_tail)
6371 {
6372 $$ = new_args(p, 0, 0, $1, 0, $2, &@$);
6373 /*% ripper: params!(Qnil, Qnil, $:1, Qnil, *$:2[0..2]) %*/
6374 }
6375 | f_rest_arg ',' f_arg opt_args_tail(args_tail)
6376 {
6377 $$ = new_args(p, 0, 0, $1, $3, $4, &@$);
6378 /*% ripper: params!(Qnil, Qnil, $:1, $:3, *$:4[0..2]) %*/
6379 }
6380 | args_tail
6381 {
6382 $$ = new_args(p, 0, 0, 0, 0, $1, &@$);
6383 /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, *$:1[0..2]) %*/
6384 }
6385 | /* none */
6386 {
6387 $$ = new_args_tail(p, 0, 0, 0, &@0);
6388 $$ = new_args(p, 0, 0, 0, 0, $$, &@0);
6389 /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, Qnil, Qnil, Qnil) %*/
6390 }
6391 ;
6392
6393args_forward : tBDOT3
6394 {
6395 $$ = idFWD_KWREST;
6396 /*% ripper: args_forward! %*/
6397 }
6398 ;
6399
6400f_bad_arg : tCONSTANT
6401 {
6402 static const char mesg[] = "formal argument cannot be a constant";
6403 /*%%%*/
6404 yyerror1(&@1, mesg);
6405 /*% %*/
6406 $$ = 0;
6407 /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/
6408 }
6409 | tIVAR
6410 {
6411 static const char mesg[] = "formal argument cannot be an instance variable";
6412 /*%%%*/
6413 yyerror1(&@1, mesg);
6414 /*% %*/
6415 $$ = 0;
6416 /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/
6417 }
6418 | tGVAR
6419 {
6420 static const char mesg[] = "formal argument cannot be a global variable";
6421 /*%%%*/
6422 yyerror1(&@1, mesg);
6423 /*% %*/
6424 $$ = 0;
6425 /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/
6426 }
6427 | tCVAR
6428 {
6429 static const char mesg[] = "formal argument cannot be a class variable";
6430 /*%%%*/
6431 yyerror1(&@1, mesg);
6432 /*% %*/
6433 $$ = 0;
6434 /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/
6435 }
6436 ;
6437
6438f_norm_arg : f_bad_arg
6439 | tIDENTIFIER
6440 {
6441 VALUE e = formal_argument_error(p, $$ = $1);
6442 if (e) {
6443 /*% ripper[error]: param_error!(?e, $:1) %*/
6444 }
6445 p->max_numparam = ORDINAL_PARAM;
6446 }
6447 ;
6448
6449f_arg_asgn : f_norm_arg
6450 {
6451 arg_var(p, $1);
6452 $$ = $1;
6453 }
6454 ;
6455
6456f_arg_item : f_arg_asgn
6457 {
6458 $$ = NEW_ARGS_AUX($1, 1, &NULL_LOC);
6459 /*% ripper: $:1 %*/
6460 }
6461 | tLPAREN f_margs rparen
6462 {
6463 ID tid = internal_id(p);
6464 YYLTYPE loc;
6465 loc.beg_pos = @2.beg_pos;
6466 loc.end_pos = @2.beg_pos;
6467 arg_var(p, tid);
6468 if (dyna_in_block(p)) {
6469 $2->nd_value = NEW_DVAR(tid, &loc);
6470 }
6471 else {
6472 $2->nd_value = NEW_LVAR(tid, &loc);
6473 }
6474 $$ = NEW_ARGS_AUX(tid, 1, &NULL_LOC);
6475 $$->nd_next = (NODE *)$2;
6476 /*% ripper: mlhs_paren!($:2) %*/
6477 }
6478 ;
6479
6480f_arg : f_arg_item
6481 /*% ripper[brace]: rb_ary_new3(1, $:1) %*/
6482 | f_arg ',' f_arg_item
6483 {
6484 $$ = $1;
6485 $$->nd_plen++;
6486 $$->nd_next = block_append(p, $$->nd_next, $3->nd_next);
6487 rb_discard_node(p, (NODE *)$3);
6488 /*% ripper: rb_ary_push($:1, $:3) %*/
6489 }
6490 ;
6491
6492
6493f_label : tLABEL
6494 {
6495 VALUE e = formal_argument_error(p, $$ = $1);
6496 if (e) {
6497 $$ = 0;
6498 /*% ripper[error]: param_error!(?e, $:1) %*/
6499 }
6500 /*
6501 * Workaround for Prism::ParseTest#test_filepath for
6502 * "unparser/corpus/literal/def.txt"
6503 *
6504 * See the discussion on https://github.com/ruby/ruby/pull/9923
6505 */
6506 arg_var(p, ifdef_ripper(0, $1));
6507 /*% ripper: $:1 %*/
6508 p->max_numparam = ORDINAL_PARAM;
6509 p->ctxt.in_argdef = 0;
6510 }
6511 ;
6512
6513kwrest_mark : tPOW
6514 | tDSTAR
6515 ;
6516
6517f_no_kwarg : p_kwnorest
6518 {
6519 /*% ripper: nokw_param!(Qnil) %*/
6520 }
6521 ;
6522
6523f_kwrest : kwrest_mark tIDENTIFIER
6524 {
6525 arg_var(p, shadowing_lvar(p, $2));
6526 $$ = $2;
6527 /*% ripper: kwrest_param!($:2) %*/
6528 }
6529 | kwrest_mark
6530 {
6531 arg_var(p, idFWD_KWREST);
6532 $$ = idFWD_KWREST;
6533 /*% ripper: kwrest_param!(Qnil) %*/
6534 }
6535 ;
6536
6537restarg_mark : '*'
6538 | tSTAR
6539 ;
6540
6541f_rest_arg : restarg_mark tIDENTIFIER
6542 {
6543 arg_var(p, shadowing_lvar(p, $2));
6544 $$ = $2;
6545 /*% ripper: rest_param!($:2) %*/
6546 }
6547 | restarg_mark
6548 {
6549 arg_var(p, idFWD_REST);
6550 $$ = idFWD_REST;
6551 /*% ripper: rest_param!(Qnil) %*/
6552 }
6553 ;
6554
6555blkarg_mark : '&'
6556 | tAMPER
6557 ;
6558
6559f_block_arg : blkarg_mark tIDENTIFIER
6560 {
6561 arg_var(p, shadowing_lvar(p, $2));
6562 $$ = $2;
6563 /*% ripper: blockarg!($:2) %*/
6564 }
6565 | blkarg_mark
6566 {
6567 arg_var(p, idFWD_BLOCK);
6568 $$ = idFWD_BLOCK;
6569 /*% ripper: blockarg!(Qnil) %*/
6570 }
6571 ;
6572
6573opt_f_block_arg : ',' f_block_arg
6574 {
6575 $$ = $2;
6576 /*% ripper: $:2 %*/
6577 }
6578 | none
6579 ;
6580
6581
6582singleton : value_expr(singleton_expr)
6583 {
6584 NODE *expr = last_expr_node($1);
6585 switch (nd_type(expr)) {
6586 case NODE_STR:
6587 case NODE_DSTR:
6588 case NODE_XSTR:
6589 case NODE_DXSTR:
6590 case NODE_REGX:
6591 case NODE_DREGX:
6592 case NODE_SYM:
6593 case NODE_LINE:
6594 case NODE_FILE:
6595 case NODE_ENCODING:
6596 case NODE_INTEGER:
6597 case NODE_FLOAT:
6598 case NODE_RATIONAL:
6599 case NODE_IMAGINARY:
6600 case NODE_DSYM:
6601 case NODE_LIST:
6602 case NODE_ZLIST:
6603 yyerror1(&expr->nd_loc, "can't define singleton method for literals");
6604 break;
6605 default:
6606 break;
6607 }
6608 $$ = $1;
6609 }
6610 ;
6611
6612singleton_expr : var_ref
6613 | '('
6614 {
6615 SET_LEX_STATE(EXPR_BEG);
6616 p->ctxt.in_argdef = 0;
6617 }
6618 expr rparen
6619 {
6620 p->ctxt.in_argdef = 1;
6621 $$ = $3;
6622 /*% ripper: paren!($:3) %*/
6623 }
6624 ;
6625
6626assoc_list : none
6627 | assocs trailer
6628 {
6629 $$ = $1;
6630 /*% ripper: assoclist_from_args!($:1) %*/
6631 }
6632 ;
6633
6634assocs : assoc
6635 /*% ripper[brace]: rb_ary_new3(1, $:1) %*/
6636 | assocs ',' assoc
6637 {
6638 NODE *assocs = $1;
6639 NODE *tail = $3;
6640 if (!assocs) {
6641 assocs = tail;
6642 }
6643 else if (tail) {
6644 if (RNODE_LIST(assocs)->nd_head) {
6645 NODE *n = RNODE_LIST(tail)->nd_next;
6646 if (!RNODE_LIST(tail)->nd_head && nd_type_p(n, NODE_LIST) &&
6647 nd_type_p((n = RNODE_LIST(n)->nd_head), NODE_HASH)) {
6648 /* DSTAR */
6649 tail = RNODE_HASH(n)->nd_head;
6650 }
6651 }
6652 if (tail) {
6653 assocs = list_concat(assocs, tail);
6654 }
6655 }
6656 $$ = assocs;
6657 /*% ripper: rb_ary_push($:1, $:3) %*/
6658 }
6659 ;
6660
6661assoc : arg_value tASSOC arg_value
6662 {
6663 $$ = list_append(p, NEW_LIST($1, &@$), $3);
6664 /*% ripper: assoc_new!($:1, $:3) %*/
6665 }
6666 | tLABEL arg_value
6667 {
6668 $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), $2);
6669 /*% ripper: assoc_new!($:1, $:2) %*/
6670 }
6671 | tLABEL
6672 {
6673 NODE *val = gettable(p, $1, &@$);
6674 if (!val) val = NEW_ERROR(&@$);
6675 $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), val);
6676 /*% ripper: assoc_new!($:1, Qnil) %*/
6677 }
6678 | tSTRING_BEG string_contents tLABEL_END arg_value
6679 {
6680 YYLTYPE loc = code_loc_gen(&@1, &@3);
6681 $$ = list_append(p, NEW_LIST(dsym_node(p, $2, &loc), &loc), $4);
6682 /*% ripper: assoc_new!(dyna_symbol!($:2), $:4) %*/
6683 }
6684 | tDSTAR arg_value
6685 {
6686 $$ = list_append(p, NEW_LIST(0, &@$), $2);
6687 /*% ripper: assoc_splat!($:2) %*/
6688 }
6689 | tDSTAR
6690 {
6691 forwarding_arg_check(p, idFWD_KWREST, idFWD_ALL, "keyword rest");
6692 $$ = list_append(p, NEW_LIST(0, &@$),
6693 NEW_LVAR(idFWD_KWREST, &@$));
6694 /*% ripper: assoc_splat!(Qnil) %*/
6695 }
6696 ;
6697
6698%rule %inline operation : ident_or_const
6699 | tFID
6700 ;
6701
6702operation2 : operation
6703 | op
6704 ;
6705
6706operation3 : tIDENTIFIER
6707 | tFID
6708 | op
6709 ;
6710
6711dot_or_colon : '.'
6712 | tCOLON2
6713 ;
6714
6715call_op : '.'
6716 | tANDDOT
6717 ;
6718
6719call_op2 : call_op
6720 | tCOLON2
6721 ;
6722
6723rparen : '\n'? ')'
6724 ;
6725
6726rbracket : '\n'? ']'
6727 ;
6728
6729rbrace : '\n'? '}'
6730 ;
6731
6732trailer : '\n'?
6733 | ','
6734 ;
6735
6736term : ';'
6737 {
6738 yyerrok;
6739 token_flush(p);
6740 if (p->ctxt.in_defined) {
6741 p->ctxt.has_trailing_semicolon = 1;
6742 }
6743 }
6744 | '\n'
6745 {
6746 @$.end_pos = @$.beg_pos;
6747 token_flush(p);
6748 }
6749 ;
6750
6751terms : term
6752 | terms ';' {yyerrok;}
6753 ;
6754
6755none : /* none */
6756 {
6757 $$ = 0;
6758 /*% ripper: Qnil %*/
6759 }
6760 ;
6761%%
6762# undef p
6763# undef yylex
6764# undef yylval
6765# define yylval (*p->lval)
6766
6767static int regx_options(struct parser_params*);
6768static int tokadd_string(struct parser_params*,int,int,int,long*,rb_encoding**,rb_encoding**);
6769static void tokaddmbc(struct parser_params *p, int c, rb_encoding *enc);
6770static enum yytokentype parse_string(struct parser_params*,rb_strterm_literal_t*);
6771static enum yytokentype here_document(struct parser_params*,rb_strterm_heredoc_t*);
6772
6773#define set_parser_s_value(x) (ifdef_ripper(p->s_value = (x), (void)0))
6774
6775# define set_yylval_node(x) { \
6776 YYLTYPE _cur_loc; \
6777 rb_parser_set_location(p, &_cur_loc); \
6778 yylval.node = (x); \
6779 set_parser_s_value(STR_NEW(p->lex.ptok, p->lex.pcur-p->lex.ptok)); \
6780}
6781# define set_yylval_str(x) \
6782do { \
6783 set_yylval_node(NEW_STR(x, &_cur_loc)); \
6784 set_parser_s_value(rb_str_new_mutable_parser_string(x)); \
6785} while(0)
6786# define set_yylval_num(x) { \
6787 yylval.num = (x); \
6788 set_parser_s_value(x); \
6789}
6790# define set_yylval_id(x) (yylval.id = (x))
6791# define set_yylval_name(x) { \
6792 (yylval.id = (x)); \
6793 set_parser_s_value(ID2SYM(x)); \
6794}
6795# define yylval_id() (yylval.id)
6796
6797#define set_yylval_noname() set_yylval_id(keyword_nil)
6798#define has_delayed_token(p) (p->delayed.token != NULL)
6799
6800#ifndef RIPPER
6801#define literal_flush(p, ptr) ((p)->lex.ptok = (ptr))
6802#define dispatch_scan_event(p, t) parser_dispatch_scan_event(p, t, __LINE__)
6803
6804static bool
6805parser_has_token(struct parser_params *p)
6806{
6807 const char *const pcur = p->lex.pcur;
6808 const char *const ptok = p->lex.ptok;
6809 if (p->keep_tokens && (pcur < ptok)) {
6810 rb_bug("lex.pcur < lex.ptok. (line: %d) %"PRIdPTRDIFF"|%"PRIdPTRDIFF"|%"PRIdPTRDIFF"",
6811 p->ruby_sourceline, ptok - p->lex.pbeg, pcur - ptok, p->lex.pend - pcur);
6812 }
6813 return pcur > ptok;
6814}
6815
6816static const char *
6817escaped_char(int c)
6818{
6819 switch (c) {
6820 case '"': return "\\\"";
6821 case '\\': return "\\\\";
6822 case '\0': return "\\0";
6823 case '\n': return "\\n";
6824 case '\r': return "\\r";
6825 case '\t': return "\\t";
6826 case '\f': return "\\f";
6827 case '\013': return "\\v";
6828 case '\010': return "\\b";
6829 case '\007': return "\\a";
6830 case '\033': return "\\e";
6831 case '\x7f': return "\\c?";
6832 }
6833 return NULL;
6834}
6835
6836static rb_parser_string_t *
6837rb_parser_str_escape(struct parser_params *p, rb_parser_string_t *str)
6838{
6839 rb_encoding *enc = p->enc;
6840 const char *ptr = str->ptr;
6841 const char *pend = ptr + str->len;
6842 const char *prev = ptr;
6843 char charbuf[5] = {'\\', 'x', 0, 0, 0};
6844 rb_parser_string_t * result = rb_parser_string_new(p, 0, 0);
6845
6846 while (ptr < pend) {
6847 unsigned int c;
6848 const char *cc;
6849 int n = rb_enc_precise_mbclen(ptr, pend, enc);
6850 if (!MBCLEN_CHARFOUND_P(n)) {
6851 if (ptr > prev) parser_str_cat(result, prev, ptr - prev);
6852 n = rb_enc_mbminlen(enc);
6853 if (pend < ptr + n)
6854 n = (int)(pend - ptr);
6855 while (n--) {
6856 c = *ptr & 0xf0 >> 4;
6857 charbuf[2] = (c < 10) ? '0' + c : 'A' + c - 10;
6858 c = *ptr & 0x0f;
6859 charbuf[3] = (c < 10) ? '0' + c : 'A' + c - 10;
6860 parser_str_cat(result, charbuf, 4);
6861 prev = ++ptr;
6862 }
6863 continue;
6864 }
6865 n = MBCLEN_CHARFOUND_LEN(n);
6866 c = rb_enc_mbc_to_codepoint(ptr, pend, enc);
6867 ptr += n;
6868 cc = escaped_char(c);
6869 if (cc) {
6870 if (ptr - n > prev) parser_str_cat(result, prev, ptr - n - prev);
6871 parser_str_cat_cstr(result, cc);
6872 prev = ptr;
6873 }
6874 else if (rb_enc_isascii(c, enc) && ISPRINT(c)) {
6875 }
6876 else {
6877 if (ptr - n > prev) {
6878 parser_str_cat(result, prev, ptr - n - prev);
6879 prev = ptr - n;
6880 }
6881 parser_str_cat(result, prev, ptr - prev);
6882 prev = ptr;
6883 }
6884 }
6885 if (ptr > prev) parser_str_cat(result, prev, ptr - prev);
6886
6887 return result;
6888}
6889
6890static void
6891parser_append_tokens(struct parser_params *p, rb_parser_string_t *str, enum yytokentype t, int line)
6892{
6893 rb_parser_ast_token_t *token = xcalloc(1, sizeof(rb_parser_ast_token_t));
6894 token->id = p->token_id;
6895 token->type_name = parser_token2char(p, t);
6896 token->str = str;
6897 token->loc.beg_pos = p->yylloc->beg_pos;
6898 token->loc.end_pos = p->yylloc->end_pos;
6899 rb_parser_ary_push_ast_token(p, p->tokens, token);
6900 p->token_id++;
6901
6902 if (p->debug) {
6903 rb_parser_string_t *str_escaped = rb_parser_str_escape(p, str);
6904 rb_parser_printf(p, "Append tokens (line: %d) [%d, :%s, \"%s\", [%d, %d, %d, %d]]\n",
6905 line, token->id, token->type_name, str_escaped->ptr,
6906 token->loc.beg_pos.lineno, token->loc.beg_pos.column,
6907 token->loc.end_pos.lineno, token->loc.end_pos.column);
6908 rb_parser_string_free(p, str_escaped);
6909 }
6910}
6911
6912static void
6913parser_dispatch_scan_event(struct parser_params *p, enum yytokentype t, int line)
6914{
6915 debug_token_line(p, "parser_dispatch_scan_event", line);
6916
6917 if (!parser_has_token(p)) return;
6918
6919 RUBY_SET_YYLLOC(*p->yylloc);
6920
6921 if (p->keep_tokens) {
6922 rb_parser_string_t *str = rb_parser_encoding_string_new(p, p->lex.ptok, p->lex.pcur - p->lex.ptok, p->enc);
6923 parser_append_tokens(p, str, t, line);
6924 }
6925
6926 token_flush(p);
6927}
6928
6929#define dispatch_delayed_token(p, t) parser_dispatch_delayed_token(p, t, __LINE__)
6930static void
6931parser_dispatch_delayed_token(struct parser_params *p, enum yytokentype t, int line)
6932{
6933 debug_token_line(p, "parser_dispatch_delayed_token", line);
6934
6935 if (!has_delayed_token(p)) return;
6936
6937 RUBY_SET_YYLLOC_OF_DELAYED_TOKEN(*p->yylloc);
6938
6939 if (p->keep_tokens) {
6940 /* p->delayed.token is freed by rb_parser_tokens_free */
6941 parser_append_tokens(p, p->delayed.token, t, line);
6942 }
6943 else {
6944 rb_parser_string_free(p, p->delayed.token);
6945 }
6946
6947 p->delayed.token = NULL;
6948}
6949#else
6950#define literal_flush(p, ptr) ((void)(ptr))
6951
6952static int
6953ripper_has_scan_event(struct parser_params *p)
6954{
6955 if (p->lex.pcur < p->lex.ptok) rb_raise(rb_eRuntimeError, "lex.pcur < lex.ptok");
6956 return p->lex.pcur > p->lex.ptok;
6957}
6958
6959static VALUE
6960ripper_scan_event_val(struct parser_params *p, enum yytokentype t)
6961{
6962 VALUE str = STR_NEW(p->lex.ptok, p->lex.pcur - p->lex.ptok);
6963 VALUE rval = ripper_dispatch1(p, ripper_token2eventid(t), str);
6964 RUBY_SET_YYLLOC(*p->yylloc);
6965 token_flush(p);
6966 return rval;
6967}
6968
6969static void
6970ripper_dispatch_scan_event(struct parser_params *p, enum yytokentype t)
6971{
6972 if (!ripper_has_scan_event(p)) return;
6973
6974 set_parser_s_value(ripper_scan_event_val(p, t));
6975}
6976#define dispatch_scan_event(p, t) ripper_dispatch_scan_event(p, t)
6977
6978static void
6979ripper_dispatch_delayed_token(struct parser_params *p, enum yytokentype t)
6980{
6981 /* save and adjust the location to delayed token for callbacks */
6982 int saved_line = p->ruby_sourceline;
6983 const char *saved_tokp = p->lex.ptok;
6984 VALUE s_value, str;
6985
6986 if (!has_delayed_token(p)) return;
6987 p->ruby_sourceline = p->delayed.beg_line;
6988 p->lex.ptok = p->lex.pbeg + p->delayed.beg_col;
6989 str = rb_str_new_mutable_parser_string(p->delayed.token);
6990 rb_parser_string_free(p, p->delayed.token);
6991 s_value = ripper_dispatch1(p, ripper_token2eventid(t), str);
6992 set_parser_s_value(s_value);
6993 p->delayed.token = NULL;
6994 p->ruby_sourceline = saved_line;
6995 p->lex.ptok = saved_tokp;
6996}
6997#define dispatch_delayed_token(p, t) ripper_dispatch_delayed_token(p, t)
6998#endif /* RIPPER */
6999
7000static inline int
7001is_identchar(struct parser_params *p, const char *ptr, const char *MAYBE_UNUSED(ptr_end), rb_encoding *enc)
7002{
7003 return rb_enc_isalnum((unsigned char)*ptr, enc) || *ptr == '_' || !ISASCII(*ptr);
7004}
7005
7006static inline bool
7007peek_word_at(struct parser_params *p, const char *str, size_t len, int at)
7008{
7009 const char *ptr = p->lex.pcur + at;
7010 if (lex_eol_ptr_n_p(p, ptr, len-1)) return false;
7011 if (memcmp(ptr, str, len)) return false;
7012 if (lex_eol_ptr_n_p(p, ptr, len)) return true;
7013 switch (ptr[len]) {
7014 case '!': case '?': return false;
7015 }
7016 return !is_identchar(p, ptr+len, p->lex.pend, p->enc);
7017}
7018
7019static inline int
7020parser_is_identchar(struct parser_params *p)
7021{
7022 return !(p)->eofp && is_identchar(p, p->lex.pcur-1, p->lex.pend, p->enc);
7023}
7024
7025static inline int
7026parser_isascii(struct parser_params *p)
7027{
7028 return ISASCII(*(p->lex.pcur-1));
7029}
7030
7031static void
7032token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc)
7033{
7034 int column = 1, nonspc = 0, i;
7035 for (i = 0; i < loc->beg_pos.column; i++, ptr++) {
7036 if (*ptr == '\t') {
7037 column = (((column - 1) / TAB_WIDTH) + 1) * TAB_WIDTH;
7038 }
7039 column++;
7040 if (*ptr != ' ' && *ptr != '\t') {
7041 nonspc = 1;
7042 }
7043 }
7044
7045 ptinfo->beg = loc->beg_pos;
7046 ptinfo->indent = column;
7047 ptinfo->nonspc = nonspc;
7048}
7049
7050static void
7051token_info_push(struct parser_params *p, const char *token, const rb_code_location_t *loc)
7052{
7053 token_info *ptinfo;
7054
7055 if (!p->token_info_enabled) return;
7056 ptinfo = ALLOC(token_info);
7057 ptinfo->token = token;
7058 ptinfo->next = p->token_info;
7059 token_info_setup(ptinfo, p->lex.pbeg, loc);
7060
7061 p->token_info = ptinfo;
7062}
7063
7064static void
7065token_info_pop(struct parser_params *p, const char *token, const rb_code_location_t *loc)
7066{
7067 token_info *ptinfo_beg = p->token_info;
7068
7069 if (!ptinfo_beg) return;
7070
7071 /* indentation check of matched keywords (begin..end, if..end, etc.) */
7072 token_info_warn(p, token, ptinfo_beg, 1, loc);
7073
7074 p->token_info = ptinfo_beg->next;
7075 ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg));
7076}
7077
7078static void
7079token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos)
7080{
7081 token_info *ptinfo_beg = p->token_info;
7082
7083 if (!ptinfo_beg) return;
7084 p->token_info = ptinfo_beg->next;
7085
7086 if (ptinfo_beg->beg.lineno != beg_pos.lineno ||
7087 ptinfo_beg->beg.column != beg_pos.column ||
7088 strcmp(ptinfo_beg->token, token)) {
7089 compile_error(p, "token position mismatch: %d:%d:%s expected but %d:%d:%s",
7090 beg_pos.lineno, beg_pos.column, token,
7091 ptinfo_beg->beg.lineno, ptinfo_beg->beg.column,
7092 ptinfo_beg->token);
7093 }
7094
7095 ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg));
7096}
7097
7098static void
7099token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc)
7100{
7101 token_info ptinfo_end_body, *ptinfo_end = &ptinfo_end_body;
7102 if (!p->token_info_enabled) return;
7103 if (!ptinfo_beg) return;
7104 token_info_setup(ptinfo_end, p->lex.pbeg, loc);
7105 if (ptinfo_beg->beg.lineno == ptinfo_end->beg.lineno) return; /* ignore one-line block */
7106 if (ptinfo_beg->nonspc || ptinfo_end->nonspc) return; /* ignore keyword in the middle of a line */
7107 if (ptinfo_beg->indent == ptinfo_end->indent) return; /* the indents are matched */
7108 if (!same && ptinfo_beg->indent < ptinfo_end->indent) return;
7109 rb_warn3L(ptinfo_end->beg.lineno,
7110 "mismatched indentations at '%s' with '%s' at %d",
7111 WARN_S(token), WARN_S(ptinfo_beg->token), WARN_I(ptinfo_beg->beg.lineno));
7112}
7113
7114static int
7115parser_precise_mbclen(struct parser_params *p, const char *ptr)
7116{
7117 int len = rb_enc_precise_mbclen(ptr, p->lex.pend, p->enc);
7118 if (!MBCLEN_CHARFOUND_P(len)) {
7119 compile_error(p, "invalid multibyte char (%s)", rb_enc_name(p->enc));
7120 return -1;
7121 }
7122 return len;
7123}
7124
7125#ifndef RIPPER
7126static inline void
7127parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc)
7128{
7129 rb_parser_string_t *str;
7130 int lineno = p->ruby_sourceline;
7131 if (!yylloc) {
7132 return;
7133 }
7134 else if (yylloc->beg_pos.lineno == lineno) {
7135 str = p->lex.lastline;
7136 }
7137 else {
7138 return;
7139 }
7140 ruby_show_error_line(p, p->error_buffer, yylloc, lineno, str);
7141}
7142
7143static int
7144parser_yyerror(struct parser_params *p, const rb_code_location_t *yylloc, const char *msg)
7145{
7146#if 0
7147 YYLTYPE current;
7148
7149 if (!yylloc) {
7150 yylloc = RUBY_SET_YYLLOC(current);
7151 }
7152 else if ((p->ruby_sourceline != yylloc->beg_pos.lineno &&
7153 p->ruby_sourceline != yylloc->end_pos.lineno)) {
7154 yylloc = 0;
7155 }
7156#endif
7157 parser_compile_error(p, yylloc, "%s", msg);
7158 parser_show_error_line(p, yylloc);
7159 return 0;
7160}
7161
7162static int
7163parser_yyerror0(struct parser_params *p, const char *msg)
7164{
7165 YYLTYPE current;
7166 return parser_yyerror(p, RUBY_SET_YYLLOC(current), msg);
7167}
7168
7169void
7170ruby_show_error_line(struct parser_params *p, VALUE errbuf, const YYLTYPE *yylloc, int lineno, rb_parser_string_t *str)
7171{
7172 VALUE mesg;
7173 const int max_line_margin = 30;
7174 const char *ptr, *ptr_end, *pt, *pb;
7175 const char *pre = "", *post = "", *pend;
7176 const char *code = "", *caret = "";
7177 const char *lim;
7178 const char *const pbeg = PARSER_STRING_PTR(str);
7179 char *buf;
7180 long len;
7181 int i;
7182
7183 if (!yylloc) return;
7184 pend = rb_parser_string_end(str);
7185 if (pend > pbeg && pend[-1] == '\n') {
7186 if (--pend > pbeg && pend[-1] == '\r') --pend;
7187 }
7188
7189 pt = pend;
7190 if (lineno == yylloc->end_pos.lineno &&
7191 (pend - pbeg) > yylloc->end_pos.column) {
7192 pt = pbeg + yylloc->end_pos.column;
7193 }
7194
7195 ptr = ptr_end = pt;
7196 lim = ptr - pbeg > max_line_margin ? ptr - max_line_margin : pbeg;
7197 while ((lim < ptr) && (*(ptr-1) != '\n')) ptr--;
7198
7199 lim = pend - ptr_end > max_line_margin ? ptr_end + max_line_margin : pend;
7200 while ((ptr_end < lim) && (*ptr_end != '\n') && (*ptr_end != '\r')) ptr_end++;
7201
7202 len = ptr_end - ptr;
7203 if (len > 4) {
7204 if (ptr > pbeg) {
7205 ptr = rb_enc_prev_char(pbeg, ptr, pt, rb_parser_str_get_encoding(str));
7206 if (ptr > pbeg) pre = "...";
7207 }
7208 if (ptr_end < pend) {
7209 ptr_end = rb_enc_prev_char(pt, ptr_end, pend, rb_parser_str_get_encoding(str));
7210 if (ptr_end < pend) post = "...";
7211 }
7212 }
7213 pb = pbeg;
7214 if (lineno == yylloc->beg_pos.lineno) {
7215 pb += yylloc->beg_pos.column;
7216 if (pb > pt) pb = pt;
7217 }
7218 if (pb < ptr) pb = ptr;
7219 if (len <= 4 && yylloc->beg_pos.lineno == yylloc->end_pos.lineno) {
7220 return;
7221 }
7222 if (RTEST(errbuf)) {
7223 mesg = rb_attr_get(errbuf, idMesg);
7224 if (char_at_end(p, mesg, '\n') != '\n')
7225 rb_str_cat_cstr(mesg, "\n");
7226 }
7227 else {
7228 mesg = rb_enc_str_new(0, 0, rb_parser_str_get_encoding(str));
7229 }
7230 if (!errbuf && rb_stderr_tty_p()) {
7231#define CSI_BEGIN "\033["
7232#define CSI_SGR "m"
7233 rb_str_catf(mesg,
7234 CSI_BEGIN""CSI_SGR"%s" /* pre */
7235 CSI_BEGIN"1"CSI_SGR"%.*s"
7236 CSI_BEGIN"1;4"CSI_SGR"%.*s"
7237 CSI_BEGIN";1"CSI_SGR"%.*s"
7238 CSI_BEGIN""CSI_SGR"%s" /* post */
7239 "\n",
7240 pre,
7241 (int)(pb - ptr), ptr,
7242 (int)(pt - pb), pb,
7243 (int)(ptr_end - pt), pt,
7244 post);
7245 }
7246 else {
7247 char *p2;
7248
7249 len = ptr_end - ptr;
7250 lim = pt < pend ? pt : pend;
7251 i = (int)(lim - ptr);
7252 buf = ALLOCA_N(char, i+2);
7253 code = ptr;
7254 caret = p2 = buf;
7255 if (ptr <= pb) {
7256 while (ptr < pb) {
7257 *p2++ = *ptr++ == '\t' ? '\t' : ' ';
7258 }
7259 *p2++ = '^';
7260 ptr++;
7261 }
7262 if (lim > ptr) {
7263 memset(p2, '~', (lim - ptr));
7264 p2 += (lim - ptr);
7265 }
7266 *p2 = '\0';
7267 rb_str_catf(mesg, "%s%.*s%s\n""%s%s\n",
7268 pre, (int)len, code, post,
7269 pre, caret);
7270 }
7271 if (!errbuf) rb_write_error_str(mesg);
7272}
7273#else
7274
7275static int
7276parser_yyerror(struct parser_params *p, const YYLTYPE *yylloc, const char *msg)
7277{
7278 const char *pcur = 0, *ptok = 0;
7279 if (p->ruby_sourceline == yylloc->beg_pos.lineno &&
7280 p->ruby_sourceline == yylloc->end_pos.lineno) {
7281 pcur = p->lex.pcur;
7282 ptok = p->lex.ptok;
7283 p->lex.ptok = p->lex.pbeg + yylloc->beg_pos.column;
7284 p->lex.pcur = p->lex.pbeg + yylloc->end_pos.column;
7285 }
7286 parser_yyerror0(p, msg);
7287 if (pcur) {
7288 p->lex.ptok = ptok;
7289 p->lex.pcur = pcur;
7290 }
7291 return 0;
7292}
7293
7294static int
7295parser_yyerror0(struct parser_params *p, const char *msg)
7296{
7297 dispatch1(parse_error, STR_NEW2(msg));
7298 ripper_error(p);
7299 return 0;
7300}
7301
7302static inline void
7303parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc)
7304{
7305}
7306#endif /* !RIPPER */
7307
7308static int
7309vtable_size(const struct vtable *tbl)
7310{
7311 if (!DVARS_TERMINAL_P(tbl)) {
7312 return tbl->pos;
7313 }
7314 else {
7315 return 0;
7316 }
7317}
7318
7319static struct vtable *
7320vtable_alloc_gen(struct parser_params *p, int line, struct vtable *prev)
7321{
7322 struct vtable *tbl = ALLOC(struct vtable);
7323 tbl->pos = 0;
7324 tbl->capa = 8;
7325 tbl->tbl = ALLOC_N(ID, tbl->capa);
7326 tbl->prev = prev;
7327#ifndef RIPPER
7328 if (p->debug) {
7329 rb_parser_printf(p, "vtable_alloc:%d: %p\n", line, (void *)tbl);
7330 }
7331#endif
7332 return tbl;
7333}
7334#define vtable_alloc(prev) vtable_alloc_gen(p, __LINE__, prev)
7335
7336static void
7337vtable_free_gen(struct parser_params *p, int line, const char *name,
7338 struct vtable *tbl)
7339{
7340#ifndef RIPPER
7341 if (p->debug) {
7342 rb_parser_printf(p, "vtable_free:%d: %s(%p)\n", line, name, (void *)tbl);
7343 }
7344#endif
7345 if (!DVARS_TERMINAL_P(tbl)) {
7346 if (tbl->tbl) {
7347 ruby_sized_xfree(tbl->tbl, tbl->capa * sizeof(ID));
7348 }
7349 ruby_sized_xfree(tbl, sizeof(*tbl));
7350 }
7351}
7352#define vtable_free(tbl) vtable_free_gen(p, __LINE__, #tbl, tbl)
7353
7354static void
7355vtable_add_gen(struct parser_params *p, int line, const char *name,
7356 struct vtable *tbl, ID id)
7357{
7358#ifndef RIPPER
7359 if (p->debug) {
7360 rb_parser_printf(p, "vtable_add:%d: %s(%p), %s\n",
7361 line, name, (void *)tbl, rb_id2name(id));
7362 }
7363#endif
7364 if (DVARS_TERMINAL_P(tbl)) {
7365 rb_parser_fatal(p, "vtable_add: vtable is not allocated (%p)", (void *)tbl);
7366 return;
7367 }
7368 if (tbl->pos == tbl->capa) {
7369 tbl->capa = tbl->capa * 2;
7370 SIZED_REALLOC_N(tbl->tbl, ID, tbl->capa, tbl->pos);
7371 }
7372 tbl->tbl[tbl->pos++] = id;
7373}
7374#define vtable_add(tbl, id) vtable_add_gen(p, __LINE__, #tbl, tbl, id)
7375
7376static void
7377vtable_pop_gen(struct parser_params *p, int line, const char *name,
7378 struct vtable *tbl, int n)
7379{
7380 if (p->debug) {
7381 rb_parser_printf(p, "vtable_pop:%d: %s(%p), %d\n",
7382 line, name, (void *)tbl, n);
7383 }
7384 if (tbl->pos < n) {
7385 rb_parser_fatal(p, "vtable_pop: unreachable (%d < %d)", tbl->pos, n);
7386 return;
7387 }
7388 tbl->pos -= n;
7389}
7390#define vtable_pop(tbl, n) vtable_pop_gen(p, __LINE__, #tbl, tbl, n)
7391
7392static int
7393vtable_included(const struct vtable * tbl, ID id)
7394{
7395 int i;
7396
7397 if (!DVARS_TERMINAL_P(tbl)) {
7398 for (i = 0; i < tbl->pos; i++) {
7399 if (tbl->tbl[i] == id) {
7400 return i+1;
7401 }
7402 }
7403 }
7404 return 0;
7405}
7406
7407static void parser_prepare(struct parser_params *p);
7408
7409static int
7410e_option_supplied(struct parser_params *p)
7411{
7412 return strcmp(p->ruby_sourcefile, "-e") == 0;
7413}
7414
7415#ifndef RIPPER
7416static NODE *parser_append_options(struct parser_params *p, NODE *node);
7417
7418static VALUE
7419yycompile0(VALUE arg)
7420{
7421 int n;
7422 NODE *tree;
7423 struct parser_params *p = (struct parser_params *)arg;
7424 int cov = FALSE;
7425
7426 if (!compile_for_eval && !NIL_P(p->ruby_sourcefile_string) && !e_option_supplied(p)) {
7427 cov = TRUE;
7428 }
7429
7430 if (p->debug_lines) {
7431 p->ast->body.script_lines = p->debug_lines;
7432 }
7433
7434 parser_prepare(p);
7435#define RUBY_DTRACE_PARSE_HOOK(name) \
7436 if (RUBY_DTRACE_PARSE_##name##_ENABLED()) { \
7437 RUBY_DTRACE_PARSE_##name(p->ruby_sourcefile, p->ruby_sourceline); \
7438 }
7439 RUBY_DTRACE_PARSE_HOOK(BEGIN);
7440 n = yyparse(p);
7441 RUBY_DTRACE_PARSE_HOOK(END);
7442
7443 p->debug_lines = 0;
7444
7445 xfree(p->lex.strterm);
7446 p->lex.strterm = 0;
7447 p->lex.pcur = p->lex.pbeg = p->lex.pend = 0;
7448 if (n || p->error_p) {
7449 VALUE mesg = p->error_buffer;
7450 if (!mesg) {
7451 mesg = syntax_error_new();
7452 }
7453 if (!p->error_tolerant) {
7454 rb_set_errinfo(mesg);
7455 return FALSE;
7456 }
7457 }
7458 tree = p->eval_tree;
7459 if (!tree) {
7460 tree = NEW_NIL(&NULL_LOC);
7461 }
7462 else {
7463 rb_parser_ary_t *tokens = p->tokens;
7464 NODE *prelude;
7465 NODE *body = parser_append_options(p, RNODE_SCOPE(tree)->nd_body);
7466 prelude = block_append(p, p->eval_tree_begin, body);
7467 RNODE_SCOPE(tree)->nd_body = prelude;
7468 p->ast->body.frozen_string_literal = p->frozen_string_literal;
7469 p->ast->body.coverage_enabled = cov;
7470 if (p->keep_tokens) {
7471 p->ast->node_buffer->tokens = tokens;
7472 p->tokens = NULL;
7473 }
7474 }
7475 p->ast->body.root = tree;
7476 p->ast->body.line_count = p->line_count;
7477 return TRUE;
7478}
7479
7480static rb_ast_t *
7481yycompile(struct parser_params *p, VALUE fname, int line)
7482{
7483 rb_ast_t *ast;
7484 if (NIL_P(fname)) {
7485 p->ruby_sourcefile_string = Qnil;
7486 p->ruby_sourcefile = "(none)";
7487 }
7488 else {
7489 p->ruby_sourcefile_string = rb_str_to_interned_str(fname);
7490 p->ruby_sourcefile = StringValueCStr(fname);
7491 }
7492 p->ruby_sourceline = line - 1;
7493
7494 p->lvtbl = NULL;
7495
7496 p->ast = ast = rb_ast_new();
7497 compile_callback(yycompile0, (VALUE)p);
7498 p->ast = 0;
7499
7500 while (p->lvtbl) {
7501 local_pop(p);
7502 }
7503
7504 return ast;
7505}
7506#endif /* !RIPPER */
7507
7508static rb_encoding *
7509must_be_ascii_compatible(struct parser_params *p, rb_parser_string_t *s)
7510{
7511 rb_encoding *enc = rb_parser_str_get_encoding(s);
7512 if (!rb_enc_asciicompat(enc)) {
7513 rb_raise(rb_eArgError, "invalid source encoding");
7514 }
7515 return enc;
7516}
7517
7518static rb_parser_string_t *
7519lex_getline(struct parser_params *p)
7520{
7521 rb_parser_string_t *line = (*p->lex.gets)(p, p->lex.input, p->line_count);
7522 if (!line) return 0;
7523 p->line_count++;
7524 string_buffer_append(p, line);
7525 must_be_ascii_compatible(p, line);
7526 return line;
7527}
7528
7529#ifndef RIPPER
7530rb_ast_t*
7531rb_parser_compile(rb_parser_t *p, rb_parser_lex_gets_func *gets, VALUE fname, rb_parser_input_data input, int line)
7532{
7533 p->lex.gets = gets;
7534 p->lex.input = input;
7535 p->lex.pbeg = p->lex.pcur = p->lex.pend = 0;
7536
7537 return yycompile(p, fname, line);
7538}
7539#endif /* !RIPPER */
7540
7541#define STR_FUNC_ESCAPE 0x01
7542#define STR_FUNC_EXPAND 0x02
7543#define STR_FUNC_REGEXP 0x04
7544#define STR_FUNC_QWORDS 0x08
7545#define STR_FUNC_SYMBOL 0x10
7546#define STR_FUNC_INDENT 0x20
7547#define STR_FUNC_LABEL 0x40
7548#define STR_FUNC_LIST 0x4000
7549#define STR_FUNC_TERM 0x8000
7550
7551enum string_type {
7552 str_label = STR_FUNC_LABEL,
7553 str_squote = (0),
7554 str_dquote = (STR_FUNC_EXPAND),
7555 str_xquote = (STR_FUNC_EXPAND),
7556 str_regexp = (STR_FUNC_REGEXP|STR_FUNC_ESCAPE|STR_FUNC_EXPAND),
7557 str_sword = (STR_FUNC_QWORDS|STR_FUNC_LIST),
7558 str_dword = (STR_FUNC_QWORDS|STR_FUNC_EXPAND|STR_FUNC_LIST),
7559 str_ssym = (STR_FUNC_SYMBOL),
7560 str_dsym = (STR_FUNC_SYMBOL|STR_FUNC_EXPAND)
7561};
7562
7563static rb_parser_string_t *
7564parser_str_new(struct parser_params *p, const char *ptr, long len, rb_encoding *enc, int func, rb_encoding *enc0)
7565{
7566 rb_parser_string_t *pstr;
7567
7568 pstr = rb_parser_encoding_string_new(p, ptr, len, enc);
7569
7570 if (!(func & STR_FUNC_REGEXP)) {
7571 if (rb_parser_is_ascii_string(p, pstr)) {
7572 }
7573 else if (rb_is_usascii_enc((void *)enc0) && enc != rb_utf8_encoding()) {
7574 /* everything is valid in ASCII-8BIT */
7575 enc = rb_ascii8bit_encoding();
7576 PARSER_ENCODING_CODERANGE_SET(pstr, enc, RB_PARSER_ENC_CODERANGE_VALID);
7577 }
7578 }
7579
7580 return pstr;
7581}
7582
7583static int
7584strterm_is_heredoc(rb_strterm_t *strterm)
7585{
7586 return strterm->heredoc;
7587}
7588
7589static rb_strterm_t *
7590new_strterm(struct parser_params *p, int func, int term, int paren)
7591{
7592 rb_strterm_t *strterm = ZALLOC(rb_strterm_t);
7593 strterm->u.literal.func = func;
7594 strterm->u.literal.term = term;
7595 strterm->u.literal.paren = paren;
7596 return strterm;
7597}
7598
7599static rb_strterm_t *
7600new_heredoc(struct parser_params *p)
7601{
7602 rb_strterm_t *strterm = ZALLOC(rb_strterm_t);
7603 strterm->heredoc = true;
7604 return strterm;
7605}
7606
7607#define peek(p,c) peek_n(p, (c), 0)
7608#define peek_n(p,c,n) (!lex_eol_n_p(p, n) && (c) == (unsigned char)(p)->lex.pcur[n])
7609#define peekc(p) peekc_n(p, 0)
7610#define peekc_n(p,n) (lex_eol_n_p(p, n) ? -1 : (unsigned char)(p)->lex.pcur[n])
7611
7612#define add_delayed_token(p, tok, end) parser_add_delayed_token(p, tok, end, __LINE__)
7613static void
7614parser_add_delayed_token(struct parser_params *p, const char *tok, const char *end, int line)
7615{
7616 debug_token_line(p, "add_delayed_token", line);
7617
7618 if (tok < end) {
7619 if (has_delayed_token(p)) {
7620 bool next_line = parser_string_char_at_end(p, p->delayed.token, 0) == '\n';
7621 int end_line = (next_line ? 1 : 0) + p->delayed.end_line;
7622 int end_col = (next_line ? 0 : p->delayed.end_col);
7623 if (end_line != p->ruby_sourceline || end_col != tok - p->lex.pbeg) {
7624 dispatch_delayed_token(p, tSTRING_CONTENT);
7625 }
7626 }
7627 if (!has_delayed_token(p)) {
7628 p->delayed.token = rb_parser_string_new(p, 0, 0);
7629 rb_parser_enc_associate(p, p->delayed.token, p->enc);
7630 p->delayed.beg_line = p->ruby_sourceline;
7631 p->delayed.beg_col = rb_long2int(tok - p->lex.pbeg);
7632 }
7633 parser_str_cat(p->delayed.token, tok, end - tok);
7634 p->delayed.end_line = p->ruby_sourceline;
7635 p->delayed.end_col = rb_long2int(end - p->lex.pbeg);
7636 p->lex.ptok = end;
7637 }
7638}
7639
7640static void
7641set_lastline(struct parser_params *p, rb_parser_string_t *str)
7642{
7643 p->lex.pbeg = p->lex.pcur = PARSER_STRING_PTR(str);
7644 p->lex.pend = p->lex.pcur + PARSER_STRING_LEN(str);
7645 p->lex.lastline = str;
7646}
7647
7648static int
7649nextline(struct parser_params *p, int set_encoding)
7650{
7651 rb_parser_string_t *str = p->lex.nextline;
7652 p->lex.nextline = 0;
7653 if (!str) {
7654 if (p->eofp)
7655 return -1;
7656
7657 if (!lex_eol_ptr_p(p, p->lex.pbeg) && *(p->lex.pend-1) != '\n') {
7658 goto end_of_input;
7659 }
7660
7661 if (!p->lex.input || !(str = lex_getline(p))) {
7662 end_of_input:
7663 p->eofp = 1;
7664 lex_goto_eol(p);
7665 return -1;
7666 }
7667#ifndef RIPPER
7668 if (p->debug_lines) {
7669 if (set_encoding) rb_parser_enc_associate(p, str, p->enc);
7670 rb_parser_string_t *copy = rb_parser_string_deep_copy(p, str);
7671 rb_parser_ary_push_script_line(p, p->debug_lines, copy);
7672 }
7673#endif
7674 p->cr_seen = FALSE;
7675 }
7676 else if (str == AFTER_HEREDOC_WITHOUT_TERMINATOR) {
7677 /* after here-document without terminator */
7678 goto end_of_input;
7679 }
7680 add_delayed_token(p, p->lex.ptok, p->lex.pend);
7681 if (p->heredoc_end > 0) {
7682 p->ruby_sourceline = p->heredoc_end;
7683 p->heredoc_end = 0;
7684 }
7685 p->ruby_sourceline++;
7686 set_lastline(p, str);
7687 token_flush(p);
7688 return 0;
7689}
7690
7691static int
7692parser_cr(struct parser_params *p, int c)
7693{
7694 if (peek(p, '\n')) {
7695 p->lex.pcur++;
7696 c = '\n';
7697 }
7698 return c;
7699}
7700
7701static inline int
7702nextc0(struct parser_params *p, int set_encoding)
7703{
7704 int c;
7705
7706 if (UNLIKELY(lex_eol_p(p) || p->eofp || p->lex.nextline > AFTER_HEREDOC_WITHOUT_TERMINATOR)) {
7707 if (nextline(p, set_encoding)) return -1;
7708 }
7709 c = (unsigned char)*p->lex.pcur++;
7710 if (UNLIKELY(c == '\r')) {
7711 c = parser_cr(p, c);
7712 }
7713
7714 return c;
7715}
7716#define nextc(p) nextc0(p, TRUE)
7717
7718static void
7719pushback(struct parser_params *p, int c)
7720{
7721 if (c == -1) return;
7722 p->eofp = 0;
7723 p->lex.pcur--;
7724 if (p->lex.pcur > p->lex.pbeg && p->lex.pcur[0] == '\n' && p->lex.pcur[-1] == '\r') {
7725 p->lex.pcur--;
7726 }
7727}
7728
7729#define was_bol(p) ((p)->lex.pcur == (p)->lex.pbeg + 1)
7730
7731#define tokfix(p) ((p)->tokenbuf[(p)->tokidx]='\0')
7732#define tok(p) (p)->tokenbuf
7733#define toklen(p) (p)->tokidx
7734
7735static int
7736looking_at_eol_p(struct parser_params *p)
7737{
7738 const char *ptr = p->lex.pcur;
7739 while (!lex_eol_ptr_p(p, ptr)) {
7740 int c = (unsigned char)*ptr++;
7741 int eol = (c == '\n' || c == '#');
7742 if (eol || !ISSPACE(c)) {
7743 return eol;
7744 }
7745 }
7746 return TRUE;
7747}
7748
7749static char*
7750newtok(struct parser_params *p)
7751{
7752 p->tokidx = 0;
7753 if (!p->tokenbuf) {
7754 p->toksiz = 60;
7755 p->tokenbuf = ALLOC_N(char, 60);
7756 }
7757 if (p->toksiz > 4096) {
7758 p->toksiz = 60;
7759 REALLOC_N(p->tokenbuf, char, 60);
7760 }
7761 return p->tokenbuf;
7762}
7763
7764static char *
7765tokspace(struct parser_params *p, int n)
7766{
7767 p->tokidx += n;
7768
7769 if (p->tokidx >= p->toksiz) {
7770 do {p->toksiz *= 2;} while (p->toksiz < p->tokidx);
7771 REALLOC_N(p->tokenbuf, char, p->toksiz);
7772 }
7773 return &p->tokenbuf[p->tokidx-n];
7774}
7775
7776static void
7777tokadd(struct parser_params *p, int c)
7778{
7779 p->tokenbuf[p->tokidx++] = (char)c;
7780 if (p->tokidx >= p->toksiz) {
7781 p->toksiz *= 2;
7782 REALLOC_N(p->tokenbuf, char, p->toksiz);
7783 }
7784}
7785
7786static int
7787tok_hex(struct parser_params *p, size_t *numlen)
7788{
7789 int c;
7790
7791 c = (int)ruby_scan_hex(p->lex.pcur, 2, numlen);
7792 if (!*numlen) {
7793 flush_string_content(p, p->enc, rb_strlen_lit("\\x"));
7794 yyerror0("invalid hex escape");
7795 dispatch_scan_event(p, tSTRING_CONTENT);
7796 return 0;
7797 }
7798 p->lex.pcur += *numlen;
7799 return c;
7800}
7801
7802#define tokcopy(p, n) memcpy(tokspace(p, n), (p)->lex.pcur - (n), (n))
7803
7804static int
7805escaped_control_code(int c)
7806{
7807 int c2 = 0;
7808 switch (c) {
7809 case ' ':
7810 c2 = 's';
7811 break;
7812 case '\n':
7813 c2 = 'n';
7814 break;
7815 case '\t':
7816 c2 = 't';
7817 break;
7818 case '\v':
7819 c2 = 'v';
7820 break;
7821 case '\r':
7822 c2 = 'r';
7823 break;
7824 case '\f':
7825 c2 = 'f';
7826 break;
7827 }
7828 return c2;
7829}
7830
7831#define WARN_SPACE_CHAR(c, prefix) \
7832 rb_warn1("invalid character syntax; use "prefix"\\%c", WARN_I(c))
7833
7834static int
7835tokadd_codepoint(struct parser_params *p, rb_encoding **encp,
7836 int regexp_literal, const char *begin)
7837{
7838 const int wide = !begin;
7839 size_t numlen;
7840 int codepoint = (int)ruby_scan_hex(p->lex.pcur, wide ? p->lex.pend - p->lex.pcur : 4, &numlen);
7841
7842 p->lex.pcur += numlen;
7843 if (p->lex.strterm == NULL ||
7844 strterm_is_heredoc(p->lex.strterm) ||
7845 (p->lex.strterm->u.literal.func != str_regexp)) {
7846 if (!begin) begin = p->lex.pcur;
7847 if (wide ? (numlen == 0 || numlen > 6) : (numlen < 4)) {
7848 flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin);
7849 yyerror0("invalid Unicode escape");
7850 dispatch_scan_event(p, tSTRING_CONTENT);
7851 return wide && numlen > 0;
7852 }
7853 if (codepoint > 0x10ffff) {
7854 flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin);
7855 yyerror0("invalid Unicode codepoint (too large)");
7856 dispatch_scan_event(p, tSTRING_CONTENT);
7857 return wide;
7858 }
7859 if ((codepoint & 0xfffff800) == 0xd800) {
7860 flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin);
7861 yyerror0("invalid Unicode codepoint");
7862 dispatch_scan_event(p, tSTRING_CONTENT);
7863 return wide;
7864 }
7865 }
7866 if (regexp_literal) {
7867 tokcopy(p, (int)numlen);
7868 }
7869 else if (codepoint >= 0x80) {
7870 rb_encoding *utf8 = rb_utf8_encoding();
7871 if (*encp && utf8 != *encp) {
7872 YYLTYPE loc = RUBY_INIT_YYLLOC();
7873 compile_error(p, "UTF-8 mixed within %s source", rb_enc_name(*encp));
7874 parser_show_error_line(p, &loc);
7875 return wide;
7876 }
7877 *encp = utf8;
7878 tokaddmbc(p, codepoint, *encp);
7879 }
7880 else {
7881 tokadd(p, codepoint);
7882 }
7883 return TRUE;
7884}
7885
7886static int tokadd_mbchar(struct parser_params *p, int c);
7887
7888static int
7889tokskip_mbchar(struct parser_params *p)
7890{
7891 int len = parser_precise_mbclen(p, p->lex.pcur-1);
7892 if (len > 0) {
7893 p->lex.pcur += len - 1;
7894 }
7895 return len;
7896}
7897
7898/* return value is for ?\u3042 */
7899static void
7900tokadd_utf8(struct parser_params *p, rb_encoding **encp,
7901 int term, int symbol_literal, int regexp_literal)
7902{
7903 /*
7904 * If `term` is not -1, then we allow multiple codepoints in \u{}
7905 * upto `term` byte, otherwise we're parsing a character literal.
7906 * And then add the codepoints to the current token.
7907 */
7908 static const char multiple_codepoints[] = "Multiple codepoints at single character literal";
7909
7910 const int open_brace = '{', close_brace = '}';
7911
7912 if (regexp_literal) { tokadd(p, '\\'); tokadd(p, 'u'); }
7913
7914 if (peek(p, open_brace)) { /* handle \u{...} form */
7915 if (regexp_literal && p->lex.strterm->u.literal.func == str_regexp) {
7916 /*
7917 * Skip parsing validation code and copy bytes as-is until term or
7918 * closing brace, in order to correctly handle extended regexps where
7919 * invalid unicode escapes are allowed in comments. The regexp parser
7920 * does its own validation and will catch any issues.
7921 */
7922 tokadd(p, open_brace);
7923 while (!lex_eol_ptr_p(p, ++p->lex.pcur)) {
7924 int c = peekc(p);
7925 if (c == close_brace) {
7926 tokadd(p, c);
7927 ++p->lex.pcur;
7928 break;
7929 }
7930 else if (c == term) {
7931 break;
7932 }
7933 if (c == '\\' && !lex_eol_n_p(p, 1)) {
7934 tokadd(p, c);
7935 c = *++p->lex.pcur;
7936 }
7937 tokadd_mbchar(p, c);
7938 }
7939 }
7940 else {
7941 const char *second = NULL;
7942 int c, last = nextc(p);
7943 if (lex_eol_p(p)) goto unterminated;
7944 while (ISSPACE(c = peekc(p)) && !lex_eol_ptr_p(p, ++p->lex.pcur));
7945 while (c != close_brace) {
7946 if (c == term) goto unterminated;
7947 if (second == multiple_codepoints)
7948 second = p->lex.pcur;
7949 if (regexp_literal) tokadd(p, last);
7950 if (!tokadd_codepoint(p, encp, regexp_literal, NULL)) {
7951 break;
7952 }
7953 while (ISSPACE(c = peekc(p))) {
7954 if (lex_eol_ptr_p(p, ++p->lex.pcur)) goto unterminated;
7955 last = c;
7956 }
7957 if (term == -1 && !second)
7958 second = multiple_codepoints;
7959 }
7960
7961 if (c != close_brace) {
7962 unterminated:
7963 flush_string_content(p, rb_utf8_encoding(), 0);
7964 yyerror0("unterminated Unicode escape");
7965 dispatch_scan_event(p, tSTRING_CONTENT);
7966 return;
7967 }
7968 if (second && second != multiple_codepoints) {
7969 const char *pcur = p->lex.pcur;
7970 p->lex.pcur = second;
7971 dispatch_scan_event(p, tSTRING_CONTENT);
7972 token_flush(p);
7973 p->lex.pcur = pcur;
7974 yyerror0(multiple_codepoints);
7975 token_flush(p);
7976 }
7977
7978 if (regexp_literal) tokadd(p, close_brace);
7979 nextc(p);
7980 }
7981 }
7982 else { /* handle \uxxxx form */
7983 if (!tokadd_codepoint(p, encp, regexp_literal, p->lex.pcur - rb_strlen_lit("\\u"))) {
7984 token_flush(p);
7985 return;
7986 }
7987 }
7988}
7989
7990#define ESCAPE_CONTROL 1
7991#define ESCAPE_META 2
7992
7993static int
7994read_escape(struct parser_params *p, int flags, const char *begin)
7995{
7996 int c;
7997 size_t numlen;
7998
7999 switch (c = nextc(p)) {
8000 case '\\': /* Backslash */
8001 return c;
8002
8003 case 'n': /* newline */
8004 return '\n';
8005
8006 case 't': /* horizontal tab */
8007 return '\t';
8008
8009 case 'r': /* carriage-return */
8010 return '\r';
8011
8012 case 'f': /* form-feed */
8013 return '\f';
8014
8015 case 'v': /* vertical tab */
8016 return '\13';
8017
8018 case 'a': /* alarm(bell) */
8019 return '\007';
8020
8021 case 'e': /* escape */
8022 return 033;
8023
8024 case '0': case '1': case '2': case '3': /* octal constant */
8025 case '4': case '5': case '6': case '7':
8026 pushback(p, c);
8027 c = (int)ruby_scan_oct(p->lex.pcur, 3, &numlen);
8028 p->lex.pcur += numlen;
8029 return c;
8030
8031 case 'x': /* hex constant */
8032 c = tok_hex(p, &numlen);
8033 if (numlen == 0) return 0;
8034 return c;
8035
8036 case 'b': /* backspace */
8037 return '\010';
8038
8039 case 's': /* space */
8040 return ' ';
8041
8042 case 'M':
8043 if (flags & ESCAPE_META) goto eof;
8044 if ((c = nextc(p)) != '-') {
8045 goto eof;
8046 }
8047 if ((c = nextc(p)) == '\\') {
8048 switch (peekc(p)) {
8049 case 'u': case 'U':
8050 nextc(p);
8051 goto eof;
8052 }
8053 return read_escape(p, flags|ESCAPE_META, begin) | 0x80;
8054 }
8055 else if (c == -1) goto eof;
8056 else if (!ISASCII(c)) {
8057 tokskip_mbchar(p);
8058 goto eof;
8059 }
8060 else {
8061 int c2 = escaped_control_code(c);
8062 if (c2) {
8063 if (ISCNTRL(c) || !(flags & ESCAPE_CONTROL)) {
8064 WARN_SPACE_CHAR(c2, "\\M-");
8065 }
8066 else {
8067 WARN_SPACE_CHAR(c2, "\\C-\\M-");
8068 }
8069 }
8070 else if (ISCNTRL(c)) goto eof;
8071 return ((c & 0xff) | 0x80);
8072 }
8073
8074 case 'C':
8075 if ((c = nextc(p)) != '-') {
8076 goto eof;
8077 }
8078 case 'c':
8079 if (flags & ESCAPE_CONTROL) goto eof;
8080 if ((c = nextc(p))== '\\') {
8081 switch (peekc(p)) {
8082 case 'u': case 'U':
8083 nextc(p);
8084 goto eof;
8085 }
8086 c = read_escape(p, flags|ESCAPE_CONTROL, begin);
8087 }
8088 else if (c == '?')
8089 return 0177;
8090 else if (c == -1) goto eof;
8091 else if (!ISASCII(c)) {
8092 tokskip_mbchar(p);
8093 goto eof;
8094 }
8095 else {
8096 int c2 = escaped_control_code(c);
8097 if (c2) {
8098 if (ISCNTRL(c)) {
8099 if (flags & ESCAPE_META) {
8100 WARN_SPACE_CHAR(c2, "\\M-");
8101 }
8102 else {
8103 WARN_SPACE_CHAR(c2, "");
8104 }
8105 }
8106 else {
8107 if (flags & ESCAPE_META) {
8108 WARN_SPACE_CHAR(c2, "\\M-\\C-");
8109 }
8110 else {
8111 WARN_SPACE_CHAR(c2, "\\C-");
8112 }
8113 }
8114 }
8115 else if (ISCNTRL(c)) goto eof;
8116 }
8117 return c & 0x9f;
8118
8119 eof:
8120 case -1:
8121 flush_string_content(p, p->enc, p->lex.pcur - begin);
8122 yyerror0("Invalid escape character syntax");
8123 dispatch_scan_event(p, tSTRING_CONTENT);
8124 return '\0';
8125
8126 default:
8127 if (!ISASCII(c)) {
8128 tokskip_mbchar(p);
8129 goto eof;
8130 }
8131 return c;
8132 }
8133}
8134
8135static void
8136tokaddmbc(struct parser_params *p, int c, rb_encoding *enc)
8137{
8138 int len = rb_enc_codelen(c, enc);
8139 rb_enc_mbcput(c, tokspace(p, len), enc);
8140}
8141
8142static int
8143tokadd_escape(struct parser_params *p)
8144{
8145 int c;
8146 size_t numlen;
8147 const char *begin = p->lex.pcur;
8148
8149 switch (c = nextc(p)) {
8150 case '\n':
8151 return 0; /* just ignore */
8152
8153 case '0': case '1': case '2': case '3': /* octal constant */
8154 case '4': case '5': case '6': case '7':
8155 {
8156 ruby_scan_oct(--p->lex.pcur, 3, &numlen);
8157 if (numlen == 0) goto eof;
8158 p->lex.pcur += numlen;
8159 tokcopy(p, (int)numlen + 1);
8160 }
8161 return 0;
8162
8163 case 'x': /* hex constant */
8164 {
8165 tok_hex(p, &numlen);
8166 if (numlen == 0) return -1;
8167 tokcopy(p, (int)numlen + 2);
8168 }
8169 return 0;
8170
8171 eof:
8172 case -1:
8173 flush_string_content(p, p->enc, p->lex.pcur - begin);
8174 yyerror0("Invalid escape character syntax");
8175 token_flush(p);
8176 return -1;
8177
8178 default:
8179 tokadd(p, '\\');
8180 tokadd(p, c);
8181 }
8182 return 0;
8183}
8184
8185static int
8186char_to_option(int c)
8187{
8188 int val;
8189
8190 switch (c) {
8191 case 'i':
8192 val = RE_ONIG_OPTION_IGNORECASE;
8193 break;
8194 case 'x':
8195 val = RE_ONIG_OPTION_EXTEND;
8196 break;
8197 case 'm':
8198 val = RE_ONIG_OPTION_MULTILINE;
8199 break;
8200 default:
8201 val = 0;
8202 break;
8203 }
8204 return val;
8205}
8206
8207#define ARG_ENCODING_FIXED 16
8208#define ARG_ENCODING_NONE 32
8209#define ENC_ASCII8BIT 1
8210#define ENC_EUC_JP 2
8211#define ENC_Windows_31J 3
8212#define ENC_UTF8 4
8213
8214static int
8215char_to_option_kcode(int c, int *option, int *kcode)
8216{
8217 *option = 0;
8218
8219 switch (c) {
8220 case 'n':
8221 *kcode = ENC_ASCII8BIT;
8222 return (*option = ARG_ENCODING_NONE);
8223 case 'e':
8224 *kcode = ENC_EUC_JP;
8225 break;
8226 case 's':
8227 *kcode = ENC_Windows_31J;
8228 break;
8229 case 'u':
8230 *kcode = ENC_UTF8;
8231 break;
8232 default:
8233 *kcode = -1;
8234 return (*option = char_to_option(c));
8235 }
8236 *option = ARG_ENCODING_FIXED;
8237 return 1;
8238}
8239
8240static int
8241regx_options(struct parser_params *p)
8242{
8243 int kcode = 0;
8244 int kopt = 0;
8245 int options = 0;
8246 int c, opt, kc;
8247
8248 newtok(p);
8249 while (c = nextc(p), ISALPHA(c)) {
8250 if (c == 'o') {
8251 options |= RE_OPTION_ONCE;
8252 }
8253 else if (char_to_option_kcode(c, &opt, &kc)) {
8254 if (kc >= 0) {
8255 if (kc != ENC_ASCII8BIT) kcode = c;
8256 kopt = opt;
8257 }
8258 else {
8259 options |= opt;
8260 }
8261 }
8262 else {
8263 tokadd(p, c);
8264 }
8265 }
8266 options |= kopt;
8267 pushback(p, c);
8268 if (toklen(p)) {
8269 YYLTYPE loc = RUBY_INIT_YYLLOC();
8270 tokfix(p);
8271 compile_error(p, "unknown regexp option%s - %*s",
8272 toklen(p) > 1 ? "s" : "", toklen(p), tok(p));
8273 parser_show_error_line(p, &loc);
8274 }
8275 return options | RE_OPTION_ENCODING(kcode);
8276}
8277
8278static int
8279tokadd_mbchar(struct parser_params *p, int c)
8280{
8281 int len = parser_precise_mbclen(p, p->lex.pcur-1);
8282 if (len < 0) return -1;
8283 tokadd(p, c);
8284 p->lex.pcur += --len;
8285 if (len > 0) tokcopy(p, len);
8286 return c;
8287}
8288
8289static inline int
8290simple_re_meta(int c)
8291{
8292 switch (c) {
8293 case '$': case '*': case '+': case '.':
8294 case '?': case '^': case '|':
8295 case ')': case ']': case '}': case '>':
8296 return TRUE;
8297 default:
8298 return FALSE;
8299 }
8300}
8301
8302static int
8303parser_update_heredoc_indent(struct parser_params *p, int c)
8304{
8305 if (p->heredoc_line_indent == -1) {
8306 if (c == '\n') p->heredoc_line_indent = 0;
8307 }
8308 else {
8309 if (c == ' ') {
8310 p->heredoc_line_indent++;
8311 return TRUE;
8312 }
8313 else if (c == '\t') {
8314 int w = (p->heredoc_line_indent / TAB_WIDTH) + 1;
8315 p->heredoc_line_indent = w * TAB_WIDTH;
8316 return TRUE;
8317 }
8318 else if (c != '\n') {
8319 if (p->heredoc_indent > p->heredoc_line_indent) {
8320 p->heredoc_indent = p->heredoc_line_indent;
8321 }
8322 p->heredoc_line_indent = -1;
8323 }
8324 else {
8325 /* Whitespace only line has no indentation */
8326 p->heredoc_line_indent = 0;
8327 }
8328 }
8329 return FALSE;
8330}
8331
8332static void
8333parser_mixed_error(struct parser_params *p, rb_encoding *enc1, rb_encoding *enc2)
8334{
8335 YYLTYPE loc = RUBY_INIT_YYLLOC();
8336 const char *n1 = rb_enc_name(enc1), *n2 = rb_enc_name(enc2);
8337 compile_error(p, "%s mixed within %s source", n1, n2);
8338 parser_show_error_line(p, &loc);
8339}
8340
8341static void
8342parser_mixed_escape(struct parser_params *p, const char *beg, rb_encoding *enc1, rb_encoding *enc2)
8343{
8344 const char *pos = p->lex.pcur;
8345 p->lex.pcur = beg;
8346 parser_mixed_error(p, enc1, enc2);
8347 p->lex.pcur = pos;
8348}
8349
8350static inline char
8351nibble_char_upper(unsigned int c)
8352{
8353 c &= 0xf;
8354 return c + (c < 10 ? '0' : 'A' - 10);
8355}
8356
8357static int
8358tokadd_string(struct parser_params *p,
8359 int func, int term, int paren, long *nest,
8360 rb_encoding **encp, rb_encoding **enc)
8361{
8362 int c;
8363 bool erred = false;
8364#ifdef RIPPER
8365 const int heredoc_end = (p->heredoc_end ? p->heredoc_end + 1 : 0);
8366 int top_of_line = FALSE;
8367#endif
8368
8369#define mixed_error(enc1, enc2) \
8370 (void)(erred || (parser_mixed_error(p, enc1, enc2), erred = true))
8371#define mixed_escape(beg, enc1, enc2) \
8372 (void)(erred || (parser_mixed_escape(p, beg, enc1, enc2), erred = true))
8373
8374 while ((c = nextc(p)) != -1) {
8375 if (p->heredoc_indent > 0) {
8376 parser_update_heredoc_indent(p, c);
8377 }
8378#ifdef RIPPER
8379 if (top_of_line && heredoc_end == p->ruby_sourceline) {
8380 pushback(p, c);
8381 break;
8382 }
8383#endif
8384
8385 if (paren && c == paren) {
8386 ++*nest;
8387 }
8388 else if (c == term) {
8389 if (!nest || !*nest) {
8390 pushback(p, c);
8391 break;
8392 }
8393 --*nest;
8394 }
8395 else if ((func & STR_FUNC_EXPAND) && c == '#' && !lex_eol_p(p)) {
8396 unsigned char c2 = *p->lex.pcur;
8397 if (c2 == '$' || c2 == '@' || c2 == '{') {
8398 pushback(p, c);
8399 break;
8400 }
8401 }
8402 else if (c == '\\') {
8403 c = nextc(p);
8404 switch (c) {
8405 case '\n':
8406 if (func & STR_FUNC_QWORDS) break;
8407 if (func & STR_FUNC_EXPAND) {
8408 if (!(func & STR_FUNC_INDENT) || (p->heredoc_indent < 0))
8409 continue;
8410 if (c == term) {
8411 c = '\\';
8412 goto terminate;
8413 }
8414 }
8415 tokadd(p, '\\');
8416 break;
8417
8418 case '\\':
8419 if (func & STR_FUNC_ESCAPE) tokadd(p, c);
8420 break;
8421
8422 case 'u':
8423 if ((func & STR_FUNC_EXPAND) == 0) {
8424 tokadd(p, '\\');
8425 break;
8426 }
8427 tokadd_utf8(p, enc, term,
8428 func & STR_FUNC_SYMBOL,
8429 func & STR_FUNC_REGEXP);
8430 continue;
8431
8432 default:
8433 if (c == -1) return -1;
8434 if (!ISASCII(c)) {
8435 if ((func & STR_FUNC_EXPAND) == 0) tokadd(p, '\\');
8436 goto non_ascii;
8437 }
8438 if (func & STR_FUNC_REGEXP) {
8439 switch (c) {
8440 case 'c':
8441 case 'C':
8442 case 'M': {
8443 pushback(p, c);
8444 c = read_escape(p, 0, p->lex.pcur - 1);
8445
8446 char *t = tokspace(p, rb_strlen_lit("\\x00"));
8447 *t++ = '\\';
8448 *t++ = 'x';
8449 *t++ = nibble_char_upper(c >> 4);
8450 *t++ = nibble_char_upper(c);
8451 continue;
8452 }
8453 }
8454
8455 if (c == term && !simple_re_meta(c)) {
8456 tokadd(p, c);
8457 continue;
8458 }
8459 pushback(p, c);
8460 if ((c = tokadd_escape(p)) < 0)
8461 return -1;
8462 if (*enc && *enc != *encp) {
8463 mixed_escape(p->lex.ptok+2, *enc, *encp);
8464 }
8465 continue;
8466 }
8467 else if (func & STR_FUNC_EXPAND) {
8468 pushback(p, c);
8469 if (func & STR_FUNC_ESCAPE) tokadd(p, '\\');
8470 c = read_escape(p, 0, p->lex.pcur - 1);
8471 }
8472 else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
8473 /* ignore backslashed spaces in %w */
8474 }
8475 else if (c != term && !(paren && c == paren)) {
8476 tokadd(p, '\\');
8477 pushback(p, c);
8478 continue;
8479 }
8480 }
8481 }
8482 else if (!parser_isascii(p)) {
8483 non_ascii:
8484 if (!*enc) {
8485 *enc = *encp;
8486 }
8487 else if (*enc != *encp) {
8488 mixed_error(*enc, *encp);
8489 continue;
8490 }
8491 if (tokadd_mbchar(p, c) == -1) return -1;
8492 continue;
8493 }
8494 else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
8495 pushback(p, c);
8496 break;
8497 }
8498 if (c & 0x80) {
8499 if (!*enc) {
8500 *enc = *encp;
8501 }
8502 else if (*enc != *encp) {
8503 mixed_error(*enc, *encp);
8504 continue;
8505 }
8506 }
8507 tokadd(p, c);
8508#ifdef RIPPER
8509 top_of_line = (c == '\n');
8510#endif
8511 }
8512 terminate:
8513 if (*enc) *encp = *enc;
8514 return c;
8515}
8516
8517#define NEW_STRTERM(func, term, paren) new_strterm(p, func, term, paren)
8518
8519static void
8520flush_string_content(struct parser_params *p, rb_encoding *enc, size_t back)
8521{
8522 p->lex.pcur -= back;
8523 if (has_delayed_token(p)) {
8524 ptrdiff_t len = p->lex.pcur - p->lex.ptok;
8525 if (len > 0) {
8526 rb_parser_enc_str_buf_cat(p, p->delayed.token, p->lex.ptok, len, enc);
8527 p->delayed.end_line = p->ruby_sourceline;
8528 p->delayed.end_col = rb_long2int(p->lex.pcur - p->lex.pbeg);
8529 }
8530 dispatch_delayed_token(p, tSTRING_CONTENT);
8531 p->lex.ptok = p->lex.pcur;
8532 }
8533 dispatch_scan_event(p, tSTRING_CONTENT);
8534 p->lex.pcur += back;
8535}
8536
8537/* this can be shared with ripper, since it's independent from struct
8538 * parser_params. */
8539#ifndef RIPPER
8540#define BIT(c, idx) (((c) / 32 - 1 == idx) ? (1U << ((c) % 32)) : 0)
8541#define SPECIAL_PUNCT(idx) ( \
8542 BIT('~', idx) | BIT('*', idx) | BIT('$', idx) | BIT('?', idx) | \
8543 BIT('!', idx) | BIT('@', idx) | BIT('/', idx) | BIT('\\', idx) | \
8544 BIT(';', idx) | BIT(',', idx) | BIT('.', idx) | BIT('=', idx) | \
8545 BIT(':', idx) | BIT('<', idx) | BIT('>', idx) | BIT('\"', idx) | \
8546 BIT('&', idx) | BIT('`', idx) | BIT('\'', idx) | BIT('+', idx) | \
8547 BIT('0', idx))
8548const uint_least32_t ruby_global_name_punct_bits[] = {
8549 SPECIAL_PUNCT(0),
8550 SPECIAL_PUNCT(1),
8551 SPECIAL_PUNCT(2),
8552};
8553#undef BIT
8554#undef SPECIAL_PUNCT
8555#endif
8556
8557static enum yytokentype
8558parser_peek_variable_name(struct parser_params *p)
8559{
8560 int c;
8561 const char *ptr = p->lex.pcur;
8562
8563 if (lex_eol_ptr_n_p(p, ptr, 1)) return 0;
8564 c = *ptr++;
8565 switch (c) {
8566 case '$':
8567 if ((c = *ptr) == '-') {
8568 if (lex_eol_ptr_p(p, ++ptr)) return 0;
8569 c = *ptr;
8570 }
8571 else if (is_global_name_punct(c) || ISDIGIT(c)) {
8572 return tSTRING_DVAR;
8573 }
8574 break;
8575 case '@':
8576 if ((c = *ptr) == '@') {
8577 if (lex_eol_ptr_p(p, ++ptr)) return 0;
8578 c = *ptr;
8579 }
8580 break;
8581 case '{':
8582 p->lex.pcur = ptr;
8583 p->command_start = TRUE;
8584 yylval.state = p->lex.state;
8585 return tSTRING_DBEG;
8586 default:
8587 return 0;
8588 }
8589 if (!ISASCII(c) || c == '_' || ISALPHA(c))
8590 return tSTRING_DVAR;
8591 return 0;
8592}
8593
8594#define IS_ARG() IS_lex_state(EXPR_ARG_ANY)
8595#define IS_END() IS_lex_state(EXPR_END_ANY)
8596#define IS_BEG() (IS_lex_state(EXPR_BEG_ANY) || IS_lex_state_all(EXPR_ARG|EXPR_LABELED))
8597#define IS_SPCARG(c) (IS_ARG() && space_seen && !ISSPACE(c))
8598#define IS_LABEL_POSSIBLE() (\
8599 (IS_lex_state(EXPR_LABEL|EXPR_ENDFN) && !cmd_state) || \
8600 IS_ARG())
8601#define IS_LABEL_SUFFIX(n) (peek_n(p, ':',(n)) && !peek_n(p, ':', (n)+1))
8602#define IS_AFTER_OPERATOR() IS_lex_state(EXPR_FNAME | EXPR_DOT)
8603
8604static inline enum yytokentype
8605parser_string_term(struct parser_params *p, int func)
8606{
8607 xfree(p->lex.strterm);
8608 p->lex.strterm = 0;
8609 if (func & STR_FUNC_REGEXP) {
8610 set_yylval_num(regx_options(p));
8611 dispatch_scan_event(p, tREGEXP_END);
8612 SET_LEX_STATE(EXPR_END);
8613 return tREGEXP_END;
8614 }
8615 if ((func & STR_FUNC_LABEL) && IS_LABEL_SUFFIX(0)) {
8616 nextc(p);
8617 SET_LEX_STATE(EXPR_ARG|EXPR_LABELED);
8618 return tLABEL_END;
8619 }
8620 SET_LEX_STATE(EXPR_END);
8621 return tSTRING_END;
8622}
8623
8624static enum yytokentype
8625parse_string(struct parser_params *p, rb_strterm_literal_t *quote)
8626{
8627 int func = quote->func;
8628 int term = quote->term;
8629 int paren = quote->paren;
8630 int c, space = 0;
8631 rb_encoding *enc = p->enc;
8632 rb_encoding *base_enc = 0;
8633 rb_parser_string_t *lit;
8634
8635 if (func & STR_FUNC_TERM) {
8636 if (func & STR_FUNC_QWORDS) nextc(p); /* delayed term */
8637 SET_LEX_STATE(EXPR_END);
8638 xfree(p->lex.strterm);
8639 p->lex.strterm = 0;
8640 return func & STR_FUNC_REGEXP ? tREGEXP_END : tSTRING_END;
8641 }
8642 c = nextc(p);
8643 if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
8644 while (c != '\n' && ISSPACE(c = nextc(p)));
8645 space = 1;
8646 }
8647 if (func & STR_FUNC_LIST) {
8648 quote->func &= ~STR_FUNC_LIST;
8649 space = 1;
8650 }
8651 if (c == term && !quote->nest) {
8652 if (func & STR_FUNC_QWORDS) {
8653 quote->func |= STR_FUNC_TERM;
8654 pushback(p, c); /* dispatch the term at tSTRING_END */
8655 add_delayed_token(p, p->lex.ptok, p->lex.pcur);
8656 return ' ';
8657 }
8658 return parser_string_term(p, func);
8659 }
8660 if (space) {
8661 if (!ISSPACE(c)) pushback(p, c);
8662 add_delayed_token(p, p->lex.ptok, p->lex.pcur);
8663 return ' ';
8664 }
8665 newtok(p);
8666 if ((func & STR_FUNC_EXPAND) && c == '#') {
8667 enum yytokentype t = parser_peek_variable_name(p);
8668 if (t) return t;
8669 tokadd(p, '#');
8670 c = nextc(p);
8671 }
8672 pushback(p, c);
8673 if (tokadd_string(p, func, term, paren, &quote->nest,
8674 &enc, &base_enc) == -1) {
8675 if (p->eofp) {
8676#ifndef RIPPER
8677# define unterminated_literal(mesg) yyerror0(mesg)
8678#else
8679# define unterminated_literal(mesg) compile_error(p, mesg)
8680#endif
8681 literal_flush(p, p->lex.pcur);
8682 if (func & STR_FUNC_QWORDS) {
8683 /* no content to add, bailing out here */
8684 unterminated_literal("unterminated list meets end of file");
8685 xfree(p->lex.strterm);
8686 p->lex.strterm = 0;
8687 return tSTRING_END;
8688 }
8689 if (func & STR_FUNC_REGEXP) {
8690 unterminated_literal("unterminated regexp meets end of file");
8691 }
8692 else {
8693 unterminated_literal("unterminated string meets end of file");
8694 }
8695 quote->func |= STR_FUNC_TERM;
8696 }
8697 }
8698
8699 tokfix(p);
8700 lit = STR_NEW3(tok(p), toklen(p), enc, func);
8701 set_yylval_str(lit);
8702 flush_string_content(p, enc, 0);
8703
8704 return tSTRING_CONTENT;
8705}
8706
8707static enum yytokentype
8708heredoc_identifier(struct parser_params *p)
8709{
8710 /*
8711 * term_len is length of `<<"END"` except `END`,
8712 * in this case term_len is 4 (<, <, " and ").
8713 */
8714 long len, offset = p->lex.pcur - p->lex.pbeg;
8715 int c = nextc(p), term, func = 0, quote = 0;
8716 enum yytokentype token = tSTRING_BEG;
8717 int indent = 0;
8718
8719 if (c == '-') {
8720 c = nextc(p);
8721 func = STR_FUNC_INDENT;
8722 offset++;
8723 }
8724 else if (c == '~') {
8725 c = nextc(p);
8726 func = STR_FUNC_INDENT;
8727 offset++;
8728 indent = INT_MAX;
8729 }
8730 switch (c) {
8731 case '\'':
8732 func |= str_squote; goto quoted;
8733 case '"':
8734 func |= str_dquote; goto quoted;
8735 case '`':
8736 token = tXSTRING_BEG;
8737 func |= str_xquote; goto quoted;
8738
8739 quoted:
8740 quote++;
8741 offset++;
8742 term = c;
8743 len = 0;
8744 while ((c = nextc(p)) != term) {
8745 if (c == -1 || c == '\r' || c == '\n') {
8746 yyerror0("unterminated here document identifier");
8747 return -1;
8748 }
8749 }
8750 break;
8751
8752 default:
8753 if (!parser_is_identchar(p)) {
8754 pushback(p, c);
8755 if (func & STR_FUNC_INDENT) {
8756 pushback(p, indent > 0 ? '~' : '-');
8757 }
8758 return 0;
8759 }
8760 func |= str_dquote;
8761 do {
8762 int n = parser_precise_mbclen(p, p->lex.pcur-1);
8763 if (n < 0) return 0;
8764 p->lex.pcur += --n;
8765 } while ((c = nextc(p)) != -1 && parser_is_identchar(p));
8766 pushback(p, c);
8767 break;
8768 }
8769
8770 len = p->lex.pcur - (p->lex.pbeg + offset) - quote;
8771 if ((unsigned long)len >= HERETERM_LENGTH_MAX)
8772 yyerror0("too long here document identifier");
8773 dispatch_scan_event(p, tHEREDOC_BEG);
8774 lex_goto_eol(p);
8775
8776 p->lex.strterm = new_heredoc(p);
8777 rb_strterm_heredoc_t *here = &p->lex.strterm->u.heredoc;
8778 here->offset = offset;
8779 here->sourceline = p->ruby_sourceline;
8780 here->length = (unsigned)len;
8781 here->quote = quote;
8782 here->func = func;
8783 here->lastline = p->lex.lastline;
8784
8785 token_flush(p);
8786 p->heredoc_indent = indent;
8787 p->heredoc_line_indent = 0;
8788 return token;
8789}
8790
8791static void
8792heredoc_restore(struct parser_params *p, rb_strterm_heredoc_t *here)
8793{
8794 rb_parser_string_t *line;
8795 rb_strterm_t *term = p->lex.strterm;
8796
8797 p->lex.strterm = 0;
8798 line = here->lastline;
8799 p->lex.lastline = line;
8800 p->lex.pbeg = PARSER_STRING_PTR(line);
8801 p->lex.pend = p->lex.pbeg + PARSER_STRING_LEN(line);
8802 p->lex.pcur = p->lex.pbeg + here->offset + here->length + here->quote;
8803 p->lex.ptok = p->lex.pbeg + here->offset - here->quote;
8804 p->heredoc_end = p->ruby_sourceline;
8805 p->ruby_sourceline = (int)here->sourceline;
8806 if (p->eofp) p->lex.nextline = AFTER_HEREDOC_WITHOUT_TERMINATOR;
8807 p->eofp = 0;
8808 xfree(term);
8809}
8810
8811static int
8812dedent_string_column(const char *str, long len, int width)
8813{
8814 int i, col = 0;
8815
8816 for (i = 0; i < len && col < width; i++) {
8817 if (str[i] == ' ') {
8818 col++;
8819 }
8820 else if (str[i] == '\t') {
8821 int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
8822 if (n > width) break;
8823 col = n;
8824 }
8825 else {
8826 break;
8827 }
8828 }
8829
8830 return i;
8831}
8832
8833static int
8834dedent_string(struct parser_params *p, rb_parser_string_t *string, int width)
8835{
8836 char *str;
8837 long len;
8838 int i;
8839
8840 len = PARSER_STRING_LEN(string);
8841 str = PARSER_STRING_PTR(string);
8842
8843 i = dedent_string_column(str, len, width);
8844 if (!i) return 0;
8845
8846 rb_parser_str_modify(string);
8847 str = PARSER_STRING_PTR(string);
8848 if (PARSER_STRING_LEN(string) != len)
8849 rb_fatal("literal string changed: %s", PARSER_STRING_PTR(string));
8850 MEMMOVE(str, str + i, char, len - i);
8851 rb_parser_str_set_len(p, string, len - i);
8852 return i;
8853}
8854
8855static NODE *
8856heredoc_dedent(struct parser_params *p, NODE *root)
8857{
8858 NODE *node, *str_node, *prev_node;
8859 int indent = p->heredoc_indent;
8860 rb_parser_string_t *prev_lit = 0;
8861
8862 if (indent <= 0) return root;
8863 if (!root) return root;
8864
8865 prev_node = node = str_node = root;
8866 if (nd_type_p(root, NODE_LIST)) str_node = RNODE_LIST(root)->nd_head;
8867
8868 while (str_node) {
8869 rb_parser_string_t *lit = RNODE_STR(str_node)->string;
8870 if (nd_fl_newline(str_node)) {
8871 dedent_string(p, lit, indent);
8872 }
8873 if (!prev_lit) {
8874 prev_lit = lit;
8875 }
8876 else if (!literal_concat0(p, prev_lit, lit)) {
8877 return 0;
8878 }
8879 else {
8880 NODE *end = RNODE_LIST(node)->as.nd_end;
8881 node = RNODE_LIST(prev_node)->nd_next = RNODE_LIST(node)->nd_next;
8882 if (!node) {
8883 if (nd_type_p(prev_node, NODE_DSTR))
8884 nd_set_type(prev_node, NODE_STR);
8885 break;
8886 }
8887 RNODE_LIST(node)->as.nd_end = end;
8888 goto next_str;
8889 }
8890
8891 str_node = 0;
8892 while ((nd_type_p(node, NODE_LIST) || nd_type_p(node, NODE_DSTR)) && (node = RNODE_LIST(prev_node = node)->nd_next) != 0) {
8893 next_str:
8894 if (!nd_type_p(node, NODE_LIST)) break;
8895 if ((str_node = RNODE_LIST(node)->nd_head) != 0) {
8896 enum node_type type = nd_type(str_node);
8897 if (type == NODE_STR || type == NODE_DSTR) break;
8898 prev_lit = 0;
8899 str_node = 0;
8900 }
8901 }
8902 }
8903 return root;
8904}
8905
8906static int
8907whole_match_p(struct parser_params *p, const char *eos, long len, int indent)
8908{
8909 const char *beg = p->lex.pbeg;
8910 const char *ptr = p->lex.pend;
8911
8912 if (ptr - beg < len) return FALSE;
8913 if (ptr > beg && ptr[-1] == '\n') {
8914 if (--ptr > beg && ptr[-1] == '\r') --ptr;
8915 if (ptr - beg < len) return FALSE;
8916 }
8917 if (strncmp(eos, ptr -= len, len)) return FALSE;
8918 if (indent) {
8919 while (beg < ptr && ISSPACE(*beg)) beg++;
8920 }
8921 return beg == ptr;
8922}
8923
8924static int
8925word_match_p(struct parser_params *p, const char *word, long len)
8926{
8927 if (strncmp(p->lex.pcur, word, len)) return 0;
8928 if (lex_eol_n_p(p, len)) return 1;
8929 int c = (unsigned char)p->lex.pcur[len];
8930 if (ISSPACE(c)) return 1;
8931 switch (c) {
8932 case '\0': case '\004': case '\032': return 1;
8933 }
8934 return 0;
8935}
8936
8937#define NUM_SUFFIX_R (1<<0)
8938#define NUM_SUFFIX_I (1<<1)
8939#define NUM_SUFFIX_ALL 3
8940
8941static int
8942number_literal_suffix(struct parser_params *p, int mask)
8943{
8944 int c, result = 0;
8945 const char *lastp = p->lex.pcur;
8946
8947 while ((c = nextc(p)) != -1) {
8948 if ((mask & NUM_SUFFIX_I) && c == 'i') {
8949 result |= (mask & NUM_SUFFIX_I);
8950 mask &= ~NUM_SUFFIX_I;
8951 /* r after i, rational of complex is disallowed */
8952 mask &= ~NUM_SUFFIX_R;
8953 continue;
8954 }
8955 if ((mask & NUM_SUFFIX_R) && c == 'r') {
8956 result |= (mask & NUM_SUFFIX_R);
8957 mask &= ~NUM_SUFFIX_R;
8958 continue;
8959 }
8960 if (!ISASCII(c) || ISALPHA(c) || c == '_') {
8961 p->lex.pcur = lastp;
8962 return 0;
8963 }
8964 pushback(p, c);
8965 break;
8966 }
8967 return result;
8968}
8969
8970static enum yytokentype
8971set_number_literal(struct parser_params *p, enum yytokentype type, int suffix, int base, int seen_point)
8972{
8973 enum rb_numeric_type numeric_type = integer_literal;
8974
8975 if (type == tFLOAT) {
8976 numeric_type = float_literal;
8977 }
8978
8979 if (suffix & NUM_SUFFIX_R) {
8980 type = tRATIONAL;
8981 numeric_type = rational_literal;
8982 }
8983 if (suffix & NUM_SUFFIX_I) {
8984 type = tIMAGINARY;
8985 }
8986
8987 switch (type) {
8988 case tINTEGER:
8989 set_yylval_node(NEW_INTEGER(strdup(tok(p)), base, &_cur_loc));
8990 break;
8991 case tFLOAT:
8992 set_yylval_node(NEW_FLOAT(strdup(tok(p)), &_cur_loc));
8993 break;
8994 case tRATIONAL:
8995 set_yylval_node(NEW_RATIONAL(strdup(tok(p)), base, seen_point, &_cur_loc));
8996 break;
8997 case tIMAGINARY:
8998 set_yylval_node(NEW_IMAGINARY(strdup(tok(p)), base, seen_point, numeric_type, &_cur_loc));
8999 (void)numeric_type; /* for ripper */
9000 break;
9001 default:
9002 rb_bug("unexpected token: %d", type);
9003 }
9004 SET_LEX_STATE(EXPR_END);
9005 return type;
9006}
9007
9008#define dispatch_heredoc_end(p) parser_dispatch_heredoc_end(p, __LINE__)
9009static void
9010parser_dispatch_heredoc_end(struct parser_params *p, int line)
9011{
9012 if (has_delayed_token(p))
9013 dispatch_delayed_token(p, tSTRING_CONTENT);
9014
9015#ifdef RIPPER
9016 VALUE str = STR_NEW(p->lex.ptok, p->lex.pend - p->lex.ptok);
9017 ripper_dispatch1(p, ripper_token2eventid(tHEREDOC_END), str);
9018#else
9019 if (p->keep_tokens) {
9020 rb_parser_string_t *str = rb_parser_encoding_string_new(p, p->lex.ptok, p->lex.pend - p->lex.ptok, p->enc);
9021 RUBY_SET_YYLLOC_OF_HEREDOC_END(*p->yylloc);
9022 parser_append_tokens(p, str, tHEREDOC_END, line);
9023 }
9024#endif
9025
9026 RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(*p->yylloc);
9027 lex_goto_eol(p);
9028 token_flush(p);
9029}
9030
9031static enum yytokentype
9032here_document(struct parser_params *p, rb_strterm_heredoc_t *here)
9033{
9034 int c, func, indent = 0;
9035 const char *eos, *ptr, *ptr_end;
9036 long len;
9037 rb_parser_string_t *str = 0;
9038 rb_encoding *enc = p->enc;
9039 rb_encoding *base_enc = 0;
9040 int bol;
9041#ifdef RIPPER
9042 VALUE s_value;
9043#endif
9044
9045 eos = PARSER_STRING_PTR(here->lastline) + here->offset;
9046 len = here->length;
9047 indent = (func = here->func) & STR_FUNC_INDENT;
9048
9049 if ((c = nextc(p)) == -1) {
9050 error:
9051#ifdef RIPPER
9052 if (!has_delayed_token(p)) {
9053 dispatch_scan_event(p, tSTRING_CONTENT);
9054 }
9055 else if (p->delayed.end_line + 1 == p->ruby_sourceline) {
9056 if ((len = p->lex.pcur - p->lex.ptok) > 0) {
9057 if (!(func & STR_FUNC_REGEXP)) {
9058 int cr = ENC_CODERANGE_UNKNOWN;
9059 rb_str_coderange_scan_restartable(p->lex.ptok, p->lex.pcur, enc, &cr);
9060 if (cr != ENC_CODERANGE_7BIT &&
9061 rb_is_usascii_enc(p->enc) &&
9062 enc != rb_utf8_encoding()) {
9063 enc = rb_ascii8bit_encoding();
9064 }
9065 }
9066 rb_parser_enc_str_buf_cat(p, p->delayed.token, p->lex.ptok, len, enc);
9067 }
9068 dispatch_delayed_token(p, tSTRING_CONTENT);
9069 }
9070 else {
9071 dispatch_delayed_token(p, tSTRING_CONTENT);
9072 dispatch_scan_event(p, tSTRING_CONTENT);
9073 }
9074 lex_goto_eol(p);
9075#endif
9076 heredoc_restore(p, &p->lex.strterm->u.heredoc);
9077 compile_error(p, "can't find string \"%.*s\" anywhere before EOF",
9078 (int)len, eos);
9079 token_flush(p);
9080 SET_LEX_STATE(EXPR_END);
9081 return tSTRING_END;
9082 }
9083 bol = was_bol(p);
9084 if (!bol) {
9085 /* not beginning of line, cannot be the terminator */
9086 }
9087 else if (p->heredoc_line_indent == -1) {
9088 /* `heredoc_line_indent == -1` means
9089 * - "after an interpolation in the same line", or
9090 * - "in a continuing line"
9091 */
9092 p->heredoc_line_indent = 0;
9093 }
9094 else if (whole_match_p(p, eos, len, indent)) {
9095 dispatch_heredoc_end(p);
9096 restore:
9097 heredoc_restore(p, &p->lex.strterm->u.heredoc);
9098 token_flush(p);
9099 SET_LEX_STATE(EXPR_END);
9100 return tSTRING_END;
9101 }
9102
9103 if (!(func & STR_FUNC_EXPAND)) {
9104 do {
9105 ptr = PARSER_STRING_PTR(p->lex.lastline);
9106 ptr_end = p->lex.pend;
9107 if (ptr_end > ptr) {
9108 switch (ptr_end[-1]) {
9109 case '\n':
9110 if (--ptr_end == ptr || ptr_end[-1] != '\r') {
9111 ptr_end++;
9112 break;
9113 }
9114 case '\r':
9115 --ptr_end;
9116 }
9117 }
9118
9119 if (p->heredoc_indent > 0) {
9120 long i = 0;
9121 while (ptr + i < ptr_end && parser_update_heredoc_indent(p, ptr[i]))
9122 i++;
9123 p->heredoc_line_indent = 0;
9124 }
9125
9126 if (str)
9127 parser_str_cat(str, ptr, ptr_end - ptr);
9128 else
9129 str = rb_parser_encoding_string_new(p, ptr, ptr_end - ptr, enc);
9130 if (!lex_eol_ptr_p(p, ptr_end)) parser_str_cat_cstr(str, "\n");
9131 lex_goto_eol(p);
9132 if (p->heredoc_indent > 0) {
9133 goto flush_str;
9134 }
9135 if (nextc(p) == -1) {
9136 if (str) {
9137 rb_parser_string_free(p, str);
9138 str = 0;
9139 }
9140 goto error;
9141 }
9142 } while (!whole_match_p(p, eos, len, indent));
9143 }
9144 else {
9145 /* int mb = ENC_CODERANGE_7BIT, *mbp = &mb;*/
9146 newtok(p);
9147 if (c == '#') {
9148 enum yytokentype t = parser_peek_variable_name(p);
9149 if (p->heredoc_line_indent != -1) {
9150 if (p->heredoc_indent > p->heredoc_line_indent) {
9151 p->heredoc_indent = p->heredoc_line_indent;
9152 }
9153 p->heredoc_line_indent = -1;
9154 }
9155 if (t) return t;
9156 tokadd(p, '#');
9157 c = nextc(p);
9158 }
9159 do {
9160 pushback(p, c);
9161 enc = p->enc;
9162 if ((c = tokadd_string(p, func, '\n', 0, NULL, &enc, &base_enc)) == -1) {
9163 if (p->eofp) goto error;
9164 goto restore;
9165 }
9166 if (c != '\n') {
9167 if (c == '\\') p->heredoc_line_indent = -1;
9168 flush:
9169 str = STR_NEW3(tok(p), toklen(p), enc, func);
9170 flush_str:
9171 set_yylval_str(str);
9172#ifndef RIPPER
9173 if (bol) nd_set_fl_newline(yylval.node);
9174#endif
9175 flush_string_content(p, enc, 0);
9176 return tSTRING_CONTENT;
9177 }
9178 tokadd(p, nextc(p));
9179 if (p->heredoc_indent > 0) {
9180 lex_goto_eol(p);
9181 goto flush;
9182 }
9183 /* if (mbp && mb == ENC_CODERANGE_UNKNOWN) mbp = 0;*/
9184 if ((c = nextc(p)) == -1) goto error;
9185 } while (!whole_match_p(p, eos, len, indent));
9186 str = STR_NEW3(tok(p), toklen(p), enc, func);
9187 }
9188 dispatch_heredoc_end(p);
9189 heredoc_restore(p, &p->lex.strterm->u.heredoc);
9190 token_flush(p);
9191 p->lex.strterm = NEW_STRTERM(func | STR_FUNC_TERM, 0, 0);
9192#ifdef RIPPER
9193 /* Preserve s_value for set_yylval_str */
9194 s_value = p->s_value;
9195#endif
9196 set_yylval_str(str);
9197#ifdef RIPPER
9198 set_parser_s_value(s_value);
9199#endif
9200
9201#ifndef RIPPER
9202 if (bol) nd_set_fl_newline(yylval.node);
9203#endif
9204 return tSTRING_CONTENT;
9205}
9206
9207#include "lex.c"
9208
9209static int
9210arg_ambiguous(struct parser_params *p, char c)
9211{
9212#ifndef RIPPER
9213 if (c == '/') {
9214 rb_warning1("ambiguity between regexp and two divisions: wrap regexp in parentheses or add a space after '%c' operator", WARN_I(c));
9215 }
9216 else {
9217 rb_warning1("ambiguous first argument; put parentheses or a space even after '%c' operator", WARN_I(c));
9218 }
9219#else
9220 dispatch1(arg_ambiguous, rb_usascii_str_new(&c, 1));
9221#endif
9222 return TRUE;
9223}
9224
9225/* returns true value if formal argument error;
9226 * Qtrue, or error message if ripper */
9227static VALUE
9228formal_argument_error(struct parser_params *p, ID id)
9229{
9230 switch (id_type(id)) {
9231 case ID_LOCAL:
9232 break;
9233#ifndef RIPPER
9234# define ERR(mesg) (yyerror0(mesg), Qtrue)
9235#else
9236# define ERR(mesg) WARN_S(mesg)
9237#endif
9238 case ID_CONST:
9239 return ERR("formal argument cannot be a constant");
9240 case ID_INSTANCE:
9241 return ERR("formal argument cannot be an instance variable");
9242 case ID_GLOBAL:
9243 return ERR("formal argument cannot be a global variable");
9244 case ID_CLASS:
9245 return ERR("formal argument cannot be a class variable");
9246 default:
9247 return ERR("formal argument must be local variable");
9248#undef ERR
9249 }
9250 shadowing_lvar(p, id);
9251
9252 return Qfalse;
9253}
9254
9255static int
9256lvar_defined(struct parser_params *p, ID id)
9257{
9258 return (dyna_in_block(p) && dvar_defined(p, id)) || local_id(p, id);
9259}
9260
9261/* emacsen -*- hack */
9262static long
9263parser_encode_length(struct parser_params *p, const char *name, long len)
9264{
9265 long nlen;
9266
9267 if (len > 5 && name[nlen = len - 5] == '-') {
9268 if (rb_memcicmp(name + nlen + 1, "unix", 4) == 0)
9269 return nlen;
9270 }
9271 if (len > 4 && name[nlen = len - 4] == '-') {
9272 if (rb_memcicmp(name + nlen + 1, "dos", 3) == 0)
9273 return nlen;
9274 if (rb_memcicmp(name + nlen + 1, "mac", 3) == 0 &&
9275 !(len == 8 && rb_memcicmp(name, "utf8-mac", len) == 0))
9276 /* exclude UTF8-MAC because the encoding named "UTF8" doesn't exist in Ruby */
9277 return nlen;
9278 }
9279 return len;
9280}
9281
9282static void
9283parser_set_encode(struct parser_params *p, const char *name)
9284{
9285 rb_encoding *enc;
9286 VALUE excargs[3];
9287 int idx = 0;
9288
9289 const char *wrong = 0;
9290 switch (*name) {
9291 case 'e': case 'E': wrong = "external"; break;
9292 case 'i': case 'I': wrong = "internal"; break;
9293 case 'f': case 'F': wrong = "filesystem"; break;
9294 case 'l': case 'L': wrong = "locale"; break;
9295 }
9296 if (wrong && STRCASECMP(name, wrong) == 0) goto unknown;
9297 idx = rb_enc_find_index(name);
9298 if (idx < 0) {
9299 unknown:
9300 excargs[1] = rb_sprintf("unknown encoding name: %s", name);
9301 error:
9302 excargs[0] = rb_eArgError;
9303 excargs[2] = rb_make_backtrace();
9304 rb_ary_unshift(excargs[2], rb_sprintf("%"PRIsVALUE":%d", p->ruby_sourcefile_string, p->ruby_sourceline));
9305 VALUE exc = rb_make_exception(3, excargs);
9306 ruby_show_error_line(p, exc, &(YYLTYPE)RUBY_INIT_YYLLOC(), p->ruby_sourceline, p->lex.lastline);
9307
9308 rb_ast_free(p->ast);
9309 p->ast = NULL;
9310
9311 rb_exc_raise(exc);
9312 }
9313 enc = rb_enc_from_index(idx);
9314 if (!rb_enc_asciicompat(enc)) {
9315 excargs[1] = rb_sprintf("%s is not ASCII compatible", rb_enc_name(enc));
9316 goto error;
9317 }
9318 p->enc = enc;
9319#ifndef RIPPER
9320 if (p->debug_lines) {
9321 long i;
9322 for (i = 0; i < p->debug_lines->len; i++) {
9323 rb_parser_enc_associate(p, p->debug_lines->data[i], enc);
9324 }
9325 }
9326#endif
9327}
9328
9329static bool
9330comment_at_top(struct parser_params *p)
9331{
9332 if (p->token_seen) return false;
9333 return (p->line_count == (p->has_shebang ? 2 : 1));
9334}
9335
9336typedef long (*rb_magic_comment_length_t)(struct parser_params *p, const char *name, long len);
9337typedef void (*rb_magic_comment_setter_t)(struct parser_params *p, const char *name, const char *val);
9338
9339static int parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val);
9340
9341static void
9342magic_comment_encoding(struct parser_params *p, const char *name, const char *val)
9343{
9344 if (!comment_at_top(p)) {
9345 return;
9346 }
9347 parser_set_encode(p, val);
9348}
9349
9350static int
9351parser_get_bool(struct parser_params *p, const char *name, const char *val)
9352{
9353 switch (*val) {
9354 case 't': case 'T':
9355 if (STRCASECMP(val, "true") == 0) {
9356 return TRUE;
9357 }
9358 break;
9359 case 'f': case 'F':
9360 if (STRCASECMP(val, "false") == 0) {
9361 return FALSE;
9362 }
9363 break;
9364 }
9365 return parser_invalid_pragma_value(p, name, val);
9366}
9367
9368static int
9369parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val)
9370{
9371 rb_warning2("invalid value for %s: %s", WARN_S(name), WARN_S(val));
9372 return -1;
9373}
9374
9375static void
9376parser_set_token_info(struct parser_params *p, const char *name, const char *val)
9377{
9378 int b = parser_get_bool(p, name, val);
9379 if (b >= 0) p->token_info_enabled = b;
9380}
9381
9382static void
9383parser_set_frozen_string_literal(struct parser_params *p, const char *name, const char *val)
9384{
9385 int b;
9386
9387 if (p->token_seen) {
9388 rb_warning1("'%s' is ignored after any tokens", WARN_S(name));
9389 return;
9390 }
9391
9392 b = parser_get_bool(p, name, val);
9393 if (b < 0) return;
9394
9395 p->frozen_string_literal = b;
9396}
9397
9398static void
9399parser_set_shareable_constant_value(struct parser_params *p, const char *name, const char *val)
9400{
9401 for (const char *s = p->lex.pbeg, *e = p->lex.pcur; s < e; ++s) {
9402 if (*s == ' ' || *s == '\t') continue;
9403 if (*s == '#') break;
9404 rb_warning1("'%s' is ignored unless in comment-only line", WARN_S(name));
9405 return;
9406 }
9407
9408 switch (*val) {
9409 case 'n': case 'N':
9410 if (STRCASECMP(val, "none") == 0) {
9411 p->ctxt.shareable_constant_value = rb_parser_shareable_none;
9412 return;
9413 }
9414 break;
9415 case 'l': case 'L':
9416 if (STRCASECMP(val, "literal") == 0) {
9417 p->ctxt.shareable_constant_value = rb_parser_shareable_literal;
9418 return;
9419 }
9420 break;
9421 case 'e': case 'E':
9422 if (STRCASECMP(val, "experimental_copy") == 0) {
9423 p->ctxt.shareable_constant_value = rb_parser_shareable_copy;
9424 return;
9425 }
9426 if (STRCASECMP(val, "experimental_everything") == 0) {
9427 p->ctxt.shareable_constant_value = rb_parser_shareable_everything;
9428 return;
9429 }
9430 break;
9431 }
9432 parser_invalid_pragma_value(p, name, val);
9433}
9434
9435# if WARN_PAST_SCOPE
9436static void
9437parser_set_past_scope(struct parser_params *p, const char *name, const char *val)
9438{
9439 int b = parser_get_bool(p, name, val);
9440 if (b >= 0) p->past_scope_enabled = b;
9441}
9442# endif
9443
9444struct magic_comment {
9445 const char *name;
9446 rb_magic_comment_setter_t func;
9447 rb_magic_comment_length_t length;
9448};
9449
9450static const struct magic_comment magic_comments[] = {
9451 {"coding", magic_comment_encoding, parser_encode_length},
9452 {"encoding", magic_comment_encoding, parser_encode_length},
9453 {"frozen_string_literal", parser_set_frozen_string_literal},
9454 {"shareable_constant_value", parser_set_shareable_constant_value},
9455 {"warn_indent", parser_set_token_info},
9456# if WARN_PAST_SCOPE
9457 {"warn_past_scope", parser_set_past_scope},
9458# endif
9459};
9460
9461static const char *
9462magic_comment_marker(const char *str, long len)
9463{
9464 long i = 2;
9465
9466 while (i < len) {
9467 switch (str[i]) {
9468 case '-':
9469 if (str[i-1] == '*' && str[i-2] == '-') {
9470 return str + i + 1;
9471 }
9472 i += 2;
9473 break;
9474 case '*':
9475 if (i + 1 >= len) return 0;
9476 if (str[i+1] != '-') {
9477 i += 4;
9478 }
9479 else if (str[i-1] != '-') {
9480 i += 2;
9481 }
9482 else {
9483 return str + i + 2;
9484 }
9485 break;
9486 default:
9487 i += 3;
9488 break;
9489 }
9490 }
9491 return 0;
9492}
9493
9494static int
9495parser_magic_comment(struct parser_params *p, const char *str, long len)
9496{
9497 int indicator = 0;
9498 VALUE name = 0, val = 0;
9499 const char *beg, *end, *vbeg, *vend;
9500#define str_copy(_s, _p, _n) ((_s) \
9501 ? (void)(rb_str_resize((_s), (_n)), \
9502 MEMCPY(RSTRING_PTR(_s), (_p), char, (_n)), (_s)) \
9503 : (void)((_s) = STR_NEW((_p), (_n))))
9504
9505 if (len <= 7) return FALSE;
9506 if (!!(beg = magic_comment_marker(str, len))) {
9507 if (!(end = magic_comment_marker(beg, str + len - beg)))
9508 return FALSE;
9509 indicator = TRUE;
9510 str = beg;
9511 len = end - beg - 3;
9512 }
9513
9514 /* %r"([^\\s\'\":;]+)\\s*:\\s*(\"(?:\\\\.|[^\"])*\"|[^\"\\s;]+)[\\s;]*" */
9515 while (len > 0) {
9516 const struct magic_comment *mc = magic_comments;
9517 char *s;
9518 int i;
9519 long n = 0;
9520
9521 for (; len > 0 && *str; str++, --len) {
9522 switch (*str) {
9523 case '\'': case '"': case ':': case ';':
9524 continue;
9525 }
9526 if (!ISSPACE(*str)) break;
9527 }
9528 for (beg = str; len > 0; str++, --len) {
9529 switch (*str) {
9530 case '\'': case '"': case ':': case ';':
9531 break;
9532 default:
9533 if (ISSPACE(*str)) break;
9534 continue;
9535 }
9536 break;
9537 }
9538 for (end = str; len > 0 && ISSPACE(*str); str++, --len);
9539 if (!len) break;
9540 if (*str != ':') {
9541 if (!indicator) return FALSE;
9542 continue;
9543 }
9544
9545 do str++; while (--len > 0 && ISSPACE(*str));
9546 if (!len) break;
9547 const char *tok_beg = str;
9548 if (*str == '"') {
9549 for (vbeg = ++str; --len > 0 && *str != '"'; str++) {
9550 if (*str == '\\') {
9551 --len;
9552 ++str;
9553 }
9554 }
9555 vend = str;
9556 if (len) {
9557 --len;
9558 ++str;
9559 }
9560 }
9561 else {
9562 for (vbeg = str; len > 0 && *str != '"' && *str != ';' && !ISSPACE(*str); --len, str++);
9563 vend = str;
9564 }
9565 const char *tok_end = str;
9566 if (indicator) {
9567 while (len > 0 && (*str == ';' || ISSPACE(*str))) --len, str++;
9568 }
9569 else {
9570 while (len > 0 && (ISSPACE(*str))) --len, str++;
9571 if (len) return FALSE;
9572 }
9573
9574 n = end - beg;
9575 str_copy(name, beg, n);
9576 s = RSTRING_PTR(name);
9577 for (i = 0; i < n; ++i) {
9578 if (s[i] == '-') s[i] = '_';
9579 }
9580 do {
9581 if (STRNCASECMP(mc->name, s, n) == 0 && !mc->name[n]) {
9582 n = vend - vbeg;
9583 if (mc->length) {
9584 n = (*mc->length)(p, vbeg, n);
9585 }
9586 str_copy(val, vbeg, n);
9587 p->lex.ptok = tok_beg;
9588 p->lex.pcur = tok_end;
9589 (*mc->func)(p, mc->name, RSTRING_PTR(val));
9590 break;
9591 }
9592 } while (++mc < magic_comments + numberof(magic_comments));
9593#ifdef RIPPER
9594 str_copy(val, vbeg, vend - vbeg);
9595 dispatch2(magic_comment, name, val);
9596#endif
9597 }
9598
9599 return TRUE;
9600}
9601
9602static void
9603set_file_encoding(struct parser_params *p, const char *str, const char *send)
9604{
9605 int sep = 0;
9606 const char *beg = str;
9607 VALUE s;
9608
9609 for (;;) {
9610 if (send - str <= 6) return;
9611 switch (str[6]) {
9612 case 'C': case 'c': str += 6; continue;
9613 case 'O': case 'o': str += 5; continue;
9614 case 'D': case 'd': str += 4; continue;
9615 case 'I': case 'i': str += 3; continue;
9616 case 'N': case 'n': str += 2; continue;
9617 case 'G': case 'g': str += 1; continue;
9618 case '=': case ':':
9619 sep = 1;
9620 str += 6;
9621 break;
9622 default:
9623 str += 6;
9624 if (ISSPACE(*str)) break;
9625 continue;
9626 }
9627 if (STRNCASECMP(str-6, "coding", 6) == 0) break;
9628 sep = 0;
9629 }
9630 for (;;) {
9631 do {
9632 if (++str >= send) return;
9633 } while (ISSPACE(*str));
9634 if (sep) break;
9635 if (*str != '=' && *str != ':') return;
9636 sep = 1;
9637 str++;
9638 }
9639 beg = str;
9640 while ((*str == '-' || *str == '_' || ISALNUM(*str)) && ++str < send);
9641 s = rb_str_new(beg, parser_encode_length(p, beg, str - beg));
9642 p->lex.ptok = beg;
9643 p->lex.pcur = str;
9644 parser_set_encode(p, RSTRING_PTR(s));
9645 rb_str_resize(s, 0);
9646}
9647
9648static void
9649parser_prepare(struct parser_params *p)
9650{
9651 int c = nextc0(p, FALSE);
9652 p->token_info_enabled = !compile_for_eval && RTEST(ruby_verbose);
9653 switch (c) {
9654 case '#':
9655 if (peek(p, '!')) p->has_shebang = 1;
9656 break;
9657 case 0xef: /* UTF-8 BOM marker */
9658 if (!lex_eol_n_p(p, 2) &&
9659 (unsigned char)p->lex.pcur[0] == 0xbb &&
9660 (unsigned char)p->lex.pcur[1] == 0xbf) {
9661 p->enc = rb_utf8_encoding();
9662 p->lex.pcur += 2;
9663#ifndef RIPPER
9664 if (p->debug_lines) {
9665 rb_parser_string_set_encoding(p->lex.lastline, p->enc);
9666 }
9667#endif
9668 p->lex.pbeg = p->lex.pcur;
9669 token_flush(p);
9670 return;
9671 }
9672 break;
9673 case -1: /* end of script. */
9674 return;
9675 }
9676 pushback(p, c);
9677 p->enc = rb_parser_str_get_encoding(p->lex.lastline);
9678}
9679
9680#ifndef RIPPER
9681#define ambiguous_operator(tok, op, syn) ( \
9682 rb_warning0("'"op"' after local variable or literal is interpreted as binary operator"), \
9683 rb_warning0("even though it seems like "syn""))
9684#else
9685#define ambiguous_operator(tok, op, syn) \
9686 dispatch2(operator_ambiguous, TOKEN2VAL(tok), rb_str_new_cstr(syn))
9687#endif
9688#define warn_balanced(tok, op, syn) ((void) \
9689 (!IS_lex_state_for(last_state, EXPR_CLASS|EXPR_DOT|EXPR_FNAME|EXPR_ENDFN) && \
9690 space_seen && !ISSPACE(c) && \
9691 (ambiguous_operator(tok, op, syn), 0)), \
9692 (enum yytokentype)(tok))
9693
9694static enum yytokentype
9695no_digits(struct parser_params *p)
9696{
9697 yyerror0("numeric literal without digits");
9698 if (peek(p, '_')) nextc(p);
9699 /* dummy 0, for tUMINUS_NUM at numeric */
9700 return set_number_literal(p, tINTEGER, 0, 10, 0);
9701}
9702
9703static enum yytokentype
9704parse_numeric(struct parser_params *p, int c)
9705{
9706 int is_float, seen_point, seen_e, nondigit;
9707 int suffix;
9708
9709 is_float = seen_point = seen_e = nondigit = 0;
9710 SET_LEX_STATE(EXPR_END);
9711 newtok(p);
9712 if (c == '-' || c == '+') {
9713 tokadd(p, c);
9714 c = nextc(p);
9715 }
9716 if (c == '0') {
9717 int start = toklen(p);
9718 c = nextc(p);
9719 if (c == 'x' || c == 'X') {
9720 /* hexadecimal */
9721 c = nextc(p);
9722 if (c != -1 && ISXDIGIT(c)) {
9723 do {
9724 if (c == '_') {
9725 if (nondigit) break;
9726 nondigit = c;
9727 continue;
9728 }
9729 if (!ISXDIGIT(c)) break;
9730 nondigit = 0;
9731 tokadd(p, c);
9732 } while ((c = nextc(p)) != -1);
9733 }
9734 pushback(p, c);
9735 tokfix(p);
9736 if (toklen(p) == start) {
9737 return no_digits(p);
9738 }
9739 else if (nondigit) goto trailing_uc;
9740 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9741 return set_number_literal(p, tINTEGER, suffix, 16, 0);
9742 }
9743 if (c == 'b' || c == 'B') {
9744 /* binary */
9745 c = nextc(p);
9746 if (c == '0' || c == '1') {
9747 do {
9748 if (c == '_') {
9749 if (nondigit) break;
9750 nondigit = c;
9751 continue;
9752 }
9753 if (c != '0' && c != '1') break;
9754 nondigit = 0;
9755 tokadd(p, c);
9756 } while ((c = nextc(p)) != -1);
9757 }
9758 pushback(p, c);
9759 tokfix(p);
9760 if (toklen(p) == start) {
9761 return no_digits(p);
9762 }
9763 else if (nondigit) goto trailing_uc;
9764 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9765 return set_number_literal(p, tINTEGER, suffix, 2, 0);
9766 }
9767 if (c == 'd' || c == 'D') {
9768 /* decimal */
9769 c = nextc(p);
9770 if (c != -1 && ISDIGIT(c)) {
9771 do {
9772 if (c == '_') {
9773 if (nondigit) break;
9774 nondigit = c;
9775 continue;
9776 }
9777 if (!ISDIGIT(c)) break;
9778 nondigit = 0;
9779 tokadd(p, c);
9780 } while ((c = nextc(p)) != -1);
9781 }
9782 pushback(p, c);
9783 tokfix(p);
9784 if (toklen(p) == start) {
9785 return no_digits(p);
9786 }
9787 else if (nondigit) goto trailing_uc;
9788 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9789 return set_number_literal(p, tINTEGER, suffix, 10, 0);
9790 }
9791 if (c == '_') {
9792 /* 0_0 */
9793 goto octal_number;
9794 }
9795 if (c == 'o' || c == 'O') {
9796 /* prefixed octal */
9797 c = nextc(p);
9798 if (c == -1 || c == '_' || !ISDIGIT(c)) {
9799 tokfix(p);
9800 return no_digits(p);
9801 }
9802 }
9803 if (c >= '0' && c <= '7') {
9804 /* octal */
9805 octal_number:
9806 do {
9807 if (c == '_') {
9808 if (nondigit) break;
9809 nondigit = c;
9810 continue;
9811 }
9812 if (c < '0' || c > '9') break;
9813 if (c > '7') goto invalid_octal;
9814 nondigit = 0;
9815 tokadd(p, c);
9816 } while ((c = nextc(p)) != -1);
9817 if (toklen(p) > start) {
9818 pushback(p, c);
9819 tokfix(p);
9820 if (nondigit) goto trailing_uc;
9821 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9822 return set_number_literal(p, tINTEGER, suffix, 8, 0);
9823 }
9824 if (nondigit) {
9825 pushback(p, c);
9826 goto trailing_uc;
9827 }
9828 }
9829 if (c > '7' && c <= '9') {
9830 invalid_octal:
9831 yyerror0("Invalid octal digit");
9832 }
9833 else if (c == '.' || c == 'e' || c == 'E') {
9834 tokadd(p, '0');
9835 }
9836 else {
9837 pushback(p, c);
9838 tokfix(p);
9839 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9840 return set_number_literal(p, tINTEGER, suffix, 10, 0);
9841 }
9842 }
9843
9844 for (;;) {
9845 switch (c) {
9846 case '0': case '1': case '2': case '3': case '4':
9847 case '5': case '6': case '7': case '8': case '9':
9848 nondigit = 0;
9849 tokadd(p, c);
9850 break;
9851
9852 case '.':
9853 if (nondigit) goto trailing_uc;
9854 if (seen_point || seen_e) {
9855 goto decode_num;
9856 }
9857 else {
9858 int c0 = nextc(p);
9859 if (c0 == -1 || !ISDIGIT(c0)) {
9860 pushback(p, c0);
9861 goto decode_num;
9862 }
9863 c = c0;
9864 }
9865 seen_point = toklen(p);
9866 tokadd(p, '.');
9867 tokadd(p, c);
9868 is_float++;
9869 nondigit = 0;
9870 break;
9871
9872 case 'e':
9873 case 'E':
9874 if (nondigit) {
9875 pushback(p, c);
9876 c = nondigit;
9877 goto decode_num;
9878 }
9879 if (seen_e) {
9880 goto decode_num;
9881 }
9882 nondigit = c;
9883 c = nextc(p);
9884 if (c != '-' && c != '+' && !ISDIGIT(c)) {
9885 pushback(p, c);
9886 c = nondigit;
9887 nondigit = 0;
9888 goto decode_num;
9889 }
9890 tokadd(p, nondigit);
9891 seen_e++;
9892 is_float++;
9893 tokadd(p, c);
9894 nondigit = (c == '-' || c == '+') ? c : 0;
9895 break;
9896
9897 case '_': /* `_' in number just ignored */
9898 if (nondigit) goto decode_num;
9899 nondigit = c;
9900 break;
9901
9902 default:
9903 goto decode_num;
9904 }
9905 c = nextc(p);
9906 }
9907
9908 decode_num:
9909 pushback(p, c);
9910 if (nondigit) {
9911 trailing_uc:
9912 literal_flush(p, p->lex.pcur - 1);
9913 YYLTYPE loc = RUBY_INIT_YYLLOC();
9914 compile_error(p, "trailing '%c' in number", nondigit);
9915 parser_show_error_line(p, &loc);
9916 }
9917 tokfix(p);
9918 if (is_float) {
9919 enum yytokentype type = tFLOAT;
9920
9921 suffix = number_literal_suffix(p, seen_e ? NUM_SUFFIX_I : NUM_SUFFIX_ALL);
9922 if (suffix & NUM_SUFFIX_R) {
9923 type = tRATIONAL;
9924 }
9925 else {
9926 strtod(tok(p), 0);
9927 if (errno == ERANGE) {
9928 rb_warning1("Float %s out of range", WARN_S(tok(p)));
9929 errno = 0;
9930 }
9931 }
9932 return set_number_literal(p, type, suffix, 0, seen_point);
9933 }
9934 suffix = number_literal_suffix(p, NUM_SUFFIX_ALL);
9935 return set_number_literal(p, tINTEGER, suffix, 10, 0);
9936}
9937
9938static enum yytokentype
9939parse_qmark(struct parser_params *p, int space_seen)
9940{
9941 rb_encoding *enc;
9942 register int c;
9943 rb_parser_string_t *lit;
9944 const char *start = p->lex.pcur;
9945
9946 if (IS_END()) {
9947 SET_LEX_STATE(EXPR_VALUE);
9948 return '?';
9949 }
9950 c = nextc(p);
9951 if (c == -1) {
9952 compile_error(p, "incomplete character syntax");
9953 return 0;
9954 }
9955 if (rb_enc_isspace(c, p->enc)) {
9956 if (!IS_ARG()) {
9957 int c2 = escaped_control_code(c);
9958 if (c2) {
9959 WARN_SPACE_CHAR(c2, "?");
9960 }
9961 }
9962 ternary:
9963 pushback(p, c);
9964 SET_LEX_STATE(EXPR_VALUE);
9965 return '?';
9966 }
9967 newtok(p);
9968 enc = p->enc;
9969 int w = parser_precise_mbclen(p, start);
9970 if (is_identchar(p, start, p->lex.pend, p->enc) &&
9971 !(lex_eol_ptr_n_p(p, start, w) || !is_identchar(p, start + w, p->lex.pend, p->enc))) {
9972 if (space_seen) {
9973 const char *ptr = start;
9974 do {
9975 int n = parser_precise_mbclen(p, ptr);
9976 if (n < 0) return -1;
9977 ptr += n;
9978 } while (!lex_eol_ptr_p(p, ptr) && is_identchar(p, ptr, p->lex.pend, p->enc));
9979 rb_warn2("'?' just followed by '%.*s' is interpreted as" \
9980 " a conditional operator, put a space after '?'",
9981 WARN_I((int)(ptr - start)), WARN_S_L(start, (ptr - start)));
9982 }
9983 goto ternary;
9984 }
9985 else if (c == '\\') {
9986 if (peek(p, 'u')) {
9987 nextc(p);
9988 enc = rb_utf8_encoding();
9989 tokadd_utf8(p, &enc, -1, 0, 0);
9990 }
9991 else if (!ISASCII(c = peekc(p)) && c != -1) {
9992 nextc(p);
9993 if (tokadd_mbchar(p, c) == -1) return 0;
9994 }
9995 else {
9996 c = read_escape(p, 0, p->lex.pcur - rb_strlen_lit("?\\"));
9997 tokadd(p, c);
9998 }
9999 }
10000 else {
10001 if (tokadd_mbchar(p, c) == -1) return 0;
10002 }
10003 tokfix(p);
10004 lit = STR_NEW3(tok(p), toklen(p), enc, 0);
10005 set_yylval_str(lit);
10006 SET_LEX_STATE(EXPR_END);
10007 return tCHAR;
10008}
10009
10010static enum yytokentype
10011parse_percent(struct parser_params *p, const int space_seen, const enum lex_state_e last_state)
10012{
10013 register int c;
10014 const char *ptok = p->lex.pcur;
10015
10016 if (IS_BEG()) {
10017 int term;
10018 int paren;
10019
10020 c = nextc(p);
10021 quotation:
10022 if (c == -1) goto unterminated;
10023 if (!ISALNUM(c)) {
10024 term = c;
10025 if (!ISASCII(c)) goto unknown;
10026 c = 'Q';
10027 }
10028 else {
10029 term = nextc(p);
10030 if (rb_enc_isalnum(term, p->enc) || !parser_isascii(p)) {
10031 unknown:
10032 pushback(p, term);
10033 c = parser_precise_mbclen(p, p->lex.pcur);
10034 if (c < 0) return 0;
10035 p->lex.pcur += c;
10036 yyerror0("unknown type of %string");
10037 return 0;
10038 }
10039 }
10040 if (term == -1) {
10041 unterminated:
10042 compile_error(p, "unterminated quoted string meets end of file");
10043 return 0;
10044 }
10045 paren = term;
10046 if (term == '(') term = ')';
10047 else if (term == '[') term = ']';
10048 else if (term == '{') term = '}';
10049 else if (term == '<') term = '>';
10050 else paren = 0;
10051
10052 p->lex.ptok = ptok-1;
10053 switch (c) {
10054 case 'Q':
10055 p->lex.strterm = NEW_STRTERM(str_dquote, term, paren);
10056 return tSTRING_BEG;
10057
10058 case 'q':
10059 p->lex.strterm = NEW_STRTERM(str_squote, term, paren);
10060 return tSTRING_BEG;
10061
10062 case 'W':
10063 p->lex.strterm = NEW_STRTERM(str_dword, term, paren);
10064 return tWORDS_BEG;
10065
10066 case 'w':
10067 p->lex.strterm = NEW_STRTERM(str_sword, term, paren);
10068 return tQWORDS_BEG;
10069
10070 case 'I':
10071 p->lex.strterm = NEW_STRTERM(str_dword, term, paren);
10072 return tSYMBOLS_BEG;
10073
10074 case 'i':
10075 p->lex.strterm = NEW_STRTERM(str_sword, term, paren);
10076 return tQSYMBOLS_BEG;
10077
10078 case 'x':
10079 p->lex.strterm = NEW_STRTERM(str_xquote, term, paren);
10080 return tXSTRING_BEG;
10081
10082 case 'r':
10083 p->lex.strterm = NEW_STRTERM(str_regexp, term, paren);
10084 return tREGEXP_BEG;
10085
10086 case 's':
10087 p->lex.strterm = NEW_STRTERM(str_ssym, term, paren);
10088 SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);
10089 return tSYMBEG;
10090
10091 default:
10092 yyerror0("unknown type of %string");
10093 return 0;
10094 }
10095 }
10096 if ((c = nextc(p)) == '=') {
10097 set_yylval_id('%');
10098 SET_LEX_STATE(EXPR_BEG);
10099 return tOP_ASGN;
10100 }
10101 if (IS_SPCARG(c) || (IS_lex_state(EXPR_FITEM) && c == 's')) {
10102 goto quotation;
10103 }
10104 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
10105 pushback(p, c);
10106 return warn_balanced('%', "%%", "string literal");
10107}
10108
10109static int
10110tokadd_ident(struct parser_params *p, int c)
10111{
10112 do {
10113 if (tokadd_mbchar(p, c) == -1) return -1;
10114 c = nextc(p);
10115 } while (parser_is_identchar(p));
10116 pushback(p, c);
10117 return 0;
10118}
10119
10120static ID
10121tokenize_ident(struct parser_params *p)
10122{
10123 ID ident = TOK_INTERN();
10124
10125 set_yylval_name(ident);
10126
10127 return ident;
10128}
10129
10130static int
10131parse_numvar(struct parser_params *p)
10132{
10133 size_t len;
10134 int overflow;
10135 unsigned long n = ruby_scan_digits(tok(p)+1, toklen(p)-1, 10, &len, &overflow);
10136 const unsigned long nth_ref_max =
10137 ((FIXNUM_MAX < INT_MAX) ? FIXNUM_MAX : INT_MAX) >> 1;
10138 /* NTH_REF is left-shifted to be ORed with back-ref flag and
10139 * turned into a Fixnum, in compile.c */
10140
10141 if (overflow || n > nth_ref_max) {
10142 /* compile_error()? */
10143 rb_warn1("'%s' is too big for a number variable, always nil", WARN_S(tok(p)));
10144 return 0; /* $0 is $PROGRAM_NAME, not NTH_REF */
10145 }
10146 else {
10147 return (int)n;
10148 }
10149}
10150
10151static enum yytokentype
10152parse_gvar(struct parser_params *p, const enum lex_state_e last_state)
10153{
10154 const char *ptr = p->lex.pcur;
10155 register int c;
10156
10157 SET_LEX_STATE(EXPR_END);
10158 p->lex.ptok = ptr - 1; /* from '$' */
10159 newtok(p);
10160 c = nextc(p);
10161 switch (c) {
10162 case '_': /* $_: last read line string */
10163 c = nextc(p);
10164 if (parser_is_identchar(p)) {
10165 tokadd(p, '$');
10166 tokadd(p, '_');
10167 break;
10168 }
10169 pushback(p, c);
10170 c = '_';
10171 /* fall through */
10172 case '~': /* $~: match-data */
10173 case '*': /* $*: argv */
10174 case '$': /* $$: pid */
10175 case '?': /* $?: last status */
10176 case '!': /* $!: error string */
10177 case '@': /* $@: error position */
10178 case '/': /* $/: input record separator */
10179 case '\\': /* $\: output record separator */
10180 case ';': /* $;: field separator */
10181 case ',': /* $,: output field separator */
10182 case '.': /* $.: last read line number */
10183 case '=': /* $=: ignorecase */
10184 case ':': /* $:: load path */
10185 case '<': /* $<: default input handle */
10186 case '>': /* $>: default output handle */
10187 case '\"': /* $": already loaded files */
10188 tokadd(p, '$');
10189 tokadd(p, c);
10190 goto gvar;
10191
10192 case '-':
10193 tokadd(p, '$');
10194 tokadd(p, c);
10195 c = nextc(p);
10196 if (parser_is_identchar(p)) {
10197 if (tokadd_mbchar(p, c) == -1) return 0;
10198 }
10199 else {
10200 pushback(p, c);
10201 pushback(p, '-');
10202 return '$';
10203 }
10204 gvar:
10205 tokenize_ident(p);
10206 return tGVAR;
10207
10208 case '&': /* $&: last match */
10209 case '`': /* $`: string before last match */
10210 case '\'': /* $': string after last match */
10211 case '+': /* $+: string matches last paren. */
10212 if (IS_lex_state_for(last_state, EXPR_FNAME)) {
10213 tokadd(p, '$');
10214 tokadd(p, c);
10215 goto gvar;
10216 }
10217 set_yylval_node(NEW_BACK_REF(c, &_cur_loc));
10218 return tBACK_REF;
10219
10220 case '1': case '2': case '3':
10221 case '4': case '5': case '6':
10222 case '7': case '8': case '9':
10223 tokadd(p, '$');
10224 do {
10225 tokadd(p, c);
10226 c = nextc(p);
10227 } while (c != -1 && ISDIGIT(c));
10228 pushback(p, c);
10229 if (IS_lex_state_for(last_state, EXPR_FNAME)) goto gvar;
10230 tokfix(p);
10231 c = parse_numvar(p);
10232 set_yylval_node(NEW_NTH_REF(c, &_cur_loc));
10233 return tNTH_REF;
10234
10235 default:
10236 if (!parser_is_identchar(p)) {
10237 YYLTYPE loc = RUBY_INIT_YYLLOC();
10238 if (c == -1 || ISSPACE(c)) {
10239 compile_error(p, "'$' without identifiers is not allowed as a global variable name");
10240 }
10241 else {
10242 pushback(p, c);
10243 compile_error(p, "'$%c' is not allowed as a global variable name", c);
10244 }
10245 parser_show_error_line(p, &loc);
10246 set_yylval_noname();
10247 return tGVAR;
10248 }
10249 /* fall through */
10250 case '0':
10251 tokadd(p, '$');
10252 }
10253
10254 if (tokadd_ident(p, c)) return 0;
10255 SET_LEX_STATE(EXPR_END);
10256 if (VALID_SYMNAME_P(tok(p), toklen(p), p->enc, ID_GLOBAL)) {
10257 tokenize_ident(p);
10258 }
10259 else {
10260 compile_error(p, "'%.*s' is not allowed as a global variable name", toklen(p), tok(p));
10261 set_yylval_noname();
10262 }
10263 return tGVAR;
10264}
10265
10266static bool
10267parser_numbered_param(struct parser_params *p, int n)
10268{
10269 if (n < 0) return false;
10270
10271 if (DVARS_TERMINAL_P(p->lvtbl->args) || DVARS_TERMINAL_P(p->lvtbl->args->prev)) {
10272 return false;
10273 }
10274 if (p->max_numparam == ORDINAL_PARAM) {
10275 compile_error(p, "ordinary parameter is defined");
10276 return false;
10277 }
10278 struct vtable *args = p->lvtbl->args;
10279 if (p->max_numparam < n) {
10280 p->max_numparam = n;
10281 }
10282 while (n > args->pos) {
10283 vtable_add(args, NUMPARAM_IDX_TO_ID(args->pos+1));
10284 }
10285 return true;
10286}
10287
10288static enum yytokentype
10289parse_atmark(struct parser_params *p, const enum lex_state_e last_state)
10290{
10291 const char *ptr = p->lex.pcur;
10292 enum yytokentype result = tIVAR;
10293 register int c = nextc(p);
10294 YYLTYPE loc;
10295
10296 p->lex.ptok = ptr - 1; /* from '@' */
10297 newtok(p);
10298 tokadd(p, '@');
10299 if (c == '@') {
10300 result = tCVAR;
10301 tokadd(p, '@');
10302 c = nextc(p);
10303 }
10304 SET_LEX_STATE(IS_lex_state_for(last_state, EXPR_FNAME) ? EXPR_ENDFN : EXPR_END);
10305 if (c == -1 || !parser_is_identchar(p)) {
10306 pushback(p, c);
10307 RUBY_SET_YYLLOC(loc);
10308 if (result == tIVAR) {
10309 compile_error(p, "'@' without identifiers is not allowed as an instance variable name");
10310 }
10311 else {
10312 compile_error(p, "'@@' without identifiers is not allowed as a class variable name");
10313 }
10314 parser_show_error_line(p, &loc);
10315 set_yylval_noname();
10316 SET_LEX_STATE(EXPR_END);
10317 return result;
10318 }
10319 else if (ISDIGIT(c)) {
10320 pushback(p, c);
10321 RUBY_SET_YYLLOC(loc);
10322 if (result == tIVAR) {
10323 compile_error(p, "'@%c' is not allowed as an instance variable name", c);
10324 }
10325 else {
10326 compile_error(p, "'@@%c' is not allowed as a class variable name", c);
10327 }
10328 parser_show_error_line(p, &loc);
10329 set_yylval_noname();
10330 SET_LEX_STATE(EXPR_END);
10331 return result;
10332 }
10333
10334 if (tokadd_ident(p, c)) return 0;
10335 tokenize_ident(p);
10336 return result;
10337}
10338
10339static enum yytokentype
10340parse_ident(struct parser_params *p, int c, int cmd_state)
10341{
10342 enum yytokentype result;
10343 bool is_ascii = true;
10344 const enum lex_state_e last_state = p->lex.state;
10345 ID ident;
10346 int enforce_keyword_end = 0;
10347
10348 do {
10349 if (!ISASCII(c)) is_ascii = false;
10350 if (tokadd_mbchar(p, c) == -1) return 0;
10351 c = nextc(p);
10352 } while (parser_is_identchar(p));
10353 if ((c == '!' || c == '?') && !peek(p, '=')) {
10354 result = tFID;
10355 tokadd(p, c);
10356 }
10357 else if (c == '=' && IS_lex_state(EXPR_FNAME) &&
10358 (!peek(p, '~') && !peek(p, '>') && (!peek(p, '=') || (peek_n(p, '>', 1))))) {
10359 result = tIDENTIFIER;
10360 tokadd(p, c);
10361 }
10362 else {
10363 result = tCONSTANT; /* assume provisionally */
10364 pushback(p, c);
10365 }
10366 tokfix(p);
10367
10368 if (IS_LABEL_POSSIBLE()) {
10369 if (IS_LABEL_SUFFIX(0)) {
10370 SET_LEX_STATE(EXPR_ARG|EXPR_LABELED);
10371 nextc(p);
10372 tokenize_ident(p);
10373 return tLABEL;
10374 }
10375 }
10376
10377#ifndef RIPPER
10378 if (peek_end_expect_token_locations(p)) {
10379 const rb_code_position_t *end_pos;
10380 int lineno, column;
10381 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
10382
10383 end_pos = peek_end_expect_token_locations(p)->pos;
10384 lineno = end_pos->lineno;
10385 column = end_pos->column;
10386
10387 if (p->debug) {
10388 rb_parser_printf(p, "enforce_keyword_end check. current: (%d, %d), peek: (%d, %d)\n",
10389 p->ruby_sourceline, beg_pos, lineno, column);
10390 }
10391
10392 if ((p->ruby_sourceline > lineno) && (beg_pos <= column)) {
10393 const struct kwtable *kw;
10394
10395 if ((IS_lex_state(EXPR_DOT)) && (kw = rb_reserved_word(tok(p), toklen(p))) && (kw && kw->id[0] == keyword_end)) {
10396 if (p->debug) rb_parser_printf(p, "enforce_keyword_end is enabled\n");
10397 enforce_keyword_end = 1;
10398 }
10399 }
10400 }
10401#endif
10402
10403 if (is_ascii && (!IS_lex_state(EXPR_DOT) || enforce_keyword_end)) {
10404 const struct kwtable *kw;
10405
10406 /* See if it is a reserved word. */
10407 kw = rb_reserved_word(tok(p), toklen(p));
10408 if (kw) {
10409 enum lex_state_e state = p->lex.state;
10410 if (IS_lex_state_for(state, EXPR_FNAME)) {
10411 SET_LEX_STATE(EXPR_ENDFN);
10412 set_yylval_name(rb_intern2(tok(p), toklen(p)));
10413 return kw->id[0];
10414 }
10415 SET_LEX_STATE(kw->state);
10416 if (IS_lex_state(EXPR_BEG)) {
10417 p->command_start = TRUE;
10418 }
10419 if (kw->id[0] == keyword_do) {
10420 if (lambda_beginning_p()) {
10421 p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE in the body of "-> do ... end" */
10422 return keyword_do_LAMBDA;
10423 }
10424 if (COND_P()) return keyword_do_cond;
10425 if (CMDARG_P() && !IS_lex_state_for(state, EXPR_CMDARG))
10426 return keyword_do_block;
10427 return keyword_do;
10428 }
10429 if (IS_lex_state_for(state, (EXPR_BEG | EXPR_LABELED | EXPR_CLASS)))
10430 return kw->id[0];
10431 else {
10432 if (kw->id[0] != kw->id[1])
10433 SET_LEX_STATE(EXPR_BEG | EXPR_LABEL);
10434 return kw->id[1];
10435 }
10436 }
10437 }
10438
10439 if (IS_lex_state(EXPR_BEG_ANY | EXPR_ARG_ANY | EXPR_DOT)) {
10440 if (cmd_state) {
10441 SET_LEX_STATE(EXPR_CMDARG);
10442 }
10443 else {
10444 SET_LEX_STATE(EXPR_ARG);
10445 }
10446 }
10447 else if (p->lex.state == EXPR_FNAME) {
10448 SET_LEX_STATE(EXPR_ENDFN);
10449 }
10450 else {
10451 SET_LEX_STATE(EXPR_END);
10452 }
10453
10454 ident = tokenize_ident(p);
10455 if (result == tCONSTANT && is_local_id(ident)) result = tIDENTIFIER;
10456 if (!IS_lex_state_for(last_state, EXPR_DOT|EXPR_FNAME) &&
10457 (result == tIDENTIFIER) && /* not EXPR_FNAME, not attrasgn */
10458 (lvar_defined(p, ident) || NUMPARAM_ID_P(ident))) {
10459 SET_LEX_STATE(EXPR_END|EXPR_LABEL);
10460 }
10461 return result;
10462}
10463
10464static void
10465warn_cr(struct parser_params *p)
10466{
10467 if (!p->cr_seen) {
10468 p->cr_seen = TRUE;
10469 /* carried over with p->lex.nextline for nextc() */
10470 rb_warn0("encountered \\r in middle of line, treated as a mere space");
10471 }
10472}
10473
10474static enum yytokentype
10475parser_yylex(struct parser_params *p)
10476{
10477 register int c;
10478 int space_seen = 0;
10479 int cmd_state;
10480 int label;
10481 enum lex_state_e last_state;
10482 int fallthru = FALSE;
10483 int token_seen = p->token_seen;
10484
10485 if (p->lex.strterm) {
10486 if (strterm_is_heredoc(p->lex.strterm)) {
10487 token_flush(p);
10488 return here_document(p, &p->lex.strterm->u.heredoc);
10489 }
10490 else {
10491 token_flush(p);
10492 return parse_string(p, &p->lex.strterm->u.literal);
10493 }
10494 }
10495 cmd_state = p->command_start;
10496 p->command_start = FALSE;
10497 p->token_seen = TRUE;
10498#ifndef RIPPER
10499 token_flush(p);
10500#endif
10501 retry:
10502 last_state = p->lex.state;
10503 switch (c = nextc(p)) {
10504 case '\0': /* NUL */
10505 case '\004': /* ^D */
10506 case '\032': /* ^Z */
10507 case -1: /* end of script. */
10508 p->eofp = 1;
10509#ifndef RIPPER
10510 if (p->end_expect_token_locations) {
10511 pop_end_expect_token_locations(p);
10512 RUBY_SET_YYLLOC_OF_DUMMY_END(*p->yylloc);
10513 return tDUMNY_END;
10514 }
10515#endif
10516 /* Set location for end-of-input because dispatch_scan_event is not called. */
10517 RUBY_SET_YYLLOC(*p->yylloc);
10518 return END_OF_INPUT;
10519
10520 /* white spaces */
10521 case '\r':
10522 warn_cr(p);
10523 /* fall through */
10524 case ' ': case '\t': case '\f':
10525 case '\13': /* '\v' */
10526 space_seen = 1;
10527 while ((c = nextc(p))) {
10528 switch (c) {
10529 case '\r':
10530 warn_cr(p);
10531 /* fall through */
10532 case ' ': case '\t': case '\f':
10533 case '\13': /* '\v' */
10534 break;
10535 default:
10536 goto outofloop;
10537 }
10538 }
10539 outofloop:
10540 pushback(p, c);
10541 dispatch_scan_event(p, tSP);
10542#ifndef RIPPER
10543 token_flush(p);
10544#endif
10545 goto retry;
10546
10547 case '#': /* it's a comment */
10548 p->token_seen = token_seen;
10549 const char *const pcur = p->lex.pcur, *const ptok = p->lex.ptok;
10550 /* no magic_comment in shebang line */
10551 if (!parser_magic_comment(p, p->lex.pcur, p->lex.pend - p->lex.pcur)) {
10552 if (comment_at_top(p)) {
10553 set_file_encoding(p, p->lex.pcur, p->lex.pend);
10554 }
10555 }
10556 p->lex.pcur = pcur, p->lex.ptok = ptok;
10557 lex_goto_eol(p);
10558 dispatch_scan_event(p, tCOMMENT);
10559 fallthru = TRUE;
10560 /* fall through */
10561 case '\n':
10562 p->token_seen = token_seen;
10563 rb_parser_string_t *prevline = p->lex.lastline;
10564 c = (IS_lex_state(EXPR_BEG|EXPR_CLASS|EXPR_FNAME|EXPR_DOT) &&
10565 !IS_lex_state(EXPR_LABELED));
10566 if (c || IS_lex_state_all(EXPR_ARG|EXPR_LABELED)) {
10567 if (!fallthru) {
10568 dispatch_scan_event(p, tIGNORED_NL);
10569 }
10570 fallthru = FALSE;
10571 if (!c && p->ctxt.in_kwarg) {
10572 goto normal_newline;
10573 }
10574 goto retry;
10575 }
10576 while (1) {
10577 switch (c = nextc(p)) {
10578 case ' ': case '\t': case '\f': case '\r':
10579 case '\13': /* '\v' */
10580 space_seen = 1;
10581 break;
10582 case '#':
10583 pushback(p, c);
10584 if (space_seen) {
10585 dispatch_scan_event(p, tSP);
10586 token_flush(p);
10587 }
10588 goto retry;
10589 case 'a':
10590 if (peek_word_at(p, "nd", 2, 0)) goto leading_logical;
10591 goto bol;
10592 case 'o':
10593 if (peek_word_at(p, "r", 1, 0)) goto leading_logical;
10594 goto bol;
10595 case '|':
10596 if (peek(p, '|')) goto leading_logical;
10597 goto bol;
10598 case '&':
10599 if (peek(p, '&')) {
10600 leading_logical:
10601 pushback(p, c);
10602 dispatch_delayed_token(p, tIGNORED_NL);
10603 cmd_state = FALSE;
10604 goto retry;
10605 }
10606 /* fall through */
10607 case '.': {
10608 dispatch_delayed_token(p, tIGNORED_NL);
10609 if (peek(p, '.') == (c == '&')) {
10610 pushback(p, c);
10611 dispatch_scan_event(p, tSP);
10612 goto retry;
10613 }
10614 }
10615 bol:
10616 default:
10617 p->ruby_sourceline--;
10618 p->lex.nextline = p->lex.lastline;
10619 set_lastline(p, prevline);
10620 case -1: /* EOF no decrement*/
10621 if (c == -1 && space_seen) {
10622 dispatch_scan_event(p, tSP);
10623 }
10624 lex_goto_eol(p);
10625 if (c != -1) {
10626 token_flush(p);
10627 RUBY_SET_YYLLOC(*p->yylloc);
10628 }
10629 goto normal_newline;
10630 }
10631 }
10632 normal_newline:
10633 p->command_start = TRUE;
10634 SET_LEX_STATE(EXPR_BEG);
10635 return '\n';
10636
10637 case '*':
10638 if ((c = nextc(p)) == '*') {
10639 if ((c = nextc(p)) == '=') {
10640 set_yylval_id(idPow);
10641 SET_LEX_STATE(EXPR_BEG);
10642 return tOP_ASGN;
10643 }
10644 pushback(p, c);
10645 if (IS_SPCARG(c)) {
10646 rb_warning0("'**' interpreted as argument prefix");
10647 c = tDSTAR;
10648 }
10649 else if (IS_BEG()) {
10650 c = tDSTAR;
10651 }
10652 else {
10653 c = warn_balanced((enum ruby_method_ids)tPOW, "**", "argument prefix");
10654 }
10655 }
10656 else {
10657 if (c == '=') {
10658 set_yylval_id('*');
10659 SET_LEX_STATE(EXPR_BEG);
10660 return tOP_ASGN;
10661 }
10662 pushback(p, c);
10663 if (IS_SPCARG(c)) {
10664 rb_warning0("'*' interpreted as argument prefix");
10665 c = tSTAR;
10666 }
10667 else if (IS_BEG()) {
10668 c = tSTAR;
10669 }
10670 else {
10671 c = warn_balanced('*', "*", "argument prefix");
10672 }
10673 }
10674 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
10675 return c;
10676
10677 case '!':
10678 c = nextc(p);
10679 if (IS_AFTER_OPERATOR()) {
10680 SET_LEX_STATE(EXPR_ARG);
10681 if (c == '@') {
10682 return '!';
10683 }
10684 }
10685 else {
10686 SET_LEX_STATE(EXPR_BEG);
10687 }
10688 if (c == '=') {
10689 return tNEQ;
10690 }
10691 if (c == '~') {
10692 return tNMATCH;
10693 }
10694 pushback(p, c);
10695 return '!';
10696
10697 case '=':
10698 if (was_bol(p)) {
10699 /* skip embedded rd document */
10700 if (word_match_p(p, "begin", 5)) {
10701 int first_p = TRUE;
10702
10703 lex_goto_eol(p);
10704 dispatch_scan_event(p, tEMBDOC_BEG);
10705 for (;;) {
10706 lex_goto_eol(p);
10707 if (!first_p) {
10708 dispatch_scan_event(p, tEMBDOC);
10709 }
10710 first_p = FALSE;
10711 c = nextc(p);
10712 if (c == -1) {
10713 compile_error(p, "embedded document meets end of file");
10714 return END_OF_INPUT;
10715 }
10716 if (c == '=' && word_match_p(p, "end", 3)) {
10717 break;
10718 }
10719 pushback(p, c);
10720 }
10721 lex_goto_eol(p);
10722 dispatch_scan_event(p, tEMBDOC_END);
10723 goto retry;
10724 }
10725 }
10726
10727 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
10728 if ((c = nextc(p)) == '=') {
10729 if ((c = nextc(p)) == '=') {
10730 return tEQQ;
10731 }
10732 pushback(p, c);
10733 return tEQ;
10734 }
10735 if (c == '~') {
10736 return tMATCH;
10737 }
10738 else if (c == '>') {
10739 return tASSOC;
10740 }
10741 pushback(p, c);
10742 return '=';
10743
10744 case '<':
10745 c = nextc(p);
10746 if (c == '<' &&
10747 !IS_lex_state(EXPR_DOT | EXPR_CLASS) &&
10748 !IS_END() &&
10749 (!IS_ARG() || IS_lex_state(EXPR_LABELED) || space_seen)) {
10750 enum yytokentype token = heredoc_identifier(p);
10751 if (token) return token < 0 ? 0 : token;
10752 }
10753 if (IS_AFTER_OPERATOR()) {
10754 SET_LEX_STATE(EXPR_ARG);
10755 }
10756 else {
10757 if (IS_lex_state(EXPR_CLASS))
10758 p->command_start = TRUE;
10759 SET_LEX_STATE(EXPR_BEG);
10760 }
10761 if (c == '=') {
10762 if ((c = nextc(p)) == '>') {
10763 return tCMP;
10764 }
10765 pushback(p, c);
10766 return tLEQ;
10767 }
10768 if (c == '<') {
10769 if ((c = nextc(p)) == '=') {
10770 set_yylval_id(idLTLT);
10771 SET_LEX_STATE(EXPR_BEG);
10772 return tOP_ASGN;
10773 }
10774 pushback(p, c);
10775 return warn_balanced((enum ruby_method_ids)tLSHFT, "<<", "here document");
10776 }
10777 pushback(p, c);
10778 return '<';
10779
10780 case '>':
10781 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
10782 if ((c = nextc(p)) == '=') {
10783 return tGEQ;
10784 }
10785 if (c == '>') {
10786 if ((c = nextc(p)) == '=') {
10787 set_yylval_id(idGTGT);
10788 SET_LEX_STATE(EXPR_BEG);
10789 return tOP_ASGN;
10790 }
10791 pushback(p, c);
10792 return tRSHFT;
10793 }
10794 pushback(p, c);
10795 return '>';
10796
10797 case '"':
10798 label = (IS_LABEL_POSSIBLE() ? str_label : 0);
10799 p->lex.strterm = NEW_STRTERM(str_dquote | label, '"', 0);
10800 p->lex.ptok = p->lex.pcur-1;
10801 return tSTRING_BEG;
10802
10803 case '`':
10804 if (IS_lex_state(EXPR_FNAME)) {
10805 SET_LEX_STATE(EXPR_ENDFN);
10806 return c;
10807 }
10808 if (IS_lex_state(EXPR_DOT)) {
10809 if (cmd_state)
10810 SET_LEX_STATE(EXPR_CMDARG);
10811 else
10812 SET_LEX_STATE(EXPR_ARG);
10813 return c;
10814 }
10815 p->lex.strterm = NEW_STRTERM(str_xquote, '`', 0);
10816 return tXSTRING_BEG;
10817
10818 case '\'':
10819 label = (IS_LABEL_POSSIBLE() ? str_label : 0);
10820 p->lex.strterm = NEW_STRTERM(str_squote | label, '\'', 0);
10821 p->lex.ptok = p->lex.pcur-1;
10822 return tSTRING_BEG;
10823
10824 case '?':
10825 return parse_qmark(p, space_seen);
10826
10827 case '&':
10828 if ((c = nextc(p)) == '&') {
10829 SET_LEX_STATE(EXPR_BEG);
10830 if ((c = nextc(p)) == '=') {
10831 set_yylval_id(idANDOP);
10832 SET_LEX_STATE(EXPR_BEG);
10833 return tOP_ASGN;
10834 }
10835 pushback(p, c);
10836 return tANDOP;
10837 }
10838 else if (c == '=') {
10839 set_yylval_id('&');
10840 SET_LEX_STATE(EXPR_BEG);
10841 return tOP_ASGN;
10842 }
10843 else if (c == '.') {
10844 set_yylval_id(idANDDOT);
10845 SET_LEX_STATE(EXPR_DOT);
10846 return tANDDOT;
10847 }
10848 pushback(p, c);
10849 if (IS_SPCARG(c)) {
10850 if ((c != ':') ||
10851 (c = peekc_n(p, 1)) == -1 ||
10852 !(c == '\'' || c == '"' ||
10853 is_identchar(p, (p->lex.pcur+1), p->lex.pend, p->enc))) {
10854 rb_warning0("'&' interpreted as argument prefix");
10855 }
10856 c = tAMPER;
10857 }
10858 else if (IS_BEG()) {
10859 c = tAMPER;
10860 }
10861 else {
10862 c = warn_balanced('&', "&", "argument prefix");
10863 }
10864 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
10865 return c;
10866
10867 case '|':
10868 if ((c = nextc(p)) == '|') {
10869 SET_LEX_STATE(EXPR_BEG);
10870 if ((c = nextc(p)) == '=') {
10871 set_yylval_id(idOROP);
10872 SET_LEX_STATE(EXPR_BEG);
10873 return tOP_ASGN;
10874 }
10875 pushback(p, c);
10876 if (IS_lex_state_for(last_state, EXPR_BEG)) {
10877 c = '|';
10878 pushback(p, '|');
10879 return c;
10880 }
10881 return tOROP;
10882 }
10883 if (c == '=') {
10884 set_yylval_id('|');
10885 SET_LEX_STATE(EXPR_BEG);
10886 return tOP_ASGN;
10887 }
10888 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG|EXPR_LABEL);
10889 pushback(p, c);
10890 return '|';
10891
10892 case '+':
10893 c = nextc(p);
10894 if (IS_AFTER_OPERATOR()) {
10895 SET_LEX_STATE(EXPR_ARG);
10896 if (c == '@') {
10897 return tUPLUS;
10898 }
10899 pushback(p, c);
10900 return '+';
10901 }
10902 if (c == '=') {
10903 set_yylval_id('+');
10904 SET_LEX_STATE(EXPR_BEG);
10905 return tOP_ASGN;
10906 }
10907 if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '+'))) {
10908 SET_LEX_STATE(EXPR_BEG);
10909 pushback(p, c);
10910 if (c != -1 && ISDIGIT(c)) {
10911 return parse_numeric(p, '+');
10912 }
10913 return tUPLUS;
10914 }
10915 SET_LEX_STATE(EXPR_BEG);
10916 pushback(p, c);
10917 return warn_balanced('+', "+", "unary operator");
10918
10919 case '-':
10920 c = nextc(p);
10921 if (IS_AFTER_OPERATOR()) {
10922 SET_LEX_STATE(EXPR_ARG);
10923 if (c == '@') {
10924 return tUMINUS;
10925 }
10926 pushback(p, c);
10927 return '-';
10928 }
10929 if (c == '=') {
10930 set_yylval_id('-');
10931 SET_LEX_STATE(EXPR_BEG);
10932 return tOP_ASGN;
10933 }
10934 if (c == '>') {
10935 SET_LEX_STATE(EXPR_ENDFN);
10936 yylval.num = p->lex.lpar_beg;
10937 p->lex.lpar_beg = p->lex.paren_nest;
10938 return tLAMBDA;
10939 }
10940 if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '-'))) {
10941 SET_LEX_STATE(EXPR_BEG);
10942 pushback(p, c);
10943 if (c != -1 && ISDIGIT(c)) {
10944 return tUMINUS_NUM;
10945 }
10946 return tUMINUS;
10947 }
10948 SET_LEX_STATE(EXPR_BEG);
10949 pushback(p, c);
10950 return warn_balanced('-', "-", "unary operator");
10951
10952 case '.': {
10953 int is_beg = IS_BEG();
10954 SET_LEX_STATE(EXPR_BEG);
10955 if ((c = nextc(p)) == '.') {
10956 if ((c = nextc(p)) == '.') {
10957 if (p->ctxt.in_argdef || IS_LABEL_POSSIBLE()) {
10958 SET_LEX_STATE(EXPR_ENDARG);
10959 return tBDOT3;
10960 }
10961 if (p->lex.paren_nest == 0 && looking_at_eol_p(p)) {
10962 rb_warn0("... at EOL, should be parenthesized?");
10963 }
10964 return is_beg ? tBDOT3 : tDOT3;
10965 }
10966 pushback(p, c);
10967 return is_beg ? tBDOT2 : tDOT2;
10968 }
10969 pushback(p, c);
10970 if (c != -1 && ISDIGIT(c)) {
10971 char prev = p->lex.pcur-1 > p->lex.pbeg ? *(p->lex.pcur-2) : 0;
10972 parse_numeric(p, '.');
10973 if (ISDIGIT(prev)) {
10974 yyerror0("unexpected fraction part after numeric literal");
10975 }
10976 else {
10977 yyerror0("no .<digit> floating literal anymore; put 0 before dot");
10978 }
10979 SET_LEX_STATE(EXPR_END);
10980 p->lex.ptok = p->lex.pcur;
10981 goto retry;
10982 }
10983 set_yylval_id('.');
10984 SET_LEX_STATE(EXPR_DOT);
10985 return '.';
10986 }
10987
10988 case '0': case '1': case '2': case '3': case '4':
10989 case '5': case '6': case '7': case '8': case '9':
10990 return parse_numeric(p, c);
10991
10992 case ')':
10993 COND_POP();
10994 CMDARG_POP();
10995 SET_LEX_STATE(EXPR_ENDFN);
10996 p->lex.paren_nest--;
10997 return c;
10998
10999 case ']':
11000 COND_POP();
11001 CMDARG_POP();
11002 SET_LEX_STATE(EXPR_END);
11003 p->lex.paren_nest--;
11004 return c;
11005
11006 case '}':
11007 /* tSTRING_DEND does COND_POP and CMDARG_POP in the yacc's rule */
11008 if (!p->lex.brace_nest--) return tSTRING_DEND;
11009 COND_POP();
11010 CMDARG_POP();
11011 SET_LEX_STATE(EXPR_END);
11012 p->lex.paren_nest--;
11013 return c;
11014
11015 case ':':
11016 c = nextc(p);
11017 if (c == ':') {
11018 if (IS_BEG() || IS_lex_state(EXPR_CLASS) || IS_SPCARG(-1)) {
11019 SET_LEX_STATE(EXPR_BEG);
11020 return tCOLON3;
11021 }
11022 set_yylval_id(idCOLON2);
11023 SET_LEX_STATE(EXPR_DOT);
11024 return tCOLON2;
11025 }
11026 if (IS_END() || ISSPACE(c) || c == '#') {
11027 pushback(p, c);
11028 c = warn_balanced(':', ":", "symbol literal");
11029 SET_LEX_STATE(EXPR_BEG);
11030 return c;
11031 }
11032 switch (c) {
11033 case '\'':
11034 p->lex.strterm = NEW_STRTERM(str_ssym, c, 0);
11035 break;
11036 case '"':
11037 p->lex.strterm = NEW_STRTERM(str_dsym, c, 0);
11038 break;
11039 default:
11040 pushback(p, c);
11041 break;
11042 }
11043 SET_LEX_STATE(EXPR_FNAME);
11044 return tSYMBEG;
11045
11046 case '/':
11047 if (IS_BEG()) {
11048 p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0);
11049 return tREGEXP_BEG;
11050 }
11051 if ((c = nextc(p)) == '=') {
11052 set_yylval_id('/');
11053 SET_LEX_STATE(EXPR_BEG);
11054 return tOP_ASGN;
11055 }
11056 pushback(p, c);
11057 if (IS_SPCARG(c)) {
11058 arg_ambiguous(p, '/');
11059 p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0);
11060 return tREGEXP_BEG;
11061 }
11062 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
11063 return warn_balanced('/', "/", "regexp literal");
11064
11065 case '^':
11066 if ((c = nextc(p)) == '=') {
11067 set_yylval_id('^');
11068 SET_LEX_STATE(EXPR_BEG);
11069 return tOP_ASGN;
11070 }
11071 SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG);
11072 pushback(p, c);
11073 return '^';
11074
11075 case ';':
11076 SET_LEX_STATE(EXPR_BEG);
11077 p->command_start = TRUE;
11078 return ';';
11079
11080 case ',':
11081 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
11082 return ',';
11083
11084 case '~':
11085 if (IS_AFTER_OPERATOR()) {
11086 if ((c = nextc(p)) != '@') {
11087 pushback(p, c);
11088 }
11089 SET_LEX_STATE(EXPR_ARG);
11090 }
11091 else {
11092 SET_LEX_STATE(EXPR_BEG);
11093 }
11094 return '~';
11095
11096 case '(':
11097 if (IS_BEG()) {
11098 c = tLPAREN;
11099 }
11100 else if (!space_seen) {
11101 /* foo( ... ) => method call, no ambiguity */
11102 }
11103 else if (IS_ARG() || IS_lex_state_all(EXPR_END|EXPR_LABEL)) {
11104 c = tLPAREN_ARG;
11105 }
11106 else if (IS_lex_state(EXPR_ENDFN) && !lambda_beginning_p()) {
11107 rb_warning0("parentheses after method name is interpreted as "
11108 "an argument list, not a decomposed argument");
11109 }
11110 p->lex.paren_nest++;
11111 COND_PUSH(0);
11112 CMDARG_PUSH(0);
11113 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
11114 return c;
11115
11116 case '[':
11117 p->lex.paren_nest++;
11118 if (IS_AFTER_OPERATOR()) {
11119 if ((c = nextc(p)) == ']') {
11120 p->lex.paren_nest--;
11121 SET_LEX_STATE(EXPR_ARG);
11122 if ((c = nextc(p)) == '=') {
11123 return tASET;
11124 }
11125 pushback(p, c);
11126 return tAREF;
11127 }
11128 pushback(p, c);
11129 SET_LEX_STATE(EXPR_ARG|EXPR_LABEL);
11130 return '[';
11131 }
11132 else if (IS_BEG()) {
11133 c = tLBRACK;
11134 }
11135 else if (IS_ARG() && (space_seen || IS_lex_state(EXPR_LABELED))) {
11136 c = tLBRACK;
11137 }
11138 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
11139 COND_PUSH(0);
11140 CMDARG_PUSH(0);
11141 return c;
11142
11143 case '{':
11144 ++p->lex.brace_nest;
11145 if (lambda_beginning_p())
11146 c = tLAMBEG;
11147 else if (IS_lex_state(EXPR_LABELED))
11148 c = tLBRACE; /* hash */
11149 else if (IS_lex_state(EXPR_ARG_ANY | EXPR_END | EXPR_ENDFN))
11150 c = '{'; /* block (primary) */
11151 else if (IS_lex_state(EXPR_ENDARG))
11152 c = tLBRACE_ARG; /* block (expr) */
11153 else
11154 c = tLBRACE; /* hash */
11155 if (c != tLBRACE) {
11156 p->command_start = TRUE;
11157 SET_LEX_STATE(EXPR_BEG);
11158 }
11159 else {
11160 SET_LEX_STATE(EXPR_BEG|EXPR_LABEL);
11161 }
11162 ++p->lex.paren_nest; /* after lambda_beginning_p() */
11163 COND_PUSH(0);
11164 CMDARG_PUSH(0);
11165 return c;
11166
11167 case '\\':
11168 c = nextc(p);
11169 if (c == '\n') {
11170 space_seen = 1;
11171 dispatch_scan_event(p, tSP);
11172 goto retry; /* skip \\n */
11173 }
11174 if (c == ' ') return tSP;
11175 if (ISSPACE(c)) return c;
11176 pushback(p, c);
11177 return '\\';
11178
11179 case '%':
11180 return parse_percent(p, space_seen, last_state);
11181
11182 case '$':
11183 return parse_gvar(p, last_state);
11184
11185 case '@':
11186 return parse_atmark(p, last_state);
11187
11188 case '_':
11189 if (was_bol(p) && whole_match_p(p, "__END__", 7, 0)) {
11190 p->ruby__end__seen = 1;
11191 p->eofp = 1;
11192#ifdef RIPPER
11193 lex_goto_eol(p);
11194 dispatch_scan_event(p, k__END__);
11195#endif
11196 return END_OF_INPUT;
11197 }
11198 newtok(p);
11199 break;
11200
11201 default:
11202 if (!parser_is_identchar(p)) {
11203 compile_error(p, "Invalid char '\\x%02X' in expression", c);
11204 token_flush(p);
11205 goto retry;
11206 }
11207
11208 newtok(p);
11209 break;
11210 }
11211
11212 return parse_ident(p, c, cmd_state);
11213}
11214
11215static enum yytokentype
11216yylex(YYSTYPE *lval, YYLTYPE *yylloc, struct parser_params *p)
11217{
11218 enum yytokentype t;
11219
11220 p->lval = lval;
11221 lval->node = 0;
11222 p->yylloc = yylloc;
11223
11224 t = parser_yylex(p);
11225
11226 if (has_delayed_token(p))
11227 dispatch_delayed_token(p, t);
11228 else if (t != END_OF_INPUT)
11229 dispatch_scan_event(p, t);
11230
11231 return t;
11232}
11233
11234#define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
11235
11236static NODE*
11237node_new_internal(struct parser_params *p, enum node_type type, size_t size, size_t alignment)
11238{
11239 NODE *n = rb_ast_newnode(p->ast, type, size, alignment);
11240
11241 rb_node_init(n, type);
11242 return n;
11243}
11244
11245static NODE *
11246nd_set_loc(NODE *nd, const YYLTYPE *loc)
11247{
11248 nd->nd_loc = *loc;
11249 nd_set_line(nd, loc->beg_pos.lineno);
11250 return nd;
11251}
11252
11253static NODE*
11254node_newnode(struct parser_params *p, enum node_type type, size_t size, size_t alignment, const rb_code_location_t *loc)
11255{
11256 NODE *n = node_new_internal(p, type, size, alignment);
11257
11258 nd_set_loc(n, loc);
11259 nd_set_node_id(n, parser_get_node_id(p));
11260 return n;
11261}
11262
11263#define NODE_NEWNODE(node_type, type, loc) (type *)(node_newnode(p, node_type, sizeof(type), RUBY_ALIGNOF(type), loc))
11264
11265static rb_node_scope_t *
11266rb_node_scope_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, NODE *nd_parent, const YYLTYPE *loc)
11267{
11268 rb_ast_id_table_t *nd_tbl;
11269 nd_tbl = local_tbl(p);
11270 rb_node_scope_t *n = NODE_NEWNODE(NODE_SCOPE, rb_node_scope_t, loc);
11271 n->nd_tbl = nd_tbl;
11272 n->nd_body = nd_body;
11273 n->nd_parent = nd_parent;
11274 n->nd_args = nd_args;
11275
11276 return n;
11277}
11278
11279static rb_node_scope_t *
11280rb_node_scope_new2(struct parser_params *p, rb_ast_id_table_t *nd_tbl, rb_node_args_t *nd_args, NODE *nd_body, NODE *nd_parent, const YYLTYPE *loc)
11281{
11282 rb_node_scope_t *n = NODE_NEWNODE(NODE_SCOPE, rb_node_scope_t, loc);
11283 n->nd_tbl = nd_tbl;
11284 n->nd_body = nd_body;
11285 n->nd_parent = nd_parent;
11286 n->nd_args = nd_args;
11287
11288 return n;
11289}
11290
11291static rb_node_defn_t *
11292rb_node_defn_new(struct parser_params *p, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc)
11293{
11294 rb_node_defn_t *n = NODE_NEWNODE(NODE_DEFN, rb_node_defn_t, loc);
11295 n->nd_mid = nd_mid;
11296 n->nd_defn = nd_defn;
11297
11298 return n;
11299}
11300
11301static rb_node_defs_t *
11302rb_node_defs_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc)
11303{
11304 rb_node_defs_t *n = NODE_NEWNODE(NODE_DEFS, rb_node_defs_t, loc);
11305 n->nd_recv = nd_recv;
11306 n->nd_mid = nd_mid;
11307 n->nd_defn = nd_defn;
11308
11309 return n;
11310}
11311
11312static rb_node_block_t *
11313rb_node_block_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc)
11314{
11315 rb_node_block_t *n = NODE_NEWNODE(NODE_BLOCK, rb_node_block_t, loc);
11316 n->nd_head = nd_head;
11317 n->nd_end = (NODE *)n;
11318 n->nd_next = 0;
11319
11320 return n;
11321}
11322
11323static rb_node_for_t *
11324rb_node_for_new(struct parser_params *p, NODE *nd_iter, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *for_keyword_loc, const YYLTYPE *in_keyword_loc, const YYLTYPE *do_keyword_loc, const YYLTYPE *end_keyword_loc)
11325{
11326 rb_node_for_t *n = NODE_NEWNODE(NODE_FOR, rb_node_for_t, loc);
11327 n->nd_body = nd_body;
11328 n->nd_iter = nd_iter;
11329 n->for_keyword_loc = *for_keyword_loc;
11330 n->in_keyword_loc = *in_keyword_loc;
11331 n->do_keyword_loc = *do_keyword_loc;
11332 n->end_keyword_loc = *end_keyword_loc;
11333
11334 return n;
11335}
11336
11337static rb_node_for_masgn_t *
11338rb_node_for_masgn_new(struct parser_params *p, NODE *nd_var, const YYLTYPE *loc)
11339{
11340 rb_node_for_masgn_t *n = NODE_NEWNODE(NODE_FOR_MASGN, rb_node_for_masgn_t, loc);
11341 n->nd_var = nd_var;
11342
11343 return n;
11344}
11345
11346static rb_node_retry_t *
11347rb_node_retry_new(struct parser_params *p, const YYLTYPE *loc)
11348{
11349 rb_node_retry_t *n = NODE_NEWNODE(NODE_RETRY, rb_node_retry_t, loc);
11350
11351 return n;
11352}
11353
11354static rb_node_begin_t *
11355rb_node_begin_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc)
11356{
11357 rb_node_begin_t *n = NODE_NEWNODE(NODE_BEGIN, rb_node_begin_t, loc);
11358 n->nd_body = nd_body;
11359
11360 return n;
11361}
11362
11363static rb_node_rescue_t *
11364rb_node_rescue_new(struct parser_params *p, NODE *nd_head, NODE *nd_resq, NODE *nd_else, const YYLTYPE *loc)
11365{
11366 rb_node_rescue_t *n = NODE_NEWNODE(NODE_RESCUE, rb_node_rescue_t, loc);
11367 n->nd_head = nd_head;
11368 n->nd_resq = nd_resq;
11369 n->nd_else = nd_else;
11370
11371 return n;
11372}
11373
11374static rb_node_resbody_t *
11375rb_node_resbody_new(struct parser_params *p, NODE *nd_args, NODE *nd_exc_var, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc)
11376{
11377 rb_node_resbody_t *n = NODE_NEWNODE(NODE_RESBODY, rb_node_resbody_t, loc);
11378 n->nd_args = nd_args;
11379 n->nd_exc_var = nd_exc_var;
11380 n->nd_body = nd_body;
11381 n->nd_next = nd_next;
11382
11383 return n;
11384}
11385
11386static rb_node_ensure_t *
11387rb_node_ensure_new(struct parser_params *p, NODE *nd_head, NODE *nd_ensr, const YYLTYPE *loc)
11388{
11389 rb_node_ensure_t *n = NODE_NEWNODE(NODE_ENSURE, rb_node_ensure_t, loc);
11390 n->nd_head = nd_head;
11391 n->nd_ensr = nd_ensr;
11392
11393 return n;
11394}
11395
11396static rb_node_and_t *
11397rb_node_and_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *operator_loc)
11398{
11399 rb_node_and_t *n = NODE_NEWNODE(NODE_AND, rb_node_and_t, loc);
11400 n->nd_1st = nd_1st;
11401 n->nd_2nd = nd_2nd;
11402 n->operator_loc = *operator_loc;
11403
11404 return n;
11405}
11406
11407static rb_node_or_t *
11408rb_node_or_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *operator_loc)
11409{
11410 rb_node_or_t *n = NODE_NEWNODE(NODE_OR, rb_node_or_t, loc);
11411 n->nd_1st = nd_1st;
11412 n->nd_2nd = nd_2nd;
11413 n->operator_loc = *operator_loc;
11414
11415 return n;
11416}
11417
11418static rb_node_return_t *
11419rb_node_return_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
11420{
11421 rb_node_return_t *n = NODE_NEWNODE(NODE_RETURN, rb_node_return_t, loc);
11422 n->nd_stts = nd_stts;
11423 n->keyword_loc = *keyword_loc;
11424 return n;
11425}
11426
11427static rb_node_yield_t *
11428rb_node_yield_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *lparen_loc, const YYLTYPE *rparen_loc)
11429{
11430 if (nd_head) no_blockarg(p, nd_head);
11431
11432 rb_node_yield_t *n = NODE_NEWNODE(NODE_YIELD, rb_node_yield_t, loc);
11433 n->nd_head = nd_head;
11434 n->keyword_loc = *keyword_loc;
11435 n->lparen_loc = *lparen_loc;
11436 n->rparen_loc = *rparen_loc;
11437
11438 return n;
11439}
11440
11441static rb_node_if_t *
11442rb_node_if_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, NODE *nd_else, const YYLTYPE *loc, const YYLTYPE* if_keyword_loc, const YYLTYPE* then_keyword_loc, const YYLTYPE* end_keyword_loc)
11443{
11444 rb_node_if_t *n = NODE_NEWNODE(NODE_IF, rb_node_if_t, loc);
11445 n->nd_cond = nd_cond;
11446 n->nd_body = nd_body;
11447 n->nd_else = nd_else;
11448 n->if_keyword_loc = *if_keyword_loc;
11449 n->then_keyword_loc = *then_keyword_loc;
11450 n->end_keyword_loc = *end_keyword_loc;
11451
11452 return n;
11453}
11454
11455static rb_node_unless_t *
11456rb_node_unless_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, NODE *nd_else, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *then_keyword_loc, const YYLTYPE *end_keyword_loc)
11457{
11458 rb_node_unless_t *n = NODE_NEWNODE(NODE_UNLESS, rb_node_unless_t, loc);
11459 n->nd_cond = nd_cond;
11460 n->nd_body = nd_body;
11461 n->nd_else = nd_else;
11462 n->keyword_loc = *keyword_loc;
11463 n->then_keyword_loc = *then_keyword_loc;
11464 n->end_keyword_loc = *end_keyword_loc;
11465
11466 return n;
11467}
11468
11469static rb_node_class_t *
11470rb_node_class_new(struct parser_params *p, NODE *nd_cpath, NODE *nd_body, NODE *nd_super, const YYLTYPE *loc, const YYLTYPE *class_keyword_loc, const YYLTYPE *inheritance_operator_loc, const YYLTYPE *end_keyword_loc)
11471{
11472 /* Keep the order of node creation */
11473 NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc);
11474 rb_node_class_t *n = NODE_NEWNODE(NODE_CLASS, rb_node_class_t, loc);
11475 RNODE_SCOPE(scope)->nd_parent = &n->node;
11476 n->nd_cpath = nd_cpath;
11477 n->nd_body = scope;
11478 n->nd_super = nd_super;
11479 n->class_keyword_loc = *class_keyword_loc;
11480 n->inheritance_operator_loc = *inheritance_operator_loc;
11481 n->end_keyword_loc = *end_keyword_loc;
11482
11483 return n;
11484}
11485
11486static rb_node_sclass_t *
11487rb_node_sclass_new(struct parser_params *p, NODE *nd_recv, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *class_keyword_loc, const YYLTYPE *operator_loc, const YYLTYPE *end_keyword_loc)
11488{
11489 /* Keep the order of node creation */
11490 NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc);
11491 rb_node_sclass_t *n = NODE_NEWNODE(NODE_SCLASS, rb_node_sclass_t, loc);
11492 RNODE_SCOPE(scope)->nd_parent = &n->node;
11493 n->nd_recv = nd_recv;
11494 n->nd_body = scope;
11495 n->class_keyword_loc = *class_keyword_loc;
11496 n->operator_loc = *operator_loc;
11497 n->end_keyword_loc = *end_keyword_loc;
11498
11499 return n;
11500}
11501
11502static rb_node_module_t *
11503rb_node_module_new(struct parser_params *p, NODE *nd_cpath, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *module_keyword_loc, const YYLTYPE *end_keyword_loc)
11504{
11505 /* Keep the order of node creation */
11506 NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc);
11507 rb_node_module_t *n = NODE_NEWNODE(NODE_MODULE, rb_node_module_t, loc);
11508 RNODE_SCOPE(scope)->nd_parent = &n->node;
11509 n->nd_cpath = nd_cpath;
11510 n->nd_body = scope;
11511 n->module_keyword_loc = *module_keyword_loc;
11512 n->end_keyword_loc = *end_keyword_loc;
11513
11514 return n;
11515}
11516
11517static rb_node_iter_t *
11518rb_node_iter_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc)
11519{
11520 /* Keep the order of node creation */
11521 NODE *scope = NEW_SCOPE(nd_args, nd_body, NULL, loc);
11522 rb_node_iter_t *n = NODE_NEWNODE(NODE_ITER, rb_node_iter_t, loc);
11523 RNODE_SCOPE(scope)->nd_parent = &n->node;
11524 n->nd_body = scope;
11525 n->nd_iter = 0;
11526
11527 return n;
11528}
11529
11530static rb_node_lambda_t *
11531rb_node_lambda_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc)
11532{
11533 /* Keep the order of node creation */
11534 NODE *scope = NEW_SCOPE(nd_args, nd_body, NULL, loc);
11535 YYLTYPE lambda_loc = code_loc_gen(operator_loc, closing_loc);
11536 rb_node_lambda_t *n = NODE_NEWNODE(NODE_LAMBDA, rb_node_lambda_t, &lambda_loc);
11537 RNODE_SCOPE(scope)->nd_parent = &n->node;
11538 n->nd_body = scope;
11539 n->operator_loc = *operator_loc;
11540 n->opening_loc = *opening_loc;
11541 n->closing_loc = *closing_loc;
11542
11543 return n;
11544}
11545
11546static rb_node_case_t *
11547rb_node_case_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc)
11548{
11549 rb_node_case_t *n = NODE_NEWNODE(NODE_CASE, rb_node_case_t, loc);
11550 n->nd_head = nd_head;
11551 n->nd_body = nd_body;
11552 n->case_keyword_loc = *case_keyword_loc;
11553 n->end_keyword_loc = *end_keyword_loc;
11554
11555 return n;
11556}
11557
11558static rb_node_case2_t *
11559rb_node_case2_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc)
11560{
11561 rb_node_case2_t *n = NODE_NEWNODE(NODE_CASE2, rb_node_case2_t, loc);
11562 n->nd_head = 0;
11563 n->nd_body = nd_body;
11564 n->case_keyword_loc = *case_keyword_loc;
11565 n->end_keyword_loc = *end_keyword_loc;
11566
11567 return n;
11568}
11569
11570static rb_node_case3_t *
11571rb_node_case3_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *case_keyword_loc, const YYLTYPE *end_keyword_loc)
11572{
11573 rb_node_case3_t *n = NODE_NEWNODE(NODE_CASE3, rb_node_case3_t, loc);
11574 n->nd_head = nd_head;
11575 n->nd_body = nd_body;
11576 n->case_keyword_loc = *case_keyword_loc;
11577 n->end_keyword_loc = *end_keyword_loc;
11578
11579 return n;
11580}
11581
11582static rb_node_when_t *
11583rb_node_when_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *then_keyword_loc)
11584{
11585 rb_node_when_t *n = NODE_NEWNODE(NODE_WHEN, rb_node_when_t, loc);
11586 n->nd_head = nd_head;
11587 n->nd_body = nd_body;
11588 n->nd_next = nd_next;
11589 n->keyword_loc = *keyword_loc;
11590 n->then_keyword_loc = *then_keyword_loc;
11591
11592 return n;
11593}
11594
11595static rb_node_in_t *
11596rb_node_in_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, NODE *nd_next, const YYLTYPE *loc, const YYLTYPE *in_keyword_loc, const YYLTYPE *then_keyword_loc, const YYLTYPE *operator_loc)
11597{
11598 rb_node_in_t *n = NODE_NEWNODE(NODE_IN, rb_node_in_t, loc);
11599 n->nd_head = nd_head;
11600 n->nd_body = nd_body;
11601 n->nd_next = nd_next;
11602 n->in_keyword_loc = *in_keyword_loc;
11603 n->then_keyword_loc = *then_keyword_loc;
11604 n->operator_loc = *operator_loc;
11605
11606 return n;
11607}
11608
11609static rb_node_while_t *
11610rb_node_while_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, long nd_state, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *closing_loc)
11611{
11612 rb_node_while_t *n = NODE_NEWNODE(NODE_WHILE, rb_node_while_t, loc);
11613 n->nd_cond = nd_cond;
11614 n->nd_body = nd_body;
11615 n->nd_state = nd_state;
11616 n->keyword_loc = *keyword_loc;
11617 n->closing_loc = *closing_loc;
11618
11619 return n;
11620}
11621
11622static rb_node_until_t *
11623rb_node_until_new(struct parser_params *p, NODE *nd_cond, NODE *nd_body, long nd_state, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *closing_loc)
11624{
11625 rb_node_until_t *n = NODE_NEWNODE(NODE_UNTIL, rb_node_until_t, loc);
11626 n->nd_cond = nd_cond;
11627 n->nd_body = nd_body;
11628 n->nd_state = nd_state;
11629 n->keyword_loc = *keyword_loc;
11630 n->closing_loc = *closing_loc;
11631
11632 return n;
11633}
11634
11635static rb_node_colon2_t *
11636rb_node_colon2_new(struct parser_params *p, NODE *nd_head, ID nd_mid, const YYLTYPE *loc, const YYLTYPE *delimiter_loc, const YYLTYPE *name_loc)
11637{
11638 rb_node_colon2_t *n = NODE_NEWNODE(NODE_COLON2, rb_node_colon2_t, loc);
11639 n->nd_head = nd_head;
11640 n->nd_mid = nd_mid;
11641 n->delimiter_loc = *delimiter_loc;
11642 n->name_loc = *name_loc;
11643
11644 return n;
11645}
11646
11647static rb_node_colon3_t *
11648rb_node_colon3_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc, const YYLTYPE *delimiter_loc, const YYLTYPE *name_loc)
11649{
11650 rb_node_colon3_t *n = NODE_NEWNODE(NODE_COLON3, rb_node_colon3_t, loc);
11651 n->nd_mid = nd_mid;
11652 n->delimiter_loc = *delimiter_loc;
11653 n->name_loc = *name_loc;
11654
11655 return n;
11656}
11657
11658static rb_node_dot2_t *
11659rb_node_dot2_new(struct parser_params *p, NODE *nd_beg, NODE *nd_end, const YYLTYPE *loc, const YYLTYPE *operator_loc)
11660{
11661 rb_node_dot2_t *n = NODE_NEWNODE(NODE_DOT2, rb_node_dot2_t, loc);
11662 n->nd_beg = nd_beg;
11663 n->nd_end = nd_end;
11664 n->operator_loc = *operator_loc;
11665
11666 return n;
11667}
11668
11669static rb_node_dot3_t *
11670rb_node_dot3_new(struct parser_params *p, NODE *nd_beg, NODE *nd_end, const YYLTYPE *loc, const YYLTYPE *operator_loc)
11671{
11672 rb_node_dot3_t *n = NODE_NEWNODE(NODE_DOT3, rb_node_dot3_t, loc);
11673 n->nd_beg = nd_beg;
11674 n->nd_end = nd_end;
11675 n->operator_loc = *operator_loc;
11676
11677 return n;
11678}
11679
11680static rb_node_self_t *
11681rb_node_self_new(struct parser_params *p, const YYLTYPE *loc)
11682{
11683 rb_node_self_t *n = NODE_NEWNODE(NODE_SELF, rb_node_self_t, loc);
11684 n->nd_state = 1;
11685
11686 return n;
11687}
11688
11689static rb_node_nil_t *
11690rb_node_nil_new(struct parser_params *p, const YYLTYPE *loc)
11691{
11692 rb_node_nil_t *n = NODE_NEWNODE(NODE_NIL, rb_node_nil_t, loc);
11693
11694 return n;
11695}
11696
11697static rb_node_true_t *
11698rb_node_true_new(struct parser_params *p, const YYLTYPE *loc)
11699{
11700 rb_node_true_t *n = NODE_NEWNODE(NODE_TRUE, rb_node_true_t, loc);
11701
11702 return n;
11703}
11704
11705static rb_node_false_t *
11706rb_node_false_new(struct parser_params *p, const YYLTYPE *loc)
11707{
11708 rb_node_false_t *n = NODE_NEWNODE(NODE_FALSE, rb_node_false_t, loc);
11709
11710 return n;
11711}
11712
11713static rb_node_super_t *
11714rb_node_super_new(struct parser_params *p, NODE *nd_args, const YYLTYPE *loc,
11715 const YYLTYPE *keyword_loc, const YYLTYPE *lparen_loc, const YYLTYPE *rparen_loc)
11716{
11717 rb_node_super_t *n = NODE_NEWNODE(NODE_SUPER, rb_node_super_t, loc);
11718 n->nd_args = nd_args;
11719 n->keyword_loc = *keyword_loc;
11720 n->lparen_loc = *lparen_loc;
11721 n->rparen_loc = *rparen_loc;
11722
11723 return n;
11724}
11725
11726static rb_node_zsuper_t *
11727rb_node_zsuper_new(struct parser_params *p, const YYLTYPE *loc)
11728{
11729 rb_node_zsuper_t *n = NODE_NEWNODE(NODE_ZSUPER, rb_node_zsuper_t, loc);
11730
11731 return n;
11732}
11733
11734static rb_node_match2_t *
11735rb_node_match2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc)
11736{
11737 rb_node_match2_t *n = NODE_NEWNODE(NODE_MATCH2, rb_node_match2_t, loc);
11738 n->nd_recv = nd_recv;
11739 n->nd_value = nd_value;
11740 n->nd_args = 0;
11741
11742 return n;
11743}
11744
11745static rb_node_match3_t *
11746rb_node_match3_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc)
11747{
11748 rb_node_match3_t *n = NODE_NEWNODE(NODE_MATCH3, rb_node_match3_t, loc);
11749 n->nd_recv = nd_recv;
11750 n->nd_value = nd_value;
11751
11752 return n;
11753}
11754
11755/* TODO: Use union for NODE_LIST2 */
11756static rb_node_list_t *
11757rb_node_list_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc)
11758{
11759 rb_node_list_t *n = NODE_NEWNODE(NODE_LIST, rb_node_list_t, loc);
11760 n->nd_head = nd_head;
11761 n->as.nd_alen = 1;
11762 n->nd_next = 0;
11763
11764 return n;
11765}
11766
11767static rb_node_list_t *
11768rb_node_list_new2(struct parser_params *p, NODE *nd_head, long nd_alen, NODE *nd_next, const YYLTYPE *loc)
11769{
11770 rb_node_list_t *n = NODE_NEWNODE(NODE_LIST, rb_node_list_t, loc);
11771 n->nd_head = nd_head;
11772 n->as.nd_alen = nd_alen;
11773 n->nd_next = nd_next;
11774
11775 return n;
11776}
11777
11778static rb_node_zlist_t *
11779rb_node_zlist_new(struct parser_params *p, const YYLTYPE *loc)
11780{
11781 rb_node_zlist_t *n = NODE_NEWNODE(NODE_ZLIST, rb_node_zlist_t, loc);
11782
11783 return n;
11784}
11785
11786static rb_node_hash_t *
11787rb_node_hash_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc)
11788{
11789 rb_node_hash_t *n = NODE_NEWNODE(NODE_HASH, rb_node_hash_t, loc);
11790 n->nd_head = nd_head;
11791 n->nd_brace = 0;
11792
11793 return n;
11794}
11795
11796static rb_node_masgn_t *
11797rb_node_masgn_new(struct parser_params *p, NODE *nd_head, NODE *nd_args, const YYLTYPE *loc)
11798{
11799 rb_node_masgn_t *n = NODE_NEWNODE(NODE_MASGN, rb_node_masgn_t, loc);
11800 n->nd_head = nd_head;
11801 n->nd_value = 0;
11802 n->nd_args = nd_args;
11803
11804 return n;
11805}
11806
11807static rb_node_gasgn_t *
11808rb_node_gasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc)
11809{
11810 rb_node_gasgn_t *n = NODE_NEWNODE(NODE_GASGN, rb_node_gasgn_t, loc);
11811 n->nd_vid = nd_vid;
11812 n->nd_value = nd_value;
11813
11814 return n;
11815}
11816
11817static rb_node_lasgn_t *
11818rb_node_lasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc)
11819{
11820 rb_node_lasgn_t *n = NODE_NEWNODE(NODE_LASGN, rb_node_lasgn_t, loc);
11821 n->nd_vid = nd_vid;
11822 n->nd_value = nd_value;
11823
11824 return n;
11825}
11826
11827static rb_node_dasgn_t *
11828rb_node_dasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc)
11829{
11830 rb_node_dasgn_t *n = NODE_NEWNODE(NODE_DASGN, rb_node_dasgn_t, loc);
11831 n->nd_vid = nd_vid;
11832 n->nd_value = nd_value;
11833
11834 return n;
11835}
11836
11837static rb_node_iasgn_t *
11838rb_node_iasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc)
11839{
11840 rb_node_iasgn_t *n = NODE_NEWNODE(NODE_IASGN, rb_node_iasgn_t, loc);
11841 n->nd_vid = nd_vid;
11842 n->nd_value = nd_value;
11843
11844 return n;
11845}
11846
11847static rb_node_cvasgn_t *
11848rb_node_cvasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc)
11849{
11850 rb_node_cvasgn_t *n = NODE_NEWNODE(NODE_CVASGN, rb_node_cvasgn_t, loc);
11851 n->nd_vid = nd_vid;
11852 n->nd_value = nd_value;
11853
11854 return n;
11855}
11856
11857static rb_node_op_asgn1_t *
11858rb_node_op_asgn1_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *index, NODE *rvalue, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc)
11859{
11860 rb_node_op_asgn1_t *n = NODE_NEWNODE(NODE_OP_ASGN1, rb_node_op_asgn1_t, loc);
11861 n->nd_recv = nd_recv;
11862 n->nd_mid = nd_mid;
11863 n->nd_index = index;
11864 n->nd_rvalue = rvalue;
11865 n->call_operator_loc = *call_operator_loc;
11866 n->opening_loc = *opening_loc;
11867 n->closing_loc = *closing_loc;
11868 n->binary_operator_loc = *binary_operator_loc;
11869
11870 return n;
11871}
11872
11873static rb_node_op_asgn2_t *
11874rb_node_op_asgn2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, ID nd_vid, ID nd_mid, bool nd_aid, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *message_loc, const YYLTYPE *binary_operator_loc)
11875{
11876 rb_node_op_asgn2_t *n = NODE_NEWNODE(NODE_OP_ASGN2, rb_node_op_asgn2_t, loc);
11877 n->nd_recv = nd_recv;
11878 n->nd_value = nd_value;
11879 n->nd_vid = nd_vid;
11880 n->nd_mid = nd_mid;
11881 n->nd_aid = nd_aid;
11882 n->call_operator_loc = *call_operator_loc;
11883 n->message_loc = *message_loc;
11884 n->binary_operator_loc = *binary_operator_loc;
11885
11886 return n;
11887}
11888
11889static rb_node_op_asgn_or_t *
11890rb_node_op_asgn_or_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, const YYLTYPE *loc)
11891{
11892 rb_node_op_asgn_or_t *n = NODE_NEWNODE(NODE_OP_ASGN_OR, rb_node_op_asgn_or_t, loc);
11893 n->nd_head = nd_head;
11894 n->nd_value = nd_value;
11895
11896 return n;
11897}
11898
11899static rb_node_op_asgn_and_t *
11900rb_node_op_asgn_and_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, const YYLTYPE *loc)
11901{
11902 rb_node_op_asgn_and_t *n = NODE_NEWNODE(NODE_OP_ASGN_AND, rb_node_op_asgn_and_t, loc);
11903 n->nd_head = nd_head;
11904 n->nd_value = nd_value;
11905
11906 return n;
11907}
11908
11909static rb_node_gvar_t *
11910rb_node_gvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11911{
11912 rb_node_gvar_t *n = NODE_NEWNODE(NODE_GVAR, rb_node_gvar_t, loc);
11913 n->nd_vid = nd_vid;
11914
11915 return n;
11916}
11917
11918static rb_node_lvar_t *
11919rb_node_lvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11920{
11921 rb_node_lvar_t *n = NODE_NEWNODE(NODE_LVAR, rb_node_lvar_t, loc);
11922 n->nd_vid = nd_vid;
11923
11924 return n;
11925}
11926
11927static rb_node_dvar_t *
11928rb_node_dvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11929{
11930 rb_node_dvar_t *n = NODE_NEWNODE(NODE_DVAR, rb_node_dvar_t, loc);
11931 n->nd_vid = nd_vid;
11932
11933 return n;
11934}
11935
11936static rb_node_ivar_t *
11937rb_node_ivar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11938{
11939 rb_node_ivar_t *n = NODE_NEWNODE(NODE_IVAR, rb_node_ivar_t, loc);
11940 n->nd_vid = nd_vid;
11941
11942 return n;
11943}
11944
11945static rb_node_const_t *
11946rb_node_const_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11947{
11948 rb_node_const_t *n = NODE_NEWNODE(NODE_CONST, rb_node_const_t, loc);
11949 n->nd_vid = nd_vid;
11950
11951 return n;
11952}
11953
11954static rb_node_cvar_t *
11955rb_node_cvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc)
11956{
11957 rb_node_cvar_t *n = NODE_NEWNODE(NODE_CVAR, rb_node_cvar_t, loc);
11958 n->nd_vid = nd_vid;
11959
11960 return n;
11961}
11962
11963static rb_node_nth_ref_t *
11964rb_node_nth_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc)
11965{
11966 rb_node_nth_ref_t *n = NODE_NEWNODE(NODE_NTH_REF, rb_node_nth_ref_t, loc);
11967 n->nd_nth = nd_nth;
11968
11969 return n;
11970}
11971
11972static rb_node_back_ref_t *
11973rb_node_back_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc)
11974{
11975 rb_node_back_ref_t *n = NODE_NEWNODE(NODE_BACK_REF, rb_node_back_ref_t, loc);
11976 n->nd_nth = nd_nth;
11977
11978 return n;
11979}
11980
11981static rb_node_integer_t *
11982rb_node_integer_new(struct parser_params *p, char* val, int base, const YYLTYPE *loc)
11983{
11984 rb_node_integer_t *n = NODE_NEWNODE(NODE_INTEGER, rb_node_integer_t, loc);
11985 n->val = val;
11986 n->minus = FALSE;
11987 n->base = base;
11988
11989 return n;
11990}
11991
11992static rb_node_float_t *
11993rb_node_float_new(struct parser_params *p, char* val, const YYLTYPE *loc)
11994{
11995 rb_node_float_t *n = NODE_NEWNODE(NODE_FLOAT, rb_node_float_t, loc);
11996 n->val = val;
11997 n->minus = FALSE;
11998
11999 return n;
12000}
12001
12002static rb_node_rational_t *
12003rb_node_rational_new(struct parser_params *p, char* val, int base, int seen_point, const YYLTYPE *loc)
12004{
12005 rb_node_rational_t *n = NODE_NEWNODE(NODE_RATIONAL, rb_node_rational_t, loc);
12006 n->val = val;
12007 n->minus = FALSE;
12008 n->base = base;
12009 n->seen_point = seen_point;
12010
12011 return n;
12012}
12013
12014static rb_node_imaginary_t *
12015rb_node_imaginary_new(struct parser_params *p, char* val, int base, int seen_point, enum rb_numeric_type numeric_type, const YYLTYPE *loc)
12016{
12017 rb_node_imaginary_t *n = NODE_NEWNODE(NODE_IMAGINARY, rb_node_imaginary_t, loc);
12018 n->val = val;
12019 n->minus = FALSE;
12020 n->base = base;
12021 n->seen_point = seen_point;
12022 n->type = numeric_type;
12023
12024 return n;
12025}
12026
12027static rb_node_str_t *
12028rb_node_str_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc)
12029{
12030 rb_node_str_t *n = NODE_NEWNODE(NODE_STR, rb_node_str_t, loc);
12031 n->string = string;
12032
12033 return n;
12034}
12035
12036/* TODO; Use union for NODE_DSTR2 */
12037static rb_node_dstr_t *
12038rb_node_dstr_new0(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc)
12039{
12040 rb_node_dstr_t *n = NODE_NEWNODE(NODE_DSTR, rb_node_dstr_t, loc);
12041 n->string = string;
12042 n->as.nd_alen = nd_alen;
12043 n->nd_next = (rb_node_list_t *)nd_next;
12044
12045 return n;
12046}
12047
12048static rb_node_dstr_t *
12049rb_node_dstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc)
12050{
12051 return rb_node_dstr_new0(p, string, 1, 0, loc);
12052}
12053
12054static rb_node_xstr_t *
12055rb_node_xstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc)
12056{
12057 rb_node_xstr_t *n = NODE_NEWNODE(NODE_XSTR, rb_node_xstr_t, loc);
12058 n->string = string;
12059
12060 return n;
12061}
12062
12063static rb_node_dxstr_t *
12064rb_node_dxstr_new(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc)
12065{
12066 rb_node_dxstr_t *n = NODE_NEWNODE(NODE_DXSTR, rb_node_dxstr_t, loc);
12067 n->string = string;
12068 n->as.nd_alen = nd_alen;
12069 n->nd_next = (rb_node_list_t *)nd_next;
12070
12071 return n;
12072}
12073
12074static rb_node_sym_t *
12075rb_node_sym_new(struct parser_params *p, VALUE str, const YYLTYPE *loc)
12076{
12077 rb_node_sym_t *n = NODE_NEWNODE(NODE_SYM, rb_node_sym_t, loc);
12078 n->string = rb_str_to_parser_string(p, str);
12079
12080 return n;
12081}
12082
12083static rb_node_dsym_t *
12084rb_node_dsym_new(struct parser_params *p, rb_parser_string_t *string, long nd_alen, NODE *nd_next, const YYLTYPE *loc)
12085{
12086 rb_node_dsym_t *n = NODE_NEWNODE(NODE_DSYM, rb_node_dsym_t, loc);
12087 n->string = string;
12088 n->as.nd_alen = nd_alen;
12089 n->nd_next = (rb_node_list_t *)nd_next;
12090
12091 return n;
12092}
12093
12094static rb_node_evstr_t *
12095rb_node_evstr_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc)
12096{
12097 rb_node_evstr_t *n = NODE_NEWNODE(NODE_EVSTR, rb_node_evstr_t, loc);
12098 n->nd_body = nd_body;
12099 n->opening_loc = *opening_loc;
12100 n->closing_loc = *closing_loc;
12101
12102 return n;
12103}
12104
12105static rb_node_regx_t *
12106rb_node_regx_new(struct parser_params *p, rb_parser_string_t *string, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc)
12107{
12108 rb_node_regx_t *n = NODE_NEWNODE(NODE_REGX, rb_node_regx_t, loc);
12109 n->string = string;
12110 n->options = options & RE_OPTION_MASK;
12111 n->opening_loc = *opening_loc;
12112 n->content_loc = *content_loc;
12113 n->closing_loc = *closing_loc;
12114
12115 return n;
12116}
12117
12118static rb_node_call_t *
12119rb_node_call_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc)
12120{
12121 rb_node_call_t *n = NODE_NEWNODE(NODE_CALL, rb_node_call_t, loc);
12122 n->nd_recv = nd_recv;
12123 n->nd_mid = nd_mid;
12124 n->nd_args = nd_args;
12125
12126 return n;
12127}
12128
12129static rb_node_opcall_t *
12130rb_node_opcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc)
12131{
12132 rb_node_opcall_t *n = NODE_NEWNODE(NODE_OPCALL, rb_node_opcall_t, loc);
12133 n->nd_recv = nd_recv;
12134 n->nd_mid = nd_mid;
12135 n->nd_args = nd_args;
12136
12137 return n;
12138}
12139
12140static rb_node_fcall_t *
12141rb_node_fcall_new(struct parser_params *p, ID nd_mid, NODE *nd_args, const YYLTYPE *loc)
12142{
12143 rb_node_fcall_t *n = NODE_NEWNODE(NODE_FCALL, rb_node_fcall_t, loc);
12144 n->nd_mid = nd_mid;
12145 n->nd_args = nd_args;
12146
12147 return n;
12148}
12149
12150static rb_node_qcall_t *
12151rb_node_qcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc)
12152{
12153 rb_node_qcall_t *n = NODE_NEWNODE(NODE_QCALL, rb_node_qcall_t, loc);
12154 n->nd_recv = nd_recv;
12155 n->nd_mid = nd_mid;
12156 n->nd_args = nd_args;
12157
12158 return n;
12159}
12160
12161static rb_node_vcall_t *
12162rb_node_vcall_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc)
12163{
12164 rb_node_vcall_t *n = NODE_NEWNODE(NODE_VCALL, rb_node_vcall_t, loc);
12165 n->nd_mid = nd_mid;
12166
12167 return n;
12168}
12169
12170static rb_node_once_t *
12171rb_node_once_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc)
12172{
12173 rb_node_once_t *n = NODE_NEWNODE(NODE_ONCE, rb_node_once_t, loc);
12174 n->nd_body = nd_body;
12175
12176 return n;
12177}
12178
12179static rb_node_args_t *
12180rb_node_args_new(struct parser_params *p, const YYLTYPE *loc)
12181{
12182 rb_node_args_t *n = NODE_NEWNODE(NODE_ARGS, rb_node_args_t, loc);
12183 MEMZERO(&n->nd_ainfo, struct rb_args_info, 1);
12184
12185 return n;
12186}
12187
12188static rb_node_args_aux_t *
12189rb_node_args_aux_new(struct parser_params *p, ID nd_pid, int nd_plen, const YYLTYPE *loc)
12190{
12191 rb_node_args_aux_t *n = NODE_NEWNODE(NODE_ARGS_AUX, rb_node_args_aux_t, loc);
12192 n->nd_pid = nd_pid;
12193 n->nd_plen = nd_plen;
12194 n->nd_next = 0;
12195
12196 return n;
12197}
12198
12199static rb_node_opt_arg_t *
12200rb_node_opt_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc)
12201{
12202 rb_node_opt_arg_t *n = NODE_NEWNODE(NODE_OPT_ARG, rb_node_opt_arg_t, loc);
12203 n->nd_body = nd_body;
12204 n->nd_next = 0;
12205
12206 return n;
12207}
12208
12209static rb_node_kw_arg_t *
12210rb_node_kw_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc)
12211{
12212 rb_node_kw_arg_t *n = NODE_NEWNODE(NODE_KW_ARG, rb_node_kw_arg_t, loc);
12213 n->nd_body = nd_body;
12214 n->nd_next = 0;
12215
12216 return n;
12217}
12218
12219static rb_node_postarg_t *
12220rb_node_postarg_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc)
12221{
12222 rb_node_postarg_t *n = NODE_NEWNODE(NODE_POSTARG, rb_node_postarg_t, loc);
12223 n->nd_1st = nd_1st;
12224 n->nd_2nd = nd_2nd;
12225
12226 return n;
12227}
12228
12229static rb_node_argscat_t *
12230rb_node_argscat_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc)
12231{
12232 rb_node_argscat_t *n = NODE_NEWNODE(NODE_ARGSCAT, rb_node_argscat_t, loc);
12233 n->nd_head = nd_head;
12234 n->nd_body = nd_body;
12235
12236 return n;
12237}
12238
12239static rb_node_argspush_t *
12240rb_node_argspush_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc)
12241{
12242 rb_node_argspush_t *n = NODE_NEWNODE(NODE_ARGSPUSH, rb_node_argspush_t, loc);
12243 n->nd_head = nd_head;
12244 n->nd_body = nd_body;
12245
12246 return n;
12247}
12248
12249static rb_node_splat_t *
12250rb_node_splat_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *operator_loc)
12251{
12252 rb_node_splat_t *n = NODE_NEWNODE(NODE_SPLAT, rb_node_splat_t, loc);
12253 n->nd_head = nd_head;
12254 n->operator_loc = *operator_loc;
12255
12256 return n;
12257}
12258
12259static rb_node_block_pass_t *
12260rb_node_block_pass_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc)
12261{
12262 rb_node_block_pass_t *n = NODE_NEWNODE(NODE_BLOCK_PASS, rb_node_block_pass_t, loc);
12263 n->forwarding = 0;
12264 n->nd_head = 0;
12265 n->nd_body = nd_body;
12266 n->operator_loc = *operator_loc;
12267
12268 return n;
12269}
12270
12271static rb_node_alias_t *
12272rb_node_alias_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12273{
12274 rb_node_alias_t *n = NODE_NEWNODE(NODE_ALIAS, rb_node_alias_t, loc);
12275 n->nd_1st = nd_1st;
12276 n->nd_2nd = nd_2nd;
12277 n->keyword_loc = *keyword_loc;
12278
12279 return n;
12280}
12281
12282static rb_node_valias_t *
12283rb_node_valias_new(struct parser_params *p, ID nd_alias, ID nd_orig, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12284{
12285 rb_node_valias_t *n = NODE_NEWNODE(NODE_VALIAS, rb_node_valias_t, loc);
12286 n->nd_alias = nd_alias;
12287 n->nd_orig = nd_orig;
12288 n->keyword_loc = *keyword_loc;
12289
12290 return n;
12291}
12292
12293static rb_node_undef_t *
12294rb_node_undef_new(struct parser_params *p, NODE *nd_undef, const YYLTYPE *loc)
12295{
12296 rb_node_undef_t *n = NODE_NEWNODE(NODE_UNDEF, rb_node_undef_t, loc);
12297 n->nd_undefs = rb_parser_ary_new_capa_for_node(p, 1);
12298 n->keyword_loc = NULL_LOC;
12299 rb_parser_ary_push_node(p, n->nd_undefs, nd_undef);
12300
12301 return n;
12302}
12303
12304static rb_node_errinfo_t *
12305rb_node_errinfo_new(struct parser_params *p, const YYLTYPE *loc)
12306{
12307 rb_node_errinfo_t *n = NODE_NEWNODE(NODE_ERRINFO, rb_node_errinfo_t, loc);
12308
12309 return n;
12310}
12311
12312static rb_node_defined_t *
12313rb_node_defined_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12314{
12315 rb_node_defined_t *n = NODE_NEWNODE(NODE_DEFINED, rb_node_defined_t, loc);
12316 n->nd_head = nd_head;
12317 n->keyword_loc = *keyword_loc;
12318
12319 return n;
12320}
12321
12322static rb_node_postexe_t *
12323rb_node_postexe_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc)
12324{
12325 rb_node_postexe_t *n = NODE_NEWNODE(NODE_POSTEXE, rb_node_postexe_t, loc);
12326 n->nd_body = nd_body;
12327 n->keyword_loc = *keyword_loc;
12328 n->opening_loc = *opening_loc;
12329 n->closing_loc = *closing_loc;
12330
12331 return n;
12332}
12333
12334static rb_node_attrasgn_t *
12335rb_node_attrasgn_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc)
12336{
12337 rb_node_attrasgn_t *n = NODE_NEWNODE(NODE_ATTRASGN, rb_node_attrasgn_t, loc);
12338 n->nd_recv = nd_recv;
12339 n->nd_mid = nd_mid;
12340 n->nd_args = nd_args;
12341
12342 return n;
12343}
12344
12345static rb_node_aryptn_t *
12346rb_node_aryptn_new(struct parser_params *p, NODE *pre_args, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc)
12347{
12348 rb_node_aryptn_t *n = NODE_NEWNODE(NODE_ARYPTN, rb_node_aryptn_t, loc);
12349 n->nd_pconst = 0;
12350 n->pre_args = pre_args;
12351 n->rest_arg = rest_arg;
12352 n->post_args = post_args;
12353
12354 return n;
12355}
12356
12357static rb_node_hshptn_t *
12358rb_node_hshptn_new(struct parser_params *p, NODE *nd_pconst, NODE *nd_pkwargs, NODE *nd_pkwrestarg, const YYLTYPE *loc)
12359{
12360 rb_node_hshptn_t *n = NODE_NEWNODE(NODE_HSHPTN, rb_node_hshptn_t, loc);
12361 n->nd_pconst = nd_pconst;
12362 n->nd_pkwargs = nd_pkwargs;
12363 n->nd_pkwrestarg = nd_pkwrestarg;
12364
12365 return n;
12366}
12367
12368static rb_node_fndptn_t *
12369rb_node_fndptn_new(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc)
12370{
12371 rb_node_fndptn_t *n = NODE_NEWNODE(NODE_FNDPTN, rb_node_fndptn_t, loc);
12372 n->nd_pconst = 0;
12373 n->pre_rest_arg = pre_rest_arg;
12374 n->args = args;
12375 n->post_rest_arg = post_rest_arg;
12376
12377 return n;
12378}
12379
12380static rb_node_line_t *
12381rb_node_line_new(struct parser_params *p, const YYLTYPE *loc)
12382{
12383 rb_node_line_t *n = NODE_NEWNODE(NODE_LINE, rb_node_line_t, loc);
12384
12385 return n;
12386}
12387
12388static rb_node_file_t *
12389rb_node_file_new(struct parser_params *p, VALUE str, const YYLTYPE *loc)
12390{
12391 rb_node_file_t *n = NODE_NEWNODE(NODE_FILE, rb_node_file_t, loc);
12392 n->path = rb_str_to_parser_string(p, str);
12393
12394 return n;
12395}
12396
12397static rb_node_encoding_t *
12398rb_node_encoding_new(struct parser_params *p, const YYLTYPE *loc)
12399{
12400 rb_node_encoding_t *n = NODE_NEWNODE(NODE_ENCODING, rb_node_encoding_t, loc);
12401 n->enc = p->enc;
12402
12403 return n;
12404}
12405
12406static rb_node_cdecl_t *
12407rb_node_cdecl_new(struct parser_params *p, ID nd_vid, NODE *nd_value, NODE *nd_else, enum rb_parser_shareability shareability, const YYLTYPE *loc)
12408{
12409 rb_node_cdecl_t *n = NODE_NEWNODE(NODE_CDECL, rb_node_cdecl_t, loc);
12410 n->nd_vid = nd_vid;
12411 n->nd_value = nd_value;
12412 n->nd_else = nd_else;
12413 n->shareability = shareability;
12414
12415 return n;
12416}
12417
12418static rb_node_op_cdecl_t *
12419rb_node_op_cdecl_new(struct parser_params *p, NODE *nd_head, NODE *nd_value, ID nd_aid, enum rb_parser_shareability shareability, const YYLTYPE *loc)
12420{
12421 rb_node_op_cdecl_t *n = NODE_NEWNODE(NODE_OP_CDECL, rb_node_op_cdecl_t, loc);
12422 n->nd_head = nd_head;
12423 n->nd_value = nd_value;
12424 n->nd_aid = nd_aid;
12425 n->shareability = shareability;
12426
12427 return n;
12428}
12429
12430static rb_node_error_t *
12431rb_node_error_new(struct parser_params *p, const YYLTYPE *loc)
12432{
12433 rb_node_error_t *n = NODE_NEWNODE(NODE_ERROR, rb_node_error_t, loc);
12434
12435 return n;
12436}
12437
12438static rb_node_break_t *
12439rb_node_break_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12440{
12441 rb_node_break_t *n = NODE_NEWNODE(NODE_BREAK, rb_node_break_t, loc);
12442 n->nd_stts = nd_stts;
12443 n->nd_chain = 0;
12444 n->keyword_loc = *keyword_loc;
12445
12446 return n;
12447}
12448
12449static rb_node_next_t *
12450rb_node_next_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12451{
12452 rb_node_next_t *n = NODE_NEWNODE(NODE_NEXT, rb_node_next_t, loc);
12453 n->nd_stts = nd_stts;
12454 n->nd_chain = 0;
12455 n->keyword_loc = *keyword_loc;
12456
12457 return n;
12458}
12459
12460static rb_node_redo_t *
12461rb_node_redo_new(struct parser_params *p, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
12462{
12463 rb_node_redo_t *n = NODE_NEWNODE(NODE_REDO, rb_node_redo_t, loc);
12464 n->nd_chain = 0;
12465 n->keyword_loc = *keyword_loc;
12466
12467 return n;
12468}
12469
12470static rb_node_def_temp_t *
12471rb_node_def_temp_new(struct parser_params *p, const YYLTYPE *loc)
12472{
12473 rb_node_def_temp_t *n = NODE_NEWNODE((enum node_type)NODE_DEF_TEMP, rb_node_def_temp_t, loc);
12474 n->save.numparam_save = 0;
12475 n->save.max_numparam = 0;
12476 n->save.ctxt = p->ctxt;
12477 n->nd_def = 0;
12478 n->nd_mid = 0;
12479
12480 return n;
12481}
12482
12483static rb_node_def_temp_t *
12484def_head_save(struct parser_params *p, rb_node_def_temp_t *n)
12485{
12486 n->save.numparam_save = numparam_push(p);
12487 n->save.max_numparam = p->max_numparam;
12488 return n;
12489}
12490
12491#ifndef RIPPER
12492static enum node_type
12493nodetype(NODE *node) /* for debug */
12494{
12495 return (enum node_type)nd_type(node);
12496}
12497
12498static int
12499nodeline(NODE *node)
12500{
12501 return nd_line(node);
12502}
12503#endif
12504
12505static NODE*
12506newline_node(NODE *node)
12507{
12508 if (node) {
12509 node = remove_begin(node);
12510 nd_set_fl_newline(node);
12511 }
12512 return node;
12513}
12514
12515static void
12516fixpos(NODE *node, NODE *orig)
12517{
12518 if (!node) return;
12519 if (!orig) return;
12520 nd_set_line(node, nd_line(orig));
12521}
12522
12523static NODE*
12524block_append(struct parser_params *p, NODE *head, NODE *tail)
12525{
12526 NODE *end, *h = head, *nd;
12527
12528 if (tail == 0) return head;
12529
12530 if (h == 0) return tail;
12531 switch (nd_type(h)) {
12532 default:
12533 h = end = NEW_BLOCK(head, &head->nd_loc);
12534 head = end;
12535 break;
12536 case NODE_BLOCK:
12537 end = RNODE_BLOCK(h)->nd_end;
12538 break;
12539 }
12540
12541 nd = RNODE_BLOCK(end)->nd_head;
12542 switch (nd_type(nd)) {
12543 case NODE_RETURN:
12544 case NODE_BREAK:
12545 case NODE_NEXT:
12546 case NODE_REDO:
12547 case NODE_RETRY:
12548 rb_warning0L(nd_line(tail), "statement not reached");
12549 break;
12550
12551 default:
12552 break;
12553 }
12554
12555 if (!nd_type_p(tail, NODE_BLOCK)) {
12556 tail = NEW_BLOCK(tail, &tail->nd_loc);
12557 }
12558 RNODE_BLOCK(end)->nd_next = tail;
12559 RNODE_BLOCK(h)->nd_end = RNODE_BLOCK(tail)->nd_end;
12560 nd_set_last_loc(head, nd_last_loc(tail));
12561 return head;
12562}
12563
12564/* append item to the list */
12565static NODE*
12566list_append(struct parser_params *p, NODE *list, NODE *item)
12567{
12568 NODE *last;
12569
12570 if (list == 0) return NEW_LIST(item, &item->nd_loc);
12571 if (RNODE_LIST(list)->nd_next) {
12572 last = RNODE_LIST(RNODE_LIST(list)->nd_next)->as.nd_end;
12573 }
12574 else {
12575 last = list;
12576 }
12577
12578 RNODE_LIST(list)->as.nd_alen += 1;
12579 RNODE_LIST(last)->nd_next = NEW_LIST(item, &item->nd_loc);
12580 RNODE_LIST(RNODE_LIST(list)->nd_next)->as.nd_end = RNODE_LIST(last)->nd_next;
12581
12582 nd_set_last_loc(list, nd_last_loc(item));
12583
12584 return list;
12585}
12586
12587/* concat two lists */
12588static NODE*
12589list_concat(NODE *head, NODE *tail)
12590{
12591 NODE *last;
12592
12593 if (RNODE_LIST(head)->nd_next) {
12594 last = RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end;
12595 }
12596 else {
12597 last = head;
12598 }
12599
12600 RNODE_LIST(head)->as.nd_alen += RNODE_LIST(tail)->as.nd_alen;
12601 RNODE_LIST(last)->nd_next = tail;
12602 if (RNODE_LIST(tail)->nd_next) {
12603 RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end = RNODE_LIST(RNODE_LIST(tail)->nd_next)->as.nd_end;
12604 }
12605 else {
12606 RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end = tail;
12607 }
12608
12609 nd_set_last_loc(head, nd_last_loc(tail));
12610
12611 return head;
12612}
12613
12614static int
12615literal_concat0(struct parser_params *p, rb_parser_string_t *head, rb_parser_string_t *tail)
12616{
12617 if (!tail) return 1;
12618 if (!rb_parser_enc_compatible(p, head, tail)) {
12619 compile_error(p, "string literal encodings differ (%s / %s)",
12620 rb_enc_name(rb_parser_str_get_encoding(head)),
12621 rb_enc_name(rb_parser_str_get_encoding(tail)));
12622 rb_parser_str_resize(p, head, 0);
12623 rb_parser_str_resize(p, tail, 0);
12624 return 0;
12625 }
12626 rb_parser_str_buf_append(p, head, tail);
12627 return 1;
12628}
12629
12630static rb_parser_string_t *
12631string_literal_head(struct parser_params *p, enum node_type htype, NODE *head)
12632{
12633 if (htype != NODE_DSTR) return NULL;
12634 if (RNODE_DSTR(head)->nd_next) {
12635 head = RNODE_LIST(RNODE_LIST(RNODE_DSTR(head)->nd_next)->as.nd_end)->nd_head;
12636 if (!head || !nd_type_p(head, NODE_STR)) return NULL;
12637 }
12638 rb_parser_string_t *lit = RNODE_DSTR(head)->string;
12639 ASSUME(lit);
12640 return lit;
12641}
12642
12643#ifndef RIPPER
12644static rb_parser_string_t *
12645rb_parser_string_deep_copy(struct parser_params *p, const rb_parser_string_t *orig)
12646{
12647 rb_parser_string_t *copy;
12648 if (!orig) return NULL;
12649 copy = rb_parser_string_new(p, PARSER_STRING_PTR(orig), PARSER_STRING_LEN(orig));
12650 copy->coderange = orig->coderange;
12651 copy->enc = orig->enc;
12652 return copy;
12653}
12654#endif
12655
12656/* concat two string literals */
12657static NODE *
12658literal_concat(struct parser_params *p, NODE *head, NODE *tail, const YYLTYPE *loc)
12659{
12660 enum node_type htype;
12661 rb_parser_string_t *lit;
12662
12663 if (!head) return tail;
12664 if (!tail) return head;
12665
12666 htype = nd_type(head);
12667 if (htype == NODE_EVSTR) {
12668 head = new_dstr(p, head, loc);
12669 htype = NODE_DSTR;
12670 }
12671 if (p->heredoc_indent > 0) {
12672 switch (htype) {
12673 case NODE_STR:
12674 head = str2dstr(p, head);
12675 case NODE_DSTR:
12676 return list_append(p, head, tail);
12677 default:
12678 break;
12679 }
12680 }
12681 switch (nd_type(tail)) {
12682 case NODE_STR:
12683 if ((lit = string_literal_head(p, htype, head)) != false) {
12684 htype = NODE_STR;
12685 }
12686 else {
12687 lit = RNODE_DSTR(head)->string;
12688 }
12689 if (htype == NODE_STR) {
12690 if (!literal_concat0(p, lit, RNODE_STR(tail)->string)) {
12691 error:
12692 rb_discard_node(p, head);
12693 rb_discard_node(p, tail);
12694 return 0;
12695 }
12696 rb_discard_node(p, tail);
12697 }
12698 else {
12699 list_append(p, head, tail);
12700 }
12701 break;
12702
12703 case NODE_DSTR:
12704 if (htype == NODE_STR) {
12705 if (!literal_concat0(p, RNODE_STR(head)->string, RNODE_DSTR(tail)->string))
12706 goto error;
12707 rb_parser_string_free(p, RNODE_DSTR(tail)->string);
12708 RNODE_DSTR(tail)->string = RNODE_STR(head)->string;
12709 RNODE_STR(head)->string = NULL;
12710 rb_discard_node(p, head);
12711 head = tail;
12712 }
12713 else if (!RNODE_DSTR(tail)->string) {
12714 append:
12715 RNODE_DSTR(head)->as.nd_alen += RNODE_DSTR(tail)->as.nd_alen - 1;
12716 if (!RNODE_DSTR(head)->nd_next) {
12717 RNODE_DSTR(head)->nd_next = RNODE_DSTR(tail)->nd_next;
12718 }
12719 else if (RNODE_DSTR(tail)->nd_next) {
12720 RNODE_DSTR(RNODE_DSTR(RNODE_DSTR(head)->nd_next)->as.nd_end)->nd_next = RNODE_DSTR(tail)->nd_next;
12721 RNODE_DSTR(RNODE_DSTR(head)->nd_next)->as.nd_end = RNODE_DSTR(RNODE_DSTR(tail)->nd_next)->as.nd_end;
12722 }
12723 rb_discard_node(p, tail);
12724 }
12725 else if ((lit = string_literal_head(p, htype, head)) != false) {
12726 if (!literal_concat0(p, lit, RNODE_DSTR(tail)->string))
12727 goto error;
12728 rb_parser_string_free(p, RNODE_DSTR(tail)->string);
12729 RNODE_DSTR(tail)->string = 0;
12730 goto append;
12731 }
12732 else {
12733 list_concat(head, NEW_LIST2(NEW_STR(RNODE_DSTR(tail)->string, loc), RNODE_DSTR(tail)->as.nd_alen, (NODE *)RNODE_DSTR(tail)->nd_next, loc));
12734 RNODE_DSTR(tail)->string = 0;
12735 }
12736 break;
12737
12738 case NODE_EVSTR:
12739 if (htype == NODE_STR) {
12740 head = str2dstr(p, head);
12741 RNODE_DSTR(head)->as.nd_alen = 1;
12742 }
12743 list_append(p, head, tail);
12744 break;
12745 }
12746 return head;
12747}
12748
12749static void
12750nd_copy_flag(NODE *new_node, NODE *old_node)
12751{
12752 if (nd_fl_newline(old_node)) nd_set_fl_newline(new_node);
12753 nd_set_line(new_node, nd_line(old_node));
12754 new_node->nd_loc = old_node->nd_loc;
12755 new_node->node_id = old_node->node_id;
12756}
12757
12758static NODE *
12759str2dstr(struct parser_params *p, NODE *node)
12760{
12761 NODE *new_node = (NODE *)NODE_NEW_INTERNAL(NODE_DSTR, rb_node_dstr_t);
12762 nd_copy_flag(new_node, node);
12763 RNODE_DSTR(new_node)->string = RNODE_STR(node)->string;
12764 RNODE_DSTR(new_node)->as.nd_alen = 0;
12765 RNODE_DSTR(new_node)->nd_next = 0;
12766 RNODE_STR(node)->string = 0;
12767
12768 return new_node;
12769}
12770
12771static NODE *
12772str2regx(struct parser_params *p, NODE *node, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc)
12773{
12774 NODE *new_node = (NODE *)NODE_NEW_INTERNAL(NODE_REGX, rb_node_regx_t);
12775 nd_copy_flag(new_node, node);
12776 RNODE_REGX(new_node)->string = RNODE_STR(node)->string;
12777 RNODE_REGX(new_node)->options = options;
12778 nd_set_loc(new_node, loc);
12779 RNODE_REGX(new_node)->opening_loc = *opening_loc;
12780 RNODE_REGX(new_node)->content_loc = *content_loc;
12781 RNODE_REGX(new_node)->closing_loc = *closing_loc;
12782 RNODE_STR(node)->string = 0;
12783
12784 return new_node;
12785}
12786
12787static NODE *
12788evstr2dstr(struct parser_params *p, NODE *node)
12789{
12790 if (nd_type_p(node, NODE_EVSTR)) {
12791 node = new_dstr(p, node, &node->nd_loc);
12792 }
12793 return node;
12794}
12795
12796static NODE *
12797new_evstr(struct parser_params *p, NODE *node, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc)
12798{
12799 NODE *head = node;
12800
12801 if (node) {
12802 switch (nd_type(node)) {
12803 case NODE_STR:
12804 return str2dstr(p, node);
12805 case NODE_DSTR:
12806 break;
12807 case NODE_EVSTR:
12808 return node;
12809 }
12810 }
12811 return NEW_EVSTR(head, loc, opening_loc, closing_loc);
12812}
12813
12814static NODE *
12815new_dstr(struct parser_params *p, NODE *node, const YYLTYPE *loc)
12816{
12817 NODE *dstr = NEW_DSTR(STRING_NEW0(), loc);
12818 return list_append(p, dstr, node);
12819}
12820
12821static NODE *
12822call_bin_op(struct parser_params *p, NODE *recv, ID id, NODE *arg1,
12823 const YYLTYPE *op_loc, const YYLTYPE *loc)
12824{
12825 NODE *expr;
12826 value_expr(p, recv);
12827 value_expr(p, arg1);
12828 expr = NEW_OPCALL(recv, id, NEW_LIST(arg1, &arg1->nd_loc), loc);
12829 nd_set_line(expr, op_loc->beg_pos.lineno);
12830 return expr;
12831}
12832
12833static NODE *
12834call_uni_op(struct parser_params *p, NODE *recv, ID id, const YYLTYPE *op_loc, const YYLTYPE *loc)
12835{
12836 NODE *opcall;
12837 value_expr(p, recv);
12838 opcall = NEW_OPCALL(recv, id, 0, loc);
12839 nd_set_line(opcall, op_loc->beg_pos.lineno);
12840 return opcall;
12841}
12842
12843static NODE *
12844new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc)
12845{
12846 NODE *qcall = NEW_QCALL(atype, recv, mid, args, loc);
12847 nd_set_line(qcall, op_loc->beg_pos.lineno);
12848 return qcall;
12849}
12850
12851static NODE*
12852new_command_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, NODE *block, const YYLTYPE *op_loc, const YYLTYPE *loc)
12853{
12854 NODE *ret;
12855 if (block) block_dup_check(p, args, block);
12856 ret = new_qcall(p, atype, recv, mid, args, op_loc, loc);
12857 if (block) ret = method_add_block(p, ret, block, loc);
12858 fixpos(ret, recv);
12859 return ret;
12860}
12861
12862static rb_locations_lambda_body_t*
12863new_locations_lambda_body(struct parser_params* p, NODE *node, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc)
12864{
12865 rb_locations_lambda_body_t *body = xcalloc(1, sizeof(rb_locations_lambda_body_t));
12866 body->node = node;
12867 body->opening_loc = *opening_loc;
12868 body->closing_loc = *closing_loc;
12869 return body;
12870}
12871
12872#define nd_once_body(node) (nd_type_p((node), NODE_ONCE) ? RNODE_ONCE(node)->nd_body : node)
12873
12874static NODE*
12875last_expr_once_body(NODE *node)
12876{
12877 if (!node) return 0;
12878 return nd_once_body(node);
12879}
12880
12881static NODE*
12882match_op(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *op_loc, const YYLTYPE *loc)
12883{
12884 NODE *n;
12885 int line = op_loc->beg_pos.lineno;
12886
12887 value_expr(p, node1);
12888 value_expr(p, node2);
12889
12890 if ((n = last_expr_once_body(node1)) != 0) {
12891 switch (nd_type(n)) {
12892 case NODE_DREGX:
12893 {
12894 NODE *match = NEW_MATCH2(node1, node2, loc);
12895 nd_set_line(match, line);
12896 return match;
12897 }
12898
12899 case NODE_REGX:
12900 {
12901 const VALUE lit = rb_node_regx_string_val(n);
12902 if (!NIL_P(lit)) {
12903 NODE *match = NEW_MATCH2(node1, node2, loc);
12904 RNODE_MATCH2(match)->nd_args = reg_named_capture_assign(p, lit, loc, assignable);
12905 nd_set_line(match, line);
12906 return match;
12907 }
12908 }
12909 }
12910 }
12911
12912 if ((n = last_expr_once_body(node2)) != 0) {
12913 NODE *match3;
12914
12915 switch (nd_type(n)) {
12916 case NODE_DREGX:
12917 match3 = NEW_MATCH3(node2, node1, loc);
12918 return match3;
12919 }
12920 }
12921
12922 n = NEW_CALL(node1, tMATCH, NEW_LIST(node2, &node2->nd_loc), loc);
12923 nd_set_line(n, line);
12924 return n;
12925}
12926
12927# if WARN_PAST_SCOPE
12928static int
12929past_dvar_p(struct parser_params *p, ID id)
12930{
12931 struct vtable *past = p->lvtbl->past;
12932 while (past) {
12933 if (vtable_included(past, id)) return 1;
12934 past = past->prev;
12935 }
12936 return 0;
12937}
12938# endif
12939
12940static int
12941numparam_nested_p(struct parser_params *p)
12942{
12943 struct local_vars *local = p->lvtbl;
12944 NODE *outer = local->numparam.outer;
12945 NODE *inner = local->numparam.inner;
12946 if (outer || inner) {
12947 NODE *used = outer ? outer : inner;
12948 compile_error(p, "numbered parameter is already used in %s block\n"
12949 "%s:%d: numbered parameter is already used here",
12950 outer ? "outer" : "inner",
12951 p->ruby_sourcefile, nd_line(used));
12952 parser_show_error_line(p, &used->nd_loc);
12953 return 1;
12954 }
12955 return 0;
12956}
12957
12958static int
12959numparam_used_p(struct parser_params *p)
12960{
12961 NODE *numparam = p->lvtbl->numparam.current;
12962 if (numparam) {
12963 compile_error(p, "'it' is not allowed when a numbered parameter is already used\n"
12964 "%s:%d: numbered parameter is already used here",
12965 p->ruby_sourcefile, nd_line(numparam));
12966 parser_show_error_line(p, &numparam->nd_loc);
12967 return 1;
12968 }
12969 return 0;
12970}
12971
12972static int
12973it_used_p(struct parser_params *p)
12974{
12975 NODE *it = p->lvtbl->it;
12976 if (it) {
12977 compile_error(p, "numbered parameters are not allowed when 'it' is already used\n"
12978 "%s:%d: 'it' is already used here",
12979 p->ruby_sourcefile, nd_line(it));
12980 parser_show_error_line(p, &it->nd_loc);
12981 return 1;
12982 }
12983 return 0;
12984}
12985
12986static NODE*
12987gettable(struct parser_params *p, ID id, const YYLTYPE *loc)
12988{
12989 ID *vidp = NULL;
12990 NODE *node;
12991 switch (id) {
12992 case keyword_self:
12993 return NEW_SELF(loc);
12994 case keyword_nil:
12995 return NEW_NIL(loc);
12996 case keyword_true:
12997 return NEW_TRUE(loc);
12998 case keyword_false:
12999 return NEW_FALSE(loc);
13000 case keyword__FILE__:
13001 {
13002 VALUE file = p->ruby_sourcefile_string;
13003 if (NIL_P(file))
13004 file = rb_str_new(0, 0);
13005 node = NEW_FILE(file, loc);
13006 }
13007 return node;
13008 case keyword__LINE__:
13009 return NEW_LINE(loc);
13010 case keyword__ENCODING__:
13011 return NEW_ENCODING(loc);
13012
13013 }
13014 switch (id_type(id)) {
13015 case ID_LOCAL:
13016 if (dyna_in_block(p) && dvar_defined_ref(p, id, &vidp)) {
13017 if (NUMPARAM_ID_P(id) && (numparam_nested_p(p) || it_used_p(p))) return 0;
13018 if (vidp) *vidp |= LVAR_USED;
13019 node = NEW_DVAR(id, loc);
13020 return node;
13021 }
13022 if (local_id_ref(p, id, &vidp)) {
13023 if (vidp) *vidp |= LVAR_USED;
13024 node = NEW_LVAR(id, loc);
13025 return node;
13026 }
13027 if (dyna_in_block(p) && NUMPARAM_ID_P(id) &&
13028 parser_numbered_param(p, NUMPARAM_ID_TO_IDX(id))) {
13029 if (numparam_nested_p(p) || it_used_p(p)) return 0;
13030 node = NEW_DVAR(id, loc);
13031 struct local_vars *local = p->lvtbl;
13032 if (!local->numparam.current) local->numparam.current = node;
13033 return node;
13034 }
13035# if WARN_PAST_SCOPE
13036 if (!p->ctxt.in_defined && RTEST(ruby_verbose) && past_dvar_p(p, id)) {
13037 rb_warning1("possible reference to past scope - %"PRIsWARN, rb_id2str(id));
13038 }
13039# endif
13040 /* method call without arguments */
13041 if (dyna_in_block(p) && id == idIt && !(DVARS_TERMINAL_P(p->lvtbl->args) || DVARS_TERMINAL_P(p->lvtbl->args->prev))) {
13042 if (numparam_used_p(p)) return 0;
13043 if (p->max_numparam == ORDINAL_PARAM) {
13044 compile_error(p, "ordinary parameter is defined");
13045 return 0;
13046 }
13047 if (!p->it_id) {
13048 p->it_id = idItImplicit;
13049 vtable_add(p->lvtbl->args, p->it_id);
13050 }
13051 NODE *node = NEW_DVAR(p->it_id, loc);
13052 if (!p->lvtbl->it) p->lvtbl->it = node;
13053 return node;
13054 }
13055 return NEW_VCALL(id, loc);
13056 case ID_GLOBAL:
13057 return NEW_GVAR(id, loc);
13058 case ID_INSTANCE:
13059 return NEW_IVAR(id, loc);
13060 case ID_CONST:
13061 return NEW_CONST(id, loc);
13062 case ID_CLASS:
13063 return NEW_CVAR(id, loc);
13064 }
13065 compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id));
13066 return 0;
13067}
13068
13069static rb_node_opt_arg_t *
13070opt_arg_append(rb_node_opt_arg_t *opt_list, rb_node_opt_arg_t *opt)
13071{
13072 rb_node_opt_arg_t *opts = opt_list;
13073 RNODE(opts)->nd_loc.end_pos = RNODE(opt)->nd_loc.end_pos;
13074
13075 while (opts->nd_next) {
13076 opts = opts->nd_next;
13077 RNODE(opts)->nd_loc.end_pos = RNODE(opt)->nd_loc.end_pos;
13078 }
13079 opts->nd_next = opt;
13080
13081 return opt_list;
13082}
13083
13084static rb_node_kw_arg_t *
13085kwd_append(rb_node_kw_arg_t *kwlist, rb_node_kw_arg_t *kw)
13086{
13087 if (kwlist) {
13088 /* Assume rb_node_kw_arg_t and rb_node_opt_arg_t has same structure */
13089 opt_arg_append(RNODE_OPT_ARG(kwlist), RNODE_OPT_ARG(kw));
13090 }
13091 return kwlist;
13092}
13093
13094static NODE *
13095new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc, const YYLTYPE *keyword_loc)
13096{
13097 int had_trailing_semicolon = p->ctxt.has_trailing_semicolon;
13098 p->ctxt.has_trailing_semicolon = 0;
13099
13100 NODE *n = expr;
13101 while (n) {
13102 if (nd_type_p(n, NODE_BEGIN)) {
13103 n = RNODE_BEGIN(n)->nd_body;
13104 }
13105 else if (nd_type_p(n, NODE_BLOCK) && RNODE_BLOCK(n)->nd_end == n) {
13106 n = RNODE_BLOCK(n)->nd_head;
13107 }
13108 else {
13109 break;
13110 }
13111 }
13112
13113 if (had_trailing_semicolon && !nd_type_p(expr, NODE_BLOCK)) {
13114 NODE *block = NEW_BLOCK(expr, loc);
13115 return NEW_DEFINED(block, loc, keyword_loc);
13116 }
13117
13118 return NEW_DEFINED(n, loc, keyword_loc);
13119}
13120
13121static NODE*
13122str_to_sym_node(struct parser_params *p, NODE *node, const YYLTYPE *loc)
13123{
13124 VALUE lit;
13125 rb_parser_string_t *str = RNODE_STR(node)->string;
13126 if (rb_parser_enc_str_coderange(p, str) == RB_PARSER_ENC_CODERANGE_BROKEN) {
13127 yyerror1(loc, "invalid symbol");
13128 lit = STR_NEW0();
13129 }
13130 else {
13131 lit = rb_str_new_parser_string(str);
13132 }
13133 return NEW_SYM(lit, loc);
13134}
13135
13136static NODE*
13137symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol)
13138{
13139 enum node_type type = nd_type(symbol);
13140 switch (type) {
13141 case NODE_DSTR:
13142 nd_set_type(symbol, NODE_DSYM);
13143 break;
13144 case NODE_STR:
13145 symbol = str_to_sym_node(p, symbol, &RNODE(symbol)->nd_loc);
13146 break;
13147 default:
13148 compile_error(p, "unexpected node as symbol: %s", parser_node_name(type));
13149 }
13150 return list_append(p, symbols, symbol);
13151}
13152
13153static void
13154dregex_fragment_setenc(struct parser_params *p, rb_node_dregx_t *const dreg, int options)
13155{
13156 if (dreg->string) {
13157 reg_fragment_setenc(p, dreg->string, options);
13158 }
13159 for (struct RNode_LIST *list = dreg->nd_next; list; list = RNODE_LIST(list->nd_next)) {
13160 NODE *frag = list->nd_head;
13161 if (nd_type_p(frag, NODE_STR)) {
13162 reg_fragment_setenc(p, RNODE_STR(frag)->string, options);
13163 }
13164 else if (nd_type_p(frag, NODE_DSTR)) {
13165 dregex_fragment_setenc(p, RNODE_DSTR(frag), options);
13166 }
13167 }
13168}
13169
13170static NODE *
13171new_regexp(struct parser_params *p, NODE *node, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc)
13172{
13173 if (!node) {
13174 /* Check string is valid regex */
13175 rb_parser_string_t *str = STRING_NEW0();
13176 reg_compile(p, str, options);
13177 node = NEW_REGX(str, options, loc, opening_loc, content_loc, closing_loc);
13178 return node;
13179 }
13180 switch (nd_type(node)) {
13181 case NODE_STR:
13182 {
13183 /* Check string is valid regex */
13184 reg_compile(p, RNODE_STR(node)->string, options);
13185 node = str2regx(p, node, options, loc, opening_loc, content_loc, closing_loc);
13186 }
13187 break;
13188 default:
13189 node = NEW_DSTR0(STRING_NEW0(), 1, NEW_LIST(node, loc), loc);
13190 /* fall through */
13191 case NODE_DSTR:
13192 nd_set_type(node, NODE_DREGX);
13193 nd_set_loc(node, loc);
13194 rb_node_dregx_t *const dreg = RNODE_DREGX(node);
13195 dreg->as.nd_cflag = options & RE_OPTION_MASK;
13196 if (dreg->nd_next) {
13197 dregex_fragment_setenc(p, dreg, options);
13198 }
13199 if (options & RE_OPTION_ONCE) {
13200 node = NEW_ONCE(node, loc);
13201 }
13202 break;
13203 }
13204 return node;
13205}
13206
13207static rb_node_kw_arg_t *
13208new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc)
13209{
13210 if (!k) return 0;
13211 return NEW_KW_ARG((k), loc);
13212}
13213
13214static NODE *
13215new_xstring(struct parser_params *p, NODE *node, const YYLTYPE *loc)
13216{
13217 if (!node) {
13218 NODE *xstr = NEW_XSTR(STRING_NEW0(), loc);
13219 return xstr;
13220 }
13221 switch (nd_type(node)) {
13222 case NODE_STR:
13223 nd_set_type(node, NODE_XSTR);
13224 nd_set_loc(node, loc);
13225 break;
13226 case NODE_DSTR:
13227 nd_set_type(node, NODE_DXSTR);
13228 nd_set_loc(node, loc);
13229 break;
13230 default:
13231 node = NEW_DXSTR(0, 1, NEW_LIST(node, loc), loc);
13232 break;
13233 }
13234 return node;
13235}
13236
13237static const
13238struct st_hash_type literal_type = {
13239 literal_cmp,
13240 literal_hash,
13241};
13242
13243static int nd_type_st_key_enable_p(NODE *node);
13244
13245static void
13246check_literal_when(struct parser_params *p, NODE *arg, const YYLTYPE *loc)
13247{
13248 /* See https://bugs.ruby-lang.org/issues/20331 for discussion about what is warned. */
13249 if (!arg || !p->case_labels) return;
13250 if (!nd_type_st_key_enable_p(arg)) return;
13251
13252 if (p->case_labels == CHECK_LITERAL_WHEN) {
13253 p->case_labels = st_init_table(&literal_type);
13254 }
13255 else {
13256 st_data_t line;
13257 if (st_lookup(p->case_labels, (st_data_t)arg, &line)) {
13258 rb_warning2("'when' clause on line %d duplicates 'when' clause on line %d and is ignored",
13259 WARN_I((int)nd_line(arg)), WARN_I((int)line));
13260 return;
13261 }
13262 }
13263 st_insert(p->case_labels, (st_data_t)arg, (st_data_t)p->ruby_sourceline);
13264}
13265
13266#ifdef RIPPER
13267static int
13268id_is_var(struct parser_params *p, ID id)
13269{
13270 if (is_notop_id(id)) {
13271 switch (id & ID_SCOPE_MASK) {
13272 case ID_GLOBAL: case ID_INSTANCE: case ID_CONST: case ID_CLASS:
13273 return 1;
13274 case ID_LOCAL:
13275 if (dyna_in_block(p)) {
13276 if (NUMPARAM_ID_P(id) || dvar_defined(p, id)) return 1;
13277 }
13278 if (local_id(p, id)) return 1;
13279 /* method call without arguments */
13280 return 0;
13281 }
13282 }
13283 compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id));
13284 return 0;
13285}
13286#endif
13287
13288static inline enum lex_state_e
13289parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line)
13290{
13291 if (p->debug) {
13292 ls = rb_parser_trace_lex_state(p, p->lex.state, ls, line);
13293 }
13294 return p->lex.state = ls;
13295}
13296
13297#ifndef RIPPER
13298static void
13299flush_debug_buffer(struct parser_params *p, VALUE out, VALUE str)
13300{
13301 VALUE mesg = p->debug_buffer;
13302
13303 if (!NIL_P(mesg) && RSTRING_LEN(mesg)) {
13304 p->debug_buffer = Qnil;
13305 rb_io_puts(1, &mesg, out);
13306 }
13307 if (!NIL_P(str) && RSTRING_LEN(str)) {
13308 rb_io_write(p->debug_output, str);
13309 }
13310}
13311
13312static const char rb_parser_lex_state_names[][8] = {
13313 "BEG", "END", "ENDARG", "ENDFN", "ARG",
13314 "CMDARG", "MID", "FNAME", "DOT", "CLASS",
13315 "LABEL", "LABELED","FITEM",
13316};
13317
13318static VALUE
13319append_lex_state_name(struct parser_params *p, enum lex_state_e state, VALUE buf)
13320{
13321 int i, sep = 0;
13322 unsigned int mask = 1;
13323 static const char none[] = "NONE";
13324
13325 for (i = 0; i < EXPR_MAX_STATE; ++i, mask <<= 1) {
13326 if ((unsigned)state & mask) {
13327 if (sep) {
13328 rb_str_cat(buf, "|", 1);
13329 }
13330 sep = 1;
13331 rb_str_cat_cstr(buf, rb_parser_lex_state_names[i]);
13332 }
13333 }
13334 if (!sep) {
13335 rb_str_cat(buf, none, sizeof(none)-1);
13336 }
13337 return buf;
13338}
13339
13340enum lex_state_e
13341rb_parser_trace_lex_state(struct parser_params *p, enum lex_state_e from,
13342 enum lex_state_e to, int line)
13343{
13344 VALUE mesg;
13345 mesg = rb_str_new_cstr("lex_state: ");
13346 append_lex_state_name(p, from, mesg);
13347 rb_str_cat_cstr(mesg, " -> ");
13348 append_lex_state_name(p, to, mesg);
13349 rb_str_catf(mesg, " at line %d\n", line);
13350 flush_debug_buffer(p, p->debug_output, mesg);
13351 return to;
13352}
13353
13354VALUE
13355rb_parser_lex_state_name(struct parser_params *p, enum lex_state_e state)
13356{
13357 return rb_str_to_interned_str(append_lex_state_name(p, state, rb_str_new(0, 0)));
13358}
13359
13360static void
13361append_bitstack_value(struct parser_params *p, stack_type stack, VALUE mesg)
13362{
13363 if (stack == 0) {
13364 rb_str_cat_cstr(mesg, "0");
13365 }
13366 else {
13367 stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
13368 for (; mask && !(stack & mask); mask >>= 1) continue;
13369 for (; mask; mask >>= 1) rb_str_cat(mesg, stack & mask ? "1" : "0", 1);
13370 }
13371}
13372
13373void
13374rb_parser_show_bitstack(struct parser_params *p, stack_type stack,
13375 const char *name, int line)
13376{
13377 VALUE mesg = rb_sprintf("%s: ", name);
13378 append_bitstack_value(p, stack, mesg);
13379 rb_str_catf(mesg, " at line %d\n", line);
13380 flush_debug_buffer(p, p->debug_output, mesg);
13381}
13382
13383void
13384rb_parser_fatal(struct parser_params *p, const char *fmt, ...)
13385{
13386 va_list ap;
13387 VALUE mesg = rb_str_new_cstr("internal parser error: ");
13388
13389 va_start(ap, fmt);
13390 rb_str_vcatf(mesg, fmt, ap);
13391 va_end(ap);
13392 yyerror0(RSTRING_PTR(mesg));
13393 RB_GC_GUARD(mesg);
13394
13395 mesg = rb_str_new(0, 0);
13396 append_lex_state_name(p, p->lex.state, mesg);
13397 compile_error(p, "lex.state: %"PRIsVALUE, mesg);
13398 rb_str_resize(mesg, 0);
13399 append_bitstack_value(p, p->cond_stack, mesg);
13400 compile_error(p, "cond_stack: %"PRIsVALUE, mesg);
13401 rb_str_resize(mesg, 0);
13402 append_bitstack_value(p, p->cmdarg_stack, mesg);
13403 compile_error(p, "cmdarg_stack: %"PRIsVALUE, mesg);
13404 if (p->debug_output == rb_ractor_stdout())
13405 p->debug_output = rb_ractor_stderr();
13406 p->debug = TRUE;
13407}
13408
13409static YYLTYPE *
13410rb_parser_set_pos(YYLTYPE *yylloc, int sourceline, int beg_pos, int end_pos)
13411{
13412 yylloc->beg_pos.lineno = sourceline;
13413 yylloc->beg_pos.column = beg_pos;
13414 yylloc->end_pos.lineno = sourceline;
13415 yylloc->end_pos.column = end_pos;
13416 return yylloc;
13417}
13418
13419YYLTYPE *
13420rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc)
13421{
13422 int sourceline = here->sourceline;
13423 int beg_pos = (int)here->offset - here->quote
13424 - (rb_strlen_lit("<<-") - !(here->func & STR_FUNC_INDENT));
13425 int end_pos = (int)here->offset + here->length + here->quote;
13426
13427 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
13428}
13429
13430YYLTYPE *
13431rb_parser_set_location_of_delayed_token(struct parser_params *p, YYLTYPE *yylloc)
13432{
13433 yylloc->beg_pos.lineno = p->delayed.beg_line;
13434 yylloc->beg_pos.column = p->delayed.beg_col;
13435 yylloc->end_pos.lineno = p->delayed.end_line;
13436 yylloc->end_pos.column = p->delayed.end_col;
13437
13438 return yylloc;
13439}
13440
13441YYLTYPE *
13442rb_parser_set_location_of_heredoc_end(struct parser_params *p, YYLTYPE *yylloc)
13443{
13444 int sourceline = p->ruby_sourceline;
13445 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
13446 int end_pos = (int)(p->lex.pend - p->lex.pbeg);
13447 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
13448}
13449
13450YYLTYPE *
13451rb_parser_set_location_of_dummy_end(struct parser_params *p, YYLTYPE *yylloc)
13452{
13453 yylloc->end_pos = yylloc->beg_pos;
13454
13455 return yylloc;
13456}
13457
13458YYLTYPE *
13459rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc)
13460{
13461 int sourceline = p->ruby_sourceline;
13462 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
13463 int end_pos = (int)(p->lex.ptok - p->lex.pbeg);
13464 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
13465}
13466
13467YYLTYPE *
13468rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc)
13469{
13470 int sourceline = p->ruby_sourceline;
13471 int beg_pos = (int)(p->lex.ptok - p->lex.pbeg);
13472 int end_pos = (int)(p->lex.pcur - p->lex.pbeg);
13473 return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos);
13474}
13475#endif /* !RIPPER */
13476
13477static int
13478assignable0(struct parser_params *p, ID id, const char **err)
13479{
13480 if (!id) return -1;
13481 switch (id) {
13482 case keyword_self:
13483 *err = "Can't change the value of self";
13484 return -1;
13485 case keyword_nil:
13486 *err = "Can't assign to nil";
13487 return -1;
13488 case keyword_true:
13489 *err = "Can't assign to true";
13490 return -1;
13491 case keyword_false:
13492 *err = "Can't assign to false";
13493 return -1;
13494 case keyword__FILE__:
13495 *err = "Can't assign to __FILE__";
13496 return -1;
13497 case keyword__LINE__:
13498 *err = "Can't assign to __LINE__";
13499 return -1;
13500 case keyword__ENCODING__:
13501 *err = "Can't assign to __ENCODING__";
13502 return -1;
13503 }
13504 switch (id_type(id)) {
13505 case ID_LOCAL:
13506 if (dyna_in_block(p)) {
13507 if (p->max_numparam > NO_PARAM && NUMPARAM_ID_P(id)) {
13508 compile_error(p, "Can't assign to numbered parameter _%d",
13509 NUMPARAM_ID_TO_IDX(id));
13510 return -1;
13511 }
13512 if (dvar_curr(p, id)) return NODE_DASGN;
13513 if (dvar_defined(p, id)) return NODE_DASGN;
13514 if (local_id(p, id)) return NODE_LASGN;
13515 dyna_var(p, id);
13516 return NODE_DASGN;
13517 }
13518 else {
13519 if (!local_id(p, id)) local_var(p, id);
13520 return NODE_LASGN;
13521 }
13522 break;
13523 case ID_GLOBAL: return NODE_GASGN;
13524 case ID_INSTANCE: return NODE_IASGN;
13525 case ID_CONST:
13526 if (!p->ctxt.in_def) return NODE_CDECL;
13527 *err = "dynamic constant assignment";
13528 return -1;
13529 case ID_CLASS: return NODE_CVASGN;
13530 default:
13531 compile_error(p, "identifier %"PRIsVALUE" is not valid to set", rb_id2str(id));
13532 }
13533 return -1;
13534}
13535
13536static NODE*
13537assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc)
13538{
13539 const char *err = 0;
13540 int node_type = assignable0(p, id, &err);
13541 switch (node_type) {
13542 case NODE_DASGN: return NEW_DASGN(id, val, loc);
13543 case NODE_LASGN: return NEW_LASGN(id, val, loc);
13544 case NODE_GASGN: return NEW_GASGN(id, val, loc);
13545 case NODE_IASGN: return NEW_IASGN(id, val, loc);
13546 case NODE_CDECL: return NEW_CDECL(id, val, 0, p->ctxt.shareable_constant_value, loc);
13547 case NODE_CVASGN: return NEW_CVASGN(id, val, loc);
13548 }
13549/* TODO: FIXME */
13550#ifndef RIPPER
13551 if (err) yyerror1(loc, err);
13552#else
13553 if (err) set_value(assign_error(p, err, p->s_lvalue));
13554#endif
13555 return NEW_ERROR(loc);
13556}
13557
13558static int
13559is_private_local_id(struct parser_params *p, ID name)
13560{
13561 VALUE s;
13562 if (name == idUScore) return 1;
13563 if (!is_local_id(name)) return 0;
13564 s = rb_id2str(name);
13565 if (!s) return 0;
13566 return RSTRING_PTR(s)[0] == '_';
13567}
13568
13569static int
13570shadowing_lvar_0(struct parser_params *p, ID name)
13571{
13572 if (dyna_in_block(p)) {
13573 if (dvar_curr(p, name)) {
13574 if (is_private_local_id(p, name)) return 1;
13575 yyerror0("duplicated argument name");
13576 }
13577 else if (dvar_defined(p, name) || local_id(p, name)) {
13578 vtable_add(p->lvtbl->vars, name);
13579 if (p->lvtbl->used) {
13580 vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline | LVAR_USED);
13581 }
13582 return 0;
13583 }
13584 }
13585 else {
13586 if (local_id(p, name)) {
13587 if (is_private_local_id(p, name)) return 1;
13588 yyerror0("duplicated argument name");
13589 }
13590 }
13591 return 1;
13592}
13593
13594static ID
13595shadowing_lvar(struct parser_params *p, ID name)
13596{
13597 shadowing_lvar_0(p, name);
13598 return name;
13599}
13600
13601static void
13602new_bv(struct parser_params *p, ID name)
13603{
13604 if (!name) return;
13605 if (!is_local_id(name)) {
13606 compile_error(p, "invalid local variable - %"PRIsVALUE,
13607 rb_id2str(name));
13608 return;
13609 }
13610 if (!shadowing_lvar_0(p, name)) return;
13611 dyna_var(p, name);
13612 ID *vidp = 0;
13613 if (dvar_defined_ref(p, name, &vidp)) {
13614 if (vidp) *vidp |= LVAR_USED;
13615 }
13616}
13617
13618static void
13619aryset_check(struct parser_params *p, NODE *args)
13620{
13621 NODE *block = 0, *kwds = 0;
13622 if (args && nd_type_p(args, NODE_BLOCK_PASS)) {
13623 block = RNODE_BLOCK_PASS(args)->nd_body;
13624 args = RNODE_BLOCK_PASS(args)->nd_head;
13625 }
13626 if (args && nd_type_p(args, NODE_ARGSCAT)) {
13627 args = RNODE_ARGSCAT(args)->nd_body;
13628 }
13629 if (args && nd_type_p(args, NODE_ARGSPUSH)) {
13630 kwds = RNODE_ARGSPUSH(args)->nd_body;
13631 }
13632 else {
13633 for (NODE *next = args; next && nd_type_p(next, NODE_LIST);
13634 next = RNODE_LIST(next)->nd_next) {
13635 kwds = RNODE_LIST(next)->nd_head;
13636 }
13637 }
13638 if (kwds && nd_type_p(kwds, NODE_HASH) && !RNODE_HASH(kwds)->nd_brace) {
13639 yyerror1(&kwds->nd_loc, "keyword arg given in index assignment");
13640 }
13641 if (block) {
13642 yyerror1(&block->nd_loc, "block arg given in index assignment");
13643 }
13644}
13645
13646static NODE *
13647aryset(struct parser_params *p, NODE *recv, NODE *idx, const YYLTYPE *loc)
13648{
13649 aryset_check(p, idx);
13650 return NEW_ATTRASGN(recv, tASET, idx, loc);
13651}
13652
13653static void
13654block_dup_check(struct parser_params *p, NODE *node1, NODE *node2)
13655{
13656 if (node2 && node1 && nd_type_p(node1, NODE_BLOCK_PASS)) {
13657 compile_error(p, "both block arg and actual block given");
13658 }
13659}
13660
13661static NODE *
13662attrset(struct parser_params *p, NODE *recv, ID atype, ID id, const YYLTYPE *loc)
13663{
13664 if (!CALL_Q_P(atype)) id = rb_id_attrset(id);
13665 return NEW_ATTRASGN(recv, id, 0, loc);
13666}
13667
13668static VALUE
13669rb_backref_error(struct parser_params *p, NODE *node)
13670{
13671#ifndef RIPPER
13672# define ERR(...) (compile_error(p, __VA_ARGS__), Qtrue)
13673#else
13674# define ERR(...) rb_sprintf(__VA_ARGS__)
13675#endif
13676 switch (nd_type(node)) {
13677 case NODE_NTH_REF:
13678 return ERR("Can't set variable $%ld", RNODE_NTH_REF(node)->nd_nth);
13679 case NODE_BACK_REF:
13680 return ERR("Can't set variable $%c", (int)RNODE_BACK_REF(node)->nd_nth);
13681 }
13682#undef ERR
13683 UNREACHABLE_RETURN(Qfalse); /* only called on syntax error */
13684}
13685
13686static NODE *
13687arg_append(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc)
13688{
13689 if (!node1) return NEW_LIST(node2, &node2->nd_loc);
13690 switch (nd_type(node1)) {
13691 case NODE_LIST:
13692 return list_append(p, node1, node2);
13693 case NODE_BLOCK_PASS:
13694 RNODE_BLOCK_PASS(node1)->nd_head = arg_append(p, RNODE_BLOCK_PASS(node1)->nd_head, node2, loc);
13695 node1->nd_loc.end_pos = RNODE_BLOCK_PASS(node1)->nd_head->nd_loc.end_pos;
13696 return node1;
13697 case NODE_ARGSPUSH:
13698 RNODE_ARGSPUSH(node1)->nd_body = list_append(p, NEW_LIST(RNODE_ARGSPUSH(node1)->nd_body, &RNODE_ARGSPUSH(node1)->nd_body->nd_loc), node2);
13699 node1->nd_loc.end_pos = RNODE_ARGSPUSH(node1)->nd_body->nd_loc.end_pos;
13700 nd_set_type(node1, NODE_ARGSCAT);
13701 return node1;
13702 case NODE_ARGSCAT:
13703 if (!nd_type_p(RNODE_ARGSCAT(node1)->nd_body, NODE_LIST)) break;
13704 RNODE_ARGSCAT(node1)->nd_body = list_append(p, RNODE_ARGSCAT(node1)->nd_body, node2);
13705 node1->nd_loc.end_pos = RNODE_ARGSCAT(node1)->nd_body->nd_loc.end_pos;
13706 return node1;
13707 }
13708 return NEW_ARGSPUSH(node1, node2, loc);
13709}
13710
13711static NODE *
13712arg_concat(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc)
13713{
13714 if (!node2) return node1;
13715 switch (nd_type(node1)) {
13716 case NODE_BLOCK_PASS:
13717 if (RNODE_BLOCK_PASS(node1)->nd_head)
13718 RNODE_BLOCK_PASS(node1)->nd_head = arg_concat(p, RNODE_BLOCK_PASS(node1)->nd_head, node2, loc);
13719 else
13720 RNODE_LIST(node1)->nd_head = NEW_LIST(node2, loc);
13721 return node1;
13722 case NODE_ARGSPUSH:
13723 if (!nd_type_p(node2, NODE_LIST)) break;
13724 RNODE_ARGSPUSH(node1)->nd_body = list_concat(NEW_LIST(RNODE_ARGSPUSH(node1)->nd_body, loc), node2);
13725 nd_set_type(node1, NODE_ARGSCAT);
13726 return node1;
13727 case NODE_ARGSCAT:
13728 if (!nd_type_p(node2, NODE_LIST) ||
13729 !nd_type_p(RNODE_ARGSCAT(node1)->nd_body, NODE_LIST)) break;
13730 RNODE_ARGSCAT(node1)->nd_body = list_concat(RNODE_ARGSCAT(node1)->nd_body, node2);
13731 return node1;
13732 }
13733 return NEW_ARGSCAT(node1, node2, loc);
13734}
13735
13736static NODE *
13737last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc)
13738{
13739 NODE *n1;
13740 if ((n1 = splat_array(args)) != 0) {
13741 return list_append(p, n1, last_arg);
13742 }
13743 return arg_append(p, args, last_arg, loc);
13744}
13745
13746static NODE *
13747rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc)
13748{
13749 NODE *n1;
13750 if ((nd_type_p(rest_arg, NODE_LIST)) && (n1 = splat_array(args)) != 0) {
13751 return list_concat(n1, rest_arg);
13752 }
13753 return arg_concat(p, args, rest_arg, loc);
13754}
13755
13756static NODE *
13757splat_array(NODE* node)
13758{
13759 if (nd_type_p(node, NODE_SPLAT)) node = RNODE_SPLAT(node)->nd_head;
13760 if (nd_type_p(node, NODE_LIST)) return node;
13761 return 0;
13762}
13763
13764static void
13765mark_lvar_used(struct parser_params *p, NODE *rhs)
13766{
13767 ID *vidp = NULL;
13768 if (!rhs) return;
13769 switch (nd_type(rhs)) {
13770 case NODE_LASGN:
13771 if (local_id_ref(p, RNODE_LASGN(rhs)->nd_vid, &vidp)) {
13772 if (vidp) *vidp |= LVAR_USED;
13773 }
13774 break;
13775 case NODE_DASGN:
13776 if (dvar_defined_ref(p, RNODE_DASGN(rhs)->nd_vid, &vidp)) {
13777 if (vidp) *vidp |= LVAR_USED;
13778 }
13779 break;
13780#if 0
13781 case NODE_MASGN:
13782 for (rhs = rhs->nd_head; rhs; rhs = rhs->nd_next) {
13783 mark_lvar_used(p, rhs->nd_head);
13784 }
13785 break;
13786#endif
13787 }
13788}
13789
13790static int is_static_content(NODE *node);
13791
13792static NODE *
13793node_assign(struct parser_params *p, NODE *lhs, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
13794{
13795 if (!lhs) return 0;
13796
13797 switch (nd_type(lhs)) {
13798 case NODE_CDECL:
13799 case NODE_GASGN:
13800 case NODE_IASGN:
13801 case NODE_LASGN:
13802 case NODE_DASGN:
13803 case NODE_MASGN:
13804 case NODE_CVASGN:
13805 set_nd_value(p, lhs, rhs);
13806 nd_set_loc(lhs, loc);
13807 break;
13808
13809 case NODE_ATTRASGN:
13810 RNODE_ATTRASGN(lhs)->nd_args = arg_append(p, RNODE_ATTRASGN(lhs)->nd_args, rhs, loc);
13811 nd_set_loc(lhs, loc);
13812 break;
13813
13814 default:
13815 /* should not happen */
13816 break;
13817 }
13818
13819 return lhs;
13820}
13821
13822static NODE *
13823value_expr_check(struct parser_params *p, NODE *node)
13824{
13825 NODE *void_node = 0, *vn;
13826
13827 if (!node) {
13828 rb_warning0("empty expression");
13829 }
13830 while (node) {
13831 switch (nd_type(node)) {
13832 case NODE_ENSURE:
13833 vn = RNODE_ENSURE(node)->nd_head;
13834 node = RNODE_ENSURE(node)->nd_ensr;
13835 /* nd_ensr should not be NULL, check it out next */
13836 if (vn && (vn = value_expr_check(p, vn))) {
13837 goto found;
13838 }
13839 break;
13840
13841 case NODE_RESCUE:
13842 /* void only if all children are void */
13843 vn = RNODE_RESCUE(node)->nd_head;
13844 if (!vn || !(vn = value_expr_check(p, vn))) return NULL;
13845 if (!void_node) void_node = vn;
13846 for (NODE *r = RNODE_RESCUE(node)->nd_resq; r; r = RNODE_RESBODY(r)->nd_next) {
13847 if (!nd_type_p(r, NODE_RESBODY)) {
13848 compile_error(p, "unexpected node");
13849 return NULL;
13850 }
13851 if (!(vn = value_expr_check(p, RNODE_RESBODY(r)->nd_body))) {
13852 void_node = 0;
13853 break;
13854 }
13855 if (!void_node) void_node = vn;
13856 }
13857 node = RNODE_RESCUE(node)->nd_else;
13858 if (!node) return void_node;
13859 break;
13860
13861 case NODE_RETURN:
13862 case NODE_BREAK:
13863 case NODE_NEXT:
13864 case NODE_REDO:
13865 case NODE_RETRY:
13866 goto found;
13867
13868 case NODE_CASE3:
13869 if (!RNODE_CASE3(node)->nd_body || !nd_type_p(RNODE_CASE3(node)->nd_body, NODE_IN)) {
13870 compile_error(p, "unexpected node");
13871 return NULL;
13872 }
13873 if (RNODE_IN(RNODE_CASE3(node)->nd_body)->nd_body) {
13874 return NULL;
13875 }
13876 /* single line pattern matching with "=>" operator */
13877 goto found;
13878
13879 case NODE_BLOCK:
13880 while (RNODE_BLOCK(node)->nd_next) {
13881 node = RNODE_BLOCK(node)->nd_next;
13882 }
13883 node = RNODE_BLOCK(node)->nd_head;
13884 break;
13885
13886 case NODE_BEGIN:
13887 node = RNODE_BEGIN(node)->nd_body;
13888 break;
13889
13890 case NODE_IF:
13891 case NODE_UNLESS:
13892 if (!RNODE_IF(node)->nd_body) {
13893 return NULL;
13894 }
13895 else if (!RNODE_IF(node)->nd_else) {
13896 return NULL;
13897 }
13898 vn = value_expr_check(p, RNODE_IF(node)->nd_body);
13899 if (!vn) return NULL;
13900 if (!void_node) void_node = vn;
13901 node = RNODE_IF(node)->nd_else;
13902 break;
13903
13904 case NODE_AND:
13905 case NODE_OR:
13906 node = RNODE_AND(node)->nd_1st;
13907 break;
13908
13909 case NODE_LASGN:
13910 case NODE_DASGN:
13911 case NODE_MASGN:
13912 mark_lvar_used(p, node);
13913 return NULL;
13914
13915 default:
13916 return NULL;
13917 }
13918 }
13919
13920 return NULL;
13921
13922 found:
13923 /* return the first found node */
13924 return void_node ? void_node : node;
13925}
13926
13927static int
13928value_expr(struct parser_params *p, NODE *node)
13929{
13930 NODE *void_node = value_expr_check(p, node);
13931 if (void_node) {
13932 yyerror1(&void_node->nd_loc, "void value expression");
13933 /* or "control never reach"? */
13934 return FALSE;
13935 }
13936 return TRUE;
13937}
13938
13939static void
13940void_expr(struct parser_params *p, NODE *node)
13941{
13942 const char *useless = 0;
13943
13944 if (!RTEST(ruby_verbose)) return;
13945
13946 if (!node || !(node = nd_once_body(node))) return;
13947 switch (nd_type(node)) {
13948 case NODE_OPCALL:
13949 switch (RNODE_OPCALL(node)->nd_mid) {
13950 case '+':
13951 case '-':
13952 case '*':
13953 case '/':
13954 case '%':
13955 case tPOW:
13956 case tUPLUS:
13957 case tUMINUS:
13958 case '|':
13959 case '^':
13960 case '&':
13961 case tCMP:
13962 case '>':
13963 case tGEQ:
13964 case '<':
13965 case tLEQ:
13966 case tEQ:
13967 case tNEQ:
13968 useless = rb_id2name(RNODE_OPCALL(node)->nd_mid);
13969 break;
13970 }
13971 break;
13972
13973 case NODE_LVAR:
13974 case NODE_DVAR:
13975 case NODE_GVAR:
13976 case NODE_IVAR:
13977 case NODE_CVAR:
13978 case NODE_NTH_REF:
13979 case NODE_BACK_REF:
13980 useless = "a variable";
13981 break;
13982 case NODE_CONST:
13983 useless = "a constant";
13984 break;
13985 case NODE_SYM:
13986 case NODE_LINE:
13987 case NODE_FILE:
13988 case NODE_ENCODING:
13989 case NODE_INTEGER:
13990 case NODE_FLOAT:
13991 case NODE_RATIONAL:
13992 case NODE_IMAGINARY:
13993 case NODE_STR:
13994 case NODE_DSTR:
13995 case NODE_REGX:
13996 case NODE_DREGX:
13997 useless = "a literal";
13998 break;
13999 case NODE_COLON2:
14000 case NODE_COLON3:
14001 useless = "::";
14002 break;
14003 case NODE_DOT2:
14004 useless = "..";
14005 break;
14006 case NODE_DOT3:
14007 useless = "...";
14008 break;
14009 case NODE_SELF:
14010 useless = "self";
14011 break;
14012 case NODE_NIL:
14013 useless = "nil";
14014 break;
14015 case NODE_TRUE:
14016 useless = "true";
14017 break;
14018 case NODE_FALSE:
14019 useless = "false";
14020 break;
14021 case NODE_DEFINED:
14022 useless = "defined?";
14023 break;
14024 }
14025
14026 if (useless) {
14027 rb_warn1L(nd_line(node), "possibly useless use of %s in void context", WARN_S(useless));
14028 }
14029}
14030
14031/* warns useless use of block and returns the last statement node */
14032static NODE *
14033void_stmts(struct parser_params *p, NODE *node)
14034{
14035 NODE *const n = node;
14036 if (!RTEST(ruby_verbose)) return n;
14037 if (!node) return n;
14038 if (!nd_type_p(node, NODE_BLOCK)) return n;
14039
14040 while (RNODE_BLOCK(node)->nd_next) {
14041 void_expr(p, RNODE_BLOCK(node)->nd_head);
14042 node = RNODE_BLOCK(node)->nd_next;
14043 }
14044 return RNODE_BLOCK(node)->nd_head;
14045}
14046
14047static NODE *
14048remove_begin(NODE *node)
14049{
14050 NODE **n = &node, *n1 = node;
14051 while (n1 && nd_type_p(n1, NODE_BEGIN) && RNODE_BEGIN(n1)->nd_body) {
14052 *n = n1 = RNODE_BEGIN(n1)->nd_body;
14053 }
14054 return node;
14055}
14056
14057static void
14058reduce_nodes(struct parser_params *p, NODE **body)
14059{
14060 NODE *node = *body;
14061
14062 if (!node) {
14063 *body = NEW_NIL(&NULL_LOC);
14064 return;
14065 }
14066#define subnodes(type, n1, n2) \
14067 ((!type(node)->n1) ? (type(node)->n2 ? (body = &type(node)->n2, 1) : 0) : \
14068 (!type(node)->n2) ? (body = &type(node)->n1, 1) : \
14069 (reduce_nodes(p, &type(node)->n1), body = &type(node)->n2, 1))
14070
14071 while (node) {
14072 int newline = (int)nd_fl_newline(node);
14073 switch (nd_type(node)) {
14074 end:
14075 case NODE_NIL:
14076 *body = 0;
14077 return;
14078 case NODE_BEGIN:
14079 *body = node = RNODE_BEGIN(node)->nd_body;
14080 if (newline && node) nd_set_fl_newline(node);
14081 continue;
14082 case NODE_BLOCK:
14083 body = &RNODE_BLOCK(RNODE_BLOCK(node)->nd_end)->nd_head;
14084 break;
14085 case NODE_IF:
14086 case NODE_UNLESS:
14087 if (subnodes(RNODE_IF, nd_body, nd_else)) break;
14088 return;
14089 case NODE_CASE:
14090 body = &RNODE_CASE(node)->nd_body;
14091 break;
14092 case NODE_WHEN:
14093 if (!subnodes(RNODE_WHEN, nd_body, nd_next)) goto end;
14094 break;
14095 case NODE_ENSURE:
14096 body = &RNODE_ENSURE(node)->nd_head;
14097 break;
14098 case NODE_RESCUE:
14099 newline = 0; // RESBODY should not be a NEWLINE
14100 if (RNODE_RESCUE(node)->nd_else) {
14101 body = &RNODE_RESCUE(node)->nd_resq;
14102 break;
14103 }
14104 if (!subnodes(RNODE_RESCUE, nd_head, nd_resq)) goto end;
14105 break;
14106 default:
14107 return;
14108 }
14109 node = *body;
14110 if (newline && node) nd_set_fl_newline(node);
14111 }
14112
14113#undef subnodes
14114}
14115
14116static int
14117is_static_content(NODE *node)
14118{
14119 if (!node) return 1;
14120 switch (nd_type(node)) {
14121 case NODE_HASH:
14122 if (!(node = RNODE_HASH(node)->nd_head)) break;
14123 case NODE_LIST:
14124 do {
14125 if (!is_static_content(RNODE_LIST(node)->nd_head)) return 0;
14126 } while ((node = RNODE_LIST(node)->nd_next) != 0);
14127 case NODE_SYM:
14128 case NODE_REGX:
14129 case NODE_LINE:
14130 case NODE_FILE:
14131 case NODE_ENCODING:
14132 case NODE_INTEGER:
14133 case NODE_FLOAT:
14134 case NODE_RATIONAL:
14135 case NODE_IMAGINARY:
14136 case NODE_STR:
14137 case NODE_NIL:
14138 case NODE_TRUE:
14139 case NODE_FALSE:
14140 case NODE_ZLIST:
14141 break;
14142 default:
14143 return 0;
14144 }
14145 return 1;
14146}
14147
14148static int
14149assign_in_cond(struct parser_params *p, NODE *node)
14150{
14151 switch (nd_type(node)) {
14152 case NODE_MASGN:
14153 case NODE_LASGN:
14154 case NODE_DASGN:
14155 case NODE_GASGN:
14156 case NODE_IASGN:
14157 case NODE_CVASGN:
14158 case NODE_CDECL:
14159 break;
14160
14161 default:
14162 return 0;
14163 }
14164
14165 if (!get_nd_value(p, node)) return 1;
14166 if (is_static_content(get_nd_value(p, node))) {
14167 /* reports always */
14168 rb_warn0L(nd_line(get_nd_value(p, node)), "found '= literal' in conditional, should be ==");
14169 }
14170 return 1;
14171}
14172
14173enum cond_type {
14174 COND_IN_OP,
14175 COND_IN_COND,
14176 COND_IN_FF
14177};
14178
14179#define SWITCH_BY_COND_TYPE(t, w, arg) do { \
14180 switch (t) { \
14181 case COND_IN_OP: break; \
14182 case COND_IN_COND: rb_##w##0(arg "literal in condition"); break; \
14183 case COND_IN_FF: rb_##w##0(arg "literal in flip-flop"); break; \
14184 } \
14185} while (0)
14186
14187static NODE *cond0(struct parser_params*,NODE*,enum cond_type,const YYLTYPE*,bool);
14188
14189static NODE*
14190range_op(struct parser_params *p, NODE *node, const YYLTYPE *loc)
14191{
14192 enum node_type type;
14193
14194 if (node == 0) return 0;
14195
14196 type = nd_type(node);
14197 value_expr(p, node);
14198 if (type == NODE_INTEGER) {
14199 if (!e_option_supplied(p)) rb_warn0L(nd_line(node), "integer literal in flip-flop");
14200 ID lineno = rb_intern("$.");
14201 return NEW_CALL(node, tEQ, NEW_LIST(NEW_GVAR(lineno, loc), loc), loc);
14202 }
14203 return cond0(p, node, COND_IN_FF, loc, true);
14204}
14205
14206static NODE*
14207cond0(struct parser_params *p, NODE *node, enum cond_type type, const YYLTYPE *loc, bool top)
14208{
14209 if (node == 0) return 0;
14210 if (!(node = nd_once_body(node))) return 0;
14211 assign_in_cond(p, node);
14212
14213 switch (nd_type(node)) {
14214 case NODE_BEGIN:
14215 RNODE_BEGIN(node)->nd_body = cond0(p, RNODE_BEGIN(node)->nd_body, type, loc, top);
14216 break;
14217
14218 case NODE_DSTR:
14219 case NODE_EVSTR:
14220 case NODE_STR:
14221 case NODE_FILE:
14222 SWITCH_BY_COND_TYPE(type, warn, "string ");
14223 break;
14224
14225 case NODE_REGX:
14226 if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warn, "regex ");
14227 nd_set_type(node, NODE_MATCH);
14228 break;
14229
14230 case NODE_DREGX:
14231 if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warning, "regex ");
14232
14233 return NEW_MATCH2(node, NEW_GVAR(idLASTLINE, loc), loc);
14234
14235 case NODE_BLOCK:
14236 {
14237 NODE *end = RNODE_BLOCK(node)->nd_end;
14238 NODE **expr = &RNODE_BLOCK(end)->nd_head;
14239 if (top) top = node == end;
14240 *expr = cond0(p, *expr, type, loc, top);
14241 }
14242 break;
14243
14244 case NODE_AND:
14245 case NODE_OR:
14246 RNODE_AND(node)->nd_1st = cond0(p, RNODE_AND(node)->nd_1st, COND_IN_COND, loc, true);
14247 RNODE_AND(node)->nd_2nd = cond0(p, RNODE_AND(node)->nd_2nd, COND_IN_COND, loc, true);
14248 break;
14249
14250 case NODE_DOT2:
14251 case NODE_DOT3:
14252 if (!top) break;
14253 RNODE_DOT2(node)->nd_beg = range_op(p, RNODE_DOT2(node)->nd_beg, loc);
14254 RNODE_DOT2(node)->nd_end = range_op(p, RNODE_DOT2(node)->nd_end, loc);
14255 switch (nd_type(node)) {
14256 case NODE_DOT2:
14257 nd_set_type(node,NODE_FLIP2);
14258 rb_node_flip2_t *flip2 = RNODE_FLIP2(node); /* for debug info */
14259 (void)flip2;
14260 break;
14261 case NODE_DOT3:
14262 nd_set_type(node, NODE_FLIP3);
14263 rb_node_flip3_t *flip3 = RNODE_FLIP3(node); /* for debug info */
14264 (void)flip3;
14265 break;
14266 }
14267 break;
14268
14269 case NODE_SYM:
14270 case NODE_DSYM:
14271 SWITCH_BY_COND_TYPE(type, warning, "symbol ");
14272 break;
14273
14274 case NODE_LINE:
14275 case NODE_ENCODING:
14276 case NODE_INTEGER:
14277 case NODE_FLOAT:
14278 case NODE_RATIONAL:
14279 case NODE_IMAGINARY:
14280 SWITCH_BY_COND_TYPE(type, warning, "");
14281 break;
14282
14283 default:
14284 break;
14285 }
14286 return node;
14287}
14288
14289static NODE*
14290cond(struct parser_params *p, NODE *node, const YYLTYPE *loc)
14291{
14292 if (node == 0) return 0;
14293 return cond0(p, node, COND_IN_COND, loc, true);
14294}
14295
14296static NODE*
14297method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc)
14298{
14299 if (node == 0) return 0;
14300 return cond0(p, node, COND_IN_OP, loc, true);
14301}
14302
14303static NODE*
14304new_nil_at(struct parser_params *p, const rb_code_position_t *pos)
14305{
14306 YYLTYPE loc = {*pos, *pos};
14307 return NEW_NIL(&loc);
14308}
14309
14310static NODE*
14311new_if(struct parser_params *p, NODE *cc, NODE *left, NODE *right, const YYLTYPE *loc, const YYLTYPE* if_keyword_loc, const YYLTYPE* then_keyword_loc, const YYLTYPE* end_keyword_loc)
14312{
14313 if (!cc) return right;
14314 cc = cond0(p, cc, COND_IN_COND, loc, true);
14315 return newline_node(NEW_IF(cc, left, right, loc, if_keyword_loc, then_keyword_loc, end_keyword_loc));
14316}
14317
14318static NODE*
14319new_unless(struct parser_params *p, NODE *cc, NODE *left, NODE *right, const YYLTYPE *loc, const YYLTYPE *keyword_loc, const YYLTYPE *then_keyword_loc, const YYLTYPE *end_keyword_loc)
14320{
14321 if (!cc) return right;
14322 cc = cond0(p, cc, COND_IN_COND, loc, true);
14323 return newline_node(NEW_UNLESS(cc, left, right, loc, keyword_loc, then_keyword_loc, end_keyword_loc));
14324}
14325
14326#define NEW_AND_OR(type, f, s, loc, op_loc) (type == NODE_AND ? NEW_AND(f,s,loc,op_loc) : NEW_OR(f,s,loc,op_loc))
14327
14328static NODE*
14329logop(struct parser_params *p, ID id, NODE *left, NODE *right,
14330 const YYLTYPE *op_loc, const YYLTYPE *loc)
14331{
14332 enum node_type type = id == idAND || id == idANDOP ? NODE_AND : NODE_OR;
14333 NODE *op;
14334 value_expr(p, left);
14335 if (left && nd_type_p(left, type)) {
14336 NODE *node = left, *second;
14337 while ((second = RNODE_AND(node)->nd_2nd) != 0 && nd_type_p(second, type)) {
14338 node = second;
14339 }
14340 RNODE_AND(node)->nd_2nd = NEW_AND_OR(type, second, right, loc, op_loc);
14341 nd_set_line(RNODE_AND(node)->nd_2nd, op_loc->beg_pos.lineno);
14342 left->nd_loc.end_pos = loc->end_pos;
14343 return left;
14344 }
14345 op = NEW_AND_OR(type, left, right, loc, op_loc);
14346 nd_set_line(op, op_loc->beg_pos.lineno);
14347 return op;
14348}
14349
14350#undef NEW_AND_OR
14351
14352static void
14353no_blockarg(struct parser_params *p, NODE *node)
14354{
14355 if (nd_type_p(node, NODE_BLOCK_PASS)) {
14356 compile_error(p, "block argument should not be given");
14357 }
14358}
14359
14360static NODE *
14361ret_args(struct parser_params *p, NODE *node)
14362{
14363 if (node) {
14364 no_blockarg(p, node);
14365 if (nd_type_p(node, NODE_LIST) && !RNODE_LIST(node)->nd_next) {
14366 node = RNODE_LIST(node)->nd_head;
14367 }
14368 }
14369 return node;
14370}
14371
14372static NODE*
14373negate_lit(struct parser_params *p, NODE* node, const YYLTYPE *loc)
14374{
14375 switch (nd_type(node)) {
14376 case NODE_INTEGER:
14377 RNODE_INTEGER(node)->minus = TRUE;
14378 break;
14379 case NODE_FLOAT:
14380 RNODE_FLOAT(node)->minus = TRUE;
14381 break;
14382 case NODE_RATIONAL:
14383 RNODE_RATIONAL(node)->minus = TRUE;
14384 break;
14385 case NODE_IMAGINARY:
14386 RNODE_IMAGINARY(node)->minus = TRUE;
14387 break;
14388 }
14389 node->nd_loc = *loc;
14390 return node;
14391}
14392
14393static NODE *
14394arg_blk_pass(NODE *node1, rb_node_block_pass_t *node2)
14395{
14396 if (node2) {
14397 if (!node1) return (NODE *)node2;
14398 node2->nd_head = node1;
14399 nd_set_first_lineno(node2, nd_first_lineno(node1));
14400 nd_set_first_column(node2, nd_first_column(node1));
14401 return (NODE *)node2;
14402 }
14403 return node1;
14404}
14405
14406static bool
14407args_info_empty_p(struct rb_args_info *args)
14408{
14409 if (args->pre_args_num) return false;
14410 if (args->post_args_num) return false;
14411 if (args->rest_arg) return false;
14412 if (args->opt_args) return false;
14413 if (args->block_arg) return false;
14414 if (args->kw_args) return false;
14415 if (args->kw_rest_arg) return false;
14416 return true;
14417}
14418
14419static rb_node_args_t *
14420new_args(struct parser_params *p, rb_node_args_aux_t *pre_args, rb_node_opt_arg_t *opt_args, ID rest_arg, rb_node_args_aux_t *post_args, rb_node_args_t *tail, const YYLTYPE *loc)
14421{
14422 struct rb_args_info *args = &tail->nd_ainfo;
14423
14424 if (args->forwarding) {
14425 if (rest_arg) {
14426 yyerror1(&RNODE(tail)->nd_loc, "... after rest argument");
14427 return tail;
14428 }
14429 rest_arg = idFWD_REST;
14430 }
14431
14432 args->pre_args_num = pre_args ? pre_args->nd_plen : 0;
14433 args->pre_init = pre_args ? pre_args->nd_next : 0;
14434
14435 args->post_args_num = post_args ? post_args->nd_plen : 0;
14436 args->post_init = post_args ? post_args->nd_next : 0;
14437 args->first_post_arg = post_args ? post_args->nd_pid : 0;
14438
14439 args->rest_arg = rest_arg;
14440
14441 args->opt_args = opt_args;
14442
14443 nd_set_loc(RNODE(tail), loc);
14444
14445 return tail;
14446}
14447
14448static rb_node_args_t *
14449new_args_tail(struct parser_params *p, rb_node_kw_arg_t *kw_args, ID kw_rest_arg, ID block, const YYLTYPE *kw_rest_loc)
14450{
14451 rb_node_args_t *node = NEW_ARGS(&NULL_LOC);
14452 struct rb_args_info *args = &node->nd_ainfo;
14453 if (p->error_p) return node;
14454
14455 args->block_arg = block;
14456 args->kw_args = kw_args;
14457
14458 if (kw_args) {
14459 /*
14460 * def foo(k1: 1, kr1:, k2: 2, **krest, &b)
14461 * variable order: k1, kr1, k2, &b, internal_id, krest
14462 * #=> <reorder>
14463 * variable order: kr1, k1, k2, internal_id, krest, &b
14464 */
14465 ID kw_bits = internal_id(p), *required_kw_vars, *kw_vars;
14466 struct vtable *vtargs = p->lvtbl->args;
14467 rb_node_kw_arg_t *kwn = kw_args;
14468
14469 if (block) block = vtargs->tbl[vtargs->pos-1];
14470 vtable_pop(vtargs, !!block + !!kw_rest_arg);
14471 required_kw_vars = kw_vars = &vtargs->tbl[vtargs->pos];
14472 while (kwn) {
14473 if (!NODE_REQUIRED_KEYWORD_P(get_nd_value(p, kwn->nd_body)))
14474 --kw_vars;
14475 --required_kw_vars;
14476 kwn = kwn->nd_next;
14477 }
14478
14479 for (kwn = kw_args; kwn; kwn = kwn->nd_next) {
14480 ID vid = get_nd_vid(p, kwn->nd_body);
14481 if (NODE_REQUIRED_KEYWORD_P(get_nd_value(p, kwn->nd_body))) {
14482 *required_kw_vars++ = vid;
14483 }
14484 else {
14485 *kw_vars++ = vid;
14486 }
14487 }
14488
14489 arg_var(p, kw_bits);
14490 if (kw_rest_arg) arg_var(p, kw_rest_arg);
14491 if (block) arg_var(p, block);
14492
14493 args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc);
14494 }
14495 else if (kw_rest_arg == idNil) {
14496 args->no_kwarg = 1;
14497 }
14498 else if (kw_rest_arg) {
14499 args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc);
14500 }
14501
14502 return node;
14503}
14504
14505static rb_node_args_t *
14506args_with_numbered(struct parser_params *p, rb_node_args_t *args, int max_numparam, ID it_id)
14507{
14508 if (max_numparam > NO_PARAM || it_id) {
14509 if (!args) {
14510 YYLTYPE loc = RUBY_INIT_YYLLOC();
14511 args = new_args_tail(p, 0, 0, 0, 0);
14512 nd_set_loc(RNODE(args), &loc);
14513 }
14514 args->nd_ainfo.pre_args_num = it_id ? 1 : max_numparam;
14515 }
14516 return args;
14517}
14518
14519static NODE*
14520new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc)
14521{
14522 RNODE_ARYPTN(aryptn)->nd_pconst = constant;
14523
14524 if (pre_arg) {
14525 NODE *pre_args = NEW_LIST(pre_arg, loc);
14526 if (RNODE_ARYPTN(aryptn)->pre_args) {
14527 RNODE_ARYPTN(aryptn)->pre_args = list_concat(pre_args, RNODE_ARYPTN(aryptn)->pre_args);
14528 }
14529 else {
14530 RNODE_ARYPTN(aryptn)->pre_args = pre_args;
14531 }
14532 }
14533 return aryptn;
14534}
14535
14536static NODE*
14537new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc)
14538{
14539 if (has_rest) {
14540 rest_arg = rest_arg ? rest_arg : NODE_SPECIAL_NO_NAME_REST;
14541 }
14542 else {
14543 rest_arg = NULL;
14544 }
14545 NODE *node = NEW_ARYPTN(pre_args, rest_arg, post_args, loc);
14546
14547 return node;
14548}
14549
14550static NODE*
14551new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc)
14552{
14553 RNODE_FNDPTN(fndptn)->nd_pconst = constant;
14554
14555 return fndptn;
14556}
14557
14558static NODE*
14559new_find_pattern_tail(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc)
14560{
14561 pre_rest_arg = pre_rest_arg ? pre_rest_arg : NODE_SPECIAL_NO_NAME_REST;
14562 post_rest_arg = post_rest_arg ? post_rest_arg : NODE_SPECIAL_NO_NAME_REST;
14563 NODE *node = NEW_FNDPTN(pre_rest_arg, args, post_rest_arg, loc);
14564
14565 return node;
14566}
14567
14568static NODE*
14569new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc)
14570{
14571 RNODE_HSHPTN(hshptn)->nd_pconst = constant;
14572 return hshptn;
14573}
14574
14575static NODE*
14576new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc)
14577{
14578 NODE *node, *kw_rest_arg_node;
14579
14580 if (kw_rest_arg == idNil) {
14581 kw_rest_arg_node = NODE_SPECIAL_NO_REST_KEYWORD;
14582 }
14583 else if (kw_rest_arg) {
14584 kw_rest_arg_node = assignable(p, kw_rest_arg, 0, loc);
14585 }
14586 else {
14587 kw_rest_arg_node = NULL;
14588 }
14589
14590 node = NEW_HSHPTN(0, kw_args, kw_rest_arg_node, loc);
14591
14592 return node;
14593}
14594
14595static NODE*
14596dsym_node(struct parser_params *p, NODE *node, const YYLTYPE *loc)
14597{
14598 if (!node) {
14599 return NEW_SYM(STR_NEW0(), loc);
14600 }
14601
14602 switch (nd_type(node)) {
14603 case NODE_DSTR:
14604 nd_set_type(node, NODE_DSYM);
14605 nd_set_loc(node, loc);
14606 break;
14607 case NODE_STR:
14608 node = str_to_sym_node(p, node, loc);
14609 break;
14610 default:
14611 node = NEW_DSYM(0, 1, NEW_LIST(node, loc), loc);
14612 break;
14613 }
14614 return node;
14615}
14616
14617static int
14618nd_type_st_key_enable_p(NODE *node)
14619{
14620 switch (nd_type(node)) {
14621 case NODE_INTEGER:
14622 case NODE_FLOAT:
14623 case NODE_RATIONAL:
14624 case NODE_IMAGINARY:
14625 case NODE_STR:
14626 case NODE_SYM:
14627 case NODE_REGX:
14628 case NODE_LINE:
14629 case NODE_FILE:
14630 case NODE_ENCODING:
14631 return true;
14632 default:
14633 return false;
14634 }
14635}
14636
14637static VALUE
14638nd_value(struct parser_params *p, NODE *node)
14639{
14640 switch (nd_type(node)) {
14641 case NODE_STR:
14642 return rb_node_str_string_val(node);
14643 case NODE_INTEGER:
14644 return rb_node_integer_literal_val(node);
14645 case NODE_FLOAT:
14646 return rb_node_float_literal_val(node);
14647 case NODE_RATIONAL:
14648 return rb_node_rational_literal_val(node);
14649 case NODE_IMAGINARY:
14650 return rb_node_imaginary_literal_val(node);
14651 case NODE_SYM:
14652 return rb_node_sym_string_val(node);
14653 case NODE_REGX:
14654 return rb_node_regx_string_val(node);
14655 case NODE_LINE:
14656 return rb_node_line_lineno_val(node);
14657 case NODE_ENCODING:
14658 return rb_node_encoding_val(node);
14659 case NODE_FILE:
14660 return rb_node_file_path_val(node);
14661 default:
14662 rb_bug("unexpected node: %s", ruby_node_name(nd_type(node)));
14663 UNREACHABLE_RETURN(0);
14664 }
14665}
14666
14667static void
14668warn_duplicate_keys(struct parser_params *p, NODE *hash)
14669{
14670 /* See https://bugs.ruby-lang.org/issues/20331 for discussion about what is warned. */
14671 p->warn_duplicate_keys_table = st_init_table_with_size(&literal_type, RNODE_LIST(hash)->as.nd_alen / 2);
14672 while (hash && RNODE_LIST(hash)->nd_next) {
14673 NODE *head = RNODE_LIST(hash)->nd_head;
14674 NODE *value = RNODE_LIST(hash)->nd_next;
14675 NODE *next = RNODE_LIST(value)->nd_next;
14676 st_data_t key;
14677 st_data_t data;
14678
14679 /* keyword splat, e.g. {k: 1, **z, k: 2} */
14680 if (!head) {
14681 head = value;
14682 }
14683
14684 if (nd_type_st_key_enable_p(head)) {
14685 key = (st_data_t)head;
14686
14687 if (st_delete(p->warn_duplicate_keys_table, &key, &data)) {
14688 rb_warn2L(nd_line((NODE *)data),
14689 "key %+"PRIsWARN" is duplicated and overwritten on line %d",
14690 nd_value(p, head), WARN_I(nd_line(head)));
14691 }
14692 st_insert(p->warn_duplicate_keys_table, (st_data_t)key, (st_data_t)hash);
14693 }
14694 hash = next;
14695 }
14696 st_free_table(p->warn_duplicate_keys_table);
14697 p->warn_duplicate_keys_table = NULL;
14698}
14699
14700static NODE *
14701new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc)
14702{
14703 if (hash) warn_duplicate_keys(p, hash);
14704 return NEW_HASH(hash, loc);
14705}
14706
14707static void
14708error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc)
14709{
14710 if (is_private_local_id(p, id)) {
14711 return;
14712 }
14713 if (st_is_member(p->pvtbl, id)) {
14714 yyerror1(loc, "duplicated variable name");
14715 }
14716 else if (p->ctxt.in_alt_pattern && id) {
14717 yyerror1(loc, "variable capture in alternative pattern");
14718 }
14719 else {
14720 p->ctxt.capture_in_pattern = 1;
14721 st_insert(p->pvtbl, (st_data_t)id, 0);
14722 }
14723}
14724
14725static void
14726error_duplicate_pattern_key(struct parser_params *p, VALUE key, const YYLTYPE *loc)
14727{
14728 if (!p->pktbl) {
14729 p->pktbl = st_init_numtable();
14730 }
14731 else if (st_is_member(p->pktbl, key)) {
14732 yyerror1(loc, "duplicated key name");
14733 return;
14734 }
14735 st_insert(p->pktbl, (st_data_t)key, 0);
14736}
14737
14738static NODE *
14739new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc)
14740{
14741 return NEW_HASH(hash, loc);
14742}
14743
14744static NODE *
14745new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
14746{
14747 NODE *asgn;
14748
14749 if (lhs) {
14750 ID vid = get_nd_vid(p, lhs);
14751 YYLTYPE lhs_loc = lhs->nd_loc;
14752 if (op == tOROP) {
14753 set_nd_value(p, lhs, rhs);
14754 nd_set_loc(lhs, loc);
14755 asgn = NEW_OP_ASGN_OR(gettable(p, vid, &lhs_loc), lhs, loc);
14756 }
14757 else if (op == tANDOP) {
14758 set_nd_value(p, lhs, rhs);
14759 nd_set_loc(lhs, loc);
14760 asgn = NEW_OP_ASGN_AND(gettable(p, vid, &lhs_loc), lhs, loc);
14761 }
14762 else {
14763 asgn = lhs;
14764 rhs = NEW_CALL(gettable(p, vid, &lhs_loc), op, NEW_LIST(rhs, &rhs->nd_loc), loc);
14765 set_nd_value(p, asgn, rhs);
14766 nd_set_loc(asgn, loc);
14767 }
14768 }
14769 else {
14770 asgn = NEW_ERROR(loc);
14771 }
14772 return asgn;
14773}
14774
14775static NODE *
14776new_ary_op_assign(struct parser_params *p, NODE *ary,
14777 NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc,
14778 const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc)
14779{
14780 NODE *asgn;
14781
14782 aryset_check(p, args);
14783 args = make_list(args, args_loc);
14784 asgn = NEW_OP_ASGN1(ary, op, args, rhs, loc, call_operator_loc, opening_loc, closing_loc, binary_operator_loc);
14785 fixpos(asgn, ary);
14786 return asgn;
14787}
14788
14789static NODE *
14790new_attr_op_assign(struct parser_params *p, NODE *lhs,
14791 ID atype, ID attr, ID op, NODE *rhs, const YYLTYPE *loc,
14792 const YYLTYPE *call_operator_loc, const YYLTYPE *message_loc, const YYLTYPE *binary_operator_loc)
14793{
14794 NODE *asgn;
14795
14796 asgn = NEW_OP_ASGN2(lhs, CALL_Q_P(atype), attr, op, rhs, loc, call_operator_loc, message_loc, binary_operator_loc);
14797 fixpos(asgn, lhs);
14798 return asgn;
14799}
14800
14801static NODE *
14802new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc)
14803{
14804 NODE *asgn;
14805
14806 if (lhs) {
14807 asgn = NEW_OP_CDECL(lhs, op, rhs, ctxt.shareable_constant_value, loc);
14808 }
14809 else {
14810 asgn = NEW_ERROR(loc);
14811 }
14812 fixpos(asgn, lhs);
14813 return asgn;
14814}
14815
14816static NODE *
14817const_decl(struct parser_params *p, NODE *path, const YYLTYPE *loc)
14818{
14819 if (p->ctxt.in_def) {
14820#ifndef RIPPER
14821 yyerror1(loc, "dynamic constant assignment");
14822#else
14823 set_value(assign_error(p, "dynamic constant assignment", p->s_lvalue));
14824#endif
14825 }
14826 return NEW_CDECL(0, 0, (path), p->ctxt.shareable_constant_value, loc);
14827}
14828
14829#ifdef RIPPER
14830static VALUE
14831assign_error(struct parser_params *p, const char *mesg, VALUE a)
14832{
14833 a = dispatch2(assign_error, ERR_MESG(), a);
14834 ripper_error(p);
14835 return a;
14836}
14837#endif
14838
14839static NODE *
14840new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc)
14841{
14842 NODE *result = head;
14843 if (rescue) {
14844 NODE *tmp = rescue_else ? rescue_else : rescue;
14845 YYLTYPE rescue_loc = code_loc_gen(&head->nd_loc, &tmp->nd_loc);
14846
14847 result = NEW_RESCUE(head, rescue, rescue_else, &rescue_loc);
14848 nd_set_line(result, rescue->nd_loc.beg_pos.lineno);
14849 }
14850 if (ensure) {
14851 result = NEW_ENSURE(result, ensure, loc);
14852 }
14853 fixpos(result, head);
14854 return result;
14855}
14856
14857static void
14858warn_unused_var(struct parser_params *p, struct local_vars *local)
14859{
14860 int cnt;
14861
14862 if (!local->used) return;
14863 cnt = local->used->pos;
14864 if (cnt != local->vars->pos) {
14865 rb_parser_fatal(p, "local->used->pos != local->vars->pos");
14866 }
14867#ifndef RIPPER
14868 ID *v = local->vars->tbl;
14869 ID *u = local->used->tbl;
14870 for (int i = 0; i < cnt; ++i) {
14871 if (!v[i] || (u[i] & LVAR_USED)) continue;
14872 if (is_private_local_id(p, v[i])) continue;
14873 rb_warn1L((int)u[i], "assigned but unused variable - %"PRIsWARN, rb_id2str(v[i]));
14874 }
14875#endif
14876}
14877
14878static void
14879local_push(struct parser_params *p, int toplevel_scope)
14880{
14881 struct local_vars *local;
14882 int inherits_dvars = toplevel_scope && compile_for_eval;
14883 int warn_unused_vars = RTEST(ruby_verbose);
14884
14885 local = ALLOC(struct local_vars);
14886 local->prev = p->lvtbl;
14887 local->args = vtable_alloc(0);
14888 local->vars = vtable_alloc(inherits_dvars ? DVARS_INHERIT : DVARS_TOPSCOPE);
14889#ifndef RIPPER
14890 if (toplevel_scope && compile_for_eval) warn_unused_vars = 0;
14891 if (toplevel_scope && e_option_supplied(p)) warn_unused_vars = 0;
14892#endif
14893 local->numparam.outer = 0;
14894 local->numparam.inner = 0;
14895 local->numparam.current = 0;
14896 local->it = 0;
14897 local->used = warn_unused_vars ? vtable_alloc(0) : 0;
14898
14899# if WARN_PAST_SCOPE
14900 local->past = 0;
14901# endif
14902 CMDARG_PUSH(0);
14903 COND_PUSH(0);
14904 p->lvtbl = local;
14905}
14906
14907static void
14908vtable_chain_free(struct parser_params *p, struct vtable *table)
14909{
14910 while (!DVARS_TERMINAL_P(table)) {
14911 struct vtable *cur_table = table;
14912 table = cur_table->prev;
14913 vtable_free(cur_table);
14914 }
14915}
14916
14917static void
14918local_free(struct parser_params *p, struct local_vars *local)
14919{
14920 vtable_chain_free(p, local->used);
14921
14922# if WARN_PAST_SCOPE
14923 vtable_chain_free(p, local->past);
14924# endif
14925
14926 vtable_chain_free(p, local->args);
14927 vtable_chain_free(p, local->vars);
14928
14929 ruby_sized_xfree(local, sizeof(struct local_vars));
14930}
14931
14932static void
14933local_pop(struct parser_params *p)
14934{
14935 struct local_vars *local = p->lvtbl->prev;
14936 if (p->lvtbl->used) {
14937 warn_unused_var(p, p->lvtbl);
14938 }
14939
14940 local_free(p, p->lvtbl);
14941 p->lvtbl = local;
14942
14943 CMDARG_POP();
14944 COND_POP();
14945}
14946
14947static rb_ast_id_table_t *
14948local_tbl(struct parser_params *p)
14949{
14950 int cnt_args = vtable_size(p->lvtbl->args);
14951 int cnt_vars = vtable_size(p->lvtbl->vars);
14952 int cnt = cnt_args + cnt_vars;
14953 int i, j;
14954 rb_ast_id_table_t *tbl;
14955
14956 if (cnt <= 0) return 0;
14957 tbl = rb_ast_new_local_table(p->ast, cnt);
14958 MEMCPY(tbl->ids, p->lvtbl->args->tbl, ID, cnt_args);
14959 /* remove IDs duplicated to warn shadowing */
14960 for (i = 0, j = cnt_args; i < cnt_vars; ++i) {
14961 ID id = p->lvtbl->vars->tbl[i];
14962 if (!vtable_included(p->lvtbl->args, id)) {
14963 tbl->ids[j++] = id;
14964 }
14965 }
14966 if (j < cnt) {
14967 tbl = rb_ast_resize_latest_local_table(p->ast, j);
14968 }
14969
14970 return tbl;
14971}
14972
14973static void
14974numparam_name(struct parser_params *p, ID id)
14975{
14976 if (!NUMPARAM_ID_P(id)) return;
14977 compile_error(p, "_%d is reserved for numbered parameter",
14978 NUMPARAM_ID_TO_IDX(id));
14979}
14980
14981static void
14982arg_var(struct parser_params *p, ID id)
14983{
14984 numparam_name(p, id);
14985 vtable_add(p->lvtbl->args, id);
14986}
14987
14988static void
14989local_var(struct parser_params *p, ID id)
14990{
14991 numparam_name(p, id);
14992 vtable_add(p->lvtbl->vars, id);
14993 if (p->lvtbl->used) {
14994 vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline);
14995 }
14996}
14997
14998#ifndef RIPPER
14999int
15000rb_parser_local_defined(struct parser_params *p, ID id, const struct rb_iseq_struct *iseq)
15001{
15002 return rb_local_defined(id, iseq);
15003}
15004#endif
15005
15006static int
15007local_id_ref(struct parser_params *p, ID id, ID **vidrefp)
15008{
15009 struct vtable *vars, *args, *used;
15010
15011 vars = p->lvtbl->vars;
15012 args = p->lvtbl->args;
15013 used = p->lvtbl->used;
15014
15015 while (vars && !DVARS_TERMINAL_P(vars->prev)) {
15016 vars = vars->prev;
15017 args = args->prev;
15018 if (used) used = used->prev;
15019 }
15020
15021 if (vars && vars->prev == DVARS_INHERIT) {
15022 return rb_parser_local_defined(p, id, p->parent_iseq);
15023 }
15024 else if (vtable_included(args, id)) {
15025 return 1;
15026 }
15027 else {
15028 int i = vtable_included(vars, id);
15029 if (i && used && vidrefp) *vidrefp = &used->tbl[i-1];
15030 return i != 0;
15031 }
15032}
15033
15034static int
15035local_id(struct parser_params *p, ID id)
15036{
15037 return local_id_ref(p, id, NULL);
15038}
15039
15040static int
15041check_forwarding_args(struct parser_params *p)
15042{
15043 if (local_id(p, idFWD_ALL)) return TRUE;
15044 compile_error(p, "unexpected ...");
15045 return FALSE;
15046}
15047
15048static void
15049add_forwarding_args(struct parser_params *p)
15050{
15051 arg_var(p, idFWD_REST);
15052 arg_var(p, idFWD_KWREST);
15053 arg_var(p, idFWD_BLOCK);
15054 arg_var(p, idFWD_ALL);
15055}
15056
15057static void
15058forwarding_arg_check(struct parser_params *p, ID arg, ID all, const char *var)
15059{
15060 bool conflict = false;
15061
15062 struct vtable *vars, *args;
15063
15064 vars = p->lvtbl->vars;
15065 args = p->lvtbl->args;
15066
15067 while (vars && !DVARS_TERMINAL_P(vars->prev)) {
15068 conflict |= (vtable_included(args, arg) && !(all && vtable_included(args, all)));
15069 vars = vars->prev;
15070 args = args->prev;
15071 }
15072
15073 bool found = false;
15074 if (vars && vars->prev == DVARS_INHERIT && !found) {
15075 found = (rb_parser_local_defined(p, arg, p->parent_iseq) &&
15076 !(all && rb_parser_local_defined(p, all, p->parent_iseq)));
15077 }
15078 else {
15079 found = (vtable_included(args, arg) &&
15080 !(all && vtable_included(args, all)));
15081 }
15082
15083 if (!found) {
15084 compile_error(p, "no anonymous %s parameter", var);
15085 }
15086 else if (conflict) {
15087 compile_error(p, "anonymous %s parameter is also used within block", var);
15088 }
15089}
15090
15091static NODE *
15092new_args_forward_call(struct parser_params *p, NODE *leading, const YYLTYPE *loc, const YYLTYPE *argsloc)
15093{
15094 NODE *rest = NEW_LVAR(idFWD_REST, loc);
15095 NODE *kwrest = list_append(p, NEW_LIST(0, loc), NEW_LVAR(idFWD_KWREST, loc));
15096 rb_node_block_pass_t *block = NEW_BLOCK_PASS(NEW_LVAR(idFWD_BLOCK, loc), argsloc, &NULL_LOC);
15097 NODE *args = leading ? rest_arg_append(p, leading, rest, argsloc) : NEW_SPLAT(rest, loc, &NULL_LOC);
15098 block->forwarding = TRUE;
15099 args = arg_append(p, args, new_hash(p, kwrest, loc), argsloc);
15100 return arg_blk_pass(args, block);
15101}
15102
15103static NODE *
15104numparam_push(struct parser_params *p)
15105{
15106 struct local_vars *local = p->lvtbl;
15107 NODE *inner = local->numparam.inner;
15108 if (!local->numparam.outer) {
15109 local->numparam.outer = local->numparam.current;
15110 }
15111 local->numparam.inner = 0;
15112 local->numparam.current = 0;
15113 local->it = 0;
15114 return inner;
15115}
15116
15117static void
15118numparam_pop(struct parser_params *p, NODE *prev_inner)
15119{
15120 struct local_vars *local = p->lvtbl;
15121 if (prev_inner) {
15122 /* prefer first one */
15123 local->numparam.inner = prev_inner;
15124 }
15125 else if (local->numparam.current) {
15126 /* current and inner are exclusive */
15127 local->numparam.inner = local->numparam.current;
15128 }
15129 if (p->max_numparam > NO_PARAM) {
15130 /* current and outer are exclusive */
15131 local->numparam.current = local->numparam.outer;
15132 local->numparam.outer = 0;
15133 }
15134 else {
15135 /* no numbered parameter */
15136 local->numparam.current = 0;
15137 }
15138 local->it = 0;
15139}
15140
15141static const struct vtable *
15142dyna_push(struct parser_params *p)
15143{
15144 p->lvtbl->args = vtable_alloc(p->lvtbl->args);
15145 p->lvtbl->vars = vtable_alloc(p->lvtbl->vars);
15146 if (p->lvtbl->used) {
15147 p->lvtbl->used = vtable_alloc(p->lvtbl->used);
15148 }
15149 return p->lvtbl->args;
15150}
15151
15152static void
15153dyna_pop_vtable(struct parser_params *p, struct vtable **vtblp)
15154{
15155 struct vtable *tmp = *vtblp;
15156 *vtblp = tmp->prev;
15157# if WARN_PAST_SCOPE
15158 if (p->past_scope_enabled) {
15159 tmp->prev = p->lvtbl->past;
15160 p->lvtbl->past = tmp;
15161 return;
15162 }
15163# endif
15164 vtable_free(tmp);
15165}
15166
15167static void
15168dyna_pop_1(struct parser_params *p)
15169{
15170 struct vtable *tmp;
15171
15172 if ((tmp = p->lvtbl->used) != 0) {
15173 warn_unused_var(p, p->lvtbl);
15174 p->lvtbl->used = p->lvtbl->used->prev;
15175 vtable_free(tmp);
15176 }
15177 dyna_pop_vtable(p, &p->lvtbl->args);
15178 dyna_pop_vtable(p, &p->lvtbl->vars);
15179}
15180
15181static void
15182dyna_pop(struct parser_params *p, const struct vtable *lvargs)
15183{
15184 while (p->lvtbl->args != lvargs) {
15185 dyna_pop_1(p);
15186 if (!p->lvtbl->args) {
15187 struct local_vars *local = p->lvtbl->prev;
15188 ruby_sized_xfree(p->lvtbl, sizeof(*p->lvtbl));
15189 p->lvtbl = local;
15190 }
15191 }
15192 dyna_pop_1(p);
15193}
15194
15195static int
15196dyna_in_block(struct parser_params *p)
15197{
15198 return !DVARS_TERMINAL_P(p->lvtbl->vars) && p->lvtbl->vars->prev != DVARS_TOPSCOPE;
15199}
15200
15201#ifndef RIPPER
15202int
15203dvar_defined_ref(struct parser_params *p, ID id, ID **vidrefp)
15204{
15205 struct vtable *vars, *args, *used;
15206 int i;
15207
15208 args = p->lvtbl->args;
15209 vars = p->lvtbl->vars;
15210 used = p->lvtbl->used;
15211
15212 while (!DVARS_TERMINAL_P(vars)) {
15213 if (vtable_included(args, id)) {
15214 return 1;
15215 }
15216 if ((i = vtable_included(vars, id)) != 0) {
15217 if (used && vidrefp) *vidrefp = &used->tbl[i-1];
15218 return 1;
15219 }
15220 args = args->prev;
15221 vars = vars->prev;
15222 if (!vidrefp) used = 0;
15223 if (used) used = used->prev;
15224 }
15225
15226 if (vars == DVARS_INHERIT && !NUMPARAM_ID_P(id)) {
15227 return rb_dvar_defined(id, p->parent_iseq);
15228 }
15229
15230 return 0;
15231}
15232#endif
15233
15234static int
15235dvar_defined(struct parser_params *p, ID id)
15236{
15237 return dvar_defined_ref(p, id, NULL);
15238}
15239
15240static int
15241dvar_curr(struct parser_params *p, ID id)
15242{
15243 return (vtable_included(p->lvtbl->args, id) ||
15244 vtable_included(p->lvtbl->vars, id));
15245}
15246
15247static void
15248reg_fragment_enc_error(struct parser_params* p, rb_parser_string_t *str, int c)
15249{
15250 compile_error(p,
15251 "regexp encoding option '%c' differs from source encoding '%s'",
15252 c, rb_enc_name(rb_parser_str_get_encoding(str)));
15253}
15254
15255#ifndef RIPPER
15256static rb_encoding *
15257find_enc(struct parser_params* p, const char *name)
15258{
15259 int idx = rb_enc_find_index(name);
15260 if (idx < 0) {
15261 rb_bug("unknown encoding name: %s", name);
15262 }
15263
15264 return rb_enc_from_index(idx);
15265}
15266
15267static rb_encoding *
15268kcode_to_enc(struct parser_params* p, int kcode)
15269{
15270 rb_encoding *enc;
15271
15272 switch (kcode) {
15273 case ENC_ASCII8BIT:
15274 enc = rb_ascii8bit_encoding();
15275 break;
15276 case ENC_EUC_JP:
15277 enc = find_enc(p, "EUC-JP");
15278 break;
15279 case ENC_Windows_31J:
15280 enc = find_enc(p, "Windows-31J");
15281 break;
15282 case ENC_UTF8:
15283 enc = rb_utf8_encoding();
15284 break;
15285 default:
15286 enc = NULL;
15287 break;
15288 }
15289
15290 return enc;
15291}
15292
15293int
15294rb_reg_fragment_setenc(struct parser_params* p, rb_parser_string_t *str, int options)
15295{
15296 int c = RE_OPTION_ENCODING_IDX(options);
15297
15298 if (c) {
15299 int opt, idx;
15300 rb_encoding *enc;
15301
15302 char_to_option_kcode(c, &opt, &idx);
15303 enc = kcode_to_enc(p, idx);
15304 if (enc != rb_parser_str_get_encoding(str) &&
15305 !rb_parser_is_ascii_string(p, str)) {
15306 goto error;
15307 }
15308 rb_parser_string_set_encoding(str, enc);
15309 }
15310 else if (RE_OPTION_ENCODING_NONE(options)) {
15311 if (!PARSER_ENCODING_IS_ASCII8BIT(p, str) &&
15312 !rb_parser_is_ascii_string(p, str)) {
15313 c = 'n';
15314 goto error;
15315 }
15316 rb_parser_enc_associate(p, str, rb_ascii8bit_encoding());
15317 }
15318 else if (rb_is_usascii_enc(p->enc)) {
15319 rb_parser_enc_associate(p, str, rb_ascii8bit_encoding());
15320 }
15321 return 0;
15322
15323 error:
15324 return c;
15325}
15326#endif
15327
15328static void
15329reg_fragment_setenc(struct parser_params* p, rb_parser_string_t *str, int options)
15330{
15331 int c = rb_reg_fragment_setenc(p, str, options);
15332 if (c) reg_fragment_enc_error(p, str, c);
15333}
15334
15335#ifndef UNIVERSAL_PARSER
15336typedef struct {
15337 struct parser_params* parser;
15338 rb_encoding *enc;
15339 NODE *succ_block;
15340 const YYLTYPE *loc;
15341 rb_parser_assignable_func assignable;
15342} reg_named_capture_assign_t;
15343
15344static int
15345reg_named_capture_assign_iter(const OnigUChar *name, const OnigUChar *name_end,
15346 int back_num, int *back_refs, OnigRegex regex, void *arg0)
15347{
15348 reg_named_capture_assign_t *arg = (reg_named_capture_assign_t*)arg0;
15349 struct parser_params* p = arg->parser;
15350 rb_encoding *enc = arg->enc;
15351 long len = name_end - name;
15352 const char *s = (const char *)name;
15353
15354 return rb_reg_named_capture_assign_iter_impl(p, s, len, enc, &arg->succ_block, arg->loc, arg->assignable);
15355}
15356
15357static NODE *
15358reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc, rb_parser_assignable_func assignable)
15359{
15360 reg_named_capture_assign_t arg;
15361
15362 arg.parser = p;
15363 arg.enc = rb_enc_get(regexp);
15364 arg.succ_block = 0;
15365 arg.loc = loc;
15366 arg.assignable = assignable;
15367 onig_foreach_name(RREGEXP_PTR(regexp), reg_named_capture_assign_iter, &arg);
15368
15369 if (!arg.succ_block) return 0;
15370 return RNODE_BLOCK(arg.succ_block)->nd_next;
15371}
15372#endif
15373
15374#ifndef RIPPER
15375NODE *
15376rb_parser_assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc)
15377{
15378 return assignable(p, id, val, loc);
15379}
15380
15381int
15382rb_reg_named_capture_assign_iter_impl(struct parser_params *p, const char *s, long len,
15383 rb_encoding *enc, NODE **succ_block, const rb_code_location_t *loc, rb_parser_assignable_func assignable)
15384{
15385 ID var;
15386 NODE *node, *succ;
15387
15388 if (!len) return ST_CONTINUE;
15389 if (!VALID_SYMNAME_P(s, len, enc, ID_LOCAL))
15390 return ST_CONTINUE;
15391
15392 var = intern_cstr(s, len, enc);
15393 if (len < MAX_WORD_LENGTH && rb_reserved_word(s, (int)len)) {
15394 if (!lvar_defined(p, var)) return ST_CONTINUE;
15395 }
15396 node = node_assign(p, assignable(p, var, 0, loc), NEW_SYM(rb_id2str(var), loc), NO_LEX_CTXT, loc);
15397 succ = *succ_block;
15398 if (!succ) succ = NEW_ERROR(loc);
15399 succ = block_append(p, succ, node);
15400 *succ_block = succ;
15401 return ST_CONTINUE;
15402}
15403#endif
15404
15405static VALUE
15406parser_reg_compile(struct parser_params* p, rb_parser_string_t *str, int options)
15407{
15408 VALUE str2;
15409 reg_fragment_setenc(p, str, options);
15410 str2 = rb_str_new_parser_string(str);
15411 return rb_parser_reg_compile(p, str2, options);
15412}
15413
15414#ifndef RIPPER
15415VALUE
15416rb_parser_reg_compile(struct parser_params* p, VALUE str, int options)
15417{
15418 return rb_reg_compile(str, options & RE_OPTION_MASK, p->ruby_sourcefile, p->ruby_sourceline);
15419}
15420#endif
15421
15422static VALUE
15423reg_compile(struct parser_params* p, rb_parser_string_t *str, int options)
15424{
15425 VALUE re;
15426 VALUE err;
15427
15428 err = rb_errinfo();
15429 re = parser_reg_compile(p, str, options);
15430 if (NIL_P(re)) {
15431 VALUE m = rb_attr_get(rb_errinfo(), idMesg);
15432 rb_set_errinfo(err);
15433 compile_error(p, "%"PRIsVALUE, m);
15434 return Qnil;
15435 }
15436 return re;
15437}
15438
15439#ifndef RIPPER
15440void
15441rb_ruby_parser_set_options(struct parser_params *p, int print, int loop, int chomp, int split)
15442{
15443 p->do_print = print;
15444 p->do_loop = loop;
15445 p->do_chomp = chomp;
15446 p->do_split = split;
15447}
15448
15449static NODE *
15450parser_append_options(struct parser_params *p, NODE *node)
15451{
15452 static const YYLTYPE default_location = {{1, 0}, {1, 0}};
15453 const YYLTYPE *const LOC = &default_location;
15454
15455 if (p->do_print) {
15456 NODE *print = (NODE *)NEW_FCALL(rb_intern("print"),
15457 NEW_LIST(NEW_GVAR(idLASTLINE, LOC), LOC),
15458 LOC);
15459 node = block_append(p, node, print);
15460 }
15461
15462 if (p->do_loop) {
15463 NODE *irs = NEW_LIST(NEW_GVAR(rb_intern("$/"), LOC), LOC);
15464
15465 if (p->do_split) {
15466 ID ifs = rb_intern("$;");
15467 ID fields = rb_intern("$F");
15468 NODE *args = NEW_LIST(NEW_GVAR(ifs, LOC), LOC);
15469 NODE *split = NEW_GASGN(fields,
15470 NEW_CALL(NEW_GVAR(idLASTLINE, LOC),
15471 rb_intern("split"), args, LOC),
15472 LOC);
15473 node = block_append(p, split, node);
15474 }
15475 if (p->do_chomp) {
15476 NODE *chomp = NEW_SYM(rb_str_new_cstr("chomp"), LOC);
15477 chomp = list_append(p, NEW_LIST(chomp, LOC), NEW_TRUE(LOC));
15478 irs = list_append(p, irs, NEW_HASH(chomp, LOC));
15479 }
15480
15481 node = NEW_WHILE((NODE *)NEW_FCALL(idGets, irs, LOC), node, 1, LOC, &NULL_LOC, &NULL_LOC);
15482 }
15483
15484 return node;
15485}
15486
15487void
15488rb_init_parse(void)
15489{
15490 /* just to suppress unused-function warnings */
15491 (void)nodetype;
15492 (void)nodeline;
15493}
15494
15495ID
15496internal_id(struct parser_params *p)
15497{
15498 return rb_make_temporary_id(vtable_size(p->lvtbl->args) + vtable_size(p->lvtbl->vars));
15499}
15500#endif /* !RIPPER */
15501
15502static void
15503parser_initialize(struct parser_params *p)
15504{
15505 /* note: we rely on TypedData_Make_Struct to set most fields to 0 */
15506 p->command_start = TRUE;
15507 p->ruby_sourcefile_string = Qnil;
15508 p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE at first */
15509 string_buffer_init(p);
15510 p->node_id = 0;
15511 p->delayed.token = NULL;
15512 p->frozen_string_literal = -1; /* not specified */
15513#ifndef RIPPER
15514 p->error_buffer = Qfalse;
15515 p->end_expect_token_locations = NULL;
15516 p->token_id = 0;
15517 p->tokens = NULL;
15518#else
15519 p->result = Qnil;
15520 p->parsing_thread = Qnil;
15521 p->s_value = Qnil;
15522 p->s_lvalue = Qnil;
15523 p->s_value_stack = rb_ary_new();
15524#endif
15525 p->debug_buffer = Qnil;
15526 p->debug_output = rb_ractor_stdout();
15527 p->enc = rb_utf8_encoding();
15528 p->exits = 0;
15529}
15530
15531#ifdef RIPPER
15532#define rb_ruby_parser_mark ripper_parser_mark
15533#define rb_ruby_parser_free ripper_parser_free
15534#define rb_ruby_parser_memsize ripper_parser_memsize
15535#endif
15536
15537void
15538rb_ruby_parser_mark(void *ptr)
15539{
15540 struct parser_params *p = (struct parser_params*)ptr;
15541
15542 rb_gc_mark(p->ruby_sourcefile_string);
15543#ifndef RIPPER
15544 rb_gc_mark(p->error_buffer);
15545#else
15546 rb_gc_mark(p->value);
15547 rb_gc_mark(p->result);
15548 rb_gc_mark(p->parsing_thread);
15549 rb_gc_mark(p->s_value);
15550 rb_gc_mark(p->s_lvalue);
15551 rb_gc_mark(p->s_value_stack);
15552#endif
15553 rb_gc_mark(p->debug_buffer);
15554 rb_gc_mark(p->debug_output);
15555}
15556
15557void
15558rb_ruby_parser_free(void *ptr)
15559{
15560 struct parser_params *p = (struct parser_params*)ptr;
15561 struct local_vars *local, *prev;
15562
15563 if (p->ast) {
15564 rb_ast_free(p->ast);
15565 }
15566
15567 if (p->warn_duplicate_keys_table) {
15568 st_free_table(p->warn_duplicate_keys_table);
15569 }
15570
15571#ifndef RIPPER
15572 if (p->tokens) {
15573 rb_parser_ary_free(p, p->tokens);
15574 }
15575#endif
15576
15577 if (p->tokenbuf) {
15578 ruby_sized_xfree(p->tokenbuf, p->toksiz);
15579 }
15580
15581 for (local = p->lvtbl; local; local = prev) {
15582 prev = local->prev;
15583 local_free(p, local);
15584 }
15585
15586 {
15587 token_info *ptinfo;
15588 while ((ptinfo = p->token_info) != 0) {
15589 p->token_info = ptinfo->next;
15590 xfree(ptinfo);
15591 }
15592 }
15593 string_buffer_free(p);
15594
15595 if (p->pvtbl) {
15596 st_free_table(p->pvtbl);
15597 }
15598
15599 if (CASE_LABELS_ENABLED_P(p->case_labels)) {
15600 st_free_table(p->case_labels);
15601 }
15602
15603 xfree(p->lex.strterm);
15604 p->lex.strterm = 0;
15605
15606 xfree(ptr);
15607}
15608
15609size_t
15610rb_ruby_parser_memsize(const void *ptr)
15611{
15612 struct parser_params *p = (struct parser_params*)ptr;
15613 struct local_vars *local;
15614 size_t size = sizeof(*p);
15615
15616 size += p->toksiz;
15617 for (local = p->lvtbl; local; local = local->prev) {
15618 size += sizeof(*local);
15619 if (local->vars) size += local->vars->capa * sizeof(ID);
15620 }
15621 return size;
15622}
15623
15624#ifndef RIPPER
15625#undef rb_reserved_word
15626
15627const struct kwtable *
15628rb_reserved_word(const char *str, unsigned int len)
15629{
15630 return reserved_word(str, len);
15631}
15632
15633#ifdef UNIVERSAL_PARSER
15634rb_parser_t *
15635rb_ruby_parser_allocate(const rb_parser_config_t *config)
15636{
15637 /* parser_initialize expects fields to be set to 0 */
15638 rb_parser_t *p = (rb_parser_t *)config->calloc(1, sizeof(rb_parser_t));
15639 p->config = config;
15640 return p;
15641}
15642
15643rb_parser_t *
15644rb_ruby_parser_new(const rb_parser_config_t *config)
15645{
15646 /* parser_initialize expects fields to be set to 0 */
15647 rb_parser_t *p = rb_ruby_parser_allocate(config);
15648 parser_initialize(p);
15649 return p;
15650}
15651#else
15652rb_parser_t *
15653rb_ruby_parser_allocate(void)
15654{
15655 /* parser_initialize expects fields to be set to 0 */
15656 rb_parser_t *p = (rb_parser_t *)ruby_xcalloc(1, sizeof(rb_parser_t));
15657 return p;
15658}
15659
15660rb_parser_t *
15661rb_ruby_parser_new(void)
15662{
15663 /* parser_initialize expects fields to be set to 0 */
15664 rb_parser_t *p = rb_ruby_parser_allocate();
15665 parser_initialize(p);
15666 return p;
15667}
15668#endif
15669
15670rb_parser_t *
15671rb_ruby_parser_set_context(rb_parser_t *p, const struct rb_iseq_struct *base, int main)
15672{
15673 p->error_buffer = main ? Qfalse : Qnil;
15674 p->parent_iseq = base;
15675 return p;
15676}
15677
15678void
15679rb_ruby_parser_set_script_lines(rb_parser_t *p)
15680{
15681 p->debug_lines = rb_parser_ary_new_capa_for_script_line(p, 10);
15682}
15683
15684void
15685rb_ruby_parser_error_tolerant(rb_parser_t *p)
15686{
15687 p->error_tolerant = 1;
15688}
15689
15690void
15691rb_ruby_parser_keep_tokens(rb_parser_t *p)
15692{
15693 p->keep_tokens = 1;
15694 p->tokens = rb_parser_ary_new_capa_for_ast_token(p, 10);
15695}
15696
15697rb_encoding *
15698rb_ruby_parser_encoding(rb_parser_t *p)
15699{
15700 return p->enc;
15701}
15702
15703int
15704rb_ruby_parser_end_seen_p(rb_parser_t *p)
15705{
15706 return p->ruby__end__seen;
15707}
15708
15709int
15710rb_ruby_parser_set_yydebug(rb_parser_t *p, int flag)
15711{
15712 p->debug = flag;
15713 return flag;
15714}
15715#endif /* !RIPPER */
15716
15717#ifdef RIPPER
15718int
15719rb_ruby_parser_get_yydebug(rb_parser_t *p)
15720{
15721 return p->debug;
15722}
15723
15724void
15725rb_ruby_parser_set_value(rb_parser_t *p, VALUE value)
15726{
15727 p->value = value;
15728}
15729
15730int
15731rb_ruby_parser_error_p(rb_parser_t *p)
15732{
15733 return p->error_p;
15734}
15735
15736VALUE
15737rb_ruby_parser_debug_output(rb_parser_t *p)
15738{
15739 return p->debug_output;
15740}
15741
15742void
15743rb_ruby_parser_set_debug_output(rb_parser_t *p, VALUE output)
15744{
15745 p->debug_output = output;
15746}
15747
15748VALUE
15749rb_ruby_parser_parsing_thread(rb_parser_t *p)
15750{
15751 return p->parsing_thread;
15752}
15753
15754void
15755rb_ruby_parser_set_parsing_thread(rb_parser_t *p, VALUE parsing_thread)
15756{
15757 p->parsing_thread = parsing_thread;
15758}
15759
15760void
15761rb_ruby_parser_ripper_initialize(rb_parser_t *p, rb_parser_lex_gets_func *gets, rb_parser_input_data input, VALUE sourcefile_string, const char *sourcefile, int sourceline)
15762{
15763 p->lex.gets = gets;
15764 p->lex.input = input;
15765 p->eofp = 0;
15766 p->ruby_sourcefile_string = sourcefile_string;
15767 p->ruby_sourcefile = sourcefile;
15768 p->ruby_sourceline = sourceline;
15769}
15770
15771VALUE
15772rb_ruby_parser_result(rb_parser_t *p)
15773{
15774 return p->result;
15775}
15776
15777rb_encoding *
15778rb_ruby_parser_enc(rb_parser_t *p)
15779{
15780 return p->enc;
15781}
15782
15783VALUE
15784rb_ruby_parser_ruby_sourcefile_string(rb_parser_t *p)
15785{
15786 return p->ruby_sourcefile_string;
15787}
15788
15789int
15790rb_ruby_parser_ruby_sourceline(rb_parser_t *p)
15791{
15792 return p->ruby_sourceline;
15793}
15794
15795int
15796rb_ruby_parser_lex_state(rb_parser_t *p)
15797{
15798 return p->lex.state;
15799}
15800
15801void
15802rb_ruby_ripper_parse0(rb_parser_t *p)
15803{
15804 parser_prepare(p);
15805 p->ast = rb_ast_new();
15806 ripper_yyparse((void*)p);
15807 rb_ast_free(p->ast);
15808 p->ast = 0;
15809 p->eval_tree = 0;
15810 p->eval_tree_begin = 0;
15811}
15812
15813int
15814rb_ruby_ripper_dedent_string(rb_parser_t *p, rb_parser_string_t *string, int width)
15815{
15816 return dedent_string(p, string, width);
15817}
15818
15819int
15820rb_ruby_ripper_initialized_p(rb_parser_t *p)
15821{
15822 return p->lex.input != 0;
15823}
15824
15825void
15826rb_ruby_ripper_parser_initialize(rb_parser_t *p)
15827{
15828 parser_initialize(p);
15829}
15830
15831long
15832rb_ruby_ripper_column(rb_parser_t *p)
15833{
15834 return p->lex.ptok - p->lex.pbeg;
15835}
15836
15837long
15838rb_ruby_ripper_token_len(rb_parser_t *p)
15839{
15840 return p->lex.pcur - p->lex.ptok;
15841}
15842
15843rb_parser_string_t *
15844rb_ruby_ripper_lex_lastline(rb_parser_t *p)
15845{
15846 return p->lex.lastline;
15847}
15848
15849VALUE
15850rb_ruby_ripper_lex_state_name(struct parser_params *p, int state)
15851{
15852 return rb_parser_lex_state_name(p, (enum lex_state_e)state);
15853}
15854
15855#ifdef UNIVERSAL_PARSER
15856rb_parser_t *
15857rb_ripper_parser_params_allocate(const rb_parser_config_t *config)
15858{
15859 rb_parser_t *p = (rb_parser_t *)config->calloc(1, sizeof(rb_parser_t));
15860 p->config = config;
15861 return p;
15862}
15863#endif
15864
15865struct parser_params*
15866rb_ruby_ripper_parser_allocate(void)
15867{
15868 return (struct parser_params *)ruby_xcalloc(1, sizeof(struct parser_params));
15869}
15870#endif /* RIPPER */
15871
15872#ifndef RIPPER
15873void
15874rb_parser_printf(struct parser_params *p, const char *fmt, ...)
15875{
15876 va_list ap;
15877 VALUE mesg = p->debug_buffer;
15878
15879 if (NIL_P(mesg)) p->debug_buffer = mesg = rb_str_new(0, 0);
15880 va_start(ap, fmt);
15881 rb_str_vcatf(mesg, fmt, ap);
15882 va_end(ap);
15883 if (char_at_end(p, mesg, 0) == '\n') {
15884 rb_io_write(p->debug_output, mesg);
15885 p->debug_buffer = Qnil;
15886 }
15887}
15888
15889static void
15890parser_compile_error(struct parser_params *p, const rb_code_location_t *loc, const char *fmt, ...)
15891{
15892 va_list ap;
15893 int lineno, column;
15894
15895 if (loc) {
15896 lineno = loc->end_pos.lineno;
15897 column = loc->end_pos.column;
15898 }
15899 else {
15900 lineno = p->ruby_sourceline;
15901 column = rb_long2int(p->lex.pcur - p->lex.pbeg);
15902 }
15903
15904 rb_io_flush(p->debug_output);
15905 p->error_p = 1;
15906 va_start(ap, fmt);
15907 p->error_buffer =
15908 rb_syntax_error_append(p->error_buffer,
15909 p->ruby_sourcefile_string,
15910 lineno, column,
15911 p->enc, fmt, ap);
15912 va_end(ap);
15913}
15914
15915static size_t
15916count_char(const char *str, int c)
15917{
15918 int n = 0;
15919 while (str[n] == c) ++n;
15920 return n;
15921}
15922
15923/*
15924 * strip enclosing double-quotes, same as the default yytnamerr except
15925 * for that single-quotes matching back-quotes do not stop stripping.
15926 *
15927 * "\"`class' keyword\"" => "`class' keyword"
15928 */
15929size_t
15930rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr)
15931{
15932 if (*yystr == '"') {
15933 size_t yyn = 0, bquote = 0;
15934 const char *yyp = yystr;
15935
15936 while (*++yyp) {
15937 switch (*yyp) {
15938 case '\'':
15939 if (!bquote) {
15940 bquote = count_char(yyp+1, '\'') + 1;
15941 if (yyres) memcpy(&yyres[yyn], yyp, bquote);
15942 yyn += bquote;
15943 yyp += bquote - 1;
15944 break;
15945 }
15946 else {
15947 if (bquote && count_char(yyp+1, '\'') + 1 == bquote) {
15948 if (yyres) memcpy(yyres + yyn, yyp, bquote);
15949 yyn += bquote;
15950 yyp += bquote - 1;
15951 bquote = 0;
15952 break;
15953 }
15954 if (yyp[1] && yyp[1] != '\'' && yyp[2] == '\'') {
15955 if (yyres) memcpy(yyres + yyn, yyp, 3);
15956 yyn += 3;
15957 yyp += 2;
15958 break;
15959 }
15960 goto do_not_strip_quotes;
15961 }
15962
15963 case ',':
15964 goto do_not_strip_quotes;
15965
15966 case '\\':
15967 if (*++yyp != '\\')
15968 goto do_not_strip_quotes;
15969 /* Fall through. */
15970 default:
15971 if (yyres)
15972 yyres[yyn] = *yyp;
15973 yyn++;
15974 break;
15975
15976 case '"':
15977 case '\0':
15978 if (yyres)
15979 yyres[yyn] = '\0';
15980 return yyn;
15981 }
15982 }
15983 do_not_strip_quotes: ;
15984 }
15985
15986 if (!yyres) return strlen(yystr);
15987
15988 return (YYSIZE_T)(yystpcpy(yyres, yystr) - yyres);
15989}
15990#endif
15991
15992#ifdef RIPPER
15993#define validate(x) (void)(x)
15994
15995static VALUE
15996ripper_dispatch0(struct parser_params *p, ID mid)
15997{
15998 return rb_funcall(p->value, mid, 0);
15999}
16000
16001static VALUE
16002ripper_dispatch1(struct parser_params *p, ID mid, VALUE a)
16003{
16004 validate(a);
16005 return rb_funcall(p->value, mid, 1, a);
16006}
16007
16008static VALUE
16009ripper_dispatch2(struct parser_params *p, ID mid, VALUE a, VALUE b)
16010{
16011 validate(a);
16012 validate(b);
16013 return rb_funcall(p->value, mid, 2, a, b);
16014}
16015
16016static VALUE
16017ripper_dispatch3(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c)
16018{
16019 validate(a);
16020 validate(b);
16021 validate(c);
16022 return rb_funcall(p->value, mid, 3, a, b, c);
16023}
16024
16025static VALUE
16026ripper_dispatch4(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d)
16027{
16028 validate(a);
16029 validate(b);
16030 validate(c);
16031 validate(d);
16032 return rb_funcall(p->value, mid, 4, a, b, c, d);
16033}
16034
16035static VALUE
16036ripper_dispatch5(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e)
16037{
16038 validate(a);
16039 validate(b);
16040 validate(c);
16041 validate(d);
16042 validate(e);
16043 return rb_funcall(p->value, mid, 5, a, b, c, d, e);
16044}
16045
16046static VALUE
16047ripper_dispatch7(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e, VALUE f, VALUE g)
16048{
16049 validate(a);
16050 validate(b);
16051 validate(c);
16052 validate(d);
16053 validate(e);
16054 validate(f);
16055 validate(g);
16056 return rb_funcall(p->value, mid, 7, a, b, c, d, e, f, g);
16057}
16058
16059void
16060ripper_error(struct parser_params *p)
16061{
16062 p->error_p = TRUE;
16063}
16064
16065VALUE
16066ripper_value(struct parser_params *p)
16067{
16068 (void)yystpcpy; /* may not used in newer bison */
16069
16070 return p->value;
16071}
16072
16073#endif /* RIPPER */
16074/*
16075 * Local variables:
16076 * mode: c
16077 * c-file-style: "ruby"
16078 * End:
16079 */
Generated by doxygen 1.17.0