diff options
Diffstat (limited to 'parse.y')
| -rw-r--r-- | parse.y | 20162 |
1 files changed, 15070 insertions, 5092 deletions
@@ -3,298 +3,2870 @@ parse.y - $Author$ - $Date$ created at: Fri May 28 18:02:42 JST 1993 - Copyright (C) 1993-2003 Yukihiro Matsumoto + Copyright (C) 1993-2007 Yukihiro Matsumoto **********************************************************************/ %{ +#if !YYPURE +# error needs pure parser +#endif #define YYDEBUG 1 +#define YYERROR_VERBOSE 1 +#define YYSTACK_USE_ALLOCA 0 + +/* For Ripper */ +#ifdef RUBY_EXTCONF_H +# include RUBY_EXTCONF_H +#endif + +#include "ruby/internal/config.h" -#include "ruby.h" -#include "env.h" -#include "intern.h" -#include "node.h" -#include "st.h" -#include <stdio.h> #include <errno.h> -#include <ctype.h> -#define yyparse ruby_yyparse -#define yylex ruby_yylex -#define yyerror ruby_yyerror -#define yylval ruby_yylval -#define yychar ruby_yychar -#define yydebug ruby_yydebug - -#define ID_SCOPE_SHIFT 3 -#define ID_SCOPE_MASK 0x07 -#define ID_LOCAL 0x01 -#define ID_INSTANCE 0x02 -#define ID_GLOBAL 0x03 -#define ID_ATTRSET 0x04 -#define ID_CONST 0x05 -#define ID_CLASS 0x06 -#define ID_JUNK 0x07 -#define ID_INTERNAL ID_JUNK - -#define is_notop_id(id) ((id)>tLAST_TOKEN) -#define is_local_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_LOCAL) -#define is_global_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_GLOBAL) -#define is_instance_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_INSTANCE) -#define is_attrset_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_ATTRSET) -#define is_const_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_CONST) -#define is_class_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_CLASS) -#define is_junk_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_JUNK) - -#define is_asgn_or_id(id) ((is_notop_id(id)) && \ - (((id)&ID_SCOPE_MASK) == ID_GLOBAL || \ - ((id)&ID_SCOPE_MASK) == ID_INSTANCE || \ - ((id)&ID_SCOPE_MASK) == ID_CLASS)) - -NODE *ruby_eval_tree_begin = 0; -NODE *ruby_eval_tree = 0; - -char *ruby_sourcefile; /* current source file */ -int ruby_sourceline; /* current line no. */ - -static int yylex(); -static int yyerror(); - -static enum lex_state { - EXPR_BEG, /* ignore newline, +/- is a sign. */ - EXPR_END, /* newline significant, +/- is a operator. */ - EXPR_ARG, /* newline significant, +/- is a operator. */ - EXPR_CMDARG, /* newline significant, +/- is a operator. */ - EXPR_ENDARG, /* newline significant, +/- is a operator. */ - EXPR_MID, /* newline significant, +/- is a operator. */ - EXPR_FNAME, /* ignore newline, no reserved words. */ - EXPR_DOT, /* right after `.' or `::', no reserved words. */ - EXPR_CLASS, /* immediate after `class', no here document. */ - EXPR_TERNARY, /* alike EXPR_BEG but immediate after ternary op. */ -} lex_state; -static NODE *lex_strterm; - -#ifdef HAVE_LONG_LONG -typedef unsigned LONG_LONG stack_type; +#ifdef UNIVERSAL_PARSER + +#include "internal/ruby_parser.h" +#include "parser_node.h" +#include "universal_parser.c" + +#ifdef RIPPER +#define STATIC_ID2SYM p->config->static_id2sym +#define rb_str_coderange_scan_restartable p->config->str_coderange_scan_restartable +#endif + +#else + +#include "internal.h" +#include "internal/compile.h" +#include "internal/compilers.h" +#include "internal/complex.h" +#include "internal/encoding.h" +#include "internal/error.h" +#include "internal/hash.h" +#include "internal/io.h" +#include "internal/numeric.h" +#include "internal/parse.h" +#include "internal/rational.h" +#include "internal/re.h" +#include "internal/ruby_parser.h" +#include "internal/symbol.h" +#include "internal/thread.h" +#include "internal/variable.h" +#include "node.h" +#include "parser_node.h" +#include "probes.h" +#include "regenc.h" +#include "ruby/encoding.h" +#include "ruby/regex.h" +#include "ruby/ruby.h" +#include "ruby/st.h" +#include "ruby/util.h" +#include "ruby/ractor.h" +#include "symbol.h" + +#ifndef RIPPER +static VALUE +syntax_error_new(void) +{ + return rb_class_new_instance(0, 0, rb_eSyntaxError); +} +#endif + +static NODE *reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc, rb_parser_assignable_func assignable); + +#define compile_callback rb_suppress_tracing +#endif /* !UNIVERSAL_PARSER */ + +#define NODE_SPECIAL_EMPTY_ARGS ((NODE *)-1) +#define NODE_EMPTY_ARGS_P(node) ((node) == NODE_SPECIAL_EMPTY_ARGS) + +static int rb_parser_string_hash_cmp(rb_parser_string_t *str1, rb_parser_string_t *str2); + +#ifndef RIPPER +static rb_parser_string_t *rb_parser_string_deep_copy(struct parser_params *p, const rb_parser_string_t *original); +#endif + +static int +node_integer_cmp(rb_node_integer_t *n1, rb_node_integer_t *n2) +{ + return (n1->minus != n2->minus || + n1->base != n2->base || + strcmp(n1->val, n2->val)); +} + +static int +node_float_cmp(rb_node_float_t *n1, rb_node_float_t *n2) +{ + return (n1->minus != n2->minus || + strcmp(n1->val, n2->val)); +} + +static int +node_rational_cmp(rb_node_rational_t *n1, rb_node_rational_t *n2) +{ + return (n1->minus != n2->minus || + n1->base != n2->base || + n1->seen_point != n2->seen_point || + strcmp(n1->val, n2->val)); +} + +static int +node_imaginary_cmp(rb_node_imaginary_t *n1, rb_node_imaginary_t *n2) +{ + return (n1->minus != n2->minus || + n1->base != n2->base || + n1->seen_point != n2->seen_point || + n1->type != n2->type || + strcmp(n1->val, n2->val)); +} + +static int +rb_parser_regx_hash_cmp(rb_node_regx_t *n1, rb_node_regx_t *n2) +{ + return (n1->options != n2->options || + rb_parser_string_hash_cmp(n1->string, n2->string)); +} + +static st_index_t rb_parser_str_hash(rb_parser_string_t *str); +static st_index_t rb_char_p_hash(const char *c); + +static int +literal_cmp(st_data_t val, st_data_t lit) +{ + if (val == lit) return 0; + + NODE *node_val = RNODE(val); + NODE *node_lit = RNODE(lit); + enum node_type type_val = nd_type(node_val); + enum node_type type_lit = nd_type(node_lit); + + if (type_val != type_lit) { + return -1; + } + + switch (type_lit) { + case NODE_INTEGER: + return node_integer_cmp(RNODE_INTEGER(node_val), RNODE_INTEGER(node_lit)); + case NODE_FLOAT: + return node_float_cmp(RNODE_FLOAT(node_val), RNODE_FLOAT(node_lit)); + case NODE_RATIONAL: + return node_rational_cmp(RNODE_RATIONAL(node_val), RNODE_RATIONAL(node_lit)); + case NODE_IMAGINARY: + return node_imaginary_cmp(RNODE_IMAGINARY(node_val), RNODE_IMAGINARY(node_lit)); + case NODE_STR: + return rb_parser_string_hash_cmp(RNODE_STR(node_val)->string, RNODE_STR(node_lit)->string); + case NODE_SYM: + return rb_parser_string_hash_cmp(RNODE_SYM(node_val)->string, RNODE_SYM(node_lit)->string); + case NODE_REGX: + return rb_parser_regx_hash_cmp(RNODE_REGX(node_val), RNODE_REGX(node_lit)); + case NODE_LINE: + return node_val->nd_loc.beg_pos.lineno != node_lit->nd_loc.beg_pos.lineno; + case NODE_FILE: + return rb_parser_string_hash_cmp(RNODE_FILE(node_val)->path, RNODE_FILE(node_lit)->path); + case NODE_ENCODING: + return RNODE_ENCODING(node_val)->enc != RNODE_ENCODING(node_lit)->enc; + default: +#ifdef UNIVERSAL_PARSER + abort(); #else -typedef unsigned long stack_type; + rb_bug("unexpected node: %s, %s", ruby_node_name(type_val), ruby_node_name(type_lit)); +#endif + } +} + +static st_index_t +literal_hash(st_data_t a) +{ + NODE *node = (NODE *)a; + enum node_type type = nd_type(node); + + switch (type) { + case NODE_INTEGER: + return rb_char_p_hash(RNODE_INTEGER(node)->val); + case NODE_FLOAT: + return rb_char_p_hash(RNODE_FLOAT(node)->val); + case NODE_RATIONAL: + return rb_char_p_hash(RNODE_RATIONAL(node)->val); + case NODE_IMAGINARY: + return rb_char_p_hash(RNODE_IMAGINARY(node)->val); + case NODE_STR: + return rb_parser_str_hash(RNODE_STR(node)->string); + case NODE_SYM: + return rb_parser_str_hash(RNODE_SYM(node)->string); + case NODE_REGX: + return rb_parser_str_hash(RNODE_REGX(node)->string); + case NODE_LINE: + return (st_index_t)node->nd_loc.beg_pos.lineno; + case NODE_FILE: + return rb_parser_str_hash(RNODE_FILE(node)->path); + case NODE_ENCODING: + return (st_index_t)RNODE_ENCODING(node)->enc; + default: +#ifdef UNIVERSAL_PARSER + abort(); +#else + rb_bug("unexpected node: %s", ruby_node_name(type)); +#endif + } +} + +static inline int +parse_isascii(int c) +{ + return '\0' <= c && c <= '\x7f'; +} + +#undef ISASCII +#define ISASCII parse_isascii + +static inline int +parse_isspace(int c) +{ + return c == ' ' || ('\t' <= c && c <= '\r'); +} + +#undef ISSPACE +#define ISSPACE parse_isspace + +static inline int +parse_iscntrl(int c) +{ + return ('\0' <= c && c < ' ') || c == '\x7f'; +} + +#undef ISCNTRL +#define ISCNTRL(c) parse_iscntrl(c) + +static inline int +parse_isupper(int c) +{ + return 'A' <= c && c <= 'Z'; +} + +static inline int +parse_islower(int c) +{ + return 'a' <= c && c <= 'z'; +} + +static inline int +parse_isalpha(int c) +{ + return parse_isupper(c) || parse_islower(c); +} + +#undef ISALPHA +#define ISALPHA(c) parse_isalpha(c) + +static inline int +parse_isdigit(int c) +{ + return '0' <= c && c <= '9'; +} + +#undef ISDIGIT +#define ISDIGIT(c) parse_isdigit(c) + +static inline int +parse_isalnum(int c) +{ + return ISALPHA(c) || ISDIGIT(c); +} + +#undef ISALNUM +#define ISALNUM(c) parse_isalnum(c) + +static inline int +parse_isxdigit(int c) +{ + return ISDIGIT(c) || ('A' <= c && c <= 'F') || ('a' <= c && c <= 'f'); +} + +#undef ISXDIGIT +#define ISXDIGIT(c) parse_isxdigit(c) + +#include "parser_st.h" + +#undef STRCASECMP +#define STRCASECMP rb_parser_st_locale_insensitive_strcasecmp + +#undef STRNCASECMP +#define STRNCASECMP rb_parser_st_locale_insensitive_strncasecmp + +#ifdef RIPPER +#include "ripper_init.h" +#endif + +enum rescue_context { + before_rescue, + after_rescue, + after_else, + after_ensure, +}; + +struct lex_context { + unsigned int in_defined: 1; + unsigned int in_kwarg: 1; + unsigned int in_argdef: 1; + unsigned int in_def: 1; + unsigned int in_class: 1; + unsigned int has_trailing_semicolon: 1; + BITFIELD(enum rb_parser_shareability, shareable_constant_value, 2); + BITFIELD(enum rescue_context, in_rescue, 2); + unsigned int cant_return: 1; + unsigned int in_alt_pattern: 1; + unsigned int capture_in_pattern: 1; +}; + +typedef struct RNode_DEF_TEMP rb_node_def_temp_t; + +#if defined(__GNUC__) && !defined(__clang__) +// Suppress "parameter passing for argument of type 'struct +// lex_context' changed" notes. `struct lex_context` is file scope, +// and has no ABI compatibility issue. +RBIMPL_WARNING_PUSH() +RBIMPL_WARNING_IGNORED(-Wpsabi) +RBIMPL_WARNING_POP() +// Not sure why effective even after popped. +#endif + +#include "parse.h" + +#define NO_LEX_CTXT (struct lex_context){0} + +#ifndef WARN_PAST_SCOPE +# define WARN_PAST_SCOPE 0 #endif -#define BITSTACK_PUSH(stack, n) (stack = (stack<<1)|((n)&1)) -#define BITSTACK_POP(stack) (stack >>= 1) -#define BITSTACK_LEXPOP(stack) (stack = (stack >> 1) | (stack & 1)) -#define BITSTACK_SET_P(stack) (stack&1) +#define TAB_WIDTH 8 + +#define yydebug (p->debug) /* disable the global variable definition */ + +#define YYFPRINTF(out, ...) rb_parser_printf(p, __VA_ARGS__) +#define YY_LOCATION_PRINT(File, loc, p) \ + rb_parser_printf(p, "%d.%d-%d.%d", \ + (loc).beg_pos.lineno, (loc).beg_pos.column,\ + (loc).end_pos.lineno, (loc).end_pos.column) +#define YYLLOC_DEFAULT(Current, Rhs, N) \ + do \ + if (N) \ + { \ + (Current).beg_pos = YYRHSLOC(Rhs, 1).beg_pos; \ + (Current).end_pos = YYRHSLOC(Rhs, N).end_pos; \ + } \ + else \ + { \ + (Current).beg_pos = YYRHSLOC(Rhs, 0).end_pos; \ + (Current).end_pos = YYRHSLOC(Rhs, 0).end_pos; \ + } \ + while (0) +#define YY_(Msgid) \ + (((Msgid)[0] == 'm') && (strcmp((Msgid), "memory exhausted") == 0) ? \ + "nesting too deep" : (Msgid)) + +#define RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(Current) \ + rb_parser_set_location_from_strterm_heredoc(p, &p->lex.strterm->u.heredoc, &(Current)) +#define RUBY_SET_YYLLOC_OF_DELAYED_TOKEN(Current) \ + rb_parser_set_location_of_delayed_token(p, &(Current)) +#define RUBY_SET_YYLLOC_OF_HEREDOC_END(Current) \ + rb_parser_set_location_of_heredoc_end(p, &(Current)) +#define RUBY_SET_YYLLOC_OF_DUMMY_END(Current) \ + rb_parser_set_location_of_dummy_end(p, &(Current)) +#define RUBY_SET_YYLLOC_OF_NONE(Current) \ + rb_parser_set_location_of_none(p, &(Current)) +#define RUBY_SET_YYLLOC(Current) \ + rb_parser_set_location(p, &(Current)) +#define RUBY_INIT_YYLLOC() \ + { \ + {p->ruby_sourceline, (int)(p->lex.ptok - p->lex.pbeg)}, \ + {p->ruby_sourceline, (int)(p->lex.pcur - p->lex.pbeg)}, \ + } + +#define IS_lex_state_for(x, ls) ((x) & (ls)) +#define IS_lex_state_all_for(x, ls) (((x) & (ls)) == (ls)) +#define IS_lex_state(ls) IS_lex_state_for(p->lex.state, (ls)) +#define IS_lex_state_all(ls) IS_lex_state_all_for(p->lex.state, (ls)) + +# define SET_LEX_STATE(ls) \ + parser_set_lex_state(p, ls, __LINE__) +static inline enum lex_state_e parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line); + +typedef VALUE stack_type; + +static const rb_code_location_t NULL_LOC = { {0, -1}, {0, -1} }; + +# define SHOW_BITSTACK(stack, name) (p->debug ? rb_parser_show_bitstack(p, stack, name, __LINE__) : (void)0) +# define BITSTACK_PUSH(stack, n) (((p->stack) = ((p->stack)<<1)|((n)&1)), SHOW_BITSTACK(p->stack, #stack"(push)")) +# define BITSTACK_POP(stack) (((p->stack) = (p->stack) >> 1), SHOW_BITSTACK(p->stack, #stack"(pop)")) +# define BITSTACK_SET_P(stack) (SHOW_BITSTACK(p->stack, #stack), (p->stack)&1) +# define BITSTACK_SET(stack, n) ((p->stack)=(n), SHOW_BITSTACK(p->stack, #stack"(set)")) -static stack_type cond_stack = 0; -#define COND_PUSH(n) BITSTACK_PUSH(cond_stack, n) +/* A flag to identify keyword_do_cond, "do" keyword after condition expression. + Examples: `while ... do`, `until ... do`, and `for ... in ... do` */ +#define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n)) #define COND_POP() BITSTACK_POP(cond_stack) -#define COND_LEXPOP() BITSTACK_LEXPOP(cond_stack) #define COND_P() BITSTACK_SET_P(cond_stack) +#define COND_SET(n) BITSTACK_SET(cond_stack, (n)) -static stack_type cmdarg_stack = 0; -#define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, n) +/* A flag to identify keyword_do_block; "do" keyword after command_call. + Example: `foo 1, 2 do`. */ +#define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n)) #define CMDARG_POP() BITSTACK_POP(cmdarg_stack) -#define CMDARG_LEXPOP() BITSTACK_LEXPOP(cmdarg_stack) #define CMDARG_P() BITSTACK_SET_P(cmdarg_stack) +#define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n)) + +struct vtable { + ID *tbl; + int pos; + int capa; + struct vtable *prev; +}; + +struct local_vars { + struct vtable *args; + struct vtable *vars; + struct vtable *used; +# if WARN_PAST_SCOPE + struct vtable *past; +# endif + struct local_vars *prev; + struct { + NODE *outer, *inner, *current; + } numparam; + NODE *it; +}; + +typedef struct rb_locations_lambda_body_t { + NODE *node; + YYLTYPE opening_loc; + YYLTYPE closing_loc; +} rb_locations_lambda_body_t; + +enum { + ORDINAL_PARAM = -1, + NO_PARAM = 0, + NUMPARAM_MAX = 9, +}; + +#define DVARS_INHERIT ((void*)1) +#define DVARS_TOPSCOPE NULL +#define DVARS_TERMINAL_P(tbl) ((tbl) == DVARS_INHERIT || (tbl) == DVARS_TOPSCOPE) + +typedef struct token_info { + const char *token; + rb_code_position_t beg; + int indent; + int nonspc; + struct token_info *next; +} token_info; + +typedef struct end_expect_token_locations { + const rb_code_position_t *pos; + struct end_expect_token_locations *prev; +} end_expect_token_locations_t; + +typedef struct parser_string_buffer_elem { + struct parser_string_buffer_elem *next; + long len; /* Total length of allocated buf */ + long used; /* Current usage of buf */ + rb_parser_string_t *buf[FLEX_ARY_LEN]; +} parser_string_buffer_elem_t; + +typedef struct parser_string_buffer { + parser_string_buffer_elem_t *head; + parser_string_buffer_elem_t *last; +} parser_string_buffer_t; + +#define AFTER_HEREDOC_WITHOUT_TERMINATOR ((rb_parser_string_t *)1) + +/* + Structure of Lexer Buffer: + + lex.pbeg lex.ptok lex.pcur lex.pend + | | | | + |------------+------------+------------| + |<---------->| + token +*/ +struct parser_params { + YYSTYPE *lval; + YYLTYPE *yylloc; + + struct { + rb_strterm_t *strterm; + rb_parser_lex_gets_func *gets; + rb_parser_input_data input; + parser_string_buffer_t string_buffer; + rb_parser_string_t *lastline; + rb_parser_string_t *nextline; + const char *pbeg; + const char *pcur; + const char *pend; + const char *ptok; + enum lex_state_e state; + /* track the nest level of any parens "()[]{}" */ + int paren_nest; + /* keep p->lex.paren_nest at the beginning of lambda "->" to detect tLAMBEG and keyword_do_LAMBDA */ + int lpar_beg; + /* track the nest level of only braces "{}" */ + int brace_nest; + } lex; + stack_type cond_stack; + stack_type cmdarg_stack; + int tokidx; + int toksiz; + int heredoc_end; + int heredoc_indent; + int heredoc_line_indent; + char *tokenbuf; + struct local_vars *lvtbl; + st_table *pvtbl; + st_table *pktbl; + int line_count; + int ruby_sourceline; /* current line no. */ + const char *ruby_sourcefile; /* current source file */ + VALUE ruby_sourcefile_string; + rb_encoding *enc; + token_info *token_info; + st_table *case_labels; + rb_node_exits_t *exits; + + VALUE debug_buffer; + VALUE debug_output; + + struct { + rb_parser_string_t *token; + int beg_line; + int beg_col; + int end_line; + int end_col; + } delayed; + + rb_ast_t *ast; + int node_id; + + st_table *warn_duplicate_keys_table; + + int max_numparam; + ID it_id; + + struct lex_context ctxt; + + NODE *eval_tree_begin; + NODE *eval_tree; + const struct rb_iseq_struct *parent_iseq; + +#ifdef UNIVERSAL_PARSER + const rb_parser_config_t *config; +#endif + /* compile_option */ + signed int frozen_string_literal:2; /* -1: not specified, 0: false, 1: true */ + + unsigned int command_start:1; + unsigned int eofp: 1; + unsigned int ruby__end__seen: 1; + unsigned int debug: 1; + unsigned int has_shebang: 1; + unsigned int token_seen: 1; + unsigned int token_info_enabled: 1; +# if WARN_PAST_SCOPE + unsigned int past_scope_enabled: 1; +# endif + unsigned int error_p: 1; + unsigned int cr_seen: 1; + +#ifndef RIPPER + /* Ruby core only */ + + unsigned int do_print: 1; + unsigned int do_loop: 1; + unsigned int do_chomp: 1; + unsigned int do_split: 1; + unsigned int error_tolerant: 1; + unsigned int keep_tokens: 1; + + VALUE error_buffer; + rb_parser_ary_t *debug_lines; + /* + * Store specific keyword locations to generate dummy end token. + * Refer to the tail of list element. + */ + end_expect_token_locations_t *end_expect_token_locations; + /* id for terms */ + int token_id; + /* Array for term tokens */ + rb_parser_ary_t *tokens; +#else + /* Ripper only */ + + VALUE value; + VALUE result; + VALUE parsing_thread; + VALUE s_value; /* Token VALUE */ + VALUE s_lvalue; /* VALUE generated by rule action (reduce) */ + VALUE s_value_stack; +#endif +}; + +#define NUMPARAM_ID_P(id) numparam_id_p(p, id) +#define NUMPARAM_ID_TO_IDX(id) (unsigned int)(((id) >> ID_SCOPE_SHIFT) - (tNUMPARAM_1 - 1)) +#define NUMPARAM_IDX_TO_ID(idx) TOKEN2LOCALID((tNUMPARAM_1 - 1 + (idx))) +static int +numparam_id_p(struct parser_params *p, ID id) +{ + if (!is_local_id(id) || id < (tNUMPARAM_1 << ID_SCOPE_SHIFT)) return 0; + unsigned int idx = NUMPARAM_ID_TO_IDX(id); + return idx > 0 && idx <= NUMPARAM_MAX; +} +static void numparam_name(struct parser_params *p, ID id); + +#ifdef RIPPER +static void +after_shift(struct parser_params *p) +{ + if (p->debug) { + rb_parser_printf(p, "after-shift: %+"PRIsVALUE"\n", p->s_value); + } + rb_ary_push(p->s_value_stack, p->s_value); + p->s_value = Qnil; +} + +static void +before_reduce(int len, struct parser_params *p) +{ + // Initialize $$ with $1. + if (len) p->s_lvalue = rb_ary_entry(p->s_value_stack, -len); +} + +static void +after_reduce(int len, struct parser_params *p) +{ + for (int i = 0; i < len; i++) { + VALUE tos = rb_ary_pop(p->s_value_stack); + if (p->debug) { + rb_parser_printf(p, "after-reduce pop: %+"PRIsVALUE"\n", tos); + } + } + if (p->debug) { + rb_parser_printf(p, "after-reduce push: %+"PRIsVALUE"\n", p->s_lvalue); + } + rb_ary_push(p->s_value_stack, p->s_lvalue); + p->s_lvalue = Qnil; +} + +static void +after_shift_error_token(struct parser_params *p) +{ + if (p->debug) { + rb_parser_printf(p, "after-shift-error-token:\n"); + } + rb_ary_push(p->s_value_stack, Qnil); +} + +static void +after_pop_stack(int len, struct parser_params *p) +{ + for (int i = 0; i < len; i++) { + VALUE tos = rb_ary_pop(p->s_value_stack); + if (p->debug) { + rb_parser_printf(p, "after-pop-stack pop: %+"PRIsVALUE"\n", tos); + } + } +} +#else +static void +after_shift(struct parser_params *p) +{ +} + +static void +before_reduce(int len, struct parser_params *p) +{ +} + +static void +after_reduce(int len, struct parser_params *p) +{ +} + +static void +after_shift_error_token(struct parser_params *p) +{ +} + +static void +after_pop_stack(int len, struct parser_params *p) +{ +} +#endif + +#define intern_cstr(n,l,en) rb_intern3(n,l,en) + +#define STRING_NEW0() rb_parser_encoding_string_new(p,0,0,p->enc) + +#define STR_NEW(ptr,len) rb_enc_str_new((ptr),(len),p->enc) +#define STR_NEW0() rb_enc_str_new(0,0,p->enc) +#define STR_NEW2(ptr) rb_enc_str_new((ptr),strlen(ptr),p->enc) +#define STR_NEW3(ptr,len,e,func) parser_str_new(p, (ptr),(len),(e),(func),p->enc) +#define TOK_INTERN() intern_cstr(tok(p), toklen(p), p->enc) +#define VALID_SYMNAME_P(s, l, enc, type) (rb_enc_symname_type(s, l, enc, (1U<<(type))) == (int)(type)) + +#ifndef RIPPER +static inline int +char_at_end(struct parser_params *p, VALUE str, int when_empty) +{ + long len = RSTRING_LEN(str); + return len > 0 ? (unsigned char)RSTRING_PTR(str)[len-1] : when_empty; +} +#endif + +static void +pop_pvtbl(struct parser_params *p, st_table *tbl) +{ + st_free_table(p->pvtbl); + p->pvtbl = tbl; +} + +static void +pop_pktbl(struct parser_params *p, st_table *tbl) +{ + if (p->pktbl) st_free_table(p->pktbl); + p->pktbl = tbl; +} + +#define STRING_BUF_DEFAULT_LEN 16 + +static void +string_buffer_init(struct parser_params *p) +{ + parser_string_buffer_t *buf = &p->lex.string_buffer; + const size_t size = offsetof(parser_string_buffer_elem_t, buf) + sizeof(rb_parser_string_t *) * STRING_BUF_DEFAULT_LEN; + + buf->head = buf->last = xmalloc(size); + buf->head->len = STRING_BUF_DEFAULT_LEN; + buf->head->used = 0; + buf->head->next = NULL; +} + +static void +string_buffer_append(struct parser_params *p, rb_parser_string_t *str) +{ + parser_string_buffer_t *buf = &p->lex.string_buffer; + + if (buf->head->used >= buf->head->len) { + parser_string_buffer_elem_t *elem; + long n = buf->head->len * 2; + const size_t size = offsetof(parser_string_buffer_elem_t, buf) + sizeof(rb_parser_string_t *) * n; + + elem = xmalloc(size); + elem->len = n; + elem->used = 0; + elem->next = NULL; + buf->last->next = elem; + buf->last = elem; + } + buf->last->buf[buf->last->used++] = str; +} + +static void +string_buffer_free(struct parser_params *p) +{ + parser_string_buffer_elem_t *elem = p->lex.string_buffer.head; + + while (elem) { + parser_string_buffer_elem_t *next_elem = elem->next; + + for (long i = 0; i < elem->used; i++) { + rb_parser_string_free(p, elem->buf[i]); + } + + xfree(elem); + elem = next_elem; + } +} + +#ifndef RIPPER +static void flush_debug_buffer(struct parser_params *p, VALUE out, VALUE str); + +static void +debug_end_expect_token_locations(struct parser_params *p, const char *name) +{ + if(p->debug) { + VALUE mesg = rb_sprintf("%s: [", name); + int i = 0; + for (end_expect_token_locations_t *loc = p->end_expect_token_locations; loc; loc = loc->prev) { + if (i > 0) + rb_str_cat_cstr(mesg, ", "); + rb_str_catf(mesg, "[%d, %d]", loc->pos->lineno, loc->pos->column); + i++; + } + rb_str_cat_cstr(mesg, "]\n"); + flush_debug_buffer(p, p->debug_output, mesg); + } +} + +static void +push_end_expect_token_locations(struct parser_params *p, const rb_code_position_t *pos) +{ + if(!p->error_tolerant) return; + + end_expect_token_locations_t *locations; + locations = ALLOC(end_expect_token_locations_t); + locations->pos = pos; + locations->prev = p->end_expect_token_locations; + p->end_expect_token_locations = locations; -static int class_nest = 0; -static int in_single = 0; -static int in_def = 0; -static int compile_for_eval = 0; -static ID cur_mid = 0; - -static NODE *cond(); -static NODE *logop(); -static int cond_negative(); - -static NODE *newline_node(); -static void fixpos(); - -static int value_expr0(); -static void void_expr0(); -static void void_stmts(); -static NODE *remove_begin(); -#define value_expr(node) value_expr0((node) = remove_begin(node)) -#define void_expr(node) void_expr0((node) = remove_begin(node)) -static void reduce_nodes(); - -static NODE *block_append(); -static NODE *list_append(); -static NODE *list_concat(); -static NODE *arg_concat(); -static NODE *arg_prepend(); -static NODE *literal_concat(); -static NODE *new_evstr(); -static NODE *evstr2dstr(); -static NODE *call_op(); -static int in_defined = 0; - -static NODE *negate_lit(); -static NODE *ret_args(); -static NODE *arg_blk_pass(); -static NODE *new_call(); -static NODE *new_fcall(); -static NODE *new_super(); -static NODE *new_yield(); - -static NODE *gettable(); -static NODE *assignable(); -static NODE *aryset(); -static NODE *attrset(); -static void rb_backref_error(); -static NODE *node_assign(); - -static NODE *match_gen(); -static void local_push(); -static void local_pop(); -static int local_append(); -static int local_cnt(); -static int local_id(); -static ID *local_tbl(); -static ID internal_id(); - -static struct RVarmap *dyna_push(); -static void dyna_pop(); -static int dyna_in_block(); -static NODE *dyna_init(); - -static void top_local_init(); -static void top_local_setup(); - -#define RE_OPTION_ONCE 0x80 - -#define NODE_STRTERM NODE_ZARRAY /* nothing to gc */ -#define NODE_HEREDOC NODE_ARRAY /* 1, 3 to gc */ -#define SIGN_EXTEND(x,n) (((1<<(n))-1-((x)&~(~0<<(n))))^~(~0<<(n))) -#define nd_func u1.id -#if SIZEOF_SHORT == 2 -#define nd_term(node) ((signed short)(node)->u2.id) + debug_end_expect_token_locations(p, "push_end_expect_token_locations"); +} + +static void +pop_end_expect_token_locations(struct parser_params *p) +{ + if(!p->end_expect_token_locations) return; + + end_expect_token_locations_t *locations = p->end_expect_token_locations->prev; + ruby_sized_xfree(p->end_expect_token_locations, sizeof(end_expect_token_locations_t)); + p->end_expect_token_locations = locations; + + debug_end_expect_token_locations(p, "pop_end_expect_token_locations"); +} + +static end_expect_token_locations_t * +peek_end_expect_token_locations(struct parser_params *p) +{ + return p->end_expect_token_locations; +} + +static const char * +parser_token2char(struct parser_params *p, enum yytokentype tok) +{ + switch ((int) tok) { +#define TOKEN2CHAR(tok) case tok: return (#tok); +#define TOKEN2CHAR2(tok, name) case tok: return (name); + TOKEN2CHAR2(' ', "word_sep"); + TOKEN2CHAR2('!', "!") + TOKEN2CHAR2('%', "%"); + TOKEN2CHAR2('&', "&"); + TOKEN2CHAR2('*', "*"); + TOKEN2CHAR2('+', "+"); + TOKEN2CHAR2('-', "-"); + TOKEN2CHAR2('/', "/"); + TOKEN2CHAR2('<', "<"); + TOKEN2CHAR2('=', "="); + TOKEN2CHAR2('>', ">"); + TOKEN2CHAR2('?', "?"); + TOKEN2CHAR2('^', "^"); + TOKEN2CHAR2('|', "|"); + TOKEN2CHAR2('~', "~"); + TOKEN2CHAR2(':', ":"); + TOKEN2CHAR2(',', ","); + TOKEN2CHAR2('.', "."); + TOKEN2CHAR2(';', ";"); + TOKEN2CHAR2('`', "`"); + TOKEN2CHAR2('\n', "nl"); + TOKEN2CHAR2('{', "\"{\""); + TOKEN2CHAR2('}', "\"}\""); + TOKEN2CHAR2('[', "\"[\""); + TOKEN2CHAR2(']', "\"]\""); + TOKEN2CHAR2('(', "\"(\""); + TOKEN2CHAR2(')', "\")\""); + TOKEN2CHAR2('\\', "backslash"); + TOKEN2CHAR(keyword_class); + TOKEN2CHAR(keyword_module); + TOKEN2CHAR(keyword_def); + TOKEN2CHAR(keyword_undef); + TOKEN2CHAR(keyword_begin); + TOKEN2CHAR(keyword_rescue); + TOKEN2CHAR(keyword_ensure); + TOKEN2CHAR(keyword_end); + TOKEN2CHAR(keyword_if); + TOKEN2CHAR(keyword_unless); + TOKEN2CHAR(keyword_then); + TOKEN2CHAR(keyword_elsif); + TOKEN2CHAR(keyword_else); + TOKEN2CHAR(keyword_case); + TOKEN2CHAR(keyword_when); + TOKEN2CHAR(keyword_while); + TOKEN2CHAR(keyword_until); + TOKEN2CHAR(keyword_for); + TOKEN2CHAR(keyword_break); + TOKEN2CHAR(keyword_next); + TOKEN2CHAR(keyword_redo); + TOKEN2CHAR(keyword_retry); + TOKEN2CHAR(keyword_in); + TOKEN2CHAR(keyword_do); + TOKEN2CHAR(keyword_do_cond); + TOKEN2CHAR(keyword_do_block); + TOKEN2CHAR(keyword_do_LAMBDA); + TOKEN2CHAR(keyword_return); + TOKEN2CHAR(keyword_yield); + TOKEN2CHAR(keyword_super); + TOKEN2CHAR(keyword_self); + TOKEN2CHAR(keyword_nil); + TOKEN2CHAR(keyword_true); + TOKEN2CHAR(keyword_false); + TOKEN2CHAR(keyword_and); + TOKEN2CHAR(keyword_or); + TOKEN2CHAR(keyword_not); + TOKEN2CHAR(modifier_if); + TOKEN2CHAR(modifier_unless); + TOKEN2CHAR(modifier_while); + TOKEN2CHAR(modifier_until); + TOKEN2CHAR(modifier_rescue); + TOKEN2CHAR(keyword_alias); + TOKEN2CHAR(keyword_defined); + TOKEN2CHAR(keyword_BEGIN); + TOKEN2CHAR(keyword_END); + TOKEN2CHAR(keyword__LINE__); + TOKEN2CHAR(keyword__FILE__); + TOKEN2CHAR(keyword__ENCODING__); + TOKEN2CHAR(tIDENTIFIER); + TOKEN2CHAR(tFID); + TOKEN2CHAR(tGVAR); + TOKEN2CHAR(tIVAR); + TOKEN2CHAR(tCONSTANT); + TOKEN2CHAR(tCVAR); + TOKEN2CHAR(tLABEL); + TOKEN2CHAR(tINTEGER); + TOKEN2CHAR(tFLOAT); + TOKEN2CHAR(tRATIONAL); + TOKEN2CHAR(tIMAGINARY); + TOKEN2CHAR(tCHAR); + TOKEN2CHAR(tNTH_REF); + TOKEN2CHAR(tBACK_REF); + TOKEN2CHAR(tSTRING_CONTENT); + TOKEN2CHAR(tREGEXP_END); + TOKEN2CHAR(tDUMNY_END); + TOKEN2CHAR(tSP); + TOKEN2CHAR(tUPLUS); + TOKEN2CHAR(tUMINUS); + TOKEN2CHAR(tPOW); + TOKEN2CHAR(tCMP); + TOKEN2CHAR(tEQ); + TOKEN2CHAR(tEQQ); + TOKEN2CHAR(tNEQ); + TOKEN2CHAR(tGEQ); + TOKEN2CHAR(tLEQ); + TOKEN2CHAR(tANDOP); + TOKEN2CHAR(tOROP); + TOKEN2CHAR(tMATCH); + TOKEN2CHAR(tNMATCH); + TOKEN2CHAR(tDOT2); + TOKEN2CHAR(tDOT3); + TOKEN2CHAR(tBDOT2); + TOKEN2CHAR(tBDOT3); + TOKEN2CHAR(tAREF); + TOKEN2CHAR(tASET); + TOKEN2CHAR(tLSHFT); + TOKEN2CHAR(tRSHFT); + TOKEN2CHAR(tANDDOT); + TOKEN2CHAR(tCOLON2); + TOKEN2CHAR(tCOLON3); + TOKEN2CHAR(tOP_ASGN); + TOKEN2CHAR(tASSOC); + TOKEN2CHAR(tLPAREN); + TOKEN2CHAR(tLPAREN_ARG); + TOKEN2CHAR(tLBRACK); + TOKEN2CHAR(tLBRACE); + TOKEN2CHAR(tLBRACE_ARG); + TOKEN2CHAR(tSTAR); + TOKEN2CHAR(tDSTAR); + TOKEN2CHAR(tAMPER); + TOKEN2CHAR(tLAMBDA); + TOKEN2CHAR(tSYMBEG); + TOKEN2CHAR(tSTRING_BEG); + TOKEN2CHAR(tXSTRING_BEG); + TOKEN2CHAR(tREGEXP_BEG); + TOKEN2CHAR(tWORDS_BEG); + TOKEN2CHAR(tQWORDS_BEG); + TOKEN2CHAR(tSYMBOLS_BEG); + TOKEN2CHAR(tQSYMBOLS_BEG); + TOKEN2CHAR(tSTRING_END); + TOKEN2CHAR(tSTRING_DEND); + TOKEN2CHAR(tSTRING_DBEG); + TOKEN2CHAR(tSTRING_DVAR); + TOKEN2CHAR(tLAMBEG); + TOKEN2CHAR(tLABEL_END); + TOKEN2CHAR(tIGNORED_NL); + TOKEN2CHAR(tCOMMENT); + TOKEN2CHAR(tEMBDOC_BEG); + TOKEN2CHAR(tEMBDOC); + TOKEN2CHAR(tEMBDOC_END); + TOKEN2CHAR(tHEREDOC_BEG); + TOKEN2CHAR(tHEREDOC_END); + TOKEN2CHAR(k__END__); + TOKEN2CHAR(tLOWEST); + TOKEN2CHAR(tUMINUS_NUM); + TOKEN2CHAR(tLAST_TOKEN); +#undef TOKEN2CHAR +#undef TOKEN2CHAR2 + } + + rb_bug("parser_token2id: unknown token %d", tok); + + UNREACHABLE_RETURN(0); +} #else -#define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2) +static void +push_end_expect_token_locations(struct parser_params *p, const rb_code_position_t *pos) +{ +} + +static void +pop_end_expect_token_locations(struct parser_params *p) +{ +} #endif -#define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2) -#define nd_nest u3.id - -/* Older versions of Yacc set YYMAXDEPTH to a very low value by default (150, - for instance). This is too low for Ruby to parse some files, such as - date/format.rb, therefore bump the value up to at least Bison's default. */ -#ifdef OLD_YACC -#ifndef YYMAXDEPTH -#define YYMAXDEPTH 10000 + +RBIMPL_ATTR_NONNULL((1, 2, 3)) +static int parser_yyerror(struct parser_params*, const YYLTYPE *yylloc, const char*); +RBIMPL_ATTR_NONNULL((1, 2)) +static int parser_yyerror0(struct parser_params*, const char*); +#define yyerror0(msg) parser_yyerror0(p, (msg)) +#define yyerror1(loc, msg) parser_yyerror(p, (loc), (msg)) +#define yyerror(yylloc, p, msg) parser_yyerror(p, yylloc, msg) +#define token_flush(ptr) ((ptr)->lex.ptok = (ptr)->lex.pcur) +#define lex_goto_eol(p) ((p)->lex.pcur = (p)->lex.pend) +#define lex_eol_p(p) lex_eol_n_p(p, 0) +#define lex_eol_n_p(p,n) lex_eol_ptr_n_p(p, (p)->lex.pcur, n) +#define lex_eol_ptr_p(p,ptr) lex_eol_ptr_n_p(p,ptr,0) +#define lex_eol_ptr_n_p(p,ptr,n) ((ptr)+(n) >= (p)->lex.pend) + +static void token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc); +static void token_info_push(struct parser_params*, const char *token, const rb_code_location_t *loc); +static void token_info_pop(struct parser_params*, const char *token, const rb_code_location_t *loc); +static void token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc); +static void token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos); + +#ifdef RIPPER +#define compile_for_eval (0) +#else +#define compile_for_eval (p->parent_iseq != 0) +#endif + +#define token_column ((int)(p->lex.ptok - p->lex.pbeg)) + +#define CALL_Q_P(q) ((q) == tANDDOT) +#define NEW_QCALL(q,r,m,a,loc) (CALL_Q_P(q) ? NEW_QCALL0(r,m,a,loc) : NEW_CALL(r,m,a,loc)) + +#define lambda_beginning_p() (p->lex.lpar_beg == p->lex.paren_nest) + +static enum yytokentype yylex(YYSTYPE*, YYLTYPE*, struct parser_params*); + +static inline void +rb_discard_node(struct parser_params *p, NODE *n) +{ + rb_ast_delete_node(p->ast, n); +} + +static 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); +static 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); +static rb_node_block_t *rb_node_block_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static rb_node_iter_t *rb_node_iter_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc); +static 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); +static rb_node_for_masgn_t *rb_node_for_masgn_new(struct parser_params *p, NODE *nd_var, const YYLTYPE *loc); +static rb_node_retry_t *rb_node_retry_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_begin_t *rb_node_begin_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc); +static rb_node_rescue_t *rb_node_rescue_new(struct parser_params *p, NODE *nd_head, NODE *nd_resq, NODE *nd_else, const YYLTYPE *loc); +static 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); +static rb_node_ensure_t *rb_node_ensure_new(struct parser_params *p, NODE *nd_head, NODE *nd_ensr, const YYLTYPE *loc); +static 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); +static 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); +static rb_node_masgn_t *rb_node_masgn_new(struct parser_params *p, NODE *nd_head, NODE *nd_args, const YYLTYPE *loc); +static rb_node_lasgn_t *rb_node_lasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc); +static rb_node_dasgn_t *rb_node_dasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc); +static rb_node_gasgn_t *rb_node_gasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc); +static rb_node_iasgn_t *rb_node_iasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc); +static 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); +static rb_node_cvasgn_t *rb_node_cvasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc); +static 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); +static 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); +static 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); +static 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); +static 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); +static rb_node_call_t *rb_node_call_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc); +static rb_node_opcall_t *rb_node_opcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc); +static rb_node_fcall_t *rb_node_fcall_new(struct parser_params *p, ID nd_mid, NODE *nd_args, const YYLTYPE *loc); +static rb_node_vcall_t *rb_node_vcall_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc); +static rb_node_qcall_t *rb_node_qcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc); +static 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); +static rb_node_zsuper_t * rb_node_zsuper_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_list_t *rb_node_list_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc); +static rb_node_list_t *rb_node_list_new2(struct parser_params *p, NODE *nd_head, long nd_alen, NODE *nd_next, const YYLTYPE *loc); +static rb_node_zlist_t *rb_node_zlist_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_hash_t *rb_node_hash_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc); +static rb_node_return_t *rb_node_return_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc); +static 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); +static rb_node_lvar_t *rb_node_lvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_dvar_t *rb_node_dvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_gvar_t *rb_node_gvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_ivar_t *rb_node_ivar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_const_t *rb_node_const_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_cvar_t *rb_node_cvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc); +static rb_node_nth_ref_t *rb_node_nth_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc); +static rb_node_back_ref_t *rb_node_back_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc); +static rb_node_match2_t *rb_node_match2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc); +static rb_node_match3_t *rb_node_match3_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc); +static rb_node_integer_t * rb_node_integer_new(struct parser_params *p, char* val, int base, const YYLTYPE *loc); +static rb_node_float_t * rb_node_float_new(struct parser_params *p, char* val, const YYLTYPE *loc); +static rb_node_rational_t * rb_node_rational_new(struct parser_params *p, char* val, int base, int seen_point, const YYLTYPE *loc); +static 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); +static rb_node_str_t *rb_node_str_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc); +static 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); +static rb_node_dstr_t *rb_node_dstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc); +static rb_node_xstr_t *rb_node_xstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc); +static 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); +static 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); +static 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); +static rb_node_once_t *rb_node_once_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc); +static rb_node_args_t *rb_node_args_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_args_aux_t *rb_node_args_aux_new(struct parser_params *p, ID nd_pid, int nd_plen, const YYLTYPE *loc); +static rb_node_opt_arg_t *rb_node_opt_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc); +static rb_node_kw_arg_t *rb_node_kw_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc); +static rb_node_postarg_t *rb_node_postarg_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc); +static rb_node_argscat_t *rb_node_argscat_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc); +static rb_node_argspush_t *rb_node_argspush_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc); +static rb_node_splat_t *rb_node_splat_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *operator_loc); +static rb_node_block_pass_t *rb_node_block_pass_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc); +static rb_node_defn_t *rb_node_defn_new(struct parser_params *p, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc); +static rb_node_defs_t *rb_node_defs_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc); +static 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); +static 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); +static rb_node_undef_t *rb_node_undef_new(struct parser_params *p, NODE *nd_undef, const YYLTYPE *loc); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static 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); +static rb_node_self_t *rb_node_self_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_nil_t *rb_node_nil_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_true_t *rb_node_true_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_false_t *rb_node_false_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_errinfo_t *rb_node_errinfo_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_defined_t *rb_node_defined_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc); +static 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); +static rb_node_sym_t *rb_node_sym_new(struct parser_params *p, VALUE str, const YYLTYPE *loc); +static 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); +static rb_node_attrasgn_t *rb_node_attrasgn_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc); +static 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); +static rb_node_aryptn_t *rb_node_aryptn_new(struct parser_params *p, NODE *pre_args, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc); +static rb_node_hshptn_t *rb_node_hshptn_new(struct parser_params *p, NODE *nd_pconst, NODE *nd_pkwargs, NODE *nd_pkwrestarg, const YYLTYPE *loc); +static 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); +static rb_node_line_t *rb_node_line_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_file_t *rb_node_file_new(struct parser_params *p, VALUE str, const YYLTYPE *loc); +static rb_node_error_t *rb_node_error_new(struct parser_params *p, const YYLTYPE *loc); + +#define NEW_SCOPE(a,b,c,loc) (NODE *)rb_node_scope_new(p,a,b,c,loc) +#define NEW_SCOPE2(t,a,b,c,loc) (NODE *)rb_node_scope_new2(p,t,a,b,c,loc) +#define NEW_BLOCK(a,loc) (NODE *)rb_node_block_new(p,a,loc) +#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) +#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) +#define NEW_CASE(h,b,loc,ck_loc,ek_loc) (NODE *)rb_node_case_new(p,h,b,loc,ck_loc,ek_loc) +#define NEW_CASE2(b,loc,ck_loc,ek_loc) (NODE *)rb_node_case2_new(p,b,loc,ck_loc,ek_loc) +#define NEW_CASE3(h,b,loc,ck_loc,ek_loc) (NODE *)rb_node_case3_new(p,h,b,loc,ck_loc,ek_loc) +#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) +#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) +#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) +#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) +#define NEW_ITER(a,b,loc) (NODE *)rb_node_iter_new(p,a,b,loc) +#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) +#define NEW_FOR_MASGN(v,loc) (NODE *)rb_node_for_masgn_new(p,v,loc) +#define NEW_RETRY(loc) (NODE *)rb_node_retry_new(p,loc) +#define NEW_BEGIN(b,loc) (NODE *)rb_node_begin_new(p,b,loc) +#define NEW_RESCUE(b,res,e,loc) (NODE *)rb_node_rescue_new(p,b,res,e,loc) +#define NEW_RESBODY(a,v,ex,n,loc) (NODE *)rb_node_resbody_new(p,a,v,ex,n,loc) +#define NEW_ENSURE(b,en,loc) (NODE *)rb_node_ensure_new(p,b,en,loc) +#define NEW_AND(f,s,loc,op_loc) (NODE *)rb_node_and_new(p,f,s,loc,op_loc) +#define NEW_OR(f,s,loc,op_loc) (NODE *)rb_node_or_new(p,f,s,loc,op_loc) +#define NEW_MASGN(l,r,loc) rb_node_masgn_new(p,l,r,loc) +#define NEW_LASGN(v,val,loc) (NODE *)rb_node_lasgn_new(p,v,val,loc) +#define NEW_DASGN(v,val,loc) (NODE *)rb_node_dasgn_new(p,v,val,loc) +#define NEW_GASGN(v,val,loc) (NODE *)rb_node_gasgn_new(p,v,val,loc) +#define NEW_IASGN(v,val,loc) (NODE *)rb_node_iasgn_new(p,v,val,loc) +#define NEW_CDECL(v,val,path,share,loc) (NODE *)rb_node_cdecl_new(p,v,val,path,share,loc) +#define NEW_CVASGN(v,val,loc) (NODE *)rb_node_cvasgn_new(p,v,val,loc) +#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) +#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) +#define NEW_OP_ASGN_OR(i,val,loc) (NODE *)rb_node_op_asgn_or_new(p,i,val,loc) +#define NEW_OP_ASGN_AND(i,val,loc) (NODE *)rb_node_op_asgn_and_new(p,i,val,loc) +#define NEW_OP_CDECL(v,op,val,share,loc) (NODE *)rb_node_op_cdecl_new(p,v,val,op,share,loc) +#define NEW_CALL(r,m,a,loc) (NODE *)rb_node_call_new(p,r,m,a,loc) +#define NEW_OPCALL(r,m,a,loc) (NODE *)rb_node_opcall_new(p,r,m,a,loc) +#define NEW_FCALL(m,a,loc) rb_node_fcall_new(p,m,a,loc) +#define NEW_VCALL(m,loc) (NODE *)rb_node_vcall_new(p,m,loc) +#define NEW_QCALL0(r,m,a,loc) (NODE *)rb_node_qcall_new(p,r,m,a,loc) +#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) +#define NEW_ZSUPER(loc) (NODE *)rb_node_zsuper_new(p,loc) +#define NEW_LIST(a,loc) (NODE *)rb_node_list_new(p,a,loc) +#define NEW_LIST2(h,l,n,loc) (NODE *)rb_node_list_new2(p,h,l,n,loc) +#define NEW_ZLIST(loc) (NODE *)rb_node_zlist_new(p,loc) +#define NEW_HASH(a,loc) (NODE *)rb_node_hash_new(p,a,loc) +#define NEW_RETURN(s,loc,k_loc) (NODE *)rb_node_return_new(p,s,loc,k_loc) +#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) +#define NEW_LVAR(v,loc) (NODE *)rb_node_lvar_new(p,v,loc) +#define NEW_DVAR(v,loc) (NODE *)rb_node_dvar_new(p,v,loc) +#define NEW_GVAR(v,loc) (NODE *)rb_node_gvar_new(p,v,loc) +#define NEW_IVAR(v,loc) (NODE *)rb_node_ivar_new(p,v,loc) +#define NEW_CONST(v,loc) (NODE *)rb_node_const_new(p,v,loc) +#define NEW_CVAR(v,loc) (NODE *)rb_node_cvar_new(p,v,loc) +#define NEW_NTH_REF(n,loc) (NODE *)rb_node_nth_ref_new(p,n,loc) +#define NEW_BACK_REF(n,loc) (NODE *)rb_node_back_ref_new(p,n,loc) +#define NEW_MATCH2(n1,n2,loc) (NODE *)rb_node_match2_new(p,n1,n2,loc) +#define NEW_MATCH3(r,n2,loc) (NODE *)rb_node_match3_new(p,r,n2,loc) +#define NEW_INTEGER(val, base,loc) (NODE *)rb_node_integer_new(p,val,base,loc) +#define NEW_FLOAT(val,loc) (NODE *)rb_node_float_new(p,val,loc) +#define NEW_RATIONAL(val,base,seen_point,loc) (NODE *)rb_node_rational_new(p,val,base,seen_point,loc) +#define NEW_IMAGINARY(val,base,seen_point,numeric_type,loc) (NODE *)rb_node_imaginary_new(p,val,base,seen_point,numeric_type,loc) +#define NEW_STR(s,loc) (NODE *)rb_node_str_new(p,s,loc) +#define NEW_DSTR0(s,l,n,loc) (NODE *)rb_node_dstr_new0(p,s,l,n,loc) +#define NEW_DSTR(s,loc) (NODE *)rb_node_dstr_new(p,s,loc) +#define NEW_XSTR(s,loc) (NODE *)rb_node_xstr_new(p,s,loc) +#define NEW_DXSTR(s,l,n,loc) (NODE *)rb_node_dxstr_new(p,s,l,n,loc) +#define NEW_EVSTR(n,loc,o_loc,c_loc) (NODE *)rb_node_evstr_new(p,n,loc,o_loc,c_loc) +#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) +#define NEW_ONCE(b,loc) (NODE *)rb_node_once_new(p,b,loc) +#define NEW_ARGS(loc) rb_node_args_new(p,loc) +#define NEW_ARGS_AUX(r,b,loc) rb_node_args_aux_new(p,r,b,loc) +#define NEW_OPT_ARG(v,loc) rb_node_opt_arg_new(p,v,loc) +#define NEW_KW_ARG(v,loc) rb_node_kw_arg_new(p,v,loc) +#define NEW_POSTARG(i,v,loc) (NODE *)rb_node_postarg_new(p,i,v,loc) +#define NEW_ARGSCAT(a,b,loc) (NODE *)rb_node_argscat_new(p,a,b,loc) +#define NEW_ARGSPUSH(a,b,loc) (NODE *)rb_node_argspush_new(p,a,b,loc) +#define NEW_SPLAT(a,loc,op_loc) (NODE *)rb_node_splat_new(p,a,loc,op_loc) +#define NEW_BLOCK_PASS(b,loc,o_loc) rb_node_block_pass_new(p,b,loc,o_loc) +#define NEW_DEFN(i,s,loc) (NODE *)rb_node_defn_new(p,i,s,loc) +#define NEW_DEFS(r,i,s,loc) (NODE *)rb_node_defs_new(p,r,i,s,loc) +#define NEW_ALIAS(n,o,loc,k_loc) (NODE *)rb_node_alias_new(p,n,o,loc,k_loc) +#define NEW_VALIAS(n,o,loc,k_loc) (NODE *)rb_node_valias_new(p,n,o,loc,k_loc) +#define NEW_UNDEF(i,loc) (NODE *)rb_node_undef_new(p,i,loc) +#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) +#define NEW_MODULE(n,b,loc,mk_loc,ek_loc) (NODE *)rb_node_module_new(p,n,b,loc,mk_loc,ek_loc) +#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) +#define NEW_COLON2(c,i,loc,d_loc,n_loc) (NODE *)rb_node_colon2_new(p,c,i,loc,d_loc,n_loc) +#define NEW_COLON3(i,loc,d_loc,n_loc) (NODE *)rb_node_colon3_new(p,i,loc,d_loc,n_loc) +#define NEW_DOT2(b,e,loc,op_loc) (NODE *)rb_node_dot2_new(p,b,e,loc,op_loc) +#define NEW_DOT3(b,e,loc,op_loc) (NODE *)rb_node_dot3_new(p,b,e,loc,op_loc) +#define NEW_SELF(loc) (NODE *)rb_node_self_new(p,loc) +#define NEW_NIL(loc) (NODE *)rb_node_nil_new(p,loc) +#define NEW_TRUE(loc) (NODE *)rb_node_true_new(p,loc) +#define NEW_FALSE(loc) (NODE *)rb_node_false_new(p,loc) +#define NEW_ERRINFO(loc) (NODE *)rb_node_errinfo_new(p,loc) +#define NEW_DEFINED(e,loc,k_loc) (NODE *)rb_node_defined_new(p,e,loc, k_loc) +#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) +#define NEW_SYM(str,loc) (NODE *)rb_node_sym_new(p,str,loc) +#define NEW_DSYM(s,l,n,loc) (NODE *)rb_node_dsym_new(p,s,l,n,loc) +#define NEW_ATTRASGN(r,m,a,loc) (NODE *)rb_node_attrasgn_new(p,r,m,a,loc) +#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) +#define NEW_ARYPTN(pre,r,post,loc) (NODE *)rb_node_aryptn_new(p,pre,r,post,loc) +#define NEW_HSHPTN(c,kw,kwrest,loc) (NODE *)rb_node_hshptn_new(p,c,kw,kwrest,loc) +#define NEW_FNDPTN(pre,a,post,loc) (NODE *)rb_node_fndptn_new(p,pre,a,post,loc) +#define NEW_LINE(loc) (NODE *)rb_node_line_new(p,loc) +#define NEW_FILE(str,loc) (NODE *)rb_node_file_new(p,str,loc) +#define NEW_ENCODING(loc) (NODE *)rb_node_encoding_new(p,loc) +#define NEW_ERROR(loc) (NODE *)rb_node_error_new(p,loc) + +enum internal_node_type { + NODE_INTERNAL_ONLY = NODE_LAST, + NODE_DEF_TEMP, + NODE_EXITS, + NODE_INTERNAL_LAST +}; + +static const char * +parser_node_name(int node) +{ + switch (node) { + case NODE_DEF_TEMP: + return "NODE_DEF_TEMP"; + case NODE_EXITS: + return "NODE_EXITS"; + default: + return ruby_node_name(node); + } +} + +/* This node is parse.y internal */ +struct RNode_DEF_TEMP { + NODE node; + + /* for NODE_DEFN/NODE_DEFS */ + + struct RNode *nd_def; + ID nd_mid; + + struct { + int max_numparam; + NODE *numparam_save; + struct lex_context ctxt; + } save; +}; + +#define RNODE_DEF_TEMP(node) ((struct RNode_DEF_TEMP *)(node)) + +static rb_node_break_t *rb_node_break_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc); +static rb_node_next_t *rb_node_next_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc); +static rb_node_redo_t *rb_node_redo_new(struct parser_params *p, const YYLTYPE *loc, const YYLTYPE *keyword_loc); +static rb_node_def_temp_t *rb_node_def_temp_new(struct parser_params *p, const YYLTYPE *loc); +static rb_node_def_temp_t *def_head_save(struct parser_params *p, rb_node_def_temp_t *n); + +#define NEW_BREAK(s,loc,k_loc) (NODE *)rb_node_break_new(p,s,loc,k_loc) +#define NEW_NEXT(s,loc,k_loc) (NODE *)rb_node_next_new(p,s,loc,k_loc) +#define NEW_REDO(loc,k_loc) (NODE *)rb_node_redo_new(p,loc,k_loc) +#define NEW_DEF_TEMP(loc) rb_node_def_temp_new(p,loc) + +/* Make a new internal node, which should not be appeared in the + * result AST and does not have node_id and location. */ +static NODE* node_new_internal(struct parser_params *p, enum node_type type, size_t size, size_t alignment); +#define NODE_NEW_INTERNAL(ndtype, type) (type *)node_new_internal(p, (enum node_type)(ndtype), sizeof(type), RUBY_ALIGNOF(type)) + +static NODE *nd_set_loc(NODE *nd, const YYLTYPE *loc); + +static int +parser_get_node_id(struct parser_params *p) +{ + int node_id = p->node_id; + p->node_id++; + return node_id; +} + +static void +anddot_multiple_assignment_check(struct parser_params* p, const YYLTYPE *loc, ID id) +{ + if (id == tANDDOT) { + yyerror1(loc, "&. inside multiple assignment destination"); + } +} + +static inline void +set_line_body(NODE *body, int line) +{ + if (!body) return; + switch (nd_type(body)) { + case NODE_RESCUE: + case NODE_ENSURE: + nd_set_line(body, line); + } +} + +static void +set_embraced_location(NODE *node, const rb_code_location_t *beg, const rb_code_location_t *end) +{ + RNODE_ITER(node)->nd_body->nd_loc = code_loc_gen(beg, end); + nd_set_line(node, beg->end_pos.lineno); +} + +static NODE * +last_expr_node(NODE *expr) +{ + while (expr) { + if (nd_type_p(expr, NODE_BLOCK)) { + expr = RNODE_BLOCK(RNODE_BLOCK(expr)->nd_end)->nd_head; + } + else if (nd_type_p(expr, NODE_BEGIN) && RNODE_BEGIN(expr)->nd_body) { + expr = RNODE_BEGIN(expr)->nd_body; + } + else { + break; + } + } + return expr; +} + +#ifndef RIPPER +#define yyparse ruby_yyparse +#endif + +static NODE* cond(struct parser_params *p, NODE *node, const YYLTYPE *loc); +static NODE* method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc); +static NODE *new_nil_at(struct parser_params *p, const rb_code_position_t *pos); +static NODE *new_if(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*); +static NODE *new_unless(struct parser_params*,NODE*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*); +static NODE *logop(struct parser_params*,ID,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*); + +static NODE *newline_node(NODE*); +static void fixpos(NODE*,NODE*); + +static int value_expr(struct parser_params*,NODE*); +static void void_expr(struct parser_params*,NODE*); +static NODE *remove_begin(NODE*); +static NODE *void_stmts(struct parser_params*,NODE*); +static void reduce_nodes(struct parser_params*,NODE**); +static void block_dup_check(struct parser_params*,NODE*,NODE*); + +static NODE *block_append(struct parser_params*,NODE*,NODE*); +static NODE *list_append(struct parser_params*,NODE*,NODE*); +static NODE *list_concat(NODE*,NODE*); +static NODE *arg_append(struct parser_params*,NODE*,NODE*,const YYLTYPE*); +static NODE *last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc); +static NODE *rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc); +static NODE *literal_concat(struct parser_params*,NODE*,NODE*,const YYLTYPE*); +static NODE *new_evstr(struct parser_params*,NODE*,const YYLTYPE*,const YYLTYPE*,const YYLTYPE*); +static NODE *new_dstr(struct parser_params*,NODE*,const YYLTYPE*); +static NODE *str2dstr(struct parser_params*,NODE*); +static NODE *evstr2dstr(struct parser_params*,NODE*); +static NODE *splat_array(NODE*); +static void mark_lvar_used(struct parser_params *p, NODE *rhs); + +static NODE *call_bin_op(struct parser_params*,NODE*,ID,NODE*,const YYLTYPE*,const YYLTYPE*); +static NODE *call_uni_op(struct parser_params*,NODE*,ID,const YYLTYPE*,const YYLTYPE*); +static NODE *new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc); +static NODE *new_command_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, NODE *block, const YYLTYPE *op_loc, const YYLTYPE *loc); +static 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;} + +static bool args_info_empty_p(struct rb_args_info *args); +static 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*); +static rb_node_args_t *new_args_tail(struct parser_params*,rb_node_kw_arg_t*,ID,ID,const YYLTYPE*); +static NODE *new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc); +static NODE *new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc); +static NODE *new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc); +static NODE *new_find_pattern_tail(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc); +static NODE *new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc); +static NODE *new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc); + +static rb_node_kw_arg_t *new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc); +static rb_node_args_t *args_with_numbered(struct parser_params*,rb_node_args_t*,int,ID); + +static NODE* negate_lit(struct parser_params*, NODE*); +static void no_blockarg(struct parser_params*,NODE*); +static NODE *ret_args(struct parser_params*,NODE*); +static NODE *arg_blk_pass(NODE*,rb_node_block_pass_t*); +static NODE *dsym_node(struct parser_params*,NODE*,const YYLTYPE*); + +static NODE *gettable(struct parser_params*,ID,const YYLTYPE*); +static NODE *assignable(struct parser_params*,ID,NODE*,const YYLTYPE*); + +static NODE *aryset(struct parser_params*,NODE*,NODE*,const YYLTYPE*); +static NODE *attrset(struct parser_params*,NODE*,ID,ID,const YYLTYPE*); + +static VALUE rb_backref_error(struct parser_params*,NODE*); +static NODE *node_assign(struct parser_params*,NODE*,NODE*,struct lex_context,const YYLTYPE*); + +static NODE *new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc); +static NODE *new_ary_op_assign(struct parser_params *p, NODE *ary, NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc, const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc); +static 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); +static NODE *new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context, const YYLTYPE *loc); +static NODE *new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc); + +static NODE *const_decl(struct parser_params *p, NODE* path, const YYLTYPE *loc); + +static rb_node_opt_arg_t *opt_arg_append(rb_node_opt_arg_t*, rb_node_opt_arg_t*); +static rb_node_kw_arg_t *kwd_append(rb_node_kw_arg_t*, rb_node_kw_arg_t*); + +static NODE *new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc); +static NODE *new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc); + +static NODE *new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc, const YYLTYPE *keyword_loc); + +static NODE *new_regexp(struct parser_params *, NODE *, int, const YYLTYPE *, const YYLTYPE *, const YYLTYPE *, const YYLTYPE *); + +#define make_list(list, loc) ((list) ? (nd_set_loc(list, loc), list) : NEW_ZLIST(loc)) + +static NODE *new_xstring(struct parser_params *, NODE *, const YYLTYPE *loc); + +static NODE *symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol); + +static NODE *match_op(struct parser_params*,NODE*,NODE*,const YYLTYPE*,const YYLTYPE*); + +static rb_ast_id_table_t *local_tbl(struct parser_params*); + +static VALUE reg_compile(struct parser_params*, rb_parser_string_t*, int); +static void reg_fragment_setenc(struct parser_params*, rb_parser_string_t*, int); + +static int literal_concat0(struct parser_params *p, rb_parser_string_t *head, rb_parser_string_t *tail); +static NODE *heredoc_dedent(struct parser_params*,NODE*); + +static void check_literal_when(struct parser_params *p, NODE *args, const YYLTYPE *loc); + +static 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); + +#ifdef RIPPER +#define get_value(idx) (rb_ary_entry(p->s_value_stack, idx)) +#define set_value(val) (p->s_lvalue = val) +static VALUE assign_error(struct parser_params *p, const char *mesg, VALUE a); +static int id_is_var(struct parser_params *p, ID id); +#endif + +RUBY_SYMBOL_EXPORT_BEGIN +VALUE rb_parser_reg_compile(struct parser_params* p, VALUE str, int options); +int rb_reg_fragment_setenc(struct parser_params*, rb_parser_string_t *, int); +enum lex_state_e rb_parser_trace_lex_state(struct parser_params *, enum lex_state_e, enum lex_state_e, int); +VALUE rb_parser_lex_state_name(struct parser_params *p, enum lex_state_e state); +void rb_parser_show_bitstack(struct parser_params *, stack_type, const char *, int); +PRINTF_ARGS(void rb_parser_fatal(struct parser_params *p, const char *fmt, ...), 2, 3); +YYLTYPE *rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc); +YYLTYPE *rb_parser_set_location_of_delayed_token(struct parser_params *p, YYLTYPE *yylloc); +YYLTYPE *rb_parser_set_location_of_heredoc_end(struct parser_params *p, YYLTYPE *yylloc); +YYLTYPE *rb_parser_set_location_of_dummy_end(struct parser_params *p, YYLTYPE *yylloc); +YYLTYPE *rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc); +YYLTYPE *rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc); +void ruby_show_error_line(struct parser_params *p, VALUE errbuf, const YYLTYPE *yylloc, int lineno, rb_parser_string_t *str); +RUBY_SYMBOL_EXPORT_END + +static void flush_string_content(struct parser_params *p, rb_encoding *enc, size_t back); +static void error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc); +static void error_duplicate_pattern_key(struct parser_params *p, ID id, const YYLTYPE *loc); +static VALUE formal_argument_error(struct parser_params*, ID); +static ID shadowing_lvar(struct parser_params*,ID); +static void new_bv(struct parser_params*,ID); + +static void local_push(struct parser_params*,int); +static void local_pop(struct parser_params*); +static void local_var(struct parser_params*, ID); +static void arg_var(struct parser_params*, ID); +static int local_id(struct parser_params *p, ID id); +static int local_id_ref(struct parser_params*, ID, ID **); +#define internal_id rb_parser_internal_id +ID internal_id(struct parser_params*); +static NODE *new_args_forward_call(struct parser_params*, NODE*, const YYLTYPE*, const YYLTYPE*); +static int check_forwarding_args(struct parser_params*); +static void add_forwarding_args(struct parser_params *p); +static void forwarding_arg_check(struct parser_params *p, ID arg, ID all, const char *var); + +static const struct vtable *dyna_push(struct parser_params *); +static void dyna_pop(struct parser_params*, const struct vtable *); +static int dyna_in_block(struct parser_params*); +#define dyna_var(p, id) local_var(p, id) +static int dvar_defined(struct parser_params*, ID); +#define dvar_defined_ref rb_parser_dvar_defined_ref +int dvar_defined_ref(struct parser_params*, ID, ID**); +static int dvar_curr(struct parser_params*,ID); + +static int lvar_defined(struct parser_params*, ID); + +static NODE *numparam_push(struct parser_params *p); +static void numparam_pop(struct parser_params *p, NODE *prev_inner); + +#define METHOD_NOT '!' + +#define idFWD_REST '*' +#define idFWD_KWREST idPow /* Use simple "**", as tDSTAR is "**arg" */ +#define idFWD_BLOCK '&' +#define idFWD_ALL idDot3 +#define arg_FWD_BLOCK idFWD_BLOCK + +#define RE_ONIG_OPTION_IGNORECASE 1 +#define RE_ONIG_OPTION_EXTEND (RE_ONIG_OPTION_IGNORECASE<<1) +#define RE_ONIG_OPTION_MULTILINE (RE_ONIG_OPTION_EXTEND<<1) +#define RE_OPTION_ONCE (1<<16) +#define RE_OPTION_ENCODING_SHIFT 8 +#define RE_OPTION_ENCODING(e) (((e)&0xff)<<RE_OPTION_ENCODING_SHIFT) +#define RE_OPTION_ENCODING_IDX(o) (((o)>>RE_OPTION_ENCODING_SHIFT)&0xff) +#define RE_OPTION_ENCODING_NONE(o) ((o)&RE_OPTION_ARG_ENCODING_NONE) +#define RE_OPTION_MASK 0xff +#define RE_OPTION_ARG_ENCODING_NONE 32 + +#define CHECK_LITERAL_WHEN (st_table *)1 +#define CASE_LABELS_ENABLED_P(case_labels) (case_labels && case_labels != CHECK_LITERAL_WHEN) + +#define yytnamerr(yyres, yystr) (YYSIZE_T)rb_yytnamerr(p, yyres, yystr) +RUBY_FUNC_EXPORTED size_t rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr); + +#define TOKEN2ID(tok) ( \ + tTOKEN_LOCAL_BEGIN<(tok)&&(tok)<tTOKEN_LOCAL_END ? TOKEN2LOCALID(tok) : \ + tTOKEN_INSTANCE_BEGIN<(tok)&&(tok)<tTOKEN_INSTANCE_END ? TOKEN2INSTANCEID(tok) : \ + tTOKEN_GLOBAL_BEGIN<(tok)&&(tok)<tTOKEN_GLOBAL_END ? TOKEN2GLOBALID(tok) : \ + tTOKEN_CONST_BEGIN<(tok)&&(tok)<tTOKEN_CONST_END ? TOKEN2CONSTID(tok) : \ + tTOKEN_CLASS_BEGIN<(tok)&&(tok)<tTOKEN_CLASS_END ? TOKEN2CLASSID(tok) : \ + tTOKEN_ATTRSET_BEGIN<(tok)&&(tok)<tTOKEN_ATTRSET_END ? TOKEN2ATTRSETID(tok) : \ + ((tok) / ((tok)<tPRESERVED_ID_END && ((tok)>=128 || rb_ispunct(tok))))) + +/****** Ripper *******/ + +#ifdef RIPPER + +#include "eventids1.h" +#include "eventids2.h" + +extern const struct ripper_parser_ids ripper_parser_ids; + +static VALUE ripper_dispatch0(struct parser_params*,ID); +static VALUE ripper_dispatch1(struct parser_params*,ID,VALUE); +static VALUE ripper_dispatch2(struct parser_params*,ID,VALUE,VALUE); +static VALUE ripper_dispatch3(struct parser_params*,ID,VALUE,VALUE,VALUE); +static VALUE ripper_dispatch4(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE); +static VALUE ripper_dispatch5(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE); +static VALUE ripper_dispatch7(struct parser_params*,ID,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE,VALUE); +void ripper_error(struct parser_params *p); + +#define dispatch0(n) ripper_dispatch0(p, RIPPER_ID(n)) +#define dispatch1(n,a) ripper_dispatch1(p, RIPPER_ID(n), (a)) +#define dispatch2(n,a,b) ripper_dispatch2(p, RIPPER_ID(n), (a), (b)) +#define dispatch3(n,a,b,c) ripper_dispatch3(p, RIPPER_ID(n), (a), (b), (c)) +#define dispatch4(n,a,b,c,d) ripper_dispatch4(p, RIPPER_ID(n), (a), (b), (c), (d)) +#define dispatch5(n,a,b,c,d,e) ripper_dispatch5(p, RIPPER_ID(n), (a), (b), (c), (d), (e)) +#define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(p, RIPPER_ID(n), (a), (b), (c), (d), (e), (f), (g)) + +#define yyparse ripper_yyparse + +static VALUE +aryptn_pre_args(struct parser_params *p, VALUE pre_arg, VALUE pre_args) +{ + if (!NIL_P(pre_arg)) { + if (!NIL_P(pre_args)) { + rb_ary_unshift(pre_args, pre_arg); + } + else { + pre_args = rb_ary_new_from_args(1, pre_arg); + } + } + return pre_args; +} + +#define ID2VAL(id) STATIC_ID2SYM(id) +#define TOKEN2VAL(t) ID2VAL(TOKEN2ID(t)) +#endif /* RIPPER */ + +#define KWD2EID(t, v) keyword_##t + +static NODE * +new_scope_body(struct parser_params *p, rb_node_args_t *args, NODE *body, NODE *parent, const YYLTYPE *loc) +{ + body = remove_begin(body); + reduce_nodes(p, &body); + NODE *n = NEW_SCOPE(args, body, parent, loc); + nd_set_line(n, loc->end_pos.lineno); + set_line_body(body, loc->beg_pos.lineno); + return n; +} + +static NODE * +rescued_expr(struct parser_params *p, NODE *arg, NODE *rescue, + const YYLTYPE *arg_loc, const YYLTYPE *mod_loc, const YYLTYPE *res_loc) +{ + YYLTYPE loc = code_loc_gen(mod_loc, res_loc); + rescue = NEW_RESBODY(0, 0, remove_begin(rescue), 0, &loc); + loc.beg_pos = arg_loc->beg_pos; + return NEW_RESCUE(arg, rescue, 0, &loc); +} + +static NODE *add_block_exit(struct parser_params *p, NODE *node); +static rb_node_exits_t *init_block_exit(struct parser_params *p); +static rb_node_exits_t *allow_block_exit(struct parser_params *p); +static void restore_block_exit(struct parser_params *p, rb_node_exits_t *exits); +static void clear_block_exit(struct parser_params *p, bool error); + +static void +next_rescue_context(struct lex_context *next, const struct lex_context *outer, enum rescue_context def) +{ + next->in_rescue = outer->in_rescue == after_rescue ? after_rescue : def; +} + +static void +restore_defun(struct parser_params *p, rb_node_def_temp_t *temp) +{ + /* See: def_name action */ + struct lex_context ctxt = temp->save.ctxt; + p->ctxt.in_def = ctxt.in_def; + p->ctxt.shareable_constant_value = ctxt.shareable_constant_value; + p->ctxt.in_rescue = ctxt.in_rescue; + p->max_numparam = temp->save.max_numparam; + numparam_pop(p, temp->save.numparam_save); + clear_block_exit(p, true); +} + +static void +endless_method_name(struct parser_params *p, ID mid, const YYLTYPE *loc) +{ + if (is_attrset_id(mid)) { + yyerror1(loc, "setter method cannot be defined in an endless method definition"); + } + token_info_drop(p, "def", loc->beg_pos); +} + +#define debug_token_line(p, name, line) do { \ + if (p->debug) { \ + const char *const pcur = p->lex.pcur; \ + const char *const ptok = p->lex.ptok; \ + rb_parser_printf(p, name ":%d (%d: %"PRIdPTRDIFF"|%"PRIdPTRDIFF"|%"PRIdPTRDIFF")\n", \ + line, p->ruby_sourceline, \ + ptok - p->lex.pbeg, pcur - ptok, p->lex.pend - pcur); \ + } \ + } while (0) + +#define begin_definition(k, loc_beg, loc_end) \ + do { \ + if (!(p->ctxt.in_class = (k)[0] != 0)) { \ + /* singleton class */ \ + p->ctxt.cant_return = !p->ctxt.in_def; \ + p->ctxt.in_def = 0; \ + } \ + else if (p->ctxt.in_def) { \ + YYLTYPE loc = code_loc_gen(loc_beg, loc_end); \ + yyerror1(&loc, k " definition in method body"); \ + } \ + else { \ + p->ctxt.cant_return = 1; \ + } \ + local_push(p, 0); \ + } while (0) + +#ifndef RIPPER +# define ifndef_ripper(x) (x) +# define ifdef_ripper(r,x) (x) +#else +# define ifndef_ripper(x) +# define ifdef_ripper(r,x) (r) #endif + +# define rb_warn0(fmt) WARN_CALL(WARN_ARGS(fmt, 1)) +# define rb_warn1(fmt,a) WARN_CALL(WARN_ARGS(fmt, 2), (a)) +# define rb_warn2(fmt,a,b) WARN_CALL(WARN_ARGS(fmt, 3), (a), (b)) +# define rb_warn3(fmt,a,b,c) WARN_CALL(WARN_ARGS(fmt, 4), (a), (b), (c)) +# define rb_warn4(fmt,a,b,c,d) WARN_CALL(WARN_ARGS(fmt, 5), (a), (b), (c), (d)) +# define rb_warning0(fmt) WARNING_CALL(WARNING_ARGS(fmt, 1)) +# define rb_warning1(fmt,a) WARNING_CALL(WARNING_ARGS(fmt, 2), (a)) +# define rb_warning2(fmt,a,b) WARNING_CALL(WARNING_ARGS(fmt, 3), (a), (b)) +# define rb_warning3(fmt,a,b,c) WARNING_CALL(WARNING_ARGS(fmt, 4), (a), (b), (c)) +# define rb_warning4(fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS(fmt, 5), (a), (b), (c), (d)) +# define rb_warn0L(l,fmt) WARN_CALL(WARN_ARGS_L(l, fmt, 1)) +# define rb_warn1L(l,fmt,a) WARN_CALL(WARN_ARGS_L(l, fmt, 2), (a)) +# define rb_warn2L(l,fmt,a,b) WARN_CALL(WARN_ARGS_L(l, fmt, 3), (a), (b)) +# define rb_warn3L(l,fmt,a,b,c) WARN_CALL(WARN_ARGS_L(l, fmt, 4), (a), (b), (c)) +# define rb_warn4L(l,fmt,a,b,c,d) WARN_CALL(WARN_ARGS_L(l, fmt, 5), (a), (b), (c), (d)) +# define rb_warning0L(l,fmt) WARNING_CALL(WARNING_ARGS_L(l, fmt, 1)) +# define rb_warning1L(l,fmt,a) WARNING_CALL(WARNING_ARGS_L(l, fmt, 2), (a)) +# define rb_warning2L(l,fmt,a,b) WARNING_CALL(WARNING_ARGS_L(l, fmt, 3), (a), (b)) +# define rb_warning3L(l,fmt,a,b,c) WARNING_CALL(WARNING_ARGS_L(l, fmt, 4), (a), (b), (c)) +# define rb_warning4L(l,fmt,a,b,c,d) WARNING_CALL(WARNING_ARGS_L(l, fmt, 5), (a), (b), (c), (d)) +#ifdef RIPPER +extern const ID id_warn, id_warning, id_gets, id_assoc; +# define ERR_MESG() STR_NEW2(mesg) /* to bypass Ripper DSL */ +# define WARN_S_L(s,l) STR_NEW(s,l) +# define WARN_S(s) STR_NEW2(s) +# define WARN_I(i) INT2NUM(i) +# define WARN_ID(i) rb_id2str(i) +# define PRIsWARN PRIsVALUE +# define WARN_ARGS(fmt,n) p->value, id_warn, n, rb_usascii_str_new_lit(fmt) +# define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n) +# ifdef HAVE_VA_ARGS_MACRO +# define WARN_CALL(...) rb_funcall(__VA_ARGS__) +# else +# define WARN_CALL rb_funcall +# endif +# define WARNING_ARGS(fmt,n) p->value, id_warning, n, rb_usascii_str_new_lit(fmt) +# define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n) +# ifdef HAVE_VA_ARGS_MACRO +# define WARNING_CALL(...) rb_funcall(__VA_ARGS__) +# else +# define WARNING_CALL rb_funcall +# endif +# define compile_error ripper_compile_error +#else +# define WARN_S_L(s,l) s +# define WARN_S(s) s +# define WARN_I(i) i +# define WARN_ID(i) rb_id2name(i) +# define PRIsWARN PRIsVALUE +# define WARN_ARGS(fmt,n) WARN_ARGS_L(p->ruby_sourceline,fmt,n) +# define WARN_ARGS_L(l,fmt,n) p->ruby_sourcefile, (l), (fmt) +# define WARN_CALL rb_compile_warn +# define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n) +# define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n) +# define WARNING_CALL rb_compile_warning +PRINTF_ARGS(static void parser_compile_error(struct parser_params*, const rb_code_location_t *loc, const char *fmt, ...), 3, 4); +# define compile_error(p, ...) parser_compile_error(p, NULL, __VA_ARGS__) #endif +#define RNODE_EXITS(node) ((rb_node_exits_t*)(node)) + +static NODE * +add_block_exit(struct parser_params *p, NODE *node) +{ + if (!node) { + compile_error(p, "unexpected null node"); + return 0; + } + switch (nd_type(node)) { + case NODE_BREAK: case NODE_NEXT: case NODE_REDO: break; + default: + compile_error(p, "add_block_exit: unexpected node: %s", parser_node_name(nd_type(node))); + return node; + } + if (!p->ctxt.in_defined) { + rb_node_exits_t *exits = p->exits; + if (exits) { + RNODE_EXITS(exits->nd_stts)->nd_chain = node; + exits->nd_stts = node; + } + } + return node; +} + +static rb_node_exits_t * +init_block_exit(struct parser_params *p) +{ + rb_node_exits_t *old = p->exits; + rb_node_exits_t *exits = NODE_NEW_INTERNAL(NODE_EXITS, rb_node_exits_t); + exits->nd_chain = 0; + exits->nd_stts = RNODE(exits); + p->exits = exits; + return old; +} + +static rb_node_exits_t * +allow_block_exit(struct parser_params *p) +{ + rb_node_exits_t *exits = p->exits; + p->exits = 0; + return exits; +} + +static void +restore_block_exit(struct parser_params *p, rb_node_exits_t *exits) +{ + p->exits = exits; +} + +static void +clear_block_exit(struct parser_params *p, bool error) +{ + rb_node_exits_t *exits = p->exits; + if (!exits) return; + if (error) { + for (NODE *e = RNODE(exits); (e = RNODE_EXITS(e)->nd_chain) != 0; ) { + switch (nd_type(e)) { + case NODE_BREAK: + yyerror1(&e->nd_loc, "Invalid break"); + break; + case NODE_NEXT: + yyerror1(&e->nd_loc, "Invalid next"); + break; + case NODE_REDO: + yyerror1(&e->nd_loc, "Invalid redo"); + break; + default: + yyerror1(&e->nd_loc, "unexpected node"); + goto end_checks; /* no nd_chain */ + } + } + end_checks:; + } + exits->nd_stts = RNODE(exits); + exits->nd_chain = 0; +} + +#define WARN_EOL(tok) \ + (looking_at_eol_p(p) ? \ + (void)rb_warning0("'" tok "' at the end of line without an expression") : \ + (void)0) +static int looking_at_eol_p(struct parser_params *p); + +static NODE * +get_nd_value(struct parser_params *p, NODE *node) +{ + switch (nd_type(node)) { + case NODE_GASGN: + return RNODE_GASGN(node)->nd_value; + case NODE_IASGN: + return RNODE_IASGN(node)->nd_value; + case NODE_LASGN: + return RNODE_LASGN(node)->nd_value; + case NODE_DASGN: + return RNODE_DASGN(node)->nd_value; + case NODE_MASGN: + return RNODE_MASGN(node)->nd_value; + case NODE_CVASGN: + return RNODE_CVASGN(node)->nd_value; + case NODE_CDECL: + return RNODE_CDECL(node)->nd_value; + default: + compile_error(p, "get_nd_value: unexpected node: %s", parser_node_name(nd_type(node))); + return 0; + } +} + +static void +set_nd_value(struct parser_params *p, NODE *node, NODE *rhs) +{ + switch (nd_type(node)) { + case NODE_CDECL: + RNODE_CDECL(node)->nd_value = rhs; + break; + case NODE_GASGN: + RNODE_GASGN(node)->nd_value = rhs; + break; + case NODE_IASGN: + RNODE_IASGN(node)->nd_value = rhs; + break; + case NODE_LASGN: + RNODE_LASGN(node)->nd_value = rhs; + break; + case NODE_DASGN: + RNODE_DASGN(node)->nd_value = rhs; + break; + case NODE_MASGN: + RNODE_MASGN(node)->nd_value = rhs; + break; + case NODE_CVASGN: + RNODE_CVASGN(node)->nd_value = rhs; + break; + default: + compile_error(p, "set_nd_value: unexpected node: %s", parser_node_name(nd_type(node))); + break; + } +} + +static ID +get_nd_vid(struct parser_params *p, NODE *node) +{ + switch (nd_type(node)) { + case NODE_CDECL: + return RNODE_CDECL(node)->nd_vid; + case NODE_GASGN: + return RNODE_GASGN(node)->nd_vid; + case NODE_IASGN: + return RNODE_IASGN(node)->nd_vid; + case NODE_LASGN: + return RNODE_LASGN(node)->nd_vid; + case NODE_DASGN: + return RNODE_DASGN(node)->nd_vid; + case NODE_CVASGN: + return RNODE_CVASGN(node)->nd_vid; + default: + compile_error(p, "get_nd_vid: unexpected node: %s", parser_node_name(nd_type(node))); + return 0; + } +} + +static NODE * +get_nd_args(struct parser_params *p, NODE *node) +{ + switch (nd_type(node)) { + case NODE_CALL: + return RNODE_CALL(node)->nd_args; + case NODE_OPCALL: + return RNODE_OPCALL(node)->nd_args; + case NODE_FCALL: + return RNODE_FCALL(node)->nd_args; + case NODE_QCALL: + return RNODE_QCALL(node)->nd_args; + case NODE_SUPER: + return RNODE_SUPER(node)->nd_args; + case NODE_VCALL: + case NODE_ZSUPER: + case NODE_YIELD: + case NODE_RETURN: + case NODE_BREAK: + case NODE_NEXT: + return 0; + default: + compile_error(p, "get_nd_args: unexpected node: %s", parser_node_name(nd_type(node))); + return 0; + } +} + +static st_index_t +djb2(const uint8_t *str, size_t len) +{ + st_index_t hash = 5381; + + for (size_t i = 0; i < len; i++) { + hash = ((hash << 5) + hash) + str[i]; + } + + return hash; +} + +static st_index_t +parser_memhash(const void *ptr, long len) +{ + return djb2(ptr, len); +} + +#define PARSER_STRING_PTR(str) (str->ptr) +#define PARSER_STRING_LEN(str) (str->len) +#define PARSER_STRING_END(str) (&str->ptr[str->len]) +#define STRING_SIZE(str) ((size_t)str->len + 1) +#define STRING_TERM_LEN(str) (1) +#define STRING_TERM_FILL(str) (str->ptr[str->len] = '\0') +#define PARSER_STRING_RESIZE_CAPA_TERM(p,str,capacity,termlen) do {\ + SIZED_REALLOC_N(str->ptr, char, (size_t)total + termlen, STRING_SIZE(str)); \ + str->len = total; \ +} while (0) +#define STRING_SET_LEN(str, n) do { \ + (str)->len = (n); \ +} while (0) +#define PARSER_STRING_GETMEM(str, ptrvar, lenvar) \ + ((ptrvar) = str->ptr, \ + (lenvar) = str->len) + +static inline int +parser_string_char_at_end(struct parser_params *p, rb_parser_string_t *str, int when_empty) +{ + return PARSER_STRING_LEN(str) > 0 ? (unsigned char)PARSER_STRING_END(str)[-1] : when_empty; +} + +static rb_parser_string_t * +rb_parser_string_new(rb_parser_t *p, const char *ptr, long len) +{ + rb_parser_string_t *str; + + if (len < 0) { + rb_bug("negative string size (or size too big): %ld", len); + } + + str = xcalloc(1, sizeof(rb_parser_string_t)); + str->ptr = xcalloc(len + 1, sizeof(char)); + + if (ptr) { + memcpy(PARSER_STRING_PTR(str), ptr, len); + } + STRING_SET_LEN(str, len); + STRING_TERM_FILL(str); + return str; +} + +static rb_parser_string_t * +rb_parser_encoding_string_new(rb_parser_t *p, const char *ptr, long len, rb_encoding *enc) +{ + rb_parser_string_t *str = rb_parser_string_new(p, ptr, len); + str->coderange = RB_PARSER_ENC_CODERANGE_UNKNOWN; + str->enc = enc; + return str; +} + +#ifndef RIPPER +rb_parser_string_t * +rb_str_to_parser_string(rb_parser_t *p, VALUE str) +{ + /* Type check */ + rb_parser_string_t *ret = rb_parser_encoding_string_new(p, RSTRING_PTR(str), RSTRING_LEN(str), rb_enc_get(str)); + RB_GC_GUARD(str); + return ret; +} + +void +rb_parser_string_free(rb_parser_t *p, rb_parser_string_t *str) +{ + if (!str) return; + xfree(PARSER_STRING_PTR(str)); + xfree(str); +} +#endif + +static st_index_t +rb_parser_str_hash(rb_parser_string_t *str) +{ + return parser_memhash((const void *)PARSER_STRING_PTR(str), PARSER_STRING_LEN(str)); +} + +static st_index_t +rb_char_p_hash(const char *c) +{ + return parser_memhash((const void *)c, strlen(c)); +} + +static size_t +rb_parser_str_capacity(rb_parser_string_t *str, const int termlen) +{ + return PARSER_STRING_LEN(str); +} + +#ifndef RIPPER +static char * +rb_parser_string_end(rb_parser_string_t *str) +{ + return &str->ptr[str->len]; +} +#endif + +static void +rb_parser_string_set_encoding(rb_parser_string_t *str, rb_encoding *enc) +{ + str->enc = enc; +} + +static rb_encoding * +rb_parser_str_get_encoding(rb_parser_string_t *str) +{ + return str->enc; +} + +#ifndef RIPPER +static bool +PARSER_ENCODING_IS_ASCII8BIT(struct parser_params *p, rb_parser_string_t *str) +{ + return rb_parser_str_get_encoding(str) == rb_ascii8bit_encoding(); +} +#endif + +static int +PARSER_ENC_CODERANGE(rb_parser_string_t *str) +{ + return str->coderange; +} + +static void +PARSER_ENC_CODERANGE_SET(rb_parser_string_t *str, int coderange) +{ + str->coderange = coderange; +} + +static void +PARSER_ENCODING_CODERANGE_SET(rb_parser_string_t *str, rb_encoding *enc, enum rb_parser_string_coderange_type cr) +{ + rb_parser_string_set_encoding(str, enc); + PARSER_ENC_CODERANGE_SET(str, cr); +} + +static void +PARSER_ENC_CODERANGE_CLEAR(rb_parser_string_t *str) +{ + str->coderange = RB_PARSER_ENC_CODERANGE_UNKNOWN; +} + +static bool +PARSER_ENC_CODERANGE_ASCIIONLY(rb_parser_string_t *str) +{ + return PARSER_ENC_CODERANGE(str) == RB_PARSER_ENC_CODERANGE_7BIT; +} + +static bool +PARSER_ENC_CODERANGE_CLEAN_P(int cr) +{ + return cr == RB_PARSER_ENC_CODERANGE_7BIT || cr == RB_PARSER_ENC_CODERANGE_VALID; +} + +static const char * +rb_parser_search_nonascii(const char *p, const char *e) +{ + const char *s = p; + + for (; s < e; s++) { + if (*s & 0x80) return s; + } + + return NULL; +} + +static int +rb_parser_coderange_scan(struct parser_params *p, const char *ptr, long len, rb_encoding *enc) +{ + const char *e = ptr + len; + + if (enc == rb_ascii8bit_encoding()) { + /* enc is ASCII-8BIT. ASCII-8BIT string never be broken. */ + ptr = rb_parser_search_nonascii(ptr, e); + return ptr ? RB_PARSER_ENC_CODERANGE_VALID : RB_PARSER_ENC_CODERANGE_7BIT; + } + + /* parser string encoding is always asciicompat */ + ptr = rb_parser_search_nonascii(ptr, e); + if (!ptr) return RB_PARSER_ENC_CODERANGE_7BIT; + for (;;) { + int ret = rb_enc_precise_mbclen(ptr, e, enc); + if (!MBCLEN_CHARFOUND_P(ret)) return RB_PARSER_ENC_CODERANGE_BROKEN; + ptr += MBCLEN_CHARFOUND_LEN(ret); + if (ptr == e) break; + ptr = rb_parser_search_nonascii(ptr, e); + if (!ptr) break; + } + + return RB_PARSER_ENC_CODERANGE_VALID; +} + +static int +rb_parser_enc_coderange_scan(struct parser_params *p, rb_parser_string_t *str, rb_encoding *enc) +{ + return rb_parser_coderange_scan(p, PARSER_STRING_PTR(str), PARSER_STRING_LEN(str), enc); +} + +static int +rb_parser_enc_str_coderange(struct parser_params *p, rb_parser_string_t *str) +{ + int cr = PARSER_ENC_CODERANGE(str); + + if (cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + cr = rb_parser_enc_coderange_scan(p, str, rb_parser_str_get_encoding(str)); + PARSER_ENC_CODERANGE_SET(str, cr); + } + + return cr; +} + +static rb_parser_string_t * +rb_parser_enc_associate(struct parser_params *p, rb_parser_string_t *str, rb_encoding *enc) +{ + if (rb_parser_str_get_encoding(str) == enc) + return str; + if (!PARSER_ENC_CODERANGE_ASCIIONLY(str)) { + PARSER_ENC_CODERANGE_CLEAR(str); + } + rb_parser_string_set_encoding(str, enc); + return str; +} + +static bool +rb_parser_is_ascii_string(struct parser_params *p, rb_parser_string_t *str) +{ + return rb_parser_enc_str_coderange(p, str) == RB_PARSER_ENC_CODERANGE_7BIT; +} + +static rb_encoding * +rb_parser_enc_compatible(struct parser_params *p, rb_parser_string_t *str1, rb_parser_string_t *str2) +{ + rb_encoding *enc1 = rb_parser_str_get_encoding(str1); + rb_encoding *enc2 = rb_parser_str_get_encoding(str2); + + if (enc1 == NULL || enc2 == NULL) + return 0; + + if (enc1 == enc2) { + return enc1; + } + + if (PARSER_STRING_LEN(str2) == 0) + return enc1; + if (PARSER_STRING_LEN(str1) == 0) + return rb_parser_is_ascii_string(p, str2) ? enc1 : enc2; + + int cr1, cr2; + + cr1 = rb_parser_enc_str_coderange(p, str1); + cr2 = rb_parser_enc_str_coderange(p, str2); + + if (cr1 != cr2) { + if (cr1 == RB_PARSER_ENC_CODERANGE_7BIT) return enc2; + if (cr2 == RB_PARSER_ENC_CODERANGE_7BIT) return enc1; + } + + if (cr2 == RB_PARSER_ENC_CODERANGE_7BIT) { + return enc1; + } + + if (cr1 == RB_PARSER_ENC_CODERANGE_7BIT) { + return enc2; + } + + return 0; +} + +static void +rb_parser_str_modify(rb_parser_string_t *str) +{ + PARSER_ENC_CODERANGE_CLEAR(str); +} + +static void +rb_parser_str_set_len(struct parser_params *p, rb_parser_string_t *str, long len) +{ + long capa; + const int termlen = STRING_TERM_LEN(str); + + if (len > (capa = (long)(rb_parser_str_capacity(str, termlen))) || len < 0) { + rb_bug("probable buffer overflow: %ld for %ld", len, capa); + } + + int cr = PARSER_ENC_CODERANGE(str); + if (cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + /* Leave unknown. */ + } + else if (len > PARSER_STRING_LEN(str)) { + PARSER_ENC_CODERANGE_SET(str, RB_PARSER_ENC_CODERANGE_UNKNOWN); + } + else if (len < PARSER_STRING_LEN(str)) { + if (cr != RB_PARSER_ENC_CODERANGE_7BIT) { + /* ASCII-only string is keeping after truncated. Valid + * and broken may be invalid or valid, leave unknown. */ + PARSER_ENC_CODERANGE_SET(str, RB_PARSER_ENC_CODERANGE_UNKNOWN); + } + } + + STRING_SET_LEN(str, len); + STRING_TERM_FILL(str); +} + +static rb_parser_string_t * +rb_parser_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len) +{ + rb_parser_str_modify(str); + if (len == 0) return 0; + + long total, olen, off = -1; + char *sptr; + const int termlen = STRING_TERM_LEN(str); + + PARSER_STRING_GETMEM(str, sptr, olen); + if (ptr >= sptr && ptr <= sptr + olen) { + off = ptr - sptr; + } + + if (olen > LONG_MAX - len) { + compile_error(p, "string sizes too big"); + return 0; + } + total = olen + len; + PARSER_STRING_RESIZE_CAPA_TERM(p, str, total, termlen); + sptr = PARSER_STRING_PTR(str); + if (off != -1) { + ptr = sptr + off; + } + memcpy(sptr + olen, ptr, len); + STRING_SET_LEN(str, total); + STRING_TERM_FILL(str); + + return str; +} + +#define parser_str_cat(str, ptr, len) rb_parser_str_buf_cat(p, str, ptr, len) +#define parser_str_cat_cstr(str, lit) rb_parser_str_buf_cat(p, str, lit, strlen(lit)) + +static rb_parser_string_t * +rb_parser_enc_cr_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len, + rb_encoding *ptr_enc, int ptr_cr, int *ptr_cr_ret) +{ + int str_cr, res_cr; + rb_encoding *str_enc, *res_enc; + + str_enc = rb_parser_str_get_encoding(str); + str_cr = PARSER_STRING_LEN(str) ? PARSER_ENC_CODERANGE(str) : RB_PARSER_ENC_CODERANGE_7BIT; + + if (str_enc == ptr_enc) { + if (str_cr != RB_PARSER_ENC_CODERANGE_UNKNOWN && ptr_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + ptr_cr = rb_parser_coderange_scan(p, ptr, len, ptr_enc); + } + } + else { + /* parser string encoding is always asciicompat */ + if (ptr_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + ptr_cr = rb_parser_coderange_scan(p, ptr, len, ptr_enc); + } + if (str_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + if (str_enc == rb_ascii8bit_encoding() || ptr_cr != RB_PARSER_ENC_CODERANGE_7BIT) { + str_cr = rb_parser_enc_str_coderange(p, str); + } + } + } + if (ptr_cr_ret) + *ptr_cr_ret = ptr_cr; + + if (str_enc != ptr_enc && + str_cr != RB_PARSER_ENC_CODERANGE_7BIT && + ptr_cr != RB_PARSER_ENC_CODERANGE_7BIT) { + goto incompatible; + } + + if (str_cr == RB_PARSER_ENC_CODERANGE_UNKNOWN) { + res_enc = str_enc; + res_cr = RB_PARSER_ENC_CODERANGE_UNKNOWN; + } + else if (str_cr == RB_PARSER_ENC_CODERANGE_7BIT) { + if (ptr_cr == RB_PARSER_ENC_CODERANGE_7BIT) { + res_enc = str_enc; + res_cr = RB_PARSER_ENC_CODERANGE_7BIT; + } + else { + res_enc = ptr_enc; + res_cr = ptr_cr; + } + } + else if (str_cr == RB_PARSER_ENC_CODERANGE_VALID) { + res_enc = str_enc; + if (PARSER_ENC_CODERANGE_CLEAN_P(ptr_cr)) + res_cr = str_cr; + else + res_cr = ptr_cr; + } + else { /* str_cr == RB_PARSER_ENC_CODERANGE_BROKEN */ + res_enc = str_enc; + res_cr = str_cr; + if (0 < len) res_cr = RB_PARSER_ENC_CODERANGE_UNKNOWN; + } + + if (len < 0) { + compile_error(p, "negative string size (or size too big)"); + } + parser_str_cat(str, ptr, len); + PARSER_ENCODING_CODERANGE_SET(str, res_enc, res_cr); + return str; + + incompatible: + compile_error(p, "incompatible character encodings: %s and %s", + rb_enc_name(str_enc), rb_enc_name(ptr_enc)); + UNREACHABLE_RETURN(0); + +} + +static rb_parser_string_t * +rb_parser_enc_str_buf_cat(struct parser_params *p, rb_parser_string_t *str, const char *ptr, long len, + rb_encoding *ptr_enc) +{ + return rb_parser_enc_cr_str_buf_cat(p, str, ptr, len, ptr_enc, RB_PARSER_ENC_CODERANGE_UNKNOWN, NULL); +} + +static rb_parser_string_t * +rb_parser_str_buf_append(struct parser_params *p, rb_parser_string_t *str, rb_parser_string_t *str2) +{ + int str2_cr = rb_parser_enc_str_coderange(p, str2); + + rb_parser_enc_cr_str_buf_cat(p, str, PARSER_STRING_PTR(str2), PARSER_STRING_LEN(str2), + rb_parser_str_get_encoding(str2), str2_cr, &str2_cr); + + PARSER_ENC_CODERANGE_SET(str2, str2_cr); + + return str; +} + +static rb_parser_string_t * +rb_parser_str_resize(struct parser_params *p, rb_parser_string_t *str, long len) +{ + if (len < 0) { + rb_bug("negative string size (or size too big)"); + } + + long slen = PARSER_STRING_LEN(str); + + if (slen > len && PARSER_ENC_CODERANGE(str) != RB_PARSER_ENC_CODERANGE_7BIT) { + PARSER_ENC_CODERANGE_CLEAR(str); + } + + { + long capa; + const int termlen = STRING_TERM_LEN(str); + + if ((capa = slen) < len) { + SIZED_REALLOC_N(str->ptr, char, (size_t)len + termlen, STRING_SIZE(str)); + } + else if (len == slen) return str; + STRING_SET_LEN(str, len); + STRING_TERM_FILL(str); + } + return str; +} + +# define PARSER_ENC_STRING_GETMEM(str, ptrvar, lenvar, encvar) \ + ((ptrvar) = str->ptr, \ + (lenvar) = str->len, \ + (encvar) = str->enc) + +static int +rb_parser_string_hash_cmp(rb_parser_string_t *str1, rb_parser_string_t *str2) +{ + long len1, len2; + const char *ptr1, *ptr2; + rb_encoding *enc1, *enc2; + + PARSER_ENC_STRING_GETMEM(str1, ptr1, len1, enc1); + PARSER_ENC_STRING_GETMEM(str2, ptr2, len2, enc2); + + return (len1 != len2 || + enc1 != enc2 || + memcmp(ptr1, ptr2, len1) != 0); +} + +static void +rb_parser_ary_extend(rb_parser_t *p, rb_parser_ary_t *ary, long len) +{ + long i; + if (ary->capa < len) { + ary->capa = len; + ary->data = (rb_parser_ary_data *)xrealloc(ary->data, sizeof(rb_parser_ary_data) * len); + for (i = ary->len; i < len; i++) { + ary->data[i] = 0; + } + } +} + +/* + * Do not call this directly. + * Use rb_parser_ary_new_capa_for_XXX() instead. + */ +static rb_parser_ary_t * +parser_ary_new_capa(rb_parser_t *p, long len) +{ + if (len < 0) { + rb_bug("negative array size (or size too big): %ld", len); + } + rb_parser_ary_t *ary = xcalloc(1, sizeof(rb_parser_ary_t)); + ary->data_type = 0; + ary->len = 0; + ary->capa = len; + if (0 < len) { + ary->data = (rb_parser_ary_data *)xcalloc(len, sizeof(rb_parser_ary_data)); + } + else { + ary->data = NULL; + } + return ary; +} + +#ifndef RIPPER +static rb_parser_ary_t * +rb_parser_ary_new_capa_for_script_line(rb_parser_t *p, long len) +{ + rb_parser_ary_t *ary = parser_ary_new_capa(p, len); + ary->data_type = PARSER_ARY_DATA_SCRIPT_LINE; + return ary; +} + +static rb_parser_ary_t * +rb_parser_ary_new_capa_for_ast_token(rb_parser_t *p, long len) +{ + rb_parser_ary_t *ary = parser_ary_new_capa(p, len); + ary->data_type = PARSER_ARY_DATA_AST_TOKEN; + return ary; +} +#endif + +static rb_parser_ary_t * +rb_parser_ary_new_capa_for_node(rb_parser_t *p, long len) +{ + rb_parser_ary_t *ary = parser_ary_new_capa(p, len); + ary->data_type = PARSER_ARY_DATA_NODE; + return ary; +} + +/* + * Do not call this directly. + * Use rb_parser_ary_push_XXX() instead. + */ +static rb_parser_ary_t * +parser_ary_push(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_ary_data val) +{ + if (ary->len == ary->capa) { + rb_parser_ary_extend(p, ary, ary->len == 0 ? 1 : ary->len * 2); + } + ary->data[ary->len++] = val; + return ary; +} + +#ifndef RIPPER +static rb_parser_ary_t * +rb_parser_ary_push_ast_token(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_ast_token_t *val) +{ + if (ary->data_type != PARSER_ARY_DATA_AST_TOKEN) { + rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type); + } + return parser_ary_push(p, ary, val); +} + +static rb_parser_ary_t * +rb_parser_ary_push_script_line(rb_parser_t *p, rb_parser_ary_t *ary, rb_parser_string_t *val) +{ + if (ary->data_type != PARSER_ARY_DATA_SCRIPT_LINE) { + rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type); + } + return parser_ary_push(p, ary, val); +} +#endif + +static rb_parser_ary_t * +rb_parser_ary_push_node(rb_parser_t *p, rb_parser_ary_t *ary, NODE *val) +{ + if (ary->data_type != PARSER_ARY_DATA_NODE) { + rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type); + } + return parser_ary_push(p, ary, val); +} + +#ifndef RIPPER +static void +rb_parser_ast_token_free(rb_parser_t *p, rb_parser_ast_token_t *token) +{ + if (!token) return; + rb_parser_string_free(p, token->str); + xfree(token); +} + +static void +rb_parser_ary_free(rb_parser_t *p, rb_parser_ary_t *ary) +{ +# define foreach_ary(ptr) \ + for (rb_parser_ary_data *ptr = ary->data, *const end_ary_data = ptr + ary->len; \ + ptr < end_ary_data; ptr++) + switch (ary->data_type) { + case PARSER_ARY_DATA_AST_TOKEN: + foreach_ary(data) {rb_parser_ast_token_free(p, *data);} + break; + case PARSER_ARY_DATA_SCRIPT_LINE: + foreach_ary(data) {rb_parser_string_free(p, *data);} + break; + case PARSER_ARY_DATA_NODE: + /* Do nothing because nodes are freed when rb_ast_t is freed */ + break; + default: + rb_bug("unexpected rb_parser_ary_data_type: %d", ary->data_type); + break; + } +# undef foreach_ary + xfree(ary->data); + xfree(ary); +} + +#endif /* !RIPPER */ %} +%expect 0 +%define api.pure +%define parse.error verbose +%printer { + if ((NODE *)$$ == (NODE *)-1) { + rb_parser_printf(p, "NODE_SPECIAL"); + } + else if ($$) { + rb_parser_printf(p, "%s", parser_node_name(nd_type(RNODE($$)))); + } +} <node> <node_fcall> <node_args> <node_args_aux> <node_opt_arg> + <node_kw_arg> <node_block_pass> <node_masgn> <node_def_temp> <node_exits> +%printer { + rb_parser_printf(p, "%"PRIsVALUE, rb_id2str($$)); +} <id> +%printer { + switch (nd_type(RNODE($$))) { + case NODE_INTEGER: + rb_parser_printf(p, "%+"PRIsVALUE, rb_node_integer_literal_val($$)); + break; + case NODE_FLOAT: + rb_parser_printf(p, "%+"PRIsVALUE, rb_node_float_literal_val($$)); + break; + case NODE_RATIONAL: + rb_parser_printf(p, "%+"PRIsVALUE, rb_node_rational_literal_val($$)); + break; + case NODE_IMAGINARY: + rb_parser_printf(p, "%+"PRIsVALUE, rb_node_imaginary_literal_val($$)); + break; + default: + break; + } +} tINTEGER tFLOAT tRATIONAL tIMAGINARY tSTRING_CONTENT tCHAR +%printer { + rb_parser_printf(p, "$%ld", RNODE_NTH_REF($$)->nd_nth); +} tNTH_REF +%printer { + rb_parser_printf(p, "$%c", (int)RNODE_BACK_REF($$)->nd_nth); +} tBACK_REF + +%destructor { + if (CASE_LABELS_ENABLED_P($$)) st_free_table($$); +} <labels> + +%lex-param {struct parser_params *p} +%parse-param {struct parser_params *p} +%initial-action +{ + RUBY_SET_YYLLOC_OF_NONE(@$); +}; +%after-shift after_shift +%before-reduce before_reduce +%after-reduce after_reduce +%after-shift-error-token after_shift_error_token +%after-pop-stack after_pop_stack + %union { NODE *node; + rb_node_fcall_t *node_fcall; + rb_node_args_t *node_args; + rb_node_args_aux_t *node_args_aux; + rb_node_opt_arg_t *node_opt_arg; + rb_node_kw_arg_t *node_kw_arg; + rb_node_block_pass_t *node_block_pass; + rb_node_masgn_t *node_masgn; + rb_node_def_temp_t *node_def_temp; + rb_node_exits_t *node_exits; + struct rb_locations_lambda_body_t *locations_lambda_body; ID id; int num; - struct RVarmap *vars; -} - -%token kCLASS - kMODULE - kDEF - kUNDEF - kBEGIN - kRESCUE - kENSURE - kEND - kIF - kUNLESS - kTHEN - kELSIF - kELSE - kCASE - kWHEN - kWHILE - kUNTIL - kFOR - kBREAK - kNEXT - kREDO - kRETRY - kIN - kDO - kDO_COND - kDO_BLOCK - kRETURN - kYIELD - kSUPER - kSELF - kNIL - kTRUE - kFALSE - kAND - kOR - kNOT - kIF_MOD - kUNLESS_MOD - kWHILE_MOD - kUNTIL_MOD - kRESCUE_MOD - kALIAS - kDEFINED - klBEGIN - klEND - k__LINE__ - k__FILE__ - -%token <id> tIDENTIFIER tFID tGVAR tIVAR tCONSTANT tCVAR tLABEL -%token <node> tINTEGER tFLOAT tSTRING_CONTENT -%token <node> tNTH_REF tBACK_REF -%token <num> tREGEXP_END + st_table *tbl; + st_table *labels; + const struct vtable *vars; + struct rb_strterm_struct *strterm; + struct lex_context ctxt; + enum lex_state_e state; +} -%type <node> singleton strings string string1 xstring regexp -%type <node> string_contents xstring_contents string_content -%type <node> words qwords word_list qword_list word -%type <node> literal numeric dsym cpath -%type <node> bodystmt compstmt stmts stmt expr arg primary command command_call method_call -%type <node> expr_value arg_value primary_value -%type <node> if_tail opt_else case_body cases opt_rescue exc_list exc_var opt_ensure -%type <node> args when_args call_args call_args2 open_args paren_args opt_paren_args -%type <node> command_args aref_args opt_block_arg block_arg var_ref var_lhs -%type <node> mrhs superclass block_call block_command -%type <node> f_arglist f_args f_optarg f_opt f_block_arg opt_f_block_arg -%type <node> assoc_list assocs assoc undef_list backref string_dvar -%type <node> block_var opt_block_var brace_block cmd_brace_block do_block lhs none -%type <node> mlhs mlhs_head mlhs_basic mlhs_entry mlhs_item mlhs_node -%type <id> fitem variable sym symbol operation operation2 operation3 -%type <id> cname fname op f_rest_arg -%type <num> f_norm_arg f_arg -%token tUPLUS /* unary+ */ -%token tUMINUS /* unary- */ -%token tPOW /* ** */ -%token tCMP /* <=> */ -%token tEQ /* == */ -%token tEQQ /* === */ -%token tNEQ /* != */ -%token tGEQ /* >= */ -%token tLEQ /* <= */ -%token tANDOP tOROP /* && and || */ -%token tMATCH tNMATCH /* =~ and !~ */ -%token tDOT2 tDOT3 /* .. and ... */ -%token tAREF tASET /* [] and []= */ -%token tLSHFT tRSHFT /* << and >> */ -%token tCOLON2 /* :: */ -%token tCOLON3 /* :: at EXPR_BEG */ -%token <id> tOP_ASGN /* +=, -= etc. */ -%token tASSOC /* => */ -%token tLPAREN /* ( */ -%token tLPAREN_ARG /* ( */ -%token tRPAREN /* ) */ -%token tLBRACK /* [ */ -%token tLBRACE /* { */ -%token tLBRACE_ARG /* { */ -%token tSTAR /* * */ -%token tAMPER /* & */ -%token tSYMBEG tSTRING_BEG tXSTRING_BEG tREGEXP_BEG tWORDS_BEG tQWORDS_BEG -%token tSTRING_DBEG tSTRING_DVAR tSTRING_END +%token <id> + keyword_class "'class'" + keyword_module "'module'" + keyword_def "'def'" + keyword_undef "'undef'" + keyword_begin "'begin'" + keyword_rescue "'rescue'" + keyword_ensure "'ensure'" + keyword_end "'end'" + keyword_if "'if'" + keyword_unless "'unless'" + keyword_then "'then'" + keyword_elsif "'elsif'" + keyword_else "'else'" + keyword_case "'case'" + keyword_when "'when'" + keyword_while "'while'" + keyword_until "'until'" + keyword_for "'for'" + keyword_break "'break'" + keyword_next "'next'" + keyword_redo "'redo'" + keyword_retry "'retry'" + keyword_in "'in'" + keyword_do "'do'" + keyword_do_cond "'do' for condition" + keyword_do_block "'do' for block" + keyword_do_LAMBDA "'do' for lambda" + keyword_return "'return'" + keyword_yield "'yield'" + keyword_super "'super'" + keyword_self "'self'" + keyword_nil "'nil'" + keyword_true "'true'" + keyword_false "'false'" + keyword_and "'and'" + keyword_or "'or'" + keyword_not "'not'" + modifier_if "'if' modifier" + modifier_unless "'unless' modifier" + modifier_while "'while' modifier" + modifier_until "'until' modifier" + modifier_rescue "'rescue' modifier" + keyword_alias "'alias'" + keyword_defined "'defined?'" + keyword_BEGIN "'BEGIN'" + keyword_END "'END'" + keyword__LINE__ "'__LINE__'" + keyword__FILE__ "'__FILE__'" + keyword__ENCODING__ "'__ENCODING__'" + +%token <id> tIDENTIFIER "local variable or method" +%token <id> tFID "method" +%token <id> tGVAR "global variable" +%token <id> tIVAR "instance variable" +%token <id> tCONSTANT "constant" +%token <id> tCVAR "class variable" +%token <id> tLABEL "label" +%token <node> tINTEGER "integer literal" +%token <node> tFLOAT "float literal" +%token <node> tRATIONAL "rational literal" +%token <node> tIMAGINARY "imaginary literal" +%token <node> tCHAR "char literal" +%token <node> tNTH_REF "numbered reference" +%token <node> tBACK_REF "back reference" +%token <node> tSTRING_CONTENT "literal content" +%token <num> tREGEXP_END +%token <num> tDUMNY_END "dummy end" + +%type <node> singleton singleton_expr strings string string1 xstring regexp +%type <node> string_contents xstring_contents regexp_contents string_content +%type <node> words symbols symbol_list qwords qsymbols word_list qword_list qsym_list word +%type <node> literal numeric simple_numeric ssym dsym symbol cpath +%type <node_def_temp> defn_head defs_head k_def +%type <node_exits> block_open k_while k_until k_for allow_exits +%type <node> top_stmts top_stmt begin_block endless_arg endless_command +%type <node> bodystmt stmts stmt_or_begin stmt expr arg ternary primary +%type <node> command command_call command_call_value method_call +%type <node> expr_value expr_value_do arg_value primary_value rel_expr +%type <node_fcall> fcall +%type <node> if_tail opt_else case_body case_args cases opt_rescue exc_list exc_var opt_ensure +%type <node> args arg_splat call_args opt_call_args +%type <node> paren_args opt_paren_args +%type <node_args> args_tail block_args_tail +%type <node> command_args aref_args +%type <node_block_pass> opt_block_arg block_arg +%type <node> var_ref var_lhs +%type <node> command_rhs arg_rhs +%type <node> command_asgn mrhs mrhs_arg superclass block_call block_command +%type <node_args> f_arglist f_opt_paren_args f_paren_args f_args +%type <node_args_aux> f_arg f_arg_item +%type <node> f_marg f_rest_marg +%type <node_masgn> f_margs +%type <node> assoc_list assocs assoc undef_list backref string_dvar for_var +%type <node_args> block_param opt_block_param_def block_param_def opt_block_param +%type <id> do bv_decls opt_bv_decl bvar +%type <node> lambda brace_body do_body +%type <locations_lambda_body> lambda_body +%type <node_args> f_larglist +%type <node> brace_block cmd_brace_block do_block lhs none fitem +%type <node> mlhs_head mlhs_item mlhs_node +%type <node_masgn> mlhs mlhs_basic mlhs_inner +%type <node> p_case_body p_cases p_top_expr p_top_expr_body +%type <node> p_expr p_as p_alt p_expr_basic p_find +%type <node> p_args p_args_head p_args_tail p_args_post p_arg p_rest +%type <node> p_value p_primitive p_variable p_var_ref p_expr_ref p_const +%type <node> p_kwargs p_kwarg p_kw +%type <id> keyword_variable user_variable sym operation2 operation3 +%type <id> cname fname op f_rest_arg f_block_arg opt_f_block_arg f_norm_arg f_bad_arg +%type <id> f_kwrest f_label f_arg_asgn call_op call_op2 reswords relop dot_or_colon +%type <id> p_kwrest p_kwnorest p_any_kwrest p_kw_label +%type <id> f_no_kwarg f_any_kwrest args_forward excessed_comma nonlocal_var def_name +%type <ctxt> lex_ctxt begin_defined k_class k_module k_END k_rescue k_ensure after_rescue +%type <ctxt> p_in_kwarg +%type <tbl> p_lparen p_lbracket p_pktbl p_pvtbl +%type <num> max_numparam +%type <node> numparam +%type <id> it_id +%token END_OF_INPUT 0 "end-of-input" +%token <id> '.' + +/* escaped chars, should be ignored otherwise */ +%token <id> '\\' "backslash" +%token tSP "escaped space" +%token <id> '\t' "escaped horizontal tab" +%token <id> '\f' "escaped form feed" +%token <id> '\r' "escaped carriage return" +%token <id> '\13' "escaped vertical tab" +%token tUPLUS RUBY_TOKEN(UPLUS) "unary+" +%token tUMINUS RUBY_TOKEN(UMINUS) "unary-" +%token tPOW RUBY_TOKEN(POW) "**" +%token tCMP RUBY_TOKEN(CMP) "<=>" +%token tEQ RUBY_TOKEN(EQ) "==" +%token tEQQ RUBY_TOKEN(EQQ) "===" +%token tNEQ RUBY_TOKEN(NEQ) "!=" +%token tGEQ RUBY_TOKEN(GEQ) ">=" +%token tLEQ RUBY_TOKEN(LEQ) "<=" +%token tANDOP RUBY_TOKEN(ANDOP) "&&" +%token tOROP RUBY_TOKEN(OROP) "||" +%token tMATCH RUBY_TOKEN(MATCH) "=~" +%token tNMATCH RUBY_TOKEN(NMATCH) "!~" +%token tDOT2 RUBY_TOKEN(DOT2) ".." +%token tDOT3 RUBY_TOKEN(DOT3) "..." +%token tBDOT2 RUBY_TOKEN(BDOT2) "(.." +%token tBDOT3 RUBY_TOKEN(BDOT3) "(..." +%token tAREF RUBY_TOKEN(AREF) "[]" +%token tASET RUBY_TOKEN(ASET) "[]=" +%token tLSHFT RUBY_TOKEN(LSHFT) "<<" +%token tRSHFT RUBY_TOKEN(RSHFT) ">>" +%token <id> tANDDOT RUBY_TOKEN(ANDDOT) "&." +%token <id> tCOLON2 RUBY_TOKEN(COLON2) "::" +%token tCOLON3 ":: at EXPR_BEG" +%token <id> tOP_ASGN "operator-assignment" /* +=, -= etc. */ +%token tASSOC "=>" +%token tLPAREN "(" +%token tLPAREN_ARG "( arg" +%token tLBRACK "[" +%token tLBRACE "{" +%token tLBRACE_ARG "{ arg" +%token tSTAR "*" +%token tDSTAR "**arg" +%token tAMPER "&" +%token <num> tLAMBDA "->" +%token tSYMBEG "symbol literal" +%token tSTRING_BEG "string literal" +%token tXSTRING_BEG "backtick literal" +%token tREGEXP_BEG "regexp literal" +%token tWORDS_BEG "word list" +%token tQWORDS_BEG "verbatim word list" +%token tSYMBOLS_BEG "symbol list" +%token tQSYMBOLS_BEG "verbatim symbol list" +%token tSTRING_END "terminator" +%token tSTRING_DEND "'}'" +%token <state> tSTRING_DBEG "'#{'" +%token tSTRING_DVAR tLAMBEG tLABEL_END + +%token tIGNORED_NL tCOMMENT tEMBDOC_BEG tEMBDOC tEMBDOC_END +%token tHEREDOC_BEG tHEREDOC_END k__END__ /* * precedence table @@ -303,14 +2875,14 @@ static void top_local_setup(); %nonassoc tLOWEST %nonassoc tLBRACE_ARG -%nonassoc kIF_MOD kUNLESS_MOD kWHILE_MOD kUNTIL_MOD -%left kOR kAND -%right kNOT -%nonassoc kDEFINED +%nonassoc modifier_if modifier_unless modifier_while modifier_until keyword_in +%left keyword_or keyword_and +%right keyword_not +%nonassoc keyword_defined %right '=' tOP_ASGN -%left kRESCUE_MOD +%left modifier_rescue %right '?' ':' -%nonassoc tDOT2 tDOT3 +%nonassoc tDOT2 tDOT3 tBDOT2 tBDOT3 %left tOROP %left tANDOP %nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH @@ -326,4207 +2898,9628 @@ static void top_local_setup(); %token tLAST_TOKEN +/* + * inlining rules + */ +%rule %inline ident_or_const + : tIDENTIFIER + | tCONSTANT + ; + +%rule %inline user_or_keyword_variable + : user_variable + | keyword_variable + ; + +/* + * parameterizing rules + */ +%rule asgn(rhs) <node> + : lhs '=' lex_ctxt rhs + { + $$ = node_assign(p, (NODE *)$lhs, $rhs, $lex_ctxt, &@$); + /*% ripper: assign!($:1, $:4) %*/ + } + ; + +%rule args_tail_basic(value) <node_args> + : f_kwarg(value) ',' f_kwrest opt_f_block_arg + { + $$ = new_args_tail(p, $1, $3, $4, &@3); + /*% ripper: [$:1, $:3, $:4] %*/ + } + | f_kwarg(value) opt_f_block_arg + { + $$ = new_args_tail(p, $1, 0, $2, &@1); + /*% ripper: [$:1, Qnil, $:2] %*/ + } + | f_any_kwrest opt_f_block_arg + { + $$ = new_args_tail(p, 0, $1, $2, &@1); + /*% ripper: [Qnil, $:1, $:2] %*/ + } + | f_block_arg + { + $$ = new_args_tail(p, 0, 0, $1, &@1); + /*% ripper: [Qnil, Qnil, $:1] %*/ + } + ; + +%rule def_endless_method(bodystmt) <node> + : defn_head[head] f_opt_paren_args[args] '=' bodystmt + { + endless_method_name(p, $head->nd_mid, &@head); + restore_defun(p, $head); + ($$ = $head->nd_def)->nd_loc = @$; + $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$); + RNODE_DEFN($$)->nd_defn = $bodystmt; + /*% ripper: bodystmt!($:bodystmt, Qnil, Qnil, Qnil) %*/ + /*% ripper: def!($:head, $:args, $:$) %*/ + local_pop(p); + } + | defs_head[head] f_opt_paren_args[args] '=' bodystmt + { + endless_method_name(p, $head->nd_mid, &@head); + restore_defun(p, $head); + ($$ = $head->nd_def)->nd_loc = @$; + $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$); + RNODE_DEFS($$)->nd_defn = $bodystmt; + /*% ripper: bodystmt!($:bodystmt, Qnil, Qnil, Qnil) %*/ + /*% ripper: defs!(*$:head[0..2], $:args, $:$) %*/ + local_pop(p); + } + ; + +%rule compstmt(stmts) <node> + : stmts terms? + { + void_stmts(p, $$ = $stmts); + } + ; + +%rule f_opt(value) <node_opt_arg> + : f_arg_asgn f_eq value + { + p->ctxt.in_argdef = 1; + $$ = NEW_OPT_ARG(assignable(p, $f_arg_asgn, $value, &@$), &@$); + /*% ripper: [$:$, $:3] %*/ + } + ; + +%rule f_opt_arg(value) <node_opt_arg> + : f_opt(value) + { + $$ = $f_opt; + /*% ripper: rb_ary_new3(1, $:1) %*/ + } + | f_opt_arg(value) ',' f_opt(value) + { + $$ = opt_arg_append($f_opt_arg, $f_opt); + /*% ripper: rb_ary_push($:1, $:3) %*/ + } + ; + +%rule f_kw(value) <node_kw_arg> + : f_label value + { + p->ctxt.in_argdef = 1; + $$ = new_kw_arg(p, assignable(p, $f_label, $value, &@$), &@$); + /*% ripper: [$:$, $:value] %*/ + } + | f_label + { + p->ctxt.in_argdef = 1; + $$ = new_kw_arg(p, assignable(p, $f_label, NODE_SPECIAL_REQUIRED_KEYWORD, &@$), &@$); + /*% ripper: [$:$, 0] %*/ + } + ; + +%rule f_kwarg(value) <node_kw_arg> + : f_kw(value) + { + $$ = $f_kw; + /*% ripper: rb_ary_new3(1, $:1) %*/ + } + | f_kwarg(value) ',' f_kw(value) + { + $$ = kwd_append($f_kwarg, $f_kw); + /*% ripper: rb_ary_push($:1, $:3) %*/ + } + ; + +%rule mlhs_items(item) <node> + : item + { + $$ = NEW_LIST($1, &@$); + /*% ripper: mlhs_add!(mlhs_new!, $:1) %*/ + } + | mlhs_items(item) ',' item + { + $$ = list_append(p, $1, $3); + /*% ripper: mlhs_add!($:1, $:3) %*/ + } + ; + +%rule op_asgn(rhs) <node> + : var_lhs tOP_ASGN lex_ctxt rhs + { + $$ = new_op_assign(p, $var_lhs, $tOP_ASGN, $rhs, $lex_ctxt, &@$); + /*% ripper: opassign!($:1, $:2, $:4) %*/ + } + | primary_value '['[lbracket] opt_call_args rbracket tOP_ASGN lex_ctxt rhs + { + $$ = new_ary_op_assign(p, $primary_value, $opt_call_args, $tOP_ASGN, $rhs, &@opt_call_args, &@$, &NULL_LOC, &@lbracket, &@rbracket, &@tOP_ASGN); + /*% ripper: opassign!(aref_field!($:1, $:3), $:5, $:7) %*/ + } + | primary_value call_op tIDENTIFIER tOP_ASGN lex_ctxt rhs + { + $$ = new_attr_op_assign(p, $primary_value, $call_op, $tIDENTIFIER, $tOP_ASGN, $rhs, &@$, &@call_op, &@tIDENTIFIER, &@tOP_ASGN); + /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/ + } + | primary_value call_op tCONSTANT tOP_ASGN lex_ctxt rhs + { + $$ = new_attr_op_assign(p, $primary_value, $call_op, $tCONSTANT, $tOP_ASGN, $rhs, &@$, &@call_op, &@tCONSTANT, &@tOP_ASGN); + /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/ + } + | primary_value tCOLON2 tIDENTIFIER tOP_ASGN lex_ctxt rhs + { + $$ = new_attr_op_assign(p, $primary_value, idCOLON2, $tIDENTIFIER, $tOP_ASGN, $rhs, &@$, &@tCOLON2, &@tIDENTIFIER, &@tOP_ASGN); + /*% ripper: opassign!(field!($:1, $:2, $:3), $:4, $:6) %*/ + } + | primary_value tCOLON2 tCONSTANT tOP_ASGN lex_ctxt rhs + { + YYLTYPE loc = code_loc_gen(&@primary_value, &@tCONSTANT); + $$ = new_const_op_assign(p, NEW_COLON2($primary_value, $tCONSTANT, &loc, &@tCOLON2, &@tCONSTANT), $tOP_ASGN, $rhs, $lex_ctxt, &@$); + /*% ripper: opassign!(const_path_field!($:1, $:3), $:4, $:6) %*/ + } + | tCOLON3 tCONSTANT tOP_ASGN lex_ctxt rhs + { + YYLTYPE loc = code_loc_gen(&@tCOLON3, &@tCONSTANT); + $$ = new_const_op_assign(p, NEW_COLON3($tCONSTANT, &loc, &@tCOLON3, &@tCONSTANT), $tOP_ASGN, $rhs, $lex_ctxt, &@$); + /*% ripper: opassign!(top_const_field!($:2), $:3, $:5) %*/ + } + | backref tOP_ASGN lex_ctxt rhs + { + VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $backref); + $$ = NEW_ERROR(&@$); + /*% ripper[error]: assign_error!(?e, opassign!(var_field!($:1), $:2, $:4)) %*/ + } + ; + +%rule opt_args_tail(tail) <node_args> + : ',' tail + { + $$ = $tail; + /*% ripper: $:2 %*/ + } + | /* none */ + { + $$ = new_args_tail(p, 0, 0, 0, &@0); + /*% ripper: [Qnil, Qnil, Qnil] %*/ + } + ; + +%rule range_expr(range) <node> + : range tDOT2 range + { + value_expr(p, $1); + value_expr(p, $3); + $$ = NEW_DOT2($1, $3, &@$, &@2); + /*% ripper: dot2!($:1, $:3) %*/ + } + | range tDOT3 range + { + value_expr(p, $1); + value_expr(p, $3); + $$ = NEW_DOT3($1, $3, &@$, &@2); + /*% ripper: dot3!($:1, $:3) %*/ + } + | range tDOT2 + { + value_expr(p, $1); + $$ = NEW_DOT2($1, new_nil_at(p, &@2.end_pos), &@$, &@2); + /*% ripper: dot2!($:1, Qnil) %*/ + } + | range tDOT3 + { + value_expr(p, $1); + $$ = NEW_DOT3($1, new_nil_at(p, &@2.end_pos), &@$, &@2); + /*% ripper: dot3!($:1, Qnil) %*/ + } + | tBDOT2 range + { + value_expr(p, $2); + $$ = NEW_DOT2(new_nil_at(p, &@1.beg_pos), $2, &@$, &@1); + /*% ripper: dot2!(Qnil, $:2) %*/ + } + | tBDOT3 range + { + value_expr(p, $2); + $$ = NEW_DOT3(new_nil_at(p, &@1.beg_pos), $2, &@$, &@1); + /*% ripper: dot3!(Qnil, $:2) %*/ + } + ; + +%rule value_expr(value) <node> + : value + { + value_expr(p, $1); + $$ = $1; + } + ; + +%rule words(begin, word_list) <node> + : begin ' '+ word_list tSTRING_END + { + $$ = make_list($word_list, &@$); + /*% ripper: array!($:3) %*/ + } + ; + %% program : { - lex_state = EXPR_BEG; - top_local_init(); - if (ruby_class == rb_cObject) class_nest = 0; - else class_nest = 1; - } - compstmt - { - if ($2 && !compile_for_eval) { + SET_LEX_STATE(EXPR_BEG); + local_push(p, ifndef_ripper(1)+0); + /* jumps are possible in the top-level loop. */ + if (!ifndef_ripper(p->do_loop) + 0) init_block_exit(p); + } + compstmt(top_stmts) + { + if ($2 && !compile_for_eval) { + NODE *node = $2; /* last expression should not be void */ - if (nd_type($2) != NODE_BLOCK) void_expr($2); - else { - NODE *node = $2; - while (node->nd_next) { - node = node->nd_next; - } - void_expr(node->nd_head); - } - } - ruby_eval_tree = block_append(ruby_eval_tree, $2); - top_local_setup(); - class_nest = 0; - } - ; - -bodystmt : compstmt - opt_rescue - opt_else - opt_ensure - { - $$ = $1; - if ($2) { - $$ = NEW_RESCUE($1, $2, $3); - } - else if ($3) { - rb_warn("else without rescue is useless"); - $$ = block_append($$, $3); - } - if ($4) { - if ($$) { - $$ = NEW_ENSURE($$, $4); - } - else { - $$ = block_append($4, NEW_NIL()); - } - } - fixpos($$, $1); - } - ; - -compstmt : stmts opt_terms - { - void_stmts($1); - $$ = $1; - } - ; + if (nd_type_p(node, NODE_BLOCK)) { + while (RNODE_BLOCK(node)->nd_next) { + node = RNODE_BLOCK(node)->nd_next; + } + node = RNODE_BLOCK(node)->nd_head; + } + node = remove_begin(node); + void_expr(p, node); + } + p->eval_tree = NEW_SCOPE(0, block_append(p, p->eval_tree, $2), NULL, &@$); + /*% ripper[final]: program!($:2) %*/ + local_pop(p); + } + ; + +top_stmts : none + { + $$ = NEW_BEGIN(0, &@$); + /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/ + } + | top_stmt + { + $$ = newline_node($1); + /*% ripper: stmts_add!(stmts_new!, $:1) %*/ + } + | top_stmts terms top_stmt + { + $$ = block_append(p, $1, newline_node($3)); + /*% ripper: stmts_add!($:1, $:3) %*/ + } + ; + +top_stmt : stmt + { + clear_block_exit(p, true); + $$ = $1; + } + | keyword_BEGIN begin_block + { + $$ = $2; + /*% ripper: $:2 %*/ + } + ; + +block_open : '{' {$$ = init_block_exit(p);}; + +begin_block : block_open compstmt(top_stmts) '}' + { + restore_block_exit(p, $block_open); + p->eval_tree_begin = block_append(p, p->eval_tree_begin, + NEW_BEGIN($2, &@$)); + $$ = NEW_BEGIN(0, &@$); + /*% ripper: BEGIN!($:2) %*/ + } + ; + +bodystmt : compstmt(stmts)[body] + lex_ctxt[ctxt] + opt_rescue + k_else + { + if (!$opt_rescue) yyerror1(&@k_else, "else without rescue is useless"); + next_rescue_context(&p->ctxt, &$ctxt, after_else); + } + compstmt(stmts)[elsebody] + { + next_rescue_context(&p->ctxt, &$ctxt, after_ensure); + } + opt_ensure + { + $$ = new_bodystmt(p, $body, $opt_rescue, $elsebody, $opt_ensure, &@$); + /*% ripper: bodystmt!($:body, $:opt_rescue, $:elsebody, $:opt_ensure) %*/ + } + | compstmt(stmts)[body] + lex_ctxt[ctxt] + opt_rescue + { + next_rescue_context(&p->ctxt, &$ctxt, after_ensure); + } + opt_ensure + { + $$ = new_bodystmt(p, $body, $opt_rescue, 0, $opt_ensure, &@$); + /*% ripper: bodystmt!($:body, $:opt_rescue, Qnil, $:opt_ensure) %*/ + } + ; stmts : none - | stmt - { - $$ = newline_node($1); - } - | stmts terms stmt - { - $$ = block_append($1, newline_node($3)); - } - | error stmt - { - $$ = $2; - } - ; - -stmt : kALIAS fitem {lex_state = EXPR_FNAME;} fitem - { - $$ = NEW_ALIAS($2, $4); - } - | kALIAS tGVAR tGVAR - { - $$ = NEW_VALIAS($2, $3); - } - | kALIAS tGVAR tBACK_REF - { - char buf[3]; - - sprintf(buf, "$%c", (char)$3->nd_nth); - $$ = NEW_VALIAS($2, rb_intern(buf)); - } - | kALIAS tGVAR tNTH_REF - { - yyerror("can't make alias for the number variables"); - $$ = 0; - } - | kUNDEF undef_list - { - $$ = $2; - } - | stmt kIF_MOD expr_value - { - $$ = NEW_IF(cond($3), $1, 0); - fixpos($$, $3); - if (cond_negative(&$$->nd_cond)) { - $$->nd_else = $$->nd_body; - $$->nd_body = 0; - } - } - | stmt kUNLESS_MOD expr_value - { - $$ = NEW_UNLESS(cond($3), $1, 0); - fixpos($$, $3); - if (cond_negative(&$$->nd_cond)) { - $$->nd_body = $$->nd_else; - $$->nd_else = 0; - } - } - | stmt kWHILE_MOD expr_value - { - if ($1 && nd_type($1) == NODE_BEGIN) { - $$ = NEW_WHILE(cond($3), $1->nd_body, 0); - } - else { - $$ = NEW_WHILE(cond($3), $1, 1); - } - if (cond_negative(&$$->nd_cond)) { - nd_set_type($$, NODE_UNTIL); - } - } - | stmt kUNTIL_MOD expr_value - { - if ($1 && nd_type($1) == NODE_BEGIN) { - $$ = NEW_UNTIL(cond($3), $1->nd_body, 0); - } - else { - $$ = NEW_UNTIL(cond($3), $1, 1); - } - if (cond_negative(&$$->nd_cond)) { - nd_set_type($$, NODE_WHILE); - } - } - | stmt kRESCUE_MOD stmt - { - $$ = NEW_RESCUE($1, NEW_RESBODY(0,$3,0), 0); - } - | klBEGIN - { - if (in_def || in_single) { - yyerror("BEGIN in method"); - } - local_push(0); - } - '{' compstmt '}' - { - ruby_eval_tree_begin = block_append(ruby_eval_tree_begin, - NEW_PREEXE($4)); - local_pop(); - $$ = 0; - } - | klEND '{' compstmt '}' - { - if (in_def || in_single) { - rb_warn("END in method; use at_exit"); - } - - $$ = NEW_ITER(0, NEW_POSTEXE(), $3); - } - | lhs '=' command_call - { - value_expr($3); - $$ = node_assign($1, $3); - } - | mlhs '=' command_call - { - value_expr($3); - $1->nd_value = ($1->nd_head) ? NEW_TO_ARY($3) : NEW_ARRAY($3); - $$ = $1; - } - | var_lhs tOP_ASGN command_call - { - value_expr($3); - if ($1) { - ID vid = $1->nd_vid; - if ($2 == tOROP) { - $1->nd_value = $3; - $$ = NEW_OP_ASGN_OR(gettable(vid), $1); - if (is_asgn_or_id(vid)) { - $$->nd_aid = vid; - } - } - else if ($2 == tANDOP) { - $1->nd_value = $3; - $$ = NEW_OP_ASGN_AND(gettable(vid), $1); - } - else { - $$ = $1; - $$->nd_value = call_op(gettable(vid),$2,1,$3); - } - } - else { - $$ = 0; - } - } - | primary_value '[' aref_args ']' tOP_ASGN command_call - { - NODE *args; - - value_expr($6); - args = NEW_LIST($6); - $3 = list_append($3, NEW_NIL()); - list_concat(args, $3); - if ($5 == tOROP) { - $5 = 0; - } - else if ($5 == tANDOP) { - $5 = 1; - } - $$ = NEW_OP_ASGN1($1, $5, args); - fixpos($$, $1); - } - | primary_value '.' tIDENTIFIER tOP_ASGN command_call - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | primary_value '.' tCONSTANT tOP_ASGN command_call - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | primary_value tCOLON2 tIDENTIFIER tOP_ASGN command_call - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | backref tOP_ASGN command_call - { - rb_backref_error($1); - $$ = 0; - } - | lhs '=' mrhs - { - $$ = node_assign($1, NEW_SVALUE($3)); - } - | mlhs '=' arg_value - { - $1->nd_value = ($1->nd_head) ? NEW_TO_ARY($3) : NEW_ARRAY($3); - $$ = $1; - } - | mlhs '=' mrhs - { - $1->nd_value = $3; - $$ = $1; - } - | expr - ; + { + $$ = NEW_BEGIN(0, &@$); + /*% ripper: stmts_add!(stmts_new!, void_stmt!) %*/ + } + | stmt_or_begin + { + $$ = newline_node($1); + /*% ripper: stmts_add!(stmts_new!, $:1) %*/ + } + | stmts terms stmt_or_begin + { + $$ = block_append(p, $1, newline_node($3)); + /*% ripper: stmts_add!($:1, $:3) %*/ + } + ; + +stmt_or_begin : stmt + | keyword_BEGIN + { + yyerror1(&@1, "BEGIN is permitted only at toplevel"); + } + begin_block + { + $$ = $3; + } + ; + +allow_exits : {$$ = allow_block_exit(p);}; + +k_END : keyword_END lex_ctxt + { + $$ = $2; + p->ctxt.in_rescue = before_rescue; + /*% ripper: $:2 %*/ + }; + +stmt : keyword_alias fitem {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem + { + $$ = NEW_ALIAS($2, $4, &@$, &@1); + /*% ripper: alias!($:2, $:4) %*/ + } + | keyword_alias tGVAR tGVAR + { + $$ = NEW_VALIAS($2, $3, &@$, &@1); + /*% ripper: var_alias!($:2, $:3) %*/ + } + | keyword_alias tGVAR tBACK_REF + { + char buf[2]; + buf[0] = '$'; + buf[1] = (char)RNODE_BACK_REF($3)->nd_nth; + $$ = NEW_VALIAS($2, rb_intern2(buf, 2), &@$, &@1); + /*% ripper: var_alias!($:2, $:3) %*/ + } + | keyword_alias tGVAR tNTH_REF + { + static const char mesg[] = "can't make alias for the number variables"; + /*%%%*/ + yyerror1(&@3, mesg); + /*% %*/ + $$ = NEW_ERROR(&@$); + /*% ripper[error]: alias_error!(ERR_MESG(), $:3) %*/ + } + | keyword_undef undef_list + { + nd_set_first_loc($2, @1.beg_pos); + RNODE_UNDEF($2)->keyword_loc = @1; + $$ = $2; + /*% ripper: undef!($:2) %*/ + } + | stmt modifier_if expr_value + { + $$ = new_if(p, $3, remove_begin($1), 0, &@$, &@2, &NULL_LOC, &NULL_LOC); + fixpos($$, $3); + /*% ripper: if_mod!($:3, $:1) %*/ + } + | stmt modifier_unless expr_value + { + $$ = new_unless(p, $3, remove_begin($1), 0, &@$, &@2, &NULL_LOC, &NULL_LOC); + fixpos($$, $3); + /*% ripper: unless_mod!($:3, $:1) %*/ + } + | stmt modifier_while expr_value + { + clear_block_exit(p, false); + if ($1 && nd_type_p($1, NODE_BEGIN)) { + $$ = NEW_WHILE(cond(p, $3, &@3), RNODE_BEGIN($1)->nd_body, 0, &@$, &@2, &NULL_LOC); + } + else { + $$ = NEW_WHILE(cond(p, $3, &@3), $1, 1, &@$, &@2, &NULL_LOC); + } + /*% ripper: while_mod!($:3, $:1) %*/ + } + | stmt modifier_until expr_value + { + clear_block_exit(p, false); + if ($1 && nd_type_p($1, NODE_BEGIN)) { + $$ = NEW_UNTIL(cond(p, $3, &@3), RNODE_BEGIN($1)->nd_body, 0, &@$, &@2, &NULL_LOC); + } + else { + $$ = NEW_UNTIL(cond(p, $3, &@3), $1, 1, &@$, &@2, &NULL_LOC); + } + /*% ripper: until_mod!($:3, $:1) %*/ + } + | stmt modifier_rescue after_rescue stmt + { + p->ctxt.in_rescue = $3.in_rescue; + NODE *resq; + YYLTYPE loc = code_loc_gen(&@2, &@4); + resq = NEW_RESBODY(0, 0, remove_begin($4), 0, &loc); + $$ = NEW_RESCUE(remove_begin($1), resq, 0, &@$); + /*% ripper: rescue_mod!($:1, $:4) %*/ + } + | k_END allow_exits '{' compstmt(stmts) '}' + { + if (p->ctxt.in_def) { + rb_warn0("END in method; use at_exit"); + } + restore_block_exit(p, $allow_exits); + p->ctxt = $k_END; + { + NODE *scope = NEW_SCOPE2(0 /* tbl */, 0 /* args */, $compstmt /* body */, NULL /* parent */, &@$); + $$ = NEW_POSTEXE(scope, &@$, &@1, &@3, &@5); + RNODE_SCOPE(scope)->nd_parent = $$; + } + /*% ripper: END!($:compstmt) %*/ + } + | command_asgn + | mlhs '=' lex_ctxt command_call_value + { + $$ = node_assign(p, (NODE *)$1, $4, $3, &@$); + /*% ripper: massign!($:1, $:4) %*/ + } + | asgn(mrhs) + | mlhs '=' lex_ctxt mrhs_arg modifier_rescue + after_rescue stmt[resbody] + { + p->ctxt.in_rescue = $3.in_rescue; + YYLTYPE loc = code_loc_gen(&@modifier_rescue, &@resbody); + $resbody = NEW_RESBODY(0, 0, remove_begin($resbody), 0, &loc); + loc.beg_pos = @mrhs_arg.beg_pos; + $mrhs_arg = NEW_RESCUE($mrhs_arg, $resbody, 0, &loc); + $$ = node_assign(p, (NODE *)$mlhs, $mrhs_arg, $lex_ctxt, &@$); + /*% ripper: massign!($:1, rescue_mod!($:4, $:7)) %*/ + } + | mlhs '=' lex_ctxt mrhs_arg + { + $$ = node_assign(p, (NODE *)$1, $4, $3, &@$); + /*% ripper: massign!($:1, $:4) %*/ + } + | expr + | error + { + (void)yynerrs; + $$ = NEW_ERROR(&@$); + } + ; + +command_asgn : asgn(command_rhs) + | op_asgn(command_rhs) + | def_endless_method(endless_command) + ; + +endless_command : command + | endless_command modifier_rescue after_rescue arg + { + p->ctxt.in_rescue = $3.in_rescue; + $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4); + /*% ripper: rescue_mod!($:1, $:4) %*/ + } + | keyword_not '\n'? endless_command + { + $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$); + /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/ + } + ; + +command_rhs : command_call_value %prec tOP_ASGN + | command_call_value modifier_rescue after_rescue stmt + { + p->ctxt.in_rescue = $3.in_rescue; + YYLTYPE loc = code_loc_gen(&@2, &@4); + $$ = NEW_RESCUE($1, NEW_RESBODY(0, 0, remove_begin($4), 0, &loc), 0, &@$); + /*% ripper: rescue_mod!($:1, $:4) %*/ + } + | command_asgn + ; expr : command_call - | expr kAND expr - { - $$ = logop(NODE_AND, $1, $3); - } - | expr kOR expr - { - $$ = logop(NODE_OR, $1, $3); - } - | kNOT expr - { - $$ = NEW_NOT(cond($2)); - } - | '!' command_call - { - $$ = NEW_NOT(cond($2)); - } - | arg - ; - -expr_value : expr - { - value_expr($$); - $$ = $1; - } - ; + | expr keyword_and expr + { + $$ = logop(p, idAND, $1, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idAND), $:3) %*/ + } + | expr keyword_or expr + { + $$ = logop(p, idOR, $1, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idOR), $:3) %*/ + } + | keyword_not '\n'? expr + { + $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$); + /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/ + } + | '!' command_call + { + $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$); + /*% ripper: unary!(ID2VAL('\'!\''), $:2) %*/ + } + | arg tASSOC + { + value_expr(p, $arg); + } + p_in_kwarg[ctxt] p_pvtbl p_pktbl + p_top_expr_body[body] + { + pop_pktbl(p, $p_pktbl); + pop_pvtbl(p, $p_pvtbl); + p->ctxt.in_kwarg = $ctxt.in_kwarg; + p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern; + p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern; + $$ = NEW_CASE3($arg, NEW_IN($body, 0, 0, &@body, &NULL_LOC, &NULL_LOC, &@2), &@$, &NULL_LOC, &NULL_LOC); + /*% ripper: case!($:arg, in!($:body, Qnil, Qnil)) %*/ + } + | arg keyword_in + { + value_expr(p, $arg); + } + p_in_kwarg[ctxt] p_pvtbl p_pktbl + p_top_expr_body[body] + { + pop_pktbl(p, $p_pktbl); + pop_pvtbl(p, $p_pvtbl); + p->ctxt.in_kwarg = $ctxt.in_kwarg; + p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern; + p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern; + $$ = NEW_CASE3($arg, NEW_IN($body, NEW_TRUE(&@body), NEW_FALSE(&@body), &@body, &@keyword_in, &NULL_LOC, &NULL_LOC), &@$, &NULL_LOC, &NULL_LOC); + /*% ripper: case!($:arg, in!($:body, Qnil, Qnil)) %*/ + } + | arg %prec tLBRACE_ARG + ; + +def_name : fname + { + numparam_name(p, $fname); + local_push(p, 0); + p->ctxt.in_def = 1; + p->ctxt.in_rescue = before_rescue; + p->ctxt.cant_return = 0; + $$ = $fname; + } + ; + +defn_head : k_def def_name + { + $$ = def_head_save(p, $k_def); + $$->nd_mid = $def_name; + $$->nd_def = NEW_DEFN($def_name, 0, &@$); + /*% ripper: $:def_name %*/ + } + ; + +defs_head : k_def singleton dot_or_colon + { + SET_LEX_STATE(EXPR_FNAME); + } + def_name + { + SET_LEX_STATE(EXPR_ENDFN|EXPR_LABEL); /* force for args */ + $$ = def_head_save(p, $k_def); + $$->nd_mid = $def_name; + $$->nd_def = NEW_DEFS($singleton, $def_name, 0, &@$); + /*% ripper: [$:singleton, $:dot_or_colon, $:def_name] %*/ + } + ; + +expr_value : value_expr(expr) + | error + { + $$ = NEW_ERROR(&@$); + } + ; + +expr_value_do : {COND_PUSH(1);} expr_value do {COND_POP();} + { + $$ = $2; + /*% ripper: $:2 %*/ + } + ; command_call : command - | block_command - | kRETURN call_args - { - $$ = NEW_RETURN(ret_args($2)); - } - | kBREAK call_args - { - $$ = NEW_BREAK(ret_args($2)); - } - | kNEXT call_args - { - $$ = NEW_NEXT(ret_args($2)); - } - ; + | block_command + ; + +command_call_value : value_expr(command_call) + ; block_command : block_call - | block_call '.' operation2 command_args - { - $$ = new_call($1, $3, $4); - } - | block_call tCOLON2 operation2 command_args - { - $$ = new_call($1, $3, $4); - } - ; - -cmd_brace_block : tLBRACE_ARG - { - $<vars>$ = dyna_push(); - $<num>1 = ruby_sourceline; - } - opt_block_var {$<vars>$ = ruby_dyna_vars;} - compstmt - '}' - { - $$ = NEW_ITER($3, 0, dyna_init($5, $<vars>4)); - nd_set_line($$, $<num>1); - dyna_pop($<vars>2); - } - ; - -command : operation command_args %prec tLOWEST - { - $$ = new_fcall($1, $2); - fixpos($$, $2); - } - | operation command_args cmd_brace_block - { - $$ = new_fcall($1, $2); - if ($3) { - if (nd_type($$) == NODE_BLOCK_PASS) { - rb_compile_error("both block arg and actual block given"); - } - $3->nd_iter = $$; - $$ = $3; - } - fixpos($$, $2); - } - | primary_value '.' operation2 command_args %prec tLOWEST - { - $$ = new_call($1, $3, $4); - fixpos($$, $1); - } - | primary_value '.' operation2 command_args cmd_brace_block - { - $$ = new_call($1, $3, $4); - if ($5) { - if (nd_type($$) == NODE_BLOCK_PASS) { - rb_compile_error("both block arg and actual block given"); - } - $5->nd_iter = $$; - $$ = $5; - } - fixpos($$, $1); - } - | primary_value tCOLON2 operation2 command_args %prec tLOWEST - { - $$ = new_call($1, $3, $4); - fixpos($$, $1); - } - | primary_value tCOLON2 operation2 command_args cmd_brace_block - { - $$ = new_call($1, $3, $4); - if ($5) { - if (nd_type($$) == NODE_BLOCK_PASS) { - rb_compile_error("both block arg and actual block given"); - } - $5->nd_iter = $$; - $$ = $5; - } - fixpos($$, $1); - } - | kSUPER command_args - { - $$ = new_super($2); - fixpos($$, $2); - } - | kYIELD command_args - { - $$ = new_yield($2); - fixpos($$, $2); - } - ; + | block_call call_op2 operation2 command_args + { + $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$); + /*% ripper: method_add_arg!(call!($:1, $:2, $:3), $:4) %*/ + } + ; + +cmd_brace_block : tLBRACE_ARG brace_body '}' + { + $$ = $2; + set_embraced_location($$, &@1, &@3); + /*% ripper: $:2 %*/ + } + ; + +fcall : operation + { + $$ = NEW_FCALL($1, 0, &@$); + /*% ripper: $:1 %*/ + } + ; + +command : fcall command_args %prec tLOWEST + { + $1->nd_args = $2; + nd_set_last_loc($1, @2.end_pos); + $$ = (NODE *)$1; + /*% ripper: command!($:1, $:2) %*/ + } + | fcall command_args cmd_brace_block + { + block_dup_check(p, $2, $3); + $1->nd_args = $2; + $$ = method_add_block(p, (NODE *)$1, $3, &@$); + fixpos($$, RNODE($1)); + nd_set_last_loc($1, @2.end_pos); + /*% ripper: method_add_block!(command!($:1, $:2), $:3) %*/ + } + | primary_value call_op operation2 command_args %prec tLOWEST + { + $$ = new_command_qcall(p, $2, $1, $3, $4, 0, &@3, &@$); + /*% ripper: command_call!($:1, $:2, $:3, $:4) %*/ + } + | primary_value call_op operation2 command_args cmd_brace_block + { + $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$); + /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/ + } + | primary_value tCOLON2 operation2 command_args %prec tLOWEST + { + $$ = new_command_qcall(p, idCOLON2, $1, $3, $4, 0, &@3, &@$); + /*% ripper: command_call!($:1, $:2, $:3, $:4) %*/ + } + | primary_value tCOLON2 operation2 command_args cmd_brace_block + { + $$ = new_command_qcall(p, idCOLON2, $1, $3, $4, $5, &@3, &@$); + /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/ + } + | primary_value tCOLON2 tCONSTANT '{' brace_body '}' + { + set_embraced_location($5, &@4, &@6); + $$ = new_command_qcall(p, idCOLON2, $1, $3, 0, $5, &@3, &@$); + /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, Qnil), $:5) %*/ + } + | keyword_super command_args + { + $$ = NEW_SUPER($2, &@$, &@1, &NULL_LOC, &NULL_LOC); + fixpos($$, $2); + /*% ripper: super!($:2) %*/ + } + | k_yield command_args + { + $$ = NEW_YIELD($2, &@$, &@1, &NULL_LOC, &NULL_LOC); + fixpos($$, $2); + /*% ripper: yield!($:2) %*/ + } + | k_return call_args + { + $$ = NEW_RETURN(ret_args(p, $2), &@$, &@1); + /*% ripper: return!($:2) %*/ + } + | keyword_break call_args + { + NODE *args = 0; + args = ret_args(p, $2); + $$ = add_block_exit(p, NEW_BREAK(args, &@$, &@1)); + /*% ripper: break!($:2) %*/ + } + | keyword_next call_args + { + NODE *args = 0; + args = ret_args(p, $2); + $$ = add_block_exit(p, NEW_NEXT(args, &@$, &@1)); + /*% ripper: next!($:2) %*/ + } + ; mlhs : mlhs_basic - | tLPAREN mlhs_entry rparen - { - $$ = $2; - } - ; - -mlhs_entry : mlhs_basic - | tLPAREN mlhs_entry rparen - { - $$ = NEW_MASGN(NEW_LIST($2), 0); - } - ; + | tLPAREN mlhs_inner rparen + { + $$ = $2; + /*% ripper: mlhs_paren!($:2) %*/ + } + ; + +mlhs_inner : mlhs_basic + | tLPAREN mlhs_inner rparen + { + $$ = NEW_MASGN(NEW_LIST((NODE *)$2, &@$), 0, &@$); + /*% ripper: mlhs_paren!($:2) %*/ + } + ; mlhs_basic : mlhs_head - { - $$ = NEW_MASGN($1, 0); - } - | mlhs_head mlhs_item - { - $$ = NEW_MASGN(list_append($1,$2), 0); - } - | mlhs_head tSTAR mlhs_node - { - $$ = NEW_MASGN($1, $3); - } - | mlhs_head tSTAR - { - $$ = NEW_MASGN($1, -1); - } - | tSTAR mlhs_node - { - $$ = NEW_MASGN(0, $2); - } - | tSTAR - { - $$ = NEW_MASGN(0, -1); - } - ; + { + $$ = NEW_MASGN($1, 0, &@$); + /*% ripper: $:1 %*/ + } + | mlhs_head mlhs_item + { + $$ = NEW_MASGN(list_append(p, $1, $2), 0, &@$); + /*% ripper: mlhs_add!($:1, $:2) %*/ + } + | mlhs_head tSTAR mlhs_node + { + $$ = NEW_MASGN($1, $3, &@$); + /*% ripper: mlhs_add_star!($:1, $:3) %*/ + } + | mlhs_head tSTAR mlhs_node ',' mlhs_items(mlhs_item) + { + $$ = NEW_MASGN($1, NEW_POSTARG($3,$5,&@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, $:3), $:5) %*/ + } + | mlhs_head tSTAR + { + $$ = NEW_MASGN($1, NODE_SPECIAL_NO_NAME_REST, &@$); + /*% ripper: mlhs_add_star!($:1, Qnil) %*/ + } + | mlhs_head tSTAR ',' mlhs_items(mlhs_item) + { + $$ = NEW_MASGN($1, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $4, &@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, Qnil), $:4) %*/ + } + | tSTAR mlhs_node + { + $$ = NEW_MASGN(0, $2, &@$); + /*% ripper: mlhs_add_star!(mlhs_new!, $:2) %*/ + } + | tSTAR mlhs_node ',' mlhs_items(mlhs_item) + { + $$ = NEW_MASGN(0, NEW_POSTARG($2,$4,&@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $:2), $:4) %*/ + } + | tSTAR + { + $$ = NEW_MASGN(0, NODE_SPECIAL_NO_NAME_REST, &@$); + /*% ripper: mlhs_add_star!(mlhs_new!, Qnil) %*/ + } + | tSTAR ',' mlhs_items(mlhs_item) + { + $$ = NEW_MASGN(0, NEW_POSTARG(NODE_SPECIAL_NO_NAME_REST, $3, &@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, Qnil), $:3) %*/ + } + ; mlhs_item : mlhs_node - | tLPAREN mlhs_entry rparen - { - $$ = $2; - } - ; + | tLPAREN mlhs_inner rparen + { + $$ = (NODE *)$2; + /*% ripper: mlhs_paren!($:2) %*/ + } + ; mlhs_head : mlhs_item ',' - { - $$ = NEW_LIST($1); - } - | mlhs_head mlhs_item ',' - { - $$ = list_append($1, $2); - } - ; - -mlhs_node : variable - { - $$ = assignable($1, 0); - } - | primary_value '[' aref_args ']' - { - $$ = aryset($1, $3); - } - | primary_value '.' tIDENTIFIER - { - $$ = attrset($1, $3); - } - | primary_value tCOLON2 tIDENTIFIER - { - $$ = attrset($1, $3); - } - | primary_value '.' tCONSTANT - { - $$ = attrset($1, $3); - } - | primary_value tCOLON2 tCONSTANT - { - if (in_def || in_single) - yyerror("dynamic constant assignment"); - $$ = NEW_CDECL(0, 0, NEW_COLON2($1, $3)); - } - | tCOLON3 tCONSTANT - { - if (in_def || in_single) - yyerror("dynamic constant assignment"); - $$ = NEW_CDECL(0, 0, NEW_COLON3($2)); - } - | backref - { - rb_backref_error($1); - $$ = 0; - } - ; - -lhs : variable - { - $$ = assignable($1, 0); - } - | primary_value '[' aref_args ']' - { - $$ = aryset($1, $3); - } - | primary_value '.' tIDENTIFIER - { - $$ = attrset($1, $3); - } - | primary_value tCOLON2 tIDENTIFIER - { - $$ = attrset($1, $3); - } - | primary_value '.' tCONSTANT - { - $$ = attrset($1, $3); - } - | primary_value tCOLON2 tCONSTANT - { - if (in_def || in_single) - yyerror("dynamic constant assignment"); - $$ = NEW_CDECL(0, 0, NEW_COLON2($1, $3)); - } - | tCOLON3 tCONSTANT - { - if (in_def || in_single) - yyerror("dynamic constant assignment"); - $$ = NEW_CDECL(0, 0, NEW_COLON3($2)); - } - | backref - { - rb_backref_error($1); - $$ = 0; - } - ; + { + $$ = NEW_LIST($1, &@1); + /*% ripper: mlhs_add!(mlhs_new!, $:1) %*/ + } + | mlhs_head mlhs_item ',' + { + $$ = list_append(p, $1, $2); + /*% ripper: mlhs_add!($:1, $:2) %*/ + } + ; + + +mlhs_node : user_or_keyword_variable + { + /*% ripper: var_field!($:1) %*/ + $$ = assignable(p, $1, 0, &@$); + } + | primary_value '[' opt_call_args rbracket + { + $$ = aryset(p, $1, $3, &@$); + /*% ripper: aref_field!($:1, $:3) %*/ + } + | primary_value call_op ident_or_const + { + anddot_multiple_assignment_check(p, &@2, $2); + $$ = attrset(p, $1, $2, $3, &@$); + /*% ripper: field!($:1, $:2, $:3) %*/ + } + | primary_value tCOLON2 tIDENTIFIER + { + $$ = attrset(p, $1, idCOLON2, $3, &@$); + /*% ripper: const_path_field!($:1, $:3) %*/ + } + | primary_value tCOLON2 tCONSTANT + { + /*% ripper: const_path_field!($:1, $:3) %*/ + $$ = const_decl(p, NEW_COLON2($1, $3, &@$, &@2, &@3), &@$); + } + | tCOLON3 tCONSTANT + { + /*% ripper: top_const_field!($:2) %*/ + $$ = const_decl(p, NEW_COLON3($2, &@$, &@1, &@2), &@$); + } + | backref + { + VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $1); + $$ = NEW_ERROR(&@$); + /*% ripper[error]: assign_error!(?e, var_field!($:1)) %*/ + } + ; + +lhs : user_or_keyword_variable + { + /*% ripper: var_field!($:1) %*/ + $$ = assignable(p, $1, 0, &@$); + } + | primary_value '[' opt_call_args rbracket + { + $$ = aryset(p, $1, $3, &@$); + /*% ripper: aref_field!($:1, $:3) %*/ + } + | primary_value call_op ident_or_const + { + $$ = attrset(p, $1, $2, $3, &@$); + /*% ripper: field!($:1, $:2, $:3) %*/ + } + | primary_value tCOLON2 tIDENTIFIER + { + $$ = attrset(p, $1, idCOLON2, $3, &@$); + /*% ripper: field!($:1, $:2, $:3) %*/ + } + | primary_value tCOLON2 tCONSTANT + { + /*% ripper: const_path_field!($:1, $:3) %*/ + $$ = const_decl(p, NEW_COLON2($1, $3, &@$, &@2, &@3), &@$); + } + | tCOLON3 tCONSTANT + { + /*% ripper: top_const_field!($:2) %*/ + $$ = const_decl(p, NEW_COLON3($2, &@$, &@1, &@2), &@$); + } + | backref + { + VALUE MAYBE_UNUSED(e) = rb_backref_error(p, $1); + $$ = NEW_ERROR(&@$); + /*% ripper[error]: assign_error!(?e, var_field!($:1)) %*/ + } + ; cname : tIDENTIFIER - { - yyerror("class/module name must be CONSTANT"); - } - | tCONSTANT - ; + { + static const char mesg[] = "class/module name must be CONSTANT"; + /*%%%*/ + yyerror1(&@1, mesg); + /*% %*/ + /*% ripper[error]: class_name_error!(ERR_MESG(), $:1) %*/ + } + | tCONSTANT + ; cpath : tCOLON3 cname - { - $$ = NEW_COLON3($2); - } - | cname - { - $$ = NEW_COLON2(0, $$); - } - | primary_value tCOLON2 cname - { - $$ = NEW_COLON2($1, $3); - } - ; - -fname : tIDENTIFIER - | tCONSTANT - | tFID - | op - { - lex_state = EXPR_END; - $$ = $1; - } - | reswords - { - lex_state = EXPR_END; - $$ = $<id>1; - } - ; + { + $$ = NEW_COLON3($2, &@$, &@1, &@2); + /*% ripper: top_const_ref!($:2) %*/ + } + | cname + { + $$ = NEW_COLON2(0, $1, &@$, &NULL_LOC, &@1); + /*% ripper: const_ref!($:1) %*/ + } + | primary_value tCOLON2 cname + { + $$ = NEW_COLON2($1, $3, &@$, &@2, &@3); + /*% ripper: const_path_ref!($:1, $:3) %*/ + } + ; + +fname : operation + | op + { + SET_LEX_STATE(EXPR_ENDFN); + $$ = $1; + } + | reswords + ; fitem : fname - | symbol - ; + { + $$ = NEW_SYM(rb_id2str($1), &@$); + /*% ripper: symbol_literal!($:1) %*/ + } + | symbol + ; undef_list : fitem - { - $$ = NEW_UNDEF($1); - } - | undef_list ',' {lex_state = EXPR_FNAME;} fitem - { - $$ = block_append($1, NEW_UNDEF($4)); - } - ; + { + $$ = NEW_UNDEF($1, &@$); + /*% ripper: rb_ary_new3(1, $:1) %*/ + } + | undef_list ',' {SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM);} fitem + { + nd_set_last_loc($1, @4.end_pos); + rb_parser_ary_push_node(p, RNODE_UNDEF($1)->nd_undefs, $4); + /*% ripper: rb_ary_push($:1, $:4) %*/ + } + ; op : '|' { $$ = '|'; } - | '^' { $$ = '^'; } - | '&' { $$ = '&'; } - | tCMP { $$ = tCMP; } - | tEQ { $$ = tEQ; } - | tEQQ { $$ = tEQQ; } - | tMATCH { $$ = tMATCH; } - | '>' { $$ = '>'; } - | tGEQ { $$ = tGEQ; } - | '<' { $$ = '<'; } - | tLEQ { $$ = tLEQ; } - | tLSHFT { $$ = tLSHFT; } - | tRSHFT { $$ = tRSHFT; } - | '+' { $$ = '+'; } - | '-' { $$ = '-'; } - | '*' { $$ = '*'; } - | tSTAR { $$ = '*'; } - | '/' { $$ = '/'; } - | '%' { $$ = '%'; } - | tPOW { $$ = tPOW; } - | '~' { $$ = '~'; } - | tUPLUS { $$ = tUPLUS; } - | tUMINUS { $$ = tUMINUS; } - | tAREF { $$ = tAREF; } - | tASET { $$ = tASET; } - | '`' { $$ = '`'; } - ; - -reswords : k__LINE__ | k__FILE__ | klBEGIN | klEND - | kALIAS | kAND | kBEGIN | kBREAK | kCASE | kCLASS | kDEF - | kDEFINED | kDO | kELSE | kELSIF | kEND | kENSURE | kFALSE - | kFOR | kIN | kMODULE | kNEXT | kNIL | kNOT - | kOR | kREDO | kRESCUE | kRETRY | kRETURN | kSELF | kSUPER - | kTHEN | kTRUE | kUNDEF | kWHEN | kYIELD - | kIF_MOD | kUNLESS_MOD | kWHILE_MOD | kUNTIL_MOD | kRESCUE_MOD - ; - -arg : lhs '=' arg - { - $$ = node_assign($1, $3); - } - | lhs '=' arg kRESCUE_MOD arg - { - $$ = node_assign($1, NEW_RESCUE($3, NEW_RESBODY(0,$5,0), 0)); - } - | var_lhs tOP_ASGN arg - { - value_expr($3); - if ($1) { - ID vid = $1->nd_vid; - if ($2 == tOROP) { - $1->nd_value = $3; - $$ = NEW_OP_ASGN_OR(gettable(vid), $1); - if (is_asgn_or_id(vid)) { - $$->nd_aid = vid; - } - } - else if ($2 == tANDOP) { - $1->nd_value = $3; - $$ = NEW_OP_ASGN_AND(gettable(vid), $1); - } - else { - $$ = $1; - $$->nd_value = call_op(gettable(vid),$2,1,$3); - } - } - else { - $$ = 0; - } - } - | primary_value '[' aref_args ']' tOP_ASGN arg - { - NODE *args; - - value_expr($6); - args = NEW_LIST($6); - $3 = list_append($3, NEW_NIL()); - list_concat(args, $3); - if ($5 == tOROP) { - $5 = 0; - } - else if ($5 == tANDOP) { - $5 = 1; - } - $$ = NEW_OP_ASGN1($1, $5, args); - fixpos($$, $1); - } - | primary_value '.' tIDENTIFIER tOP_ASGN arg - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | primary_value '.' tCONSTANT tOP_ASGN arg - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | primary_value tCOLON2 tIDENTIFIER tOP_ASGN arg - { - value_expr($5); - if ($4 == tOROP) { - $4 = 0; - } - else if ($4 == tANDOP) { - $4 = 1; - } - $$ = NEW_OP_ASGN2($1, $3, $4, $5); - fixpos($$, $1); - } - | primary_value tCOLON2 tCONSTANT tOP_ASGN arg - { - yyerror("constant re-assignment"); - $$ = 0; - } - | tCOLON3 tCONSTANT tOP_ASGN arg - { - yyerror("constant re-assignment"); - $$ = 0; - } - | backref tOP_ASGN arg - { - rb_backref_error($1); - $$ = 0; - } - | arg tDOT2 arg - { - value_expr($1); - value_expr($3); - $$ = NEW_DOT2($1, $3); - } - | arg tDOT3 arg - { - value_expr($1); - value_expr($3); - $$ = NEW_DOT3($1, $3); - } - | arg '+' arg - { - $$ = call_op($1, '+', 1, $3); - } - | arg '-' arg - { - $$ = call_op($1, '-', 1, $3); - } - | arg '*' arg - { - $$ = call_op($1, '*', 1, $3); - } - | arg '/' arg - { - $$ = call_op($1, '/', 1, $3); - } - | arg '%' arg - { - $$ = call_op($1, '%', 1, $3); - } - | arg tPOW arg - { - $$ = call_op($1, tPOW, 1, $3); - } - | tUMINUS_NUM tINTEGER tPOW arg - { - $$ = call_op(call_op($2, tPOW, 1, $4), tUMINUS, 0, 0); - } - | tUMINUS_NUM tFLOAT tPOW arg - { - $$ = call_op(call_op($2, tPOW, 1, $4), tUMINUS, 0, 0); - } - | tUPLUS arg - { - if ($2 && nd_type($2) == NODE_LIT) { - $$ = $2; - } - else { - $$ = call_op($2, tUPLUS, 0, 0); - } - } - | tUMINUS arg - { - $$ = call_op($2, tUMINUS, 0, 0); - } - | arg '|' arg - { - $$ = call_op($1, '|', 1, $3); - } - | arg '^' arg - { - $$ = call_op($1, '^', 1, $3); - } - | arg '&' arg - { - $$ = call_op($1, '&', 1, $3); - } - | arg tCMP arg - { - $$ = call_op($1, tCMP, 1, $3); - } - | arg '>' arg - { - $$ = call_op($1, '>', 1, $3); - } - | arg tGEQ arg - { - $$ = call_op($1, tGEQ, 1, $3); - } - | arg '<' arg - { - $$ = call_op($1, '<', 1, $3); - } - | arg tLEQ arg - { - $$ = call_op($1, tLEQ, 1, $3); - } - | arg tEQ arg - { - $$ = call_op($1, tEQ, 1, $3); - } - | arg tEQQ arg - { - $$ = call_op($1, tEQQ, 1, $3); - } - | arg tNEQ arg - { - $$ = NEW_NOT(call_op($1, tEQ, 1, $3)); - } - | arg tMATCH arg - { - $$ = match_gen($1, $3); - } - | arg tNMATCH arg - { - $$ = NEW_NOT(match_gen($1, $3)); - } - | '!' arg - { - $$ = NEW_NOT(cond($2)); - } - | '~' arg - { - $$ = call_op($2, '~', 0, 0); - } - | arg tLSHFT arg - { - $$ = call_op($1, tLSHFT, 1, $3); - } - | arg tRSHFT arg - { - $$ = call_op($1, tRSHFT, 1, $3); - } - | arg tANDOP arg - { - $$ = logop(NODE_AND, $1, $3); - } - | arg tOROP arg - { - $$ = logop(NODE_OR, $1, $3); - } - | kDEFINED opt_nl {in_defined = 1;} arg - { - in_defined = 0; - $$ = NEW_DEFINED($4); - } - | arg '?' arg ':' arg - { - $$ = NEW_IF(cond($1), $3, $5); - fixpos($$, $1); - } - | primary - { - $$ = $1; - } - ; - -arg_value : arg - { - value_expr($1); - $$ = $1; - } - ; + | '^' { $$ = '^'; } + | '&' { $$ = '&'; } + | tCMP { $$ = tCMP; } + | tEQ { $$ = tEQ; } + | tEQQ { $$ = tEQQ; } + | tMATCH { $$ = tMATCH; } + | tNMATCH { $$ = tNMATCH; } + | '>' { $$ = '>'; } + | tGEQ { $$ = tGEQ; } + | '<' { $$ = '<'; } + | tLEQ { $$ = tLEQ; } + | tNEQ { $$ = tNEQ; } + | tLSHFT { $$ = tLSHFT; } + | tRSHFT { $$ = tRSHFT; } + | '+' { $$ = '+'; } + | '-' { $$ = '-'; } + | '*' { $$ = '*'; } + | tSTAR { $$ = '*'; } + | '/' { $$ = '/'; } + | '%' { $$ = '%'; } + | tPOW { $$ = tPOW; } + | tDSTAR { $$ = tDSTAR; } + | '!' { $$ = '!'; } + | '~' { $$ = '~'; } + | tUPLUS { $$ = tUPLUS; } + | tUMINUS { $$ = tUMINUS; } + | tAREF { $$ = tAREF; } + | tASET { $$ = tASET; } + | '`' { $$ = '`'; } + ; + +reswords : keyword__LINE__ | keyword__FILE__ | keyword__ENCODING__ + | keyword_BEGIN | keyword_END + | keyword_alias | keyword_and | keyword_begin + | keyword_break | keyword_case | keyword_class | keyword_def + | keyword_defined | keyword_do | keyword_else | keyword_elsif + | keyword_end | keyword_ensure | keyword_false + | keyword_for | keyword_in | keyword_module | keyword_next + | keyword_nil | keyword_not | keyword_or | keyword_redo + | keyword_rescue | keyword_retry | keyword_return | keyword_self + | keyword_super | keyword_then | keyword_true | keyword_undef + | keyword_when | keyword_yield | keyword_if | keyword_unless + | keyword_while | keyword_until + ; + +arg : asgn(arg_rhs) + | op_asgn(arg_rhs) + | range_expr(arg) + | arg '+' arg + { + $$ = call_bin_op(p, $1, '+', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'+\''), $:3) %*/ + } + | arg '-' arg + { + $$ = call_bin_op(p, $1, '-', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'-\''), $:3) %*/ + } + | arg '*' arg + { + $$ = call_bin_op(p, $1, '*', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'*\''), $:3) %*/ + } + | arg '/' arg + { + $$ = call_bin_op(p, $1, '/', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'/\''), $:3) %*/ + } + | arg '%' arg + { + $$ = call_bin_op(p, $1, '%', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'%\''), $:3) %*/ + } + | arg tPOW arg + { + $$ = call_bin_op(p, $1, idPow, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idPow), $:3) %*/ + } + | tUMINUS_NUM simple_numeric tPOW arg + { + $$ = call_uni_op(p, call_bin_op(p, $2, idPow, $4, &@2, &@$), idUMinus, &@1, &@$); + /*% ripper: unary!(ID2VAL(idUMinus), binary!($:2, ID2VAL(idPow), $:4)) %*/ + } + | tUPLUS arg + { + $$ = call_uni_op(p, $2, idUPlus, &@1, &@$); + /*% ripper: unary!(ID2VAL(idUPlus), $:2) %*/ + } + | tUMINUS arg + { + $$ = call_uni_op(p, $2, idUMinus, &@1, &@$); + /*% ripper: unary!(ID2VAL(idUMinus), $:2) %*/ + } + | arg '|' arg + { + $$ = call_bin_op(p, $1, '|', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'|\''), $:3) %*/ + } + | arg '^' arg + { + $$ = call_bin_op(p, $1, '^', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'^\''), $:3) %*/ + } + | arg '&' arg + { + $$ = call_bin_op(p, $1, '&', $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL('\'&\''), $:3) %*/ + } + | arg tCMP arg + { + $$ = call_bin_op(p, $1, idCmp, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idCmp), $:3) %*/ + } + | rel_expr %prec tCMP + | arg tEQ arg + { + $$ = call_bin_op(p, $1, idEq, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idEq), $:3) %*/ + } + | arg tEQQ arg + { + $$ = call_bin_op(p, $1, idEqq, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idEqq), $:3) %*/ + } + | arg tNEQ arg + { + $$ = call_bin_op(p, $1, idNeq, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idNeq), $:3) %*/ + } + | arg tMATCH arg + { + $$ = match_op(p, $1, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idEqTilde), $:3) %*/ + } + | arg tNMATCH arg + { + $$ = call_bin_op(p, $1, idNeqTilde, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idNeqTilde), $:3) %*/ + } + | '!' arg + { + $$ = call_uni_op(p, method_cond(p, $2, &@2), '!', &@1, &@$); + /*% ripper: unary!(ID2VAL('\'!\''), $:2) %*/ + } + | '~' arg + { + $$ = call_uni_op(p, $2, '~', &@1, &@$); + /*% ripper: unary!(ID2VAL('\'~\''), $:2) %*/ + } + | arg tLSHFT arg + { + $$ = call_bin_op(p, $1, idLTLT, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idLTLT), $:3) %*/ + } + | arg tRSHFT arg + { + $$ = call_bin_op(p, $1, idGTGT, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idGTGT), $:3) %*/ + } + | arg tANDOP arg + { + $$ = logop(p, idANDOP, $1, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idANDOP), $:3) %*/ + } + | arg tOROP arg + { + $$ = logop(p, idOROP, $1, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL(idOROP), $:3) %*/ + } + | keyword_defined '\n'? begin_defined arg + { + p->ctxt.in_defined = $3.in_defined; + $$ = new_defined(p, $4, &@$, &@1); + p->ctxt.has_trailing_semicolon = $3.has_trailing_semicolon; + /*% ripper: defined!($:4) %*/ + } + | def_endless_method(endless_arg) + | ternary + | primary + ; + +ternary : arg '?' arg '\n'? ':' arg + { + value_expr(p, $1); + $$ = new_if(p, $1, $3, $6, &@$, &NULL_LOC, &@5, &NULL_LOC); + fixpos($$, $1); + /*% ripper: ifop!($:1, $:3, $:6) %*/ + } + ; + +endless_arg : arg %prec modifier_rescue + | endless_arg modifier_rescue after_rescue arg + { + p->ctxt.in_rescue = $3.in_rescue; + $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4); + /*% ripper: rescue_mod!($:1, $:4) %*/ + } + | keyword_not '\n'? endless_arg + { + $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$); + /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/ + } + ; + +relop : '>' {$$ = '>';} + | '<' {$$ = '<';} + | tGEQ {$$ = idGE;} + | tLEQ {$$ = idLE;} + ; + +rel_expr : arg relop arg %prec '>' + { + $$ = call_bin_op(p, $1, $2, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL($2), $:3) %*/ + } + | rel_expr relop arg %prec '>' + { + rb_warning1("comparison '%s' after comparison", WARN_ID($2)); + $$ = call_bin_op(p, $1, $2, $3, &@2, &@$); + /*% ripper: binary!($:1, ID2VAL($2), $:3) %*/ + } + ; + +lex_ctxt : none + { + $$ = p->ctxt; + } + ; + +begin_defined : lex_ctxt + { + p->ctxt.in_defined = 1; + $$ = $1; + } + ; + +after_rescue : lex_ctxt + { + p->ctxt.in_rescue = after_rescue; + $$ = $1; + } + ; + +arg_value : value_expr(arg) + ; aref_args : none - | command opt_nl - { - rb_warn("parenthesize argument(s) for future version"); - $$ = NEW_LIST($1); - } - | args trailer - { - $$ = $1; - } - | args ',' tSTAR arg opt_nl - { - value_expr($4); - $$ = arg_concat($1, $4); - } - | assocs trailer - { - $$ = NEW_LIST(NEW_HASH($1)); - } - | tSTAR arg opt_nl - { - value_expr($2); - $$ = newline_node(NEW_SPLAT($2)); - } - ; - -paren_args : '(' none ')' - { - $$ = $2; - } - | '(' call_args rparen - { - $$ = $2; - } - | '(' block_call rparen - { - rb_warn("parenthesize argument for future version"); - $$ = NEW_LIST($2); - } - | '(' args ',' block_call rparen - { - rb_warn("parenthesize argument for future version"); - $$ = list_append($2, $4); - } - ; + | args trailer + | args ',' assocs trailer + { + $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1; + /*% ripper: args_add!($:1, bare_assoc_hash!($:3)) %*/ + } + | assocs trailer + { + $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@$) : 0; + /*% ripper: args_add!(args_new!, bare_assoc_hash!($:1)) %*/ + } + ; + +arg_rhs : arg %prec tOP_ASGN + { + value_expr(p, $1); + $$ = $1; + } + | arg modifier_rescue after_rescue arg + { + p->ctxt.in_rescue = $3.in_rescue; + value_expr(p, $1); + $$ = rescued_expr(p, $1, $4, &@1, &@2, &@4); + /*% ripper: rescue_mod!($:1, $:4) %*/ + } + ; + +paren_args : '(' opt_call_args rparen + { + $$ = $2; + /*% ripper: arg_paren!($:2) %*/ + } + | '(' args ',' args_forward rparen + { + if (!check_forwarding_args(p)) { + $$ = 0; + } + else { + $$ = new_args_forward_call(p, $2, &@4, &@$); + /*% ripper: arg_paren!(args_add!($:2, $:4)) %*/ + } + } + | '(' args_forward rparen + { + if (!check_forwarding_args(p)) { + $$ = 0; + } + else { + $$ = new_args_forward_call(p, 0, &@2, &@$); + /*% ripper: arg_paren!($:2) %*/ + } + } + ; opt_paren_args : none - | paren_args - ; - -call_args : command - { - rb_warn("parenthesize argument(s) for future version"); - $$ = NEW_LIST($1); - } - | args opt_block_arg - { - $$ = arg_blk_pass($1, $2); - } - | args ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat($1, $4); - $$ = arg_blk_pass($$, $5); - } - | assocs opt_block_arg - { - $$ = NEW_LIST(NEW_HASH($1)); - $$ = arg_blk_pass($$, $2); - } - | assocs ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(NEW_LIST(NEW_HASH($1)), $4); - $$ = arg_blk_pass($$, $5); - } - | args ',' assocs opt_block_arg - { - $$ = list_append($1, NEW_HASH($3)); - $$ = arg_blk_pass($$, $4); - } - | args ',' assocs ',' tSTAR arg opt_block_arg - { - value_expr($6); - $$ = arg_concat(list_append($1, NEW_HASH($3)), $6); - $$ = arg_blk_pass($$, $7); - } - | tSTAR arg_value opt_block_arg - { - $$ = arg_blk_pass(NEW_SPLAT($2), $3); - } - | block_arg - ; - -call_args2 : arg_value ',' args opt_block_arg - { - $$ = arg_blk_pass(list_concat(NEW_LIST($1),$3), $4); - } - | arg_value ',' block_arg - { - $$ = arg_blk_pass($1, $3); - } - | arg_value ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(NEW_LIST($1), $4); - $$ = arg_blk_pass($$, $5); - } - | arg_value ',' args ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(list_concat(NEW_LIST($1),$3), $6); - $$ = arg_blk_pass($$, $7); - } - | assocs opt_block_arg - { - $$ = NEW_LIST(NEW_HASH($1)); - $$ = arg_blk_pass($$, $2); - } - | assocs ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(NEW_LIST(NEW_HASH($1)), $4); - $$ = arg_blk_pass($$, $5); - } - | arg_value ',' assocs opt_block_arg - { - $$ = list_append(NEW_LIST($1), NEW_HASH($3)); - $$ = arg_blk_pass($$, $4); - } - | arg_value ',' args ',' assocs opt_block_arg - { - $$ = list_append(list_concat(NEW_LIST($1),$3), NEW_HASH($5)); - $$ = arg_blk_pass($$, $6); - } - | arg_value ',' assocs ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(list_append(NEW_LIST($1), NEW_HASH($3)), $6); - $$ = arg_blk_pass($$, $7); - } - | arg_value ',' args ',' assocs ',' tSTAR arg_value opt_block_arg - { - $$ = arg_concat(list_append(list_concat(NEW_LIST($1), $3), NEW_HASH($5)), $8); - $$ = arg_blk_pass($$, $9); - } - | tSTAR arg_value opt_block_arg - { - $$ = arg_blk_pass(NEW_SPLAT($2), $3); - } - | block_arg - ; - -command_args : { - $<num>$ = cmdarg_stack; - CMDARG_PUSH(1); - } - open_args - { - /* CMDARG_POP() */ - cmdarg_stack = $<num>1; - $$ = $2; - } - ; - -open_args : call_args - | tLPAREN_ARG {lex_state = EXPR_ENDARG;} rparen - { - rb_warn("don't put space before argument parentheses"); - $$ = 0; - } - | tLPAREN_ARG call_args2 {lex_state = EXPR_ENDARG;} rparen - { - rb_warn("don't put space before argument parentheses"); - $$ = $2; - } - ; + | paren_args + { + $$ = $1 ? $1 : NODE_SPECIAL_EMPTY_ARGS; + } + ; + +opt_call_args : none + | call_args + | args ',' + | args ',' assocs ',' + { + $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1; + /*% ripper: args_add!($:1, bare_assoc_hash!($:3)) %*/ + } + | assocs ',' + { + $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0; + /*% ripper: args_add!(args_new!, bare_assoc_hash!($:1)) %*/ + } + ; + +call_args : value_expr(command) + { + $$ = NEW_LIST($1, &@$); + /*% ripper: args_add!(args_new!, $:1) %*/ + } + | def_endless_method(endless_command) + { + $$ = NEW_LIST($1, &@$); + /*% ripper: args_add!(args_new!, $:1) %*/ + } + | args opt_block_arg + { + $$ = arg_blk_pass($1, $2); + /*% ripper: args_add_block!($:1, $:2) %*/ + } + | assocs opt_block_arg + { + $$ = $1 ? NEW_LIST(new_hash(p, $1, &@1), &@1) : 0; + $$ = arg_blk_pass($$, $2); + /*% ripper: args_add_block!(args_add!(args_new!, bare_assoc_hash!($:1)), $:2) %*/ + } + | args ',' assocs opt_block_arg + { + $$ = $3 ? arg_append(p, $1, new_hash(p, $3, &@3), &@$) : $1; + $$ = arg_blk_pass($$, $4); + /*% ripper: args_add_block!(args_add!($:1, bare_assoc_hash!($:3)), $:4) %*/ + } + | block_arg + /*% ripper: args_add_block!(args_new!, $:1) %*/ + ; + +command_args : { + /* If call_args starts with a open paren '(' or '[', + * look-ahead reading of the letters calls CMDARG_PUSH(0), + * but the push must be done after CMDARG_PUSH(1). + * So this code makes them consistent by first cancelling + * the premature CMDARG_PUSH(0), doing CMDARG_PUSH(1), + * and finally redoing CMDARG_PUSH(0). + */ + int lookahead = 0; + switch (yychar) { + case '(': case tLPAREN: case tLPAREN_ARG: case '[': case tLBRACK: + lookahead = 1; + } + if (lookahead) CMDARG_POP(); + CMDARG_PUSH(1); + if (lookahead) CMDARG_PUSH(0); + } + call_args + { + /* call_args can be followed by tLBRACE_ARG (that does CMDARG_PUSH(0) in the lexer) + * but the push must be done after CMDARG_POP() in the parser. + * So this code does CMDARG_POP() to pop 0 pushed by tLBRACE_ARG, + * CMDARG_POP() to pop 1 pushed by command_args, + * and CMDARG_PUSH(0) to restore back the flag set by tLBRACE_ARG. + */ + int lookahead = 0; + switch (yychar) { + case tLBRACE_ARG: + lookahead = 1; + } + if (lookahead) CMDARG_POP(); + CMDARG_POP(); + if (lookahead) CMDARG_PUSH(0); + $$ = $2; + /*% ripper: $:2 %*/ + } + ; block_arg : tAMPER arg_value - { - $$ = NEW_BLOCK_PASS($2); - } - ; + { + $$ = NEW_BLOCK_PASS($2, &@$, &@1); + /*% ripper: $:2 %*/ + } + | tAMPER + { + forwarding_arg_check(p, idFWD_BLOCK, idFWD_ALL, "block"); + $$ = NEW_BLOCK_PASS(NEW_LVAR(idFWD_BLOCK, &@1), &@$, &@1); + /*% ripper: Qnil %*/ + } + ; opt_block_arg : ',' block_arg - { - $$ = $2; - } - | none - ; - -args : arg_value - { - $$ = NEW_LIST($1); - } - | args ',' arg_value - { - $$ = list_append($1, $3); - } - ; + { + $$ = $2; + /*% ripper: $:2 %*/ + } + | none + { + $$ = 0; + /*% ripper: Qfalse %*/ + } + ; + +/* value */ +args : arg_value + { + $$ = NEW_LIST($arg_value, &@$); + /*% ripper: args_add!(args_new!, $:arg_value) %*/ + } + | arg_splat + { + $$ = $arg_splat; + /*% ripper: args_add_star!(args_new!, $:arg_splat) %*/ + } + | args[non_last_args] ',' arg_value + { + $$ = last_arg_append(p, $non_last_args, $arg_value, &@$); + /*% ripper: args_add!($:non_last_args, $:arg_value) %*/ + } + | args[non_last_args] ',' arg_splat + { + $$ = rest_arg_append(p, $non_last_args, RNODE_SPLAT($arg_splat)->nd_head, &@$); + /*% ripper: args_add_star!($:non_last_args, $:arg_splat) %*/ + } + ; + +/* value */ +arg_splat : tSTAR arg_value + { + $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR); + /*% ripper: $:arg_value %*/ + } + | tSTAR /* none */ + { + forwarding_arg_check(p, idFWD_REST, idFWD_ALL, "rest"); + $$ = NEW_SPLAT(NEW_LVAR(idFWD_REST, &@tSTAR), &@$, &@tSTAR); + /*% ripper: Qnil %*/ + } + ; + +/* value */ +mrhs_arg : mrhs + | arg_value + ; +/* value */ mrhs : args ',' arg_value - { - $$ = list_append($1, $3); - } - | args ',' tSTAR arg_value - { - $$ = arg_concat($1, $4); - } - | tSTAR arg_value - { - $$ = NEW_SPLAT($2); - } - ; - -primary : literal - | strings - | xstring - | regexp - | words - | qwords - | var_ref - | backref - | tFID - { - $$ = NEW_FCALL($1, 0); - } - | kBEGIN - { - $<num>1 = ruby_sourceline; - } - bodystmt - kEND - { - $$ = NEW_BEGIN($3); - nd_set_line($$, $<num>1); - } - | tLPAREN_ARG expr {lex_state = EXPR_ENDARG;} rparen - { - rb_warning("(...) interpreted as grouped expression"); - $$ = $2; - } - | tLPAREN compstmt ')' - { - $$ = $2; - } - | primary_value tCOLON2 tCONSTANT - { - $$ = NEW_COLON2($1, $3); - } - | tCOLON3 tCONSTANT - { - $$ = NEW_COLON3($2); - } - | primary_value '[' aref_args ']' - { - if ($1 && nd_type($1) == NODE_SELF) - $$ = NEW_FCALL(tAREF, $3); - else - $$ = NEW_CALL($1, tAREF, $3); - fixpos($$, $1); - } - | tLBRACK aref_args ']' - { - if ($2 == 0) { - $$ = NEW_ZARRAY(); /* zero length array*/ - } - else { - $$ = $2; - } - } - | tLBRACE assoc_list '}' - { - $$ = NEW_HASH($2); - } - | kRETURN - { - $$ = NEW_RETURN(0); - } - | kYIELD '(' call_args rparen - { - $$ = new_yield($3); - } - | kYIELD '(' rparen - { - $$ = NEW_YIELD(0, Qfalse); - } - | kYIELD - { - $$ = NEW_YIELD(0, Qfalse); - } - | kDEFINED opt_nl '(' {in_defined = 1;} expr rparen - { - in_defined = 0; - $$ = NEW_DEFINED($5); - } - | operation brace_block - { - $2->nd_iter = NEW_FCALL($1, 0); - $$ = $2; - fixpos($2->nd_iter, $2); - } - | method_call - | method_call brace_block - { - if ($1 && nd_type($1) == NODE_BLOCK_PASS) { - rb_compile_error("both block arg and actual block given"); - } - $2->nd_iter = $1; - $$ = $2; - fixpos($$, $1); - } - | kIF expr_value then - compstmt - if_tail - kEND - { - $$ = NEW_IF(cond($2), $4, $5); - fixpos($$, $2); - if (cond_negative(&$$->nd_cond)) { - NODE *tmp = $$->nd_body; - $$->nd_body = $$->nd_else; - $$->nd_else = tmp; - } - } - | kUNLESS expr_value then - compstmt - opt_else - kEND - { - $$ = NEW_UNLESS(cond($2), $4, $5); - fixpos($$, $2); - if (cond_negative(&$$->nd_cond)) { - NODE *tmp = $$->nd_body; - $$->nd_body = $$->nd_else; - $$->nd_else = tmp; - } - } - | kWHILE {COND_PUSH(1);} expr_value do {COND_POP();} - compstmt - kEND - { - $$ = NEW_WHILE(cond($3), $6, 1); - fixpos($$, $3); - if (cond_negative(&$$->nd_cond)) { - nd_set_type($$, NODE_UNTIL); - } - } - | kUNTIL {COND_PUSH(1);} expr_value do {COND_POP();} - compstmt - kEND - { - $$ = NEW_UNTIL(cond($3), $6, 1); - fixpos($$, $3); - if (cond_negative(&$$->nd_cond)) { - nd_set_type($$, NODE_WHILE); - } - } - | kCASE expr_value opt_terms - case_body - kEND - { - $$ = NEW_CASE($2, $4); - fixpos($$, $2); - } - | kCASE expr_value opt_terms kELSE compstmt kEND - { - $$ = block_append($2, $5); - } - | kCASE opt_terms case_body kEND - { - $$ = $3; - } - | kCASE opt_terms kELSE compstmt kEND - { - $$ = $4; - } - | kFOR block_var kIN {COND_PUSH(1);} expr_value do {COND_POP();} - compstmt - kEND - { - $$ = NEW_FOR($2, $5, $8); - fixpos($$, $2); - } - | kCLASS cpath superclass - { - if (in_def || in_single) - yyerror("class definition in method body"); - class_nest++; - local_push(0); - $<num>$ = ruby_sourceline; - } - bodystmt - kEND - { - $$ = NEW_CLASS($2, $5, $3); - nd_set_line($$, $<num>4); - local_pop(); - class_nest--; - } - | kCLASS tLSHFT expr - { - $<num>$ = in_def; - in_def = 0; - } - term - { - $<num>$ = in_single; - in_single = 0; - class_nest++; - local_push(0); - } - bodystmt - kEND - { - $$ = NEW_SCLASS($3, $7); - fixpos($$, $3); - local_pop(); - class_nest--; - in_def = $<num>4; - in_single = $<num>6; - } - | kMODULE cpath - { - if (in_def || in_single) - yyerror("module definition in method body"); - class_nest++; - local_push(0); - $<num>$ = ruby_sourceline; - } - bodystmt - kEND - { - $$ = NEW_MODULE($2, $4); - nd_set_line($$, $<num>3); - local_pop(); - class_nest--; - } - | kDEF fname - { - $<id>$ = cur_mid; - cur_mid = $2; - in_def++; - local_push(0); - } - f_arglist - bodystmt - kEND - { - NODE *body = remove_begin($5); - reduce_nodes(&body); - $$ = NEW_DEFN($2, $4, body, NOEX_PRIVATE); - fixpos($$, $4); - local_pop(); - in_def--; - cur_mid = $<id>3; - } - | kDEF singleton dot_or_colon {lex_state = EXPR_FNAME;} fname - { - in_single++; - local_push(0); - lex_state = EXPR_END; /* force for args */ - } - f_arglist - bodystmt - kEND - { - NODE *body = remove_begin($8); - reduce_nodes(&body); - $$ = NEW_DEFS($2, $5, $7, body); - fixpos($$, $2); - local_pop(); - in_single--; - } - | kBREAK - { - $$ = NEW_BREAK(0); - } - | kNEXT - { - $$ = NEW_NEXT(0); - } - | kREDO - { - $$ = NEW_REDO(); - } - | kRETRY - { - $$ = NEW_RETRY(); - } - ; - -primary_value : primary - { - value_expr($1); - $$ = $1; - } - ; + { + $$ = last_arg_append(p, $args, $arg_value, &@$); + /*% ripper: mrhs_add!(mrhs_new_from_args!($:args), $:arg_value) %*/ + } + | args ',' tSTAR arg_value + { + $$ = rest_arg_append(p, $args, $arg_value, &@$); + /*% ripper: mrhs_add_star!(mrhs_new_from_args!($:args), $:arg_value) %*/ + } + | tSTAR arg_value + { + $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR); + /*% ripper: mrhs_add_star!(mrhs_new!, $:arg_value) %*/ + } + ; + +%rule %inline inline_primary + : literal + | strings + | xstring + | regexp + | words + | qwords + | symbols + | qsymbols + ; + +primary : inline_primary + | var_ref + | backref + | tFID + { + $$ = (NODE *)NEW_FCALL($1, 0, &@$); + /*% ripper: method_add_arg!(fcall!($:1), args_new!) %*/ + } + | k_begin + { + CMDARG_PUSH(0); + } + bodystmt + k_end + { + CMDARG_POP(); + set_line_body($3, @1.end_pos.lineno); + $$ = NEW_BEGIN($3, &@$); + nd_set_line($$, @1.end_pos.lineno); + /*% ripper: begin!($:3) %*/ + } + | tLPAREN_ARG compstmt(stmts) {SET_LEX_STATE(EXPR_ENDARG);} ')' + { + if (nd_type_p($2, NODE_SELF)) RNODE_SELF($2)->nd_state = 0; + $$ = $2; + /*% ripper: paren!($:2) %*/ + } + | tLPAREN compstmt(stmts) ')' + { + if (nd_type_p($2, NODE_SELF)) RNODE_SELF($2)->nd_state = 0; + $$ = NEW_BLOCK($2, &@$); + /*% ripper: paren!($:2) %*/ + } + | primary_value tCOLON2 tCONSTANT + { + $$ = NEW_COLON2($1, $3, &@$, &@2, &@3); + /*% ripper: const_path_ref!($:1, $:3) %*/ + } + | tCOLON3 tCONSTANT + { + $$ = NEW_COLON3($2, &@$, &@1, &@2); + /*% ripper: top_const_ref!($:2) %*/ + } + | tLBRACK aref_args ']' + { + $$ = make_list($2, &@$); + /*% ripper: array!($:2) %*/ + } + | tLBRACE assoc_list '}' + { + $$ = new_hash(p, $2, &@$); + RNODE_HASH($$)->nd_brace = TRUE; + /*% ripper: hash!($:2) %*/ + } + | k_return + { + $$ = NEW_RETURN(0, &@$, &@1); + /*% ripper: return0! %*/ + } + | k_yield '(' call_args rparen + { + $$ = NEW_YIELD($3, &@$, &@1, &@2, &@4); + /*% ripper: yield!(paren!($:3)) %*/ + } + | k_yield '(' rparen + { + $$ = NEW_YIELD(0, &@$, &@1, &@2, &@3); + /*% ripper: yield!(paren!(args_new!)) %*/ + } + | k_yield + { + $$ = NEW_YIELD(0, &@$, &@1, &NULL_LOC, &NULL_LOC); + /*% ripper: yield0! %*/ + } + | keyword_defined '\n'? '(' begin_defined expr rparen + { + p->ctxt.in_defined = $4.in_defined; + $$ = new_defined(p, $5, &@$, &@1); + p->ctxt.has_trailing_semicolon = $4.has_trailing_semicolon; + /*% ripper: defined!($:5) %*/ + } + | keyword_not '(' expr rparen + { + $$ = call_uni_op(p, method_cond(p, $3, &@3), METHOD_NOT, &@1, &@$); + /*% ripper: unary!(ID2VAL(idNOT), $:3) %*/ + } + | keyword_not '(' rparen + { + $$ = call_uni_op(p, method_cond(p, NEW_NIL(&@2), &@2), METHOD_NOT, &@1, &@$); + /*% ripper: unary!(ID2VAL(idNOT), Qnil) %*/ + } + | fcall brace_block + { + $$ = method_add_block(p, (NODE *)$1, $2, &@$); + /*% ripper: method_add_block!(method_add_arg!(fcall!($:1), args_new!), $:2) %*/ + } + | method_call + | method_call brace_block + { + block_dup_check(p, get_nd_args(p, $1), $2); + $$ = method_add_block(p, $1, $2, &@$); + /*% ripper: method_add_block!($:1, $:2) %*/ + } + | lambda + | k_if expr_value then + compstmt(stmts) + if_tail + k_end + { + if ($5 && nd_type_p($5, NODE_IF)) + RNODE_IF($5)->end_keyword_loc = @6; + + $$ = new_if(p, $2, $4, $5, &@$, &@1, &@3, &@6); + fixpos($$, $2); + /*% ripper: if!($:2, $:4, $:5) %*/ + } + | k_unless expr_value then + compstmt(stmts) + opt_else + k_end + { + $$ = new_unless(p, $2, $4, $5, &@$, &@1, &@3, &@6); + fixpos($$, $2); + /*% ripper: unless!($:2, $:4, $:5) %*/ + } + | k_while expr_value_do + compstmt(stmts) + k_end + { + restore_block_exit(p, $1); + $$ = NEW_WHILE(cond(p, $2, &@2), $3, 1, &@$, &@1, &@4); + fixpos($$, $2); + /*% ripper: while!($:2, $:3) %*/ + } + | k_until expr_value_do + compstmt(stmts) + k_end + { + restore_block_exit(p, $1); + $$ = NEW_UNTIL(cond(p, $2, &@2), $3, 1, &@$, &@1, &@4); + fixpos($$, $2); + /*% ripper: until!($:2, $:3) %*/ + } + | k_case expr_value terms? + { + $$ = p->case_labels; + p->case_labels = CHECK_LITERAL_WHEN; + }<labels> + case_body + k_end + { + if (CASE_LABELS_ENABLED_P(p->case_labels)) st_free_table(p->case_labels); + p->case_labels = $4; + $$ = NEW_CASE($2, $5, &@$, &@1, &@6); + fixpos($$, $2); + /*% ripper: case!($:2, $:5) %*/ + } + | k_case terms? + { + $$ = p->case_labels; + p->case_labels = 0; + }<labels> + case_body + k_end + { + if (p->case_labels) st_free_table(p->case_labels); + p->case_labels = $3; + $$ = NEW_CASE2($4, &@$, &@1, &@5); + /*% ripper: case!(Qnil, $:4) %*/ + } + | k_case expr_value terms? + p_case_body + k_end + { + $$ = NEW_CASE3($2, $4, &@$, &@1, &@5); + /*% ripper: case!($:2, $:4) %*/ + } + | k_for for_var keyword_in + {COND_PUSH(1);} expr_value do {COND_POP();} + compstmt(stmts) + k_end + { + restore_block_exit(p, $k_for); + /* + * for a, b, c in e + * #=> + * e.each{|*x| a, b, c = x} + * + * for a in e + * #=> + * e.each{|x| a, = x} + */ + ID id = internal_id(p); + rb_node_args_aux_t *m = NEW_ARGS_AUX(0, 0, &NULL_LOC); + rb_node_args_t *args; + NODE *scope, *internal_var = NEW_DVAR(id, &@for_var); + rb_ast_id_table_t *tbl = rb_ast_new_local_table(p->ast, 1); + tbl->ids[0] = id; /* internal id */ + + switch (nd_type($for_var)) { + case NODE_LASGN: + case NODE_DASGN: /* e.each {|internal_var| a = internal_var; ... } */ + set_nd_value(p, $for_var, internal_var); + id = 0; + m->nd_plen = 1; + m->nd_next = $for_var; + break; + case NODE_MASGN: /* e.each {|*internal_var| a, b, c = (internal_var.length == 1 && Array === (tmp = internal_var[0]) ? tmp : internal_var); ... } */ + m->nd_next = node_assign(p, $for_var, NEW_FOR_MASGN(internal_var, &@for_var), NO_LEX_CTXT, &@for_var); + break; + default: /* e.each {|*internal_var| @a, B, c[1], d.attr = internal_val; ... } */ + 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); + } + /* {|*internal_id| <m> = internal_id; ... } */ + args = new_args(p, m, 0, id, 0, new_args_tail(p, 0, 0, 0, &@for_var), &@for_var); + scope = NEW_SCOPE2(tbl, args, $compstmt, NULL, &@$); + YYLTYPE do_keyword_loc = $do == keyword_do_cond ? @do : NULL_LOC; + $$ = NEW_FOR($5, scope, &@$, &@k_for, &@keyword_in, &do_keyword_loc, &@k_end); + RNODE_SCOPE(scope)->nd_parent = $$; + fixpos($$, $for_var); + /*% ripper: for!($:for_var, $:expr_value, $:compstmt) %*/ + } + | k_class cpath superclass + { + begin_definition("class", &@k_class, &@cpath); + } + bodystmt + k_end + { + YYLTYPE inheritance_operator_loc = NULL_LOC; + if ($superclass) { + inheritance_operator_loc = @superclass; + inheritance_operator_loc.end_pos.column = inheritance_operator_loc.beg_pos.column + 1; + } + $$ = NEW_CLASS($cpath, $bodystmt, $superclass, &@$, &@k_class, &inheritance_operator_loc, &@k_end); + nd_set_line(RNODE_CLASS($$)->nd_body, @k_end.end_pos.lineno); + set_line_body($bodystmt, @superclass.end_pos.lineno); + nd_set_line($$, @superclass.end_pos.lineno); + /*% ripper: class!($:cpath, $:superclass, $:bodystmt) %*/ + local_pop(p); + p->ctxt.in_class = $k_class.in_class; + p->ctxt.cant_return = $k_class.cant_return; + p->ctxt.shareable_constant_value = $k_class.shareable_constant_value; + } + | k_class tLSHFT expr_value + { + begin_definition("", &@k_class, &@tLSHFT); + } + term + bodystmt + k_end + { + $$ = NEW_SCLASS($expr_value, $bodystmt, &@$, &@k_class, &@tLSHFT, &@k_end); + nd_set_line(RNODE_SCLASS($$)->nd_body, @k_end.end_pos.lineno); + set_line_body($bodystmt, nd_line($expr_value)); + fixpos($$, $expr_value); + /*% ripper: sclass!($:expr_value, $:bodystmt) %*/ + local_pop(p); + p->ctxt.in_def = $k_class.in_def; + p->ctxt.in_class = $k_class.in_class; + p->ctxt.cant_return = $k_class.cant_return; + p->ctxt.shareable_constant_value = $k_class.shareable_constant_value; + } + | k_module cpath + { + begin_definition("module", &@k_module, &@cpath); + } + bodystmt + k_end + { + $$ = NEW_MODULE($cpath, $bodystmt, &@$, &@k_module, &@k_end); + nd_set_line(RNODE_MODULE($$)->nd_body, @k_end.end_pos.lineno); + set_line_body($bodystmt, @cpath.end_pos.lineno); + nd_set_line($$, @cpath.end_pos.lineno); + /*% ripper: module!($:cpath, $:bodystmt) %*/ + local_pop(p); + p->ctxt.in_class = $k_module.in_class; + p->ctxt.cant_return = $k_module.cant_return; + p->ctxt.shareable_constant_value = $k_module.shareable_constant_value; + } + | defn_head[head] + f_arglist[args] + { + push_end_expect_token_locations(p, &@head.beg_pos); + } + bodystmt + k_end + { + restore_defun(p, $head); + ($$ = $head->nd_def)->nd_loc = @$; + $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$); + RNODE_DEFN($$)->nd_defn = $bodystmt; + /*% ripper: def!($:head, $:args, $:bodystmt) %*/ + local_pop(p); + } + | defs_head[head] + f_arglist[args] + { + push_end_expect_token_locations(p, &@head.beg_pos); + } + bodystmt + k_end + { + restore_defun(p, $head); + ($$ = $head->nd_def)->nd_loc = @$; + $bodystmt = new_scope_body(p, $args, $bodystmt, $$, &@$); + RNODE_DEFS($$)->nd_defn = $bodystmt; + /*% ripper: defs!(*$:head[0..2], $:args, $:bodystmt) %*/ + local_pop(p); + } + | keyword_break + { + $$ = add_block_exit(p, NEW_BREAK(0, &@$, &@1)); + /*% ripper: break!(args_new!) %*/ + } + | keyword_next + { + $$ = add_block_exit(p, NEW_NEXT(0, &@$, &@1)); + /*% ripper: next!(args_new!) %*/ + } + | keyword_redo + { + $$ = add_block_exit(p, NEW_REDO(&@$, &@1)); + /*% ripper: redo! %*/ + } + | keyword_retry + { + if (!p->ctxt.in_defined) { + switch (p->ctxt.in_rescue) { + case before_rescue: yyerror1(&@1, "Invalid retry without rescue"); break; + case after_rescue: /* ok */ break; + case after_else: yyerror1(&@1, "Invalid retry after else"); break; + case after_ensure: yyerror1(&@1, "Invalid retry after ensure"); break; + } + } + $$ = NEW_RETRY(&@$); + /*% ripper: retry! %*/ + } + ; + +primary_value : value_expr(primary) + ; + +k_begin : keyword_begin + { + token_info_push(p, "begin", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_if : keyword_if + { + WARN_EOL("if"); + token_info_push(p, "if", &@$); + if (p->token_info && p->token_info->nonspc && + p->token_info->next && !strcmp(p->token_info->next->token, "else")) { + const char *tok = p->lex.ptok - rb_strlen_lit("if"); + const char *beg = p->lex.pbeg + p->token_info->next->beg.column; + beg += rb_strlen_lit("else"); + while (beg < tok && ISSPACE(*beg)) beg++; + if (beg == tok) { + p->token_info->nonspc = 0; + } + } + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_unless : keyword_unless + { + token_info_push(p, "unless", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_while : keyword_while allow_exits + { + $$ = $allow_exits; + token_info_push(p, "while", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_until : keyword_until allow_exits + { + $$ = $allow_exits; + token_info_push(p, "until", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_case : keyword_case + { + token_info_push(p, "case", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_for : keyword_for allow_exits + { + $$ = $allow_exits; + token_info_push(p, "for", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_class : keyword_class + { + token_info_push(p, "class", &@$); + $$ = p->ctxt; + p->ctxt.in_rescue = before_rescue; + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_module : keyword_module + { + token_info_push(p, "module", &@$); + $$ = p->ctxt; + p->ctxt.in_rescue = before_rescue; + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_def : keyword_def + { + token_info_push(p, "def", &@$); + $$ = NEW_DEF_TEMP(&@$); + p->ctxt.in_argdef = 1; + } + ; + +k_do : keyword_do + { + token_info_push(p, "do", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_do_block : keyword_do_block + { + token_info_push(p, "do", &@$); + push_end_expect_token_locations(p, &@1.beg_pos); + } + ; + +k_rescue : keyword_rescue + { + token_info_warn(p, "rescue", p->token_info, 1, &@$); + $$ = p->ctxt; + p->ctxt.in_rescue = after_rescue; + } + ; + +k_ensure : keyword_ensure + { + token_info_warn(p, "ensure", p->token_info, 1, &@$); + $$ = p->ctxt; + } + ; + +k_when : keyword_when + { + token_info_warn(p, "when", p->token_info, 0, &@$); + } + ; + +k_else : keyword_else + { + token_info *ptinfo_beg = p->token_info; + int same = ptinfo_beg && strcmp(ptinfo_beg->token, "case") != 0; + token_info_warn(p, "else", p->token_info, same, &@$); + if (same) { + token_info e; + e.next = ptinfo_beg->next; + e.token = "else"; + token_info_setup(&e, p->lex.pbeg, &@$); + if (!e.nonspc) *ptinfo_beg = e; + } + } + ; + +k_elsif : keyword_elsif + { + WARN_EOL("elsif"); + token_info_warn(p, "elsif", p->token_info, 1, &@$); + } + ; + +k_end : keyword_end + { + token_info_pop(p, "end", &@$); + pop_end_expect_token_locations(p); + } + | tDUMNY_END + { + compile_error(p, "syntax error, unexpected end-of-input"); + } + ; + +k_return : keyword_return + { + if (p->ctxt.cant_return && !dyna_in_block(p)) + yyerror1(&@1, "Invalid return in class/module body"); + } + ; + +k_yield : keyword_yield + { + if (!p->ctxt.in_defined && !p->ctxt.in_def && !compile_for_eval) + yyerror1(&@1, "Invalid yield"); + } + ; then : term - | ':' - | kTHEN - | term kTHEN - ; + | keyword_then + | term keyword_then + ; do : term - | ':' - | kDO_COND - ; + | keyword_do_cond { $$ = keyword_do_cond; } + ; if_tail : opt_else - | kELSIF expr_value then - compstmt - if_tail - { - $$ = NEW_IF(cond($2), $4, $5); - fixpos($$, $2); - } - ; + | k_elsif expr_value then + compstmt(stmts) + if_tail + { + $$ = new_if(p, $2, $4, $5, &@$, &@1, &@3, &NULL_LOC); + fixpos($$, $2); + /*% ripper: elsif!($:2, $:4, $:5) %*/ + } + ; opt_else : none - | kELSE compstmt - { - $$ = $2; - } - ; - -block_var : lhs - | mlhs - ; - -opt_block_var : none - | '|' /* none */ '|' - { - $$ = (NODE*)1; - } - | tOROP - { - $$ = (NODE*)1; - } - | '|' block_var '|' - { - $$ = $2; - } - ; - -do_block : kDO_BLOCK - { - $<vars>$ = dyna_push(); - $<num>1 = ruby_sourceline; - } - opt_block_var {$<vars>$ = ruby_dyna_vars;} - compstmt - kEND - { - $$ = NEW_ITER($3, 0, dyna_init($5, $<vars>4)); - nd_set_line($$, $<num>1); - dyna_pop($<vars>2); - } - ; + | k_else compstmt(stmts) + { + $$ = $2; + /*% ripper: else!($:2) %*/ + } + ; + +for_var : lhs + | mlhs + ; + +f_marg : f_norm_arg + { + $$ = assignable(p, $1, 0, &@$); + mark_lvar_used(p, $$); + } + | tLPAREN f_margs rparen + { + $$ = (NODE *)$2; + /*% ripper: mlhs_paren!($:2) %*/ + } + ; + + +f_margs : mlhs_items(f_marg) + { + $$ = NEW_MASGN($1, 0, &@$); + /*% ripper: $:1 %*/ + } + | mlhs_items(f_marg) ',' f_rest_marg + { + $$ = NEW_MASGN($1, $3, &@$); + /*% ripper: mlhs_add_star!($:1, $:3) %*/ + } + | mlhs_items(f_marg) ',' f_rest_marg ',' mlhs_items(f_marg) + { + $$ = NEW_MASGN($1, NEW_POSTARG($3, $5, &@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!($:1, $:3), $:5) %*/ + } + | f_rest_marg + { + $$ = NEW_MASGN(0, $1, &@$); + /*% ripper: mlhs_add_star!(mlhs_new!, $:1) %*/ + } + | f_rest_marg ',' mlhs_items(f_marg) + { + $$ = NEW_MASGN(0, NEW_POSTARG($1, $3, &@$), &@$); + /*% ripper: mlhs_add_post!(mlhs_add_star!(mlhs_new!, $:1), $:3) %*/ + } + ; + +f_rest_marg : tSTAR f_norm_arg + { + /*% ripper: $:2 %*/ + $$ = assignable(p, $2, 0, &@$); + mark_lvar_used(p, $$); + } + | tSTAR + { + $$ = NODE_SPECIAL_NO_NAME_REST; + /*% ripper: Qnil %*/ + } + ; + +f_any_kwrest : f_kwrest + | f_no_kwarg + { + $$ = idNil; + /*% ripper: ID2VAL(idNil) %*/ + } + ; + +f_eq : {p->ctxt.in_argdef = 0;} '='; + +block_args_tail : args_tail_basic(primary_value) + ; + +excessed_comma : ',' + { + /* magic number for rest_id in iseq_set_arguments() */ + $$ = NODE_SPECIAL_EXCESSIVE_COMMA; + /*% ripper: excessed_comma! %*/ + } + ; + +block_param : f_arg ',' f_opt_arg(primary_value) ',' f_rest_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, $3, $5, 0, $6, &@$); + /*% ripper: params!($:1, $:3, $:5, Qnil, *$:6[0..2]) %*/ + } + | f_arg ',' f_opt_arg(primary_value) ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, $3, $5, $7, $8, &@$); + /*% ripper: params!($:1, $:3, $:5, $:7, *$:8[0..2]) %*/ + } + | f_arg ',' f_opt_arg(primary_value) opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, $3, 0, 0, $4, &@$); + /*% ripper: params!($:1, $:3, Qnil, Qnil, *$:4[0..2]) %*/ + } + | f_arg ',' f_opt_arg(primary_value) ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, $3, 0, $5, $6, &@$); + /*% ripper: params!($:1, $:3, Qnil, $:5, *$:6[0..2]) %*/ + } + | f_arg ',' f_rest_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, 0, $3, 0, $4, &@$); + /*% ripper: params!($:1, Qnil, $:3, Qnil, *$:4[0..2]) %*/ + } + | f_arg excessed_comma + { + $$ = new_args_tail(p, 0, 0, 0, &@2); + $$ = new_args(p, $1, 0, $2, 0, $$, &@$); + /*% ripper: params!($:1, Qnil, $:2, Qnil, Qnil, Qnil, Qnil) %*/ + } + | f_arg ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, 0, $3, $5, $6, &@$); + /*% ripper: params!($:1, Qnil, $:3, $:5, *$:6[0..2]) %*/ + } + | f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, $1, 0, 0, 0, $2, &@$); + /*% ripper: params!($:1, Qnil, Qnil, Qnil, *$:2[0..2]) %*/ + } + | f_opt_arg(primary_value) ',' f_rest_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, $1, $3, 0, $4, &@$); + /*% ripper: params!(Qnil, $:1, $:3, Qnil, *$:4[0..2]) %*/ + } + | f_opt_arg(primary_value) ',' f_rest_arg ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, $1, $3, $5, $6, &@$); + /*% ripper: params!(Qnil, $:1, $:3, $:5, *$:6[0..2]) %*/ + } + | f_opt_arg(primary_value) opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, $1, 0, 0, $2, &@$); + /*% ripper: params!(Qnil, $:1, Qnil, Qnil, *$:2[0..2]) %*/ + } + | f_opt_arg(primary_value) ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, $1, 0, $3, $4, &@$); + /*% ripper: params!(Qnil, $:1, Qnil, $:3, *$:4[0..2]) %*/ + } + | f_rest_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, 0, $1, 0, $2, &@$); + /*% ripper: params!(Qnil, Qnil, $:1, Qnil, *$:2[0..2]) %*/ + } + | f_rest_arg ',' f_arg opt_args_tail(block_args_tail) + { + $$ = new_args(p, 0, 0, $1, $3, $4, &@$); + /*% ripper: params!(Qnil, Qnil, $:1, $:3, *$:4[0..2]) %*/ + } + | block_args_tail + { + $$ = new_args(p, 0, 0, 0, 0, $1, &@$); + /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, *$:1[0..2]) %*/ + } + ; + +opt_block_param_def : none + | block_param_def + { + p->command_start = TRUE; + } + ; + +block_param_def : '|' opt_block_param opt_bv_decl '|' + { + p->max_numparam = ORDINAL_PARAM; + p->ctxt.in_argdef = 0; + $$ = $2; + /*% ripper: block_var!($:2, $:3) %*/ + } + ; + +opt_block_param : /* none */ + { + $$ = 0; + /*% ripper: params!(Qnil,Qnil,Qnil,Qnil,Qnil,Qnil,Qnil) %*/ + } + | block_param + ; + +opt_bv_decl : '\n'? + { + $$ = 0; + /*% ripper: Qfalse %*/ + } + | '\n'? ';' bv_decls '\n'? + { + $$ = 0; + /*% ripper: $:3 %*/ + } + ; + +bv_decls : bvar + /*% ripper[brace]: rb_ary_new3(1, $:1) %*/ + | bv_decls ',' bvar + /*% ripper[brace]: rb_ary_push($:1, $:3) %*/ + ; + +bvar : tIDENTIFIER + { + new_bv(p, $1); + /*% ripper: $:1 %*/ + } + | f_bad_arg + ; + +max_numparam : { + $$ = p->max_numparam; + p->max_numparam = 0; + } + ; + +numparam : { + $$ = numparam_push(p); + } + ; + +it_id : { + $$ = p->it_id; + p->it_id = 0; + } + ; + +lambda : tLAMBDA[lpar] + { + token_info_push(p, "->", &@1); + $$ = dyna_push(p); + }[dyna]<vars> + max_numparam numparam it_id allow_exits + f_larglist[args] + { + CMDARG_PUSH(0); + } + lambda_body[body] + { + int max_numparam = p->max_numparam; + ID it_id = p->it_id; + p->lex.lpar_beg = $lpar; + p->max_numparam = $max_numparam; + p->it_id = $it_id; + restore_block_exit(p, $allow_exits); + CMDARG_POP(); + $args = args_with_numbered(p, $args, max_numparam, it_id); + { + YYLTYPE loc = code_loc_gen(&@lpar, &@body); + $$ = NEW_LAMBDA($args, $body->node, &loc, &@lpar, &$body->opening_loc, &$body->closing_loc); + nd_set_line(RNODE_LAMBDA($$)->nd_body, @body.end_pos.lineno); + nd_set_line($$, @args.end_pos.lineno); + nd_set_first_loc($$, @1.beg_pos); + xfree($body); + } + /*% ripper: lambda!($:args, $:body) %*/ + numparam_pop(p, $numparam); + dyna_pop(p, $dyna); + } + ; + +f_larglist : '(' f_args opt_bv_decl ')' + { + p->ctxt.in_argdef = 0; + $$ = $f_args; + p->max_numparam = ORDINAL_PARAM; + /*% ripper: paren!($:2) %*/ + } + | f_args + { + p->ctxt.in_argdef = 0; + if (!args_info_empty_p(&$1->nd_ainfo)) + p->max_numparam = ORDINAL_PARAM; + $$ = $f_args; + } + ; + +lambda_body : tLAMBEG compstmt(stmts) '}' + { + token_info_pop(p, "}", &@3); + $$ = new_locations_lambda_body(p, $2, &@2, &@1, &@3); + /*% ripper: $:2 %*/ + } + | keyword_do_LAMBDA + { + push_end_expect_token_locations(p, &@1.beg_pos); + } + bodystmt k_end + { + $$ = new_locations_lambda_body(p, $3, &@3, &@1, &@4); + /*% ripper: $:3 %*/ + } + ; + +do_block : k_do_block do_body k_end + { + $$ = $2; + set_embraced_location($$, &@1, &@3); + /*% ripper: $:2 %*/ + } + ; block_call : command do_block - { - if ($1 && nd_type($1) == NODE_BLOCK_PASS) { - rb_compile_error("both block arg and actual block given"); - } - $2->nd_iter = $1; - $$ = $2; - fixpos($$, $1); - } - | block_call '.' operation2 opt_paren_args - { - $$ = new_call($1, $3, $4); - } - | block_call tCOLON2 operation2 opt_paren_args - { - $$ = new_call($1, $3, $4); - } - ; - -method_call : operation paren_args - { - $$ = new_fcall($1, $2); - fixpos($$, $2); - } - | primary_value '.' operation2 opt_paren_args - { - $$ = new_call($1, $3, $4); - fixpos($$, $1); - } - | primary_value tCOLON2 operation2 paren_args - { - $$ = new_call($1, $3, $4); - fixpos($$, $1); - } - | primary_value tCOLON2 operation3 - { - $$ = new_call($1, $3, 0); - } - | kSUPER paren_args - { - $$ = new_super($2); - } - | kSUPER - { - $$ = NEW_ZSUPER(); - } - ; - -brace_block : '{' - { - $<vars>$ = dyna_push(); - $<num>1 = ruby_sourceline; - } - opt_block_var {$<vars>$ = ruby_dyna_vars;} - compstmt '}' - { - $$ = NEW_ITER($3, 0, dyna_init($5, $<vars>4)); - nd_set_line($$, $<num>1); - dyna_pop($<vars>2); - } - | kDO - { - $<vars>$ = dyna_push(); - $<num>1 = ruby_sourceline; - } - opt_block_var {$<vars>$ = ruby_dyna_vars;} - compstmt kEND - { - $$ = NEW_ITER($3, 0, dyna_init($5, $<vars>4)); - nd_set_line($$, $<num>1); - dyna_pop($<vars>2); - } - ; - -case_body : kWHEN when_args then - compstmt - cases - { - $$ = NEW_WHEN($2, $4, $5); - } - ; -when_args : args - | args ',' tSTAR arg_value - { - $$ = list_append($1, NEW_WHEN($4, 0, 0)); - } - | tSTAR arg_value - { - $$ = NEW_LIST(NEW_WHEN($2, 0, 0)); - } - ; + { + if (nd_type_p($1, NODE_YIELD)) { + compile_error(p, "block given to yield"); + } + else { + block_dup_check(p, get_nd_args(p, $1), $2); + } + $$ = method_add_block(p, $1, $2, &@$); + fixpos($$, $1); + /*% ripper: method_add_block!($:1, $:2) %*/ + } + | block_call call_op2 operation2 opt_paren_args + { + bool has_args = $4 != 0; + if (NODE_EMPTY_ARGS_P($4)) $4 = 0; + $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$); + /*% ripper: call!($:1, $:2, $:3) %*/ + if (has_args) { + /*% ripper: method_add_arg!($:$, $:4) %*/ + } + } + | block_call call_op2 operation2 opt_paren_args brace_block + { + if (NODE_EMPTY_ARGS_P($4)) $4 = 0; + $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$); + /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/ + } + | block_call call_op2 operation2 command_args do_block + { + $$ = new_command_qcall(p, $2, $1, $3, $4, $5, &@3, &@$); + /*% ripper: method_add_block!(command_call!($:1, $:2, $:3, $:4), $:5) %*/ + } + | block_call call_op2 paren_args + { + $$ = new_qcall(p, $2, $1, idCall, $3, &@2, &@$); + nd_set_line($$, @2.end_pos.lineno); + /*% ripper: method_add_arg!(call!($:1, $:2, ID2VAL(idCall)), $:3) %*/ + } + ; + +method_call : fcall paren_args + { + $1->nd_args = $2; + $$ = (NODE *)$1; + nd_set_last_loc($1, @2.end_pos); + /*% ripper: method_add_arg!(fcall!($:1), $:2) %*/ + } + | primary_value call_op operation2 opt_paren_args + { + bool has_args = $4 != 0; + if (NODE_EMPTY_ARGS_P($4)) $4 = 0; + $$ = new_qcall(p, $2, $1, $3, $4, &@3, &@$); + nd_set_line($$, @3.end_pos.lineno); + /*% ripper: call!($:1, $:2, $:3) %*/ + if (has_args) { + /*% ripper: method_add_arg!($:$, $:4) %*/ + } + } + | primary_value tCOLON2 operation2 paren_args + { + $$ = new_qcall(p, idCOLON2, $1, $3, $4, &@3, &@$); + nd_set_line($$, @3.end_pos.lineno); + /*% ripper: method_add_arg!(call!($:1, $:2, $:3), $:4) %*/ + } + | primary_value tCOLON2 operation3 + { + $$ = new_qcall(p, idCOLON2, $1, $3, 0, &@3, &@$); + /*% ripper: call!($:1, $:2, $:3) %*/ + } + | primary_value call_op2 paren_args + { + $$ = new_qcall(p, $2, $1, idCall, $3, &@2, &@$); + nd_set_line($$, @2.end_pos.lineno); + /*% ripper: method_add_arg!(call!($:1, $:2, ID2VAL(idCall)), $:3) %*/ + } + | keyword_super paren_args + { + rb_code_location_t lparen_loc = @2; + rb_code_location_t rparen_loc = @2; + lparen_loc.end_pos.column = lparen_loc.beg_pos.column + 1; + rparen_loc.beg_pos.column = rparen_loc.end_pos.column - 1; + + $$ = NEW_SUPER($2, &@$, &@1, &lparen_loc, &rparen_loc); + /*% ripper: super!($:2) %*/ + } + | keyword_super + { + $$ = NEW_ZSUPER(&@$); + /*% ripper: zsuper! %*/ + } + | primary_value '[' opt_call_args rbracket + { + $$ = NEW_CALL($1, tAREF, $3, &@$); + fixpos($$, $1); + /*% ripper: aref!($:1, $:3) %*/ + } + ; + +brace_block : '{' brace_body '}' + { + $$ = $2; + set_embraced_location($$, &@1, &@3); + /*% ripper: $:2 %*/ + } + | k_do do_body k_end + { + $$ = $2; + set_embraced_location($$, &@1, &@3); + /*% ripper: $:2 %*/ + } + ; + +brace_body : {$$ = dyna_push(p);}[dyna]<vars> + max_numparam numparam it_id allow_exits + opt_block_param_def[args] compstmt(stmts) + { + int max_numparam = p->max_numparam; + ID it_id = p->it_id; + p->max_numparam = $max_numparam; + p->it_id = $it_id; + $args = args_with_numbered(p, $args, max_numparam, it_id); + $$ = NEW_ITER($args, $compstmt, &@$); + /*% ripper: brace_block!($:args, $:compstmt) %*/ + restore_block_exit(p, $allow_exits); + numparam_pop(p, $numparam); + dyna_pop(p, $dyna); + } + ; + +do_body : { + $$ = dyna_push(p); + CMDARG_PUSH(0); + }[dyna]<vars> + max_numparam numparam it_id allow_exits + opt_block_param_def[args] bodystmt + { + int max_numparam = p->max_numparam; + ID it_id = p->it_id; + p->max_numparam = $max_numparam; + p->it_id = $it_id; + $args = args_with_numbered(p, $args, max_numparam, it_id); + $$ = NEW_ITER($args, $bodystmt, &@$); + /*% ripper: do_block!($:args, $:bodystmt) %*/ + CMDARG_POP(); + restore_block_exit(p, $allow_exits); + numparam_pop(p, $numparam); + dyna_pop(p, $dyna); + } + ; + +case_args : arg_value + { + check_literal_when(p, $arg_value, &@arg_value); + $$ = NEW_LIST($arg_value, &@$); + /*% ripper: args_add!(args_new!, $:arg_value) %*/ + } + | tSTAR arg_value + { + $$ = NEW_SPLAT($arg_value, &@$, &@tSTAR); + /*% ripper: args_add_star!(args_new!, $:arg_value) %*/ + } + | case_args[non_last_args] ',' arg_value + { + check_literal_when(p, $arg_value, &@arg_value); + $$ = last_arg_append(p, $non_last_args, $arg_value, &@$); + /*% ripper: args_add!($:non_last_args, $:arg_value) %*/ + } + | case_args[non_last_args] ',' tSTAR arg_value + { + $$ = rest_arg_append(p, $non_last_args, $arg_value, &@$); + /*% ripper: args_add_star!($:non_last_args, $:arg_value) %*/ + } + ; + +case_body : k_when case_args then + compstmt(stmts) + cases + { + $$ = NEW_WHEN($2, $4, $5, &@$, &@1, &@3); + fixpos($$, $2); + /*% ripper: when!($:2, $:4, $:5) %*/ + } + ; cases : opt_else - | case_body - ; - -opt_rescue : kRESCUE exc_list exc_var then - compstmt - opt_rescue - { - if ($3) { - $3 = node_assign($3, NEW_ERRINFO()); - $5 = block_append($3, $5); - } - $$ = NEW_RESBODY($2, $5, $6); - fixpos($$, $2?$2:$5); - } - | none - ; + | case_body + ; + +p_pvtbl : {$$ = p->pvtbl; p->pvtbl = st_init_numtable();}; +p_pktbl : {$$ = p->pktbl; p->pktbl = 0;}; + +p_in_kwarg : { + $$ = p->ctxt; + SET_LEX_STATE(EXPR_BEG|EXPR_LABEL); + p->command_start = FALSE; + p->ctxt.in_kwarg = 1; + p->ctxt.in_alt_pattern = 0; + p->ctxt.capture_in_pattern = 0; + } + ; + +p_case_body : keyword_in + p_in_kwarg[ctxt] p_pvtbl p_pktbl + p_top_expr[expr] then + { + pop_pktbl(p, $p_pktbl); + pop_pvtbl(p, $p_pvtbl); + p->ctxt.in_kwarg = $ctxt.in_kwarg; + p->ctxt.in_alt_pattern = $ctxt.in_alt_pattern; + p->ctxt.capture_in_pattern = $ctxt.capture_in_pattern; + } + compstmt(stmts) + p_cases[cases] + { + $$ = NEW_IN($expr, $compstmt, $cases, &@$, &@keyword_in, &@then, &NULL_LOC); + /*% ripper: in!($:expr, $:compstmt, $:cases) %*/ + } + ; + +p_cases : opt_else + | p_case_body + ; + +p_top_expr : p_top_expr_body + | p_top_expr_body modifier_if expr_value + { + $$ = new_if(p, $3, $1, 0, &@$, &@2, &NULL_LOC, &NULL_LOC); + fixpos($$, $3); + /*% ripper: if_mod!($:3, $:1) %*/ + } + | p_top_expr_body modifier_unless expr_value + { + $$ = new_unless(p, $3, $1, 0, &@$, &@2, &NULL_LOC, &NULL_LOC); + fixpos($$, $3); + /*% ripper: unless_mod!($:3, $:1) %*/ + } + ; + +p_top_expr_body : p_expr + | p_expr ',' + { + $$ = new_array_pattern_tail(p, 0, 1, 0, 0, &@$); + $$ = new_array_pattern(p, 0, $1, $$, &@$); + /*% ripper: aryptn!(Qnil, [$:1], Qnil, Qnil) %*/ + } + | p_expr ',' p_args + { + $$ = new_array_pattern(p, 0, $1, $3, &@$); + nd_set_first_loc($$, @1.beg_pos); + /*% ripper: aryptn!(Qnil, aryptn_pre_args(p, $:1, $:3[0]), *$:3[1..2]) %*/ + } + | p_find + { + $$ = new_find_pattern(p, 0, $1, &@$); + /*% ripper: fndptn!(Qnil, *$:1[0..2]) %*/ + } + | p_args_tail + { + $$ = new_array_pattern(p, 0, 0, $1, &@$); + /*% ripper: aryptn!(Qnil, *$:1[0..2]) %*/ + } + | p_kwargs + { + $$ = new_hash_pattern(p, 0, $1, &@$); + /*% ripper: hshptn!(Qnil, *$:1[0..1]) %*/ + } + ; + +p_expr : p_as + ; + +p_as : p_expr tASSOC p_variable + { + NODE *n = NEW_LIST($1, &@$); + n = list_append(p, n, $3); + $$ = new_hash(p, n, &@$); + /*% ripper: binary!($:1, ID2VAL((id_assoc)), $:3) %*/ + } + | p_alt + ; + +p_alt : p_alt[left] '|'[alt] + { + p->ctxt.in_alt_pattern = 1; + } + p_expr_basic[right] + { + if (p->ctxt.capture_in_pattern) { + yyerror1(&@alt, "alternative pattern after variable capture"); + } + p->ctxt.in_alt_pattern = 0; + $$ = NEW_OR($left, $right, &@$, &@alt); + /*% ripper: binary!($:left, ID2VAL(idOr), $:right) %*/ + } + | p_expr_basic + ; + +p_lparen : '(' p_pktbl + { + $$ = $2; + /*% ripper: $:2 %*/ + } + ; + +p_lbracket : '[' p_pktbl + { + $$ = $2; + /*% ripper: $:2 %*/ + } + ; + +p_expr_basic : p_value + | p_variable + | p_const p_lparen[p_pktbl] p_args rparen + { + pop_pktbl(p, $p_pktbl); + $$ = new_array_pattern(p, $p_const, 0, $p_args, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: aryptn!($:p_const, *$:p_args[0..2]) %*/ + } + | p_const p_lparen[p_pktbl] p_find rparen + { + pop_pktbl(p, $p_pktbl); + $$ = new_find_pattern(p, $p_const, $p_find, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: fndptn!($:p_const, *$:p_find[0..2]) %*/ + } + | p_const p_lparen[p_pktbl] p_kwargs rparen + { + pop_pktbl(p, $p_pktbl); + $$ = new_hash_pattern(p, $p_const, $p_kwargs, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: hshptn!($:p_const, *$:p_kwargs[0..1]) %*/ + } + | p_const '(' rparen + { + $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$); + $$ = new_array_pattern(p, $p_const, 0, $$, &@$); + /*% ripper: aryptn!($:p_const, Qnil, Qnil, Qnil) %*/ + } + | p_const p_lbracket[p_pktbl] p_args rbracket + { + pop_pktbl(p, $p_pktbl); + $$ = new_array_pattern(p, $p_const, 0, $p_args, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: aryptn!($:p_const, *$:p_args[0..2]) %*/ + } + | p_const p_lbracket[p_pktbl] p_find rbracket + { + pop_pktbl(p, $p_pktbl); + $$ = new_find_pattern(p, $p_const, $p_find, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: fndptn!($:p_const, *$:p_find[0..2]) %*/ + } + | p_const p_lbracket[p_pktbl] p_kwargs rbracket + { + pop_pktbl(p, $p_pktbl); + $$ = new_hash_pattern(p, $p_const, $p_kwargs, &@$); + nd_set_first_loc($$, @p_const.beg_pos); + /*% ripper: hshptn!($:p_const, *$:p_kwargs[0..1]) %*/ + } + | p_const '[' rbracket + { + $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$); + $$ = new_array_pattern(p, $1, 0, $$, &@$); + /*% ripper: aryptn!($:1, Qnil, Qnil, Qnil) %*/ + } + | tLBRACK p_args rbracket + { + $$ = new_array_pattern(p, 0, 0, $p_args, &@$); + /*% ripper: aryptn!(Qnil, *$:p_args[0..2]) %*/ + } + | tLBRACK p_find rbracket + { + $$ = new_find_pattern(p, 0, $p_find, &@$); + /*% ripper: fndptn!(Qnil, *$:p_find[0..2]) %*/ + } + | tLBRACK rbracket + { + $$ = new_array_pattern_tail(p, 0, 0, 0, 0, &@$); + $$ = new_array_pattern(p, 0, 0, $$, &@$); + /*% ripper: aryptn!(Qnil, Qnil, Qnil, Qnil) %*/ + } + | tLBRACE p_pktbl lex_ctxt[ctxt] + { + p->ctxt.in_kwarg = 0; + } + p_kwargs rbrace + { + pop_pktbl(p, $p_pktbl); + p->ctxt.in_kwarg = $ctxt.in_kwarg; + $$ = new_hash_pattern(p, 0, $p_kwargs, &@$); + /*% ripper: hshptn!(Qnil, *$:p_kwargs[0..1]) %*/ + } + | tLBRACE rbrace + { + $$ = new_hash_pattern_tail(p, 0, 0, &@$); + $$ = new_hash_pattern(p, 0, $$, &@$); + /*% ripper: hshptn!(Qnil, Qnil, Qnil) %*/ + } + | tLPAREN p_pktbl p_expr rparen + { + pop_pktbl(p, $p_pktbl); + $$ = $p_expr; + /*% ripper: $:p_expr %*/ + } + ; + +p_args : p_expr + { + NODE *pre_args = NEW_LIST($1, &@$); + $$ = new_array_pattern_tail(p, pre_args, 0, 0, 0, &@$); + /*% ripper: [[$:1], Qnil, Qnil] %*/ + } + | p_args_head + { + $$ = new_array_pattern_tail(p, $1, 1, 0, 0, &@$); + /*% ripper: [$:1, Qnil, Qnil] %*/ + } + | p_args_head p_arg + { + $$ = new_array_pattern_tail(p, list_concat($1, $2), 0, 0, 0, &@$); + /*% ripper: [rb_ary_concat($:1, $:2), Qnil, Qnil] %*/ + } + | p_args_head p_rest + { + $$ = new_array_pattern_tail(p, $1, 1, $2, 0, &@$); + /*% ripper: [$:1, $:2, Qnil] %*/ + } + | p_args_head p_rest ',' p_args_post + { + $$ = new_array_pattern_tail(p, $1, 1, $2, $4, &@$); + /*% ripper: [$:1, $:2, $:4] %*/ + } + | p_args_tail + ; + +p_args_head : p_arg ',' + | p_args_head p_arg ',' + { + $$ = list_concat($1, $2); + /*% ripper: rb_ary_concat($:1, $:2) %*/ + } + ; + +p_args_tail : p_rest + { + $$ = new_array_pattern_tail(p, 0, 1, $1, 0, &@$); + /*% ripper: [Qnil, $:1, Qnil] %*/ + } + | p_rest ',' p_args_post + { + $$ = new_array_pattern_tail(p, 0, 1, $1, $3, &@$); + /*% ripper: [Qnil, $:1, $:3] %*/ + } + ; + +p_find : p_rest ',' p_args_post ',' p_rest + { + $$ = new_find_pattern_tail(p, $1, $3, $5, &@$); + /*% ripper: [$:1, $:3, $:5] %*/ + } + ; + + +p_rest : tSTAR tIDENTIFIER + { + error_duplicate_pattern_variable(p, $2, &@2); + /*% ripper: var_field!($:2) %*/ + $$ = assignable(p, $2, 0, &@$); + } + | tSTAR + { + $$ = 0; + /*% ripper: var_field!(Qnil) %*/ + } + ; + +p_args_post : p_arg + | p_args_post ',' p_arg + { + $$ = list_concat($1, $3); + /*% ripper: rb_ary_concat($:1, $:3) %*/ + } + ; + +p_arg : p_expr + { + $$ = NEW_LIST($1, &@$); + /*% ripper: [$:1] %*/ + } + ; + +p_kwargs : p_kwarg ',' p_any_kwrest + { + $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), $3, &@$); + /*% ripper: [$:1, $:3] %*/ + } + | p_kwarg + { + $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$); + /*% ripper: [$:1, Qnil] %*/ + } + | p_kwarg ',' + { + $$ = new_hash_pattern_tail(p, new_unique_key_hash(p, $1, &@$), 0, &@$); + /*% ripper: [$:1, Qnil] %*/ + } + | p_any_kwrest + { + $$ = new_hash_pattern_tail(p, new_hash(p, 0, &@$), $1, &@$); + /*% ripper: [[], $:1] %*/ + } + ; + +p_kwarg : p_kw + /*% ripper[brace]: [$:1] %*/ + | p_kwarg ',' p_kw + { + $$ = list_concat($1, $3); + /*% ripper: rb_ary_push($:1, $:3) %*/ + } + ; + +p_kw : p_kw_label p_expr + { + error_duplicate_pattern_key(p, $1, &@1); + $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), $2); + /*% ripper: [$:1, $:2] %*/ + } + | p_kw_label + { + error_duplicate_pattern_key(p, $1, &@1); + if ($1 && !is_local_id($1)) { + yyerror1(&@1, "key must be valid as local variables"); + } + error_duplicate_pattern_variable(p, $1, &@1); + $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@$), &@$), assignable(p, $1, 0, &@$)); + /*% ripper: [$:1, Qnil] %*/ + } + ; + +p_kw_label : tLABEL + | tSTRING_BEG string_contents tLABEL_END + { + YYLTYPE loc = code_loc_gen(&@1, &@3); + if (!$2 || nd_type_p($2, NODE_STR)) { + NODE *node = dsym_node(p, $2, &loc); + $$ = rb_sym2id(rb_node_sym_string_val(node)); + } + else { + yyerror1(&loc, "symbol literal with interpolation is not allowed"); + $$ = rb_intern_str(STR_NEW0()); + } + /*% ripper: $:2 %*/ + } + ; + +p_kwrest : kwrest_mark tIDENTIFIER + { + $$ = $2; + /*% ripper: var_field!($:2) %*/ + } + | kwrest_mark + { + $$ = 0; + /*% ripper: Qnil %*/ + } + ; + +p_kwnorest : kwrest_mark keyword_nil + { + $$ = 0; + } + ; + +p_any_kwrest : p_kwrest + | p_kwnorest + { + $$ = idNil; + /*% ripper: var_field!(ID2VAL(idNil)) %*/ + } + ; + +p_value : p_primitive + | range_expr(p_primitive) + | p_var_ref + | p_expr_ref + | p_const + ; + +p_primitive : inline_primary + | keyword_variable + { + if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$); + /*% ripper: var_ref!($:1) %*/ + } + | lambda + ; + +p_variable : tIDENTIFIER + { + error_duplicate_pattern_variable(p, $1, &@1); + /*% ripper: var_field!($:1) %*/ + $$ = assignable(p, $1, 0, &@$); + } + ; + +p_var_ref : '^' tIDENTIFIER + { + NODE *n = gettable(p, $2, &@$); + if (!n) { + n = NEW_ERROR(&@$); + } + else if (!(nd_type_p(n, NODE_LVAR) || nd_type_p(n, NODE_DVAR))) { + compile_error(p, "%"PRIsVALUE": no such local variable", rb_id2str($2)); + } + $$ = n; + /*% ripper: var_ref!($:2) %*/ + } + | '^' nonlocal_var + { + if (!($$ = gettable(p, $2, &@$))) $$ = NEW_ERROR(&@$); + /*% ripper: var_ref!($:2) %*/ + } + ; + +p_expr_ref : '^' tLPAREN expr_value rparen + { + $$ = NEW_BLOCK($3, &@$); + /*% ripper: begin!($:3) %*/ + } + ; + +p_const : tCOLON3 cname + { + $$ = NEW_COLON3($2, &@$, &@1, &@2); + /*% ripper: top_const_ref!($:2) %*/ + } + | p_const tCOLON2 cname + { + $$ = NEW_COLON2($1, $3, &@$, &@2, &@3); + /*% ripper: const_path_ref!($:1, $:3) %*/ + } + | tCONSTANT + { + $$ = gettable(p, $1, &@$); + /*% ripper: var_ref!($:1) %*/ + } + ; + +opt_rescue : k_rescue exc_list exc_var then + compstmt(stmts) + opt_rescue + { + NODE *err = $3; + if ($3) { + err = NEW_ERRINFO(&@3); + err = node_assign(p, $3, err, NO_LEX_CTXT, &@3); + } + $$ = NEW_RESBODY($2, $3, $5, $6, &@$); + if ($2) { + fixpos($$, $2); + } + else if ($3) { + fixpos($$, $3); + } + else { + fixpos($$, $5); + } + /*% ripper: rescue!($:2, $:3, $:5, $:6) %*/ + } + | none + ; exc_list : arg_value - { - $$ = NEW_LIST($1); - } - | mrhs - | none - ; + { + $$ = NEW_LIST($1, &@$); + /*% ripper: rb_ary_new3(1, $:1) %*/ + } + | mrhs + { + if (!($$ = splat_array($1))) $$ = $1; + } + | none + ; exc_var : tASSOC lhs - { - $$ = $2; - } - | none - ; - -opt_ensure : kENSURE compstmt - { - if ($2) - $$ = $2; - else - /* place holder */ - $$ = NEW_NIL(); - } - | none - ; + { + $$ = $2; + /*% ripper: $:2 %*/ + } + | none + ; + +opt_ensure : k_ensure stmts terms? + { + p->ctxt.in_rescue = $1.in_rescue; + $$ = $2; + void_expr(p, void_stmts(p, $$)); + /*% ripper: ensure!($:2) %*/ + } + | none + ; literal : numeric - | symbol - { - $$ = NEW_LIT(ID2SYM($1)); - } - | dsym - ; + | symbol + ; strings : string - { - NODE *node = $1; - if (!node) { - node = NEW_STR(rb_str_new(0, 0)); - } - else { - node = evstr2dstr(node); - } - $$ = node; - } - ; - -string : string1 - | string string1 - { - $$ = literal_concat($1, $2); - } - ; + { + if (!$1) { + $$ = NEW_STR(STRING_NEW0(), &@$); + } + else { + $$ = evstr2dstr(p, $1); + } + /*% ripper: $:1 %*/ + } + ; + +string : tCHAR + | string1 + | string string1 + { + $$ = literal_concat(p, $1, $2, &@$); + /*% ripper: string_concat!($:1, $:2) %*/ + } + ; string1 : tSTRING_BEG string_contents tSTRING_END - { - $$ = $2; - } - ; + { + $$ = heredoc_dedent(p, $2); + if ($$) nd_set_loc($$, &@$); + /*% ripper: $:2 %*/ + if (p->heredoc_indent > 0) { + /*% ripper: heredoc_dedent!($:$, INT2NUM(%{p->heredoc_indent})) %*/ + p->heredoc_indent = 0; + } + /*% ripper: string_literal!($:$) %*/ + } + ; xstring : tXSTRING_BEG xstring_contents tSTRING_END - { - NODE *node = $2; - if (!node) { - node = NEW_XSTR(rb_str_new(0, 0)); - } - else { - switch (nd_type(node)) { - case NODE_STR: - nd_set_type(node, NODE_XSTR); - break; - case NODE_DSTR: - nd_set_type(node, NODE_DXSTR); - break; - default: - node = NEW_NODE(NODE_DXSTR, rb_str_new(0, 0), 1, NEW_LIST(node)); - break; - } - } - $$ = node; - } - ; - -regexp : tREGEXP_BEG xstring_contents tREGEXP_END - { - int options = $3; - NODE *node = $2; - if (!node) { - node = NEW_LIT(rb_reg_new("", 0, options & ~RE_OPTION_ONCE)); - } - else switch (nd_type(node)) { - case NODE_STR: - { - VALUE src = node->nd_lit; - nd_set_type(node, NODE_LIT); - node->nd_lit = rb_reg_new(RSTRING(src)->ptr, - RSTRING(src)->len, - options & ~RE_OPTION_ONCE); - } - break; - default: - node = NEW_NODE(NODE_DSTR, rb_str_new(0, 0), 1, NEW_LIST(node)); - case NODE_DSTR: - if (options & RE_OPTION_ONCE) { - nd_set_type(node, NODE_DREGX_ONCE); - } - else { - nd_set_type(node, NODE_DREGX); - } - node->nd_cflag = options & ~RE_OPTION_ONCE; - break; - } - $$ = node; - } - ; - -words : tWORDS_BEG ' ' tSTRING_END - { - $$ = NEW_ZARRAY(); - } - | tWORDS_BEG word_list tSTRING_END - { - $$ = $2; - } - ; + { + $$ = new_xstring(p, heredoc_dedent(p, $2), &@$); + /*% ripper: $:2 %*/ + if (p->heredoc_indent > 0) { + /*% ripper: heredoc_dedent!($:$, INT2NUM(%{p->heredoc_indent})) %*/ + p->heredoc_indent = 0; + } + /*% ripper: xstring_literal!($:$) %*/ + } + ; + +regexp : tREGEXP_BEG regexp_contents tREGEXP_END + { + $$ = new_regexp(p, $2, $3, &@$, &@1, &@2, &@3); + /*% ripper: regexp_literal!($:2, $:3) %*/ + } + ; + +words : words(tWORDS_BEG, word_list) + ; word_list : /* none */ - { - $$ = 0; - } - | word_list word ' ' - { - $$ = list_append($1, evstr2dstr($2)); - } - ; + { + $$ = 0; + /*% ripper: words_new! %*/ + } + | word_list word ' '+ + { + $$ = list_append(p, $1, evstr2dstr(p, $2)); + /*% ripper: words_add!($:1, $:2) %*/ + } + ; word : string_content - | word string_content - { - $$ = literal_concat($1, $2); - } - ; - -qwords : tQWORDS_BEG ' ' tSTRING_END - { - $$ = NEW_ZARRAY(); - } - | tQWORDS_BEG qword_list tSTRING_END - { - $$ = $2; - } - ; + /*% ripper[brace]: word_add!(word_new!, $:1) %*/ + | word string_content + { + $$ = literal_concat(p, $1, $2, &@$); + /*% ripper: word_add!($:1, $:2) %*/ + } + ; + +symbols : words(tSYMBOLS_BEG, symbol_list) + ; + +symbol_list : /* none */ + { + $$ = 0; + /*% ripper: symbols_new! %*/ + } + | symbol_list word ' '+ + { + $$ = symbol_append(p, $1, evstr2dstr(p, $2)); + /*% ripper: symbols_add!($:1, $:2) %*/ + } + ; + +qwords : words(tQWORDS_BEG, qword_list) + ; + +qsymbols : words(tQSYMBOLS_BEG, qsym_list) + ; qword_list : /* none */ - { - $$ = 0; - } - | qword_list tSTRING_CONTENT ' ' - { - $$ = list_append($1, $2); - } - ; - -string_contents : /* none */ - { - $$ = 0; - } - | string_contents string_content - { - $$ = literal_concat($1, $2); - } - ; + { + $$ = 0; + /*% ripper: qwords_new! %*/ + } + | qword_list tSTRING_CONTENT ' '+ + { + $$ = list_append(p, $1, $2); + /*% ripper: qwords_add!($:1, $:2) %*/ + } + ; + +qsym_list : /* none */ + { + $$ = 0; + /*% ripper: qsymbols_new! %*/ + } + | qsym_list tSTRING_CONTENT ' '+ + { + $$ = symbol_append(p, $1, $2); + /*% ripper: qsymbols_add!($:1, $:2) %*/ + } + ; + +string_contents : /* none */ + { + $$ = 0; + /*% ripper: string_content! %*/ + } + | string_contents string_content + { + $$ = literal_concat(p, $1, $2, &@$); + /*% ripper: string_add!($:1, $:2) %*/ + } + ; xstring_contents: /* none */ - { - $$ = 0; - } - | xstring_contents string_content - { - $$ = literal_concat($1, $2); - } - ; + { + $$ = 0; + /*% ripper: xstring_new! %*/ + } + | xstring_contents string_content + { + $$ = literal_concat(p, $1, $2, &@$); + /*% ripper: xstring_add!($:1, $:2) %*/ + } + ; + +regexp_contents : /* none */ + { + $$ = 0; + /*% ripper: regexp_new! %*/ + } + | regexp_contents string_content + { + NODE *head = $1, *tail = $2; + if (!head) { + $$ = tail; + } + else if (!tail) { + $$ = head; + } + else { + switch (nd_type(head)) { + case NODE_STR: + head = str2dstr(p, head); + break; + case NODE_DSTR: + break; + default: + head = list_append(p, NEW_DSTR(0, &@$), head); + break; + } + $$ = list_append(p, head, tail); + } + /*% ripper: regexp_add!($:1, $:2) %*/ + } + ; string_content : tSTRING_CONTENT - | tSTRING_DVAR - { - $<node>$ = lex_strterm; - lex_strterm = 0; - lex_state = EXPR_BEG; - } - string_dvar - { - lex_strterm = $<node>2; - $$ = NEW_EVSTR($3); - } - | tSTRING_DBEG - { - $<node>$ = lex_strterm; - lex_strterm = 0; - lex_state = EXPR_BEG; - COND_PUSH(0); - CMDARG_PUSH(0); - } - compstmt '}' - { - lex_strterm = $<node>2; - COND_LEXPOP(); - CMDARG_LEXPOP(); - $$ = new_evstr($3); - } - ; - -string_dvar : tGVAR {$$ = NEW_GVAR($1);} - | tIVAR {$$ = NEW_IVAR($1);} - | tCVAR {$$ = NEW_CVAR($1);} - | backref - ; - -symbol : tSYMBEG sym - { - lex_state = EXPR_END; - $$ = $2; - } - ; + /*% ripper[brace]: $:1 %*/ + | tSTRING_DVAR + { + /* need to backup p->lex.strterm so that a string literal `%&foo,#$&,bar&` can be parsed */ + $$ = p->lex.strterm; + p->lex.strterm = 0; + SET_LEX_STATE(EXPR_BEG); + }<strterm> + string_dvar + { + p->lex.strterm = $2; + $$ = NEW_EVSTR($3, &@$, &@1, &NULL_LOC); + nd_set_line($$, @3.end_pos.lineno); + /*% ripper: string_dvar!($:3) %*/ + } + | tSTRING_DBEG[state] + { + CMDARG_PUSH(0); + COND_PUSH(0); + /* need to backup p->lex.strterm so that a string literal `%!foo,#{ !0 },bar!` can be parsed */ + $$ = p->lex.strterm; + p->lex.strterm = 0; + SET_LEX_STATE(EXPR_BEG); + }[term]<strterm> + { + $$ = p->lex.brace_nest; + p->lex.brace_nest = 0; + }[brace]<num> + { + $$ = p->heredoc_indent; + p->heredoc_indent = 0; + }[indent]<num> + compstmt(stmts) string_dend + { + COND_POP(); + CMDARG_POP(); + p->lex.strterm = $term; + SET_LEX_STATE($state); + p->lex.brace_nest = $brace; + p->heredoc_indent = $indent; + p->heredoc_line_indent = -1; + if ($compstmt) nd_unset_fl_newline($compstmt); + $$ = new_evstr(p, $compstmt, &@$, &@state, &@string_dend); + /*% ripper: string_embexpr!($:compstmt) %*/ + } + ; + +string_dend : tSTRING_DEND + | END_OF_INPUT + ; + +string_dvar : nonlocal_var + { + if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$); + /*% ripper: var_ref!($:1) %*/ + } + | backref + ; + +symbol : ssym + | dsym + ; + +ssym : tSYMBEG sym + { + SET_LEX_STATE(EXPR_END); + VALUE str = rb_id2str($2); + /* + * TODO: + * set_yylval_noname sets invalid id to yylval. + * This branch can be removed once yylval is changed to + * hold lexed string. + */ + if (!str) str = STR_NEW0(); + $$ = NEW_SYM(str, &@$); + /*% ripper: symbol_literal!(symbol!($:2)) %*/ + } + ; sym : fname - | tIVAR - | tGVAR - | tCVAR - ; - -dsym : tSYMBEG xstring_contents tSTRING_END - { - lex_state = EXPR_END; - if (!($$ = $2)) { - yyerror("empty symbol literal"); - } - else { - switch (nd_type($$)) { - case NODE_DSTR: - nd_set_type($$, NODE_DSYM); - break; - case NODE_STR: - if (strlen(RSTRING($$->nd_lit)->ptr) == RSTRING($$->nd_lit)->len) { - $$->nd_lit = ID2SYM(rb_intern(RSTRING($$->nd_lit)->ptr)); - nd_set_type($$, NODE_LIT); - break; - } - /* fall through */ - default: - $$ = NEW_NODE(NODE_DSYM, rb_str_new(0, 0), 1, NEW_LIST($$)); - break; - } - } - } - ; - -numeric : tINTEGER - | tFLOAT - | tUMINUS_NUM tINTEGER %prec tLOWEST - { - $$ = negate_lit($2); - } - | tUMINUS_NUM tFLOAT %prec tLOWEST - { - $$ = negate_lit($2); - } - ; - -variable : tIDENTIFIER - | tIVAR - | tGVAR - | tCONSTANT - | tCVAR - | kNIL {$$ = kNIL;} - | kSELF {$$ = kSELF;} - | kTRUE {$$ = kTRUE;} - | kFALSE {$$ = kFALSE;} - | k__FILE__ {$$ = k__FILE__;} - | k__LINE__ {$$ = k__LINE__;} - ; - -var_ref : variable - { - $$ = gettable($1); - } - ; - -var_lhs : variable - { - $$ = assignable($1, 0); - } - ; + | nonlocal_var + ; + +dsym : tSYMBEG string_contents tSTRING_END + { + SET_LEX_STATE(EXPR_END); + $$ = dsym_node(p, $2, &@$); + /*% ripper: dyna_symbol!($:2) %*/ + } + ; + +numeric : simple_numeric + | tUMINUS_NUM simple_numeric %prec tLOWEST + { + $$ = $2; + negate_lit(p, $$); + /*% ripper: unary!(ID2VAL(idUMinus), $:2) %*/ + } + ; + +simple_numeric : tINTEGER + | tFLOAT + | tRATIONAL + | tIMAGINARY + ; + +nonlocal_var : tIVAR + | tGVAR + | tCVAR + ; + +user_variable : ident_or_const + | nonlocal_var + ; + +keyword_variable: keyword_nil {$$ = KWD2EID(nil, $1);} + | keyword_self {$$ = KWD2EID(self, $1);} + | keyword_true {$$ = KWD2EID(true, $1);} + | keyword_false {$$ = KWD2EID(false, $1);} + | keyword__FILE__ {$$ = KWD2EID(_FILE__, $1);} + | keyword__LINE__ {$$ = KWD2EID(_LINE__, $1);} + | keyword__ENCODING__ {$$ = KWD2EID(_ENCODING__, $1);} + ; + +var_ref : user_variable + { + if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$); + if (ifdef_ripper(id_is_var(p, $1), false)) { + /*% ripper: var_ref!($:1) %*/ + } + else { + /*% ripper: vcall!($:1) %*/ + } + } + | keyword_variable + { + if (!($$ = gettable(p, $1, &@$))) $$ = NEW_ERROR(&@$); + /*% ripper: var_ref!($:1) %*/ + } + ; + +var_lhs : user_or_keyword_variable + { + /*% ripper: var_field!($:1) %*/ + $$ = assignable(p, $1, 0, &@$); + } + ; backref : tNTH_REF - | tBACK_REF - ; - -superclass : term - { - $$ = 0; - } - | '<' - { - lex_state = EXPR_BEG; - } - expr_value term - { - $$ = $3; - } - | error term {yyerrok; $$ = 0;} - ; - -f_arglist : '(' f_args rparen - { - $$ = $2; - lex_state = EXPR_BEG; - } - | f_args term - { - $$ = $1; - } - ; - -f_args : f_arg ',' f_optarg ',' f_rest_arg opt_f_block_arg - { - $$ = block_append(NEW_ARGS($1, $3, $5), $6); - } - | f_arg ',' f_optarg opt_f_block_arg - { - $$ = block_append(NEW_ARGS($1, $3, -1), $4); - } - | f_arg ',' f_rest_arg opt_f_block_arg - { - $$ = block_append(NEW_ARGS($1, 0, $3), $4); - } - | f_arg opt_f_block_arg - { - $$ = block_append(NEW_ARGS($1, 0, -1), $2); - } - | f_optarg ',' f_rest_arg opt_f_block_arg - { - $$ = block_append(NEW_ARGS(0, $1, $3), $4); - } - | f_optarg opt_f_block_arg - { - $$ = block_append(NEW_ARGS(0, $1, -1), $2); - } - | f_rest_arg opt_f_block_arg - { - $$ = block_append(NEW_ARGS(0, 0, $1), $2); - } - | f_block_arg - { - $$ = block_append(NEW_ARGS(0, 0, -1), $1); - } - | /* none */ - { - $$ = NEW_ARGS(0, 0, -1); - } - ; - -f_norm_arg : tCONSTANT - { - yyerror("formal argument cannot be a constant"); - } + | tBACK_REF + ; + +superclass : '<' + { + SET_LEX_STATE(EXPR_BEG); + p->command_start = TRUE; + } + expr_value term + { + $$ = $3; + /*% ripper: $:3 %*/ + } + | none + ; + +f_opt_paren_args: f_paren_args + | none + { + p->ctxt.in_argdef = 0; + $$ = new_args_tail(p, 0, 0, 0, &@0); + $$ = new_args(p, 0, 0, 0, 0, $$, &@0); + /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, Qnil, Qnil, Qnil) %*/ + } + ; + +f_paren_args : '(' f_args rparen + { + $$ = $2; + /*% ripper: paren!($:2) %*/ + SET_LEX_STATE(EXPR_BEG); + p->command_start = TRUE; + p->ctxt.in_argdef = 0; + } + ; + +f_arglist : f_paren_args + | { + $$ = p->ctxt; + p->ctxt.in_kwarg = 1; + p->ctxt.in_argdef = 1; + SET_LEX_STATE(p->lex.state|EXPR_LABEL); /* force for args */ + }<ctxt> + f_args term + { + p->ctxt.in_kwarg = $1.in_kwarg; + p->ctxt.in_argdef = 0; + $$ = $2; + SET_LEX_STATE(EXPR_BEG); + p->command_start = TRUE; + /*% ripper: $:2 %*/ + } + ; + +args_tail : args_tail_basic(arg_value) + | args_forward + { + ID fwd = $args_forward; + if (lambda_beginning_p() || + (p->lex.lpar_beg >= 0 && p->lex.lpar_beg+1 == p->lex.paren_nest)) { + yyerror0("unexpected ... in lambda argument"); + fwd = 0; + } + else { + add_forwarding_args(p); + } + $$ = new_args_tail(p, 0, fwd, arg_FWD_BLOCK, &@1); + $$->nd_ainfo.forwarding = 1; + /*% ripper: [Qnil, $:1, Qnil] %*/ + } + ; + +f_args : f_arg ',' f_opt_arg(arg_value) ',' f_rest_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, $3, $5, 0, $6, &@$); + /*% ripper: params!($:1, $:3, $:5, Qnil, *$:6[0..2]) %*/ + } + | f_arg ',' f_opt_arg(arg_value) ',' f_rest_arg ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, $3, $5, $7, $8, &@$); + /*% ripper: params!($:1, $:3, $:5, $:7, *$:8[0..2]) %*/ + } + | f_arg ',' f_opt_arg(arg_value) opt_args_tail(args_tail) + { + $$ = new_args(p, $1, $3, 0, 0, $4, &@$); + /*% ripper: params!($:1, $:3, Qnil, Qnil, *$:4[0..2]) %*/ + } + | f_arg ',' f_opt_arg(arg_value) ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, $3, 0, $5, $6, &@$); + /*% ripper: params!($:1, $:3, Qnil, $:5, *$:6[0..2]) %*/ + } + | f_arg ',' f_rest_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, 0, $3, 0, $4, &@$); + /*% ripper: params!($:1, Qnil, $:3, Qnil, *$:4[0..2]) %*/ + } + | f_arg ',' f_rest_arg ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, 0, $3, $5, $6, &@$); + /*% ripper: params!($:1, Qnil, $:3, $:5, *$:6[0..2]) %*/ + } + | f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, $1, 0, 0, 0, $2, &@$); + /*% ripper: params!($:1, Qnil, Qnil, Qnil, *$:2[0..2]) %*/ + } + | f_opt_arg(arg_value) ',' f_rest_arg opt_args_tail(args_tail) + { + $$ = new_args(p, 0, $1, $3, 0, $4, &@$); + /*% ripper: params!(Qnil, $:1, $:3, Qnil, *$:4[0..2]) %*/ + } + | f_opt_arg(arg_value) ',' f_rest_arg ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, 0, $1, $3, $5, $6, &@$); + /*% ripper: params!(Qnil, $:1, $:3, $:5, *$:6[0..2]) %*/ + } + | f_opt_arg(arg_value) opt_args_tail(args_tail) + { + $$ = new_args(p, 0, $1, 0, 0, $2, &@$); + /*% ripper: params!(Qnil, $:1, Qnil, Qnil, *$:2[0..2]) %*/ + } + | f_opt_arg(arg_value) ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, 0, $1, 0, $3, $4, &@$); + /*% ripper: params!(Qnil, $:1, Qnil, $:3, *$:4[0..2]) %*/ + } + | f_rest_arg opt_args_tail(args_tail) + { + $$ = new_args(p, 0, 0, $1, 0, $2, &@$); + /*% ripper: params!(Qnil, Qnil, $:1, Qnil, *$:2[0..2]) %*/ + } + | f_rest_arg ',' f_arg opt_args_tail(args_tail) + { + $$ = new_args(p, 0, 0, $1, $3, $4, &@$); + /*% ripper: params!(Qnil, Qnil, $:1, $:3, *$:4[0..2]) %*/ + } + | args_tail + { + $$ = new_args(p, 0, 0, 0, 0, $1, &@$); + /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, *$:1[0..2]) %*/ + } + | /* none */ + { + $$ = new_args_tail(p, 0, 0, 0, &@0); + $$ = new_args(p, 0, 0, 0, 0, $$, &@0); + /*% ripper: params!(Qnil, Qnil, Qnil, Qnil, Qnil, Qnil, Qnil) %*/ + } + ; + +args_forward : tBDOT3 + { + $$ = idFWD_KWREST; + /*% ripper: args_forward! %*/ + } + ; + +f_bad_arg : tCONSTANT + { + static const char mesg[] = "formal argument cannot be a constant"; + /*%%%*/ + yyerror1(&@1, mesg); + /*% %*/ + $$ = 0; + /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/ + } | tIVAR - { - yyerror("formal argument cannot be an instance variable"); - } + { + static const char mesg[] = "formal argument cannot be an instance variable"; + /*%%%*/ + yyerror1(&@1, mesg); + /*% %*/ + $$ = 0; + /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/ + } | tGVAR - { - yyerror("formal argument cannot be a global variable"); - } + { + static const char mesg[] = "formal argument cannot be a global variable"; + /*%%%*/ + yyerror1(&@1, mesg); + /*% %*/ + $$ = 0; + /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/ + } | tCVAR - { - yyerror("formal argument cannot be a class variable"); - } - | tIDENTIFIER - { - if (!is_local_id($1)) - yyerror("formal argument must be local variable"); - else if (local_id($1)) - yyerror("duplicate argument name"); - local_cnt($1); - $$ = 1; - } - ; - -f_arg : f_norm_arg - | f_arg ',' f_norm_arg - { - $$ += 1; - } - ; - -f_opt : tIDENTIFIER '=' arg_value - { - if (!is_local_id($1)) - yyerror("formal argument must be local variable"); - else if (local_id($1)) - yyerror("duplicate optional argument name"); - $$ = assignable($1, $3); - } - ; - -f_optarg : f_opt - { - $$ = NEW_BLOCK($1); - $$->nd_end = $$; - } - | f_optarg ',' f_opt - { - $$ = block_append($1, $3); - } - ; + { + static const char mesg[] = "formal argument cannot be a class variable"; + /*%%%*/ + yyerror1(&@1, mesg); + /*% %*/ + $$ = 0; + /*% ripper[error]: param_error!(ERR_MESG(), $:1) %*/ + } + ; + +f_norm_arg : f_bad_arg + | tIDENTIFIER + { + VALUE e = formal_argument_error(p, $$ = $1); + if (e) { + /*% ripper[error]: param_error!(?e, $:1) %*/ + } + p->max_numparam = ORDINAL_PARAM; + } + ; + +f_arg_asgn : f_norm_arg + { + arg_var(p, $1); + $$ = $1; + } + ; + +f_arg_item : f_arg_asgn + { + $$ = NEW_ARGS_AUX($1, 1, &NULL_LOC); + /*% ripper: $:1 %*/ + } + | tLPAREN f_margs rparen + { + ID tid = internal_id(p); + YYLTYPE loc; + loc.beg_pos = @2.beg_pos; + loc.end_pos = @2.beg_pos; + arg_var(p, tid); + if (dyna_in_block(p)) { + $2->nd_value = NEW_DVAR(tid, &loc); + } + else { + $2->nd_value = NEW_LVAR(tid, &loc); + } + $$ = NEW_ARGS_AUX(tid, 1, &NULL_LOC); + $$->nd_next = (NODE *)$2; + /*% ripper: mlhs_paren!($:2) %*/ + } + ; + +f_arg : f_arg_item + /*% ripper[brace]: rb_ary_new3(1, $:1) %*/ + | f_arg ',' f_arg_item + { + $$ = $1; + $$->nd_plen++; + $$->nd_next = block_append(p, $$->nd_next, $3->nd_next); + rb_discard_node(p, (NODE *)$3); + /*% ripper: rb_ary_push($:1, $:3) %*/ + } + ; + + +f_label : tLABEL + { + VALUE e = formal_argument_error(p, $$ = $1); + if (e) { + $$ = 0; + /*% ripper[error]: param_error!(?e, $:1) %*/ + } + /* + * Workaround for Prism::ParseTest#test_filepath for + * "unparser/corpus/literal/def.txt" + * + * See the discussion on https://github.com/ruby/ruby/pull/9923 + */ + arg_var(p, ifdef_ripper(0, $1)); + /*% ripper: $:1 %*/ + p->max_numparam = ORDINAL_PARAM; + p->ctxt.in_argdef = 0; + } + ; + +kwrest_mark : tPOW + | tDSTAR + ; + +f_no_kwarg : p_kwnorest + { + /*% ripper: nokw_param!(Qnil) %*/ + } + ; + +f_kwrest : kwrest_mark tIDENTIFIER + { + arg_var(p, shadowing_lvar(p, $2)); + $$ = $2; + /*% ripper: kwrest_param!($:2) %*/ + } + | kwrest_mark + { + arg_var(p, idFWD_KWREST); + $$ = idFWD_KWREST; + /*% ripper: kwrest_param!(Qnil) %*/ + } + ; restarg_mark : '*' - | tSTAR - ; + | tSTAR + ; f_rest_arg : restarg_mark tIDENTIFIER - { - if (!is_local_id($2)) - yyerror("rest argument must be local variable"); - else if (local_id($2)) - yyerror("duplicate rest argument name"); - $$ = local_cnt($2); - } - | restarg_mark - { - $$ = -2; - } - ; + { + arg_var(p, shadowing_lvar(p, $2)); + $$ = $2; + /*% ripper: rest_param!($:2) %*/ + } + | restarg_mark + { + arg_var(p, idFWD_REST); + $$ = idFWD_REST; + /*% ripper: rest_param!(Qnil) %*/ + } + ; blkarg_mark : '&' - | tAMPER - ; + | tAMPER + ; f_block_arg : blkarg_mark tIDENTIFIER - { - if (!is_local_id($2)) - yyerror("block argument must be local variable"); - else if (local_id($2)) - yyerror("duplicate block argument name"); - $$ = NEW_BLOCK_ARG($2); - } - ; + { + arg_var(p, shadowing_lvar(p, $2)); + $$ = $2; + /*% ripper: blockarg!($:2) %*/ + } + | blkarg_mark + { + arg_var(p, idFWD_BLOCK); + $$ = idFWD_BLOCK; + /*% ripper: blockarg!(Qnil) %*/ + } + ; opt_f_block_arg : ',' f_block_arg - { - $$ = $2; - } - | none - ; - -singleton : var_ref - { - if (nd_type($1) == NODE_SELF) { - $$ = NEW_SELF(); - } - else { - $$ = $1; - value_expr($$); - } - } - | '(' {lex_state = EXPR_BEG;} expr rparen - { - if ($3 == 0) { - yyerror("can't define singleton method for ()."); - } - else { - switch (nd_type($3)) { - case NODE_STR: - case NODE_DSTR: - case NODE_XSTR: - case NODE_DXSTR: - case NODE_DREGX: - case NODE_LIT: - case NODE_ARRAY: - case NODE_ZARRAY: - yyerror("can't define singleton method for literals"); - default: - value_expr($3); - break; - } - } - $$ = $3; - } - ; + { + $$ = $2; + /*% ripper: $:2 %*/ + } + | none + ; + + +singleton : value_expr(singleton_expr) + { + NODE *expr = last_expr_node($1); + switch (nd_type(expr)) { + case NODE_STR: + case NODE_DSTR: + case NODE_XSTR: + case NODE_DXSTR: + case NODE_REGX: + case NODE_DREGX: + case NODE_SYM: + case NODE_LINE: + case NODE_FILE: + case NODE_ENCODING: + case NODE_INTEGER: + case NODE_FLOAT: + case NODE_RATIONAL: + case NODE_IMAGINARY: + case NODE_DSYM: + case NODE_LIST: + case NODE_ZLIST: + yyerror1(&expr->nd_loc, "can't define singleton method for literals"); + break; + default: + break; + } + $$ = $1; + } + ; + +singleton_expr : var_ref + | '(' + { + SET_LEX_STATE(EXPR_BEG); + p->ctxt.in_argdef = 0; + } + expr rparen + { + p->ctxt.in_argdef = 1; + $$ = $3; + /*% ripper: paren!($:3) %*/ + } + ; assoc_list : none - | assocs trailer - { - $$ = $1; - } - | args trailer - { - if ($1->nd_alen%2 != 0) { - yyerror("odd number list for Hash"); - } - $$ = $1; - } - | tLABEL arg_value - { - $$ = list_append(NEW_LIST(NEW_LIT(ID2SYM($1))), $2); - } - ; + | assocs trailer + { + $$ = $1; + /*% ripper: assoclist_from_args!($:1) %*/ + } + ; assocs : assoc - | assocs ',' assoc - { - $$ = list_concat($1, $3); - } - ; + /*% ripper[brace]: rb_ary_new3(1, $:1) %*/ + | assocs ',' assoc + { + NODE *assocs = $1; + NODE *tail = $3; + if (!assocs) { + assocs = tail; + } + else if (tail) { + if (RNODE_LIST(assocs)->nd_head) { + NODE *n = RNODE_LIST(tail)->nd_next; + if (!RNODE_LIST(tail)->nd_head && nd_type_p(n, NODE_LIST) && + nd_type_p((n = RNODE_LIST(n)->nd_head), NODE_HASH)) { + /* DSTAR */ + tail = RNODE_HASH(n)->nd_head; + } + } + if (tail) { + assocs = list_concat(assocs, tail); + } + } + $$ = assocs; + /*% ripper: rb_ary_push($:1, $:3) %*/ + } + ; assoc : arg_value tASSOC arg_value - { - $$ = list_append(NEW_LIST($1), $3); - } - ; - -operation : tIDENTIFIER - | tCONSTANT - | tFID - ; - -operation2 : tIDENTIFIER - | tCONSTANT - | tFID - | op - ; + { + $$ = list_append(p, NEW_LIST($1, &@$), $3); + /*% ripper: assoc_new!($:1, $:3) %*/ + } + | tLABEL arg_value + { + $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), $2); + /*% ripper: assoc_new!($:1, $:2) %*/ + } + | tLABEL + { + NODE *val = gettable(p, $1, &@$); + if (!val) val = NEW_ERROR(&@$); + $$ = list_append(p, NEW_LIST(NEW_SYM(rb_id2str($1), &@1), &@$), val); + /*% ripper: assoc_new!($:1, Qnil) %*/ + } + | tSTRING_BEG string_contents tLABEL_END arg_value + { + YYLTYPE loc = code_loc_gen(&@1, &@3); + $$ = list_append(p, NEW_LIST(dsym_node(p, $2, &loc), &loc), $4); + /*% ripper: assoc_new!(dyna_symbol!($:2), $:4) %*/ + } + | tDSTAR arg_value + { + $$ = list_append(p, NEW_LIST(0, &@$), $2); + /*% ripper: assoc_splat!($:2) %*/ + } + | tDSTAR + { + forwarding_arg_check(p, idFWD_KWREST, idFWD_ALL, "keyword rest"); + $$ = list_append(p, NEW_LIST(0, &@$), + NEW_LVAR(idFWD_KWREST, &@$)); + /*% ripper: assoc_splat!(Qnil) %*/ + } + ; + +%rule %inline operation : ident_or_const + | tFID + ; + +operation2 : operation + | op + ; operation3 : tIDENTIFIER - | tFID - | op - ; + | tFID + | op + ; dot_or_colon : '.' - | tCOLON2 - ; + | tCOLON2 + ; -opt_terms : /* none */ - | terms - ; +call_op : '.' + | tANDDOT + ; -opt_nl : /* none */ - | '\n' - ; +call_op2 : call_op + | tCOLON2 + ; -rparen : opt_nl ')' - ; +rparen : '\n'? ')' + ; -trailer : /* none */ - | '\n' - | ',' - ; +rbracket : '\n'? ']' + ; -term : ';' {yyerrok;} - | '\n' - ; +rbrace : '\n'? '}' + ; + +trailer : '\n'? + | ',' + ; + +term : ';' + { + yyerrok; + token_flush(p); + if (p->ctxt.in_defined) { + p->ctxt.has_trailing_semicolon = 1; + } + } + | '\n' + { + @$.end_pos = @$.beg_pos; + token_flush(p); + } + ; terms : term - | terms ';' {yyerrok;} - ; + | terms ';' {yyerrok;} + ; -none : /* none */ {$$ = 0;} - ; +none : /* none */ + { + $$ = 0; + /*% ripper: Qnil %*/ + } + ; %% -#include "regex.h" -#include "util.h" - -/* We remove any previous definition of `SIGN_EXTEND_CHAR', - since ours (we hope) works properly with all combinations of - machines, compilers, `char' and `unsigned char' argument types. - (Per Bothner suggested the basic approach.) */ -#undef SIGN_EXTEND_CHAR -#if __STDC__ -# define SIGN_EXTEND_CHAR(c) ((signed char)(c)) -#else /* not __STDC__ */ -/* As in Harbison and Steele. */ -# define SIGN_EXTEND_CHAR(c) ((((unsigned char)(c)) ^ 128) - 128) -#endif -#define is_identchar(c) (SIGN_EXTEND_CHAR(c)!=-1&&(ISALNUM(c) || (c) == '_' || ismbchar(c))) +# undef p +# undef yylex +# undef yylval +# define yylval (*p->lval) + +static int regx_options(struct parser_params*); +static int tokadd_string(struct parser_params*,int,int,int,long*,rb_encoding**,rb_encoding**); +static void tokaddmbc(struct parser_params *p, int c, rb_encoding *enc); +static enum yytokentype parse_string(struct parser_params*,rb_strterm_literal_t*); +static enum yytokentype here_document(struct parser_params*,rb_strterm_heredoc_t*); + +#define set_parser_s_value(x) (ifdef_ripper(p->s_value = (x), (void)0)) + +# define set_yylval_node(x) { \ + YYLTYPE _cur_loc; \ + rb_parser_set_location(p, &_cur_loc); \ + yylval.node = (x); \ + set_parser_s_value(STR_NEW(p->lex.ptok, p->lex.pcur-p->lex.ptok)); \ +} +# define set_yylval_str(x) \ +do { \ + set_yylval_node(NEW_STR(x, &_cur_loc)); \ + set_parser_s_value(rb_str_new_mutable_parser_string(x)); \ +} while(0) +# define set_yylval_num(x) { \ + yylval.num = (x); \ + set_parser_s_value(x); \ +} +# define set_yylval_id(x) (yylval.id = (x)) +# define set_yylval_name(x) { \ + (yylval.id = (x)); \ + set_parser_s_value(ID2SYM(x)); \ +} +# define yylval_id() (yylval.id) + +#define set_yylval_noname() set_yylval_id(keyword_nil) +#define has_delayed_token(p) (p->delayed.token != NULL) + +#ifndef RIPPER +#define literal_flush(p, ptr) ((p)->lex.ptok = (ptr)) +#define dispatch_scan_event(p, t) parser_dispatch_scan_event(p, t, __LINE__) + +static bool +parser_has_token(struct parser_params *p) +{ + const char *const pcur = p->lex.pcur; + const char *const ptok = p->lex.ptok; + if (p->keep_tokens && (pcur < ptok)) { + rb_bug("lex.pcur < lex.ptok. (line: %d) %"PRIdPTRDIFF"|%"PRIdPTRDIFF"|%"PRIdPTRDIFF"", + p->ruby_sourceline, ptok - p->lex.pbeg, pcur - ptok, p->lex.pend - pcur); + } + return pcur > ptok; +} + +static const char * +escaped_char(int c) +{ + switch (c) { + case '"': return "\\\""; + case '\\': return "\\\\"; + case '\0': return "\\0"; + case '\n': return "\\n"; + case '\r': return "\\r"; + case '\t': return "\\t"; + case '\f': return "\\f"; + case '\013': return "\\v"; + case '\010': return "\\b"; + case '\007': return "\\a"; + case '\033': return "\\e"; + case '\x7f': return "\\c?"; + } + return NULL; +} + +static rb_parser_string_t * +rb_parser_str_escape(struct parser_params *p, rb_parser_string_t *str) +{ + rb_encoding *enc = p->enc; + const char *ptr = str->ptr; + const char *pend = ptr + str->len; + const char *prev = ptr; + char charbuf[5] = {'\\', 'x', 0, 0, 0}; + rb_parser_string_t * result = rb_parser_string_new(p, 0, 0); + + while (ptr < pend) { + unsigned int c; + const char *cc; + int n = rb_enc_precise_mbclen(ptr, pend, enc); + if (!MBCLEN_CHARFOUND_P(n)) { + if (ptr > prev) parser_str_cat(result, prev, ptr - prev); + n = rb_enc_mbminlen(enc); + if (pend < ptr + n) + n = (int)(pend - ptr); + while (n--) { + c = *ptr & 0xf0 >> 4; + charbuf[2] = (c < 10) ? '0' + c : 'A' + c - 10; + c = *ptr & 0x0f; + charbuf[3] = (c < 10) ? '0' + c : 'A' + c - 10; + parser_str_cat(result, charbuf, 4); + prev = ++ptr; + } + continue; + } + n = MBCLEN_CHARFOUND_LEN(n); + c = rb_enc_mbc_to_codepoint(ptr, pend, enc); + ptr += n; + cc = escaped_char(c); + if (cc) { + if (ptr - n > prev) parser_str_cat(result, prev, ptr - n - prev); + parser_str_cat_cstr(result, cc); + prev = ptr; + } + else if (rb_enc_isascii(c, enc) && ISPRINT(c)) { + } + else { + if (ptr - n > prev) { + parser_str_cat(result, prev, ptr - n - prev); + prev = ptr - n; + } + parser_str_cat(result, prev, ptr - prev); + prev = ptr; + } + } + if (ptr > prev) parser_str_cat(result, prev, ptr - prev); + + return result; +} + +static void +parser_append_tokens(struct parser_params *p, rb_parser_string_t *str, enum yytokentype t, int line) +{ + rb_parser_ast_token_t *token = xcalloc(1, sizeof(rb_parser_ast_token_t)); + token->id = p->token_id; + token->type_name = parser_token2char(p, t); + token->str = str; + token->loc.beg_pos = p->yylloc->beg_pos; + token->loc.end_pos = p->yylloc->end_pos; + rb_parser_ary_push_ast_token(p, p->tokens, token); + p->token_id++; + + if (p->debug) { + rb_parser_string_t *str_escaped = rb_parser_str_escape(p, str); + rb_parser_printf(p, "Append tokens (line: %d) [%d, :%s, \"%s\", [%d, %d, %d, %d]]\n", + line, token->id, token->type_name, str_escaped->ptr, + token->loc.beg_pos.lineno, token->loc.beg_pos.column, + token->loc.end_pos.lineno, token->loc.end_pos.column); + rb_parser_string_free(p, str_escaped); + } +} + +static void +parser_dispatch_scan_event(struct parser_params *p, enum yytokentype t, int line) +{ + debug_token_line(p, "parser_dispatch_scan_event", line); + + if (!parser_has_token(p)) return; + + RUBY_SET_YYLLOC(*p->yylloc); + + if (p->keep_tokens) { + rb_parser_string_t *str = rb_parser_encoding_string_new(p, p->lex.ptok, p->lex.pcur - p->lex.ptok, p->enc); + parser_append_tokens(p, str, t, line); + } + + token_flush(p); +} + +#define dispatch_delayed_token(p, t) parser_dispatch_delayed_token(p, t, __LINE__) +static void +parser_dispatch_delayed_token(struct parser_params *p, enum yytokentype t, int line) +{ + debug_token_line(p, "parser_dispatch_delayed_token", line); + + if (!has_delayed_token(p)) return; -static char *tokenbuf = NULL; -static int tokidx, toksiz = 0; + RUBY_SET_YYLLOC_OF_DELAYED_TOKEN(*p->yylloc); -#define LEAVE_BS 1 + if (p->keep_tokens) { + /* p->delayed.token is freed by rb_parser_tokens_free */ + parser_append_tokens(p, p->delayed.token, t, line); + } + else { + rb_parser_string_free(p, p->delayed.token); + } -static VALUE (*lex_gets)(); /* gets function */ -static VALUE lex_input; /* non-nil if File */ -static VALUE lex_lastline; /* gc protect */ -static char *lex_pbeg; -static char *lex_p; -static char *lex_pend; + p->delayed.token = NULL; +} +#else +#define literal_flush(p, ptr) ((void)(ptr)) static int -yyerror(msg) - const char *msg; +ripper_has_scan_event(struct parser_params *p) +{ + if (p->lex.pcur < p->lex.ptok) rb_raise(rb_eRuntimeError, "lex.pcur < lex.ptok"); + return p->lex.pcur > p->lex.ptok; +} + +static VALUE +ripper_scan_event_val(struct parser_params *p, enum yytokentype t) +{ + VALUE str = STR_NEW(p->lex.ptok, p->lex.pcur - p->lex.ptok); + VALUE rval = ripper_dispatch1(p, ripper_token2eventid(t), str); + RUBY_SET_YYLLOC(*p->yylloc); + token_flush(p); + return rval; +} + +static void +ripper_dispatch_scan_event(struct parser_params *p, enum yytokentype t) +{ + if (!ripper_has_scan_event(p)) return; + + set_parser_s_value(ripper_scan_event_val(p, t)); +} +#define dispatch_scan_event(p, t) ripper_dispatch_scan_event(p, t) + +static void +ripper_dispatch_delayed_token(struct parser_params *p, enum yytokentype t) +{ + /* save and adjust the location to delayed token for callbacks */ + int saved_line = p->ruby_sourceline; + const char *saved_tokp = p->lex.ptok; + VALUE s_value, str; + + if (!has_delayed_token(p)) return; + p->ruby_sourceline = p->delayed.beg_line; + p->lex.ptok = p->lex.pbeg + p->delayed.beg_col; + str = rb_str_new_mutable_parser_string(p->delayed.token); + rb_parser_string_free(p, p->delayed.token); + s_value = ripper_dispatch1(p, ripper_token2eventid(t), str); + set_parser_s_value(s_value); + p->delayed.token = NULL; + p->ruby_sourceline = saved_line; + p->lex.ptok = saved_tokp; +} +#define dispatch_delayed_token(p, t) ripper_dispatch_delayed_token(p, t) +#endif /* RIPPER */ + +static inline int +is_identchar(struct parser_params *p, const char *ptr, const char *MAYBE_UNUSED(ptr_end), rb_encoding *enc) +{ + return rb_enc_isalnum((unsigned char)*ptr, enc) || *ptr == '_' || !ISASCII(*ptr); +} + +static inline bool +peek_word_at(struct parser_params *p, const char *str, size_t len, int at) +{ + const char *ptr = p->lex.pcur + at; + if (lex_eol_ptr_n_p(p, ptr, len-1)) return false; + if (memcmp(ptr, str, len)) return false; + if (lex_eol_ptr_n_p(p, ptr, len)) return true; + return !is_identchar(p, ptr+len, p->lex.pend, p->enc); +} + +static inline int +parser_is_identchar(struct parser_params *p) +{ + return !(p)->eofp && is_identchar(p, p->lex.pcur-1, p->lex.pend, p->enc); +} + +static inline int +parser_isascii(struct parser_params *p) { - char *p, *pe, *buf; - int len, i; + return ISASCII(*(p->lex.pcur-1)); +} - rb_compile_error("%s", msg); - p = lex_p; - while (lex_pbeg <= p) { - if (*p == '\n') break; - p--; +static void +token_info_setup(token_info *ptinfo, const char *ptr, const rb_code_location_t *loc) +{ + int column = 1, nonspc = 0, i; + for (i = 0; i < loc->beg_pos.column; i++, ptr++) { + if (*ptr == '\t') { + column = (((column - 1) / TAB_WIDTH) + 1) * TAB_WIDTH; + } + column++; + if (*ptr != ' ' && *ptr != '\t') { + nonspc = 1; + } } - p++; - pe = lex_p; - while (pe < lex_pend) { - if (*pe == '\n') break; - pe++; + ptinfo->beg = loc->beg_pos; + ptinfo->indent = column; + ptinfo->nonspc = nonspc; +} + +static void +token_info_push(struct parser_params *p, const char *token, const rb_code_location_t *loc) +{ + token_info *ptinfo; + + if (!p->token_info_enabled) return; + ptinfo = ALLOC(token_info); + ptinfo->token = token; + ptinfo->next = p->token_info; + token_info_setup(ptinfo, p->lex.pbeg, loc); + + p->token_info = ptinfo; +} + +static void +token_info_pop(struct parser_params *p, const char *token, const rb_code_location_t *loc) +{ + token_info *ptinfo_beg = p->token_info; + + if (!ptinfo_beg) return; + + /* indentation check of matched keywords (begin..end, if..end, etc.) */ + token_info_warn(p, token, ptinfo_beg, 1, loc); + + p->token_info = ptinfo_beg->next; + ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg)); +} + +static void +token_info_drop(struct parser_params *p, const char *token, rb_code_position_t beg_pos) +{ + token_info *ptinfo_beg = p->token_info; + + if (!ptinfo_beg) return; + p->token_info = ptinfo_beg->next; + + if (ptinfo_beg->beg.lineno != beg_pos.lineno || + ptinfo_beg->beg.column != beg_pos.column || + strcmp(ptinfo_beg->token, token)) { + compile_error(p, "token position mismatch: %d:%d:%s expected but %d:%d:%s", + beg_pos.lineno, beg_pos.column, token, + ptinfo_beg->beg.lineno, ptinfo_beg->beg.column, + ptinfo_beg->token); } - len = pe - p; - if (len > 4) { - buf = ALLOCA_N(char, len+2); - MEMCPY(buf, p, char, len); - buf[len] = '\0'; - rb_compile_error_append("%s", buf); + ruby_sized_xfree(ptinfo_beg, sizeof(*ptinfo_beg)); +} - i = lex_p - p; - p = buf; pe = p + len; +static void +token_info_warn(struct parser_params *p, const char *token, token_info *ptinfo_beg, int same, const rb_code_location_t *loc) +{ + token_info ptinfo_end_body, *ptinfo_end = &ptinfo_end_body; + if (!p->token_info_enabled) return; + if (!ptinfo_beg) return; + token_info_setup(ptinfo_end, p->lex.pbeg, loc); + if (ptinfo_beg->beg.lineno == ptinfo_end->beg.lineno) return; /* ignore one-line block */ + if (ptinfo_beg->nonspc || ptinfo_end->nonspc) return; /* ignore keyword in the middle of a line */ + if (ptinfo_beg->indent == ptinfo_end->indent) return; /* the indents are matched */ + if (!same && ptinfo_beg->indent < ptinfo_end->indent) return; + rb_warn3L(ptinfo_end->beg.lineno, + "mismatched indentations at '%s' with '%s' at %d", + WARN_S(token), WARN_S(ptinfo_beg->token), WARN_I(ptinfo_beg->beg.lineno)); +} - while (p < pe) { - if (*p != '\t') *p = ' '; - p++; - } - buf[i] = '^'; - buf[i+1] = '\0'; - rb_compile_error_append("%s", buf); +static int +parser_precise_mbclen(struct parser_params *p, const char *ptr) +{ + int len = rb_enc_precise_mbclen(ptr, p->lex.pend, p->enc); + if (!MBCLEN_CHARFOUND_P(len)) { + compile_error(p, "invalid multibyte char (%s)", rb_enc_name(p->enc)); + return -1; } + return len; +} + +#ifndef RIPPER +static inline void +parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc) +{ + rb_parser_string_t *str; + int lineno = p->ruby_sourceline; + if (!yylloc) { + return; + } + else if (yylloc->beg_pos.lineno == lineno) { + str = p->lex.lastline; + } + else { + return; + } + ruby_show_error_line(p, p->error_buffer, yylloc, lineno, str); +} +static int +parser_yyerror(struct parser_params *p, const rb_code_location_t *yylloc, const char *msg) +{ +#if 0 + YYLTYPE current; + + if (!yylloc) { + yylloc = RUBY_SET_YYLLOC(current); + } + else if ((p->ruby_sourceline != yylloc->beg_pos.lineno && + p->ruby_sourceline != yylloc->end_pos.lineno)) { + yylloc = 0; + } +#endif + parser_compile_error(p, yylloc, "%s", msg); + parser_show_error_line(p, yylloc); return 0; } -static int heredoc_end; -static int command_start = Qtrue; +static int +parser_yyerror0(struct parser_params *p, const char *msg) +{ + YYLTYPE current; + return parser_yyerror(p, RUBY_SET_YYLLOC(current), msg); +} -int ruby_in_compile = 0; -int ruby__end__seen; +void +ruby_show_error_line(struct parser_params *p, VALUE errbuf, const YYLTYPE *yylloc, int lineno, rb_parser_string_t *str) +{ + VALUE mesg; + const int max_line_margin = 30; + const char *ptr, *ptr_end, *pt, *pb; + const char *pre = "", *post = "", *pend; + const char *code = "", *caret = ""; + const char *lim; + const char *const pbeg = PARSER_STRING_PTR(str); + char *buf; + long len; + int i; -static VALUE ruby_debug_lines; + if (!yylloc) return; + pend = rb_parser_string_end(str); + if (pend > pbeg && pend[-1] == '\n') { + if (--pend > pbeg && pend[-1] == '\r') --pend; + } -static NODE* -yycompile(f, line) - char *f; - int line; + pt = pend; + if (lineno == yylloc->end_pos.lineno && + (pend - pbeg) > yylloc->end_pos.column) { + pt = pbeg + yylloc->end_pos.column; + } + + ptr = ptr_end = pt; + lim = ptr - pbeg > max_line_margin ? ptr - max_line_margin : pbeg; + while ((lim < ptr) && (*(ptr-1) != '\n')) ptr--; + + lim = pend - ptr_end > max_line_margin ? ptr_end + max_line_margin : pend; + while ((ptr_end < lim) && (*ptr_end != '\n') && (*ptr_end != '\r')) ptr_end++; + + len = ptr_end - ptr; + if (len > 4) { + if (ptr > pbeg) { + ptr = rb_enc_prev_char(pbeg, ptr, pt, rb_parser_str_get_encoding(str)); + if (ptr > pbeg) pre = "..."; + } + if (ptr_end < pend) { + ptr_end = rb_enc_prev_char(pt, ptr_end, pend, rb_parser_str_get_encoding(str)); + if (ptr_end < pend) post = "..."; + } + } + pb = pbeg; + if (lineno == yylloc->beg_pos.lineno) { + pb += yylloc->beg_pos.column; + if (pb > pt) pb = pt; + } + if (pb < ptr) pb = ptr; + if (len <= 4 && yylloc->beg_pos.lineno == yylloc->end_pos.lineno) { + return; + } + if (RTEST(errbuf)) { + mesg = rb_attr_get(errbuf, idMesg); + if (char_at_end(p, mesg, '\n') != '\n') + rb_str_cat_cstr(mesg, "\n"); + } + else { + mesg = rb_enc_str_new(0, 0, rb_parser_str_get_encoding(str)); + } + if (!errbuf && rb_stderr_tty_p()) { +#define CSI_BEGIN "\033[" +#define CSI_SGR "m" + rb_str_catf(mesg, + CSI_BEGIN""CSI_SGR"%s" /* pre */ + CSI_BEGIN"1"CSI_SGR"%.*s" + CSI_BEGIN"1;4"CSI_SGR"%.*s" + CSI_BEGIN";1"CSI_SGR"%.*s" + CSI_BEGIN""CSI_SGR"%s" /* post */ + "\n", + pre, + (int)(pb - ptr), ptr, + (int)(pt - pb), pb, + (int)(ptr_end - pt), pt, + post); + } + else { + char *p2; + + len = ptr_end - ptr; + lim = pt < pend ? pt : pend; + i = (int)(lim - ptr); + buf = ALLOCA_N(char, i+2); + code = ptr; + caret = p2 = buf; + if (ptr <= pb) { + while (ptr < pb) { + *p2++ = *ptr++ == '\t' ? '\t' : ' '; + } + *p2++ = '^'; + ptr++; + } + if (lim > ptr) { + memset(p2, '~', (lim - ptr)); + p2 += (lim - ptr); + } + *p2 = '\0'; + rb_str_catf(mesg, "%s%.*s%s\n""%s%s\n", + pre, (int)len, code, post, + pre, caret); + } + if (!errbuf) rb_write_error_str(mesg); +} +#else + +static int +parser_yyerror(struct parser_params *p, const YYLTYPE *yylloc, const char *msg) { - int n; - NODE *node = 0; - struct RVarmap *vp, *vars = ruby_dyna_vars; - - ruby_in_compile = 1; - if (!compile_for_eval && rb_safe_level() == 0 && - rb_const_defined(rb_cObject, rb_intern("SCRIPT_LINES__"))) { - VALUE hash, fname; - - hash = rb_const_get(rb_cObject, rb_intern("SCRIPT_LINES__")); - if (TYPE(hash) == T_HASH) { - fname = rb_str_new2(f); - ruby_debug_lines = rb_hash_aref(hash, fname); - if (NIL_P(ruby_debug_lines)) { - ruby_debug_lines = rb_ary_new(); - rb_hash_aset(hash, fname, ruby_debug_lines); - } - } - if (line > 1) { - VALUE str = rb_str_new(0,0); - while (line > 1) { - rb_ary_push(ruby_debug_lines, str); - line--; - } - } - } - - ruby__end__seen = 0; - ruby_eval_tree = 0; - heredoc_end = 0; - lex_strterm = 0; - ruby_current_node = 0; - ruby_sourcefile = rb_source_filename(f); - n = yyparse(); - ruby_debug_lines = 0; - compile_for_eval = 0; - ruby_in_compile = 0; - cond_stack = 0; - cmdarg_stack = 0; - command_start = 1; - class_nest = 0; - in_single = 0; - in_def = 0; - cur_mid = 0; - - vp = ruby_dyna_vars; - ruby_dyna_vars = vars; - lex_strterm = 0; - while (vp && vp != vars) { - struct RVarmap *tmp = vp; - vp = vp->next; - rb_gc_force_recycle((VALUE)tmp); - } - if (n == 0) node = ruby_eval_tree; - else ruby_eval_tree_begin = 0; - return node; + const char *pcur = 0, *ptok = 0; + if (p->ruby_sourceline == yylloc->beg_pos.lineno && + p->ruby_sourceline == yylloc->end_pos.lineno) { + pcur = p->lex.pcur; + ptok = p->lex.ptok; + p->lex.ptok = p->lex.pbeg + yylloc->beg_pos.column; + p->lex.pcur = p->lex.pbeg + yylloc->end_pos.column; + } + parser_yyerror0(p, msg); + if (pcur) { + p->lex.ptok = ptok; + p->lex.pcur = pcur; + } + return 0; } -static int lex_gets_ptr; +static int +parser_yyerror0(struct parser_params *p, const char *msg) +{ + dispatch1(parse_error, STR_NEW2(msg)); + ripper_error(p); + return 0; +} -static VALUE -lex_get_str(s) - VALUE s; +static inline void +parser_show_error_line(struct parser_params *p, const YYLTYPE *yylloc) { - char *beg, *end, *pend; +} +#endif /* !RIPPER */ - beg = RSTRING(s)->ptr; - if (lex_gets_ptr) { - if (RSTRING(s)->len == lex_gets_ptr) return Qnil; - beg += lex_gets_ptr; +static int +vtable_size(const struct vtable *tbl) +{ + if (!DVARS_TERMINAL_P(tbl)) { + return tbl->pos; } - pend = RSTRING(s)->ptr + RSTRING(s)->len; - end = beg; - while (end < pend) { - if (*end++ == '\n') break; + else { + return 0; } - lex_gets_ptr = end - RSTRING(s)->ptr; - return rb_str_new(beg, end - beg); } +static struct vtable * +vtable_alloc_gen(struct parser_params *p, int line, struct vtable *prev) +{ + struct vtable *tbl = ALLOC(struct vtable); + tbl->pos = 0; + tbl->capa = 8; + tbl->tbl = ALLOC_N(ID, tbl->capa); + tbl->prev = prev; +#ifndef RIPPER + if (p->debug) { + rb_parser_printf(p, "vtable_alloc:%d: %p\n", line, (void *)tbl); + } +#endif + return tbl; +} +#define vtable_alloc(prev) vtable_alloc_gen(p, __LINE__, prev) + +static void +vtable_free_gen(struct parser_params *p, int line, const char *name, + struct vtable *tbl) +{ +#ifndef RIPPER + if (p->debug) { + rb_parser_printf(p, "vtable_free:%d: %s(%p)\n", line, name, (void *)tbl); + } +#endif + if (!DVARS_TERMINAL_P(tbl)) { + if (tbl->tbl) { + ruby_sized_xfree(tbl->tbl, tbl->capa * sizeof(ID)); + } + ruby_sized_xfree(tbl, sizeof(*tbl)); + } +} +#define vtable_free(tbl) vtable_free_gen(p, __LINE__, #tbl, tbl) + +static void +vtable_add_gen(struct parser_params *p, int line, const char *name, + struct vtable *tbl, ID id) +{ +#ifndef RIPPER + if (p->debug) { + rb_parser_printf(p, "vtable_add:%d: %s(%p), %s\n", + line, name, (void *)tbl, rb_id2name(id)); + } +#endif + if (DVARS_TERMINAL_P(tbl)) { + rb_parser_fatal(p, "vtable_add: vtable is not allocated (%p)", (void *)tbl); + return; + } + if (tbl->pos == tbl->capa) { + tbl->capa = tbl->capa * 2; + SIZED_REALLOC_N(tbl->tbl, ID, tbl->capa, tbl->pos); + } + tbl->tbl[tbl->pos++] = id; +} +#define vtable_add(tbl, id) vtable_add_gen(p, __LINE__, #tbl, tbl, id) + +static void +vtable_pop_gen(struct parser_params *p, int line, const char *name, + struct vtable *tbl, int n) +{ + if (p->debug) { + rb_parser_printf(p, "vtable_pop:%d: %s(%p), %d\n", + line, name, (void *)tbl, n); + } + if (tbl->pos < n) { + rb_parser_fatal(p, "vtable_pop: unreachable (%d < %d)", tbl->pos, n); + return; + } + tbl->pos -= n; +} +#define vtable_pop(tbl, n) vtable_pop_gen(p, __LINE__, #tbl, tbl, n) + +static int +vtable_included(const struct vtable * tbl, ID id) +{ + int i; + + if (!DVARS_TERMINAL_P(tbl)) { + for (i = 0; i < tbl->pos; i++) { + if (tbl->tbl[i] == id) { + return i+1; + } + } + } + return 0; +} + +static void parser_prepare(struct parser_params *p); + +static int +e_option_supplied(struct parser_params *p) +{ + return strcmp(p->ruby_sourcefile, "-e") == 0; +} + +#ifndef RIPPER +static NODE *parser_append_options(struct parser_params *p, NODE *node); + static VALUE -lex_getline() +yycompile0(VALUE arg) { - VALUE line = (*lex_gets)(lex_input); - if (ruby_debug_lines && !NIL_P(line)) { - rb_ary_push(ruby_debug_lines, line); + int n; + NODE *tree; + struct parser_params *p = (struct parser_params *)arg; + int cov = FALSE; + + if (!compile_for_eval && !NIL_P(p->ruby_sourcefile_string) && !e_option_supplied(p)) { + cov = TRUE; + } + + if (p->debug_lines) { + p->ast->body.script_lines = p->debug_lines; } + + parser_prepare(p); +#define RUBY_DTRACE_PARSE_HOOK(name) \ + if (RUBY_DTRACE_PARSE_##name##_ENABLED()) { \ + RUBY_DTRACE_PARSE_##name(p->ruby_sourcefile, p->ruby_sourceline); \ + } + RUBY_DTRACE_PARSE_HOOK(BEGIN); + n = yyparse(p); + RUBY_DTRACE_PARSE_HOOK(END); + + p->debug_lines = 0; + + xfree(p->lex.strterm); + p->lex.strterm = 0; + p->lex.pcur = p->lex.pbeg = p->lex.pend = 0; + if (n || p->error_p) { + VALUE mesg = p->error_buffer; + if (!mesg) { + mesg = syntax_error_new(); + } + if (!p->error_tolerant) { + rb_set_errinfo(mesg); + return FALSE; + } + } + tree = p->eval_tree; + if (!tree) { + tree = NEW_NIL(&NULL_LOC); + } + else { + rb_parser_ary_t *tokens = p->tokens; + NODE *prelude; + NODE *body = parser_append_options(p, RNODE_SCOPE(tree)->nd_body); + prelude = block_append(p, p->eval_tree_begin, body); + RNODE_SCOPE(tree)->nd_body = prelude; + p->ast->body.frozen_string_literal = p->frozen_string_literal; + p->ast->body.coverage_enabled = cov; + if (p->keep_tokens) { + p->ast->node_buffer->tokens = tokens; + p->tokens = NULL; + } + } + p->ast->body.root = tree; + p->ast->body.line_count = p->line_count; + return TRUE; +} + +static rb_ast_t * +yycompile(struct parser_params *p, VALUE fname, int line) +{ + rb_ast_t *ast; + if (NIL_P(fname)) { + p->ruby_sourcefile_string = Qnil; + p->ruby_sourcefile = "(none)"; + } + else { + p->ruby_sourcefile_string = rb_str_to_interned_str(fname); + p->ruby_sourcefile = StringValueCStr(fname); + } + p->ruby_sourceline = line - 1; + + p->lvtbl = NULL; + + p->ast = ast = rb_ast_new(); + compile_callback(yycompile0, (VALUE)p); + p->ast = 0; + + while (p->lvtbl) { + local_pop(p); + } + + return ast; +} +#endif /* !RIPPER */ + +static rb_encoding * +must_be_ascii_compatible(struct parser_params *p, rb_parser_string_t *s) +{ + rb_encoding *enc = rb_parser_str_get_encoding(s); + if (!rb_enc_asciicompat(enc)) { + rb_raise(rb_eArgError, "invalid source encoding"); + } + return enc; +} + +static rb_parser_string_t * +lex_getline(struct parser_params *p) +{ + rb_parser_string_t *line = (*p->lex.gets)(p, p->lex.input, p->line_count); + if (!line) return 0; + p->line_count++; + string_buffer_append(p, line); + must_be_ascii_compatible(p, line); return line; } -NODE* -rb_compile_string(f, s, line) - const char *f; - VALUE s; - int line; +#ifndef RIPPER +rb_ast_t* +rb_parser_compile(rb_parser_t *p, rb_parser_lex_gets_func *gets, VALUE fname, rb_parser_input_data input, int line) { - lex_gets = lex_get_str; - lex_gets_ptr = 0; - lex_input = s; - lex_pbeg = lex_p = lex_pend = 0; - ruby_sourceline = line - 1; - compile_for_eval = ruby_in_eval; + p->lex.gets = gets; + p->lex.input = input; + p->lex.pbeg = p->lex.pcur = p->lex.pend = 0; - return yycompile(f, line); + return yycompile(p, fname, line); } +#endif /* !RIPPER */ -NODE* -rb_compile_cstr(f, s, len, line) - const char *f, *s; - int len, line; +#define STR_FUNC_ESCAPE 0x01 +#define STR_FUNC_EXPAND 0x02 +#define STR_FUNC_REGEXP 0x04 +#define STR_FUNC_QWORDS 0x08 +#define STR_FUNC_SYMBOL 0x10 +#define STR_FUNC_INDENT 0x20 +#define STR_FUNC_LABEL 0x40 +#define STR_FUNC_LIST 0x4000 +#define STR_FUNC_TERM 0x8000 + +enum string_type { + str_label = STR_FUNC_LABEL, + str_squote = (0), + str_dquote = (STR_FUNC_EXPAND), + str_xquote = (STR_FUNC_EXPAND), + str_regexp = (STR_FUNC_REGEXP|STR_FUNC_ESCAPE|STR_FUNC_EXPAND), + str_sword = (STR_FUNC_QWORDS|STR_FUNC_LIST), + str_dword = (STR_FUNC_QWORDS|STR_FUNC_EXPAND|STR_FUNC_LIST), + str_ssym = (STR_FUNC_SYMBOL), + str_dsym = (STR_FUNC_SYMBOL|STR_FUNC_EXPAND) +}; + +static rb_parser_string_t * +parser_str_new(struct parser_params *p, const char *ptr, long len, rb_encoding *enc, int func, rb_encoding *enc0) { - return rb_compile_string(f, rb_str_new(s, len), line); + rb_parser_string_t *pstr; + + pstr = rb_parser_encoding_string_new(p, ptr, len, enc); + + if (!(func & STR_FUNC_REGEXP)) { + if (rb_parser_is_ascii_string(p, pstr)) { + } + else if (rb_is_usascii_enc((void *)enc0) && enc != rb_utf8_encoding()) { + /* everything is valid in ASCII-8BIT */ + enc = rb_ascii8bit_encoding(); + PARSER_ENCODING_CODERANGE_SET(pstr, enc, RB_PARSER_ENC_CODERANGE_VALID); + } + } + + return pstr; +} + +static int +strterm_is_heredoc(rb_strterm_t *strterm) +{ + return strterm->heredoc; +} + +static rb_strterm_t * +new_strterm(struct parser_params *p, int func, int term, int paren) +{ + rb_strterm_t *strterm = ZALLOC(rb_strterm_t); + strterm->u.literal.func = func; + strterm->u.literal.term = term; + strterm->u.literal.paren = paren; + return strterm; +} + +static rb_strterm_t * +new_heredoc(struct parser_params *p) +{ + rb_strterm_t *strterm = ZALLOC(rb_strterm_t); + strterm->heredoc = true; + return strterm; +} + +#define peek(p,c) peek_n(p, (c), 0) +#define peek_n(p,c,n) (!lex_eol_n_p(p, n) && (c) == (unsigned char)(p)->lex.pcur[n]) +#define peekc(p) peekc_n(p, 0) +#define peekc_n(p,n) (lex_eol_n_p(p, n) ? -1 : (unsigned char)(p)->lex.pcur[n]) + +#define add_delayed_token(p, tok, end) parser_add_delayed_token(p, tok, end, __LINE__) +static void +parser_add_delayed_token(struct parser_params *p, const char *tok, const char *end, int line) +{ + debug_token_line(p, "add_delayed_token", line); + + if (tok < end) { + if (has_delayed_token(p)) { + bool next_line = parser_string_char_at_end(p, p->delayed.token, 0) == '\n'; + int end_line = (next_line ? 1 : 0) + p->delayed.end_line; + int end_col = (next_line ? 0 : p->delayed.end_col); + if (end_line != p->ruby_sourceline || end_col != tok - p->lex.pbeg) { + dispatch_delayed_token(p, tSTRING_CONTENT); + } + } + if (!has_delayed_token(p)) { + p->delayed.token = rb_parser_string_new(p, 0, 0); + rb_parser_enc_associate(p, p->delayed.token, p->enc); + p->delayed.beg_line = p->ruby_sourceline; + p->delayed.beg_col = rb_long2int(tok - p->lex.pbeg); + } + parser_str_cat(p->delayed.token, tok, end - tok); + p->delayed.end_line = p->ruby_sourceline; + p->delayed.end_col = rb_long2int(end - p->lex.pbeg); + p->lex.ptok = end; + } } -NODE* -rb_compile_file(f, file, start) - const char *f; - VALUE file; - int start; +static void +set_lastline(struct parser_params *p, rb_parser_string_t *str) { - lex_gets = rb_io_gets; - lex_input = file; - lex_pbeg = lex_p = lex_pend = 0; - ruby_sourceline = start - 1; + p->lex.pbeg = p->lex.pcur = PARSER_STRING_PTR(str); + p->lex.pend = p->lex.pcur + PARSER_STRING_LEN(str); + p->lex.lastline = str; +} + +static int +nextline(struct parser_params *p, int set_encoding) +{ + rb_parser_string_t *str = p->lex.nextline; + p->lex.nextline = 0; + if (!str) { + if (p->eofp) + return -1; + + if (!lex_eol_ptr_p(p, p->lex.pbeg) && *(p->lex.pend-1) != '\n') { + goto end_of_input; + } + + if (!p->lex.input || !(str = lex_getline(p))) { + end_of_input: + p->eofp = 1; + lex_goto_eol(p); + return -1; + } +#ifndef RIPPER + if (p->debug_lines) { + if (set_encoding) rb_parser_enc_associate(p, str, p->enc); + rb_parser_string_t *copy = rb_parser_string_deep_copy(p, str); + rb_parser_ary_push_script_line(p, p->debug_lines, copy); + } +#endif + p->cr_seen = FALSE; + } + else if (str == AFTER_HEREDOC_WITHOUT_TERMINATOR) { + /* after here-document without terminator */ + goto end_of_input; + } + add_delayed_token(p, p->lex.ptok, p->lex.pend); + if (p->heredoc_end > 0) { + p->ruby_sourceline = p->heredoc_end; + p->heredoc_end = 0; + } + p->ruby_sourceline++; + set_lastline(p, str); + token_flush(p); + return 0; +} - return yycompile(f, start); +static int +parser_cr(struct parser_params *p, int c) +{ + if (peek(p, '\n')) { + p->lex.pcur++; + c = '\n'; + } + return c; } static inline int -nextc() +nextc0(struct parser_params *p, int set_encoding) { int c; - if (lex_p == lex_pend) { - if (lex_input) { - VALUE v = lex_getline(); - - if (NIL_P(v)) return -1; - if (heredoc_end > 0) { - ruby_sourceline = heredoc_end; - heredoc_end = 0; - } - ruby_sourceline++; - lex_pbeg = lex_p = RSTRING(v)->ptr; - lex_pend = lex_p + RSTRING(v)->len; - lex_lastline = v; - } - else { - lex_lastline = 0; - return -1; - } - } - c = (unsigned char)*lex_p++; - if (c == '\r' && lex_p < lex_pend && *lex_p == '\n') { - lex_p++; - c = '\n'; + if (UNLIKELY(lex_eol_p(p) || p->eofp || p->lex.nextline > AFTER_HEREDOC_WITHOUT_TERMINATOR)) { + if (nextline(p, set_encoding)) return -1; + } + c = (unsigned char)*p->lex.pcur++; + if (UNLIKELY(c == '\r')) { + c = parser_cr(p, c); } return c; } +#define nextc(p) nextc0(p, TRUE) static void -pushback(c) - int c; +pushback(struct parser_params *p, int c) { if (c == -1) return; - lex_p--; + p->eofp = 0; + p->lex.pcur--; + if (p->lex.pcur > p->lex.pbeg && p->lex.pcur[0] == '\n' && p->lex.pcur[-1] == '\r') { + p->lex.pcur--; + } } -#define was_bol() (lex_p == lex_pbeg + 1) -#define peek(c) (lex_p != lex_pend && (c) == *lex_p) +#define was_bol(p) ((p)->lex.pcur == (p)->lex.pbeg + 1) -#define tokfix() (tokenbuf[tokidx]='\0') -#define tok() tokenbuf -#define toklen() tokidx -#define toklast() (tokidx>0?tokenbuf[tokidx-1]:0) +#define tokfix(p) ((p)->tokenbuf[(p)->tokidx]='\0') +#define tok(p) (p)->tokenbuf +#define toklen(p) (p)->tokidx + +static int +looking_at_eol_p(struct parser_params *p) +{ + const char *ptr = p->lex.pcur; + while (!lex_eol_ptr_p(p, ptr)) { + int c = (unsigned char)*ptr++; + int eol = (c == '\n' || c == '#'); + if (eol || !ISSPACE(c)) { + return eol; + } + } + return TRUE; +} static char* -newtok() +newtok(struct parser_params *p) { - tokidx = 0; - if (!tokenbuf) { - toksiz = 60; - tokenbuf = ALLOC_N(char, 60); + p->tokidx = 0; + if (!p->tokenbuf) { + p->toksiz = 60; + p->tokenbuf = ALLOC_N(char, 60); } - if (toksiz > 4096) { - toksiz = 60; - REALLOC_N(tokenbuf, char, 60); + if (p->toksiz > 4096) { + p->toksiz = 60; + REALLOC_N(p->tokenbuf, char, 60); + } + return p->tokenbuf; +} + +static char * +tokspace(struct parser_params *p, int n) +{ + p->tokidx += n; + + if (p->tokidx >= p->toksiz) { + do {p->toksiz *= 2;} while (p->toksiz < p->tokidx); + REALLOC_N(p->tokenbuf, char, p->toksiz); } - return tokenbuf; + return &p->tokenbuf[p->tokidx-n]; } static void -tokadd(c) - char c; +tokadd(struct parser_params *p, int c) { - tokenbuf[tokidx++] = c; - if (tokidx >= toksiz) { - toksiz *= 2; - REALLOC_N(tokenbuf, char, toksiz); + p->tokenbuf[p->tokidx++] = (char)c; + if (p->tokidx >= p->toksiz) { + p->toksiz *= 2; + REALLOC_N(p->tokenbuf, char, p->toksiz); } } static int -read_escape() +tok_hex(struct parser_params *p, size_t *numlen) { int c; - switch (c = nextc()) { + c = (int)ruby_scan_hex(p->lex.pcur, 2, numlen); + if (!*numlen) { + flush_string_content(p, p->enc, rb_strlen_lit("\\x")); + yyerror0("invalid hex escape"); + dispatch_scan_event(p, tSTRING_CONTENT); + return 0; + } + p->lex.pcur += *numlen; + return c; +} + +#define tokcopy(p, n) memcpy(tokspace(p, n), (p)->lex.pcur - (n), (n)) + +static int +escaped_control_code(int c) +{ + int c2 = 0; + switch (c) { + case ' ': + c2 = 's'; + break; + case '\n': + c2 = 'n'; + break; + case '\t': + c2 = 't'; + break; + case '\v': + c2 = 'v'; + break; + case '\r': + c2 = 'r'; + break; + case '\f': + c2 = 'f'; + break; + } + return c2; +} + +#define WARN_SPACE_CHAR(c, prefix) \ + rb_warn1("invalid character syntax; use "prefix"\\%c", WARN_I(c)) + +static int +tokadd_codepoint(struct parser_params *p, rb_encoding **encp, + int regexp_literal, const char *begin) +{ + const int wide = !begin; + size_t numlen; + int codepoint = (int)ruby_scan_hex(p->lex.pcur, wide ? p->lex.pend - p->lex.pcur : 4, &numlen); + + p->lex.pcur += numlen; + if (p->lex.strterm == NULL || + strterm_is_heredoc(p->lex.strterm) || + (p->lex.strterm->u.literal.func != str_regexp)) { + if (!begin) begin = p->lex.pcur; + if (wide ? (numlen == 0 || numlen > 6) : (numlen < 4)) { + flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin); + yyerror0("invalid Unicode escape"); + dispatch_scan_event(p, tSTRING_CONTENT); + return wide && numlen > 0; + } + if (codepoint > 0x10ffff) { + flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin); + yyerror0("invalid Unicode codepoint (too large)"); + dispatch_scan_event(p, tSTRING_CONTENT); + return wide; + } + if ((codepoint & 0xfffff800) == 0xd800) { + flush_string_content(p, rb_utf8_encoding(), p->lex.pcur - begin); + yyerror0("invalid Unicode codepoint"); + dispatch_scan_event(p, tSTRING_CONTENT); + return wide; + } + } + if (regexp_literal) { + tokcopy(p, (int)numlen); + } + else if (codepoint >= 0x80) { + rb_encoding *utf8 = rb_utf8_encoding(); + if (*encp && utf8 != *encp) { + YYLTYPE loc = RUBY_INIT_YYLLOC(); + compile_error(p, "UTF-8 mixed within %s source", rb_enc_name(*encp)); + parser_show_error_line(p, &loc); + return wide; + } + *encp = utf8; + tokaddmbc(p, codepoint, *encp); + } + else { + tokadd(p, codepoint); + } + return TRUE; +} + +static int tokadd_mbchar(struct parser_params *p, int c); + +static int +tokskip_mbchar(struct parser_params *p) +{ + int len = parser_precise_mbclen(p, p->lex.pcur-1); + if (len > 0) { + p->lex.pcur += len - 1; + } + return len; +} + +/* return value is for ?\u3042 */ +static void +tokadd_utf8(struct parser_params *p, rb_encoding **encp, + int term, int symbol_literal, int regexp_literal) +{ + /* + * If `term` is not -1, then we allow multiple codepoints in \u{} + * upto `term` byte, otherwise we're parsing a character literal. + * And then add the codepoints to the current token. + */ + static const char multiple_codepoints[] = "Multiple codepoints at single character literal"; + + const int open_brace = '{', close_brace = '}'; + + if (regexp_literal) { tokadd(p, '\\'); tokadd(p, 'u'); } + + if (peek(p, open_brace)) { /* handle \u{...} form */ + if (regexp_literal && p->lex.strterm->u.literal.func == str_regexp) { + /* + * Skip parsing validation code and copy bytes as-is until term or + * closing brace, in order to correctly handle extended regexps where + * invalid unicode escapes are allowed in comments. The regexp parser + * does its own validation and will catch any issues. + */ + tokadd(p, open_brace); + while (!lex_eol_ptr_p(p, ++p->lex.pcur)) { + int c = peekc(p); + if (c == close_brace) { + tokadd(p, c); + ++p->lex.pcur; + break; + } + else if (c == term) { + break; + } + if (c == '\\' && !lex_eol_n_p(p, 1)) { + tokadd(p, c); + c = *++p->lex.pcur; + } + tokadd_mbchar(p, c); + } + } + else { + const char *second = NULL; + int c, last = nextc(p); + if (lex_eol_p(p)) goto unterminated; + while (ISSPACE(c = peekc(p)) && !lex_eol_ptr_p(p, ++p->lex.pcur)); + while (c != close_brace) { + if (c == term) goto unterminated; + if (second == multiple_codepoints) + second = p->lex.pcur; + if (regexp_literal) tokadd(p, last); + if (!tokadd_codepoint(p, encp, regexp_literal, NULL)) { + break; + } + while (ISSPACE(c = peekc(p))) { + if (lex_eol_ptr_p(p, ++p->lex.pcur)) goto unterminated; + last = c; + } + if (term == -1 && !second) + second = multiple_codepoints; + } + + if (c != close_brace) { + unterminated: + flush_string_content(p, rb_utf8_encoding(), 0); + yyerror0("unterminated Unicode escape"); + dispatch_scan_event(p, tSTRING_CONTENT); + return; + } + if (second && second != multiple_codepoints) { + const char *pcur = p->lex.pcur; + p->lex.pcur = second; + dispatch_scan_event(p, tSTRING_CONTENT); + token_flush(p); + p->lex.pcur = pcur; + yyerror0(multiple_codepoints); + token_flush(p); + } + + if (regexp_literal) tokadd(p, close_brace); + nextc(p); + } + } + else { /* handle \uxxxx form */ + if (!tokadd_codepoint(p, encp, regexp_literal, p->lex.pcur - rb_strlen_lit("\\u"))) { + token_flush(p); + return; + } + } +} + +#define ESCAPE_CONTROL 1 +#define ESCAPE_META 2 + +static int +read_escape(struct parser_params *p, int flags, const char *begin) +{ + int c; + size_t numlen; + + switch (c = nextc(p)) { case '\\': /* Backslash */ - return c; + return c; case 'n': /* newline */ - return '\n'; + return '\n'; case 't': /* horizontal tab */ - return '\t'; + return '\t'; case 'r': /* carriage-return */ - return '\r'; + return '\r'; case 'f': /* form-feed */ - return '\f'; + return '\f'; case 'v': /* vertical tab */ - return '\13'; + return '\13'; case 'a': /* alarm(bell) */ - return '\007'; + return '\007'; case 'e': /* escape */ - return 033; + return 033; case '0': case '1': case '2': case '3': /* octal constant */ case '4': case '5': case '6': case '7': - { - int numlen; - - pushback(c); - c = scan_oct(lex_p, 3, &numlen); - lex_p += numlen; - } - return c; + pushback(p, c); + c = (int)ruby_scan_oct(p->lex.pcur, 3, &numlen); + p->lex.pcur += numlen; + return c; case 'x': /* hex constant */ - { - int numlen; - - c = scan_hex(lex_p, 2, &numlen); - if (numlen == 0) { - yyerror("Invalid escape character syntax"); - return 0; - } - lex_p += numlen; - } - return c; + c = tok_hex(p, &numlen); + if (numlen == 0) return 0; + return c; case 'b': /* backspace */ - return '\010'; + return '\010'; case 's': /* space */ - return ' '; + return ' '; case 'M': - if ((c = nextc()) != '-') { - yyerror("Invalid escape character syntax"); - pushback(c); - return '\0'; - } - if ((c = nextc()) == '\\') { - return read_escape() | 0x80; - } - else if (c == -1) goto eof; - else { - return ((c & 0xff) | 0x80); - } + if (flags & ESCAPE_META) goto eof; + if ((c = nextc(p)) != '-') { + goto eof; + } + if ((c = nextc(p)) == '\\') { + switch (peekc(p)) { + case 'u': case 'U': + nextc(p); + goto eof; + } + return read_escape(p, flags|ESCAPE_META, begin) | 0x80; + } + else if (c == -1) goto eof; + else if (!ISASCII(c)) { + tokskip_mbchar(p); + goto eof; + } + else { + int c2 = escaped_control_code(c); + if (c2) { + if (ISCNTRL(c) || !(flags & ESCAPE_CONTROL)) { + WARN_SPACE_CHAR(c2, "\\M-"); + } + else { + WARN_SPACE_CHAR(c2, "\\C-\\M-"); + } + } + else if (ISCNTRL(c)) goto eof; + return ((c & 0xff) | 0x80); + } case 'C': - if ((c = nextc()) != '-') { - yyerror("Invalid escape character syntax"); - pushback(c); - return '\0'; - } + if ((c = nextc(p)) != '-') { + goto eof; + } case 'c': - if ((c = nextc())== '\\') { - c = read_escape(); - } - else if (c == '?') - return 0177; - else if (c == -1) goto eof; - return c & 0x9f; + if (flags & ESCAPE_CONTROL) goto eof; + if ((c = nextc(p))== '\\') { + switch (peekc(p)) { + case 'u': case 'U': + nextc(p); + goto eof; + } + c = read_escape(p, flags|ESCAPE_CONTROL, begin); + } + else if (c == '?') + return 0177; + else if (c == -1) goto eof; + else if (!ISASCII(c)) { + tokskip_mbchar(p); + goto eof; + } + else { + int c2 = escaped_control_code(c); + if (c2) { + if (ISCNTRL(c)) { + if (flags & ESCAPE_META) { + WARN_SPACE_CHAR(c2, "\\M-"); + } + else { + WARN_SPACE_CHAR(c2, ""); + } + } + else { + if (flags & ESCAPE_META) { + WARN_SPACE_CHAR(c2, "\\M-\\C-"); + } + else { + WARN_SPACE_CHAR(c2, "\\C-"); + } + } + } + else if (ISCNTRL(c)) goto eof; + } + return c & 0x9f; eof: case -1: - yyerror("Invalid escape character syntax"); - return '\0'; + flush_string_content(p, p->enc, p->lex.pcur - begin); + yyerror0("Invalid escape character syntax"); + dispatch_scan_event(p, tSTRING_CONTENT); + return '\0'; default: - return c; + if (!ISASCII(c)) { + tokskip_mbchar(p); + goto eof; + } + return c; } } +static void +tokaddmbc(struct parser_params *p, int c, rb_encoding *enc) +{ + int len = rb_enc_codelen(c, enc); + rb_enc_mbcput(c, tokspace(p, len), enc); +} + static int -tokadd_escape(term) - int term; +tokadd_escape(struct parser_params *p) { int c; + size_t numlen; + const char *begin = p->lex.pcur; - switch (c = nextc()) { + switch (c = nextc(p)) { case '\n': - return 0; /* just ignore */ + return 0; /* just ignore */ case '0': case '1': case '2': case '3': /* octal constant */ case '4': case '5': case '6': case '7': - { - int i; - - tokadd('\\'); - tokadd(c); - for (i=0; i<2; i++) { - c = nextc(); - if (c == -1) goto eof; - if (c < '0' || '7' < c) { - pushback(c); - break; - } - tokadd(c); - } - } - return 0; + { + ruby_scan_oct(--p->lex.pcur, 3, &numlen); + if (numlen == 0) goto eof; + p->lex.pcur += numlen; + tokcopy(p, (int)numlen + 1); + } + return 0; case 'x': /* hex constant */ - { - int numlen; - - tokadd('\\'); - tokadd(c); - scan_hex(lex_p, 2, &numlen); - if (numlen == 0) { - yyerror("Invalid escape character syntax"); - return -1; - } - while (numlen--) - tokadd(nextc()); - } - return 0; - - case 'M': - if ((c = nextc()) != '-') { - yyerror("Invalid escape character syntax"); - pushback(c); - return 0; - } - tokadd('\\'); tokadd('M'); tokadd('-'); - goto escaped; - - case 'C': - if ((c = nextc()) != '-') { - yyerror("Invalid escape character syntax"); - pushback(c); - return 0; - } - tokadd('\\'); tokadd('C'); tokadd('-'); - goto escaped; - - case 'c': - tokadd('\\'); tokadd('c'); - escaped: - if ((c = nextc()) == '\\') { - return tokadd_escape(term); - } - else if (c == -1) goto eof; - tokadd(c); - return 0; + { + tok_hex(p, &numlen); + if (numlen == 0) return -1; + tokcopy(p, (int)numlen + 2); + } + return 0; eof: case -1: - yyerror("Invalid escape character syntax"); - return -1; + flush_string_content(p, p->enc, p->lex.pcur - begin); + yyerror0("Invalid escape character syntax"); + token_flush(p); + return -1; default: - if (c != '\\' || c != term) - tokadd('\\'); - tokadd(c); + tokadd(p, '\\'); + tokadd(p, c); } return 0; } static int -regx_options() +char_to_option(int c) +{ + int val; + + switch (c) { + case 'i': + val = RE_ONIG_OPTION_IGNORECASE; + break; + case 'x': + val = RE_ONIG_OPTION_EXTEND; + break; + case 'm': + val = RE_ONIG_OPTION_MULTILINE; + break; + default: + val = 0; + break; + } + return val; +} + +#define ARG_ENCODING_FIXED 16 +#define ARG_ENCODING_NONE 32 +#define ENC_ASCII8BIT 1 +#define ENC_EUC_JP 2 +#define ENC_Windows_31J 3 +#define ENC_UTF8 4 + +static int +char_to_option_kcode(int c, int *option, int *kcode) +{ + *option = 0; + + switch (c) { + case 'n': + *kcode = ENC_ASCII8BIT; + return (*option = ARG_ENCODING_NONE); + case 'e': + *kcode = ENC_EUC_JP; + break; + case 's': + *kcode = ENC_Windows_31J; + break; + case 'u': + *kcode = ENC_UTF8; + break; + default: + *kcode = -1; + return (*option = char_to_option(c)); + } + *option = ARG_ENCODING_FIXED; + return 1; +} + +static int +regx_options(struct parser_params *p) { - char kcode = 0; + int kcode = 0; + int kopt = 0; int options = 0; - int c; + int c, opt, kc; - newtok(); - while (c = nextc(), ISALPHA(c)) { - switch (c) { - case 'i': - options |= RE_OPTION_IGNORECASE; - break; - case 'x': - options |= RE_OPTION_EXTENDED; - break; - case 'm': - options |= RE_OPTION_MULTILINE; - break; - case 'o': - options |= RE_OPTION_ONCE; - break; - case 'n': - kcode = 16; - break; - case 'e': - kcode = 32; - break; - case 's': - kcode = 48; - break; - case 'u': - kcode = 64; - break; - default: - tokadd(c); - break; - } - } - pushback(c); - if (toklen()) { - tokfix(); - rb_compile_error("unknown regexp option%s - %s", - toklen() > 1 ? "s" : "", tok()); - } - return options | kcode; + newtok(p); + while (c = nextc(p), ISALPHA(c)) { + if (c == 'o') { + options |= RE_OPTION_ONCE; + } + else if (char_to_option_kcode(c, &opt, &kc)) { + if (kc >= 0) { + if (kc != ENC_ASCII8BIT) kcode = c; + kopt = opt; + } + else { + options |= opt; + } + } + else { + tokadd(p, c); + } + } + options |= kopt; + pushback(p, c); + if (toklen(p)) { + YYLTYPE loc = RUBY_INIT_YYLLOC(); + tokfix(p); + compile_error(p, "unknown regexp option%s - %*s", + toklen(p) > 1 ? "s" : "", toklen(p), tok(p)); + parser_show_error_line(p, &loc); + } + return options | RE_OPTION_ENCODING(kcode); } -#define STR_FUNC_ESCAPE 0x01 -#define STR_FUNC_EXPAND 0x02 -#define STR_FUNC_REGEXP 0x04 -#define STR_FUNC_QWORDS 0x08 -#define STR_FUNC_SYMBOL 0x10 -#define STR_FUNC_INDENT 0x20 +static int +tokadd_mbchar(struct parser_params *p, int c) +{ + int len = parser_precise_mbclen(p, p->lex.pcur-1); + if (len < 0) return -1; + tokadd(p, c); + p->lex.pcur += --len; + if (len > 0) tokcopy(p, len); + return c; +} -enum string_type { - str_squote = (0), - str_dquote = (STR_FUNC_EXPAND), - str_xquote = (STR_FUNC_EXPAND), - str_regexp = (STR_FUNC_REGEXP|STR_FUNC_ESCAPE|STR_FUNC_EXPAND), - str_sword = (STR_FUNC_QWORDS), - str_dword = (STR_FUNC_QWORDS|STR_FUNC_EXPAND), - str_ssym = (STR_FUNC_SYMBOL), - str_dsym = (STR_FUNC_SYMBOL|STR_FUNC_EXPAND), -}; +static inline int +simple_re_meta(int c) +{ + switch (c) { + case '$': case '*': case '+': case '.': + case '?': case '^': case '|': + case ')': case ']': case '}': case '>': + return TRUE; + default: + return FALSE; + } +} + +static int +parser_update_heredoc_indent(struct parser_params *p, int c) +{ + if (p->heredoc_line_indent == -1) { + if (c == '\n') p->heredoc_line_indent = 0; + } + else { + if (c == ' ') { + p->heredoc_line_indent++; + return TRUE; + } + else if (c == '\t') { + int w = (p->heredoc_line_indent / TAB_WIDTH) + 1; + p->heredoc_line_indent = w * TAB_WIDTH; + return TRUE; + } + else if (c != '\n') { + if (p->heredoc_indent > p->heredoc_line_indent) { + p->heredoc_indent = p->heredoc_line_indent; + } + p->heredoc_line_indent = -1; + } + else { + /* Whitespace only line has no indentation */ + p->heredoc_line_indent = 0; + } + } + return FALSE; +} static void -dispose_string(str) - VALUE str; +parser_mixed_error(struct parser_params *p, rb_encoding *enc1, rb_encoding *enc2) { - free(RSTRING(str)->ptr); - rb_gc_force_recycle(str); + YYLTYPE loc = RUBY_INIT_YYLLOC(); + const char *n1 = rb_enc_name(enc1), *n2 = rb_enc_name(enc2); + compile_error(p, "%s mixed within %s source", n1, n2); + parser_show_error_line(p, &loc); +} + +static void +parser_mixed_escape(struct parser_params *p, const char *beg, rb_encoding *enc1, rb_encoding *enc2) +{ + const char *pos = p->lex.pcur; + p->lex.pcur = beg; + parser_mixed_error(p, enc1, enc2); + p->lex.pcur = pos; +} + +static inline char +nibble_char_upper(unsigned int c) +{ + c &= 0xf; + return c + (c < 10 ? '0' : 'A' - 10); } static int -tokadd_string(func, term, paren, nest) - int func, term, paren, *nest; +tokadd_string(struct parser_params *p, + int func, int term, int paren, long *nest, + rb_encoding **encp, rb_encoding **enc) { int c; + bool erred = false; +#ifdef RIPPER + const int heredoc_end = (p->heredoc_end ? p->heredoc_end + 1 : 0); + int top_of_line = FALSE; +#endif - while ((c = nextc()) != -1) { - if (paren && c == paren) { - ++*nest; - } - else if (c == term) { - if (!nest || !*nest) { - pushback(c); - break; - } - --*nest; - } - else if ((func & STR_FUNC_EXPAND) && c == '#' && lex_p < lex_pend) { - int c2 = *lex_p; - if (c2 == '$' || c2 == '@' || c2 == '{') { - pushback(c); - break; - } - } - else if (c == '\\') { - c = nextc(); - switch (c) { - case '\n': - if (func & STR_FUNC_QWORDS) break; - if (func & STR_FUNC_EXPAND) continue; - tokadd('\\'); - break; - - case '\\': - if (func & STR_FUNC_ESCAPE) tokadd(c); - break; - - default: - if (func & STR_FUNC_REGEXP) { - pushback(c); - if (tokadd_escape(term) < 0) - return -1; - continue; - } - else if (func & STR_FUNC_EXPAND) { - pushback(c); - if (func & STR_FUNC_ESCAPE) tokadd('\\'); - c = read_escape(); - } - else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) { - /* ignore backslashed spaces in %w */ - } - else if (c != term && !(paren && c == paren)) { - tokadd('\\'); - } - } - } - else if (ismbchar(c)) { - int i, len = mbclen(c)-1; - - for (i = 0; i < len; i++) { - tokadd(c); - c = nextc(); - } - } - else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) { - pushback(c); - break; - } - if (!c && (func & STR_FUNC_SYMBOL)) { - func &= ~STR_FUNC_SYMBOL; - rb_compile_error("symbol cannot contain '\\0'"); - continue; - } - tokadd(c); +#define mixed_error(enc1, enc2) \ + (void)(erred || (parser_mixed_error(p, enc1, enc2), erred = true)) +#define mixed_escape(beg, enc1, enc2) \ + (void)(erred || (parser_mixed_escape(p, beg, enc1, enc2), erred = true)) + + while ((c = nextc(p)) != -1) { + if (p->heredoc_indent > 0) { + parser_update_heredoc_indent(p, c); + } +#ifdef RIPPER + if (top_of_line && heredoc_end == p->ruby_sourceline) { + pushback(p, c); + break; + } +#endif + + if (paren && c == paren) { + ++*nest; + } + else if (c == term) { + if (!nest || !*nest) { + pushback(p, c); + break; + } + --*nest; + } + else if ((func & STR_FUNC_EXPAND) && c == '#' && !lex_eol_p(p)) { + unsigned char c2 = *p->lex.pcur; + if (c2 == '$' || c2 == '@' || c2 == '{') { + pushback(p, c); + break; + } + } + else if (c == '\\') { + c = nextc(p); + switch (c) { + case '\n': + if (func & STR_FUNC_QWORDS) break; + if (func & STR_FUNC_EXPAND) { + if (!(func & STR_FUNC_INDENT) || (p->heredoc_indent < 0)) + continue; + if (c == term) { + c = '\\'; + goto terminate; + } + } + tokadd(p, '\\'); + break; + + case '\\': + if (func & STR_FUNC_ESCAPE) tokadd(p, c); + break; + + case 'u': + if ((func & STR_FUNC_EXPAND) == 0) { + tokadd(p, '\\'); + break; + } + tokadd_utf8(p, enc, term, + func & STR_FUNC_SYMBOL, + func & STR_FUNC_REGEXP); + continue; + + default: + if (c == -1) return -1; + if (!ISASCII(c)) { + if ((func & STR_FUNC_EXPAND) == 0) tokadd(p, '\\'); + goto non_ascii; + } + if (func & STR_FUNC_REGEXP) { + switch (c) { + case 'c': + case 'C': + case 'M': { + pushback(p, c); + c = read_escape(p, 0, p->lex.pcur - 1); + + char *t = tokspace(p, rb_strlen_lit("\\x00")); + *t++ = '\\'; + *t++ = 'x'; + *t++ = nibble_char_upper(c >> 4); + *t++ = nibble_char_upper(c); + continue; + } + } + + if (c == term && !simple_re_meta(c)) { + tokadd(p, c); + continue; + } + pushback(p, c); + if ((c = tokadd_escape(p)) < 0) + return -1; + if (*enc && *enc != *encp) { + mixed_escape(p->lex.ptok+2, *enc, *encp); + } + continue; + } + else if (func & STR_FUNC_EXPAND) { + pushback(p, c); + if (func & STR_FUNC_ESCAPE) tokadd(p, '\\'); + c = read_escape(p, 0, p->lex.pcur - 1); + } + else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) { + /* ignore backslashed spaces in %w */ + } + else if (c != term && !(paren && c == paren)) { + tokadd(p, '\\'); + pushback(p, c); + continue; + } + } + } + else if (!parser_isascii(p)) { + non_ascii: + if (!*enc) { + *enc = *encp; + } + else if (*enc != *encp) { + mixed_error(*enc, *encp); + continue; + } + if (tokadd_mbchar(p, c) == -1) return -1; + continue; + } + else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) { + pushback(p, c); + break; + } + if (c & 0x80) { + if (!*enc) { + *enc = *encp; + } + else if (*enc != *encp) { + mixed_error(*enc, *encp); + continue; + } + } + tokadd(p, c); +#ifdef RIPPER + top_of_line = (c == '\n'); +#endif } + terminate: + if (*enc) *encp = *enc; return c; } -#define NEW_STRTERM(func, term, paren) \ - rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0) +#define NEW_STRTERM(func, term, paren) new_strterm(p, func, term, paren) -static int -parse_string(quote) - NODE *quote; +static void +flush_string_content(struct parser_params *p, rb_encoding *enc, size_t back) { - int func = quote->nd_func; - int term = nd_term(quote); - int paren = nd_paren(quote); - int c, space = 0; + p->lex.pcur -= back; + if (has_delayed_token(p)) { + ptrdiff_t len = p->lex.pcur - p->lex.ptok; + if (len > 0) { + rb_parser_enc_str_buf_cat(p, p->delayed.token, p->lex.ptok, len, enc); + p->delayed.end_line = p->ruby_sourceline; + p->delayed.end_col = rb_long2int(p->lex.pcur - p->lex.pbeg); + } + dispatch_delayed_token(p, tSTRING_CONTENT); + p->lex.ptok = p->lex.pcur; + } + dispatch_scan_event(p, tSTRING_CONTENT); + p->lex.pcur += back; +} + +/* this can be shared with ripper, since it's independent from struct + * parser_params. */ +#ifndef RIPPER +#define BIT(c, idx) (((c) / 32 - 1 == idx) ? (1U << ((c) % 32)) : 0) +#define SPECIAL_PUNCT(idx) ( \ + BIT('~', idx) | BIT('*', idx) | BIT('$', idx) | BIT('?', idx) | \ + BIT('!', idx) | BIT('@', idx) | BIT('/', idx) | BIT('\\', idx) | \ + BIT(';', idx) | BIT(',', idx) | BIT('.', idx) | BIT('=', idx) | \ + BIT(':', idx) | BIT('<', idx) | BIT('>', idx) | BIT('\"', idx) | \ + BIT('&', idx) | BIT('`', idx) | BIT('\'', idx) | BIT('+', idx) | \ + BIT('0', idx)) +const uint_least32_t ruby_global_name_punct_bits[] = { + SPECIAL_PUNCT(0), + SPECIAL_PUNCT(1), + SPECIAL_PUNCT(2), +}; +#undef BIT +#undef SPECIAL_PUNCT +#endif - if (func == -1) return tSTRING_END; - c = nextc(); +static enum yytokentype +parser_peek_variable_name(struct parser_params *p) +{ + int c; + const char *ptr = p->lex.pcur; + + if (lex_eol_ptr_n_p(p, ptr, 1)) return 0; + c = *ptr++; + switch (c) { + case '$': + if ((c = *ptr) == '-') { + if (lex_eol_ptr_p(p, ++ptr)) return 0; + c = *ptr; + } + else if (is_global_name_punct(c) || ISDIGIT(c)) { + return tSTRING_DVAR; + } + break; + case '@': + if ((c = *ptr) == '@') { + if (lex_eol_ptr_p(p, ++ptr)) return 0; + c = *ptr; + } + break; + case '{': + p->lex.pcur = ptr; + p->command_start = TRUE; + yylval.state = p->lex.state; + return tSTRING_DBEG; + default: + return 0; + } + if (!ISASCII(c) || c == '_' || ISALPHA(c)) + return tSTRING_DVAR; + return 0; +} + +#define IS_ARG() IS_lex_state(EXPR_ARG_ANY) +#define IS_END() IS_lex_state(EXPR_END_ANY) +#define IS_BEG() (IS_lex_state(EXPR_BEG_ANY) || IS_lex_state_all(EXPR_ARG|EXPR_LABELED)) +#define IS_SPCARG(c) (IS_ARG() && space_seen && !ISSPACE(c)) +#define IS_LABEL_POSSIBLE() (\ + (IS_lex_state(EXPR_LABEL|EXPR_ENDFN) && !cmd_state) || \ + IS_ARG()) +#define IS_LABEL_SUFFIX(n) (peek_n(p, ':',(n)) && !peek_n(p, ':', (n)+1)) +#define IS_AFTER_OPERATOR() IS_lex_state(EXPR_FNAME | EXPR_DOT) + +static inline enum yytokentype +parser_string_term(struct parser_params *p, int func) +{ + xfree(p->lex.strterm); + p->lex.strterm = 0; + if (func & STR_FUNC_REGEXP) { + set_yylval_num(regx_options(p)); + dispatch_scan_event(p, tREGEXP_END); + SET_LEX_STATE(EXPR_END); + return tREGEXP_END; + } + if ((func & STR_FUNC_LABEL) && IS_LABEL_SUFFIX(0)) { + nextc(p); + SET_LEX_STATE(EXPR_ARG|EXPR_LABELED); + return tLABEL_END; + } + SET_LEX_STATE(EXPR_END); + return tSTRING_END; +} + +static enum yytokentype +parse_string(struct parser_params *p, rb_strterm_literal_t *quote) +{ + int func = quote->func; + int term = quote->term; + int paren = quote->paren; + int c, space = 0; + rb_encoding *enc = p->enc; + rb_encoding *base_enc = 0; + rb_parser_string_t *lit; + + if (func & STR_FUNC_TERM) { + if (func & STR_FUNC_QWORDS) nextc(p); /* delayed term */ + SET_LEX_STATE(EXPR_END); + xfree(p->lex.strterm); + p->lex.strterm = 0; + return func & STR_FUNC_REGEXP ? tREGEXP_END : tSTRING_END; + } + c = nextc(p); if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) { - do {c = nextc();} while (ISSPACE(c)); - space = 1; - } - if (c == term && !quote->nd_nest) { - if (func & STR_FUNC_QWORDS) { - quote->nd_func = -1; - return ' '; - } - if (!(func & STR_FUNC_REGEXP)) return tSTRING_END; - yylval.num = regx_options(); - return tREGEXP_END; + while (c != '\n' && ISSPACE(c = nextc(p))); + space = 1; + } + if (func & STR_FUNC_LIST) { + quote->func &= ~STR_FUNC_LIST; + space = 1; + } + if (c == term && !quote->nest) { + if (func & STR_FUNC_QWORDS) { + quote->func |= STR_FUNC_TERM; + pushback(p, c); /* dispatch the term at tSTRING_END */ + add_delayed_token(p, p->lex.ptok, p->lex.pcur); + return ' '; + } + return parser_string_term(p, func); } if (space) { - pushback(c); - return ' '; + if (!ISSPACE(c)) pushback(p, c); + add_delayed_token(p, p->lex.ptok, p->lex.pcur); + return ' '; } - newtok(); + newtok(p); if ((func & STR_FUNC_EXPAND) && c == '#') { - switch (c = nextc()) { - case '$': - case '@': - pushback(c); - return tSTRING_DVAR; - case '{': - return tSTRING_DBEG; - } - tokadd('#'); - } - pushback(c); - if (tokadd_string(func, term, paren, "e->nd_nest) == -1) { - ruby_sourceline = nd_line(quote); - rb_compile_error("unterminated string meets end of file"); - return tSTRING_END; - } - - tokfix(); - yylval.node = NEW_STR(rb_str_new(tok(), toklen())); + enum yytokentype t = parser_peek_variable_name(p); + if (t) return t; + tokadd(p, '#'); + c = nextc(p); + } + pushback(p, c); + if (tokadd_string(p, func, term, paren, "e->nest, + &enc, &base_enc) == -1) { + if (p->eofp) { +#ifndef RIPPER +# define unterminated_literal(mesg) yyerror0(mesg) +#else +# define unterminated_literal(mesg) compile_error(p, mesg) +#endif + literal_flush(p, p->lex.pcur); + if (func & STR_FUNC_QWORDS) { + /* no content to add, bailing out here */ + unterminated_literal("unterminated list meets end of file"); + xfree(p->lex.strterm); + p->lex.strterm = 0; + return tSTRING_END; + } + if (func & STR_FUNC_REGEXP) { + unterminated_literal("unterminated regexp meets end of file"); + } + else { + unterminated_literal("unterminated string meets end of file"); + } + quote->func |= STR_FUNC_TERM; + } + } + + tokfix(p); + lit = STR_NEW3(tok(p), toklen(p), enc, func); + set_yylval_str(lit); + flush_string_content(p, enc, 0); + return tSTRING_CONTENT; } -static int -heredoc_identifier() +static enum yytokentype +heredoc_identifier(struct parser_params *p) { - int c = nextc(), term, func = 0, len; + /* + * term_len is length of `<<"END"` except `END`, + * in this case term_len is 4 (<, <, " and "). + */ + long len, offset = p->lex.pcur - p->lex.pbeg; + int c = nextc(p), term, func = 0, quote = 0; + enum yytokentype token = tSTRING_BEG; + int indent = 0; if (c == '-') { - c = nextc(); - func = STR_FUNC_INDENT; + c = nextc(p); + func = STR_FUNC_INDENT; + offset++; + } + else if (c == '~') { + c = nextc(p); + func = STR_FUNC_INDENT; + offset++; + indent = INT_MAX; } switch (c) { case '\'': - func |= str_squote; goto quoted; + func |= str_squote; goto quoted; case '"': - func |= str_dquote; goto quoted; + func |= str_dquote; goto quoted; case '`': - func |= str_xquote; + token = tXSTRING_BEG; + func |= str_xquote; goto quoted; + quoted: - newtok(); - tokadd(func); - term = c; - while ((c = nextc()) != -1 && c != term) { - len = mbclen(c); - do {tokadd(c);} while (--len > 0 && (c = nextc()) != -1); - } - if (c == -1) { - rb_compile_error("unterminated here document identifier"); - return 0; - } - break; + quote++; + offset++; + term = c; + len = 0; + while ((c = nextc(p)) != term) { + if (c == -1 || c == '\r' || c == '\n') { + yyerror0("unterminated here document identifier"); + return -1; + } + } + break; default: - if (!is_identchar(c)) { - pushback(c); - if (func & STR_FUNC_INDENT) { - pushback('-'); - } - return 0; - } - newtok(); - term = '"'; - tokadd(func |= str_dquote); - do { - len = mbclen(c); - do {tokadd(c);} while (--len > 0 && (c = nextc()) != -1); - } while ((c = nextc()) != -1 && is_identchar(c)); - pushback(c); - break; - } - - tokfix(); - len = lex_p - lex_pbeg; - lex_p = lex_pend; - lex_strterm = rb_node_newnode(NODE_HEREDOC, - rb_str_new(tok(), toklen()), /* nd_lit */ - len, /* nd_nth */ - lex_lastline); /* nd_orig */ - return term == '`' ? tXSTRING_BEG : tSTRING_BEG; + if (!parser_is_identchar(p)) { + pushback(p, c); + if (func & STR_FUNC_INDENT) { + pushback(p, indent > 0 ? '~' : '-'); + } + return 0; + } + func |= str_dquote; + do { + int n = parser_precise_mbclen(p, p->lex.pcur-1); + if (n < 0) return 0; + p->lex.pcur += --n; + } while ((c = nextc(p)) != -1 && parser_is_identchar(p)); + pushback(p, c); + break; + } + + len = p->lex.pcur - (p->lex.pbeg + offset) - quote; + if ((unsigned long)len >= HERETERM_LENGTH_MAX) + yyerror0("too long here document identifier"); + dispatch_scan_event(p, tHEREDOC_BEG); + lex_goto_eol(p); + + p->lex.strterm = new_heredoc(p); + rb_strterm_heredoc_t *here = &p->lex.strterm->u.heredoc; + here->offset = offset; + here->sourceline = p->ruby_sourceline; + here->length = (unsigned)len; + here->quote = quote; + here->func = func; + here->lastline = p->lex.lastline; + + token_flush(p); + p->heredoc_indent = indent; + p->heredoc_line_indent = 0; + return token; } static void -heredoc_restore(here) - NODE *here; +heredoc_restore(struct parser_params *p, rb_strterm_heredoc_t *here) { - VALUE line = here->nd_orig; - lex_lastline = line; - lex_pbeg = RSTRING(line)->ptr; - lex_pend = lex_pbeg + RSTRING(line)->len; - lex_p = lex_pbeg + here->nd_nth; - heredoc_end = ruby_sourceline; - ruby_sourceline = nd_line(here); - dispose_string(here->nd_lit); - rb_gc_force_recycle((VALUE)here); + rb_parser_string_t *line; + rb_strterm_t *term = p->lex.strterm; + + p->lex.strterm = 0; + line = here->lastline; + p->lex.lastline = line; + p->lex.pbeg = PARSER_STRING_PTR(line); + p->lex.pend = p->lex.pbeg + PARSER_STRING_LEN(line); + p->lex.pcur = p->lex.pbeg + here->offset + here->length + here->quote; + p->lex.ptok = p->lex.pbeg + here->offset - here->quote; + p->heredoc_end = p->ruby_sourceline; + p->ruby_sourceline = (int)here->sourceline; + if (p->eofp) p->lex.nextline = AFTER_HEREDOC_WITHOUT_TERMINATOR; + p->eofp = 0; + xfree(term); } static int -whole_match_p(eos, len, indent) - char *eos; - int len, indent; +dedent_string_column(const char *str, long len, int width) { - char *p = lex_pbeg; - int n; + int i, col = 0; + + for (i = 0; i < len && col < width; i++) { + if (str[i] == ' ') { + col++; + } + else if (str[i] == '\t') { + int n = TAB_WIDTH * (col / TAB_WIDTH + 1); + if (n > width) break; + col = n; + } + else { + break; + } + } + + return i; +} + +static int +dedent_string(struct parser_params *p, rb_parser_string_t *string, int width) +{ + char *str; + long len; + int i; + + len = PARSER_STRING_LEN(string); + str = PARSER_STRING_PTR(string); + + i = dedent_string_column(str, len, width); + if (!i) return 0; + + rb_parser_str_modify(string); + str = PARSER_STRING_PTR(string); + if (PARSER_STRING_LEN(string) != len) + rb_fatal("literal string changed: %s", PARSER_STRING_PTR(string)); + MEMMOVE(str, str + i, char, len - i); + rb_parser_str_set_len(p, string, len - i); + return i; +} +static NODE * +heredoc_dedent(struct parser_params *p, NODE *root) +{ + NODE *node, *str_node, *prev_node; + int indent = p->heredoc_indent; + rb_parser_string_t *prev_lit = 0; + + if (indent <= 0) return root; + if (!root) return root; + + prev_node = node = str_node = root; + if (nd_type_p(root, NODE_LIST)) str_node = RNODE_LIST(root)->nd_head; + + while (str_node) { + rb_parser_string_t *lit = RNODE_STR(str_node)->string; + if (nd_fl_newline(str_node)) { + dedent_string(p, lit, indent); + } + if (!prev_lit) { + prev_lit = lit; + } + else if (!literal_concat0(p, prev_lit, lit)) { + return 0; + } + else { + NODE *end = RNODE_LIST(node)->as.nd_end; + node = RNODE_LIST(prev_node)->nd_next = RNODE_LIST(node)->nd_next; + if (!node) { + if (nd_type_p(prev_node, NODE_DSTR)) + nd_set_type(prev_node, NODE_STR); + break; + } + RNODE_LIST(node)->as.nd_end = end; + goto next_str; + } + + str_node = 0; + while ((nd_type_p(node, NODE_LIST) || nd_type_p(node, NODE_DSTR)) && (node = RNODE_LIST(prev_node = node)->nd_next) != 0) { + next_str: + if (!nd_type_p(node, NODE_LIST)) break; + if ((str_node = RNODE_LIST(node)->nd_head) != 0) { + enum node_type type = nd_type(str_node); + if (type == NODE_STR || type == NODE_DSTR) break; + prev_lit = 0; + str_node = 0; + } + } + } + return root; +} + +static int +whole_match_p(struct parser_params *p, const char *eos, long len, int indent) +{ + const char *beg = p->lex.pbeg; + const char *ptr = p->lex.pend; + + if (ptr - beg < len) return FALSE; + if (ptr > beg && ptr[-1] == '\n') { + if (--ptr > beg && ptr[-1] == '\r') --ptr; + if (ptr - beg < len) return FALSE; + } + if (strncmp(eos, ptr -= len, len)) return FALSE; if (indent) { - while (*p && ISSPACE(*p)) p++; + while (beg < ptr && ISSPACE(*beg)) beg++; } - n= lex_pend - (p + len); - if (n < 0 || (n > 0 && p[len] != '\n' && p[len] != '\r')) return Qfalse; - if (strncmp(eos, p, len) == 0) return Qtrue; - return Qfalse; + return beg == ptr; } static int -here_document(here) - NODE *here; +word_match_p(struct parser_params *p, const char *word, long len) +{ + if (strncmp(p->lex.pcur, word, len)) return 0; + if (lex_eol_n_p(p, len)) return 1; + int c = (unsigned char)p->lex.pcur[len]; + if (ISSPACE(c)) return 1; + switch (c) { + case '\0': case '\004': case '\032': return 1; + } + return 0; +} + +#define NUM_SUFFIX_R (1<<0) +#define NUM_SUFFIX_I (1<<1) +#define NUM_SUFFIX_ALL 3 + +static int +number_literal_suffix(struct parser_params *p, int mask) +{ + int c, result = 0; + const char *lastp = p->lex.pcur; + + while ((c = nextc(p)) != -1) { + if ((mask & NUM_SUFFIX_I) && c == 'i') { + result |= (mask & NUM_SUFFIX_I); + mask &= ~NUM_SUFFIX_I; + /* r after i, rational of complex is disallowed */ + mask &= ~NUM_SUFFIX_R; + continue; + } + if ((mask & NUM_SUFFIX_R) && c == 'r') { + result |= (mask & NUM_SUFFIX_R); + mask &= ~NUM_SUFFIX_R; + continue; + } + if (!ISASCII(c) || ISALPHA(c) || c == '_') { + p->lex.pcur = lastp; + literal_flush(p, p->lex.pcur); + return 0; + } + pushback(p, c); + break; + } + return result; +} + +static enum yytokentype +set_number_literal(struct parser_params *p, enum yytokentype type, int suffix, int base, int seen_point) +{ + enum rb_numeric_type numeric_type = integer_literal; + + if (type == tFLOAT) { + numeric_type = float_literal; + } + + if (suffix & NUM_SUFFIX_R) { + type = tRATIONAL; + numeric_type = rational_literal; + } + if (suffix & NUM_SUFFIX_I) { + type = tIMAGINARY; + } + + switch (type) { + case tINTEGER: + set_yylval_node(NEW_INTEGER(strdup(tok(p)), base, &_cur_loc)); + break; + case tFLOAT: + set_yylval_node(NEW_FLOAT(strdup(tok(p)), &_cur_loc)); + break; + case tRATIONAL: + set_yylval_node(NEW_RATIONAL(strdup(tok(p)), base, seen_point, &_cur_loc)); + break; + case tIMAGINARY: + set_yylval_node(NEW_IMAGINARY(strdup(tok(p)), base, seen_point, numeric_type, &_cur_loc)); + (void)numeric_type; /* for ripper */ + break; + default: + rb_bug("unexpected token: %d", type); + } + SET_LEX_STATE(EXPR_END); + return type; +} + +#define dispatch_heredoc_end(p) parser_dispatch_heredoc_end(p, __LINE__) +static void +parser_dispatch_heredoc_end(struct parser_params *p, int line) +{ + if (has_delayed_token(p)) + dispatch_delayed_token(p, tSTRING_CONTENT); + +#ifdef RIPPER + VALUE str = STR_NEW(p->lex.ptok, p->lex.pend - p->lex.ptok); + ripper_dispatch1(p, ripper_token2eventid(tHEREDOC_END), str); +#else + if (p->keep_tokens) { + rb_parser_string_t *str = rb_parser_encoding_string_new(p, p->lex.ptok, p->lex.pend - p->lex.ptok, p->enc); + RUBY_SET_YYLLOC_OF_HEREDOC_END(*p->yylloc); + parser_append_tokens(p, str, tHEREDOC_END, line); + } +#endif + + RUBY_SET_YYLLOC_FROM_STRTERM_HEREDOC(*p->yylloc); + lex_goto_eol(p); + token_flush(p); +} + +static enum yytokentype +here_document(struct parser_params *p, rb_strterm_heredoc_t *here) { int c, func, indent = 0; - char *eos, *p, *pend; + const char *eos, *ptr, *ptr_end; long len; - VALUE str = 0; + rb_parser_string_t *str = 0; + rb_encoding *enc = p->enc; + rb_encoding *base_enc = 0; + int bol; +#ifdef RIPPER + VALUE s_value; +#endif - eos = RSTRING(here->nd_lit)->ptr; - len = RSTRING(here->nd_lit)->len - 1; - indent = (func = *eos++) & STR_FUNC_INDENT; + eos = PARSER_STRING_PTR(here->lastline) + here->offset; + len = here->length; + indent = (func = here->func) & STR_FUNC_INDENT; - if ((c = nextc()) == -1) { + if ((c = nextc(p)) == -1) { error: - rb_compile_error("can't find string \"%s\" anywhere before EOF", eos); - heredoc_restore(lex_strterm); - lex_strterm = 0; - return 0; +#ifdef RIPPER + if (!has_delayed_token(p)) { + dispatch_scan_event(p, tSTRING_CONTENT); + } + else if (p->delayed.end_line + 1 == p->ruby_sourceline) { + if ((len = p->lex.pcur - p->lex.ptok) > 0) { + if (!(func & STR_FUNC_REGEXP)) { + int cr = ENC_CODERANGE_UNKNOWN; + rb_str_coderange_scan_restartable(p->lex.ptok, p->lex.pcur, enc, &cr); + if (cr != ENC_CODERANGE_7BIT && + rb_is_usascii_enc(p->enc) && + enc != rb_utf8_encoding()) { + enc = rb_ascii8bit_encoding(); + } + } + rb_parser_enc_str_buf_cat(p, p->delayed.token, p->lex.ptok, len, enc); + } + dispatch_delayed_token(p, tSTRING_CONTENT); + } + else { + dispatch_delayed_token(p, tSTRING_CONTENT); + dispatch_scan_event(p, tSTRING_CONTENT); + } + lex_goto_eol(p); +#endif + heredoc_restore(p, &p->lex.strterm->u.heredoc); + compile_error(p, "can't find string \"%.*s\" anywhere before EOF", + (int)len, eos); + token_flush(p); + SET_LEX_STATE(EXPR_END); + return tSTRING_END; } - if (was_bol() && whole_match_p(eos, len, indent)) { - heredoc_restore(lex_strterm); - return tSTRING_END; + bol = was_bol(p); + if (!bol) { + /* not beginning of line, cannot be the terminator */ + } + else if (p->heredoc_line_indent == -1) { + /* `heredoc_line_indent == -1` means + * - "after an interpolation in the same line", or + * - "in a continuing line" + */ + p->heredoc_line_indent = 0; + } + else if (whole_match_p(p, eos, len, indent)) { + dispatch_heredoc_end(p); + restore: + heredoc_restore(p, &p->lex.strterm->u.heredoc); + token_flush(p); + SET_LEX_STATE(EXPR_END); + return tSTRING_END; } if (!(func & STR_FUNC_EXPAND)) { - do { - p = RSTRING(lex_lastline)->ptr; - pend = lex_pend; - if (pend > p) { - switch (pend[-1]) { - case '\n': - if (--pend == p || pend[-1] != '\r') { - pend++; - break; - } - case '\r': - --pend; - } - } - if (str) - rb_str_cat(str, p, pend - p); - else - str = rb_str_new(p, pend - p); - if (pend < lex_pend) rb_str_cat(str, "\n", 1); - lex_p = lex_pend; - if (nextc() == -1) { - if (str) dispose_string(str); - goto error; - } - } while (!whole_match_p(eos, len, indent)); + do { + ptr = PARSER_STRING_PTR(p->lex.lastline); + ptr_end = p->lex.pend; + if (ptr_end > ptr) { + switch (ptr_end[-1]) { + case '\n': + if (--ptr_end == ptr || ptr_end[-1] != '\r') { + ptr_end++; + break; + } + case '\r': + --ptr_end; + } + } + + if (p->heredoc_indent > 0) { + long i = 0; + while (ptr + i < ptr_end && parser_update_heredoc_indent(p, ptr[i])) + i++; + p->heredoc_line_indent = 0; + } + + if (str) + parser_str_cat(str, ptr, ptr_end - ptr); + else + str = rb_parser_encoding_string_new(p, ptr, ptr_end - ptr, enc); + if (!lex_eol_ptr_p(p, ptr_end)) parser_str_cat_cstr(str, "\n"); + lex_goto_eol(p); + if (p->heredoc_indent > 0) { + goto flush_str; + } + if (nextc(p) == -1) { + if (str) { + rb_parser_string_free(p, str); + str = 0; + } + goto error; + } + } while (!whole_match_p(p, eos, len, indent)); } else { - newtok(); - if (c == '#') { - switch (c = nextc()) { - case '$': - case '@': - pushback(c); - return tSTRING_DVAR; - case '{': - return tSTRING_DBEG; - } - tokadd('#'); - } - do { - pushback(c); - if ((c = tokadd_string(func, '\n', 0, NULL)) == -1) goto error; - if (c != '\n') { - yylval.node = NEW_STR(rb_str_new(tok(), toklen())); - return tSTRING_CONTENT; - } - tokadd(nextc()); - if ((c = nextc()) == -1) goto error; - } while (!whole_match_p(eos, len, indent)); - str = rb_str_new(tok(), toklen()); - } - heredoc_restore(lex_strterm); - lex_strterm = NEW_STRTERM(-1, 0, 0); - yylval.node = NEW_STR(str); + /* int mb = ENC_CODERANGE_7BIT, *mbp = &mb;*/ + newtok(p); + if (c == '#') { + enum yytokentype t = parser_peek_variable_name(p); + if (p->heredoc_line_indent != -1) { + if (p->heredoc_indent > p->heredoc_line_indent) { + p->heredoc_indent = p->heredoc_line_indent; + } + p->heredoc_line_indent = -1; + } + if (t) return t; + tokadd(p, '#'); + c = nextc(p); + } + do { + pushback(p, c); + enc = p->enc; + if ((c = tokadd_string(p, func, '\n', 0, NULL, &enc, &base_enc)) == -1) { + if (p->eofp) goto error; + goto restore; + } + if (c != '\n') { + if (c == '\\') p->heredoc_line_indent = -1; + flush: + str = STR_NEW3(tok(p), toklen(p), enc, func); + flush_str: + set_yylval_str(str); +#ifndef RIPPER + if (bol) nd_set_fl_newline(yylval.node); +#endif + flush_string_content(p, enc, 0); + return tSTRING_CONTENT; + } + tokadd(p, nextc(p)); + if (p->heredoc_indent > 0) { + lex_goto_eol(p); + goto flush; + } + /* if (mbp && mb == ENC_CODERANGE_UNKNOWN) mbp = 0;*/ + if ((c = nextc(p)) == -1) goto error; + } while (!whole_match_p(p, eos, len, indent)); + str = STR_NEW3(tok(p), toklen(p), enc, func); + } + dispatch_heredoc_end(p); + heredoc_restore(p, &p->lex.strterm->u.heredoc); + token_flush(p); + p->lex.strterm = NEW_STRTERM(func | STR_FUNC_TERM, 0, 0); +#ifdef RIPPER + /* Preserve s_value for set_yylval_str */ + s_value = p->s_value; +#endif + set_yylval_str(str); +#ifdef RIPPER + set_parser_s_value(s_value); +#endif + +#ifndef RIPPER + if (bol) nd_set_fl_newline(yylval.node); +#endif return tSTRING_CONTENT; } #include "lex.c" +static int +arg_ambiguous(struct parser_params *p, char c) +{ +#ifndef RIPPER + if (c == '/') { + rb_warning1("ambiguity between regexp and two divisions: wrap regexp in parentheses or add a space after '%c' operator", WARN_I(c)); + } + else { + rb_warning1("ambiguous first argument; put parentheses or a space even after '%c' operator", WARN_I(c)); + } +#else + dispatch1(arg_ambiguous, rb_usascii_str_new(&c, 1)); +#endif + return TRUE; +} + +/* returns true value if formal argument error; + * Qtrue, or error message if ripper */ +static VALUE +formal_argument_error(struct parser_params *p, ID id) +{ + switch (id_type(id)) { + case ID_LOCAL: + break; +#ifndef RIPPER +# define ERR(mesg) (yyerror0(mesg), Qtrue) +#else +# define ERR(mesg) WARN_S(mesg) +#endif + case ID_CONST: + return ERR("formal argument cannot be a constant"); + case ID_INSTANCE: + return ERR("formal argument cannot be an instance variable"); + case ID_GLOBAL: + return ERR("formal argument cannot be a global variable"); + case ID_CLASS: + return ERR("formal argument cannot be a class variable"); + default: + return ERR("formal argument must be local variable"); +#undef ERR + } + shadowing_lvar(p, id); + + return Qfalse; +} + +static int +lvar_defined(struct parser_params *p, ID id) +{ + return (dyna_in_block(p) && dvar_defined(p, id)) || local_id(p, id); +} + +/* emacsen -*- hack */ +static long +parser_encode_length(struct parser_params *p, const char *name, long len) +{ + long nlen; + + if (len > 5 && name[nlen = len - 5] == '-') { + if (rb_memcicmp(name + nlen + 1, "unix", 4) == 0) + return nlen; + } + if (len > 4 && name[nlen = len - 4] == '-') { + if (rb_memcicmp(name + nlen + 1, "dos", 3) == 0) + return nlen; + if (rb_memcicmp(name + nlen + 1, "mac", 3) == 0 && + !(len == 8 && rb_memcicmp(name, "utf8-mac", len) == 0)) + /* exclude UTF8-MAC because the encoding named "UTF8" doesn't exist in Ruby */ + return nlen; + } + return len; +} + +static void +parser_set_encode(struct parser_params *p, const char *name) +{ + rb_encoding *enc; + VALUE excargs[3]; + int idx = 0; + + const char *wrong = 0; + switch (*name) { + case 'e': case 'E': wrong = "external"; break; + case 'i': case 'I': wrong = "internal"; break; + case 'f': case 'F': wrong = "filesystem"; break; + case 'l': case 'L': wrong = "locale"; break; + } + if (wrong && STRCASECMP(name, wrong) == 0) goto unknown; + idx = rb_enc_find_index(name); + if (idx < 0) { + unknown: + excargs[1] = rb_sprintf("unknown encoding name: %s", name); + error: + excargs[0] = rb_eArgError; + excargs[2] = rb_make_backtrace(); + rb_ary_unshift(excargs[2], rb_sprintf("%"PRIsVALUE":%d", p->ruby_sourcefile_string, p->ruby_sourceline)); + VALUE exc = rb_make_exception(3, excargs); + ruby_show_error_line(p, exc, &(YYLTYPE)RUBY_INIT_YYLLOC(), p->ruby_sourceline, p->lex.lastline); + + rb_ast_free(p->ast); + p->ast = NULL; + + rb_exc_raise(exc); + } + enc = rb_enc_from_index(idx); + if (!rb_enc_asciicompat(enc)) { + excargs[1] = rb_sprintf("%s is not ASCII compatible", rb_enc_name(enc)); + goto error; + } + p->enc = enc; +#ifndef RIPPER + if (p->debug_lines) { + long i; + for (i = 0; i < p->debug_lines->len; i++) { + rb_parser_enc_associate(p, p->debug_lines->data[i], enc); + } + } +#endif +} + +static bool +comment_at_top(struct parser_params *p) +{ + if (p->token_seen) return false; + return (p->line_count == (p->has_shebang ? 2 : 1)); +} + +typedef long (*rb_magic_comment_length_t)(struct parser_params *p, const char *name, long len); +typedef void (*rb_magic_comment_setter_t)(struct parser_params *p, const char *name, const char *val); + +static int parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val); + +static void +magic_comment_encoding(struct parser_params *p, const char *name, const char *val) +{ + if (!comment_at_top(p)) { + return; + } + parser_set_encode(p, val); +} + +static int +parser_get_bool(struct parser_params *p, const char *name, const char *val) +{ + switch (*val) { + case 't': case 'T': + if (STRCASECMP(val, "true") == 0) { + return TRUE; + } + break; + case 'f': case 'F': + if (STRCASECMP(val, "false") == 0) { + return FALSE; + } + break; + } + return parser_invalid_pragma_value(p, name, val); +} + +static int +parser_invalid_pragma_value(struct parser_params *p, const char *name, const char *val) +{ + rb_warning2("invalid value for %s: %s", WARN_S(name), WARN_S(val)); + return -1; +} + +static void +parser_set_token_info(struct parser_params *p, const char *name, const char *val) +{ + int b = parser_get_bool(p, name, val); + if (b >= 0) p->token_info_enabled = b; +} + +static void +parser_set_frozen_string_literal(struct parser_params *p, const char *name, const char *val) +{ + int b; + + if (p->token_seen) { + rb_warning1("'%s' is ignored after any tokens", WARN_S(name)); + return; + } + + b = parser_get_bool(p, name, val); + if (b < 0) return; + + p->frozen_string_literal = b; +} + +static void +parser_set_shareable_constant_value(struct parser_params *p, const char *name, const char *val) +{ + for (const char *s = p->lex.pbeg, *e = p->lex.pcur; s < e; ++s) { + if (*s == ' ' || *s == '\t') continue; + if (*s == '#') break; + rb_warning1("'%s' is ignored unless in comment-only line", WARN_S(name)); + return; + } + + switch (*val) { + case 'n': case 'N': + if (STRCASECMP(val, "none") == 0) { + p->ctxt.shareable_constant_value = rb_parser_shareable_none; + return; + } + break; + case 'l': case 'L': + if (STRCASECMP(val, "literal") == 0) { + p->ctxt.shareable_constant_value = rb_parser_shareable_literal; + return; + } + break; + case 'e': case 'E': + if (STRCASECMP(val, "experimental_copy") == 0) { + p->ctxt.shareable_constant_value = rb_parser_shareable_copy; + return; + } + if (STRCASECMP(val, "experimental_everything") == 0) { + p->ctxt.shareable_constant_value = rb_parser_shareable_everything; + return; + } + break; + } + parser_invalid_pragma_value(p, name, val); +} + +# if WARN_PAST_SCOPE static void -arg_ambiguous() +parser_set_past_scope(struct parser_params *p, const char *name, const char *val) +{ + int b = parser_get_bool(p, name, val); + if (b >= 0) p->past_scope_enabled = b; +} +# endif + +struct magic_comment { + const char *name; + rb_magic_comment_setter_t func; + rb_magic_comment_length_t length; +}; + +static const struct magic_comment magic_comments[] = { + {"coding", magic_comment_encoding, parser_encode_length}, + {"encoding", magic_comment_encoding, parser_encode_length}, + {"frozen_string_literal", parser_set_frozen_string_literal}, + {"shareable_constant_value", parser_set_shareable_constant_value}, + {"warn_indent", parser_set_token_info}, +# if WARN_PAST_SCOPE + {"warn_past_scope", parser_set_past_scope}, +# endif +}; + +static const char * +magic_comment_marker(const char *str, long len) +{ + long i = 2; + + while (i < len) { + switch (str[i]) { + case '-': + if (str[i-1] == '*' && str[i-2] == '-') { + return str + i + 1; + } + i += 2; + break; + case '*': + if (i + 1 >= len) return 0; + if (str[i+1] != '-') { + i += 4; + } + else if (str[i-1] != '-') { + i += 2; + } + else { + return str + i + 2; + } + break; + default: + i += 3; + break; + } + } + return 0; +} + +static int +parser_magic_comment(struct parser_params *p, const char *str, long len) +{ + int indicator = 0; + VALUE name = 0, val = 0; + const char *beg, *end, *vbeg, *vend; +#define str_copy(_s, _p, _n) ((_s) \ + ? (void)(rb_str_resize((_s), (_n)), \ + MEMCPY(RSTRING_PTR(_s), (_p), char, (_n)), (_s)) \ + : (void)((_s) = STR_NEW((_p), (_n)))) + + if (len <= 7) return FALSE; + if (!!(beg = magic_comment_marker(str, len))) { + if (!(end = magic_comment_marker(beg, str + len - beg))) + return FALSE; + indicator = TRUE; + str = beg; + len = end - beg - 3; + } + + /* %r"([^\\s\'\":;]+)\\s*:\\s*(\"(?:\\\\.|[^\"])*\"|[^\"\\s;]+)[\\s;]*" */ + while (len > 0) { + const struct magic_comment *mc = magic_comments; + char *s; + int i; + long n = 0; + + for (; len > 0 && *str; str++, --len) { + switch (*str) { + case '\'': case '"': case ':': case ';': + continue; + } + if (!ISSPACE(*str)) break; + } + for (beg = str; len > 0; str++, --len) { + switch (*str) { + case '\'': case '"': case ':': case ';': + break; + default: + if (ISSPACE(*str)) break; + continue; + } + break; + } + for (end = str; len > 0 && ISSPACE(*str); str++, --len); + if (!len) break; + if (*str != ':') { + if (!indicator) return FALSE; + continue; + } + + do str++; while (--len > 0 && ISSPACE(*str)); + if (!len) break; + const char *tok_beg = str; + if (*str == '"') { + for (vbeg = ++str; --len > 0 && *str != '"'; str++) { + if (*str == '\\') { + --len; + ++str; + } + } + vend = str; + if (len) { + --len; + ++str; + } + } + else { + for (vbeg = str; len > 0 && *str != '"' && *str != ';' && !ISSPACE(*str); --len, str++); + vend = str; + } + const char *tok_end = str; + if (indicator) { + while (len > 0 && (*str == ';' || ISSPACE(*str))) --len, str++; + } + else { + while (len > 0 && (ISSPACE(*str))) --len, str++; + if (len) return FALSE; + } + + n = end - beg; + str_copy(name, beg, n); + s = RSTRING_PTR(name); + for (i = 0; i < n; ++i) { + if (s[i] == '-') s[i] = '_'; + } + do { + if (STRNCASECMP(mc->name, s, n) == 0 && !mc->name[n]) { + n = vend - vbeg; + if (mc->length) { + n = (*mc->length)(p, vbeg, n); + } + str_copy(val, vbeg, n); + p->lex.ptok = tok_beg; + p->lex.pcur = tok_end; + (*mc->func)(p, mc->name, RSTRING_PTR(val)); + break; + } + } while (++mc < magic_comments + numberof(magic_comments)); +#ifdef RIPPER + str_copy(val, vbeg, vend - vbeg); + dispatch2(magic_comment, name, val); +#endif + } + + return TRUE; +} + +static void +set_file_encoding(struct parser_params *p, const char *str, const char *send) +{ + int sep = 0; + const char *beg = str; + VALUE s; + + for (;;) { + if (send - str <= 6) return; + switch (str[6]) { + case 'C': case 'c': str += 6; continue; + case 'O': case 'o': str += 5; continue; + case 'D': case 'd': str += 4; continue; + case 'I': case 'i': str += 3; continue; + case 'N': case 'n': str += 2; continue; + case 'G': case 'g': str += 1; continue; + case '=': case ':': + sep = 1; + str += 6; + break; + default: + str += 6; + if (ISSPACE(*str)) break; + continue; + } + if (STRNCASECMP(str-6, "coding", 6) == 0) break; + sep = 0; + } + for (;;) { + do { + if (++str >= send) return; + } while (ISSPACE(*str)); + if (sep) break; + if (*str != '=' && *str != ':') return; + sep = 1; + str++; + } + beg = str; + while ((*str == '-' || *str == '_' || ISALNUM(*str)) && ++str < send); + s = rb_str_new(beg, parser_encode_length(p, beg, str - beg)); + p->lex.ptok = beg; + p->lex.pcur = str; + parser_set_encode(p, RSTRING_PTR(s)); + rb_str_resize(s, 0); +} + +static void +parser_prepare(struct parser_params *p) +{ + int c = nextc0(p, FALSE); + p->token_info_enabled = !compile_for_eval && RTEST(ruby_verbose); + switch (c) { + case '#': + if (peek(p, '!')) p->has_shebang = 1; + break; + case 0xef: /* UTF-8 BOM marker */ + if (!lex_eol_n_p(p, 2) && + (unsigned char)p->lex.pcur[0] == 0xbb && + (unsigned char)p->lex.pcur[1] == 0xbf) { + p->enc = rb_utf8_encoding(); + p->lex.pcur += 2; +#ifndef RIPPER + if (p->debug_lines) { + rb_parser_string_set_encoding(p->lex.lastline, p->enc); + } +#endif + p->lex.pbeg = p->lex.pcur; + token_flush(p); + return; + } + break; + case -1: /* end of script. */ + return; + } + pushback(p, c); + p->enc = rb_parser_str_get_encoding(p->lex.lastline); +} + +#ifndef RIPPER +#define ambiguous_operator(tok, op, syn) ( \ + rb_warning0("'"op"' after local variable or literal is interpreted as binary operator"), \ + rb_warning0("even though it seems like "syn"")) +#else +#define ambiguous_operator(tok, op, syn) \ + dispatch2(operator_ambiguous, TOKEN2VAL(tok), rb_str_new_cstr(syn)) +#endif +#define warn_balanced(tok, op, syn) ((void) \ + (!IS_lex_state_for(last_state, EXPR_CLASS|EXPR_DOT|EXPR_FNAME|EXPR_ENDFN) && \ + space_seen && !ISSPACE(c) && \ + (ambiguous_operator(tok, op, syn), 0)), \ + (enum yytokentype)(tok)) + +static enum yytokentype +no_digits(struct parser_params *p) +{ + yyerror0("numeric literal without digits"); + if (peek(p, '_')) nextc(p); + /* dummy 0, for tUMINUS_NUM at numeric */ + return set_number_literal(p, tINTEGER, 0, 10, 0); +} + +static enum yytokentype +parse_numeric(struct parser_params *p, int c) +{ + int is_float, seen_point, seen_e, nondigit; + int suffix; + + is_float = seen_point = seen_e = nondigit = 0; + SET_LEX_STATE(EXPR_END); + newtok(p); + if (c == '-' || c == '+') { + tokadd(p, c); + c = nextc(p); + } + if (c == '0') { + int start = toklen(p); + c = nextc(p); + if (c == 'x' || c == 'X') { + /* hexadecimal */ + c = nextc(p); + if (c != -1 && ISXDIGIT(c)) { + do { + if (c == '_') { + if (nondigit) break; + nondigit = c; + continue; + } + if (!ISXDIGIT(c)) break; + nondigit = 0; + tokadd(p, c); + } while ((c = nextc(p)) != -1); + } + pushback(p, c); + tokfix(p); + if (toklen(p) == start) { + return no_digits(p); + } + else if (nondigit) goto trailing_uc; + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 16, 0); + } + if (c == 'b' || c == 'B') { + /* binary */ + c = nextc(p); + if (c == '0' || c == '1') { + do { + if (c == '_') { + if (nondigit) break; + nondigit = c; + continue; + } + if (c != '0' && c != '1') break; + nondigit = 0; + tokadd(p, c); + } while ((c = nextc(p)) != -1); + } + pushback(p, c); + tokfix(p); + if (toklen(p) == start) { + return no_digits(p); + } + else if (nondigit) goto trailing_uc; + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 2, 0); + } + if (c == 'd' || c == 'D') { + /* decimal */ + c = nextc(p); + if (c != -1 && ISDIGIT(c)) { + do { + if (c == '_') { + if (nondigit) break; + nondigit = c; + continue; + } + if (!ISDIGIT(c)) break; + nondigit = 0; + tokadd(p, c); + } while ((c = nextc(p)) != -1); + } + pushback(p, c); + tokfix(p); + if (toklen(p) == start) { + return no_digits(p); + } + else if (nondigit) goto trailing_uc; + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 10, 0); + } + if (c == '_') { + /* 0_0 */ + goto octal_number; + } + if (c == 'o' || c == 'O') { + /* prefixed octal */ + c = nextc(p); + if (c == -1 || c == '_' || !ISDIGIT(c)) { + tokfix(p); + return no_digits(p); + } + } + if (c >= '0' && c <= '7') { + /* octal */ + octal_number: + do { + if (c == '_') { + if (nondigit) break; + nondigit = c; + continue; + } + if (c < '0' || c > '9') break; + if (c > '7') goto invalid_octal; + nondigit = 0; + tokadd(p, c); + } while ((c = nextc(p)) != -1); + if (toklen(p) > start) { + pushback(p, c); + tokfix(p); + if (nondigit) goto trailing_uc; + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 8, 0); + } + if (nondigit) { + pushback(p, c); + goto trailing_uc; + } + } + if (c > '7' && c <= '9') { + invalid_octal: + yyerror0("Invalid octal digit"); + } + else if (c == '.' || c == 'e' || c == 'E') { + tokadd(p, '0'); + } + else { + pushback(p, c); + tokfix(p); + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 10, 0); + } + } + + for (;;) { + switch (c) { + case '0': case '1': case '2': case '3': case '4': + case '5': case '6': case '7': case '8': case '9': + nondigit = 0; + tokadd(p, c); + break; + + case '.': + if (nondigit) goto trailing_uc; + if (seen_point || seen_e) { + goto decode_num; + } + else { + int c0 = nextc(p); + if (c0 == -1 || !ISDIGIT(c0)) { + pushback(p, c0); + goto decode_num; + } + c = c0; + } + seen_point = toklen(p); + tokadd(p, '.'); + tokadd(p, c); + is_float++; + nondigit = 0; + break; + + case 'e': + case 'E': + if (nondigit) { + pushback(p, c); + c = nondigit; + goto decode_num; + } + if (seen_e) { + goto decode_num; + } + nondigit = c; + c = nextc(p); + if (c != '-' && c != '+' && !ISDIGIT(c)) { + pushback(p, c); + c = nondigit; + nondigit = 0; + goto decode_num; + } + tokadd(p, nondigit); + seen_e++; + is_float++; + tokadd(p, c); + nondigit = (c == '-' || c == '+') ? c : 0; + break; + + case '_': /* `_' in number just ignored */ + if (nondigit) goto decode_num; + nondigit = c; + break; + + default: + goto decode_num; + } + c = nextc(p); + } + + decode_num: + pushback(p, c); + if (nondigit) { + trailing_uc: + literal_flush(p, p->lex.pcur - 1); + YYLTYPE loc = RUBY_INIT_YYLLOC(); + compile_error(p, "trailing '%c' in number", nondigit); + parser_show_error_line(p, &loc); + } + tokfix(p); + if (is_float) { + enum yytokentype type = tFLOAT; + + suffix = number_literal_suffix(p, seen_e ? NUM_SUFFIX_I : NUM_SUFFIX_ALL); + if (suffix & NUM_SUFFIX_R) { + type = tRATIONAL; + } + else { + strtod(tok(p), 0); + if (errno == ERANGE) { + rb_warning1("Float %s out of range", WARN_S(tok(p))); + errno = 0; + } + } + return set_number_literal(p, type, suffix, 0, seen_point); + } + suffix = number_literal_suffix(p, NUM_SUFFIX_ALL); + return set_number_literal(p, tINTEGER, suffix, 10, 0); +} + +static enum yytokentype +parse_qmark(struct parser_params *p, int space_seen) +{ + rb_encoding *enc; + register int c; + rb_parser_string_t *lit; + const char *start = p->lex.pcur; + + if (IS_END()) { + SET_LEX_STATE(EXPR_VALUE); + return '?'; + } + c = nextc(p); + if (c == -1) { + compile_error(p, "incomplete character syntax"); + return 0; + } + if (rb_enc_isspace(c, p->enc)) { + if (!IS_ARG()) { + int c2 = escaped_control_code(c); + if (c2) { + WARN_SPACE_CHAR(c2, "?"); + } + } + ternary: + pushback(p, c); + SET_LEX_STATE(EXPR_VALUE); + return '?'; + } + newtok(p); + enc = p->enc; + int w = parser_precise_mbclen(p, start); + if (is_identchar(p, start, p->lex.pend, p->enc) && + !(lex_eol_ptr_n_p(p, start, w) || !is_identchar(p, start + w, p->lex.pend, p->enc))) { + if (space_seen) { + const char *ptr = start; + do { + int n = parser_precise_mbclen(p, ptr); + if (n < 0) return -1; + ptr += n; + } while (!lex_eol_ptr_p(p, ptr) && is_identchar(p, ptr, p->lex.pend, p->enc)); + rb_warn2("'?' just followed by '%.*s' is interpreted as" \ + " a conditional operator, put a space after '?'", + WARN_I((int)(ptr - start)), WARN_S_L(start, (ptr - start))); + } + goto ternary; + } + else if (c == '\\') { + if (peek(p, 'u')) { + nextc(p); + enc = rb_utf8_encoding(); + tokadd_utf8(p, &enc, -1, 0, 0); + } + else if (!ISASCII(c = peekc(p)) && c != -1) { + nextc(p); + if (tokadd_mbchar(p, c) == -1) return 0; + } + else { + c = read_escape(p, 0, p->lex.pcur - rb_strlen_lit("?\\")); + tokadd(p, c); + } + } + else { + if (tokadd_mbchar(p, c) == -1) return 0; + } + tokfix(p); + lit = STR_NEW3(tok(p), toklen(p), enc, 0); + set_yylval_str(lit); + SET_LEX_STATE(EXPR_END); + return tCHAR; +} + +static enum yytokentype +parse_percent(struct parser_params *p, const int space_seen, const enum lex_state_e last_state) { - rb_warning("ambiguous first argument; put parentheses or even spaces"); + register int c; + const char *ptok = p->lex.pcur; + + if (IS_BEG()) { + int term; + int paren; + + c = nextc(p); + quotation: + if (c == -1) goto unterminated; + if (!ISALNUM(c)) { + term = c; + if (!ISASCII(c)) goto unknown; + c = 'Q'; + } + else { + term = nextc(p); + if (rb_enc_isalnum(term, p->enc) || !parser_isascii(p)) { + unknown: + pushback(p, term); + c = parser_precise_mbclen(p, p->lex.pcur); + if (c < 0) return 0; + p->lex.pcur += c; + yyerror0("unknown type of %string"); + return 0; + } + } + if (term == -1) { + unterminated: + compile_error(p, "unterminated quoted string meets end of file"); + return 0; + } + paren = term; + if (term == '(') term = ')'; + else if (term == '[') term = ']'; + else if (term == '{') term = '}'; + else if (term == '<') term = '>'; + else paren = 0; + + p->lex.ptok = ptok-1; + switch (c) { + case 'Q': + p->lex.strterm = NEW_STRTERM(str_dquote, term, paren); + return tSTRING_BEG; + + case 'q': + p->lex.strterm = NEW_STRTERM(str_squote, term, paren); + return tSTRING_BEG; + + case 'W': + p->lex.strterm = NEW_STRTERM(str_dword, term, paren); + return tWORDS_BEG; + + case 'w': + p->lex.strterm = NEW_STRTERM(str_sword, term, paren); + return tQWORDS_BEG; + + case 'I': + p->lex.strterm = NEW_STRTERM(str_dword, term, paren); + return tSYMBOLS_BEG; + + case 'i': + p->lex.strterm = NEW_STRTERM(str_sword, term, paren); + return tQSYMBOLS_BEG; + + case 'x': + p->lex.strterm = NEW_STRTERM(str_xquote, term, paren); + return tXSTRING_BEG; + + case 'r': + p->lex.strterm = NEW_STRTERM(str_regexp, term, paren); + return tREGEXP_BEG; + + case 's': + p->lex.strterm = NEW_STRTERM(str_ssym, term, paren); + SET_LEX_STATE(EXPR_FNAME|EXPR_FITEM); + return tSYMBEG; + + default: + yyerror0("unknown type of %string"); + return 0; + } + } + if ((c = nextc(p)) == '=') { + set_yylval_id('%'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + if (IS_SPCARG(c) || (IS_lex_state(EXPR_FITEM) && c == 's')) { + goto quotation; + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + pushback(p, c); + return warn_balanced('%', "%%", "string literal"); } -#define IS_ARG() (lex_state == EXPR_ARG || lex_state == EXPR_CMDARG) -#define IS_BEG() (lex_state == EXPR_BEG || lex_state == EXPR_MID || lex_state == EXPR_TERNARY) +static int +tokadd_ident(struct parser_params *p, int c) +{ + do { + if (tokadd_mbchar(p, c) == -1) return -1; + c = nextc(p); + } while (parser_is_identchar(p)); + pushback(p, c); + return 0; +} + +static ID +tokenize_ident(struct parser_params *p) +{ + ID ident = TOK_INTERN(); + + set_yylval_name(ident); + + return ident; +} static int -yylex() +parse_numvar(struct parser_params *p) +{ + size_t len; + int overflow; + unsigned long n = ruby_scan_digits(tok(p)+1, toklen(p)-1, 10, &len, &overflow); + const unsigned long nth_ref_max = + ((FIXNUM_MAX < INT_MAX) ? FIXNUM_MAX : INT_MAX) >> 1; + /* NTH_REF is left-shifted to be ORed with back-ref flag and + * turned into a Fixnum, in compile.c */ + + if (overflow || n > nth_ref_max) { + /* compile_error()? */ + rb_warn1("'%s' is too big for a number variable, always nil", WARN_S(tok(p))); + return 0; /* $0 is $PROGRAM_NAME, not NTH_REF */ + } + else { + return (int)n; + } +} + +static enum yytokentype +parse_gvar(struct parser_params *p, const enum lex_state_e last_state) +{ + const char *ptr = p->lex.pcur; + register int c; + + SET_LEX_STATE(EXPR_END); + p->lex.ptok = ptr - 1; /* from '$' */ + newtok(p); + c = nextc(p); + switch (c) { + case '_': /* $_: last read line string */ + c = nextc(p); + if (parser_is_identchar(p)) { + tokadd(p, '$'); + tokadd(p, '_'); + break; + } + pushback(p, c); + c = '_'; + /* fall through */ + case '~': /* $~: match-data */ + case '*': /* $*: argv */ + case '$': /* $$: pid */ + case '?': /* $?: last status */ + case '!': /* $!: error string */ + case '@': /* $@: error position */ + case '/': /* $/: input record separator */ + case '\\': /* $\: output record separator */ + case ';': /* $;: field separator */ + case ',': /* $,: output field separator */ + case '.': /* $.: last read line number */ + case '=': /* $=: ignorecase */ + case ':': /* $:: load path */ + case '<': /* $<: default input handle */ + case '>': /* $>: default output handle */ + case '\"': /* $": already loaded files */ + tokadd(p, '$'); + tokadd(p, c); + goto gvar; + + case '-': + tokadd(p, '$'); + tokadd(p, c); + c = nextc(p); + if (parser_is_identchar(p)) { + if (tokadd_mbchar(p, c) == -1) return 0; + } + else { + pushback(p, c); + pushback(p, '-'); + return '$'; + } + gvar: + tokenize_ident(p); + return tGVAR; + + case '&': /* $&: last match */ + case '`': /* $`: string before last match */ + case '\'': /* $': string after last match */ + case '+': /* $+: string matches last paren. */ + if (IS_lex_state_for(last_state, EXPR_FNAME)) { + tokadd(p, '$'); + tokadd(p, c); + goto gvar; + } + set_yylval_node(NEW_BACK_REF(c, &_cur_loc)); + return tBACK_REF; + + case '1': case '2': case '3': + case '4': case '5': case '6': + case '7': case '8': case '9': + tokadd(p, '$'); + do { + tokadd(p, c); + c = nextc(p); + } while (c != -1 && ISDIGIT(c)); + pushback(p, c); + if (IS_lex_state_for(last_state, EXPR_FNAME)) goto gvar; + tokfix(p); + c = parse_numvar(p); + set_yylval_node(NEW_NTH_REF(c, &_cur_loc)); + return tNTH_REF; + + default: + if (!parser_is_identchar(p)) { + YYLTYPE loc = RUBY_INIT_YYLLOC(); + if (c == -1 || ISSPACE(c)) { + compile_error(p, "'$' without identifiers is not allowed as a global variable name"); + } + else { + pushback(p, c); + compile_error(p, "'$%c' is not allowed as a global variable name", c); + } + parser_show_error_line(p, &loc); + set_yylval_noname(); + return tGVAR; + } + /* fall through */ + case '0': + tokadd(p, '$'); + } + + if (tokadd_ident(p, c)) return 0; + SET_LEX_STATE(EXPR_END); + if (VALID_SYMNAME_P(tok(p), toklen(p), p->enc, ID_GLOBAL)) { + tokenize_ident(p); + } + else { + compile_error(p, "'%.*s' is not allowed as a global variable name", toklen(p), tok(p)); + set_yylval_noname(); + } + return tGVAR; +} + +static bool +parser_numbered_param(struct parser_params *p, int n) +{ + if (n < 0) return false; + + if (DVARS_TERMINAL_P(p->lvtbl->args) || DVARS_TERMINAL_P(p->lvtbl->args->prev)) { + return false; + } + if (p->max_numparam == ORDINAL_PARAM) { + compile_error(p, "ordinary parameter is defined"); + return false; + } + struct vtable *args = p->lvtbl->args; + if (p->max_numparam < n) { + p->max_numparam = n; + } + while (n > args->pos) { + vtable_add(args, NUMPARAM_IDX_TO_ID(args->pos+1)); + } + return true; +} + +static enum yytokentype +parse_atmark(struct parser_params *p, const enum lex_state_e last_state) +{ + const char *ptr = p->lex.pcur; + enum yytokentype result = tIVAR; + register int c = nextc(p); + YYLTYPE loc; + + p->lex.ptok = ptr - 1; /* from '@' */ + newtok(p); + tokadd(p, '@'); + if (c == '@') { + result = tCVAR; + tokadd(p, '@'); + c = nextc(p); + } + SET_LEX_STATE(IS_lex_state_for(last_state, EXPR_FNAME) ? EXPR_ENDFN : EXPR_END); + if (c == -1 || !parser_is_identchar(p)) { + pushback(p, c); + RUBY_SET_YYLLOC(loc); + if (result == tIVAR) { + compile_error(p, "'@' without identifiers is not allowed as an instance variable name"); + } + else { + compile_error(p, "'@@' without identifiers is not allowed as a class variable name"); + } + parser_show_error_line(p, &loc); + set_yylval_noname(); + SET_LEX_STATE(EXPR_END); + return result; + } + else if (ISDIGIT(c)) { + pushback(p, c); + RUBY_SET_YYLLOC(loc); + if (result == tIVAR) { + compile_error(p, "'@%c' is not allowed as an instance variable name", c); + } + else { + compile_error(p, "'@@%c' is not allowed as a class variable name", c); + } + parser_show_error_line(p, &loc); + set_yylval_noname(); + SET_LEX_STATE(EXPR_END); + return result; + } + + if (tokadd_ident(p, c)) return 0; + tokenize_ident(p); + return result; +} + +static enum yytokentype +parse_ident(struct parser_params *p, int c, int cmd_state) +{ + enum yytokentype result; + bool is_ascii = true; + const enum lex_state_e last_state = p->lex.state; + ID ident; + int enforce_keyword_end = 0; + + do { + if (!ISASCII(c)) is_ascii = false; + if (tokadd_mbchar(p, c) == -1) return 0; + c = nextc(p); + } while (parser_is_identchar(p)); + if ((c == '!' || c == '?') && !peek(p, '=')) { + result = tFID; + tokadd(p, c); + } + else if (c == '=' && IS_lex_state(EXPR_FNAME) && + (!peek(p, '~') && !peek(p, '>') && (!peek(p, '=') || (peek_n(p, '>', 1))))) { + result = tIDENTIFIER; + tokadd(p, c); + } + else { + result = tCONSTANT; /* assume provisionally */ + pushback(p, c); + } + tokfix(p); + + if (IS_LABEL_POSSIBLE()) { + if (IS_LABEL_SUFFIX(0)) { + SET_LEX_STATE(EXPR_ARG|EXPR_LABELED); + nextc(p); + tokenize_ident(p); + return tLABEL; + } + } + +#ifndef RIPPER + if (peek_end_expect_token_locations(p)) { + const rb_code_position_t *end_pos; + int lineno, column; + int beg_pos = (int)(p->lex.ptok - p->lex.pbeg); + + end_pos = peek_end_expect_token_locations(p)->pos; + lineno = end_pos->lineno; + column = end_pos->column; + + if (p->debug) { + rb_parser_printf(p, "enforce_keyword_end check. current: (%d, %d), peek: (%d, %d)\n", + p->ruby_sourceline, beg_pos, lineno, column); + } + + if ((p->ruby_sourceline > lineno) && (beg_pos <= column)) { + const struct kwtable *kw; + + if ((IS_lex_state(EXPR_DOT)) && (kw = rb_reserved_word(tok(p), toklen(p))) && (kw && kw->id[0] == keyword_end)) { + if (p->debug) rb_parser_printf(p, "enforce_keyword_end is enabled\n"); + enforce_keyword_end = 1; + } + } + } +#endif + + if (is_ascii && (!IS_lex_state(EXPR_DOT) || enforce_keyword_end)) { + const struct kwtable *kw; + + /* See if it is a reserved word. */ + kw = rb_reserved_word(tok(p), toklen(p)); + if (kw) { + enum lex_state_e state = p->lex.state; + if (IS_lex_state_for(state, EXPR_FNAME)) { + SET_LEX_STATE(EXPR_ENDFN); + set_yylval_name(rb_intern2(tok(p), toklen(p))); + return kw->id[0]; + } + SET_LEX_STATE(kw->state); + if (IS_lex_state(EXPR_BEG)) { + p->command_start = TRUE; + } + if (kw->id[0] == keyword_do) { + if (lambda_beginning_p()) { + p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE in the body of "-> do ... end" */ + return keyword_do_LAMBDA; + } + if (COND_P()) return keyword_do_cond; + if (CMDARG_P() && !IS_lex_state_for(state, EXPR_CMDARG)) + return keyword_do_block; + return keyword_do; + } + if (IS_lex_state_for(state, (EXPR_BEG | EXPR_LABELED | EXPR_CLASS))) + return kw->id[0]; + else { + if (kw->id[0] != kw->id[1]) + SET_LEX_STATE(EXPR_BEG | EXPR_LABEL); + return kw->id[1]; + } + } + } + + if (IS_lex_state(EXPR_BEG_ANY | EXPR_ARG_ANY | EXPR_DOT)) { + if (cmd_state) { + SET_LEX_STATE(EXPR_CMDARG); + } + else { + SET_LEX_STATE(EXPR_ARG); + } + } + else if (p->lex.state == EXPR_FNAME) { + SET_LEX_STATE(EXPR_ENDFN); + } + else { + SET_LEX_STATE(EXPR_END); + } + + ident = tokenize_ident(p); + if (result == tCONSTANT && is_local_id(ident)) result = tIDENTIFIER; + if (!IS_lex_state_for(last_state, EXPR_DOT|EXPR_FNAME) && + (result == tIDENTIFIER) && /* not EXPR_FNAME, not attrasgn */ + (lvar_defined(p, ident) || NUMPARAM_ID_P(ident))) { + SET_LEX_STATE(EXPR_END|EXPR_LABEL); + } + return result; +} + +static void +warn_cr(struct parser_params *p) +{ + if (!p->cr_seen) { + p->cr_seen = TRUE; + /* carried over with p->lex.nextline for nextc() */ + rb_warn0("encountered \\r in middle of line, treated as a mere space"); + } +} + +static enum yytokentype +parser_yylex(struct parser_params *p) { register int c; int space_seen = 0; int cmd_state; - - if (lex_strterm) { - int token; - if (nd_type(lex_strterm) == NODE_HEREDOC) { - token = here_document(lex_strterm); - if (token == tSTRING_END) { - lex_strterm = 0; - lex_state = EXPR_END; - } - } - else { - token = parse_string(lex_strterm); - if (token == tSTRING_END || token == tREGEXP_END) { - rb_gc_force_recycle((VALUE)lex_strterm); - lex_strterm = 0; - lex_state = EXPR_END; - } - } - return token; - } - cmd_state = command_start; - command_start = Qfalse; + int label; + enum lex_state_e last_state; + int fallthru = FALSE; + int token_seen = p->token_seen; + + if (p->lex.strterm) { + if (strterm_is_heredoc(p->lex.strterm)) { + token_flush(p); + return here_document(p, &p->lex.strterm->u.heredoc); + } + else { + token_flush(p); + return parse_string(p, &p->lex.strterm->u.literal); + } + } + cmd_state = p->command_start; + p->command_start = FALSE; + p->token_seen = TRUE; +#ifndef RIPPER + token_flush(p); +#endif retry: - switch (c = nextc()) { + last_state = p->lex.state; + switch (c = nextc(p)) { case '\0': /* NUL */ case '\004': /* ^D */ case '\032': /* ^Z */ case -1: /* end of script. */ - return 0; - - /* white spaces */ - case ' ': case '\t': case '\f': case '\r': + p->eofp = 1; +#ifndef RIPPER + if (p->end_expect_token_locations) { + pop_end_expect_token_locations(p); + RUBY_SET_YYLLOC_OF_DUMMY_END(*p->yylloc); + return tDUMNY_END; + } +#endif + /* Set location for end-of-input because dispatch_scan_event is not called. */ + RUBY_SET_YYLLOC(*p->yylloc); + return END_OF_INPUT; + + /* white spaces */ + case '\r': + warn_cr(p); + /* fall through */ + case ' ': case '\t': case '\f': case '\13': /* '\v' */ - space_seen++; - goto retry; + space_seen = 1; + while ((c = nextc(p))) { + switch (c) { + case '\r': + warn_cr(p); + /* fall through */ + case ' ': case '\t': case '\f': + case '\13': /* '\v' */ + break; + default: + goto outofloop; + } + } + outofloop: + pushback(p, c); + dispatch_scan_event(p, tSP); +#ifndef RIPPER + token_flush(p); +#endif + goto retry; case '#': /* it's a comment */ - while ((c = nextc()) != '\n') { - if (c == -1) - return 0; - } - /* fall through */ + p->token_seen = token_seen; + const char *const pcur = p->lex.pcur, *const ptok = p->lex.ptok; + /* no magic_comment in shebang line */ + if (!parser_magic_comment(p, p->lex.pcur, p->lex.pend - p->lex.pcur)) { + if (comment_at_top(p)) { + set_file_encoding(p, p->lex.pcur, p->lex.pend); + } + } + p->lex.pcur = pcur, p->lex.ptok = ptok; + lex_goto_eol(p); + dispatch_scan_event(p, tCOMMENT); + fallthru = TRUE; + /* fall through */ case '\n': - switch (lex_state) { - case EXPR_BEG: - case EXPR_FNAME: - case EXPR_DOT: - case EXPR_CLASS: - case EXPR_TERNARY: - goto retry; - default: - break; - } - command_start = Qtrue; - lex_state = EXPR_BEG; - return '\n'; + p->token_seen = token_seen; + rb_parser_string_t *prevline = p->lex.lastline; + c = (IS_lex_state(EXPR_BEG|EXPR_CLASS|EXPR_FNAME|EXPR_DOT) && + !IS_lex_state(EXPR_LABELED)); + if (c || IS_lex_state_all(EXPR_ARG|EXPR_LABELED)) { + if (!fallthru) { + dispatch_scan_event(p, tIGNORED_NL); + } + fallthru = FALSE; + if (!c && p->ctxt.in_kwarg) { + goto normal_newline; + } + goto retry; + } + while (1) { + switch (c = nextc(p)) { + case ' ': case '\t': case '\f': case '\r': + case '\13': /* '\v' */ + space_seen = 1; + break; + case '#': + pushback(p, c); + if (space_seen) { + dispatch_scan_event(p, tSP); + token_flush(p); + } + goto retry; + case 'a': + if (peek_word_at(p, "nd", 2, 0)) goto leading_logical; + goto bol; + case 'o': + if (peek_word_at(p, "r", 1, 0)) goto leading_logical; + goto bol; + case '|': + if (peek(p, '|')) goto leading_logical; + goto bol; + case '&': + if (peek(p, '&')) { + leading_logical: + pushback(p, c); + dispatch_delayed_token(p, tIGNORED_NL); + cmd_state = FALSE; + goto retry; + } + /* fall through */ + case '.': { + dispatch_delayed_token(p, tIGNORED_NL); + if (peek(p, '.') == (c == '&')) { + pushback(p, c); + dispatch_scan_event(p, tSP); + goto retry; + } + } + bol: + default: + p->ruby_sourceline--; + p->lex.nextline = p->lex.lastline; + set_lastline(p, prevline); + case -1: /* EOF no decrement*/ + if (c == -1 && space_seen) { + dispatch_scan_event(p, tSP); + } + lex_goto_eol(p); + if (c != -1) { + token_flush(p); + RUBY_SET_YYLLOC(*p->yylloc); + } + goto normal_newline; + } + } + normal_newline: + p->command_start = TRUE; + SET_LEX_STATE(EXPR_BEG); + return '\n'; case '*': - if ((c = nextc()) == '*') { - if ((c = nextc()) == '=') { - yylval.id = tPOW; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - c = tPOW; - } - else { - if (c == '=') { - yylval.id = '*'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - if (IS_ARG() && space_seen && !ISSPACE(c)){ - rb_warning("`*' interpreted as argument prefix"); - c = tSTAR; - } - else if (IS_BEG()) { - c = tSTAR; - } - else { - c = '*'; - } - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - return c; + if ((c = nextc(p)) == '*') { + if ((c = nextc(p)) == '=') { + set_yylval_id(idPow); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + if (IS_SPCARG(c)) { + rb_warning0("'**' interpreted as argument prefix"); + c = tDSTAR; + } + else if (IS_BEG()) { + c = tDSTAR; + } + else { + c = warn_balanced((enum ruby_method_ids)tPOW, "**", "argument prefix"); + } + } + else { + if (c == '=') { + set_yylval_id('*'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + if (IS_SPCARG(c)) { + rb_warning0("'*' interpreted as argument prefix"); + c = tSTAR; + } + else if (IS_BEG()) { + c = tSTAR; + } + else { + c = warn_balanced('*', "*", "argument prefix"); + } + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + return c; case '!': - lex_state = EXPR_BEG; - if ((c = nextc()) == '=') { - return tNEQ; - } - if (c == '~') { - return tNMATCH; - } - pushback(c); - return '!'; + c = nextc(p); + if (IS_AFTER_OPERATOR()) { + SET_LEX_STATE(EXPR_ARG); + if (c == '@') { + return '!'; + } + } + else { + SET_LEX_STATE(EXPR_BEG); + } + if (c == '=') { + return tNEQ; + } + if (c == '~') { + return tNMATCH; + } + pushback(p, c); + return '!'; case '=': - if (was_bol()) { - /* skip embedded rd document */ - if (strncmp(lex_p, "begin", 5) == 0 && ISSPACE(lex_p[5])) { - for (;;) { - lex_p = lex_pend; - c = nextc(); - if (c == -1) { - rb_compile_error("embedded document meets end of file"); - return 0; - } - if (c != '=') continue; - if (strncmp(lex_p, "end", 3) == 0 && - (lex_p + 3 == lex_pend || ISSPACE(lex_p[3]))) { - break; - } - } - lex_p = lex_pend; - goto retry; - } - } - - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - if ((c = nextc()) == '=') { - if ((c = nextc()) == '=') { - return tEQQ; - } - pushback(c); - return tEQ; - } - if (c == '~') { - return tMATCH; - } - else if (c == '>') { - return tASSOC; - } - pushback(c); - return '='; + if (was_bol(p)) { + /* skip embedded rd document */ + if (word_match_p(p, "begin", 5)) { + int first_p = TRUE; + + lex_goto_eol(p); + dispatch_scan_event(p, tEMBDOC_BEG); + for (;;) { + lex_goto_eol(p); + if (!first_p) { + dispatch_scan_event(p, tEMBDOC); + } + first_p = FALSE; + c = nextc(p); + if (c == -1) { + compile_error(p, "embedded document meets end of file"); + return END_OF_INPUT; + } + if (c == '=' && word_match_p(p, "end", 3)) { + break; + } + pushback(p, c); + } + lex_goto_eol(p); + dispatch_scan_event(p, tEMBDOC_END); + goto retry; + } + } + + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + if ((c = nextc(p)) == '=') { + if ((c = nextc(p)) == '=') { + return tEQQ; + } + pushback(p, c); + return tEQ; + } + if (c == '~') { + return tMATCH; + } + else if (c == '>') { + return tASSOC; + } + pushback(p, c); + return '='; case '<': - c = nextc(); - if (c == '<' && - lex_state != EXPR_END && - lex_state != EXPR_DOT && - lex_state != EXPR_ENDARG && - lex_state != EXPR_CLASS && - (!IS_ARG() || space_seen)) { - int token = heredoc_identifier(); - if (token) return token; - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - if (c == '=') { - if ((c = nextc()) == '>') { - return tCMP; - } - pushback(c); - return tLEQ; - } - if (c == '<') { - if ((c = nextc()) == '=') { - yylval.id = tLSHFT; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - return tLSHFT; - } - pushback(c); - return '<'; + c = nextc(p); + if (c == '<' && + !IS_lex_state(EXPR_DOT | EXPR_CLASS) && + !IS_END() && + (!IS_ARG() || IS_lex_state(EXPR_LABELED) || space_seen)) { + enum yytokentype token = heredoc_identifier(p); + if (token) return token < 0 ? 0 : token; + } + if (IS_AFTER_OPERATOR()) { + SET_LEX_STATE(EXPR_ARG); + } + else { + if (IS_lex_state(EXPR_CLASS)) + p->command_start = TRUE; + SET_LEX_STATE(EXPR_BEG); + } + if (c == '=') { + if ((c = nextc(p)) == '>') { + return tCMP; + } + pushback(p, c); + return tLEQ; + } + if (c == '<') { + if ((c = nextc(p)) == '=') { + set_yylval_id(idLTLT); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + return warn_balanced((enum ruby_method_ids)tLSHFT, "<<", "here document"); + } + pushback(p, c); + return '<'; case '>': - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - if ((c = nextc()) == '=') { - return tGEQ; - } - if (c == '>') { - if ((c = nextc()) == '=') { - yylval.id = tRSHFT; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - return tRSHFT; - } - pushback(c); - return '>'; + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + if ((c = nextc(p)) == '=') { + return tGEQ; + } + if (c == '>') { + if ((c = nextc(p)) == '=') { + set_yylval_id(idGTGT); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + return tRSHFT; + } + pushback(p, c); + return '>'; case '"': - lex_strterm = NEW_STRTERM(str_dquote, '"', 0); - return tSTRING_BEG; + label = (IS_LABEL_POSSIBLE() ? str_label : 0); + p->lex.strterm = NEW_STRTERM(str_dquote | label, '"', 0); + p->lex.ptok = p->lex.pcur-1; + return tSTRING_BEG; case '`': - if (lex_state == EXPR_FNAME) { - lex_state = EXPR_END; - return c; - } - if (lex_state == EXPR_DOT) { - if (cmd_state) - lex_state = EXPR_CMDARG; - else - lex_state = EXPR_ARG; - return c; - } - lex_strterm = NEW_STRTERM(str_xquote, '`', 0); - return tXSTRING_BEG; + if (IS_lex_state(EXPR_FNAME)) { + SET_LEX_STATE(EXPR_ENDFN); + return c; + } + if (IS_lex_state(EXPR_DOT)) { + if (cmd_state) + SET_LEX_STATE(EXPR_CMDARG); + else + SET_LEX_STATE(EXPR_ARG); + return c; + } + p->lex.strterm = NEW_STRTERM(str_xquote, '`', 0); + return tXSTRING_BEG; case '\'': - lex_strterm = NEW_STRTERM(str_squote, '\'', 0); - return tSTRING_BEG; + label = (IS_LABEL_POSSIBLE() ? str_label : 0); + p->lex.strterm = NEW_STRTERM(str_squote | label, '\'', 0); + p->lex.ptok = p->lex.pcur-1; + return tSTRING_BEG; case '?': - if (lex_state == EXPR_END || lex_state == EXPR_ENDARG) { - lex_state = EXPR_TERNARY; - return '?'; - } - c = nextc(); - if (c == -1) { - rb_compile_error("incomplete character syntax"); - return 0; - } - if (ISSPACE(c)){ - if (!IS_ARG()){ - int c2 = 0; - switch (c) { - case ' ': - c2 = 's'; - break; - case '\n': - c2 = 'n'; - break; - case '\t': - c2 = 't'; - break; - case '\v': - c2 = 'v'; - break; - case '\r': - c2 = 'r'; - break; - case '\f': - c2 = 'f'; - break; - } - if (c2) { - rb_warn("invalid character syntax; use ?\\%c", c2); - } - } - ternary: - pushback(c); - lex_state = EXPR_TERNARY; - return '?'; - } - else if (ismbchar(c)) { - rb_warn("multibyte character literal not supported yet; use ?\\%.3o", c); - goto ternary; - } - else if ((ISALNUM(c) || c == '_') && lex_p < lex_pend && is_identchar(*lex_p)) { - goto ternary; - } - else if (c == '\\') { - c = read_escape(); - } - c &= 0xff; - lex_state = EXPR_END; - yylval.node = NEW_LIT(INT2FIX(c)); - return tINTEGER; + return parse_qmark(p, space_seen); case '&': - if ((c = nextc()) == '&') { - lex_state = EXPR_BEG; - if ((c = nextc()) == '=') { - yylval.id = tANDOP; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - return tANDOP; - } - else if (c == '=') { - yylval.id = '&'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - if (IS_ARG() && space_seen && !ISSPACE(c)){ - rb_warning("`&' interpreted as argument prefix"); - c = tAMPER; - } - else if (IS_BEG()) { - c = tAMPER; - } - else { - c = '&'; - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; - } - return c; + if ((c = nextc(p)) == '&') { + SET_LEX_STATE(EXPR_BEG); + if ((c = nextc(p)) == '=') { + set_yylval_id(idANDOP); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + return tANDOP; + } + else if (c == '=') { + set_yylval_id('&'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + else if (c == '.') { + set_yylval_id(idANDDOT); + SET_LEX_STATE(EXPR_DOT); + return tANDDOT; + } + pushback(p, c); + if (IS_SPCARG(c)) { + if ((c != ':') || + (c = peekc_n(p, 1)) == -1 || + !(c == '\'' || c == '"' || + is_identchar(p, (p->lex.pcur+1), p->lex.pend, p->enc))) { + rb_warning0("'&' interpreted as argument prefix"); + } + c = tAMPER; + } + else if (IS_BEG()) { + c = tAMPER; + } + else { + c = warn_balanced('&', "&", "argument prefix"); + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + return c; case '|': - if ((c = nextc()) == '|') { - lex_state = EXPR_BEG; - if ((c = nextc()) == '=') { - yylval.id = tOROP; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - return tOROP; - } - if (c == '=') { - yylval.id = '|'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - if (lex_state == EXPR_FNAME || lex_state == EXPR_DOT) { - lex_state = EXPR_ARG; - } - else { - lex_state = EXPR_BEG; - } - pushback(c); - return '|'; + if ((c = nextc(p)) == '|') { + SET_LEX_STATE(EXPR_BEG); + if ((c = nextc(p)) == '=') { + set_yylval_id(idOROP); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + if (IS_lex_state_for(last_state, EXPR_BEG)) { + c = '|'; + pushback(p, '|'); + return c; + } + return tOROP; + } + if (c == '=') { + set_yylval_id('|'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG|EXPR_LABEL); + pushback(p, c); + return '|'; case '+': - c = nextc(); - if (lex_state == EXPR_FNAME || lex_state == EXPR_DOT) { - lex_state = EXPR_ARG; - if (c == '@') { - return tUPLUS; - } - pushback(c); - return '+'; - } - if (c == '=') { - yylval.id = '+'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - if (IS_BEG() || - (IS_ARG() && space_seen && !ISSPACE(c))) { - if (IS_ARG()) arg_ambiguous(); - lex_state = EXPR_BEG; - pushback(c); - if (ISDIGIT(c)) { - c = '+'; - goto start_num; - } - return tUPLUS; - } - lex_state = EXPR_BEG; - pushback(c); - return '+'; + c = nextc(p); + if (IS_AFTER_OPERATOR()) { + SET_LEX_STATE(EXPR_ARG); + if (c == '@') { + return tUPLUS; + } + pushback(p, c); + return '+'; + } + if (c == '=') { + set_yylval_id('+'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '+'))) { + SET_LEX_STATE(EXPR_BEG); + pushback(p, c); + if (c != -1 && ISDIGIT(c)) { + return parse_numeric(p, '+'); + } + return tUPLUS; + } + SET_LEX_STATE(EXPR_BEG); + pushback(p, c); + return warn_balanced('+', "+", "unary operator"); case '-': - c = nextc(); - if (lex_state == EXPR_FNAME || lex_state == EXPR_DOT) { - lex_state = EXPR_ARG; - if (c == '@') { - return tUMINUS; - } - pushback(c); - return '-'; - } - if (c == '=') { - yylval.id = '-'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - if (IS_BEG() || - (IS_ARG() && space_seen && !ISSPACE(c))) { - if (IS_ARG()) arg_ambiguous(); - lex_state = EXPR_BEG; - pushback(c); - if (ISDIGIT(c)) { - return tUMINUS_NUM; - } - return tUMINUS; - } - lex_state = EXPR_BEG; - pushback(c); - return '-'; - - case '.': - lex_state = EXPR_BEG; - if ((c = nextc()) == '.') { - if ((c = nextc()) == '.') { - return tDOT3; - } - pushback(c); - return tDOT2; - } - pushback(c); - if (ISDIGIT(c)) { - yyerror("no .<digit> floating literal anymore; put 0 before dot"); - } - lex_state = EXPR_DOT; - return '.'; - - start_num: + c = nextc(p); + if (IS_AFTER_OPERATOR()) { + SET_LEX_STATE(EXPR_ARG); + if (c == '@') { + return tUMINUS; + } + pushback(p, c); + return '-'; + } + if (c == '=') { + set_yylval_id('-'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + if (c == '>') { + SET_LEX_STATE(EXPR_ENDFN); + yylval.num = p->lex.lpar_beg; + p->lex.lpar_beg = p->lex.paren_nest; + return tLAMBDA; + } + if (IS_BEG() || (IS_SPCARG(c) && arg_ambiguous(p, '-'))) { + SET_LEX_STATE(EXPR_BEG); + pushback(p, c); + if (c != -1 && ISDIGIT(c)) { + return tUMINUS_NUM; + } + return tUMINUS; + } + SET_LEX_STATE(EXPR_BEG); + pushback(p, c); + return warn_balanced('-', "-", "unary operator"); + + case '.': { + int is_beg = IS_BEG(); + SET_LEX_STATE(EXPR_BEG); + if ((c = nextc(p)) == '.') { + if ((c = nextc(p)) == '.') { + if (p->ctxt.in_argdef || IS_LABEL_POSSIBLE()) { + SET_LEX_STATE(EXPR_ENDARG); + return tBDOT3; + } + if (p->lex.paren_nest == 0 && looking_at_eol_p(p)) { + rb_warn0("... at EOL, should be parenthesized?"); + } + return is_beg ? tBDOT3 : tDOT3; + } + pushback(p, c); + return is_beg ? tBDOT2 : tDOT2; + } + pushback(p, c); + if (c != -1 && ISDIGIT(c)) { + char prev = p->lex.pcur-1 > p->lex.pbeg ? *(p->lex.pcur-2) : 0; + parse_numeric(p, '.'); + if (ISDIGIT(prev)) { + yyerror0("unexpected fraction part after numeric literal"); + } + else { + yyerror0("no .<digit> floating literal anymore; put 0 before dot"); + } + SET_LEX_STATE(EXPR_END); + p->lex.ptok = p->lex.pcur; + goto retry; + } + set_yylval_id('.'); + SET_LEX_STATE(EXPR_DOT); + return '.'; + } + case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': - { - int is_float, seen_point, seen_e, nondigit; - - is_float = seen_point = seen_e = nondigit = 0; - lex_state = EXPR_END; - newtok(); - if (c == '-' || c == '+') { - tokadd(c); - c = nextc(); - } - if (c == '0') { - int start = toklen(); - c = nextc(); - if (c == 'x' || c == 'X') { - /* hexadecimal */ - c = nextc(); - if (ISXDIGIT(c)) { - do { - if (c == '_') { - if (nondigit) break; - nondigit = c; - continue; - } - if (!ISXDIGIT(c)) break; - nondigit = 0; - tokadd(c); - } while ((c = nextc()) != -1); - } - pushback(c); - tokfix(); - if (toklen() == start) { - yyerror("numeric literal without digits"); - } - else if (nondigit) goto trailing_uc; - yylval.node = NEW_LIT(rb_cstr_to_inum(tok(), 16, Qfalse)); - return tINTEGER; - } - if (c == 'b' || c == 'B') { - /* binary */ - c = nextc(); - if (c == '0' || c == '1') { - do { - if (c == '_') { - if (nondigit) break; - nondigit = c; - continue; - } - if (c != '0' && c != '1') break; - nondigit = 0; - tokadd(c); - } while ((c = nextc()) != -1); - } - pushback(c); - tokfix(); - if (toklen() == start) { - yyerror("numeric literal without digits"); - } - else if (nondigit) goto trailing_uc; - yylval.node = NEW_LIT(rb_cstr_to_inum(tok(), 2, Qfalse)); - return tINTEGER; - } - if (c == 'd' || c == 'D') { - /* decimal */ - c = nextc(); - if (ISDIGIT(c)) { - do { - if (c == '_') { - if (nondigit) break; - nondigit = c; - continue; - } - if (!ISDIGIT(c)) break; - nondigit = 0; - tokadd(c); - } while ((c = nextc()) != -1); - } - pushback(c); - tokfix(); - if (toklen() == start) { - yyerror("numeric literal without digits"); - } - else if (nondigit) goto trailing_uc; - yylval.node = NEW_LIT(rb_cstr_to_inum(tok(), 10, Qfalse)); - return tINTEGER; - } - if (c == '_') { - /* 0_0 */ - goto octal_number; - } - if (c == 'o' || c == 'O') { - /* prefixed octal */ - c = nextc(); - if (c == '_') { - yyerror("numeric literal without digits"); - } - } - if (c >= '0' && c <= '7') { - /* octal */ - octal_number: - do { - if (c == '_') { - if (nondigit) break; - nondigit = c; - continue; - } - if (c < '0' || c > '7') break; - nondigit = 0; - tokadd(c); - } while ((c = nextc()) != -1); - if (toklen() > start) { - pushback(c); - tokfix(); - if (nondigit) goto trailing_uc; - yylval.node = NEW_LIT(rb_cstr_to_inum(tok(), 8, Qfalse)); - return tINTEGER; - } - if (nondigit) { - pushback(c); - goto trailing_uc; - } - } - if (c > '7' && c <= '9') { - yyerror("Illegal octal digit"); - } - else if (c == '.' || c == 'e' || c == 'E') { - tokadd('0'); - } - else { - pushback(c); - yylval.node = NEW_LIT(INT2FIX(0)); - return tINTEGER; - } - } - - for (;;) { - switch (c) { - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': - nondigit = 0; - tokadd(c); - break; - - case '.': - if (nondigit) goto trailing_uc; - if (seen_point || seen_e) { - goto decode_num; - } - else { - int c0 = nextc(); - if (!ISDIGIT(c0)) { - pushback(c0); - goto decode_num; - } - c = c0; - } - tokadd('.'); - tokadd(c); - is_float++; - seen_point++; - nondigit = 0; - break; - - case 'e': - case 'E': - if (nondigit) { - pushback(c); - c = nondigit; - goto decode_num; - } - if (seen_e) { - goto decode_num; - } - tokadd(c); - seen_e++; - is_float++; - nondigit = c; - c = nextc(); - if (c != '-' && c != '+') continue; - tokadd(c); - nondigit = c; - break; - - case '_': /* `_' in number just ignored */ - if (nondigit) goto decode_num; - nondigit = c; - break; - - default: - goto decode_num; - } - c = nextc(); - } - - decode_num: - pushback(c); - tokfix(); - if (nondigit) { - char tmp[30]; - trailing_uc: - sprintf(tmp, "trailing `%c' in number", nondigit); - yyerror(tmp); - } - if (is_float) { - double d = strtod(tok(), 0); - if (errno == ERANGE) { - rb_warn("Float %s out of range", tok()); - errno = 0; - } - yylval.node = NEW_LIT(rb_float_new(d)); - return tFLOAT; - } - yylval.node = NEW_LIT(rb_cstr_to_inum(tok(), 10, Qfalse)); - return tINTEGER; - } + return parse_numeric(p, c); + + case ')': + COND_POP(); + CMDARG_POP(); + SET_LEX_STATE(EXPR_ENDFN); + p->lex.paren_nest--; + return c; case ']': + COND_POP(); + CMDARG_POP(); + SET_LEX_STATE(EXPR_END); + p->lex.paren_nest--; + return c; + case '}': - case ')': - COND_LEXPOP(); - CMDARG_LEXPOP(); - lex_state = EXPR_END; - return c; + /* tSTRING_DEND does COND_POP and CMDARG_POP in the yacc's rule */ + if (!p->lex.brace_nest--) return tSTRING_DEND; + COND_POP(); + CMDARG_POP(); + SET_LEX_STATE(EXPR_END); + p->lex.paren_nest--; + return c; case ':': - c = nextc(); - if (c == ':') { - if (IS_BEG() || - lex_state == EXPR_CLASS || (IS_ARG() && space_seen)) { - lex_state = EXPR_BEG; - return tCOLON3; - } - lex_state = EXPR_DOT; - return tCOLON2; - } - if (lex_state == EXPR_END || lex_state == EXPR_ENDARG || ISSPACE(c)) { - pushback(c); - lex_state = EXPR_BEG; - return ':'; - } - switch (c) { - case '\'': - lex_strterm = NEW_STRTERM(str_ssym, c, 0); - break; - case '"': - lex_strterm = NEW_STRTERM(str_dsym, c, 0); - break; - default: - pushback(c); - break; - } - lex_state = EXPR_FNAME; - return tSYMBEG; + c = nextc(p); + if (c == ':') { + if (IS_BEG() || IS_lex_state(EXPR_CLASS) || IS_SPCARG(-1)) { + SET_LEX_STATE(EXPR_BEG); + return tCOLON3; + } + set_yylval_id(idCOLON2); + SET_LEX_STATE(EXPR_DOT); + return tCOLON2; + } + if (IS_END() || ISSPACE(c) || c == '#') { + pushback(p, c); + c = warn_balanced(':', ":", "symbol literal"); + SET_LEX_STATE(EXPR_BEG); + return c; + } + switch (c) { + case '\'': + p->lex.strterm = NEW_STRTERM(str_ssym, c, 0); + break; + case '"': + p->lex.strterm = NEW_STRTERM(str_dsym, c, 0); + break; + default: + pushback(p, c); + break; + } + SET_LEX_STATE(EXPR_FNAME); + return tSYMBEG; case '/': - if (IS_BEG()) { - lex_strterm = NEW_STRTERM(str_regexp, '/', 0); - return tREGEXP_BEG; - } - if ((c = nextc()) == '=') { - yylval.id = '/'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - pushback(c); - if (IS_ARG() && space_seen) { - if (!ISSPACE(c)) { - arg_ambiguous(); - lex_strterm = NEW_STRTERM(str_regexp, '/', 0); - return tREGEXP_BEG; - } - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - return '/'; + if (IS_BEG()) { + p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0); + return tREGEXP_BEG; + } + if ((c = nextc(p)) == '=') { + set_yylval_id('/'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + pushback(p, c); + if (IS_SPCARG(c)) { + arg_ambiguous(p, '/'); + p->lex.strterm = NEW_STRTERM(str_regexp, '/', 0); + return tREGEXP_BEG; + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + return warn_balanced('/', "/", "regexp literal"); case '^': - if ((c = nextc()) == '=') { - yylval.id = '^'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - pushback(c); - return '^'; + if ((c = nextc(p)) == '=') { + set_yylval_id('^'); + SET_LEX_STATE(EXPR_BEG); + return tOP_ASGN; + } + SET_LEX_STATE(IS_AFTER_OPERATOR() ? EXPR_ARG : EXPR_BEG); + pushback(p, c); + return '^'; case ';': - command_start = Qtrue; + SET_LEX_STATE(EXPR_BEG); + p->command_start = TRUE; + return ';'; + case ',': - lex_state = EXPR_BEG; - return c; + SET_LEX_STATE(EXPR_BEG|EXPR_LABEL); + return ','; case '~': - if (lex_state == EXPR_FNAME || lex_state == EXPR_DOT) { - if ((c = nextc()) != '@') { - pushback(c); - } - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - return '~'; + if (IS_AFTER_OPERATOR()) { + if ((c = nextc(p)) != '@') { + pushback(p, c); + } + SET_LEX_STATE(EXPR_ARG); + } + else { + SET_LEX_STATE(EXPR_BEG); + } + return '~'; case '(': - command_start = Qtrue; - if (IS_BEG()) { - c = tLPAREN; - } - else if (space_seen) { - if (lex_state == EXPR_CMDARG) { - c = tLPAREN_ARG; - } - else if (lex_state == EXPR_ARG) { - rb_warn("don't put space before argument parentheses"); - c = '('; - } - } - COND_PUSH(0); - CMDARG_PUSH(0); - lex_state = EXPR_BEG; - return c; + if (IS_BEG()) { + c = tLPAREN; + } + else if (!space_seen) { + /* foo( ... ) => method call, no ambiguity */ + } + else if (IS_ARG() || IS_lex_state_all(EXPR_END|EXPR_LABEL)) { + c = tLPAREN_ARG; + } + else if (IS_lex_state(EXPR_ENDFN) && !lambda_beginning_p()) { + rb_warning0("parentheses after method name is interpreted as " + "an argument list, not a decomposed argument"); + } + p->lex.paren_nest++; + COND_PUSH(0); + CMDARG_PUSH(0); + SET_LEX_STATE(EXPR_BEG|EXPR_LABEL); + return c; case '[': - if (lex_state == EXPR_FNAME || lex_state == EXPR_DOT) { - lex_state = EXPR_ARG; - if ((c = nextc()) == ']') { - if ((c = nextc()) == '=') { - return tASET; - } - pushback(c); - return tAREF; - } - pushback(c); - return '['; - } - else if (IS_BEG()) { - c = tLBRACK; - } - else if (IS_ARG() && space_seen) { - c = tLBRACK; - } - lex_state = EXPR_BEG; - COND_PUSH(0); - CMDARG_PUSH(0); - return c; + p->lex.paren_nest++; + if (IS_AFTER_OPERATOR()) { + if ((c = nextc(p)) == ']') { + p->lex.paren_nest--; + SET_LEX_STATE(EXPR_ARG); + if ((c = nextc(p)) == '=') { + return tASET; + } + pushback(p, c); + return tAREF; + } + pushback(p, c); + SET_LEX_STATE(EXPR_ARG|EXPR_LABEL); + return '['; + } + else if (IS_BEG()) { + c = tLBRACK; + } + else if (IS_ARG() && (space_seen || IS_lex_state(EXPR_LABELED))) { + c = tLBRACK; + } + SET_LEX_STATE(EXPR_BEG|EXPR_LABEL); + COND_PUSH(0); + CMDARG_PUSH(0); + return c; case '{': - if (IS_ARG() || lex_state == EXPR_END) - c = '{'; /* block (primary) */ - else if (lex_state == EXPR_ENDARG) - c = tLBRACE_ARG; /* block (expr) */ - else - c = tLBRACE; /* hash */ - COND_PUSH(0); - CMDARG_PUSH(0); - lex_state = EXPR_BEG; - return c; + ++p->lex.brace_nest; + if (lambda_beginning_p()) + c = tLAMBEG; + else if (IS_lex_state(EXPR_LABELED)) + c = tLBRACE; /* hash */ + else if (IS_lex_state(EXPR_ARG_ANY | EXPR_END | EXPR_ENDFN)) + c = '{'; /* block (primary) */ + else if (IS_lex_state(EXPR_ENDARG)) + c = tLBRACE_ARG; /* block (expr) */ + else + c = tLBRACE; /* hash */ + if (c != tLBRACE) { + p->command_start = TRUE; + SET_LEX_STATE(EXPR_BEG); + } + else { + SET_LEX_STATE(EXPR_BEG|EXPR_LABEL); + } + ++p->lex.paren_nest; /* after lambda_beginning_p() */ + COND_PUSH(0); + CMDARG_PUSH(0); + return c; case '\\': - c = nextc(); - if (c == '\n') { - space_seen = 1; - goto retry; /* skip \\n */ - } - pushback(c); - return '\\'; + c = nextc(p); + if (c == '\n') { + space_seen = 1; + dispatch_scan_event(p, tSP); + goto retry; /* skip \\n */ + } + if (c == ' ') return tSP; + if (ISSPACE(c)) return c; + pushback(p, c); + return '\\'; case '%': - if (IS_BEG()) { - int term; - int paren; - - c = nextc(); - quotation: - if (!ISALNUM(c)) { - term = c; - c = 'Q'; - } - else { - term = nextc(); - if (ISALNUM(term) || ismbchar(term)) { - yyerror("unknown type of %string"); - return 0; - } - } - if (c == -1 || term == -1) { - rb_compile_error("unterminated quoted string meets end of file"); - return 0; - } - paren = term; - if (term == '(') term = ')'; - else if (term == '[') term = ']'; - else if (term == '{') term = '}'; - else if (term == '<') term = '>'; - else paren = 0; - - switch (c) { - case 'Q': - lex_strterm = NEW_STRTERM(str_dquote, term, paren); - return tSTRING_BEG; - - case 'q': - lex_strterm = NEW_STRTERM(str_squote, term, paren); - return tSTRING_BEG; - - case 'W': - lex_strterm = NEW_STRTERM(str_dquote | STR_FUNC_QWORDS, term, paren); - do {c = nextc();} while (ISSPACE(c)); - pushback(c); - return tWORDS_BEG; - - case 'w': - lex_strterm = NEW_STRTERM(str_squote | STR_FUNC_QWORDS, term, paren); - do {c = nextc();} while (ISSPACE(c)); - pushback(c); - return tQWORDS_BEG; - - case 'x': - lex_strterm = NEW_STRTERM(str_xquote, term, paren); - return tXSTRING_BEG; - - case 'r': - lex_strterm = NEW_STRTERM(str_regexp, term, paren); - return tREGEXP_BEG; - - case 's': - lex_strterm = NEW_STRTERM(str_ssym, term, paren); - lex_state = EXPR_FNAME; - return tSYMBEG; - - default: - yyerror("unknown type of %string"); - return 0; - } - } - if ((c = nextc()) == '=') { - yylval.id = '%'; - lex_state = EXPR_BEG; - return tOP_ASGN; - } - if (IS_ARG() && space_seen && !ISSPACE(c)) { - goto quotation; - } - switch (lex_state) { - case EXPR_FNAME: case EXPR_DOT: - lex_state = EXPR_ARG; break; - default: - lex_state = EXPR_BEG; break; - } - pushback(c); - return '%'; + return parse_percent(p, space_seen, last_state); case '$': - lex_state = EXPR_END; - newtok(); - c = nextc(); - switch (c) { - case '_': /* $_: last read line string */ - c = nextc(); - if (is_identchar(c)) { - tokadd('$'); - tokadd('_'); - break; - } - pushback(c); - c = '_'; - /* fall through */ - case '~': /* $~: match-data */ - local_cnt(c); - /* fall through */ - case '*': /* $*: argv */ - case '$': /* $$: pid */ - case '?': /* $?: last status */ - case '!': /* $!: error string */ - case '@': /* $@: error position */ - case '/': /* $/: input record separator */ - case '\\': /* $\: output record separator */ - case ';': /* $;: field separator */ - case ',': /* $,: output field separator */ - case '.': /* $.: last read line number */ - case '=': /* $=: ignorecase */ - case ':': /* $:: load path */ - case '<': /* $<: reading filename */ - case '>': /* $>: default output handle */ - case '\"': /* $": already loaded files */ - tokadd('$'); - tokadd(c); - tokfix(); - yylval.id = rb_intern(tok()); - return tGVAR; - - case '-': - tokadd('$'); - tokadd(c); - c = nextc(); - tokadd(c); - tokfix(); - yylval.id = rb_intern(tok()); - if (!is_global_id(yylval.id)) { - rb_compile_error("invalid global variable `%s'", rb_id2name(yylval.id)); - return 0; - } - return tGVAR; - - case '&': /* $&: last match */ - case '`': /* $`: string before last match */ - case '\'': /* $': string after last match */ - case '+': /* $+: string matches last paren. */ - yylval.node = NEW_BACK_REF(c); - return tBACK_REF; - - case '1': case '2': case '3': - case '4': case '5': case '6': - case '7': case '8': case '9': - tokadd('$'); - do { - tokadd(c); - c = nextc(); - } while (ISDIGIT(c)); - pushback(c); - tokfix(); - yylval.node = NEW_NTH_REF(atoi(tok()+1)); - return tNTH_REF; - - default: - if (!is_identchar(c)) { - pushback(c); - return '$'; - } - case '0': - tokadd('$'); - } - break; + return parse_gvar(p, last_state); case '@': - c = nextc(); - newtok(); - tokadd('@'); - if (c == '@') { - tokadd('@'); - c = nextc(); - } - if (ISDIGIT(c)) { - if (tokidx == 1) { - rb_compile_error("`@%c' is not allowed as an instance variable name", c); - } - else { - rb_compile_error("`@@%c' is not allowed as a class variable name", c); - } - } - if (!is_identchar(c)) { - pushback(c); - return '@'; - } - break; + return parse_atmark(p, last_state); case '_': - if (was_bol() && whole_match_p("__END__", 7, 0)) { - ruby__end__seen = 1; - lex_lastline = 0; - return -1; - } - newtok(); - break; + if (was_bol(p) && whole_match_p(p, "__END__", 7, 0)) { + p->ruby__end__seen = 1; + p->eofp = 1; +#ifdef RIPPER + lex_goto_eol(p); + dispatch_scan_event(p, k__END__); +#endif + return END_OF_INPUT; + } + newtok(p); + break; default: - if (!is_identchar(c)) { - rb_compile_error("Invalid char `\\%03o' in expression", c); - goto retry; - } + if (!parser_is_identchar(p)) { + compile_error(p, "Invalid char '\\x%02X' in expression", c); + token_flush(p); + goto retry; + } - newtok(); - break; + newtok(p); + break; } - do { - tokadd(c); - if (ismbchar(c)) { - int i, len = mbclen(c)-1; - - for (i = 0; i < len; i++) { - c = nextc(); - tokadd(c); - } - } - c = nextc(); - } while (is_identchar(c)); - if ((c == '!' || c == '?') && is_identchar(tok()[0]) && !peek('=')) { - tokadd(c); - } - else { - pushback(c); - } - tokfix(); + return parse_ident(p, c, cmd_state); +} - { - int result = 0; - - switch (tok()[0]) { - case '$': - lex_state = EXPR_END; - result = tGVAR; - break; - case '@': - lex_state = EXPR_END; - if (tok()[1] == '@') - result = tCVAR; - else - result = tIVAR; - break; - - default: - if (toklast() == '!' || toklast() == '?') { - result = tFID; - } - else { - if (lex_state == EXPR_FNAME) { - if ((c = nextc()) == '=' && !peek('~') && !peek('>') && - (!peek('=') || (lex_p + 1 < lex_pend && lex_p[1] == '>'))) { - result = tIDENTIFIER; - tokadd(c); - tokfix(); - } - else { - pushback(c); - } - } - if (result == 0 && ISUPPER(tok()[0])) { - result = tCONSTANT; - } - else { - result = tIDENTIFIER; - } - } - - if (lex_state != EXPR_DOT) { - struct kwtable *kw; - - /* See if it is a reserved word. */ - kw = rb_reserved_word(tok(), toklen()); - if (kw) { - enum lex_state state = lex_state; - lex_state = kw->state; - if (state == EXPR_FNAME) { - yylval.id = rb_intern(kw->name); - } - if (kw->id[0] == kDO) { - if (COND_P()) return kDO_COND; - if (CMDARG_P() && state != EXPR_CMDARG) - return kDO_BLOCK; - if (state == EXPR_ENDARG) - return kDO_BLOCK; - return kDO; - } - if (state == EXPR_BEG || state == EXPR_TERNARY) - return kw->id[0]; - else { - if (kw->id[0] != kw->id[1]) - lex_state = EXPR_BEG; - return kw->id[1]; - } - } - } - - if (lex_state == EXPR_BEG || - lex_state == EXPR_ARG || - lex_state == EXPR_CMDARG) { - if (peek(':') && !(lex_p + 1 < lex_pend && lex_p[1] == ':')) { - lex_state = EXPR_BEG; - nextc(); - yylval.id = rb_intern(tok()); - return tLABEL; - } - } - if (IS_BEG() || - lex_state == EXPR_DOT || - IS_ARG()) { - if (cmd_state) { - lex_state = EXPR_CMDARG; - } - else { - lex_state = EXPR_ARG; - } - } - else { - lex_state = EXPR_END; - } - } - yylval.id = rb_intern(tok()); - if (is_local_id(yylval.id) && - ((dyna_in_block() && rb_dvar_defined(yylval.id)) || local_id(yylval.id))) { - lex_state = EXPR_END; - } - return result; - } -} - -NODE* -rb_node_newnode(type, a0, a1, a2) - enum node_type type; - VALUE a0, a1, a2; +static enum yytokentype +yylex(YYSTYPE *lval, YYLTYPE *yylloc, struct parser_params *p) +{ + enum yytokentype t; + + p->lval = lval; + lval->node = 0; + p->yylloc = yylloc; + + t = parser_yylex(p); + + if (has_delayed_token(p)) + dispatch_delayed_token(p, t); + else if (t != END_OF_INPUT) + dispatch_scan_event(p, t); + + return t; +} + +#define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1)) + +static NODE* +node_new_internal(struct parser_params *p, enum node_type type, size_t size, size_t alignment) +{ + NODE *n = rb_ast_newnode(p->ast, type, size, alignment); + + rb_node_init(n, type); + return n; +} + +static NODE * +nd_set_loc(NODE *nd, const YYLTYPE *loc) +{ + nd->nd_loc = *loc; + nd_set_line(nd, loc->beg_pos.lineno); + return nd; +} + +static NODE* +node_newnode(struct parser_params *p, enum node_type type, size_t size, size_t alignment, const rb_code_location_t *loc) +{ + NODE *n = node_new_internal(p, type, size, alignment); + + nd_set_loc(n, loc); + nd_set_node_id(n, parser_get_node_id(p)); + return n; +} + +#define NODE_NEWNODE(node_type, type, loc) (type *)(node_newnode(p, node_type, sizeof(type), RUBY_ALIGNOF(type), loc)) + +static 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) +{ + rb_ast_id_table_t *nd_tbl; + nd_tbl = local_tbl(p); + rb_node_scope_t *n = NODE_NEWNODE(NODE_SCOPE, rb_node_scope_t, loc); + n->nd_tbl = nd_tbl; + n->nd_body = nd_body; + n->nd_parent = nd_parent; + n->nd_args = nd_args; + + return n; +} + +static 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) +{ + rb_node_scope_t *n = NODE_NEWNODE(NODE_SCOPE, rb_node_scope_t, loc); + n->nd_tbl = nd_tbl; + n->nd_body = nd_body; + n->nd_parent = nd_parent; + n->nd_args = nd_args; + + return n; +} + +static rb_node_defn_t * +rb_node_defn_new(struct parser_params *p, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc) +{ + rb_node_defn_t *n = NODE_NEWNODE(NODE_DEFN, rb_node_defn_t, loc); + n->nd_mid = nd_mid; + n->nd_defn = nd_defn; + + return n; +} + +static rb_node_defs_t * +rb_node_defs_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_defn, const YYLTYPE *loc) +{ + rb_node_defs_t *n = NODE_NEWNODE(NODE_DEFS, rb_node_defs_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_defn = nd_defn; + + return n; +} + +static rb_node_block_t * +rb_node_block_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc) +{ + rb_node_block_t *n = NODE_NEWNODE(NODE_BLOCK, rb_node_block_t, loc); + n->nd_head = nd_head; + n->nd_end = (NODE *)n; + n->nd_next = 0; + + return n; +} + +static 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) +{ + rb_node_for_t *n = NODE_NEWNODE(NODE_FOR, rb_node_for_t, loc); + n->nd_body = nd_body; + n->nd_iter = nd_iter; + n->for_keyword_loc = *for_keyword_loc; + n->in_keyword_loc = *in_keyword_loc; + n->do_keyword_loc = *do_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static rb_node_for_masgn_t * +rb_node_for_masgn_new(struct parser_params *p, NODE *nd_var, const YYLTYPE *loc) +{ + rb_node_for_masgn_t *n = NODE_NEWNODE(NODE_FOR_MASGN, rb_node_for_masgn_t, loc); + n->nd_var = nd_var; + + return n; +} + +static rb_node_retry_t * +rb_node_retry_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_retry_t *n = NODE_NEWNODE(NODE_RETRY, rb_node_retry_t, loc); + + return n; +} + +static rb_node_begin_t * +rb_node_begin_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_begin_t *n = NODE_NEWNODE(NODE_BEGIN, rb_node_begin_t, loc); + n->nd_body = nd_body; + + return n; +} + +static rb_node_rescue_t * +rb_node_rescue_new(struct parser_params *p, NODE *nd_head, NODE *nd_resq, NODE *nd_else, const YYLTYPE *loc) +{ + rb_node_rescue_t *n = NODE_NEWNODE(NODE_RESCUE, rb_node_rescue_t, loc); + n->nd_head = nd_head; + n->nd_resq = nd_resq; + n->nd_else = nd_else; + + return n; +} + +static 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) +{ + rb_node_resbody_t *n = NODE_NEWNODE(NODE_RESBODY, rb_node_resbody_t, loc); + n->nd_args = nd_args; + n->nd_exc_var = nd_exc_var; + n->nd_body = nd_body; + n->nd_next = nd_next; + + return n; +} + +static rb_node_ensure_t * +rb_node_ensure_new(struct parser_params *p, NODE *nd_head, NODE *nd_ensr, const YYLTYPE *loc) +{ + rb_node_ensure_t *n = NODE_NEWNODE(NODE_ENSURE, rb_node_ensure_t, loc); + n->nd_head = nd_head; + n->nd_ensr = nd_ensr; + + return n; +} + +static 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) { - NODE *n = (NODE*)rb_newobj(); + rb_node_and_t *n = NODE_NEWNODE(NODE_AND, rb_node_and_t, loc); + n->nd_1st = nd_1st; + n->nd_2nd = nd_2nd; + n->operator_loc = *operator_loc; - n->flags |= T_NODE; - nd_set_type(n, type); - nd_set_line(n, ruby_sourceline); - n->nd_file = ruby_sourcefile; + return n; +} - n->u1.value = a0; - n->u2.value = a1; - n->u3.value = a2; +static 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) +{ + rb_node_or_t *n = NODE_NEWNODE(NODE_OR, rb_node_or_t, loc); + n->nd_1st = nd_1st; + n->nd_2nd = nd_2nd; + n->operator_loc = *operator_loc; return n; } +static rb_node_return_t * +rb_node_return_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + rb_node_return_t *n = NODE_NEWNODE(NODE_RETURN, rb_node_return_t, loc); + n->nd_stts = nd_stts; + n->keyword_loc = *keyword_loc; + return n; +} + +static 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) +{ + if (nd_head) no_blockarg(p, nd_head); + + rb_node_yield_t *n = NODE_NEWNODE(NODE_YIELD, rb_node_yield_t, loc); + n->nd_head = nd_head; + n->keyword_loc = *keyword_loc; + n->lparen_loc = *lparen_loc; + n->rparen_loc = *rparen_loc; + + return n; +} + +static 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) +{ + rb_node_if_t *n = NODE_NEWNODE(NODE_IF, rb_node_if_t, loc); + n->nd_cond = nd_cond; + n->nd_body = nd_body; + n->nd_else = nd_else; + n->if_keyword_loc = *if_keyword_loc; + n->then_keyword_loc = *then_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + rb_node_unless_t *n = NODE_NEWNODE(NODE_UNLESS, rb_node_unless_t, loc); + n->nd_cond = nd_cond; + n->nd_body = nd_body; + n->nd_else = nd_else; + n->keyword_loc = *keyword_loc; + n->then_keyword_loc = *then_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + /* Keep the order of node creation */ + NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc); + rb_node_class_t *n = NODE_NEWNODE(NODE_CLASS, rb_node_class_t, loc); + RNODE_SCOPE(scope)->nd_parent = &n->node; + n->nd_cpath = nd_cpath; + n->nd_body = scope; + n->nd_super = nd_super; + n->class_keyword_loc = *class_keyword_loc; + n->inheritance_operator_loc = *inheritance_operator_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + /* Keep the order of node creation */ + NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc); + rb_node_sclass_t *n = NODE_NEWNODE(NODE_SCLASS, rb_node_sclass_t, loc); + RNODE_SCOPE(scope)->nd_parent = &n->node; + n->nd_recv = nd_recv; + n->nd_body = scope; + n->class_keyword_loc = *class_keyword_loc; + n->operator_loc = *operator_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + /* Keep the order of node creation */ + NODE *scope = NEW_SCOPE(0, nd_body, NULL, loc); + rb_node_module_t *n = NODE_NEWNODE(NODE_MODULE, rb_node_module_t, loc); + RNODE_SCOPE(scope)->nd_parent = &n->node; + n->nd_cpath = nd_cpath; + n->nd_body = scope; + n->module_keyword_loc = *module_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static rb_node_iter_t * +rb_node_iter_new(struct parser_params *p, rb_node_args_t *nd_args, NODE *nd_body, const YYLTYPE *loc) +{ + /* Keep the order of node creation */ + NODE *scope = NEW_SCOPE(nd_args, nd_body, NULL, loc); + rb_node_iter_t *n = NODE_NEWNODE(NODE_ITER, rb_node_iter_t, loc); + RNODE_SCOPE(scope)->nd_parent = &n->node; + n->nd_body = scope; + n->nd_iter = 0; + + return n; +} + +static 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) +{ + /* Keep the order of node creation */ + NODE *scope = NEW_SCOPE(nd_args, nd_body, NULL, loc); + YYLTYPE lambda_loc = code_loc_gen(operator_loc, closing_loc); + rb_node_lambda_t *n = NODE_NEWNODE(NODE_LAMBDA, rb_node_lambda_t, &lambda_loc); + RNODE_SCOPE(scope)->nd_parent = &n->node; + n->nd_body = scope; + n->operator_loc = *operator_loc; + n->opening_loc = *opening_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static 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) +{ + rb_node_case_t *n = NODE_NEWNODE(NODE_CASE, rb_node_case_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + n->case_keyword_loc = *case_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + rb_node_case2_t *n = NODE_NEWNODE(NODE_CASE2, rb_node_case2_t, loc); + n->nd_head = 0; + n->nd_body = nd_body; + n->case_keyword_loc = *case_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + rb_node_case3_t *n = NODE_NEWNODE(NODE_CASE3, rb_node_case3_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + n->case_keyword_loc = *case_keyword_loc; + n->end_keyword_loc = *end_keyword_loc; + + return n; +} + +static 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) +{ + rb_node_when_t *n = NODE_NEWNODE(NODE_WHEN, rb_node_when_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + n->nd_next = nd_next; + n->keyword_loc = *keyword_loc; + n->then_keyword_loc = *then_keyword_loc; + + return n; +} + +static 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) +{ + rb_node_in_t *n = NODE_NEWNODE(NODE_IN, rb_node_in_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + n->nd_next = nd_next; + n->in_keyword_loc = *in_keyword_loc; + n->then_keyword_loc = *then_keyword_loc; + n->operator_loc = *operator_loc; + + return n; +} + +static 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) +{ + rb_node_while_t *n = NODE_NEWNODE(NODE_WHILE, rb_node_while_t, loc); + n->nd_cond = nd_cond; + n->nd_body = nd_body; + n->nd_state = nd_state; + n->keyword_loc = *keyword_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static 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) +{ + rb_node_until_t *n = NODE_NEWNODE(NODE_UNTIL, rb_node_until_t, loc); + n->nd_cond = nd_cond; + n->nd_body = nd_body; + n->nd_state = nd_state; + n->keyword_loc = *keyword_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static 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) +{ + rb_node_colon2_t *n = NODE_NEWNODE(NODE_COLON2, rb_node_colon2_t, loc); + n->nd_head = nd_head; + n->nd_mid = nd_mid; + n->delimiter_loc = *delimiter_loc; + n->name_loc = *name_loc; + + return n; +} + +static 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) +{ + rb_node_colon3_t *n = NODE_NEWNODE(NODE_COLON3, rb_node_colon3_t, loc); + n->nd_mid = nd_mid; + n->delimiter_loc = *delimiter_loc; + n->name_loc = *name_loc; + + return n; +} + +static 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) +{ + rb_node_dot2_t *n = NODE_NEWNODE(NODE_DOT2, rb_node_dot2_t, loc); + n->nd_beg = nd_beg; + n->nd_end = nd_end; + n->operator_loc = *operator_loc; + + return n; +} + +static 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) +{ + rb_node_dot3_t *n = NODE_NEWNODE(NODE_DOT3, rb_node_dot3_t, loc); + n->nd_beg = nd_beg; + n->nd_end = nd_end; + n->operator_loc = *operator_loc; + + return n; +} + +static rb_node_self_t * +rb_node_self_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_self_t *n = NODE_NEWNODE(NODE_SELF, rb_node_self_t, loc); + n->nd_state = 1; + + return n; +} + +static rb_node_nil_t * +rb_node_nil_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_nil_t *n = NODE_NEWNODE(NODE_NIL, rb_node_nil_t, loc); + + return n; +} + +static rb_node_true_t * +rb_node_true_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_true_t *n = NODE_NEWNODE(NODE_TRUE, rb_node_true_t, loc); + + return n; +} + +static rb_node_false_t * +rb_node_false_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_false_t *n = NODE_NEWNODE(NODE_FALSE, rb_node_false_t, loc); + + return n; +} + +static 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) +{ + rb_node_super_t *n = NODE_NEWNODE(NODE_SUPER, rb_node_super_t, loc); + n->nd_args = nd_args; + n->keyword_loc = *keyword_loc; + n->lparen_loc = *lparen_loc; + n->rparen_loc = *rparen_loc; + + return n; +} + +static rb_node_zsuper_t * +rb_node_zsuper_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_zsuper_t *n = NODE_NEWNODE(NODE_ZSUPER, rb_node_zsuper_t, loc); + + return n; +} + +static rb_node_match2_t * +rb_node_match2_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_match2_t *n = NODE_NEWNODE(NODE_MATCH2, rb_node_match2_t, loc); + n->nd_recv = nd_recv; + n->nd_value = nd_value; + n->nd_args = 0; + + return n; +} + +static rb_node_match3_t * +rb_node_match3_new(struct parser_params *p, NODE *nd_recv, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_match3_t *n = NODE_NEWNODE(NODE_MATCH3, rb_node_match3_t, loc); + n->nd_recv = nd_recv; + n->nd_value = nd_value; + + return n; +} + +/* TODO: Use union for NODE_LIST2 */ +static rb_node_list_t * +rb_node_list_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc) +{ + rb_node_list_t *n = NODE_NEWNODE(NODE_LIST, rb_node_list_t, loc); + n->nd_head = nd_head; + n->as.nd_alen = 1; + n->nd_next = 0; + + return n; +} + +static rb_node_list_t * +rb_node_list_new2(struct parser_params *p, NODE *nd_head, long nd_alen, NODE *nd_next, const YYLTYPE *loc) +{ + rb_node_list_t *n = NODE_NEWNODE(NODE_LIST, rb_node_list_t, loc); + n->nd_head = nd_head; + n->as.nd_alen = nd_alen; + n->nd_next = nd_next; + + return n; +} + +static rb_node_zlist_t * +rb_node_zlist_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_zlist_t *n = NODE_NEWNODE(NODE_ZLIST, rb_node_zlist_t, loc); + + return n; +} + +static rb_node_hash_t * +rb_node_hash_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc) +{ + rb_node_hash_t *n = NODE_NEWNODE(NODE_HASH, rb_node_hash_t, loc); + n->nd_head = nd_head; + n->nd_brace = 0; + + return n; +} + +static rb_node_masgn_t * +rb_node_masgn_new(struct parser_params *p, NODE *nd_head, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_masgn_t *n = NODE_NEWNODE(NODE_MASGN, rb_node_masgn_t, loc); + n->nd_head = nd_head; + n->nd_value = 0; + n->nd_args = nd_args; + + return n; +} + +static rb_node_gasgn_t * +rb_node_gasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_gasgn_t *n = NODE_NEWNODE(NODE_GASGN, rb_node_gasgn_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + + return n; +} + +static rb_node_lasgn_t * +rb_node_lasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_lasgn_t *n = NODE_NEWNODE(NODE_LASGN, rb_node_lasgn_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + + return n; +} + +static rb_node_dasgn_t * +rb_node_dasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_dasgn_t *n = NODE_NEWNODE(NODE_DASGN, rb_node_dasgn_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + + return n; +} + +static rb_node_iasgn_t * +rb_node_iasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_iasgn_t *n = NODE_NEWNODE(NODE_IASGN, rb_node_iasgn_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + + return n; +} + +static rb_node_cvasgn_t * +rb_node_cvasgn_new(struct parser_params *p, ID nd_vid, NODE *nd_value, const YYLTYPE *loc) +{ + rb_node_cvasgn_t *n = NODE_NEWNODE(NODE_CVASGN, rb_node_cvasgn_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + + return n; +} + +static 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) +{ + rb_node_op_asgn1_t *n = NODE_NEWNODE(NODE_OP_ASGN1, rb_node_op_asgn1_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_index = index; + n->nd_rvalue = rvalue; + n->call_operator_loc = *call_operator_loc; + n->opening_loc = *opening_loc; + n->closing_loc = *closing_loc; + n->binary_operator_loc = *binary_operator_loc; + + return n; +} + +static 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) +{ + rb_node_op_asgn2_t *n = NODE_NEWNODE(NODE_OP_ASGN2, rb_node_op_asgn2_t, loc); + n->nd_recv = nd_recv; + n->nd_value = nd_value; + n->nd_vid = nd_vid; + n->nd_mid = nd_mid; + n->nd_aid = nd_aid; + n->call_operator_loc = *call_operator_loc; + n->message_loc = *message_loc; + n->binary_operator_loc = *binary_operator_loc; + + return n; +} + +static 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) +{ + rb_node_op_asgn_or_t *n = NODE_NEWNODE(NODE_OP_ASGN_OR, rb_node_op_asgn_or_t, loc); + n->nd_head = nd_head; + n->nd_value = nd_value; + + return n; +} + +static 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) +{ + rb_node_op_asgn_and_t *n = NODE_NEWNODE(NODE_OP_ASGN_AND, rb_node_op_asgn_and_t, loc); + n->nd_head = nd_head; + n->nd_value = nd_value; + + return n; +} + +static rb_node_gvar_t * +rb_node_gvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_gvar_t *n = NODE_NEWNODE(NODE_GVAR, rb_node_gvar_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_lvar_t * +rb_node_lvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_lvar_t *n = NODE_NEWNODE(NODE_LVAR, rb_node_lvar_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_dvar_t * +rb_node_dvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_dvar_t *n = NODE_NEWNODE(NODE_DVAR, rb_node_dvar_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_ivar_t * +rb_node_ivar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_ivar_t *n = NODE_NEWNODE(NODE_IVAR, rb_node_ivar_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_const_t * +rb_node_const_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_const_t *n = NODE_NEWNODE(NODE_CONST, rb_node_const_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_cvar_t * +rb_node_cvar_new(struct parser_params *p, ID nd_vid, const YYLTYPE *loc) +{ + rb_node_cvar_t *n = NODE_NEWNODE(NODE_CVAR, rb_node_cvar_t, loc); + n->nd_vid = nd_vid; + + return n; +} + +static rb_node_nth_ref_t * +rb_node_nth_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc) +{ + rb_node_nth_ref_t *n = NODE_NEWNODE(NODE_NTH_REF, rb_node_nth_ref_t, loc); + n->nd_nth = nd_nth; + + return n; +} + +static rb_node_back_ref_t * +rb_node_back_ref_new(struct parser_params *p, long nd_nth, const YYLTYPE *loc) +{ + rb_node_back_ref_t *n = NODE_NEWNODE(NODE_BACK_REF, rb_node_back_ref_t, loc); + n->nd_nth = nd_nth; + + return n; +} + +static rb_node_integer_t * +rb_node_integer_new(struct parser_params *p, char* val, int base, const YYLTYPE *loc) +{ + rb_node_integer_t *n = NODE_NEWNODE(NODE_INTEGER, rb_node_integer_t, loc); + n->val = val; + n->minus = FALSE; + n->base = base; + + return n; +} + +static rb_node_float_t * +rb_node_float_new(struct parser_params *p, char* val, const YYLTYPE *loc) +{ + rb_node_float_t *n = NODE_NEWNODE(NODE_FLOAT, rb_node_float_t, loc); + n->val = val; + n->minus = FALSE; + + return n; +} + +static rb_node_rational_t * +rb_node_rational_new(struct parser_params *p, char* val, int base, int seen_point, const YYLTYPE *loc) +{ + rb_node_rational_t *n = NODE_NEWNODE(NODE_RATIONAL, rb_node_rational_t, loc); + n->val = val; + n->minus = FALSE; + n->base = base; + n->seen_point = seen_point; + + return n; +} + +static rb_node_imaginary_t * +rb_node_imaginary_new(struct parser_params *p, char* val, int base, int seen_point, enum rb_numeric_type numeric_type, const YYLTYPE *loc) +{ + rb_node_imaginary_t *n = NODE_NEWNODE(NODE_IMAGINARY, rb_node_imaginary_t, loc); + n->val = val; + n->minus = FALSE; + n->base = base; + n->seen_point = seen_point; + n->type = numeric_type; + + return n; +} + +static rb_node_str_t * +rb_node_str_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc) +{ + rb_node_str_t *n = NODE_NEWNODE(NODE_STR, rb_node_str_t, loc); + n->string = string; + + return n; +} + +/* TODO; Use union for NODE_DSTR2 */ +static 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) +{ + rb_node_dstr_t *n = NODE_NEWNODE(NODE_DSTR, rb_node_dstr_t, loc); + n->string = string; + n->as.nd_alen = nd_alen; + n->nd_next = (rb_node_list_t *)nd_next; + + return n; +} + +static rb_node_dstr_t * +rb_node_dstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc) +{ + return rb_node_dstr_new0(p, string, 1, 0, loc); +} + +static rb_node_xstr_t * +rb_node_xstr_new(struct parser_params *p, rb_parser_string_t *string, const YYLTYPE *loc) +{ + rb_node_xstr_t *n = NODE_NEWNODE(NODE_XSTR, rb_node_xstr_t, loc); + n->string = string; + + return n; +} + +static 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) +{ + rb_node_dxstr_t *n = NODE_NEWNODE(NODE_DXSTR, rb_node_dxstr_t, loc); + n->string = string; + n->as.nd_alen = nd_alen; + n->nd_next = (rb_node_list_t *)nd_next; + + return n; +} + +static rb_node_sym_t * +rb_node_sym_new(struct parser_params *p, VALUE str, const YYLTYPE *loc) +{ + rb_node_sym_t *n = NODE_NEWNODE(NODE_SYM, rb_node_sym_t, loc); + n->string = rb_str_to_parser_string(p, str); + + return n; +} + +static 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) +{ + rb_node_dsym_t *n = NODE_NEWNODE(NODE_DSYM, rb_node_dsym_t, loc); + n->string = string; + n->as.nd_alen = nd_alen; + n->nd_next = (rb_node_list_t *)nd_next; + + return n; +} + +static 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) +{ + rb_node_evstr_t *n = NODE_NEWNODE(NODE_EVSTR, rb_node_evstr_t, loc); + n->nd_body = nd_body; + n->opening_loc = *opening_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static 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) +{ + rb_node_regx_t *n = NODE_NEWNODE(NODE_REGX, rb_node_regx_t, loc); + n->string = string; + n->options = options & RE_OPTION_MASK; + n->opening_loc = *opening_loc; + n->content_loc = *content_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static rb_node_call_t * +rb_node_call_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_call_t *n = NODE_NEWNODE(NODE_CALL, rb_node_call_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_args = nd_args; + + return n; +} + +static rb_node_opcall_t * +rb_node_opcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_opcall_t *n = NODE_NEWNODE(NODE_OPCALL, rb_node_opcall_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_args = nd_args; + + return n; +} + +static rb_node_fcall_t * +rb_node_fcall_new(struct parser_params *p, ID nd_mid, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_fcall_t *n = NODE_NEWNODE(NODE_FCALL, rb_node_fcall_t, loc); + n->nd_mid = nd_mid; + n->nd_args = nd_args; + + return n; +} + +static rb_node_qcall_t * +rb_node_qcall_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_qcall_t *n = NODE_NEWNODE(NODE_QCALL, rb_node_qcall_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_args = nd_args; + + return n; +} + +static rb_node_vcall_t * +rb_node_vcall_new(struct parser_params *p, ID nd_mid, const YYLTYPE *loc) +{ + rb_node_vcall_t *n = NODE_NEWNODE(NODE_VCALL, rb_node_vcall_t, loc); + n->nd_mid = nd_mid; + + return n; +} + +static rb_node_once_t * +rb_node_once_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_once_t *n = NODE_NEWNODE(NODE_ONCE, rb_node_once_t, loc); + n->nd_body = nd_body; + + return n; +} + +static rb_node_args_t * +rb_node_args_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_args_t *n = NODE_NEWNODE(NODE_ARGS, rb_node_args_t, loc); + MEMZERO(&n->nd_ainfo, struct rb_args_info, 1); + + return n; +} + +static rb_node_args_aux_t * +rb_node_args_aux_new(struct parser_params *p, ID nd_pid, int nd_plen, const YYLTYPE *loc) +{ + rb_node_args_aux_t *n = NODE_NEWNODE(NODE_ARGS_AUX, rb_node_args_aux_t, loc); + n->nd_pid = nd_pid; + n->nd_plen = nd_plen; + n->nd_next = 0; + + return n; +} + +static rb_node_opt_arg_t * +rb_node_opt_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_opt_arg_t *n = NODE_NEWNODE(NODE_OPT_ARG, rb_node_opt_arg_t, loc); + n->nd_body = nd_body; + n->nd_next = 0; + + return n; +} + +static rb_node_kw_arg_t * +rb_node_kw_arg_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_kw_arg_t *n = NODE_NEWNODE(NODE_KW_ARG, rb_node_kw_arg_t, loc); + n->nd_body = nd_body; + n->nd_next = 0; + + return n; +} + +static rb_node_postarg_t * +rb_node_postarg_new(struct parser_params *p, NODE *nd_1st, NODE *nd_2nd, const YYLTYPE *loc) +{ + rb_node_postarg_t *n = NODE_NEWNODE(NODE_POSTARG, rb_node_postarg_t, loc); + n->nd_1st = nd_1st; + n->nd_2nd = nd_2nd; + + return n; +} + +static rb_node_argscat_t * +rb_node_argscat_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_argscat_t *n = NODE_NEWNODE(NODE_ARGSCAT, rb_node_argscat_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + + return n; +} + +static rb_node_argspush_t * +rb_node_argspush_new(struct parser_params *p, NODE *nd_head, NODE *nd_body, const YYLTYPE *loc) +{ + rb_node_argspush_t *n = NODE_NEWNODE(NODE_ARGSPUSH, rb_node_argspush_t, loc); + n->nd_head = nd_head; + n->nd_body = nd_body; + + return n; +} + +static rb_node_splat_t * +rb_node_splat_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *operator_loc) +{ + rb_node_splat_t *n = NODE_NEWNODE(NODE_SPLAT, rb_node_splat_t, loc); + n->nd_head = nd_head; + n->operator_loc = *operator_loc; + + return n; +} + +static rb_node_block_pass_t * +rb_node_block_pass_new(struct parser_params *p, NODE *nd_body, const YYLTYPE *loc, const YYLTYPE *operator_loc) +{ + rb_node_block_pass_t *n = NODE_NEWNODE(NODE_BLOCK_PASS, rb_node_block_pass_t, loc); + n->forwarding = 0; + n->nd_head = 0; + n->nd_body = nd_body; + n->operator_loc = *operator_loc; + + return n; +} + +static 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) +{ + rb_node_alias_t *n = NODE_NEWNODE(NODE_ALIAS, rb_node_alias_t, loc); + n->nd_1st = nd_1st; + n->nd_2nd = nd_2nd; + n->keyword_loc = *keyword_loc; + + return n; +} + +static 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) +{ + rb_node_valias_t *n = NODE_NEWNODE(NODE_VALIAS, rb_node_valias_t, loc); + n->nd_alias = nd_alias; + n->nd_orig = nd_orig; + n->keyword_loc = *keyword_loc; + + return n; +} + +static rb_node_undef_t * +rb_node_undef_new(struct parser_params *p, NODE *nd_undef, const YYLTYPE *loc) +{ + rb_node_undef_t *n = NODE_NEWNODE(NODE_UNDEF, rb_node_undef_t, loc); + n->nd_undefs = rb_parser_ary_new_capa_for_node(p, 1); + n->keyword_loc = NULL_LOC; + rb_parser_ary_push_node(p, n->nd_undefs, nd_undef); + + return n; +} + +static rb_node_errinfo_t * +rb_node_errinfo_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_errinfo_t *n = NODE_NEWNODE(NODE_ERRINFO, rb_node_errinfo_t, loc); + + return n; +} + +static rb_node_defined_t * +rb_node_defined_new(struct parser_params *p, NODE *nd_head, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + rb_node_defined_t *n = NODE_NEWNODE(NODE_DEFINED, rb_node_defined_t, loc); + n->nd_head = nd_head; + n->keyword_loc = *keyword_loc; + + return n; +} + +static 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) +{ + rb_node_postexe_t *n = NODE_NEWNODE(NODE_POSTEXE, rb_node_postexe_t, loc); + n->nd_body = nd_body; + n->keyword_loc = *keyword_loc; + n->opening_loc = *opening_loc; + n->closing_loc = *closing_loc; + + return n; +} + +static rb_node_attrasgn_t * +rb_node_attrasgn_new(struct parser_params *p, NODE *nd_recv, ID nd_mid, NODE *nd_args, const YYLTYPE *loc) +{ + rb_node_attrasgn_t *n = NODE_NEWNODE(NODE_ATTRASGN, rb_node_attrasgn_t, loc); + n->nd_recv = nd_recv; + n->nd_mid = nd_mid; + n->nd_args = nd_args; + + return n; +} + +static rb_node_aryptn_t * +rb_node_aryptn_new(struct parser_params *p, NODE *pre_args, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc) +{ + rb_node_aryptn_t *n = NODE_NEWNODE(NODE_ARYPTN, rb_node_aryptn_t, loc); + n->nd_pconst = 0; + n->pre_args = pre_args; + n->rest_arg = rest_arg; + n->post_args = post_args; + + return n; +} + +static rb_node_hshptn_t * +rb_node_hshptn_new(struct parser_params *p, NODE *nd_pconst, NODE *nd_pkwargs, NODE *nd_pkwrestarg, const YYLTYPE *loc) +{ + rb_node_hshptn_t *n = NODE_NEWNODE(NODE_HSHPTN, rb_node_hshptn_t, loc); + n->nd_pconst = nd_pconst; + n->nd_pkwargs = nd_pkwargs; + n->nd_pkwrestarg = nd_pkwrestarg; + + return n; +} + +static 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) +{ + rb_node_fndptn_t *n = NODE_NEWNODE(NODE_FNDPTN, rb_node_fndptn_t, loc); + n->nd_pconst = 0; + n->pre_rest_arg = pre_rest_arg; + n->args = args; + n->post_rest_arg = post_rest_arg; + + return n; +} + +static rb_node_line_t * +rb_node_line_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_line_t *n = NODE_NEWNODE(NODE_LINE, rb_node_line_t, loc); + + return n; +} + +static rb_node_file_t * +rb_node_file_new(struct parser_params *p, VALUE str, const YYLTYPE *loc) +{ + rb_node_file_t *n = NODE_NEWNODE(NODE_FILE, rb_node_file_t, loc); + n->path = rb_str_to_parser_string(p, str); + + return n; +} + +static rb_node_encoding_t * +rb_node_encoding_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_encoding_t *n = NODE_NEWNODE(NODE_ENCODING, rb_node_encoding_t, loc); + n->enc = p->enc; + + return n; +} + +static 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) +{ + rb_node_cdecl_t *n = NODE_NEWNODE(NODE_CDECL, rb_node_cdecl_t, loc); + n->nd_vid = nd_vid; + n->nd_value = nd_value; + n->nd_else = nd_else; + n->shareability = shareability; + + return n; +} + +static 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) +{ + rb_node_op_cdecl_t *n = NODE_NEWNODE(NODE_OP_CDECL, rb_node_op_cdecl_t, loc); + n->nd_head = nd_head; + n->nd_value = nd_value; + n->nd_aid = nd_aid; + n->shareability = shareability; + + return n; +} + +static rb_node_error_t * +rb_node_error_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_error_t *n = NODE_NEWNODE(NODE_ERROR, rb_node_error_t, loc); + + return n; +} + +static rb_node_break_t * +rb_node_break_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + rb_node_break_t *n = NODE_NEWNODE(NODE_BREAK, rb_node_break_t, loc); + n->nd_stts = nd_stts; + n->nd_chain = 0; + n->keyword_loc = *keyword_loc; + + return n; +} + +static rb_node_next_t * +rb_node_next_new(struct parser_params *p, NODE *nd_stts, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + rb_node_next_t *n = NODE_NEWNODE(NODE_NEXT, rb_node_next_t, loc); + n->nd_stts = nd_stts; + n->nd_chain = 0; + n->keyword_loc = *keyword_loc; + + return n; +} + +static rb_node_redo_t * +rb_node_redo_new(struct parser_params *p, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + rb_node_redo_t *n = NODE_NEWNODE(NODE_REDO, rb_node_redo_t, loc); + n->nd_chain = 0; + n->keyword_loc = *keyword_loc; + + return n; +} + +static rb_node_def_temp_t * +rb_node_def_temp_new(struct parser_params *p, const YYLTYPE *loc) +{ + rb_node_def_temp_t *n = NODE_NEWNODE((enum node_type)NODE_DEF_TEMP, rb_node_def_temp_t, loc); + n->save.numparam_save = 0; + n->save.max_numparam = 0; + n->save.ctxt = p->ctxt; + n->nd_def = 0; + n->nd_mid = 0; + + return n; +} + +static rb_node_def_temp_t * +def_head_save(struct parser_params *p, rb_node_def_temp_t *n) +{ + n->save.numparam_save = numparam_push(p); + n->save.max_numparam = p->max_numparam; + return n; +} + +#ifndef RIPPER static enum node_type -nodetype(node) /* for debug */ - NODE *node; +nodetype(NODE *node) /* for debug */ { return (enum node_type)nd_type(node); } static int -nodeline(node) - NODE *node; +nodeline(NODE *node) { return nd_line(node); } +#endif static NODE* -newline_node(node) - NODE *node; +newline_node(NODE *node) { - FL_SET(node, NODE_NEWLINE); + if (node) { + node = remove_begin(node); + nd_set_fl_newline(node); + } return node; } static void -fixpos(node, orig) - NODE *node, *orig; +fixpos(NODE *node, NODE *orig) { if (!node) return; if (!orig) return; - if (orig == (NODE*)1) return; - node->nd_file = orig->nd_file; nd_set_line(node, nd_line(orig)); } -static void -parser_warning(node, mesg) - NODE *node; - const char *mesg; -{ - int line = ruby_sourceline; - ruby_sourceline = nd_line(node); - rb_warning(mesg); - ruby_sourceline = line; -} - -static void -parser_warn(node, mesg) - NODE *node; - const char *mesg; -{ - int line = ruby_sourceline; - ruby_sourceline = nd_line(node); - rb_warn(mesg); - ruby_sourceline = line; -} - static NODE* -block_append(head, tail) - NODE *head, *tail; +block_append(struct parser_params *p, NODE *head, NODE *tail) { NODE *end, *h = head, *nd; @@ -4534,521 +12527,1446 @@ block_append(head, tail) if (h == 0) return tail; switch (nd_type(h)) { - case NODE_LIT: - case NODE_STR: - parser_warning(h, "unused literal ignored"); - return tail; default: - h = end = NEW_BLOCK(head); - end->nd_end = end; - fixpos(end, head); - head = end; - break; + h = end = NEW_BLOCK(head, &head->nd_loc); + head = end; + break; case NODE_BLOCK: - end = h->nd_end; - break; + end = RNODE_BLOCK(h)->nd_end; + break; } - nd = end->nd_head; + nd = RNODE_BLOCK(end)->nd_head; switch (nd_type(nd)) { case NODE_RETURN: case NODE_BREAK: case NODE_NEXT: case NODE_REDO: case NODE_RETRY: - if (RTEST(ruby_verbose)) { - parser_warning(nd, "statement not reached"); - } - break; + rb_warning0L(nd_line(tail), "statement not reached"); + break; default: - break; + break; } - if (nd_type(tail) != NODE_BLOCK) { - tail = NEW_BLOCK(tail); - tail->nd_end = tail; + if (!nd_type_p(tail, NODE_BLOCK)) { + tail = NEW_BLOCK(tail, &tail->nd_loc); } - end->nd_next = tail; - h->nd_end = tail->nd_end; + RNODE_BLOCK(end)->nd_next = tail; + RNODE_BLOCK(h)->nd_end = RNODE_BLOCK(tail)->nd_end; + nd_set_last_loc(head, nd_last_loc(tail)); return head; } /* append item to the list */ static NODE* -list_append(list, item) - NODE *list, *item; +list_append(struct parser_params *p, NODE *list, NODE *item) { NODE *last; - if (list == 0) return NEW_LIST(item); - if (list->nd_next) { - last = list->nd_next->nd_end; + if (list == 0) return NEW_LIST(item, &item->nd_loc); + if (RNODE_LIST(list)->nd_next) { + last = RNODE_LIST(RNODE_LIST(list)->nd_next)->as.nd_end; } else { - last = list; + last = list; } - list->nd_alen += 1; - last->nd_next = NEW_LIST(item); - list->nd_next->nd_end = last->nd_next; + RNODE_LIST(list)->as.nd_alen += 1; + RNODE_LIST(last)->nd_next = NEW_LIST(item, &item->nd_loc); + RNODE_LIST(RNODE_LIST(list)->nd_next)->as.nd_end = RNODE_LIST(last)->nd_next; + + nd_set_last_loc(list, nd_last_loc(item)); + return list; } /* concat two lists */ static NODE* -list_concat(head, tail) - NODE *head, *tail; +list_concat(NODE *head, NODE *tail) { NODE *last; - if (head->nd_next) { - last = head->nd_next->nd_end; + if (RNODE_LIST(head)->nd_next) { + last = RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end; } else { - last = head; + last = head; } - head->nd_alen += tail->nd_alen; - last->nd_next = tail; - if (tail->nd_next) { - head->nd_next->nd_end = tail->nd_next->nd_end; + RNODE_LIST(head)->as.nd_alen += RNODE_LIST(tail)->as.nd_alen; + RNODE_LIST(last)->nd_next = tail; + if (RNODE_LIST(tail)->nd_next) { + RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end = RNODE_LIST(RNODE_LIST(tail)->nd_next)->as.nd_end; } else { - head->nd_next->nd_end = tail; + RNODE_LIST(RNODE_LIST(head)->nd_next)->as.nd_end = tail; } + nd_set_last_loc(head, nd_last_loc(tail)); + return head; } +static int +literal_concat0(struct parser_params *p, rb_parser_string_t *head, rb_parser_string_t *tail) +{ + if (!tail) return 1; + if (!rb_parser_enc_compatible(p, head, tail)) { + compile_error(p, "string literal encodings differ (%s / %s)", + rb_enc_name(rb_parser_str_get_encoding(head)), + rb_enc_name(rb_parser_str_get_encoding(tail))); + rb_parser_str_resize(p, head, 0); + rb_parser_str_resize(p, tail, 0); + return 0; + } + rb_parser_str_buf_append(p, head, tail); + return 1; +} + +static rb_parser_string_t * +string_literal_head(struct parser_params *p, enum node_type htype, NODE *head) +{ + if (htype != NODE_DSTR) return NULL; + if (RNODE_DSTR(head)->nd_next) { + head = RNODE_LIST(RNODE_LIST(RNODE_DSTR(head)->nd_next)->as.nd_end)->nd_head; + if (!head || !nd_type_p(head, NODE_STR)) return NULL; + } + rb_parser_string_t *lit = RNODE_DSTR(head)->string; + ASSUME(lit); + return lit; +} + +#ifndef RIPPER +static rb_parser_string_t * +rb_parser_string_deep_copy(struct parser_params *p, const rb_parser_string_t *orig) +{ + rb_parser_string_t *copy; + if (!orig) return NULL; + copy = rb_parser_string_new(p, PARSER_STRING_PTR(orig), PARSER_STRING_LEN(orig)); + copy->coderange = orig->coderange; + copy->enc = orig->enc; + return copy; +} +#endif + /* concat two string literals */ static NODE * -literal_concat(head, tail) - NODE *head, *tail; +literal_concat(struct parser_params *p, NODE *head, NODE *tail, const YYLTYPE *loc) { enum node_type htype; + rb_parser_string_t *lit; if (!head) return tail; if (!tail) return head; htype = nd_type(head); if (htype == NODE_EVSTR) { - NODE *node = NEW_DSTR(rb_str_new(0, 0)); - head = list_append(node, head); + head = new_dstr(p, head, loc); + htype = NODE_DSTR; + } + if (p->heredoc_indent > 0) { + switch (htype) { + case NODE_STR: + head = str2dstr(p, head); + case NODE_DSTR: + return list_append(p, head, tail); + default: + break; + } } switch (nd_type(tail)) { case NODE_STR: - if (htype == NODE_STR) { - rb_str_concat(head->nd_lit, tail->nd_lit); - rb_gc_force_recycle((VALUE)tail); - } - else { - list_append(head, tail); - } - break; + if ((lit = string_literal_head(p, htype, head)) != false) { + htype = NODE_STR; + } + else { + lit = RNODE_DSTR(head)->string; + } + if (htype == NODE_STR) { + if (!literal_concat0(p, lit, RNODE_STR(tail)->string)) { + error: + rb_discard_node(p, head); + rb_discard_node(p, tail); + return 0; + } + rb_discard_node(p, tail); + } + else { + list_append(p, head, tail); + } + break; case NODE_DSTR: - if (htype == NODE_STR) { - rb_str_concat(head->nd_lit, tail->nd_lit); - tail->nd_lit = head->nd_lit; - rb_gc_force_recycle((VALUE)head); - head = tail; - } - else { - nd_set_type(tail, NODE_ARRAY); - tail->nd_head = NEW_STR(tail->nd_lit); - list_concat(head, tail); - } - break; + if (htype == NODE_STR) { + if (!literal_concat0(p, RNODE_STR(head)->string, RNODE_DSTR(tail)->string)) + goto error; + rb_parser_string_free(p, RNODE_DSTR(tail)->string); + RNODE_DSTR(tail)->string = RNODE_STR(head)->string; + RNODE_STR(head)->string = NULL; + rb_discard_node(p, head); + head = tail; + } + else if (!RNODE_DSTR(tail)->string) { + append: + RNODE_DSTR(head)->as.nd_alen += RNODE_DSTR(tail)->as.nd_alen - 1; + if (!RNODE_DSTR(head)->nd_next) { + RNODE_DSTR(head)->nd_next = RNODE_DSTR(tail)->nd_next; + } + else if (RNODE_DSTR(tail)->nd_next) { + RNODE_DSTR(RNODE_DSTR(RNODE_DSTR(head)->nd_next)->as.nd_end)->nd_next = RNODE_DSTR(tail)->nd_next; + RNODE_DSTR(RNODE_DSTR(head)->nd_next)->as.nd_end = RNODE_DSTR(RNODE_DSTR(tail)->nd_next)->as.nd_end; + } + rb_discard_node(p, tail); + } + else if ((lit = string_literal_head(p, htype, head)) != false) { + if (!literal_concat0(p, lit, RNODE_DSTR(tail)->string)) + goto error; + rb_parser_string_free(p, RNODE_DSTR(tail)->string); + RNODE_DSTR(tail)->string = 0; + goto append; + } + else { + 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)); + RNODE_DSTR(tail)->string = 0; + } + break; case NODE_EVSTR: - if (htype == NODE_STR) { - nd_set_type(head, NODE_DSTR); - } - list_append(head, tail); - break; + if (htype == NODE_STR) { + head = str2dstr(p, head); + RNODE_DSTR(head)->as.nd_alen = 1; + } + list_append(p, head, tail); + break; } return head; } +static void +nd_copy_flag(NODE *new_node, NODE *old_node) +{ + if (nd_fl_newline(old_node)) nd_set_fl_newline(new_node); + nd_set_line(new_node, nd_line(old_node)); + new_node->nd_loc = old_node->nd_loc; + new_node->node_id = old_node->node_id; +} + static NODE * -evstr2dstr(node) - NODE *node; +str2dstr(struct parser_params *p, NODE *node) +{ + NODE *new_node = (NODE *)NODE_NEW_INTERNAL(NODE_DSTR, rb_node_dstr_t); + nd_copy_flag(new_node, node); + RNODE_DSTR(new_node)->string = RNODE_STR(node)->string; + RNODE_DSTR(new_node)->as.nd_alen = 0; + RNODE_DSTR(new_node)->nd_next = 0; + RNODE_STR(node)->string = 0; + + return new_node; +} + +static NODE * +str2regx(struct parser_params *p, NODE *node, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc) { - if (nd_type(node) == NODE_EVSTR) { - node = list_append(NEW_DSTR(rb_str_new(0, 0)), node); + NODE *new_node = (NODE *)NODE_NEW_INTERNAL(NODE_REGX, rb_node_regx_t); + nd_copy_flag(new_node, node); + RNODE_REGX(new_node)->string = RNODE_STR(node)->string; + RNODE_REGX(new_node)->options = options; + nd_set_loc(new_node, loc); + RNODE_REGX(new_node)->opening_loc = *opening_loc; + RNODE_REGX(new_node)->content_loc = *content_loc; + RNODE_REGX(new_node)->closing_loc = *closing_loc; + RNODE_STR(node)->string = 0; + + return new_node; +} + +static NODE * +evstr2dstr(struct parser_params *p, NODE *node) +{ + if (nd_type_p(node, NODE_EVSTR)) { + node = new_dstr(p, node, &node->nd_loc); } return node; } static NODE * -new_evstr(node) - NODE *node; +new_evstr(struct parser_params *p, NODE *node, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc) { NODE *head = node; if (node) { - switch (nd_type(node)) { - case NODE_STR: case NODE_DSTR: case NODE_EVSTR: - return node; - } + switch (nd_type(node)) { + case NODE_STR: + return str2dstr(p, node); + case NODE_DSTR: + break; + case NODE_EVSTR: + return node; + } } - return NEW_EVSTR(head); + return NEW_EVSTR(head, loc, opening_loc, closing_loc); } static NODE * -call_op(recv, id, narg, arg1) - NODE *recv; - ID id; - int narg; - NODE *arg1; +new_dstr(struct parser_params *p, NODE *node, const YYLTYPE *loc) +{ + NODE *dstr = NEW_DSTR(STRING_NEW0(), loc); + return list_append(p, dstr, node); +} + +static NODE * +call_bin_op(struct parser_params *p, NODE *recv, ID id, NODE *arg1, + const YYLTYPE *op_loc, const YYLTYPE *loc) +{ + NODE *expr; + value_expr(p, recv); + value_expr(p, arg1); + expr = NEW_OPCALL(recv, id, NEW_LIST(arg1, &arg1->nd_loc), loc); + nd_set_line(expr, op_loc->beg_pos.lineno); + return expr; +} + +static NODE * +call_uni_op(struct parser_params *p, NODE *recv, ID id, const YYLTYPE *op_loc, const YYLTYPE *loc) +{ + NODE *opcall; + value_expr(p, recv); + opcall = NEW_OPCALL(recv, id, 0, loc); + nd_set_line(opcall, op_loc->beg_pos.lineno); + return opcall; +} + +static NODE * +new_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, const YYLTYPE *op_loc, const YYLTYPE *loc) +{ + NODE *qcall = NEW_QCALL(atype, recv, mid, args, loc); + nd_set_line(qcall, op_loc->beg_pos.lineno); + return qcall; +} + +static NODE* +new_command_qcall(struct parser_params* p, ID atype, NODE *recv, ID mid, NODE *args, NODE *block, const YYLTYPE *op_loc, const YYLTYPE *loc) +{ + NODE *ret; + if (block) block_dup_check(p, args, block); + ret = new_qcall(p, atype, recv, mid, args, op_loc, loc); + if (block) ret = method_add_block(p, ret, block, loc); + fixpos(ret, recv); + return ret; +} + +static 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) +{ + rb_locations_lambda_body_t *body = xcalloc(1, sizeof(rb_locations_lambda_body_t)); + body->node = node; + body->opening_loc = *opening_loc; + body->closing_loc = *closing_loc; + return body; +} + +#define nd_once_body(node) (nd_type_p((node), NODE_ONCE) ? RNODE_ONCE(node)->nd_body : node) + +static NODE* +last_expr_once_body(NODE *node) +{ + if (!node) return 0; + return nd_once_body(node); +} + +static NODE* +match_op(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *op_loc, const YYLTYPE *loc) { - value_expr(recv); - if (narg == 1) { - value_expr(arg1); - arg1 = NEW_LIST(arg1); + NODE *n; + int line = op_loc->beg_pos.lineno; + + value_expr(p, node1); + value_expr(p, node2); + + if ((n = last_expr_once_body(node1)) != 0) { + switch (nd_type(n)) { + case NODE_DREGX: + { + NODE *match = NEW_MATCH2(node1, node2, loc); + nd_set_line(match, line); + return match; + } + + case NODE_REGX: + { + const VALUE lit = rb_node_regx_string_val(n); + if (!NIL_P(lit)) { + NODE *match = NEW_MATCH2(node1, node2, loc); + RNODE_MATCH2(match)->nd_args = reg_named_capture_assign(p, lit, loc, assignable); + nd_set_line(match, line); + return match; + } + } + } } - else { - arg1 = 0; + + if ((n = last_expr_once_body(node2)) != 0) { + NODE *match3; + + switch (nd_type(n)) { + case NODE_DREGX: + match3 = NEW_MATCH3(node2, node1, loc); + return match3; + } + } + + n = NEW_CALL(node1, tMATCH, NEW_LIST(node2, &node2->nd_loc), loc); + nd_set_line(n, line); + return n; +} + +# if WARN_PAST_SCOPE +static int +past_dvar_p(struct parser_params *p, ID id) +{ + struct vtable *past = p->lvtbl->past; + while (past) { + if (vtable_included(past, id)) return 1; + past = past->prev; + } + return 0; +} +# endif + +static int +numparam_nested_p(struct parser_params *p) +{ + struct local_vars *local = p->lvtbl; + NODE *outer = local->numparam.outer; + NODE *inner = local->numparam.inner; + if (outer || inner) { + NODE *used = outer ? outer : inner; + compile_error(p, "numbered parameter is already used in %s block\n" + "%s:%d: numbered parameter is already used here", + outer ? "outer" : "inner", + p->ruby_sourcefile, nd_line(used)); + parser_show_error_line(p, &used->nd_loc); + return 1; } - return NEW_CALL(recv, id, arg1); + return 0; +} + +static int +numparam_used_p(struct parser_params *p) +{ + NODE *numparam = p->lvtbl->numparam.current; + if (numparam) { + compile_error(p, "'it' is not allowed when a numbered parameter is already used\n" + "%s:%d: numbered parameter is already used here", + p->ruby_sourcefile, nd_line(numparam)); + parser_show_error_line(p, &numparam->nd_loc); + return 1; + } + return 0; +} + +static int +it_used_p(struct parser_params *p) +{ + NODE *it = p->lvtbl->it; + if (it) { + compile_error(p, "numbered parameters are not allowed when 'it' is already used\n" + "%s:%d: 'it' is already used here", + p->ruby_sourcefile, nd_line(it)); + parser_show_error_line(p, &it->nd_loc); + return 1; + } + return 0; } static NODE* -match_gen(node1, node2) - NODE *node1; - NODE *node2; +gettable(struct parser_params *p, ID id, const YYLTYPE *loc) { - local_cnt('~'); + ID *vidp = NULL; + NODE *node; + switch (id) { + case keyword_self: + return NEW_SELF(loc); + case keyword_nil: + return NEW_NIL(loc); + case keyword_true: + return NEW_TRUE(loc); + case keyword_false: + return NEW_FALSE(loc); + case keyword__FILE__: + { + VALUE file = p->ruby_sourcefile_string; + if (NIL_P(file)) + file = rb_str_new(0, 0); + node = NEW_FILE(file, loc); + } + return node; + case keyword__LINE__: + return NEW_LINE(loc); + case keyword__ENCODING__: + return NEW_ENCODING(loc); - value_expr(node1); - value_expr(node2); - if (node1) { - switch (nd_type(node1)) { - case NODE_DREGX: - case NODE_DREGX_ONCE: - return NEW_MATCH2(node1, node2); + } + switch (id_type(id)) { + case ID_LOCAL: + if (dyna_in_block(p) && dvar_defined_ref(p, id, &vidp)) { + if (NUMPARAM_ID_P(id) && (numparam_nested_p(p) || it_used_p(p))) return 0; + if (vidp) *vidp |= LVAR_USED; + node = NEW_DVAR(id, loc); + return node; + } + if (local_id_ref(p, id, &vidp)) { + if (vidp) *vidp |= LVAR_USED; + node = NEW_LVAR(id, loc); + return node; + } + if (dyna_in_block(p) && NUMPARAM_ID_P(id) && + parser_numbered_param(p, NUMPARAM_ID_TO_IDX(id))) { + if (numparam_nested_p(p) || it_used_p(p)) return 0; + node = NEW_DVAR(id, loc); + struct local_vars *local = p->lvtbl; + if (!local->numparam.current) local->numparam.current = node; + return node; + } +# if WARN_PAST_SCOPE + if (!p->ctxt.in_defined && RTEST(ruby_verbose) && past_dvar_p(p, id)) { + rb_warning1("possible reference to past scope - %"PRIsWARN, rb_id2str(id)); + } +# endif + /* method call without arguments */ + if (dyna_in_block(p) && id == idIt && !(DVARS_TERMINAL_P(p->lvtbl->args) || DVARS_TERMINAL_P(p->lvtbl->args->prev))) { + if (numparam_used_p(p)) return 0; + if (p->max_numparam == ORDINAL_PARAM) { + compile_error(p, "ordinary parameter is defined"); + return 0; + } + if (!p->it_id) { + p->it_id = idItImplicit; + vtable_add(p->lvtbl->args, p->it_id); + } + NODE *node = NEW_DVAR(p->it_id, loc); + if (!p->lvtbl->it) p->lvtbl->it = node; + return node; + } + return NEW_VCALL(id, loc); + case ID_GLOBAL: + return NEW_GVAR(id, loc); + case ID_INSTANCE: + return NEW_IVAR(id, loc); + case ID_CONST: + return NEW_CONST(id, loc); + case ID_CLASS: + return NEW_CVAR(id, loc); + } + compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id)); + return 0; +} - case NODE_LIT: - if (TYPE(node1->nd_lit) == T_REGEXP) { - return NEW_MATCH2(node1, node2); - } - } +static rb_node_opt_arg_t * +opt_arg_append(rb_node_opt_arg_t *opt_list, rb_node_opt_arg_t *opt) +{ + rb_node_opt_arg_t *opts = opt_list; + RNODE(opts)->nd_loc.end_pos = RNODE(opt)->nd_loc.end_pos; + + while (opts->nd_next) { + opts = opts->nd_next; + RNODE(opts)->nd_loc.end_pos = RNODE(opt)->nd_loc.end_pos; } + opts->nd_next = opt; - if (node2) { - switch (nd_type(node2)) { - case NODE_DREGX: - case NODE_DREGX_ONCE: - return NEW_MATCH3(node2, node1); + return opt_list; +} - case NODE_LIT: - if (TYPE(node2->nd_lit) == T_REGEXP) { - return NEW_MATCH3(node2, node1); - } - } +static rb_node_kw_arg_t * +kwd_append(rb_node_kw_arg_t *kwlist, rb_node_kw_arg_t *kw) +{ + if (kwlist) { + /* Assume rb_node_kw_arg_t and rb_node_opt_arg_t has same structure */ + opt_arg_append(RNODE_OPT_ARG(kwlist), RNODE_OPT_ARG(kw)); } + return kwlist; +} - return NEW_CALL(node1, tMATCH, NEW_LIST(node2)); +static NODE * +new_defined(struct parser_params *p, NODE *expr, const YYLTYPE *loc, const YYLTYPE *keyword_loc) +{ + int had_trailing_semicolon = p->ctxt.has_trailing_semicolon; + p->ctxt.has_trailing_semicolon = 0; + + NODE *n = expr; + while (n) { + if (nd_type_p(n, NODE_BEGIN)) { + n = RNODE_BEGIN(n)->nd_body; + } + else if (nd_type_p(n, NODE_BLOCK) && RNODE_BLOCK(n)->nd_end == n) { + n = RNODE_BLOCK(n)->nd_head; + } + else { + break; + } + } + + if (had_trailing_semicolon && !nd_type_p(expr, NODE_BLOCK)) { + NODE *block = NEW_BLOCK(expr, loc); + return NEW_DEFINED(block, loc, keyword_loc); + } + + return NEW_DEFINED(n, loc, keyword_loc); } static NODE* -gettable(id) - ID id; +str_to_sym_node(struct parser_params *p, NODE *node, const YYLTYPE *loc) { - if (id == kSELF) { - return NEW_SELF(); + VALUE lit; + rb_parser_string_t *str = RNODE_STR(node)->string; + if (rb_parser_enc_str_coderange(p, str) == RB_PARSER_ENC_CODERANGE_BROKEN) { + yyerror1(loc, "invalid symbol"); + lit = STR_NEW0(); } - else if (id == kNIL) { - return NEW_NIL(); + else { + lit = rb_str_new_parser_string(str); } - else if (id == kTRUE) { - return NEW_TRUE(); + return NEW_SYM(lit, loc); +} + +static NODE* +symbol_append(struct parser_params *p, NODE *symbols, NODE *symbol) +{ + enum node_type type = nd_type(symbol); + switch (type) { + case NODE_DSTR: + nd_set_type(symbol, NODE_DSYM); + break; + case NODE_STR: + symbol = str_to_sym_node(p, symbol, &RNODE(symbol)->nd_loc); + break; + default: + compile_error(p, "unexpected node as symbol: %s", parser_node_name(type)); } - else if (id == kFALSE) { - return NEW_FALSE(); + return list_append(p, symbols, symbol); +} + +static void +dregex_fragment_setenc(struct parser_params *p, rb_node_dregx_t *const dreg, int options) +{ + if (dreg->string) { + reg_fragment_setenc(p, dreg->string, options); } - else if (id == k__FILE__) { - return NEW_STR(rb_str_new2(ruby_sourcefile)); + for (struct RNode_LIST *list = dreg->nd_next; list; list = RNODE_LIST(list->nd_next)) { + NODE *frag = list->nd_head; + if (nd_type_p(frag, NODE_STR)) { + reg_fragment_setenc(p, RNODE_STR(frag)->string, options); + } + else if (nd_type_p(frag, NODE_DSTR)) { + dregex_fragment_setenc(p, RNODE_DSTR(frag), options); + } } - else if (id == k__LINE__) { - return NEW_LIT(INT2FIX(ruby_sourceline)); +} + +static NODE * +new_regexp(struct parser_params *p, NODE *node, int options, const YYLTYPE *loc, const YYLTYPE *opening_loc, const YYLTYPE *content_loc, const YYLTYPE *closing_loc) +{ + if (!node) { + /* Check string is valid regex */ + rb_parser_string_t *str = STRING_NEW0(); + reg_compile(p, str, options); + node = NEW_REGX(str, options, loc, opening_loc, content_loc, closing_loc); + return node; } - else if (is_local_id(id)) { - if (dyna_in_block() && rb_dvar_defined(id)) return NEW_DVAR(id); - if (local_id(id)) return NEW_LVAR(id); - /* method call without arguments */ -#if 0 - /* Rite will warn this */ - rb_warn("ambiguous identifier; %s() or self.%s is better for method call", - rb_id2name(id), rb_id2name(id)); -#endif - return NEW_VCALL(id); + switch (nd_type(node)) { + case NODE_STR: + { + /* Check string is valid regex */ + reg_compile(p, RNODE_STR(node)->string, options); + node = str2regx(p, node, options, loc, opening_loc, content_loc, closing_loc); + } + break; + default: + node = NEW_DSTR0(STRING_NEW0(), 1, NEW_LIST(node, loc), loc); + /* fall through */ + case NODE_DSTR: + nd_set_type(node, NODE_DREGX); + nd_set_loc(node, loc); + rb_node_dregx_t *const dreg = RNODE_DREGX(node); + dreg->as.nd_cflag = options & RE_OPTION_MASK; + if (dreg->nd_next) { + dregex_fragment_setenc(p, dreg, options); + } + if (options & RE_OPTION_ONCE) { + node = NEW_ONCE(node, loc); + } + break; + } + return node; +} + +static rb_node_kw_arg_t * +new_kw_arg(struct parser_params *p, NODE *k, const YYLTYPE *loc) +{ + if (!k) return 0; + return NEW_KW_ARG((k), loc); +} + +static NODE * +new_xstring(struct parser_params *p, NODE *node, const YYLTYPE *loc) +{ + if (!node) { + NODE *xstr = NEW_XSTR(STRING_NEW0(), loc); + return xstr; } - else if (is_global_id(id)) { - return NEW_GVAR(id); + switch (nd_type(node)) { + case NODE_STR: + nd_set_type(node, NODE_XSTR); + nd_set_loc(node, loc); + break; + case NODE_DSTR: + nd_set_type(node, NODE_DXSTR); + nd_set_loc(node, loc); + break; + default: + node = NEW_DXSTR(0, 1, NEW_LIST(node, loc), loc); + break; } - else if (is_instance_id(id)) { - return NEW_IVAR(id); + return node; +} + +static const +struct st_hash_type literal_type = { + literal_cmp, + literal_hash, +}; + +static int nd_type_st_key_enable_p(NODE *node); + +static void +check_literal_when(struct parser_params *p, NODE *arg, const YYLTYPE *loc) +{ + /* See https://bugs.ruby-lang.org/issues/20331 for discussion about what is warned. */ + if (!arg || !p->case_labels) return; + if (!nd_type_st_key_enable_p(arg)) return; + + if (p->case_labels == CHECK_LITERAL_WHEN) { + p->case_labels = st_init_table(&literal_type); } - else if (is_const_id(id)) { - return NEW_CONST(id); + else { + st_data_t line; + if (st_lookup(p->case_labels, (st_data_t)arg, &line)) { + rb_warning2("'when' clause on line %d duplicates 'when' clause on line %d and is ignored", + WARN_I((int)nd_line(arg)), WARN_I((int)line)); + return; + } } - else if (is_class_id(id)) { - return NEW_CVAR(id); + st_insert(p->case_labels, (st_data_t)arg, (st_data_t)p->ruby_sourceline); +} + +#ifdef RIPPER +static int +id_is_var(struct parser_params *p, ID id) +{ + if (is_notop_id(id)) { + switch (id & ID_SCOPE_MASK) { + case ID_GLOBAL: case ID_INSTANCE: case ID_CONST: case ID_CLASS: + return 1; + case ID_LOCAL: + if (dyna_in_block(p)) { + if (NUMPARAM_ID_P(id) || dvar_defined(p, id)) return 1; + } + if (local_id(p, id)) return 1; + /* method call without arguments */ + return 0; + } } - rb_compile_error("identifier %s is not valid", rb_id2name(id)); + compile_error(p, "identifier %"PRIsVALUE" is not valid to get", rb_id2str(id)); return 0; } +#endif -static NODE* -assignable(id, val) - ID id; - NODE *val; +static inline enum lex_state_e +parser_set_lex_state(struct parser_params *p, enum lex_state_e ls, int line) { - value_expr(val); - if (id == kSELF) { - yyerror("Can't change the value of self"); + if (p->debug) { + ls = rb_parser_trace_lex_state(p, p->lex.state, ls, line); } - else if (id == kNIL) { - yyerror("Can't assign to nil"); + return p->lex.state = ls; +} + +#ifndef RIPPER +static void +flush_debug_buffer(struct parser_params *p, VALUE out, VALUE str) +{ + VALUE mesg = p->debug_buffer; + + if (!NIL_P(mesg) && RSTRING_LEN(mesg)) { + p->debug_buffer = Qnil; + rb_io_puts(1, &mesg, out); } - else if (id == kTRUE) { - yyerror("Can't assign to true"); + if (!NIL_P(str) && RSTRING_LEN(str)) { + rb_io_write(p->debug_output, str); } - else if (id == kFALSE) { - yyerror("Can't assign to false"); +} + +static const char rb_parser_lex_state_names[][8] = { + "BEG", "END", "ENDARG", "ENDFN", "ARG", + "CMDARG", "MID", "FNAME", "DOT", "CLASS", + "LABEL", "LABELED","FITEM", +}; + +static VALUE +append_lex_state_name(struct parser_params *p, enum lex_state_e state, VALUE buf) +{ + int i, sep = 0; + unsigned int mask = 1; + static const char none[] = "NONE"; + + for (i = 0; i < EXPR_MAX_STATE; ++i, mask <<= 1) { + if ((unsigned)state & mask) { + if (sep) { + rb_str_cat(buf, "|", 1); + } + sep = 1; + rb_str_cat_cstr(buf, rb_parser_lex_state_names[i]); + } } - else if (id == k__FILE__) { - yyerror("Can't assign to __FILE__"); + if (!sep) { + rb_str_cat(buf, none, sizeof(none)-1); } - else if (id == k__LINE__) { - yyerror("Can't assign to __LINE__"); + return buf; +} + +enum lex_state_e +rb_parser_trace_lex_state(struct parser_params *p, enum lex_state_e from, + enum lex_state_e to, int line) +{ + VALUE mesg; + mesg = rb_str_new_cstr("lex_state: "); + append_lex_state_name(p, from, mesg); + rb_str_cat_cstr(mesg, " -> "); + append_lex_state_name(p, to, mesg); + rb_str_catf(mesg, " at line %d\n", line); + flush_debug_buffer(p, p->debug_output, mesg); + return to; +} + +VALUE +rb_parser_lex_state_name(struct parser_params *p, enum lex_state_e state) +{ + return rb_str_to_interned_str(append_lex_state_name(p, state, rb_str_new(0, 0))); +} + +static void +append_bitstack_value(struct parser_params *p, stack_type stack, VALUE mesg) +{ + if (stack == 0) { + rb_str_cat_cstr(mesg, "0"); } - else if (is_local_id(id)) { - if (rb_dvar_curr(id)) { - return NEW_DASGN_CURR(id, val); - } - else if (rb_dvar_defined(id)) { - return NEW_DASGN(id, val); - } - else if (local_id(id) || !dyna_in_block()) { - return NEW_LASGN(id, val); - } - else{ - rb_dvar_push(id, Qnil); - return NEW_DASGN_CURR(id, val); - } + else { + stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1); + for (; mask && !(stack & mask); mask >>= 1) continue; + for (; mask; mask >>= 1) rb_str_cat(mesg, stack & mask ? "1" : "0", 1); } - else if (is_global_id(id)) { - return NEW_GASGN(id, val); +} + +void +rb_parser_show_bitstack(struct parser_params *p, stack_type stack, + const char *name, int line) +{ + VALUE mesg = rb_sprintf("%s: ", name); + append_bitstack_value(p, stack, mesg); + rb_str_catf(mesg, " at line %d\n", line); + flush_debug_buffer(p, p->debug_output, mesg); +} + +void +rb_parser_fatal(struct parser_params *p, const char *fmt, ...) +{ + va_list ap; + VALUE mesg = rb_str_new_cstr("internal parser error: "); + + va_start(ap, fmt); + rb_str_vcatf(mesg, fmt, ap); + va_end(ap); + yyerror0(RSTRING_PTR(mesg)); + RB_GC_GUARD(mesg); + + mesg = rb_str_new(0, 0); + append_lex_state_name(p, p->lex.state, mesg); + compile_error(p, "lex.state: %"PRIsVALUE, mesg); + rb_str_resize(mesg, 0); + append_bitstack_value(p, p->cond_stack, mesg); + compile_error(p, "cond_stack: %"PRIsVALUE, mesg); + rb_str_resize(mesg, 0); + append_bitstack_value(p, p->cmdarg_stack, mesg); + compile_error(p, "cmdarg_stack: %"PRIsVALUE, mesg); + if (p->debug_output == rb_ractor_stdout()) + p->debug_output = rb_ractor_stderr(); + p->debug = TRUE; +} + +static YYLTYPE * +rb_parser_set_pos(YYLTYPE *yylloc, int sourceline, int beg_pos, int end_pos) +{ + yylloc->beg_pos.lineno = sourceline; + yylloc->beg_pos.column = beg_pos; + yylloc->end_pos.lineno = sourceline; + yylloc->end_pos.column = end_pos; + return yylloc; +} + +YYLTYPE * +rb_parser_set_location_from_strterm_heredoc(struct parser_params *p, rb_strterm_heredoc_t *here, YYLTYPE *yylloc) +{ + int sourceline = here->sourceline; + int beg_pos = (int)here->offset - here->quote + - (rb_strlen_lit("<<-") - !(here->func & STR_FUNC_INDENT)); + int end_pos = (int)here->offset + here->length + here->quote; + + return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos); +} + +YYLTYPE * +rb_parser_set_location_of_delayed_token(struct parser_params *p, YYLTYPE *yylloc) +{ + yylloc->beg_pos.lineno = p->delayed.beg_line; + yylloc->beg_pos.column = p->delayed.beg_col; + yylloc->end_pos.lineno = p->delayed.end_line; + yylloc->end_pos.column = p->delayed.end_col; + + return yylloc; +} + +YYLTYPE * +rb_parser_set_location_of_heredoc_end(struct parser_params *p, YYLTYPE *yylloc) +{ + int sourceline = p->ruby_sourceline; + int beg_pos = (int)(p->lex.ptok - p->lex.pbeg); + int end_pos = (int)(p->lex.pend - p->lex.pbeg); + return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos); +} + +YYLTYPE * +rb_parser_set_location_of_dummy_end(struct parser_params *p, YYLTYPE *yylloc) +{ + yylloc->end_pos = yylloc->beg_pos; + + return yylloc; +} + +YYLTYPE * +rb_parser_set_location_of_none(struct parser_params *p, YYLTYPE *yylloc) +{ + int sourceline = p->ruby_sourceline; + int beg_pos = (int)(p->lex.ptok - p->lex.pbeg); + int end_pos = (int)(p->lex.ptok - p->lex.pbeg); + return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos); +} + +YYLTYPE * +rb_parser_set_location(struct parser_params *p, YYLTYPE *yylloc) +{ + int sourceline = p->ruby_sourceline; + int beg_pos = (int)(p->lex.ptok - p->lex.pbeg); + int end_pos = (int)(p->lex.pcur - p->lex.pbeg); + return rb_parser_set_pos(yylloc, sourceline, beg_pos, end_pos); +} +#endif /* !RIPPER */ + +static int +assignable0(struct parser_params *p, ID id, const char **err) +{ + if (!id) return -1; + switch (id) { + case keyword_self: + *err = "Can't change the value of self"; + return -1; + case keyword_nil: + *err = "Can't assign to nil"; + return -1; + case keyword_true: + *err = "Can't assign to true"; + return -1; + case keyword_false: + *err = "Can't assign to false"; + return -1; + case keyword__FILE__: + *err = "Can't assign to __FILE__"; + return -1; + case keyword__LINE__: + *err = "Can't assign to __LINE__"; + return -1; + case keyword__ENCODING__: + *err = "Can't assign to __ENCODING__"; + return -1; } - else if (is_instance_id(id)) { - return NEW_IASGN(id, val); + switch (id_type(id)) { + case ID_LOCAL: + if (dyna_in_block(p)) { + if (p->max_numparam > NO_PARAM && NUMPARAM_ID_P(id)) { + compile_error(p, "Can't assign to numbered parameter _%d", + NUMPARAM_ID_TO_IDX(id)); + return -1; + } + if (dvar_curr(p, id)) return NODE_DASGN; + if (dvar_defined(p, id)) return NODE_DASGN; + if (local_id(p, id)) return NODE_LASGN; + dyna_var(p, id); + return NODE_DASGN; + } + else { + if (!local_id(p, id)) local_var(p, id); + return NODE_LASGN; + } + break; + case ID_GLOBAL: return NODE_GASGN; + case ID_INSTANCE: return NODE_IASGN; + case ID_CONST: + if (!p->ctxt.in_def) return NODE_CDECL; + *err = "dynamic constant assignment"; + return -1; + case ID_CLASS: return NODE_CVASGN; + default: + compile_error(p, "identifier %"PRIsVALUE" is not valid to set", rb_id2str(id)); } - else if (is_const_id(id)) { - if (in_def || in_single) - yyerror("dynamic constant assignment"); - return NEW_CDECL(id, val, 0); + return -1; +} + +static NODE* +assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc) +{ + const char *err = 0; + int node_type = assignable0(p, id, &err); + switch (node_type) { + case NODE_DASGN: return NEW_DASGN(id, val, loc); + case NODE_LASGN: return NEW_LASGN(id, val, loc); + case NODE_GASGN: return NEW_GASGN(id, val, loc); + case NODE_IASGN: return NEW_IASGN(id, val, loc); + case NODE_CDECL: return NEW_CDECL(id, val, 0, p->ctxt.shareable_constant_value, loc); + case NODE_CVASGN: return NEW_CVASGN(id, val, loc); } - else if (is_class_id(id)) { - if (in_def || in_single) return NEW_CVASGN(id, val); - return NEW_CVDECL(id, val); +/* TODO: FIXME */ +#ifndef RIPPER + if (err) yyerror1(loc, err); +#else + if (err) set_value(assign_error(p, err, p->s_lvalue)); +#endif + return NEW_ERROR(loc); +} + +static int +is_private_local_id(struct parser_params *p, ID name) +{ + VALUE s; + if (name == idUScore) return 1; + if (!is_local_id(name)) return 0; + s = rb_id2str(name); + if (!s) return 0; + return RSTRING_PTR(s)[0] == '_'; +} + +static int +shadowing_lvar_0(struct parser_params *p, ID name) +{ + if (dyna_in_block(p)) { + if (dvar_curr(p, name)) { + if (is_private_local_id(p, name)) return 1; + yyerror0("duplicated argument name"); + } + else if (dvar_defined(p, name) || local_id(p, name)) { + vtable_add(p->lvtbl->vars, name); + if (p->lvtbl->used) { + vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline | LVAR_USED); + } + return 0; + } } else { - rb_compile_error("identifier %s is not valid", rb_id2name(id)); + if (local_id(p, name)) { + if (is_private_local_id(p, name)) return 1; + yyerror0("duplicated argument name"); + } } - return 0; + return 1; } -static NODE * -aryset(recv, idx) - NODE *recv, *idx; +static ID +shadowing_lvar(struct parser_params *p, ID name) { - if (recv && nd_type(recv) == NODE_SELF) - recv = (NODE *)1; - else - value_expr(recv); - return NEW_ATTRASGN(recv, tASET, idx); + shadowing_lvar_0(p, name); + return name; } -ID -rb_id_attrset(id) - ID id; +static void +new_bv(struct parser_params *p, ID name) { - id &= ~ID_SCOPE_MASK; - id |= ID_ATTRSET; - return id; + if (!name) return; + if (!is_local_id(name)) { + compile_error(p, "invalid local variable - %"PRIsVALUE, + rb_id2str(name)); + return; + } + if (!shadowing_lvar_0(p, name)) return; + dyna_var(p, name); + ID *vidp = 0; + if (dvar_defined_ref(p, name, &vidp)) { + if (vidp) *vidp |= LVAR_USED; + } +} + +static void +aryset_check(struct parser_params *p, NODE *args) +{ + NODE *block = 0, *kwds = 0; + if (args && nd_type_p(args, NODE_BLOCK_PASS)) { + block = RNODE_BLOCK_PASS(args)->nd_body; + args = RNODE_BLOCK_PASS(args)->nd_head; + } + if (args && nd_type_p(args, NODE_ARGSCAT)) { + args = RNODE_ARGSCAT(args)->nd_body; + } + if (args && nd_type_p(args, NODE_ARGSPUSH)) { + kwds = RNODE_ARGSPUSH(args)->nd_body; + } + else { + for (NODE *next = args; next && nd_type_p(next, NODE_LIST); + next = RNODE_LIST(next)->nd_next) { + kwds = RNODE_LIST(next)->nd_head; + } + } + if (kwds && nd_type_p(kwds, NODE_HASH) && !RNODE_HASH(kwds)->nd_brace) { + yyerror1(&kwds->nd_loc, "keyword arg given in index assignment"); + } + if (block) { + yyerror1(&block->nd_loc, "block arg given in index assignment"); + } } static NODE * -attrset(recv, id) - NODE *recv; - ID id; +aryset(struct parser_params *p, NODE *recv, NODE *idx, const YYLTYPE *loc) { - if (recv && nd_type(recv) == NODE_SELF) - recv = (NODE *)1; - else - value_expr(recv); - return NEW_ATTRASGN(recv, rb_id_attrset(id), 0); + aryset_check(p, idx); + return NEW_ATTRASGN(recv, tASET, idx, loc); } static void -rb_backref_error(node) - NODE *node; +block_dup_check(struct parser_params *p, NODE *node1, NODE *node2) { + if (node2 && node1 && nd_type_p(node1, NODE_BLOCK_PASS)) { + compile_error(p, "both block arg and actual block given"); + } +} + +static NODE * +attrset(struct parser_params *p, NODE *recv, ID atype, ID id, const YYLTYPE *loc) +{ + if (!CALL_Q_P(atype)) id = rb_id_attrset(id); + return NEW_ATTRASGN(recv, id, 0, loc); +} + +static VALUE +rb_backref_error(struct parser_params *p, NODE *node) +{ +#ifndef RIPPER +# define ERR(...) (compile_error(p, __VA_ARGS__), Qtrue) +#else +# define ERR(...) rb_sprintf(__VA_ARGS__) +#endif switch (nd_type(node)) { case NODE_NTH_REF: - rb_compile_error("Can't set variable $%d", node->nd_nth); - break; + return ERR("Can't set variable $%ld", RNODE_NTH_REF(node)->nd_nth); case NODE_BACK_REF: - rb_compile_error("Can't set variable $%c", (int)node->nd_nth); - break; + return ERR("Can't set variable $%c", (int)RNODE_BACK_REF(node)->nd_nth); + } +#undef ERR + UNREACHABLE_RETURN(Qfalse); /* only called on syntax error */ +} + +static NODE * +arg_append(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc) +{ + if (!node1) return NEW_LIST(node2, &node2->nd_loc); + switch (nd_type(node1)) { + case NODE_LIST: + return list_append(p, node1, node2); + case NODE_BLOCK_PASS: + RNODE_BLOCK_PASS(node1)->nd_head = arg_append(p, RNODE_BLOCK_PASS(node1)->nd_head, node2, loc); + node1->nd_loc.end_pos = RNODE_BLOCK_PASS(node1)->nd_head->nd_loc.end_pos; + return node1; + case NODE_ARGSPUSH: + RNODE_ARGSPUSH(node1)->nd_body = list_append(p, NEW_LIST(RNODE_ARGSPUSH(node1)->nd_body, &RNODE_ARGSPUSH(node1)->nd_body->nd_loc), node2); + node1->nd_loc.end_pos = RNODE_ARGSPUSH(node1)->nd_body->nd_loc.end_pos; + nd_set_type(node1, NODE_ARGSCAT); + return node1; + case NODE_ARGSCAT: + if (!nd_type_p(RNODE_ARGSCAT(node1)->nd_body, NODE_LIST)) break; + RNODE_ARGSCAT(node1)->nd_body = list_append(p, RNODE_ARGSCAT(node1)->nd_body, node2); + node1->nd_loc.end_pos = RNODE_ARGSCAT(node1)->nd_body->nd_loc.end_pos; + return node1; } + return NEW_ARGSPUSH(node1, node2, loc); } static NODE * -arg_concat(node1, node2) - NODE *node1; - NODE *node2; +arg_concat(struct parser_params *p, NODE *node1, NODE *node2, const YYLTYPE *loc) { if (!node2) return node1; - return NEW_ARGSCAT(node1, node2); + switch (nd_type(node1)) { + case NODE_BLOCK_PASS: + if (RNODE_BLOCK_PASS(node1)->nd_head) + RNODE_BLOCK_PASS(node1)->nd_head = arg_concat(p, RNODE_BLOCK_PASS(node1)->nd_head, node2, loc); + else + RNODE_LIST(node1)->nd_head = NEW_LIST(node2, loc); + return node1; + case NODE_ARGSPUSH: + if (!nd_type_p(node2, NODE_LIST)) break; + RNODE_ARGSPUSH(node1)->nd_body = list_concat(NEW_LIST(RNODE_ARGSPUSH(node1)->nd_body, loc), node2); + nd_set_type(node1, NODE_ARGSCAT); + return node1; + case NODE_ARGSCAT: + if (!nd_type_p(node2, NODE_LIST) || + !nd_type_p(RNODE_ARGSCAT(node1)->nd_body, NODE_LIST)) break; + RNODE_ARGSCAT(node1)->nd_body = list_concat(RNODE_ARGSCAT(node1)->nd_body, node2); + return node1; + } + return NEW_ARGSCAT(node1, node2, loc); } static NODE * -arg_add(node1, node2) - NODE *node1; - NODE *node2; +last_arg_append(struct parser_params *p, NODE *args, NODE *last_arg, const YYLTYPE *loc) { - if (!node1) return NEW_LIST(node2); - if (nd_type(node1) == NODE_ARRAY) { - return list_append(node1, node2); + NODE *n1; + if ((n1 = splat_array(args)) != 0) { + return list_append(p, n1, last_arg); } - else { - return NEW_ARGSPUSH(node1, node2); + return arg_append(p, args, last_arg, loc); +} + +static NODE * +rest_arg_append(struct parser_params *p, NODE *args, NODE *rest_arg, const YYLTYPE *loc) +{ + NODE *n1; + if ((nd_type_p(rest_arg, NODE_LIST)) && (n1 = splat_array(args)) != 0) { + return list_concat(n1, rest_arg); } + return arg_concat(p, args, rest_arg, loc); } -static NODE* -node_assign(lhs, rhs) - NODE *lhs, *rhs; +static NODE * +splat_array(NODE* node) +{ + if (nd_type_p(node, NODE_SPLAT)) node = RNODE_SPLAT(node)->nd_head; + if (nd_type_p(node, NODE_LIST)) return node; + return 0; +} + +static void +mark_lvar_used(struct parser_params *p, NODE *rhs) +{ + ID *vidp = NULL; + if (!rhs) return; + switch (nd_type(rhs)) { + case NODE_LASGN: + if (local_id_ref(p, RNODE_LASGN(rhs)->nd_vid, &vidp)) { + if (vidp) *vidp |= LVAR_USED; + } + break; + case NODE_DASGN: + if (dvar_defined_ref(p, RNODE_DASGN(rhs)->nd_vid, &vidp)) { + if (vidp) *vidp |= LVAR_USED; + } + break; +#if 0 + case NODE_MASGN: + for (rhs = rhs->nd_head; rhs; rhs = rhs->nd_next) { + mark_lvar_used(p, rhs->nd_head); + } + break; +#endif + } +} + +static int is_static_content(NODE *node); + +static NODE * +node_assign(struct parser_params *p, NODE *lhs, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc) { if (!lhs) return 0; - value_expr(rhs); switch (nd_type(lhs)) { + case NODE_CDECL: case NODE_GASGN: case NODE_IASGN: case NODE_LASGN: case NODE_DASGN: - case NODE_DASGN_CURR: case NODE_MASGN: - case NODE_CDECL: - case NODE_CVDECL: case NODE_CVASGN: - lhs->nd_value = rhs; - break; + set_nd_value(p, lhs, rhs); + nd_set_loc(lhs, loc); + break; case NODE_ATTRASGN: - case NODE_CALL: - lhs->nd_args = arg_add(lhs->nd_args, rhs); - break; + RNODE_ATTRASGN(lhs)->nd_args = arg_append(p, RNODE_ATTRASGN(lhs)->nd_args, rhs, loc); + nd_set_loc(lhs, loc); + break; default: - /* should not happen */ - break; + /* should not happen */ + break; } return lhs; } -static int -value_expr0(node) - NODE *node; +static NODE * +value_expr_check(struct parser_params *p, NODE *node) { - int cond = 0; + NODE *void_node = 0, *vn; + if (!node) { + rb_warning0("empty expression"); + } while (node) { - switch (nd_type(node)) { - case NODE_DEFN: - case NODE_DEFS: - parser_warning(node, "void value expression"); - return Qfalse; - - case NODE_RETURN: - case NODE_BREAK: - case NODE_NEXT: - case NODE_REDO: - case NODE_RETRY: - if (!cond) yyerror("void value expression"); - /* or "control never reach"? */ - return Qfalse; - - case NODE_BLOCK: - while (node->nd_next) { - node = node->nd_next; - } - node = node->nd_head; - break; - - case NODE_BEGIN: - node = node->nd_body; - break; - - case NODE_IF: - if (!value_expr(node->nd_body)) return Qfalse; - node = node->nd_else; - break; - - case NODE_AND: - case NODE_OR: - cond = 1; - node = node->nd_2nd; - break; - - default: - return Qtrue; - } - } - - return Qtrue; + switch (nd_type(node)) { + case NODE_ENSURE: + vn = RNODE_ENSURE(node)->nd_head; + node = RNODE_ENSURE(node)->nd_ensr; + /* nd_ensr should not be NULL, check it out next */ + if (vn && (vn = value_expr_check(p, vn))) { + goto found; + } + break; + + case NODE_RESCUE: + /* void only if all children are void */ + vn = RNODE_RESCUE(node)->nd_head; + if (!vn || !(vn = value_expr_check(p, vn))) return NULL; + if (!void_node) void_node = vn; + for (NODE *r = RNODE_RESCUE(node)->nd_resq; r; r = RNODE_RESBODY(r)->nd_next) { + if (!nd_type_p(r, NODE_RESBODY)) { + compile_error(p, "unexpected node"); + return NULL; + } + if (!(vn = value_expr_check(p, RNODE_RESBODY(r)->nd_body))) { + void_node = 0; + break; + } + if (!void_node) void_node = vn; + } + node = RNODE_RESCUE(node)->nd_else; + if (!node) return void_node; + break; + + case NODE_RETURN: + case NODE_BREAK: + case NODE_NEXT: + case NODE_REDO: + case NODE_RETRY: + goto found; + + case NODE_CASE3: + if (!RNODE_CASE3(node)->nd_body || !nd_type_p(RNODE_CASE3(node)->nd_body, NODE_IN)) { + compile_error(p, "unexpected node"); + return NULL; + } + if (RNODE_IN(RNODE_CASE3(node)->nd_body)->nd_body) { + return NULL; + } + /* single line pattern matching with "=>" operator */ + goto found; + + case NODE_BLOCK: + while (RNODE_BLOCK(node)->nd_next) { + node = RNODE_BLOCK(node)->nd_next; + } + node = RNODE_BLOCK(node)->nd_head; + break; + + case NODE_BEGIN: + node = RNODE_BEGIN(node)->nd_body; + break; + + case NODE_IF: + case NODE_UNLESS: + if (!RNODE_IF(node)->nd_body) { + return NULL; + } + else if (!RNODE_IF(node)->nd_else) { + return NULL; + } + vn = value_expr_check(p, RNODE_IF(node)->nd_body); + if (!vn) return NULL; + if (!void_node) void_node = vn; + node = RNODE_IF(node)->nd_else; + break; + + case NODE_AND: + case NODE_OR: + node = RNODE_AND(node)->nd_1st; + break; + + case NODE_LASGN: + case NODE_DASGN: + case NODE_MASGN: + mark_lvar_used(p, node); + return NULL; + + default: + return NULL; + } + } + + return NULL; + + found: + /* return the first found node */ + return void_node ? void_node : node; +} + +static int +value_expr(struct parser_params *p, NODE *node) +{ + NODE *void_node = value_expr_check(p, node); + if (void_node) { + yyerror1(&void_node->nd_loc, "void value expression"); + /* or "control never reach"? */ + return FALSE; + } + return TRUE; } static void -void_expr0(node) - NODE *node; +void_expr(struct parser_params *p, NODE *node) { - char *useless = 0; + const char *useless = 0; if (!RTEST(ruby_verbose)) return; - if (!node) return; + if (!node || !(node = nd_once_body(node))) return; switch (nd_type(node)) { - case NODE_CALL: - switch (node->nd_mid) { - case '+': - case '-': - case '*': - case '/': - case '%': - case tPOW: - case tUPLUS: - case tUMINUS: - case '|': - case '^': - case '&': - case tCMP: - case '>': - case tGEQ: - case '<': - case tLEQ: - case tEQ: - case tNEQ: - useless = rb_id2name(node->nd_mid); - break; - } - break; + case NODE_OPCALL: + switch (RNODE_OPCALL(node)->nd_mid) { + case '+': + case '-': + case '*': + case '/': + case '%': + case tPOW: + case tUPLUS: + case tUMINUS: + case '|': + case '^': + case '&': + case tCMP: + case '>': + case tGEQ: + case '<': + case tLEQ: + case tEQ: + case tNEQ: + useless = rb_id2name(RNODE_OPCALL(node)->nd_mid); + break; + } + break; case NODE_LVAR: case NODE_DVAR: @@ -5057,1042 +13975,2102 @@ void_expr0(node) case NODE_CVAR: case NODE_NTH_REF: case NODE_BACK_REF: - useless = "a variable"; - break; + useless = "a variable"; + break; case NODE_CONST: - case NODE_CREF: - useless = "a constant"; - break; - case NODE_LIT: + useless = "a constant"; + break; + case NODE_SYM: + case NODE_LINE: + case NODE_FILE: + case NODE_ENCODING: + case NODE_INTEGER: + case NODE_FLOAT: + case NODE_RATIONAL: + case NODE_IMAGINARY: case NODE_STR: case NODE_DSTR: + case NODE_REGX: case NODE_DREGX: - case NODE_DREGX_ONCE: - useless = "a literal"; - break; + useless = "a literal"; + break; case NODE_COLON2: case NODE_COLON3: - useless = "::"; - break; + useless = "::"; + break; case NODE_DOT2: - useless = ".."; - break; + useless = ".."; + break; case NODE_DOT3: - useless = "..."; - break; + useless = "..."; + break; case NODE_SELF: - useless = "self"; - break; + useless = "self"; + break; case NODE_NIL: - useless = "nil"; - break; + useless = "nil"; + break; case NODE_TRUE: - useless = "true"; - break; + useless = "true"; + break; case NODE_FALSE: - useless = "false"; - break; + useless = "false"; + break; case NODE_DEFINED: - useless = "defined?"; - break; + useless = "defined?"; + break; } if (useless) { - int line = ruby_sourceline; - - ruby_sourceline = nd_line(node); - rb_warn("useless use of %s in void context", useless); - ruby_sourceline = line; + rb_warn1L(nd_line(node), "possibly useless use of %s in void context", WARN_S(useless)); } } -static void -void_stmts(node) - NODE *node; +/* warns useless use of block and returns the last statement node */ +static NODE * +void_stmts(struct parser_params *p, NODE *node) { - if (!RTEST(ruby_verbose)) return; - if (!node) return; - if (nd_type(node) != NODE_BLOCK) return; - - for (;;) { - if (!node->nd_next) return; - void_expr(node->nd_head); - node = node->nd_next; + NODE *const n = node; + if (!RTEST(ruby_verbose)) return n; + if (!node) return n; + if (!nd_type_p(node, NODE_BLOCK)) return n; + + while (RNODE_BLOCK(node)->nd_next) { + void_expr(p, RNODE_BLOCK(node)->nd_head); + node = RNODE_BLOCK(node)->nd_next; } + return RNODE_BLOCK(node)->nd_head; } static NODE * -remove_begin(node) - NODE *node; +remove_begin(NODE *node) { - NODE **n = &node; - while (*n) { - if (nd_type(*n) != NODE_BEGIN) { - return node; - } - *n = (*n)->nd_body; + NODE **n = &node, *n1 = node; + while (n1 && nd_type_p(n1, NODE_BEGIN) && RNODE_BEGIN(n1)->nd_body) { + *n = n1 = RNODE_BEGIN(n1)->nd_body; } return node; } static void -reduce_nodes(body) - NODE **body; +reduce_nodes(struct parser_params *p, NODE **body) { NODE *node = *body; -#define subnodes(n1, n2) \ - ((!node->n1) ? (node->n2 ? (body = &node->n2, 1) : 0) : \ - (!node->n2) ? (body = &node->n1, 1) : \ - (reduce_nodes(&node->n1), body = &node->n2, 1)) + if (!node) { + *body = NEW_NIL(&NULL_LOC); + return; + } +#define subnodes(type, n1, n2) \ + ((!type(node)->n1) ? (type(node)->n2 ? (body = &type(node)->n2, 1) : 0) : \ + (!type(node)->n2) ? (body = &type(node)->n1, 1) : \ + (reduce_nodes(p, &type(node)->n1), body = &type(node)->n2, 1)) while (node) { - switch (nd_type(node)) { - end: - case NODE_NIL: - *body = 0; - return; - case NODE_RETURN: - *body = node = node->nd_stts; - continue; - case NODE_BEGIN: - *body = node = node->nd_body; - continue; - case NODE_BLOCK: - body = &node->nd_end->nd_head; - break; - case NODE_IF: - if (subnodes(nd_body, nd_else)) break; - return; - case NODE_CASE: - body = &node->nd_body; - break; - case NODE_WHEN: - if (!subnodes(nd_body, nd_next)) goto end; - break; - case NODE_ENSURE: - if (!subnodes(nd_head, nd_resq)) goto end; - break; - case NODE_RESCUE: - if (!subnodes(nd_head, nd_resq)) goto end; - break; - default: - return; - } - node = *body; + int newline = (int)nd_fl_newline(node); + switch (nd_type(node)) { + end: + case NODE_NIL: + *body = 0; + return; + case NODE_BEGIN: + *body = node = RNODE_BEGIN(node)->nd_body; + if (newline && node) nd_set_fl_newline(node); + continue; + case NODE_BLOCK: + body = &RNODE_BLOCK(RNODE_BLOCK(node)->nd_end)->nd_head; + break; + case NODE_IF: + case NODE_UNLESS: + if (subnodes(RNODE_IF, nd_body, nd_else)) break; + return; + case NODE_CASE: + body = &RNODE_CASE(node)->nd_body; + break; + case NODE_WHEN: + if (!subnodes(RNODE_WHEN, nd_body, nd_next)) goto end; + break; + case NODE_ENSURE: + body = &RNODE_ENSURE(node)->nd_head; + break; + case NODE_RESCUE: + newline = 0; // RESBODY should not be a NEWLINE + if (RNODE_RESCUE(node)->nd_else) { + body = &RNODE_RESCUE(node)->nd_resq; + break; + } + if (!subnodes(RNODE_RESCUE, nd_head, nd_resq)) goto end; + break; + default: + return; + } + node = *body; + if (newline && node) nd_set_fl_newline(node); } #undef subnodes } static int -assign_in_cond(node) - NODE *node; +is_static_content(NODE *node) { + if (!node) return 1; switch (nd_type(node)) { - case NODE_MASGN: - yyerror("multiple assignment in conditional"); - return 1; - - case NODE_LASGN: - case NODE_DASGN: - case NODE_GASGN: - case NODE_IASGN: - break; - - default: - return 0; - } - - switch (nd_type(node->nd_value)) { - case NODE_LIT: + case NODE_HASH: + if (!(node = RNODE_HASH(node)->nd_head)) break; + case NODE_LIST: + do { + if (!is_static_content(RNODE_LIST(node)->nd_head)) return 0; + } while ((node = RNODE_LIST(node)->nd_next) != 0); + case NODE_SYM: + case NODE_REGX: + case NODE_LINE: + case NODE_FILE: + case NODE_ENCODING: + case NODE_INTEGER: + case NODE_FLOAT: + case NODE_RATIONAL: + case NODE_IMAGINARY: case NODE_STR: case NODE_NIL: case NODE_TRUE: case NODE_FALSE: - /* reports always */ - parser_warn(node->nd_value, "found = in conditional, should be =="); - return 1; - - case NODE_DSTR: - case NODE_XSTR: - case NODE_DXSTR: - case NODE_EVSTR: - case NODE_DREGX: + case NODE_ZLIST: + break; default: - break; - } -#if 0 - if (assign_in_cond(node->nd_value) == 0) { - parser_warning(node->nd_value, "assignment in condition"); + return 0; } -#endif return 1; } static int -e_option_supplied() +assign_in_cond(struct parser_params *p, NODE *node) { - if (strcmp(ruby_sourcefile, "-e") == 0) - return Qtrue; - return Qfalse; -} + switch (nd_type(node)) { + case NODE_MASGN: + case NODE_LASGN: + case NODE_DASGN: + case NODE_GASGN: + case NODE_IASGN: + case NODE_CVASGN: + case NODE_CDECL: + break; -static void -warn_unless_e_option(node, str) - NODE *node; - const char *str; -{ - if (!e_option_supplied()) parser_warn(node, str); -} + default: + return 0; + } -static void -warning_unless_e_option(node, str) - NODE *node; - const char *str; -{ - if (!e_option_supplied()) parser_warning(node, str); + if (!get_nd_value(p, node)) return 1; + if (is_static_content(get_nd_value(p, node))) { + /* reports always */ + rb_warn0L(nd_line(get_nd_value(p, node)), "found '= literal' in conditional, should be =="); + } + return 1; } -static NODE *cond0(); +enum cond_type { + COND_IN_OP, + COND_IN_COND, + COND_IN_FF +}; + +#define SWITCH_BY_COND_TYPE(t, w, arg) do { \ + switch (t) { \ + case COND_IN_OP: break; \ + case COND_IN_COND: rb_##w##0(arg "literal in condition"); break; \ + case COND_IN_FF: rb_##w##0(arg "literal in flip-flop"); break; \ + } \ +} while (0) + +static NODE *cond0(struct parser_params*,NODE*,enum cond_type,const YYLTYPE*,bool); static NODE* -range_op(node) - NODE *node; +range_op(struct parser_params *p, NODE *node, const YYLTYPE *loc) { enum node_type type; - if (!e_option_supplied()) return node; if (node == 0) return 0; - value_expr(node); - node = cond0(node); type = nd_type(node); - if (type == NODE_LIT && FIXNUM_P(node->nd_lit)) { - warn_unless_e_option(node, "integer literal in conditional range"); - return call_op(node,tEQ,1,NEW_GVAR(rb_intern("$."))); - } - return node; -} - -static int -literal_node(node) - NODE *node; -{ - if (!node) return 1; /* same as NODE_NIL */ - switch (nd_type(node)) { - case NODE_LIT: - case NODE_STR: - case NODE_DSTR: - case NODE_EVSTR: - case NODE_DREGX: - case NODE_DREGX_ONCE: - case NODE_DSYM: - return 2; - case NODE_TRUE: - case NODE_FALSE: - case NODE_NIL: - return 1; + value_expr(p, node); + if (type == NODE_INTEGER) { + if (!e_option_supplied(p)) rb_warn0L(nd_line(node), "integer literal in flip-flop"); + ID lineno = rb_intern("$."); + return NEW_CALL(node, tEQ, NEW_LIST(NEW_GVAR(lineno, loc), loc), loc); } - return 0; + return cond0(p, node, COND_IN_FF, loc, true); } static NODE* -cond0(node) - NODE *node; +cond0(struct parser_params *p, NODE *node, enum cond_type type, const YYLTYPE *loc, bool top) { - enum node_type type = nd_type(node); + if (node == 0) return 0; + if (!(node = nd_once_body(node))) return 0; + assign_in_cond(p, node); - assign_in_cond(node); + switch (nd_type(node)) { + case NODE_BEGIN: + RNODE_BEGIN(node)->nd_body = cond0(p, RNODE_BEGIN(node)->nd_body, type, loc, top); + break; - switch (type) { case NODE_DSTR: case NODE_EVSTR: case NODE_STR: - rb_warn("string literal in condition"); - break; + case NODE_FILE: + SWITCH_BY_COND_TYPE(type, warn, "string "); + break; + + case NODE_REGX: + if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warn, "regex "); + nd_set_type(node, NODE_MATCH); + break; case NODE_DREGX: - case NODE_DREGX_ONCE: - warning_unless_e_option(node, "regex literal in condition"); - local_cnt('_'); - local_cnt('~'); - return NEW_MATCH2(node, NEW_GVAR(rb_intern("$_"))); + if (!e_option_supplied(p)) SWITCH_BY_COND_TYPE(type, warning, "regex "); + + return NEW_MATCH2(node, NEW_GVAR(idLASTLINE, loc), loc); + + case NODE_BLOCK: + { + NODE *end = RNODE_BLOCK(node)->nd_end; + NODE **expr = &RNODE_BLOCK(end)->nd_head; + if (top) top = node == end; + *expr = cond0(p, *expr, type, loc, top); + } + break; case NODE_AND: case NODE_OR: - node->nd_1st = cond0(node->nd_1st); - node->nd_2nd = cond0(node->nd_2nd); - break; + RNODE_AND(node)->nd_1st = cond0(p, RNODE_AND(node)->nd_1st, COND_IN_COND, loc, true); + RNODE_AND(node)->nd_2nd = cond0(p, RNODE_AND(node)->nd_2nd, COND_IN_COND, loc, true); + break; case NODE_DOT2: case NODE_DOT3: - node->nd_beg = range_op(node->nd_beg); - node->nd_end = range_op(node->nd_end); - if (type == NODE_DOT2) nd_set_type(node,NODE_FLIP2); - else if (type == NODE_DOT3) nd_set_type(node, NODE_FLIP3); - node->nd_cnt = local_append(internal_id()); - if (!e_option_supplied()) { - int b = literal_node(node->nd_beg); - int e = literal_node(node->nd_end); - if ((b == 1 && e == 1) || (b + e >= 2 && RTEST(ruby_verbose))) { - parser_warn(node, "range literal in condition"); - } - } - break; + if (!top) break; + RNODE_DOT2(node)->nd_beg = range_op(p, RNODE_DOT2(node)->nd_beg, loc); + RNODE_DOT2(node)->nd_end = range_op(p, RNODE_DOT2(node)->nd_end, loc); + switch (nd_type(node)) { + case NODE_DOT2: + nd_set_type(node,NODE_FLIP2); + rb_node_flip2_t *flip2 = RNODE_FLIP2(node); /* for debug info */ + (void)flip2; + break; + case NODE_DOT3: + nd_set_type(node, NODE_FLIP3); + rb_node_flip3_t *flip3 = RNODE_FLIP3(node); /* for debug info */ + (void)flip3; + break; + } + break; + case NODE_SYM: case NODE_DSYM: - parser_warning(node, "literal in condition"); - break; - - case NODE_LIT: - if (TYPE(node->nd_lit) == T_REGEXP) { - warn_unless_e_option(node, "regex literal in condition"); - nd_set_type(node, NODE_MATCH); - local_cnt('_'); - local_cnt('~'); - } - else { - parser_warning(node, "literal in condition"); - } + SWITCH_BY_COND_TYPE(type, warning, "symbol "); + break; + + case NODE_LINE: + case NODE_ENCODING: + case NODE_INTEGER: + case NODE_FLOAT: + case NODE_RATIONAL: + case NODE_IMAGINARY: + SWITCH_BY_COND_TYPE(type, warning, ""); + break; + default: - break; + break; } return node; } static NODE* -cond(node) - NODE *node; +cond(struct parser_params *p, NODE *node, const YYLTYPE *loc) { if (node == 0) return 0; - value_expr(node); - return cond0(node); + return cond0(p, node, COND_IN_COND, loc, true); } static NODE* -logop(type, left, right) - enum node_type type; - NODE *left, *right; +method_cond(struct parser_params *p, NODE *node, const YYLTYPE *loc) { - value_expr(left); - if (left && nd_type(left) == type) { - NODE *node = left, *second; - while ((second = node->nd_2nd) != 0 && nd_type(second) == type) { - node = second; - } - node->nd_2nd = NEW_NODE(type, second, right, 0); - return left; - } - return NEW_NODE(type, left, right, 0); + if (node == 0) return 0; + return cond0(p, node, COND_IN_OP, loc, true); } -static int -cond_negative(nodep) - NODE **nodep; +static NODE* +new_nil_at(struct parser_params *p, const rb_code_position_t *pos) { - NODE *c = *nodep; + YYLTYPE loc = {*pos, *pos}; + return NEW_NIL(&loc); +} + +static NODE* +new_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) +{ + if (!cc) return right; + cc = cond0(p, cc, COND_IN_COND, loc, true); + return newline_node(NEW_IF(cc, left, right, loc, if_keyword_loc, then_keyword_loc, end_keyword_loc)); +} + +static NODE* +new_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) +{ + if (!cc) return right; + cc = cond0(p, cc, COND_IN_COND, loc, true); + return newline_node(NEW_UNLESS(cc, left, right, loc, keyword_loc, then_keyword_loc, end_keyword_loc)); +} + +#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)) - if (!c) return 0; - switch (nd_type(c)) { - case NODE_NOT: - *nodep = c->nd_body; - return 1; +static NODE* +logop(struct parser_params *p, ID id, NODE *left, NODE *right, + const YYLTYPE *op_loc, const YYLTYPE *loc) +{ + enum node_type type = id == idAND || id == idANDOP ? NODE_AND : NODE_OR; + NODE *op; + value_expr(p, left); + if (left && nd_type_p(left, type)) { + NODE *node = left, *second; + while ((second = RNODE_AND(node)->nd_2nd) != 0 && nd_type_p(second, type)) { + node = second; + } + RNODE_AND(node)->nd_2nd = NEW_AND_OR(type, second, right, loc, op_loc); + nd_set_line(RNODE_AND(node)->nd_2nd, op_loc->beg_pos.lineno); + left->nd_loc.end_pos = loc->end_pos; + return left; } - return 0; + op = NEW_AND_OR(type, left, right, loc, op_loc); + nd_set_line(op, op_loc->beg_pos.lineno); + return op; } +#undef NEW_AND_OR + static void -no_blockarg(node) - NODE *node; +no_blockarg(struct parser_params *p, NODE *node) { - if (node && nd_type(node) == NODE_BLOCK_PASS) { - rb_compile_error("block argument should not be given"); + if (nd_type_p(node, NODE_BLOCK_PASS)) { + compile_error(p, "block argument should not be given"); } } static NODE * -ret_args(node) - NODE *node; +ret_args(struct parser_params *p, NODE *node) { if (node) { - no_blockarg(node); - if (nd_type(node) == NODE_ARRAY && node->nd_next == 0) { - node = node->nd_head; - } - else if (node && nd_type(node) == NODE_SPLAT) { - node = NEW_SVALUE(node); - } + no_blockarg(p, node); + if (nd_type_p(node, NODE_LIST) && !RNODE_LIST(node)->nd_next) { + node = RNODE_LIST(node)->nd_head; + } + } + return node; +} + +static NODE* +negate_lit(struct parser_params *p, NODE* node) +{ + switch (nd_type(node)) { + case NODE_INTEGER: + RNODE_INTEGER(node)->minus = TRUE; + break; + case NODE_FLOAT: + RNODE_FLOAT(node)->minus = TRUE; + break; + case NODE_RATIONAL: + RNODE_RATIONAL(node)->minus = TRUE; + break; + case NODE_IMAGINARY: + RNODE_IMAGINARY(node)->minus = TRUE; + break; } return node; } static NODE * -new_yield(node) - NODE *node; +arg_blk_pass(NODE *node1, rb_node_block_pass_t *node2) { - long state = Qtrue; + if (node2) { + if (!node1) return (NODE *)node2; + node2->nd_head = node1; + nd_set_first_lineno(node2, nd_first_lineno(node1)); + nd_set_first_column(node2, nd_first_column(node1)); + return (NODE *)node2; + } + return node1; +} - if (node) { - no_blockarg(node); - if (nd_type(node) == NODE_ARRAY && node->nd_next == 0) { - node = node->nd_head; - state = Qfalse; +static bool +args_info_empty_p(struct rb_args_info *args) +{ + if (args->pre_args_num) return false; + if (args->post_args_num) return false; + if (args->rest_arg) return false; + if (args->opt_args) return false; + if (args->block_arg) return false; + if (args->kw_args) return false; + if (args->kw_rest_arg) return false; + return true; +} + +static rb_node_args_t * +new_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) +{ + struct rb_args_info *args = &tail->nd_ainfo; + + if (args->forwarding) { + if (rest_arg) { + yyerror1(&RNODE(tail)->nd_loc, "... after rest argument"); + return tail; } - else if (node && nd_type(node) == NODE_SPLAT) { - state = Qtrue; + rest_arg = idFWD_REST; + } + + args->pre_args_num = pre_args ? pre_args->nd_plen : 0; + args->pre_init = pre_args ? pre_args->nd_next : 0; + + args->post_args_num = post_args ? post_args->nd_plen : 0; + args->post_init = post_args ? post_args->nd_next : 0; + args->first_post_arg = post_args ? post_args->nd_pid : 0; + + args->rest_arg = rest_arg; + + args->opt_args = opt_args; + + nd_set_loc(RNODE(tail), loc); + + return tail; +} + +static rb_node_args_t * +new_args_tail(struct parser_params *p, rb_node_kw_arg_t *kw_args, ID kw_rest_arg, ID block, const YYLTYPE *kw_rest_loc) +{ + rb_node_args_t *node = NEW_ARGS(&NULL_LOC); + struct rb_args_info *args = &node->nd_ainfo; + if (p->error_p) return node; + + args->block_arg = block; + args->kw_args = kw_args; + + if (kw_args) { + /* + * def foo(k1: 1, kr1:, k2: 2, **krest, &b) + * variable order: k1, kr1, k2, &b, internal_id, krest + * #=> <reorder> + * variable order: kr1, k1, k2, internal_id, krest, &b + */ + ID kw_bits = internal_id(p), *required_kw_vars, *kw_vars; + struct vtable *vtargs = p->lvtbl->args; + rb_node_kw_arg_t *kwn = kw_args; + + if (block) block = vtargs->tbl[vtargs->pos-1]; + vtable_pop(vtargs, !!block + !!kw_rest_arg); + required_kw_vars = kw_vars = &vtargs->tbl[vtargs->pos]; + while (kwn) { + if (!NODE_REQUIRED_KEYWORD_P(get_nd_value(p, kwn->nd_body))) + --kw_vars; + --required_kw_vars; + kwn = kwn->nd_next; + } + + for (kwn = kw_args; kwn; kwn = kwn->nd_next) { + ID vid = get_nd_vid(p, kwn->nd_body); + if (NODE_REQUIRED_KEYWORD_P(get_nd_value(p, kwn->nd_body))) { + *required_kw_vars++ = vid; + } + else { + *kw_vars++ = vid; + } } + + arg_var(p, kw_bits); + if (kw_rest_arg) arg_var(p, kw_rest_arg); + if (block) arg_var(p, block); + + args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc); } - else { - state = Qfalse; + else if (kw_rest_arg == idNil) { + args->no_kwarg = 1; } - return NEW_YIELD(node, state); + else if (kw_rest_arg) { + args->kw_rest_arg = NEW_DVAR(kw_rest_arg, kw_rest_loc); + } + + return node; +} + +static rb_node_args_t * +args_with_numbered(struct parser_params *p, rb_node_args_t *args, int max_numparam, ID it_id) +{ + if (max_numparam > NO_PARAM || it_id) { + if (!args) { + YYLTYPE loc = RUBY_INIT_YYLLOC(); + args = new_args_tail(p, 0, 0, 0, 0); + nd_set_loc(RNODE(args), &loc); + } + args->nd_ainfo.pre_args_num = it_id ? 1 : max_numparam; + } + return args; } static NODE* -negate_lit(node) - NODE *node; +new_array_pattern(struct parser_params *p, NODE *constant, NODE *pre_arg, NODE *aryptn, const YYLTYPE *loc) { - switch (TYPE(node->nd_lit)) { - case T_FIXNUM: - node->nd_lit = LONG2FIX(-FIX2LONG(node->nd_lit)); - break; - case T_BIGNUM: - node->nd_lit = rb_funcall(node->nd_lit,tUMINUS,0,0); - break; - case T_FLOAT: - RFLOAT(node->nd_lit)->value = -RFLOAT(node->nd_lit)->value; - break; - default: - break; + RNODE_ARYPTN(aryptn)->nd_pconst = constant; + + if (pre_arg) { + NODE *pre_args = NEW_LIST(pre_arg, loc); + if (RNODE_ARYPTN(aryptn)->pre_args) { + RNODE_ARYPTN(aryptn)->pre_args = list_concat(pre_args, RNODE_ARYPTN(aryptn)->pre_args); + } + else { + RNODE_ARYPTN(aryptn)->pre_args = pre_args; + } } + return aryptn; +} + +static NODE* +new_array_pattern_tail(struct parser_params *p, NODE *pre_args, int has_rest, NODE *rest_arg, NODE *post_args, const YYLTYPE *loc) +{ + if (has_rest) { + rest_arg = rest_arg ? rest_arg : NODE_SPECIAL_NO_NAME_REST; + } + else { + rest_arg = NULL; + } + NODE *node = NEW_ARYPTN(pre_args, rest_arg, post_args, loc); + return node; } -static NODE * -arg_blk_pass(node1, node2) - NODE *node1; - NODE *node2; +static NODE* +new_find_pattern(struct parser_params *p, NODE *constant, NODE *fndptn, const YYLTYPE *loc) { - if (node2) { - node2->nd_head = node1; - return node2; + RNODE_FNDPTN(fndptn)->nd_pconst = constant; + + return fndptn; +} + +static NODE* +new_find_pattern_tail(struct parser_params *p, NODE *pre_rest_arg, NODE *args, NODE *post_rest_arg, const YYLTYPE *loc) +{ + pre_rest_arg = pre_rest_arg ? pre_rest_arg : NODE_SPECIAL_NO_NAME_REST; + post_rest_arg = post_rest_arg ? post_rest_arg : NODE_SPECIAL_NO_NAME_REST; + NODE *node = NEW_FNDPTN(pre_rest_arg, args, post_rest_arg, loc); + + return node; +} + +static NODE* +new_hash_pattern(struct parser_params *p, NODE *constant, NODE *hshptn, const YYLTYPE *loc) +{ + RNODE_HSHPTN(hshptn)->nd_pconst = constant; + return hshptn; +} + +static NODE* +new_hash_pattern_tail(struct parser_params *p, NODE *kw_args, ID kw_rest_arg, const YYLTYPE *loc) +{ + NODE *node, *kw_rest_arg_node; + + if (kw_rest_arg == idNil) { + kw_rest_arg_node = NODE_SPECIAL_NO_REST_KEYWORD; } - return node1; + else if (kw_rest_arg) { + kw_rest_arg_node = assignable(p, kw_rest_arg, 0, loc); + } + else { + kw_rest_arg_node = NULL; + } + + node = NEW_HSHPTN(0, kw_args, kw_rest_arg_node, loc); + + return node; } static NODE* -arg_prepend(node1, node2) - NODE *node1, *node2; +dsym_node(struct parser_params *p, NODE *node, const YYLTYPE *loc) { - switch (nd_type(node2)) { - case NODE_ARRAY: - return list_concat(NEW_LIST(node1), node2); + if (!node) { + return NEW_SYM(STR_NEW0(), loc); + } - case NODE_SPLAT: - return arg_concat(node1, node2->nd_head); + switch (nd_type(node)) { + case NODE_DSTR: + nd_set_type(node, NODE_DSYM); + nd_set_loc(node, loc); + break; + case NODE_STR: + node = str_to_sym_node(p, node, loc); + break; + default: + node = NEW_DSYM(0, 1, NEW_LIST(node, loc), loc); + break; + } + return node; +} - case NODE_BLOCK_PASS: - node2->nd_body = arg_prepend(node1, node2->nd_body); - return node2; +static int +nd_type_st_key_enable_p(NODE *node) +{ + switch (nd_type(node)) { + case NODE_INTEGER: + case NODE_FLOAT: + case NODE_RATIONAL: + case NODE_IMAGINARY: + case NODE_STR: + case NODE_SYM: + case NODE_REGX: + case NODE_LINE: + case NODE_FILE: + case NODE_ENCODING: + return true; + default: + return false; + } +} +static VALUE +nd_value(struct parser_params *p, NODE *node) +{ + switch (nd_type(node)) { + case NODE_STR: + return rb_node_str_string_val(node); + case NODE_INTEGER: + return rb_node_integer_literal_val(node); + case NODE_FLOAT: + return rb_node_float_literal_val(node); + case NODE_RATIONAL: + return rb_node_rational_literal_val(node); + case NODE_IMAGINARY: + return rb_node_imaginary_literal_val(node); + case NODE_SYM: + return rb_node_sym_string_val(node); + case NODE_REGX: + return rb_node_regx_string_val(node); + case NODE_LINE: + return rb_node_line_lineno_val(node); + case NODE_ENCODING: + return rb_node_encoding_val(node); + case NODE_FILE: + return rb_node_file_path_val(node); default: - rb_bug("unknown nodetype(%d) for arg_prepend", nd_type(node2)); + rb_bug("unexpected node: %s", ruby_node_name(nd_type(node))); + UNREACHABLE_RETURN(0); } - return 0; /* not reached */ } -static NODE* -new_call(r,m,a) - NODE *r; - ID m; - NODE *a; +static void +warn_duplicate_keys(struct parser_params *p, NODE *hash) { - if (a && nd_type(a) == NODE_BLOCK_PASS) { - a->nd_iter = NEW_CALL(r,m,a->nd_head); - return a; + /* See https://bugs.ruby-lang.org/issues/20331 for discussion about what is warned. */ + p->warn_duplicate_keys_table = st_init_table_with_size(&literal_type, RNODE_LIST(hash)->as.nd_alen / 2); + while (hash && RNODE_LIST(hash)->nd_next) { + NODE *head = RNODE_LIST(hash)->nd_head; + NODE *value = RNODE_LIST(hash)->nd_next; + NODE *next = RNODE_LIST(value)->nd_next; + st_data_t key; + st_data_t data; + + /* keyword splat, e.g. {k: 1, **z, k: 2} */ + if (!head) { + head = value; + } + + if (nd_type_st_key_enable_p(head)) { + key = (st_data_t)head; + + if (st_delete(p->warn_duplicate_keys_table, &key, &data)) { + rb_warn2L(nd_line((NODE *)data), + "key %+"PRIsWARN" is duplicated and overwritten on line %d", + nd_value(p, head), WARN_I(nd_line(head))); + } + st_insert(p->warn_duplicate_keys_table, (st_data_t)key, (st_data_t)hash); + } + hash = next; } - return NEW_CALL(r,m,a); + st_free_table(p->warn_duplicate_keys_table); + p->warn_duplicate_keys_table = NULL; } -static NODE* -new_fcall(m,a) - ID m; - NODE *a; +static NODE * +new_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc) +{ + if (hash) warn_duplicate_keys(p, hash); + return NEW_HASH(hash, loc); +} + +static void +error_duplicate_pattern_variable(struct parser_params *p, ID id, const YYLTYPE *loc) +{ + if (is_private_local_id(p, id)) { + return; + } + if (st_is_member(p->pvtbl, id)) { + yyerror1(loc, "duplicated variable name"); + } + else if (p->ctxt.in_alt_pattern && id) { + yyerror1(loc, "variable capture in alternative pattern"); + } + else { + p->ctxt.capture_in_pattern = 1; + st_insert(p->pvtbl, (st_data_t)id, 0); + } +} + +static void +error_duplicate_pattern_key(struct parser_params *p, VALUE key, const YYLTYPE *loc) { - if (a && nd_type(a) == NODE_BLOCK_PASS) { - a->nd_iter = NEW_FCALL(m,a->nd_head); - return a; + if (!p->pktbl) { + p->pktbl = st_init_numtable(); } - return NEW_FCALL(m,a); + else if (st_is_member(p->pktbl, key)) { + yyerror1(loc, "duplicated key name"); + return; + } + st_insert(p->pktbl, (st_data_t)key, 0); } -static NODE* -new_super(a) - NODE *a; +static NODE * +new_unique_key_hash(struct parser_params *p, NODE *hash, const YYLTYPE *loc) +{ + return NEW_HASH(hash, loc); +} + +static NODE * +new_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc) { - if (a && nd_type(a) == NODE_BLOCK_PASS) { - a->nd_iter = NEW_SUPER(a->nd_head); - return a; + NODE *asgn; + + if (lhs) { + ID vid = get_nd_vid(p, lhs); + YYLTYPE lhs_loc = lhs->nd_loc; + if (op == tOROP) { + set_nd_value(p, lhs, rhs); + nd_set_loc(lhs, loc); + asgn = NEW_OP_ASGN_OR(gettable(p, vid, &lhs_loc), lhs, loc); + } + else if (op == tANDOP) { + set_nd_value(p, lhs, rhs); + nd_set_loc(lhs, loc); + asgn = NEW_OP_ASGN_AND(gettable(p, vid, &lhs_loc), lhs, loc); + } + else { + asgn = lhs; + rhs = NEW_CALL(gettable(p, vid, &lhs_loc), op, NEW_LIST(rhs, &rhs->nd_loc), loc); + set_nd_value(p, asgn, rhs); + nd_set_loc(asgn, loc); + } } - return NEW_SUPER(a); + else { + asgn = NEW_ERROR(loc); + } + return asgn; } -static struct local_vars { - ID *tbl; - int nofree; +static NODE * +new_ary_op_assign(struct parser_params *p, NODE *ary, + NODE *args, ID op, NODE *rhs, const YYLTYPE *args_loc, const YYLTYPE *loc, + const YYLTYPE *call_operator_loc, const YYLTYPE *opening_loc, const YYLTYPE *closing_loc, const YYLTYPE *binary_operator_loc) +{ + NODE *asgn; + + aryset_check(p, args); + args = make_list(args, args_loc); + asgn = NEW_OP_ASGN1(ary, op, args, rhs, loc, call_operator_loc, opening_loc, closing_loc, binary_operator_loc); + fixpos(asgn, ary); + return asgn; +} + +static 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) +{ + NODE *asgn; + + asgn = NEW_OP_ASGN2(lhs, CALL_Q_P(atype), attr, op, rhs, loc, call_operator_loc, message_loc, binary_operator_loc); + fixpos(asgn, lhs); + return asgn; +} + +static NODE * +new_const_op_assign(struct parser_params *p, NODE *lhs, ID op, NODE *rhs, struct lex_context ctxt, const YYLTYPE *loc) +{ + NODE *asgn; + + if (lhs) { + asgn = NEW_OP_CDECL(lhs, op, rhs, ctxt.shareable_constant_value, loc); + } + else { + asgn = NEW_ERROR(loc); + } + fixpos(asgn, lhs); + return asgn; +} + +static NODE * +const_decl(struct parser_params *p, NODE *path, const YYLTYPE *loc) +{ + if (p->ctxt.in_def) { +#ifndef RIPPER + yyerror1(loc, "dynamic constant assignment"); +#else + set_value(assign_error(p, "dynamic constant assignment", p->s_lvalue)); +#endif + } + return NEW_CDECL(0, 0, (path), p->ctxt.shareable_constant_value, loc); +} + +#ifdef RIPPER +static VALUE +assign_error(struct parser_params *p, const char *mesg, VALUE a) +{ + a = dispatch2(assign_error, ERR_MESG(), a); + ripper_error(p); + return a; +} +#endif + +static NODE * +new_bodystmt(struct parser_params *p, NODE *head, NODE *rescue, NODE *rescue_else, NODE *ensure, const YYLTYPE *loc) +{ + NODE *result = head; + if (rescue) { + NODE *tmp = rescue_else ? rescue_else : rescue; + YYLTYPE rescue_loc = code_loc_gen(&head->nd_loc, &tmp->nd_loc); + + result = NEW_RESCUE(head, rescue, rescue_else, &rescue_loc); + nd_set_line(result, rescue->nd_loc.beg_pos.lineno); + } + if (ensure) { + result = NEW_ENSURE(result, ensure, loc); + } + fixpos(result, head); + return result; +} + +static void +warn_unused_var(struct parser_params *p, struct local_vars *local) +{ int cnt; - int dlev; - struct RVarmap* dyna_vars; - struct local_vars *prev; -} *lvtbl; + + if (!local->used) return; + cnt = local->used->pos; + if (cnt != local->vars->pos) { + rb_parser_fatal(p, "local->used->pos != local->vars->pos"); + } +#ifndef RIPPER + ID *v = local->vars->tbl; + ID *u = local->used->tbl; + for (int i = 0; i < cnt; ++i) { + if (!v[i] || (u[i] & LVAR_USED)) continue; + if (is_private_local_id(p, v[i])) continue; + rb_warn1L((int)u[i], "assigned but unused variable - %"PRIsWARN, rb_id2str(v[i])); + } +#endif +} static void -local_push(top) - int top; +local_push(struct parser_params *p, int toplevel_scope) { struct local_vars *local; + int inherits_dvars = toplevel_scope && compile_for_eval; + int warn_unused_vars = RTEST(ruby_verbose); local = ALLOC(struct local_vars); - local->prev = lvtbl; - local->nofree = 0; - local->cnt = 0; - local->tbl = 0; - local->dlev = 0; - local->dyna_vars = ruby_dyna_vars; - lvtbl = local; - if (!top) { - /* preserve reference for GC, but link should be cut. */ - rb_dvar_push(0, (VALUE)ruby_dyna_vars); - ruby_dyna_vars->next = 0; + local->prev = p->lvtbl; + local->args = vtable_alloc(0); + local->vars = vtable_alloc(inherits_dvars ? DVARS_INHERIT : DVARS_TOPSCOPE); +#ifndef RIPPER + if (toplevel_scope && compile_for_eval) warn_unused_vars = 0; + if (toplevel_scope && e_option_supplied(p)) warn_unused_vars = 0; +#endif + local->numparam.outer = 0; + local->numparam.inner = 0; + local->numparam.current = 0; + local->it = 0; + local->used = warn_unused_vars ? vtable_alloc(0) : 0; + +# if WARN_PAST_SCOPE + local->past = 0; +# endif + CMDARG_PUSH(0); + COND_PUSH(0); + p->lvtbl = local; +} + +static void +vtable_chain_free(struct parser_params *p, struct vtable *table) +{ + while (!DVARS_TERMINAL_P(table)) { + struct vtable *cur_table = table; + table = cur_table->prev; + vtable_free(cur_table); + } +} + +static void +local_free(struct parser_params *p, struct local_vars *local) +{ + vtable_chain_free(p, local->used); + +# if WARN_PAST_SCOPE + vtable_chain_free(p, local->past); +# endif + + vtable_chain_free(p, local->args); + vtable_chain_free(p, local->vars); + + ruby_sized_xfree(local, sizeof(struct local_vars)); +} + +static void +local_pop(struct parser_params *p) +{ + struct local_vars *local = p->lvtbl->prev; + if (p->lvtbl->used) { + warn_unused_var(p, p->lvtbl); } + + local_free(p, p->lvtbl); + p->lvtbl = local; + + CMDARG_POP(); + COND_POP(); +} + +static rb_ast_id_table_t * +local_tbl(struct parser_params *p) +{ + int cnt_args = vtable_size(p->lvtbl->args); + int cnt_vars = vtable_size(p->lvtbl->vars); + int cnt = cnt_args + cnt_vars; + int i, j; + rb_ast_id_table_t *tbl; + + if (cnt <= 0) return 0; + tbl = rb_ast_new_local_table(p->ast, cnt); + MEMCPY(tbl->ids, p->lvtbl->args->tbl, ID, cnt_args); + /* remove IDs duplicated to warn shadowing */ + for (i = 0, j = cnt_args; i < cnt_vars; ++i) { + ID id = p->lvtbl->vars->tbl[i]; + if (!vtable_included(p->lvtbl->args, id)) { + tbl->ids[j++] = id; + } + } + if (j < cnt) { + tbl = rb_ast_resize_latest_local_table(p->ast, j); + } + + return tbl; +} + +static void +numparam_name(struct parser_params *p, ID id) +{ + if (!NUMPARAM_ID_P(id)) return; + compile_error(p, "_%d is reserved for numbered parameter", + NUMPARAM_ID_TO_IDX(id)); } static void -local_pop() +arg_var(struct parser_params *p, ID id) { - struct local_vars *local = lvtbl->prev; + numparam_name(p, id); + vtable_add(p->lvtbl->args, id); +} - if (lvtbl->tbl) { - if (!lvtbl->nofree) free(lvtbl->tbl); - else lvtbl->tbl[0] = lvtbl->cnt; +static void +local_var(struct parser_params *p, ID id) +{ + numparam_name(p, id); + vtable_add(p->lvtbl->vars, id); + if (p->lvtbl->used) { + vtable_add(p->lvtbl->used, (ID)p->ruby_sourceline); } - ruby_dyna_vars = lvtbl->dyna_vars; - free(lvtbl); - lvtbl = local; } -static ID* -local_tbl() +#ifndef RIPPER +int +rb_parser_local_defined(struct parser_params *p, ID id, const struct rb_iseq_struct *iseq) { - lvtbl->nofree = 1; - return lvtbl->tbl; + return rb_local_defined(id, iseq); } +#endif static int -local_append(id) - ID id; +local_id_ref(struct parser_params *p, ID id, ID **vidrefp) { - if (lvtbl->tbl == 0) { - lvtbl->tbl = ALLOC_N(ID, 4); - lvtbl->tbl[0] = 0; - lvtbl->tbl[1] = '_'; - lvtbl->tbl[2] = '~'; - lvtbl->cnt = 2; - if (id == '_') return 0; - if (id == '~') return 1; + struct vtable *vars, *args, *used; + + vars = p->lvtbl->vars; + args = p->lvtbl->args; + used = p->lvtbl->used; + + while (vars && !DVARS_TERMINAL_P(vars->prev)) { + vars = vars->prev; + args = args->prev; + if (used) used = used->prev; + } + + if (vars && vars->prev == DVARS_INHERIT) { + return rb_parser_local_defined(p, id, p->parent_iseq); + } + else if (vtable_included(args, id)) { + return 1; } else { - REALLOC_N(lvtbl->tbl, ID, lvtbl->cnt+2); + int i = vtable_included(vars, id); + if (i && used && vidrefp) *vidrefp = &used->tbl[i-1]; + return i != 0; } +} - lvtbl->tbl[lvtbl->cnt+1] = id; - return lvtbl->cnt++; +static int +local_id(struct parser_params *p, ID id) +{ + return local_id_ref(p, id, NULL); } static int -local_cnt(id) - ID id; +check_forwarding_args(struct parser_params *p) +{ + if (local_id(p, idFWD_ALL)) return TRUE; + compile_error(p, "unexpected ..."); + return FALSE; +} + +static void +add_forwarding_args(struct parser_params *p) { - int cnt, max; + arg_var(p, idFWD_REST); + arg_var(p, idFWD_KWREST); + arg_var(p, idFWD_BLOCK); + arg_var(p, idFWD_ALL); +} - if (id == 0) return lvtbl->cnt; +static void +forwarding_arg_check(struct parser_params *p, ID arg, ID all, const char *var) +{ + bool conflict = false; + + struct vtable *vars, *args; + + vars = p->lvtbl->vars; + args = p->lvtbl->args; + + while (vars && !DVARS_TERMINAL_P(vars->prev)) { + conflict |= (vtable_included(args, arg) && !(all && vtable_included(args, all))); + vars = vars->prev; + args = args->prev; + } + + bool found = false; + if (vars && vars->prev == DVARS_INHERIT && !found) { + found = (rb_parser_local_defined(p, arg, p->parent_iseq) && + !(all && rb_parser_local_defined(p, all, p->parent_iseq))); + } + else { + found = (vtable_included(args, arg) && + !(all && vtable_included(args, all))); + } - for (cnt=1, max=lvtbl->cnt+1; cnt<max;cnt++) { - if (lvtbl->tbl[cnt] == id) return cnt-1; + if (!found) { + compile_error(p, "no anonymous %s parameter", var); + } + else if (conflict) { + compile_error(p, "anonymous %s parameter is also used within block", var); } - return local_append(id); } -static int -local_id(id) - ID id; +static NODE * +new_args_forward_call(struct parser_params *p, NODE *leading, const YYLTYPE *loc, const YYLTYPE *argsloc) { - int i, max; + NODE *rest = NEW_LVAR(idFWD_REST, loc); + NODE *kwrest = list_append(p, NEW_LIST(0, loc), NEW_LVAR(idFWD_KWREST, loc)); + rb_node_block_pass_t *block = NEW_BLOCK_PASS(NEW_LVAR(idFWD_BLOCK, loc), argsloc, &NULL_LOC); + NODE *args = leading ? rest_arg_append(p, leading, rest, argsloc) : NEW_SPLAT(rest, loc, &NULL_LOC); + block->forwarding = TRUE; + args = arg_append(p, args, new_hash(p, kwrest, loc), argsloc); + return arg_blk_pass(args, block); +} - if (lvtbl == 0) return Qfalse; - for (i=3, max=lvtbl->cnt+1; i<max; i++) { - if (lvtbl->tbl[i] == id) return Qtrue; +static NODE * +numparam_push(struct parser_params *p) +{ + struct local_vars *local = p->lvtbl; + NODE *inner = local->numparam.inner; + if (!local->numparam.outer) { + local->numparam.outer = local->numparam.current; } - return Qfalse; + local->numparam.inner = 0; + local->numparam.current = 0; + local->it = 0; + return inner; } static void -top_local_init() +numparam_pop(struct parser_params *p, NODE *prev_inner) { - local_push(1); - lvtbl->cnt = ruby_scope->local_tbl?ruby_scope->local_tbl[0]:0; - if (lvtbl->cnt > 0) { - lvtbl->tbl = ALLOC_N(ID, lvtbl->cnt+3); - MEMCPY(lvtbl->tbl, ruby_scope->local_tbl, ID, lvtbl->cnt+1); + struct local_vars *local = p->lvtbl; + if (prev_inner) { + /* prefer first one */ + local->numparam.inner = prev_inner; + } + else if (local->numparam.current) { + /* current and inner are exclusive */ + local->numparam.inner = local->numparam.current; + } + if (p->max_numparam > NO_PARAM) { + /* current and outer are exclusive */ + local->numparam.current = local->numparam.outer; + local->numparam.outer = 0; } else { - lvtbl->tbl = 0; + /* no numbered parameter */ + local->numparam.current = 0; + } + local->it = 0; +} + +static const struct vtable * +dyna_push(struct parser_params *p) +{ + p->lvtbl->args = vtable_alloc(p->lvtbl->args); + p->lvtbl->vars = vtable_alloc(p->lvtbl->vars); + if (p->lvtbl->used) { + p->lvtbl->used = vtable_alloc(p->lvtbl->used); } - if (ruby_dyna_vars) - lvtbl->dlev = 1; - else - lvtbl->dlev = 0; + return p->lvtbl->args; } static void -top_local_setup() +dyna_pop_vtable(struct parser_params *p, struct vtable **vtblp) { - int len = lvtbl->cnt; + struct vtable *tmp = *vtblp; + *vtblp = tmp->prev; +# if WARN_PAST_SCOPE + if (p->past_scope_enabled) { + tmp->prev = p->lvtbl->past; + p->lvtbl->past = tmp; + return; + } +# endif + vtable_free(tmp); +} + +static void +dyna_pop_1(struct parser_params *p) +{ + struct vtable *tmp; + + if ((tmp = p->lvtbl->used) != 0) { + warn_unused_var(p, p->lvtbl); + p->lvtbl->used = p->lvtbl->used->prev; + vtable_free(tmp); + } + dyna_pop_vtable(p, &p->lvtbl->args); + dyna_pop_vtable(p, &p->lvtbl->vars); +} + +static void +dyna_pop(struct parser_params *p, const struct vtable *lvargs) +{ + while (p->lvtbl->args != lvargs) { + dyna_pop_1(p); + if (!p->lvtbl->args) { + struct local_vars *local = p->lvtbl->prev; + ruby_sized_xfree(p->lvtbl, sizeof(*p->lvtbl)); + p->lvtbl = local; + } + } + dyna_pop_1(p); +} + +static int +dyna_in_block(struct parser_params *p) +{ + return !DVARS_TERMINAL_P(p->lvtbl->vars) && p->lvtbl->vars->prev != DVARS_TOPSCOPE; +} + +#ifndef RIPPER +int +dvar_defined_ref(struct parser_params *p, ID id, ID **vidrefp) +{ + struct vtable *vars, *args, *used; int i; - if (len > 0) { - i = ruby_scope->local_tbl?ruby_scope->local_tbl[0]:0; - - if (i < len) { - if (i == 0 || (ruby_scope->flags & SCOPE_MALLOC) == 0) { - VALUE *vars = ALLOC_N(VALUE, len+1); - if (ruby_scope->local_vars) { - *vars++ = ruby_scope->local_vars[-1]; - MEMCPY(vars, ruby_scope->local_vars, VALUE, i); - rb_mem_clear(vars+i, len-i); - } - else { - *vars++ = 0; - rb_mem_clear(vars, len); - } - ruby_scope->local_vars = vars; - ruby_scope->flags |= SCOPE_MALLOC; - } - else { - VALUE *vars = ruby_scope->local_vars-1; - REALLOC_N(vars, VALUE, len+1); - ruby_scope->local_vars = vars+1; - rb_mem_clear(ruby_scope->local_vars+i, len-i); - } - if (ruby_scope->local_tbl && ruby_scope->local_vars[-1] == 0) { - free(ruby_scope->local_tbl); - } - ruby_scope->local_vars[-1] = 0; - ruby_scope->local_tbl = local_tbl(); - } - } - local_pop(); -} - -static struct RVarmap* -dyna_push() -{ - struct RVarmap* vars = ruby_dyna_vars; - - rb_dvar_push(0, 0); - lvtbl->dlev++; - return vars; + args = p->lvtbl->args; + vars = p->lvtbl->vars; + used = p->lvtbl->used; + + while (!DVARS_TERMINAL_P(vars)) { + if (vtable_included(args, id)) { + return 1; + } + if ((i = vtable_included(vars, id)) != 0) { + if (used && vidrefp) *vidrefp = &used->tbl[i-1]; + return 1; + } + args = args->prev; + vars = vars->prev; + if (!vidrefp) used = 0; + if (used) used = used->prev; + } + + if (vars == DVARS_INHERIT && !NUMPARAM_ID_P(id)) { + return rb_dvar_defined(id, p->parent_iseq); + } + + return 0; +} +#endif + +static int +dvar_defined(struct parser_params *p, ID id) +{ + return dvar_defined_ref(p, id, NULL); +} + +static int +dvar_curr(struct parser_params *p, ID id) +{ + return (vtable_included(p->lvtbl->args, id) || + vtable_included(p->lvtbl->vars, id)); } static void -dyna_pop(vars) - struct RVarmap* vars; +reg_fragment_enc_error(struct parser_params* p, rb_parser_string_t *str, int c) { - lvtbl->dlev--; - ruby_dyna_vars = vars; + compile_error(p, + "regexp encoding option '%c' differs from source encoding '%s'", + c, rb_enc_name(rb_parser_str_get_encoding(str))); } +#ifndef RIPPER +static rb_encoding * +find_enc(struct parser_params* p, const char *name) +{ + int idx = rb_enc_find_index(name); + if (idx < 0) { + rb_bug("unknown encoding name: %s", name); + } + + return rb_enc_from_index(idx); +} + +static rb_encoding * +kcode_to_enc(struct parser_params* p, int kcode) +{ + rb_encoding *enc; + + switch (kcode) { + case ENC_ASCII8BIT: + enc = rb_ascii8bit_encoding(); + break; + case ENC_EUC_JP: + enc = find_enc(p, "EUC-JP"); + break; + case ENC_Windows_31J: + enc = find_enc(p, "Windows-31J"); + break; + case ENC_UTF8: + enc = rb_utf8_encoding(); + break; + default: + enc = NULL; + break; + } + + return enc; +} + +int +rb_reg_fragment_setenc(struct parser_params* p, rb_parser_string_t *str, int options) +{ + int c = RE_OPTION_ENCODING_IDX(options); + + if (c) { + int opt, idx; + rb_encoding *enc; + + char_to_option_kcode(c, &opt, &idx); + enc = kcode_to_enc(p, idx); + if (enc != rb_parser_str_get_encoding(str) && + !rb_parser_is_ascii_string(p, str)) { + goto error; + } + rb_parser_string_set_encoding(str, enc); + } + else if (RE_OPTION_ENCODING_NONE(options)) { + if (!PARSER_ENCODING_IS_ASCII8BIT(p, str) && + !rb_parser_is_ascii_string(p, str)) { + c = 'n'; + goto error; + } + rb_parser_enc_associate(p, str, rb_ascii8bit_encoding()); + } + else if (rb_is_usascii_enc(p->enc)) { + rb_parser_enc_associate(p, str, rb_ascii8bit_encoding()); + } + return 0; + + error: + return c; +} +#endif + +static void +reg_fragment_setenc(struct parser_params* p, rb_parser_string_t *str, int options) +{ + int c = rb_reg_fragment_setenc(p, str, options); + if (c) reg_fragment_enc_error(p, str, c); +} + +#ifndef UNIVERSAL_PARSER +typedef struct { + struct parser_params* parser; + rb_encoding *enc; + NODE *succ_block; + const YYLTYPE *loc; + rb_parser_assignable_func assignable; +} reg_named_capture_assign_t; + static int -dyna_in_block() +reg_named_capture_assign_iter(const OnigUChar *name, const OnigUChar *name_end, + int back_num, int *back_refs, OnigRegex regex, void *arg0) { - return (lvtbl->dlev > 0); + reg_named_capture_assign_t *arg = (reg_named_capture_assign_t*)arg0; + struct parser_params* p = arg->parser; + rb_encoding *enc = arg->enc; + long len = name_end - name; + const char *s = (const char *)name; + + return rb_reg_named_capture_assign_iter_impl(p, s, len, enc, &arg->succ_block, arg->loc, arg->assignable); } static NODE * -dyna_init(node, pre) - NODE *node; - struct RVarmap *pre; +reg_named_capture_assign(struct parser_params* p, VALUE regexp, const YYLTYPE *loc, rb_parser_assignable_func assignable) { - struct RVarmap *post = ruby_dyna_vars; - NODE *var; + reg_named_capture_assign_t arg; - if (!node || !post || pre == post) return node; - for (var = 0; post != pre && post->id; post = post->next) { - var = NEW_DASGN_CURR(post->id, var); - } - return block_append(var, node); + arg.parser = p; + arg.enc = rb_enc_get(regexp); + arg.succ_block = 0; + arg.loc = loc; + arg.assignable = assignable; + onig_foreach_name(RREGEXP_PTR(regexp), reg_named_capture_assign_iter, &arg); + + if (!arg.succ_block) return 0; + return RNODE_BLOCK(arg.succ_block)->nd_next; +} +#endif + +#ifndef RIPPER +NODE * +rb_parser_assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc) +{ + return assignable(p, id, val, loc); } int -ruby_parser_stack_on_heap() +rb_reg_named_capture_assign_iter_impl(struct parser_params *p, const char *s, long len, + rb_encoding *enc, NODE **succ_block, const rb_code_location_t *loc, rb_parser_assignable_func assignable) { -#if defined(YYBISON) && !defined(C_ALLOCA) - return Qfalse; -#else - return Qtrue; + ID var; + NODE *node, *succ; + + if (!len) return ST_CONTINUE; + if (!VALID_SYMNAME_P(s, len, enc, ID_LOCAL)) + return ST_CONTINUE; + + var = intern_cstr(s, len, enc); + if (len < MAX_WORD_LENGTH && rb_reserved_word(s, (int)len)) { + if (!lvar_defined(p, var)) return ST_CONTINUE; + } + node = node_assign(p, assignable(p, var, 0, loc), NEW_SYM(rb_id2str(var), loc), NO_LEX_CTXT, loc); + succ = *succ_block; + if (!succ) succ = NEW_ERROR(loc); + succ = block_append(p, succ, node); + *succ_block = succ; + return ST_CONTINUE; +} #endif + +static VALUE +parser_reg_compile(struct parser_params* p, rb_parser_string_t *str, int options) +{ + VALUE str2; + reg_fragment_setenc(p, str, options); + str2 = rb_str_new_parser_string(str); + return rb_parser_reg_compile(p, str2, options); } -void -rb_gc_mark_parser() +#ifndef RIPPER +VALUE +rb_parser_reg_compile(struct parser_params* p, VALUE str, int options) { - if (!ruby_in_compile) return; + return rb_reg_compile(str, options & RE_OPTION_MASK, p->ruby_sourcefile, p->ruby_sourceline); +} +#endif - rb_gc_mark_maybe((VALUE)yylval.node); - rb_gc_mark(ruby_debug_lines); - rb_gc_mark(lex_lastline); - rb_gc_mark(lex_input); - rb_gc_mark((VALUE)lex_strterm); +static VALUE +reg_compile(struct parser_params* p, rb_parser_string_t *str, int options) +{ + VALUE re; + VALUE err; + + err = rb_errinfo(); + re = parser_reg_compile(p, str, options); + if (NIL_P(re)) { + VALUE m = rb_attr_get(rb_errinfo(), idMesg); + rb_set_errinfo(err); + compile_error(p, "%"PRIsVALUE, m); + return Qnil; + } + return re; } +#ifndef RIPPER void -rb_parser_append_print() +rb_ruby_parser_set_options(struct parser_params *p, int print, int loop, int chomp, int split) { - ruby_eval_tree = - block_append(ruby_eval_tree, - NEW_FCALL(rb_intern("print"), - NEW_ARRAY(NEW_GVAR(rb_intern("$_"))))); + p->do_print = print; + p->do_loop = loop; + p->do_chomp = chomp; + p->do_split = split; } -void -rb_parser_while_loop(chop, split) - int chop, split; -{ - if (split) { - ruby_eval_tree = - block_append(NEW_GASGN(rb_intern("$F"), - NEW_CALL(NEW_GVAR(rb_intern("$_")), - rb_intern("split"), 0)), - ruby_eval_tree); - } - if (chop) { - ruby_eval_tree = - block_append(NEW_CALL(NEW_GVAR(rb_intern("$_")), - rb_intern("chop!"), 0), ruby_eval_tree); - } - ruby_eval_tree = NEW_OPT_N(ruby_eval_tree); -} - -static struct { - ID token; - char *name; -} op_tbl[] = { - {tDOT2, ".."}, - {tDOT3, "..."}, - {'+', "+"}, - {'-', "-"}, - {'+', "+(binary)"}, - {'-', "-(binary)"}, - {'*', "*"}, - {'/', "/"}, - {'%', "%"}, - {tPOW, "**"}, - {tUPLUS, "+@"}, - {tUMINUS, "-@"}, - {tUPLUS, "+(unary)"}, - {tUMINUS, "-(unary)"}, - {'|', "|"}, - {'^', "^"}, - {'&', "&"}, - {tCMP, "<=>"}, - {'>', ">"}, - {tGEQ, ">="}, - {'<', "<"}, - {tLEQ, "<="}, - {tEQ, "=="}, - {tEQQ, "==="}, - {tNEQ, "!="}, - {tMATCH, "=~"}, - {tNMATCH, "!~"}, - {'!', "!"}, - {'~', "~"}, - {'!', "!(unary)"}, - {'~', "~(unary)"}, - {'!', "!@"}, - {'~', "~@"}, - {tAREF, "[]"}, - {tASET, "[]="}, - {tLSHFT, "<<"}, - {tRSHFT, ">>"}, - {tCOLON2, "::"}, - {'`', "`"}, - {0, 0} -}; +static NODE * +parser_append_options(struct parser_params *p, NODE *node) +{ + static const YYLTYPE default_location = {{1, 0}, {1, 0}}; + const YYLTYPE *const LOC = &default_location; + + if (p->do_print) { + NODE *print = (NODE *)NEW_FCALL(rb_intern("print"), + NEW_LIST(NEW_GVAR(idLASTLINE, LOC), LOC), + LOC); + node = block_append(p, node, print); + } -static st_table *sym_tbl; -static st_table *sym_rev_tbl; + if (p->do_loop) { + NODE *irs = NEW_LIST(NEW_GVAR(rb_intern("$/"), LOC), LOC); + + if (p->do_split) { + ID ifs = rb_intern("$;"); + ID fields = rb_intern("$F"); + NODE *args = NEW_LIST(NEW_GVAR(ifs, LOC), LOC); + NODE *split = NEW_GASGN(fields, + NEW_CALL(NEW_GVAR(idLASTLINE, LOC), + rb_intern("split"), args, LOC), + LOC); + node = block_append(p, split, node); + } + if (p->do_chomp) { + NODE *chomp = NEW_SYM(rb_str_new_cstr("chomp"), LOC); + chomp = list_append(p, NEW_LIST(chomp, LOC), NEW_TRUE(LOC)); + irs = list_append(p, irs, NEW_HASH(chomp, LOC)); + } + + node = NEW_WHILE((NODE *)NEW_FCALL(idGets, irs, LOC), node, 1, LOC, &NULL_LOC, &NULL_LOC); + } + + return node; +} void -Init_sym() +rb_init_parse(void) { - sym_tbl = st_init_strtable_with_size(200); - sym_rev_tbl = st_init_numtable_with_size(200); + /* just to suppress unused-function warnings */ + (void)nodetype; + (void)nodeline; } -static ID last_id = tLAST_TOKEN; +ID +internal_id(struct parser_params *p) +{ + return rb_make_temporary_id(vtable_size(p->lvtbl->args) + vtable_size(p->lvtbl->vars)); +} +#endif /* !RIPPER */ -static ID -internal_id() +static void +parser_initialize(struct parser_params *p) { - return ID_INTERNAL | (++last_id << ID_SCOPE_SHIFT); + /* note: we rely on TypedData_Make_Struct to set most fields to 0 */ + p->command_start = TRUE; + p->ruby_sourcefile_string = Qnil; + p->lex.lpar_beg = -1; /* make lambda_beginning_p() == FALSE at first */ + string_buffer_init(p); + p->node_id = 0; + p->delayed.token = NULL; + p->frozen_string_literal = -1; /* not specified */ +#ifndef RIPPER + p->error_buffer = Qfalse; + p->end_expect_token_locations = NULL; + p->token_id = 0; + p->tokens = NULL; +#else + p->result = Qnil; + p->parsing_thread = Qnil; + p->s_value = Qnil; + p->s_lvalue = Qnil; + p->s_value_stack = rb_ary_new(); +#endif + p->debug_buffer = Qnil; + p->debug_output = rb_ractor_stdout(); + p->enc = rb_utf8_encoding(); + p->exits = 0; } -ID -rb_intern(name) - const char *name; +#ifdef RIPPER +#define rb_ruby_parser_mark ripper_parser_mark +#define rb_ruby_parser_free ripper_parser_free +#define rb_ruby_parser_memsize ripper_parser_memsize +#endif + +void +rb_ruby_parser_mark(void *ptr) { - const char *m = name; - ID id; - int last; + struct parser_params *p = (struct parser_params*)ptr; - if (st_lookup(sym_tbl, (st_data_t)name, (st_data_t *)&id)) - return id; + rb_gc_mark(p->ruby_sourcefile_string); +#ifndef RIPPER + rb_gc_mark(p->error_buffer); +#else + rb_gc_mark(p->value); + rb_gc_mark(p->result); + rb_gc_mark(p->parsing_thread); + rb_gc_mark(p->s_value); + rb_gc_mark(p->s_lvalue); + rb_gc_mark(p->s_value_stack); +#endif + rb_gc_mark(p->debug_buffer); + rb_gc_mark(p->debug_output); +} - last = strlen(name)-1; - id = 0; - switch (*name) { - case '$': - id |= ID_GLOBAL; - m++; - if (!is_identchar(*m)) m++; - break; - case '@': - if (name[1] == '@') { - m++; - id |= ID_CLASS; - } - else { - id |= ID_INSTANCE; - } - m++; - break; - default: - if (name[0] != '_' && !ISALPHA(name[0]) && !ismbchar(name[0])) { - /* operators */ - int i; - - for (i=0; op_tbl[i].token; i++) { - if (*op_tbl[i].name == *name && - strcmp(op_tbl[i].name, name) == 0) { - id = op_tbl[i].token; - goto id_regist; - } - } - } - - if (name[last] == '=') { - /* attribute assignment */ - char *buf = ALLOCA_N(char,last+1); - - strncpy(buf, name, last); - buf[last] = '\0'; - id = rb_intern(buf); - if (id > tLAST_TOKEN && !is_attrset_id(id)) { - id = rb_id_attrset(id); - goto id_regist; - } - id = ID_ATTRSET; - } - else if (ISUPPER(name[0])) { - id = ID_CONST; - } - else { - id = ID_LOCAL; - } - break; - } - while (m <= name + last && is_identchar(*m)) { - m += mbclen(*m); - } - if (*m) id = ID_JUNK; - id |= ++last_id << ID_SCOPE_SHIFT; - id_regist: - name = strdup(name); - st_add_direct(sym_tbl, (st_data_t)name, id); - st_add_direct(sym_rev_tbl, id, (st_data_t)name); - return id; -} - -char * -rb_id2name(id) - ID id; +void +rb_ruby_parser_free(void *ptr) { - char *name; + struct parser_params *p = (struct parser_params*)ptr; + struct local_vars *local, *prev; - if (id < tLAST_TOKEN) { - int i = 0; + if (p->ast) { + rb_ast_free(p->ast); + } - for (i=0; op_tbl[i].token; i++) { - if (op_tbl[i].token == id) - return op_tbl[i].name; - } + if (p->warn_duplicate_keys_table) { + st_free_table(p->warn_duplicate_keys_table); } - if (st_lookup(sym_rev_tbl, id, (st_data_t *)&name)) - return name; +#ifndef RIPPER + if (p->tokens) { + rb_parser_ary_free(p, p->tokens); + } +#endif - if (is_attrset_id(id)) { - ID id2 = (id & ~ID_SCOPE_MASK) | ID_LOCAL; + if (p->tokenbuf) { + ruby_sized_xfree(p->tokenbuf, p->toksiz); + } - again: - name = rb_id2name(id2); - if (name) { - char *buf = ALLOCA_N(char, strlen(name)+2); + for (local = p->lvtbl; local; local = prev) { + prev = local->prev; + local_free(p, local); + } - strcpy(buf, name); - strcat(buf, "="); - rb_intern(buf); - return rb_id2name(id); - } - if (is_local_id(id2)) { - id2 = (id & ~ID_SCOPE_MASK) | ID_CONST; - goto again; - } + { + token_info *ptinfo; + while ((ptinfo = p->token_info) != 0) { + p->token_info = ptinfo->next; + xfree(ptinfo); + } } - return 0; + string_buffer_free(p); + + if (p->pvtbl) { + st_free_table(p->pvtbl); + } + + if (CASE_LABELS_ENABLED_P(p->case_labels)) { + st_free_table(p->case_labels); + } + + xfree(p->lex.strterm); + p->lex.strterm = 0; + + xfree(ptr); } -static int -symbols_i(key, value, ary) - char *key; - ID value; - VALUE ary; +size_t +rb_ruby_parser_memsize(const void *ptr) { - rb_ary_push(ary, ID2SYM(value)); - return ST_CONTINUE; + struct parser_params *p = (struct parser_params*)ptr; + struct local_vars *local; + size_t size = sizeof(*p); + + size += p->toksiz; + for (local = p->lvtbl; local; local = local->prev) { + size += sizeof(*local); + if (local->vars) size += local->vars->capa * sizeof(ID); + } + return size; } -/* - * call-seq: - * Symbol.all_symbols => array - * - * Returns an array of all the symbols currently in Ruby's symbol - * table. - * - * Symbol.all_symbols.size #=> 903 - * Symbol.all_symbols[1,20] #=> [:floor, :ARGV, :Binding, :symlink, - * :chown, :EOFError, :$;, :String, - * :LOCK_SH, :"setuid?", :$<, - * :default_proc, :compact, :extend, - * :Tms, :getwd, :$=, :ThreadGroup, - * :wait2, :$>] - */ +#ifndef RIPPER +#undef rb_reserved_word -VALUE -rb_sym_all_symbols() +const struct kwtable * +rb_reserved_word(const char *str, unsigned int len) { - VALUE ary = rb_ary_new2(sym_tbl->num_entries); + return reserved_word(str, len); +} - st_foreach(sym_tbl, symbols_i, ary); - return ary; +#ifdef UNIVERSAL_PARSER +rb_parser_t * +rb_ruby_parser_allocate(const rb_parser_config_t *config) +{ + /* parser_initialize expects fields to be set to 0 */ + rb_parser_t *p = (rb_parser_t *)config->calloc(1, sizeof(rb_parser_t)); + p->config = config; + return p; +} + +rb_parser_t * +rb_ruby_parser_new(const rb_parser_config_t *config) +{ + /* parser_initialize expects fields to be set to 0 */ + rb_parser_t *p = rb_ruby_parser_allocate(config); + parser_initialize(p); + return p; +} +#else +rb_parser_t * +rb_ruby_parser_allocate(void) +{ + /* parser_initialize expects fields to be set to 0 */ + rb_parser_t *p = (rb_parser_t *)ruby_xcalloc(1, sizeof(rb_parser_t)); + return p; +} + +rb_parser_t * +rb_ruby_parser_new(void) +{ + /* parser_initialize expects fields to be set to 0 */ + rb_parser_t *p = rb_ruby_parser_allocate(); + parser_initialize(p); + return p; +} +#endif + +rb_parser_t * +rb_ruby_parser_set_context(rb_parser_t *p, const struct rb_iseq_struct *base, int main) +{ + p->error_buffer = main ? Qfalse : Qnil; + p->parent_iseq = base; + return p; +} + +void +rb_ruby_parser_set_script_lines(rb_parser_t *p) +{ + p->debug_lines = rb_parser_ary_new_capa_for_script_line(p, 10); +} + +void +rb_ruby_parser_error_tolerant(rb_parser_t *p) +{ + p->error_tolerant = 1; +} + +void +rb_ruby_parser_keep_tokens(rb_parser_t *p) +{ + p->keep_tokens = 1; + p->tokens = rb_parser_ary_new_capa_for_ast_token(p, 10); +} + +rb_encoding * +rb_ruby_parser_encoding(rb_parser_t *p) +{ + return p->enc; } int -rb_is_const_id(id) - ID id; +rb_ruby_parser_end_seen_p(rb_parser_t *p) { - if (is_const_id(id)) return Qtrue; - return Qfalse; + return p->ruby__end__seen; } int -rb_is_class_id(id) - ID id; +rb_ruby_parser_set_yydebug(rb_parser_t *p, int flag) { - if (is_class_id(id)) return Qtrue; - return Qfalse; + p->debug = flag; + return flag; } +#endif /* !RIPPER */ +#ifdef RIPPER int -rb_is_instance_id(id) - ID id; +rb_ruby_parser_get_yydebug(rb_parser_t *p) { - if (is_instance_id(id)) return Qtrue; - return Qfalse; + return p->debug; +} + +void +rb_ruby_parser_set_value(rb_parser_t *p, VALUE value) +{ + p->value = value; } int -rb_is_local_id(id) - ID id; +rb_ruby_parser_error_p(rb_parser_t *p) { - if (is_local_id(id)) return Qtrue; - return Qfalse; + return p->error_p; +} + +VALUE +rb_ruby_parser_debug_output(rb_parser_t *p) +{ + return p->debug_output; +} + +void +rb_ruby_parser_set_debug_output(rb_parser_t *p, VALUE output) +{ + p->debug_output = output; +} + +VALUE +rb_ruby_parser_parsing_thread(rb_parser_t *p) +{ + return p->parsing_thread; +} + +void +rb_ruby_parser_set_parsing_thread(rb_parser_t *p, VALUE parsing_thread) +{ + p->parsing_thread = parsing_thread; +} + +void +rb_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) +{ + p->lex.gets = gets; + p->lex.input = input; + p->eofp = 0; + p->ruby_sourcefile_string = sourcefile_string; + p->ruby_sourcefile = sourcefile; + p->ruby_sourceline = sourceline; +} + +VALUE +rb_ruby_parser_result(rb_parser_t *p) +{ + return p->result; +} + +rb_encoding * +rb_ruby_parser_enc(rb_parser_t *p) +{ + return p->enc; +} + +VALUE +rb_ruby_parser_ruby_sourcefile_string(rb_parser_t *p) +{ + return p->ruby_sourcefile_string; } int -rb_is_junk_id(id) - ID id; +rb_ruby_parser_ruby_sourceline(rb_parser_t *p) { - if (is_junk_id(id)) return Qtrue; - return Qfalse; + return p->ruby_sourceline; } -static void -special_local_set(c, val) - char c; - VALUE val; +int +rb_ruby_parser_lex_state(rb_parser_t *p) { - int cnt; + return p->lex.state; +} - top_local_init(); - cnt = local_cnt(c); - top_local_setup(); - ruby_scope->local_vars[cnt] = val; +void +rb_ruby_ripper_parse0(rb_parser_t *p) +{ + parser_prepare(p); + p->ast = rb_ast_new(); + ripper_yyparse((void*)p); + rb_ast_free(p->ast); + p->ast = 0; + p->eval_tree = 0; + p->eval_tree_begin = 0; +} + +int +rb_ruby_ripper_dedent_string(rb_parser_t *p, rb_parser_string_t *string, int width) +{ + return dedent_string(p, string, width); +} + +int +rb_ruby_ripper_initialized_p(rb_parser_t *p) +{ + return p->lex.input != 0; +} + +void +rb_ruby_ripper_parser_initialize(rb_parser_t *p) +{ + parser_initialize(p); +} + +long +rb_ruby_ripper_column(rb_parser_t *p) +{ + return p->lex.ptok - p->lex.pbeg; +} + +long +rb_ruby_ripper_token_len(rb_parser_t *p) +{ + return p->lex.pcur - p->lex.ptok; +} + +rb_parser_string_t * +rb_ruby_ripper_lex_lastline(rb_parser_t *p) +{ + return p->lex.lastline; } VALUE -rb_backref_get() +rb_ruby_ripper_lex_state_name(struct parser_params *p, int state) { - VALUE *var = rb_svar(1); - if (var) { - return *var; - } - return Qnil; + return rb_parser_lex_state_name(p, (enum lex_state_e)state); +} + +#ifdef UNIVERSAL_PARSER +rb_parser_t * +rb_ripper_parser_params_allocate(const rb_parser_config_t *config) +{ + rb_parser_t *p = (rb_parser_t *)config->calloc(1, sizeof(rb_parser_t)); + p->config = config; + return p; +} +#endif + +struct parser_params* +rb_ruby_ripper_parser_allocate(void) +{ + return (struct parser_params *)ruby_xcalloc(1, sizeof(struct parser_params)); } +#endif /* RIPPER */ +#ifndef RIPPER void -rb_backref_set(val) - VALUE val; +rb_parser_printf(struct parser_params *p, const char *fmt, ...) +{ + va_list ap; + VALUE mesg = p->debug_buffer; + + if (NIL_P(mesg)) p->debug_buffer = mesg = rb_str_new(0, 0); + va_start(ap, fmt); + rb_str_vcatf(mesg, fmt, ap); + va_end(ap); + if (char_at_end(p, mesg, 0) == '\n') { + rb_io_write(p->debug_output, mesg); + p->debug_buffer = Qnil; + } +} + +static void +parser_compile_error(struct parser_params *p, const rb_code_location_t *loc, const char *fmt, ...) { - VALUE *var = rb_svar(1); - if (var) { - *var = val; + va_list ap; + int lineno, column; + + if (loc) { + lineno = loc->end_pos.lineno; + column = loc->end_pos.column; } else { - special_local_set('~', val); + lineno = p->ruby_sourceline; + column = rb_long2int(p->lex.pcur - p->lex.pbeg); } + + rb_io_flush(p->debug_output); + p->error_p = 1; + va_start(ap, fmt); + p->error_buffer = + rb_syntax_error_append(p->error_buffer, + p->ruby_sourcefile_string, + lineno, column, + p->enc, fmt, ap); + va_end(ap); } -VALUE -rb_lastline_get() +static size_t +count_char(const char *str, int c) +{ + int n = 0; + while (str[n] == c) ++n; + return n; +} + +/* + * strip enclosing double-quotes, same as the default yytnamerr except + * for that single-quotes matching back-quotes do not stop stripping. + * + * "\"`class' keyword\"" => "`class' keyword" + */ +size_t +rb_yytnamerr(struct parser_params *p, char *yyres, const char *yystr) { - VALUE *var = rb_svar(0); - if (var) { - return *var; + if (*yystr == '"') { + size_t yyn = 0, bquote = 0; + const char *yyp = yystr; + + while (*++yyp) { + switch (*yyp) { + case '\'': + if (!bquote) { + bquote = count_char(yyp+1, '\'') + 1; + if (yyres) memcpy(&yyres[yyn], yyp, bquote); + yyn += bquote; + yyp += bquote - 1; + break; + } + else { + if (bquote && count_char(yyp+1, '\'') + 1 == bquote) { + if (yyres) memcpy(yyres + yyn, yyp, bquote); + yyn += bquote; + yyp += bquote - 1; + bquote = 0; + break; + } + if (yyp[1] && yyp[1] != '\'' && yyp[2] == '\'') { + if (yyres) memcpy(yyres + yyn, yyp, 3); + yyn += 3; + yyp += 2; + break; + } + goto do_not_strip_quotes; + } + + case ',': + goto do_not_strip_quotes; + + case '\\': + if (*++yyp != '\\') + goto do_not_strip_quotes; + /* Fall through. */ + default: + if (yyres) + yyres[yyn] = *yyp; + yyn++; + break; + + case '"': + case '\0': + if (yyres) + yyres[yyn] = '\0'; + return yyn; + } + } + do_not_strip_quotes: ; } - return Qnil; + + if (!yyres) return strlen(yystr); + + return (YYSIZE_T)(yystpcpy(yyres, yystr) - yyres); +} +#endif + +#ifdef RIPPER +#define validate(x) (void)(x) + +static VALUE +ripper_dispatch0(struct parser_params *p, ID mid) +{ + return rb_funcall(p->value, mid, 0); +} + +static VALUE +ripper_dispatch1(struct parser_params *p, ID mid, VALUE a) +{ + validate(a); + return rb_funcall(p->value, mid, 1, a); +} + +static VALUE +ripper_dispatch2(struct parser_params *p, ID mid, VALUE a, VALUE b) +{ + validate(a); + validate(b); + return rb_funcall(p->value, mid, 2, a, b); +} + +static VALUE +ripper_dispatch3(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c) +{ + validate(a); + validate(b); + validate(c); + return rb_funcall(p->value, mid, 3, a, b, c); +} + +static VALUE +ripper_dispatch4(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d) +{ + validate(a); + validate(b); + validate(c); + validate(d); + return rb_funcall(p->value, mid, 4, a, b, c, d); +} + +static VALUE +ripper_dispatch5(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e) +{ + validate(a); + validate(b); + validate(c); + validate(d); + validate(e); + return rb_funcall(p->value, mid, 5, a, b, c, d, e); +} + +static VALUE +ripper_dispatch7(struct parser_params *p, ID mid, VALUE a, VALUE b, VALUE c, VALUE d, VALUE e, VALUE f, VALUE g) +{ + validate(a); + validate(b); + validate(c); + validate(d); + validate(e); + validate(f); + validate(g); + return rb_funcall(p->value, mid, 7, a, b, c, d, e, f, g); } void -rb_lastline_set(val) - VALUE val; +ripper_error(struct parser_params *p) { - VALUE *var = rb_svar(0); - if (var) { - *var = val; - } - else { - special_local_set('_', val); - } + p->error_p = TRUE; } + +VALUE +ripper_value(struct parser_params *p) +{ + (void)yystpcpy; /* may not used in newer bison */ + + return p->value; +} + +#endif /* RIPPER */ +/* + * Local variables: + * mode: c + * c-file-style: "ruby" + * End: + */ |