PageRenderTime 86ms CodeModel.GetById 27ms RepoModel.GetById 1ms app.codeStats 0ms

/vm/parser/grammar.y

https://github.com/btakita/rubinius
Happy | 5839 lines | 5330 code | 509 blank | 0 comment | 0 complexity | 7e6e70a7e0ebcd435b0171e9a1a36655 MD5 | raw file
Possible License(s): BSD-3-Clause, GPL-2.0, BSD-2-Clause, LGPL-2.1
  1. /**********************************************************************
  2. parse.y -
  3. $Author: matz $
  4. $Date: 2004/11/29 06:13:51 $
  5. created at: Fri May 28 18:02:42 JST 1993
  6. Copyright (C) 1993-2003 Yukihiro Matsumoto
  7. **********************************************************************/
  8. %{
  9. #define YYDEBUG 1
  10. #define YYERROR_VERBOSE 1
  11. #include <stdio.h>
  12. #include <errno.h>
  13. #include <ctype.h>
  14. #include <string.h>
  15. #include <stdbool.h>
  16. #include "builtin/array.hpp"
  17. #include "parser/grammar_internal.hpp"
  18. #include "parser/grammar_runtime.hpp"
  19. #include "objectmemory.hpp"
  20. namespace rubinius {
  21. namespace parser {
  22. #undef VALUE
  23. #ifndef isnumber
  24. #define isnumber isdigit
  25. #endif
  26. #define ISALPHA isalpha
  27. #define ISSPACE isspace
  28. #define ISALNUM(x) (isalpha(x) || isnumber(x))
  29. #define ISDIGIT isdigit
  30. #define ISXDIGIT isxdigit
  31. #define ISUPPER isupper
  32. #define ismbchar(c) (0)
  33. #define mbclen(c) (1)
  34. #define ID2SYM(i) (Object*)i
  35. #define string_new(ptr, len) blk2bstr(ptr, len)
  36. #define string_new2(ptr) cstr2bstr(ptr)
  37. intptr_t syd_sourceline;
  38. static char *syd_sourcefile;
  39. #define ruby_sourceline syd_sourceline
  40. #define ruby_sourcefile syd_sourcefile
  41. static int
  42. syd_yyerror(const char *, rb_parse_state*);
  43. #define yyparse syd_yyparse
  44. #define yylex syd_yylex
  45. #define yyerror(str) syd_yyerror(str, (rb_parse_state*)parse_state)
  46. #define yylval syd_yylval
  47. #define yychar syd_yychar
  48. #define yydebug syd_yydebug
  49. #define YYPARSE_PARAM parse_state
  50. #define YYLEX_PARAM parse_state
  51. #define ID_SCOPE_SHIFT 3
  52. #define ID_SCOPE_MASK 0x07
  53. #define ID_LOCAL 0x01
  54. #define ID_INSTANCE 0x02
  55. #define ID_GLOBAL 0x03
  56. #define ID_ATTRSET 0x04
  57. #define ID_CONST 0x05
  58. #define ID_CLASS 0x06
  59. #define ID_JUNK 0x07
  60. #define ID_INTERNAL ID_JUNK
  61. #define is_notop_id(id) ((id)>tLAST_TOKEN)
  62. #define is_local_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_LOCAL)
  63. #define is_global_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_GLOBAL)
  64. #define is_instance_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_INSTANCE)
  65. #define is_attrset_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_ATTRSET)
  66. #define is_const_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_CONST)
  67. #define is_class_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_CLASS)
  68. #define is_junk_id(id) (is_notop_id(id)&&((id)&ID_SCOPE_MASK)==ID_JUNK)
  69. #define is_asgn_or_id(id) ((is_notop_id(id)) && \
  70. (((id)&ID_SCOPE_MASK) == ID_GLOBAL || \
  71. ((id)&ID_SCOPE_MASK) == ID_INSTANCE || \
  72. ((id)&ID_SCOPE_MASK) == ID_CLASS))
  73. /* FIXME these went into the ruby_state instead of parse_state
  74. because a ton of other crap depends on it
  75. char *ruby_sourcefile; current source file
  76. int ruby_sourceline; current line no.
  77. */
  78. static int yylex(void*, void *);
  79. #define BITSTACK_PUSH(stack, n) (stack = (stack<<1)|((n)&1))
  80. #define BITSTACK_POP(stack) (stack >>= 1)
  81. #define BITSTACK_LEXPOP(stack) (stack = (stack >> 1) | (stack & 1))
  82. #define BITSTACK_SET_P(stack) (stack&1)
  83. #define COND_PUSH(n) BITSTACK_PUSH(vps->cond_stack, n)
  84. #define COND_POP() BITSTACK_POP(vps->cond_stack)
  85. #define COND_LEXPOP() BITSTACK_LEXPOP(vps->cond_stack)
  86. #define COND_P() BITSTACK_SET_P(vps->cond_stack)
  87. #define CMDARG_PUSH(n) BITSTACK_PUSH(vps->cmdarg_stack, n)
  88. #define CMDARG_POP() BITSTACK_POP(vps->cmdarg_stack)
  89. #define CMDARG_LEXPOP() BITSTACK_LEXPOP(vps->cmdarg_stack)
  90. #define CMDARG_P() BITSTACK_SET_P(vps->cmdarg_stack)
  91. /*
  92. static int class_nest = 0;
  93. static int in_single = 0;
  94. static int in_def = 0;
  95. static int compile_for_eval = 0;
  96. static ID cur_mid = 0;
  97. */
  98. static NODE *cond(NODE*,rb_parse_state*);
  99. static NODE *logop(enum node_type,NODE*,NODE*,rb_parse_state*);
  100. static int cond_negative(NODE**);
  101. static NODE *newline_node(rb_parse_state*,NODE*);
  102. static void fixpos(NODE*,NODE*);
  103. static int value_expr0(NODE*,rb_parse_state*);
  104. static void void_expr0(NODE *);
  105. static void void_stmts(NODE*,rb_parse_state*);
  106. static NODE *remove_begin(NODE*,rb_parse_state*);
  107. #define value_expr(node) value_expr0((node) = \
  108. remove_begin(node, (rb_parse_state*)parse_state), \
  109. (rb_parse_state*)parse_state)
  110. #define void_expr(node) void_expr0((node) = remove_begin(node, (rb_parse_state*)parse_state))
  111. static NODE *block_append(rb_parse_state*,NODE*,NODE*);
  112. static NODE *list_append(rb_parse_state*,NODE*,NODE*);
  113. static NODE *list_concat(NODE*,NODE*);
  114. static NODE *arg_concat(rb_parse_state*,NODE*,NODE*);
  115. static NODE *arg_prepend(rb_parse_state*,NODE*,NODE*);
  116. static NODE *literal_concat(rb_parse_state*,NODE*,NODE*);
  117. static NODE *new_evstr(rb_parse_state*,NODE*);
  118. static NODE *evstr2dstr(rb_parse_state*,NODE*);
  119. static NODE *call_op(NODE*,ID,int,NODE*,rb_parse_state*);
  120. /* static NODE *negate_lit(NODE*); */
  121. static NODE *ret_args(rb_parse_state*,NODE*);
  122. static NODE *arg_blk_pass(NODE*,NODE*);
  123. static NODE *new_call(rb_parse_state*,NODE*,ID,NODE*);
  124. static NODE *new_fcall(rb_parse_state*,ID,NODE*);
  125. static NODE *new_super(rb_parse_state*,NODE*);
  126. static NODE *new_yield(rb_parse_state*,NODE*);
  127. static NODE *syd_gettable(rb_parse_state*,ID);
  128. #define gettable(i) syd_gettable((rb_parse_state*)parse_state, i)
  129. static NODE *assignable(ID,NODE*,rb_parse_state*);
  130. static NODE *aryset(NODE*,NODE*,rb_parse_state*);
  131. static NODE *attrset(NODE*,ID,rb_parse_state*);
  132. static void rb_backref_error(NODE*,rb_parse_state*);
  133. static NODE *node_assign(NODE*,NODE*,rb_parse_state*);
  134. static NODE *match_gen(NODE*,NODE*,rb_parse_state*);
  135. static void syd_local_push(rb_parse_state*, int cnt);
  136. #define local_push(cnt) syd_local_push(vps, cnt)
  137. static void syd_local_pop(rb_parse_state*);
  138. #define local_pop() syd_local_pop(vps)
  139. static intptr_t syd_local_cnt(rb_parse_state*,ID);
  140. #define local_cnt(i) syd_local_cnt(vps, i)
  141. static int syd_local_id(rb_parse_state*,ID);
  142. #define local_id(i) syd_local_id(vps, i)
  143. static ID *syd_local_tbl(rb_parse_state *st);
  144. static ID convert_op(ID id);
  145. static void tokadd(char c, rb_parse_state *parse_state);
  146. static int tokadd_string(int, int, int, quark *, rb_parse_state*);
  147. #define SHOW_PARSER_WARNS 0
  148. static int rb_compile_error(rb_parse_state *st, const char *fmt, ...) {
  149. va_list ar;
  150. char msg[256];
  151. int count;
  152. va_start(ar, fmt);
  153. count = vsnprintf(msg, 256, fmt, ar);
  154. va_end(ar);
  155. syd_yyerror(msg, st);
  156. return count;
  157. }
  158. static int _debug_print(const char *fmt, ...) {
  159. #if SHOW_PARSER_WARNS
  160. va_list ar;
  161. int i;
  162. va_start(ar, fmt);
  163. i = vprintf(fmt, ar);
  164. va_end(ar);
  165. return i;
  166. #else
  167. return 0;
  168. #endif
  169. }
  170. #define rb_warn _debug_print
  171. #define rb_warning _debug_print
  172. static ID rb_intern(const char *name);
  173. static ID rb_id_attrset(ID);
  174. rb_parse_state *alloc_parse_state();
  175. static unsigned long scan_oct(const char *start, int len, int *retlen);
  176. static unsigned long scan_hex(const char *start, int len, int *retlen);
  177. static void reset_block(rb_parse_state *parse_state);
  178. static NODE *extract_block_vars(rb_parse_state *parse_state, NODE* node, var_table vars);
  179. #define ruby_verbose 0
  180. #define RE_OPTION_ONCE 0x80
  181. #define RE_OPTION_IGNORECASE (1L)
  182. #define RE_OPTION_EXTENDED (RE_OPTION_IGNORECASE<<1)
  183. #define RE_OPTION_MULTILINE (RE_OPTION_EXTENDED<<1)
  184. #define RE_OPTION_SINGLELINE (RE_OPTION_MULTILINE<<1)
  185. #define RE_OPTION_LONGEST (RE_OPTION_SINGLELINE<<1)
  186. #define RE_MAY_IGNORECASE (RE_OPTION_LONGEST<<1)
  187. #define RE_OPTIMIZE_ANCHOR (RE_MAY_IGNORECASE<<1)
  188. #define RE_OPTIMIZE_EXACTN (RE_OPTIMIZE_ANCHOR<<1)
  189. #define RE_OPTIMIZE_NO_BM (RE_OPTIMIZE_EXACTN<<1)
  190. #define RE_OPTIMIZE_BMATCH (RE_OPTIMIZE_NO_BM<<1)
  191. #define NODE_STRTERM NODE_ZARRAY /* nothing to gc */
  192. #define NODE_HEREDOC NODE_ARRAY /* 1, 3 to gc */
  193. #define SIGN_EXTEND(x,n) (((1<<((n)-1))^((x)&~(~0<<(n))))-(1<<((n)-1)))
  194. #define nd_func u1.id
  195. #if SIZEOF_SHORT != 2
  196. #define nd_term(node) SIGN_EXTEND((node)->u2.id, (CHAR_BIT*2))
  197. #else
  198. #define nd_term(node) ((signed short)(node)->u2.id)
  199. #endif
  200. #define nd_paren(node) (char)((node)->u2.id >> (CHAR_BIT*2))
  201. #define nd_nest u3.id
  202. /* Older versions of Yacc set YYMAXDEPTH to a very low value by default (150,
  203. for instance). This is too low for Ruby to parse some files, such as
  204. date/format.rb, therefore bump the value up to at least Bison's default. */
  205. #ifdef OLD_YACC
  206. #ifndef YYMAXDEPTH
  207. #define YYMAXDEPTH 10000
  208. #endif
  209. #endif
  210. #define vps ((rb_parse_state*)parse_state)
  211. %}
  212. %pure-parser
  213. %union {
  214. NODE *node;
  215. ID id;
  216. int num;
  217. var_table vars;
  218. }
  219. %token kCLASS
  220. kMODULE
  221. kDEF
  222. kUNDEF
  223. kBEGIN
  224. kRESCUE
  225. kENSURE
  226. kEND
  227. kIF
  228. kUNLESS
  229. kTHEN
  230. kELSIF
  231. kELSE
  232. kCASE
  233. kWHEN
  234. kWHILE
  235. kUNTIL
  236. kFOR
  237. kBREAK
  238. kNEXT
  239. kREDO
  240. kRETRY
  241. kIN
  242. kDO
  243. kDO_COND
  244. kDO_BLOCK
  245. kRETURN
  246. kYIELD
  247. kSUPER
  248. kSELF
  249. kNIL
  250. kTRUE
  251. kFALSE
  252. kAND
  253. kOR
  254. kNOT
  255. kIF_MOD
  256. kUNLESS_MOD
  257. kWHILE_MOD
  258. kUNTIL_MOD
  259. kRESCUE_MOD
  260. kALIAS
  261. kDEFINED
  262. klBEGIN
  263. klEND
  264. k__LINE__
  265. k__FILE__
  266. %token <id> tIDENTIFIER tFID tGVAR tIVAR tCONSTANT tCVAR tXSTRING_BEG
  267. %token <node> tINTEGER tFLOAT tSTRING_CONTENT
  268. %token <node> tNTH_REF tBACK_REF
  269. %token <num> tREGEXP_END
  270. %type <node> singleton strings string string1 xstring regexp
  271. %type <node> string_contents xstring_contents string_content
  272. %type <node> words qwords word_list qword_list word
  273. %type <node> literal numeric dsym cpath
  274. %type <node> bodystmt compstmt stmts stmt expr arg primary command command_call method_call
  275. %type <node> expr_value arg_value primary_value
  276. %type <node> if_tail opt_else case_body cases opt_rescue exc_list exc_var opt_ensure
  277. %type <node> args when_args call_args call_args2 open_args paren_args opt_paren_args
  278. %type <node> command_args aref_args opt_block_arg block_arg var_ref var_lhs
  279. %type <node> mrhs superclass block_call block_command
  280. %type <node> f_arglist f_args f_optarg f_opt f_block_arg opt_f_block_arg
  281. %type <node> assoc_list assocs assoc undef_list backref string_dvar
  282. %type <node> block_var opt_block_var brace_block cmd_brace_block do_block lhs none
  283. %type <node> mlhs mlhs_head mlhs_basic mlhs_entry mlhs_item mlhs_node
  284. %type <id> fitem variable sym symbol operation operation2 operation3
  285. %type <id> cname fname op f_rest_arg
  286. %type <num> f_norm_arg f_arg
  287. %token tUPLUS /* unary+ */
  288. %token tUMINUS /* unary- */
  289. %token tUBS /* unary\ */
  290. %token tPOW /* ** */
  291. %token tCMP /* <=> */
  292. %token tEQ /* == */
  293. %token tEQQ /* === */
  294. %token tNEQ /* != */
  295. %token tGEQ /* >= */
  296. %token tLEQ /* <= */
  297. %token tANDOP tOROP /* && and || */
  298. %token tMATCH tNMATCH /* =~ and !~ */
  299. %token tDOT2 tDOT3 /* .. and ... */
  300. %token tAREF tASET /* [] and []= */
  301. %token tLSHFT tRSHFT /* << and >> */
  302. %token tCOLON2 /* :: */
  303. %token tCOLON3 /* :: at EXPR_BEG */
  304. %token <id> tOP_ASGN /* +=, -= etc. */
  305. %token tASSOC /* => */
  306. %token tLPAREN /* ( */
  307. %token tLPAREN_ARG /* ( */
  308. %token tRPAREN /* ) */
  309. %token tLBRACK /* [ */
  310. %token tLBRACE /* { */
  311. %token tLBRACE_ARG /* { */
  312. %token tSTAR /* * */
  313. %token tAMPER /* & */
  314. %token tSYMBEG tSTRING_BEG tREGEXP_BEG tWORDS_BEG tQWORDS_BEG
  315. %token tSTRING_DBEG tSTRING_DVAR tSTRING_END
  316. /*
  317. * precedence table
  318. */
  319. %nonassoc tLOWEST
  320. %nonassoc tLBRACE_ARG
  321. %nonassoc kIF_MOD kUNLESS_MOD kWHILE_MOD kUNTIL_MOD
  322. %left kOR kAND
  323. %right kNOT
  324. %nonassoc kDEFINED
  325. %right '=' tOP_ASGN
  326. %left kRESCUE_MOD
  327. %right '?' ':'
  328. %nonassoc tDOT2 tDOT3
  329. %left tOROP
  330. %left tANDOP
  331. %nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH
  332. %left '>' tGEQ '<' tLEQ
  333. %left '|' '^'
  334. %left '&'
  335. %left tLSHFT tRSHFT
  336. %left '+' '-'
  337. %left '*' '/' '%'
  338. %right tUMINUS_NUM tUMINUS
  339. %right tPOW
  340. %right '!' '~' tUPLUS
  341. %token tLAST_TOKEN
  342. %%
  343. program : {
  344. vps->lex_state = EXPR_BEG;
  345. vps->variables = var_table_create();
  346. class_nest = 0;
  347. }
  348. compstmt
  349. {
  350. if ($2 && !compile_for_eval) {
  351. /* last expression should not be void */
  352. if (nd_type($2) != NODE_BLOCK) void_expr($2);
  353. else {
  354. NODE *node = $2;
  355. while (node->nd_next) {
  356. node = node->nd_next;
  357. }
  358. void_expr(node->nd_head);
  359. }
  360. }
  361. vps->top = block_append(vps, vps->top, $2);
  362. class_nest = 0;
  363. }
  364. ;
  365. bodystmt : compstmt
  366. opt_rescue
  367. opt_else
  368. opt_ensure
  369. {
  370. $$ = $1;
  371. if ($2) {
  372. $$ = NEW_RESCUE($1, $2, $3);
  373. }
  374. else if ($3) {
  375. rb_warn("else without rescue is useless");
  376. $$ = block_append(vps, $$, $3);
  377. }
  378. if ($4) {
  379. $$ = NEW_ENSURE($$, $4);
  380. }
  381. fixpos($$, $1);
  382. }
  383. ;
  384. compstmt : stmts opt_terms
  385. {
  386. void_stmts($1, vps);
  387. $$ = $1;
  388. }
  389. ;
  390. stmts : none
  391. | stmt
  392. {
  393. $$ = newline_node(vps, $1);
  394. }
  395. | stmts terms stmt
  396. {
  397. $$ = block_append(vps, $1, newline_node(vps, $3));
  398. }
  399. | error stmt
  400. {
  401. $$ = remove_begin($2, vps);
  402. }
  403. ;
  404. stmt : kALIAS fitem {vps->lex_state = EXPR_FNAME;} fitem
  405. {
  406. $$ = NEW_ALIAS($2, $4);
  407. }
  408. | kALIAS tGVAR tGVAR
  409. {
  410. $$ = NEW_VALIAS($2, $3);
  411. }
  412. | kALIAS tGVAR tBACK_REF
  413. {
  414. char buf[3];
  415. snprintf(buf, sizeof(buf), "$%c", (char)$3->nd_nth);
  416. $$ = NEW_VALIAS($2, rb_intern(buf));
  417. }
  418. | kALIAS tGVAR tNTH_REF
  419. {
  420. yyerror("can't make alias for the number variables");
  421. $$ = 0;
  422. }
  423. | kUNDEF undef_list
  424. {
  425. $$ = $2;
  426. }
  427. | stmt kIF_MOD expr_value
  428. {
  429. $$ = NEW_IF(cond($3, vps), remove_begin($1, vps), 0);
  430. fixpos($$, $3);
  431. if (cond_negative(&$$->nd_cond)) {
  432. $$->nd_else = $$->nd_body;
  433. $$->nd_body = 0;
  434. }
  435. }
  436. | stmt kUNLESS_MOD expr_value
  437. {
  438. $$ = NEW_UNLESS(cond($3, vps), remove_begin($1, vps), 0);
  439. fixpos($$, $3);
  440. if (cond_negative(&$$->nd_cond)) {
  441. $$->nd_body = $$->nd_else;
  442. $$->nd_else = 0;
  443. }
  444. }
  445. | stmt kWHILE_MOD expr_value
  446. {
  447. if ($1 && nd_type($1) == NODE_BEGIN) {
  448. $$ = NEW_WHILE(cond($3, vps), $1->nd_body, 0);
  449. }
  450. else {
  451. $$ = NEW_WHILE(cond($3, vps), $1, 1);
  452. }
  453. if (cond_negative(&$$->nd_cond)) {
  454. nd_set_type($$, NODE_UNTIL);
  455. }
  456. }
  457. | stmt kUNTIL_MOD expr_value
  458. {
  459. if ($1 && nd_type($1) == NODE_BEGIN) {
  460. $$ = NEW_UNTIL(cond($3, vps), $1->nd_body, 0);
  461. }
  462. else {
  463. $$ = NEW_UNTIL(cond($3, vps), $1, 1);
  464. }
  465. if (cond_negative(&$$->nd_cond)) {
  466. nd_set_type($$, NODE_WHILE);
  467. }
  468. }
  469. | stmt kRESCUE_MOD stmt
  470. {
  471. NODE *resq = NEW_RESBODY(0, remove_begin($3, vps), 0);
  472. $$ = NEW_RESCUE(remove_begin($1, vps), resq, 0);
  473. }
  474. | klBEGIN
  475. {
  476. if (in_def || in_single) {
  477. yyerror("BEGIN in method");
  478. }
  479. local_push(0);
  480. }
  481. '{' compstmt '}'
  482. {
  483. /*
  484. ruby_eval_tree_begin = block_append(ruby_eval_tree_begin,
  485. NEW_PREEXE($4));
  486. */
  487. local_pop();
  488. $$ = 0;
  489. }
  490. | klEND '{' compstmt '}'
  491. {
  492. if (in_def || in_single) {
  493. rb_warn("END in method; use at_exit");
  494. }
  495. $$ = NEW_ITER(0, NEW_POSTEXE(), $3);
  496. }
  497. | lhs '=' command_call
  498. {
  499. $$ = node_assign($1, $3, vps);
  500. }
  501. | mlhs '=' command_call
  502. {
  503. value_expr($3);
  504. $1->nd_value = ($1->nd_head) ? NEW_TO_ARY($3) : NEW_ARRAY($3);
  505. $$ = $1;
  506. }
  507. | var_lhs tOP_ASGN command_call
  508. {
  509. value_expr($3);
  510. if ($1) {
  511. ID vid = $1->nd_vid;
  512. if ($2 == tOROP) {
  513. $1->nd_value = $3;
  514. $$ = NEW_OP_ASGN_OR(gettable(vid), $1);
  515. if (is_asgn_or_id(vid)) {
  516. $$->nd_aid = vid;
  517. }
  518. }
  519. else if ($2 == tANDOP) {
  520. $1->nd_value = $3;
  521. $$ = NEW_OP_ASGN_AND(gettable(vid), $1);
  522. }
  523. else {
  524. $$ = $1;
  525. $$->nd_value = call_op(gettable(vid),$2,1,$3, vps);
  526. }
  527. }
  528. else {
  529. $$ = 0;
  530. }
  531. }
  532. | primary_value '[' aref_args ']' tOP_ASGN command_call
  533. {
  534. NODE *args;
  535. value_expr($6);
  536. if (!$3) $3 = NEW_ZARRAY();
  537. args = arg_concat(vps, $6, $3);
  538. if ($5 == tOROP) {
  539. $5 = 0;
  540. }
  541. else if ($5 == tANDOP) {
  542. $5 = 1;
  543. }
  544. $$ = NEW_OP_ASGN1($1, $5, args);
  545. fixpos($$, $1);
  546. }
  547. | primary_value '.' tIDENTIFIER tOP_ASGN command_call
  548. {
  549. value_expr($5);
  550. if ($4 == tOROP) {
  551. $4 = 0;
  552. }
  553. else if ($4 == tANDOP) {
  554. $4 = 1;
  555. }
  556. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  557. fixpos($$, $1);
  558. }
  559. | primary_value '.' tCONSTANT tOP_ASGN command_call
  560. {
  561. value_expr($5);
  562. if ($4 == tOROP) {
  563. $4 = 0;
  564. }
  565. else if ($4 == tANDOP) {
  566. $4 = 1;
  567. }
  568. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  569. fixpos($$, $1);
  570. }
  571. | primary_value tCOLON2 tIDENTIFIER tOP_ASGN command_call
  572. {
  573. value_expr($5);
  574. if ($4 == tOROP) {
  575. $4 = 0;
  576. }
  577. else if ($4 == tANDOP) {
  578. $4 = 1;
  579. }
  580. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  581. fixpos($$, $1);
  582. }
  583. | backref tOP_ASGN command_call
  584. {
  585. rb_backref_error($1, vps);
  586. $$ = 0;
  587. }
  588. | lhs '=' mrhs
  589. {
  590. $$ = node_assign($1, NEW_SVALUE($3), vps);
  591. }
  592. | mlhs '=' arg_value
  593. {
  594. $1->nd_value = ($1->nd_head) ? NEW_TO_ARY($3) : NEW_ARRAY($3);
  595. $$ = $1;
  596. }
  597. | mlhs '=' mrhs
  598. {
  599. $1->nd_value = $3;
  600. $$ = $1;
  601. }
  602. | expr
  603. ;
  604. expr : command_call
  605. | expr kAND expr
  606. {
  607. $$ = logop(NODE_AND, $1, $3, vps);
  608. }
  609. | expr kOR expr
  610. {
  611. $$ = logop(NODE_OR, $1, $3, vps);
  612. }
  613. | kNOT expr
  614. {
  615. $$ = NEW_NOT(cond($2, vps));
  616. }
  617. | '!' command_call
  618. {
  619. $$ = NEW_NOT(cond($2, vps));
  620. }
  621. | arg
  622. ;
  623. expr_value : expr
  624. {
  625. value_expr($$);
  626. $$ = $1;
  627. }
  628. ;
  629. command_call : command
  630. | block_command
  631. | kRETURN call_args
  632. {
  633. $$ = NEW_RETURN(ret_args(vps, $2));
  634. }
  635. | kBREAK call_args
  636. {
  637. $$ = NEW_BREAK(ret_args(vps, $2));
  638. }
  639. | kNEXT call_args
  640. {
  641. $$ = NEW_NEXT(ret_args(vps, $2));
  642. }
  643. ;
  644. block_command : block_call
  645. | block_call '.' operation2 command_args
  646. {
  647. $$ = new_call(vps, $1, $3, $4);
  648. }
  649. | block_call tCOLON2 operation2 command_args
  650. {
  651. $$ = new_call(vps, $1, $3, $4);
  652. }
  653. ;
  654. cmd_brace_block : tLBRACE_ARG
  655. {
  656. $<num>1 = ruby_sourceline;
  657. reset_block(vps);
  658. }
  659. opt_block_var { $<vars>$ = vps->block_vars; }
  660. compstmt
  661. '}'
  662. {
  663. $$ = NEW_ITER($3, 0, extract_block_vars(vps, $5, $<vars>4));
  664. nd_set_line($$, $<num>1);
  665. }
  666. ;
  667. command : operation command_args %prec tLOWEST
  668. {
  669. $$ = new_fcall(vps, $1, $2);
  670. fixpos($$, $2);
  671. }
  672. | operation command_args cmd_brace_block
  673. {
  674. $$ = new_fcall(vps, $1, $2);
  675. if ($3) {
  676. if (nd_type($$) == NODE_BLOCK_PASS) {
  677. rb_compile_error(vps, "both block arg and actual block given");
  678. }
  679. $3->nd_iter = $$;
  680. $$ = $3;
  681. }
  682. fixpos($$, $2);
  683. }
  684. | primary_value '.' operation2 command_args %prec tLOWEST
  685. {
  686. $$ = new_call(vps, $1, $3, $4);
  687. fixpos($$, $1);
  688. }
  689. | primary_value '.' operation2 command_args cmd_brace_block
  690. {
  691. $$ = new_call(vps, $1, $3, $4);
  692. if ($5) {
  693. if (nd_type($$) == NODE_BLOCK_PASS) {
  694. rb_compile_error(vps, "both block arg and actual block given");
  695. }
  696. $5->nd_iter = $$;
  697. $$ = $5;
  698. }
  699. fixpos($$, $1);
  700. }
  701. | primary_value tCOLON2 operation2 command_args %prec tLOWEST
  702. {
  703. $$ = new_call(vps, $1, $3, $4);
  704. fixpos($$, $1);
  705. }
  706. | primary_value tCOLON2 operation2 command_args cmd_brace_block
  707. {
  708. $$ = new_call(vps, $1, $3, $4);
  709. if ($5) {
  710. if (nd_type($$) == NODE_BLOCK_PASS) {
  711. rb_compile_error(vps, "both block arg and actual block given");
  712. }
  713. $5->nd_iter = $$;
  714. $$ = $5;
  715. }
  716. fixpos($$, $1);
  717. }
  718. | kSUPER command_args
  719. {
  720. $$ = new_super(vps, $2);
  721. fixpos($$, $2);
  722. }
  723. | kYIELD command_args
  724. {
  725. $$ = new_yield(vps, $2);
  726. fixpos($$, $2);
  727. }
  728. ;
  729. mlhs : mlhs_basic
  730. | tLPAREN mlhs_entry ')'
  731. {
  732. $$ = $2;
  733. }
  734. ;
  735. mlhs_entry : mlhs_basic
  736. | tLPAREN mlhs_entry ')'
  737. {
  738. $$ = NEW_MASGN(NEW_LIST($2), 0);
  739. }
  740. ;
  741. mlhs_basic : mlhs_head
  742. {
  743. $$ = NEW_MASGN($1, 0);
  744. }
  745. | mlhs_head mlhs_item
  746. {
  747. $$ = NEW_MASGN(list_append(vps, $1,$2), 0);
  748. }
  749. | mlhs_head tSTAR mlhs_node
  750. {
  751. $$ = NEW_MASGN($1, $3);
  752. }
  753. | mlhs_head tSTAR
  754. {
  755. $$ = NEW_MASGN($1, -1);
  756. }
  757. | tSTAR mlhs_node
  758. {
  759. $$ = NEW_MASGN(0, $2);
  760. }
  761. | tSTAR
  762. {
  763. $$ = NEW_MASGN(0, -1);
  764. }
  765. ;
  766. mlhs_item : mlhs_node
  767. | tLPAREN mlhs_entry ')'
  768. {
  769. $$ = $2;
  770. }
  771. ;
  772. mlhs_head : mlhs_item ','
  773. {
  774. $$ = NEW_LIST($1);
  775. }
  776. | mlhs_head mlhs_item ','
  777. {
  778. $$ = list_append(vps, $1, $2);
  779. }
  780. ;
  781. mlhs_node : variable
  782. {
  783. $$ = assignable($1, 0, vps);
  784. }
  785. | primary_value '[' aref_args ']'
  786. {
  787. $$ = aryset($1, $3, vps);
  788. }
  789. | primary_value '.' tIDENTIFIER
  790. {
  791. $$ = attrset($1, $3, vps);
  792. }
  793. | primary_value tCOLON2 tIDENTIFIER
  794. {
  795. $$ = attrset($1, $3, vps);
  796. }
  797. | primary_value '.' tCONSTANT
  798. {
  799. $$ = attrset($1, $3, vps);
  800. }
  801. | primary_value tCOLON2 tCONSTANT
  802. {
  803. if (in_def || in_single)
  804. yyerror("dynamic constant assignment");
  805. $$ = NEW_CDECL(0, 0, NEW_COLON2($1, $3));
  806. }
  807. | tCOLON3 tCONSTANT
  808. {
  809. if (in_def || in_single)
  810. yyerror("dynamic constant assignment");
  811. $$ = NEW_CDECL(0, 0, NEW_COLON3($2));
  812. }
  813. | backref
  814. {
  815. rb_backref_error($1, vps);
  816. $$ = 0;
  817. }
  818. ;
  819. lhs : variable
  820. {
  821. $$ = assignable($1, 0, vps);
  822. }
  823. | primary_value '[' aref_args ']'
  824. {
  825. $$ = aryset($1, $3, vps);
  826. }
  827. | primary_value '.' tIDENTIFIER
  828. {
  829. $$ = attrset($1, $3, vps);
  830. }
  831. | primary_value tCOLON2 tIDENTIFIER
  832. {
  833. $$ = attrset($1, $3, vps);
  834. }
  835. | primary_value '.' tCONSTANT
  836. {
  837. $$ = attrset($1, $3, vps);
  838. }
  839. | primary_value tCOLON2 tCONSTANT
  840. {
  841. if (in_def || in_single)
  842. yyerror("dynamic constant assignment");
  843. $$ = NEW_CDECL(0, 0, NEW_COLON2($1, $3));
  844. }
  845. | tCOLON3 tCONSTANT
  846. {
  847. if (in_def || in_single)
  848. yyerror("dynamic constant assignment");
  849. $$ = NEW_CDECL(0, 0, NEW_COLON3($2));
  850. }
  851. | backref
  852. {
  853. rb_backref_error($1, vps);
  854. $$ = 0;
  855. }
  856. ;
  857. cname : tIDENTIFIER
  858. {
  859. yyerror("class/module name must be CONSTANT");
  860. }
  861. | tCONSTANT
  862. ;
  863. cpath : tCOLON3 cname
  864. {
  865. $$ = NEW_COLON3($2);
  866. }
  867. | cname
  868. {
  869. $$ = NEW_COLON2(0, $$);
  870. }
  871. | primary_value tCOLON2 cname
  872. {
  873. $$ = NEW_COLON2($1, $3);
  874. }
  875. ;
  876. fname : tIDENTIFIER
  877. | tCONSTANT
  878. | tFID
  879. | op
  880. {
  881. vps->lex_state = EXPR_END;
  882. $$ = convert_op($1);
  883. }
  884. | reswords
  885. {
  886. vps->lex_state = EXPR_END;
  887. $$ = $<id>1;
  888. }
  889. ;
  890. fitem : fname
  891. | symbol
  892. ;
  893. undef_list : fitem
  894. {
  895. $$ = NEW_UNDEF($1);
  896. }
  897. | undef_list ',' {vps->lex_state = EXPR_FNAME;} fitem
  898. {
  899. $$ = block_append(vps, $1, NEW_UNDEF($4));
  900. }
  901. ;
  902. op : '|' { $$ = '|'; }
  903. | '^' { $$ = '^'; }
  904. | '&' { $$ = '&'; }
  905. | tCMP { $$ = tCMP; }
  906. | tEQ { $$ = tEQ; }
  907. | tEQQ { $$ = tEQQ; }
  908. | tMATCH { $$ = tMATCH; }
  909. | '>' { $$ = '>'; }
  910. | tGEQ { $$ = tGEQ; }
  911. | '<' { $$ = '<'; }
  912. | tLEQ { $$ = tLEQ; }
  913. | tLSHFT { $$ = tLSHFT; }
  914. | tRSHFT { $$ = tRSHFT; }
  915. | '+' { $$ = '+'; }
  916. | '-' { $$ = '-'; }
  917. | '*' { $$ = '*'; }
  918. | tSTAR { $$ = '*'; }
  919. | '/' { $$ = '/'; }
  920. | '%' { $$ = '%'; }
  921. | tPOW { $$ = tPOW; }
  922. | '~' { $$ = '~'; }
  923. | tUPLUS { $$ = tUPLUS; }
  924. | tUMINUS { $$ = tUMINUS; }
  925. | tAREF { $$ = tAREF; }
  926. | tASET { $$ = tASET; }
  927. | '`' { $$ = '`'; }
  928. ;
  929. reswords : k__LINE__ | k__FILE__ | klBEGIN | klEND
  930. | kALIAS | kAND | kBEGIN | kBREAK | kCASE | kCLASS | kDEF
  931. | kDEFINED | kDO | kELSE | kELSIF | kEND | kENSURE | kFALSE
  932. | kFOR | kIN | kMODULE | kNEXT | kNIL | kNOT
  933. | kOR | kREDO | kRESCUE | kRETRY | kRETURN | kSELF | kSUPER
  934. | kTHEN | kTRUE | kUNDEF | kWHEN | kYIELD
  935. | kIF_MOD | kUNLESS_MOD | kWHILE_MOD | kUNTIL_MOD | kRESCUE_MOD
  936. ;
  937. arg : lhs '=' arg
  938. {
  939. $$ = node_assign($1, $3, vps);
  940. }
  941. | lhs '=' arg kRESCUE_MOD arg
  942. {
  943. $$ = node_assign($1, NEW_RESCUE($3, NEW_RESBODY(0,$5,0), 0), vps);
  944. }
  945. | var_lhs tOP_ASGN arg
  946. {
  947. value_expr($3);
  948. if ($1) {
  949. ID vid = $1->nd_vid;
  950. if ($2 == tOROP) {
  951. $1->nd_value = $3;
  952. $$ = NEW_OP_ASGN_OR(gettable(vid), $1);
  953. if (is_asgn_or_id(vid)) {
  954. $$->nd_aid = vid;
  955. }
  956. }
  957. else if ($2 == tANDOP) {
  958. $1->nd_value = $3;
  959. $$ = NEW_OP_ASGN_AND(gettable(vid), $1);
  960. }
  961. else {
  962. $$ = $1;
  963. $$->nd_value = call_op(gettable(vid),$2,1,$3, vps);
  964. }
  965. }
  966. else {
  967. $$ = 0;
  968. }
  969. }
  970. | primary_value '[' aref_args ']' tOP_ASGN arg
  971. {
  972. NODE *args;
  973. value_expr($6);
  974. if (!$3) $3 = NEW_ZARRAY();
  975. args = arg_concat(vps, $6, $3);
  976. if ($5 == tOROP) {
  977. $5 = 0;
  978. }
  979. else if ($5 == tANDOP) {
  980. $5 = 1;
  981. }
  982. $$ = NEW_OP_ASGN1($1, $5, args);
  983. fixpos($$, $1);
  984. }
  985. | primary_value '.' tIDENTIFIER tOP_ASGN arg
  986. {
  987. value_expr($5);
  988. if ($4 == tOROP) {
  989. $4 = 0;
  990. }
  991. else if ($4 == tANDOP) {
  992. $4 = 1;
  993. }
  994. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  995. fixpos($$, $1);
  996. }
  997. | primary_value '.' tCONSTANT tOP_ASGN arg
  998. {
  999. value_expr($5);
  1000. if ($4 == tOROP) {
  1001. $4 = 0;
  1002. }
  1003. else if ($4 == tANDOP) {
  1004. $4 = 1;
  1005. }
  1006. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  1007. fixpos($$, $1);
  1008. }
  1009. | primary_value tCOLON2 tIDENTIFIER tOP_ASGN arg
  1010. {
  1011. value_expr($5);
  1012. if ($4 == tOROP) {
  1013. $4 = 0;
  1014. }
  1015. else if ($4 == tANDOP) {
  1016. $4 = 1;
  1017. }
  1018. $$ = NEW_OP_ASGN2($1, $3, $4, $5);
  1019. fixpos($$, $1);
  1020. }
  1021. | primary_value tCOLON2 tCONSTANT tOP_ASGN arg
  1022. {
  1023. yyerror("constant re-assignment");
  1024. $$ = 0;
  1025. }
  1026. | tCOLON3 tCONSTANT tOP_ASGN arg
  1027. {
  1028. yyerror("constant re-assignment");
  1029. $$ = 0;
  1030. }
  1031. | backref tOP_ASGN arg
  1032. {
  1033. rb_backref_error($1, vps);
  1034. $$ = 0;
  1035. }
  1036. | arg tDOT2 arg
  1037. {
  1038. value_expr($1);
  1039. value_expr($3);
  1040. $$ = NEW_DOT2($1, $3);
  1041. }
  1042. | arg tDOT3 arg
  1043. {
  1044. value_expr($1);
  1045. value_expr($3);
  1046. $$ = NEW_DOT3($1, $3);
  1047. }
  1048. | arg '+' arg
  1049. {
  1050. $$ = call_op($1, '+', 1, $3, vps);
  1051. }
  1052. | arg '-' arg
  1053. {
  1054. $$ = call_op($1, '-', 1, $3, vps);
  1055. }
  1056. | arg '*' arg
  1057. {
  1058. $$ = call_op($1, '*', 1, $3, vps);
  1059. }
  1060. | arg '/' arg
  1061. {
  1062. $$ = call_op($1, '/', 1, $3, vps);
  1063. }
  1064. | arg '%' arg
  1065. {
  1066. $$ = call_op($1, '%', 1, $3, vps);
  1067. }
  1068. | arg tPOW arg
  1069. {
  1070. $$ = call_op($1, tPOW, 1, $3, vps);
  1071. }
  1072. | tUMINUS_NUM tINTEGER tPOW arg
  1073. {
  1074. $$ = call_op(call_op($2, tPOW, 1, $4, vps), tUMINUS, 0, 0, vps);
  1075. }
  1076. | tUMINUS_NUM tFLOAT tPOW arg
  1077. {
  1078. $$ = call_op(call_op($2, tPOW, 1, $4, vps), tUMINUS, 0, 0, vps);
  1079. }
  1080. | tUPLUS arg
  1081. {
  1082. if ($2 && nd_type($2) == NODE_LIT) {
  1083. $$ = $2;
  1084. }
  1085. else {
  1086. $$ = call_op($2, tUPLUS, 0, 0, vps);
  1087. }
  1088. }
  1089. | tUMINUS arg
  1090. {
  1091. $$ = call_op($2, tUMINUS, 0, 0, vps);
  1092. }
  1093. | arg '|' arg
  1094. {
  1095. $$ = call_op($1, '|', 1, $3, vps);
  1096. }
  1097. | arg '^' arg
  1098. {
  1099. $$ = call_op($1, '^', 1, $3, vps);
  1100. }
  1101. | arg '&' arg
  1102. {
  1103. $$ = call_op($1, '&', 1, $3, vps);
  1104. }
  1105. | arg tCMP arg
  1106. {
  1107. $$ = call_op($1, tCMP, 1, $3, vps);
  1108. }
  1109. | arg '>' arg
  1110. {
  1111. $$ = call_op($1, '>', 1, $3, vps);
  1112. }
  1113. | arg tGEQ arg
  1114. {
  1115. $$ = call_op($1, tGEQ, 1, $3, vps);
  1116. }
  1117. | arg '<' arg
  1118. {
  1119. $$ = call_op($1, '<', 1, $3, vps);
  1120. }
  1121. | arg tLEQ arg
  1122. {
  1123. $$ = call_op($1, tLEQ, 1, $3, vps);
  1124. }
  1125. | arg tEQ arg
  1126. {
  1127. $$ = call_op($1, tEQ, 1, $3, vps);
  1128. }
  1129. | arg tEQQ arg
  1130. {
  1131. $$ = call_op($1, tEQQ, 1, $3, vps);
  1132. }
  1133. | arg tNEQ arg
  1134. {
  1135. $$ = NEW_NOT(call_op($1, tEQ, 1, $3, vps));
  1136. }
  1137. | arg tMATCH arg
  1138. {
  1139. $$ = match_gen($1, $3, vps);
  1140. }
  1141. | arg tNMATCH arg
  1142. {
  1143. $$ = NEW_NOT(match_gen($1, $3, vps));
  1144. }
  1145. | '!' arg
  1146. {
  1147. $$ = NEW_NOT(cond($2, vps));
  1148. }
  1149. | '~' arg
  1150. {
  1151. $$ = call_op($2, '~', 0, 0, vps);
  1152. }
  1153. | arg tLSHFT arg
  1154. {
  1155. $$ = call_op($1, tLSHFT, 1, $3, vps);
  1156. }
  1157. | arg tRSHFT arg
  1158. {
  1159. $$ = call_op($1, tRSHFT, 1, $3, vps);
  1160. }
  1161. | arg tANDOP arg
  1162. {
  1163. $$ = logop(NODE_AND, $1, $3, vps);
  1164. }
  1165. | arg tOROP arg
  1166. {
  1167. $$ = logop(NODE_OR, $1, $3, vps);
  1168. }
  1169. | kDEFINED opt_nl {vps->in_defined = 1;} arg
  1170. {
  1171. vps->in_defined = 0;
  1172. $$ = NEW_DEFINED($4);
  1173. }
  1174. | arg '?' {vps->ternary_colon++;} arg ':' arg
  1175. {
  1176. $$ = NEW_IF(cond($1, vps), $4, $6);
  1177. fixpos($$, $1);
  1178. vps->ternary_colon--;
  1179. }
  1180. | primary
  1181. {
  1182. $$ = $1;
  1183. }
  1184. ;
  1185. arg_value : arg
  1186. {
  1187. value_expr($1);
  1188. $$ = $1;
  1189. }
  1190. ;
  1191. aref_args : none
  1192. | command opt_nl
  1193. {
  1194. rb_warn("parenthesize argument(s) for future version");
  1195. $$ = NEW_LIST($1);
  1196. }
  1197. | args trailer
  1198. {
  1199. $$ = $1;
  1200. }
  1201. | args ',' tSTAR arg opt_nl
  1202. {
  1203. value_expr($4);
  1204. $$ = arg_concat(vps, $1, $4);
  1205. }
  1206. | assocs trailer
  1207. {
  1208. $$ = NEW_LIST(NEW_HASH($1));
  1209. }
  1210. | tSTAR arg opt_nl
  1211. {
  1212. value_expr($2);
  1213. $$ = NEW_NEWLINE(NEW_SPLAT($2));
  1214. }
  1215. ;
  1216. paren_args : '(' none ')'
  1217. {
  1218. $$ = $2;
  1219. }
  1220. | '(' call_args opt_nl ')'
  1221. {
  1222. $$ = $2;
  1223. }
  1224. | '(' block_call opt_nl ')'
  1225. {
  1226. rb_warn("parenthesize argument for future version");
  1227. $$ = NEW_LIST($2);
  1228. }
  1229. | '(' args ',' block_call opt_nl ')'
  1230. {
  1231. rb_warn("parenthesize argument for future version");
  1232. $$ = list_append(vps, $2, $4);
  1233. }
  1234. ;
  1235. opt_paren_args : none
  1236. | paren_args
  1237. ;
  1238. call_args : command
  1239. {
  1240. rb_warn("parenthesize argument(s) for future version");
  1241. $$ = NEW_LIST($1);
  1242. }
  1243. | args opt_block_arg
  1244. {
  1245. $$ = arg_blk_pass($1, $2);
  1246. }
  1247. | args ',' tSTAR arg_value opt_block_arg
  1248. {
  1249. $$ = arg_concat(vps, $1, $4);
  1250. $$ = arg_blk_pass($$, $5);
  1251. }
  1252. | assocs opt_block_arg
  1253. {
  1254. $$ = NEW_LIST(NEW_HASH($1));
  1255. $$ = arg_blk_pass($$, $2);
  1256. }
  1257. | assocs ',' tSTAR arg_value opt_block_arg
  1258. {
  1259. $$ = arg_concat(vps, NEW_LIST(NEW_HASH($1)), $4);
  1260. $$ = arg_blk_pass($$, $5);
  1261. }
  1262. | args ',' assocs opt_block_arg
  1263. {
  1264. $$ = list_append(vps, $1, NEW_HASH($3));
  1265. $$ = arg_blk_pass($$, $4);
  1266. }
  1267. | args ',' assocs ',' tSTAR arg opt_block_arg
  1268. {
  1269. value_expr($6);
  1270. $$ = arg_concat(vps, list_append(vps, $1, NEW_HASH($3)), $6);
  1271. $$ = arg_blk_pass($$, $7);
  1272. }
  1273. | tSTAR arg_value opt_block_arg
  1274. {
  1275. $$ = arg_blk_pass(NEW_SPLAT($2), $3);
  1276. }
  1277. | block_arg
  1278. ;
  1279. call_args2 : arg_value ',' args opt_block_arg
  1280. {
  1281. $$ = arg_blk_pass(list_concat(NEW_LIST($1),$3), $4);
  1282. }
  1283. | arg_value ',' block_arg
  1284. {
  1285. $$ = arg_blk_pass($1, $3);
  1286. }
  1287. | arg_value ',' tSTAR arg_value opt_block_arg
  1288. {
  1289. $$ = arg_concat(vps, NEW_LIST($1), $4);
  1290. $$ = arg_blk_pass($$, $5);
  1291. }
  1292. | arg_value ',' args ',' tSTAR arg_value opt_block_arg
  1293. {
  1294. $$ = arg_concat(vps, list_concat(NEW_LIST($1),$3), $6);
  1295. $$ = arg_blk_pass($$, $7);
  1296. }
  1297. | assocs opt_block_arg
  1298. {
  1299. $$ = NEW_LIST(NEW_HASH($1));
  1300. $$ = arg_blk_pass($$, $2);
  1301. }
  1302. | assocs ',' tSTAR arg_value opt_block_arg
  1303. {
  1304. $$ = arg_concat(vps, NEW_LIST(NEW_HASH($1)), $4);
  1305. $$ = arg_blk_pass($$, $5);
  1306. }
  1307. | arg_value ',' assocs opt_block_arg
  1308. {
  1309. $$ = list_append(vps, NEW_LIST($1), NEW_HASH($3));
  1310. $$ = arg_blk_pass($$, $4);
  1311. }
  1312. | arg_value ',' args ',' assocs opt_block_arg
  1313. {
  1314. $$ = list_append(vps, list_concat(NEW_LIST($1),$3), NEW_HASH($5));
  1315. $$ = arg_blk_pass($$, $6);
  1316. }
  1317. | arg_value ',' assocs ',' tSTAR arg_value opt_block_arg
  1318. {
  1319. $$ = arg_concat(vps, list_append(vps, NEW_LIST($1), NEW_HASH($3)), $6);
  1320. $$ = arg_blk_pass($$, $7);
  1321. }
  1322. | arg_value ',' args ',' assocs ',' tSTAR arg_value opt_block_arg
  1323. {
  1324. $$ = arg_concat(vps, list_append(vps,
  1325. list_concat(NEW_LIST($1), $3), NEW_HASH($5)), $8);
  1326. $$ = arg_blk_pass($$, $9);
  1327. }
  1328. | tSTAR arg_value opt_block_arg
  1329. {
  1330. $$ = arg_blk_pass(NEW_SPLAT($2), $3);
  1331. }
  1332. | block_arg
  1333. ;
  1334. command_args : {
  1335. $<num>$ = vps->cmdarg_stack;
  1336. CMDARG_PUSH(1);
  1337. }
  1338. open_args
  1339. {
  1340. /* CMDARG_POP() */
  1341. vps->cmdarg_stack = $<num>1;
  1342. $$ = $2;
  1343. }
  1344. ;
  1345. open_args : call_args
  1346. | tLPAREN_ARG {vps->lex_state = EXPR_ENDARG;} ')'
  1347. {
  1348. rb_warn("don't put space before argument parentheses");
  1349. $$ = 0;
  1350. }
  1351. | tLPAREN_ARG call_args2 {vps->lex_state = EXPR_ENDARG;} ')'
  1352. {
  1353. rb_warn("don't put space before argument parentheses");
  1354. $$ = $2;
  1355. }
  1356. ;
  1357. block_arg : tAMPER arg_value
  1358. {
  1359. $$ = NEW_BLOCK_PASS($2);
  1360. }
  1361. ;
  1362. opt_block_arg : ',' block_arg
  1363. {
  1364. $$ = $2;
  1365. }
  1366. | none
  1367. ;
  1368. args : arg_value
  1369. {
  1370. $$ = NEW_LIST($1);
  1371. }
  1372. | args ',' arg_value
  1373. {
  1374. $$ = list_append(vps, $1, $3);
  1375. }
  1376. ;
  1377. mrhs : args ',' arg_value
  1378. {
  1379. $$ = list_append(vps, $1, $3);
  1380. }
  1381. | args ',' tSTAR arg_value
  1382. {
  1383. $$ = arg_concat(vps, $1, $4);
  1384. }
  1385. | tSTAR arg_value
  1386. {
  1387. $$ = NEW_SPLAT($2);
  1388. }
  1389. ;
  1390. primary : literal
  1391. | strings
  1392. | xstring
  1393. | regexp
  1394. | words
  1395. | qwords
  1396. | var_ref
  1397. | backref
  1398. | tFID
  1399. {
  1400. $$ = NEW_FCALL($1, 0);
  1401. }
  1402. | kBEGIN
  1403. {
  1404. $<num>1 = ruby_sourceline;
  1405. }
  1406. bodystmt
  1407. kEND
  1408. {
  1409. if ($3 == NULL)
  1410. $$ = NEW_NIL();
  1411. else
  1412. $$ = NEW_BEGIN($3);
  1413. nd_set_line($$, $<num>1);
  1414. }
  1415. | tLPAREN_ARG expr {vps->lex_state = EXPR_ENDARG;} opt_nl ')'
  1416. {
  1417. rb_warning("(...) interpreted as grouped expression");
  1418. $$ = $2;
  1419. }
  1420. | tLPAREN compstmt ')'
  1421. {
  1422. if (!$2) $$ = NEW_NIL();
  1423. $$ = $2;
  1424. }
  1425. | primary_value tCOLON2 tCONSTANT
  1426. {
  1427. $$ = NEW_COLON2($1, $3);
  1428. }
  1429. | tCOLON3 tCONSTANT
  1430. {
  1431. $$ = NEW_COLON3($2);
  1432. }
  1433. | primary_value '[' aref_args ']'
  1434. {
  1435. if ($1 && nd_type($1) == NODE_SELF) {
  1436. $$ = NEW_FCALL(convert_op(tAREF), $3);
  1437. } else {
  1438. $$ = NEW_CALL($1, convert_op(tAREF), $3);
  1439. }
  1440. fixpos($$, $1);
  1441. }
  1442. | tLBRACK aref_args ']'
  1443. {
  1444. if ($2 == 0) {
  1445. $$ = NEW_ZARRAY(); /* zero length array*/
  1446. }
  1447. else {
  1448. $$ = $2;
  1449. }
  1450. }
  1451. | tLBRACE assoc_list '}'
  1452. {
  1453. $$ = NEW_HASH($2);
  1454. }
  1455. | kRETURN
  1456. {
  1457. $$ = NEW_RETURN(0);
  1458. }
  1459. | kYIELD '(' call_args ')'
  1460. {
  1461. $$ = new_yield(vps, $3);
  1462. }
  1463. | kYIELD '(' ')'
  1464. {
  1465. $$ = NEW_YIELD(0, Qfalse);
  1466. }
  1467. | kYIELD
  1468. {
  1469. $$ = NEW_YIELD(0, Qfalse);
  1470. }
  1471. | kDEFINED opt_nl '(' {vps->in_defined = 1;} expr ')'
  1472. {
  1473. vps->in_defined = 0;
  1474. $$ = NEW_DEFINED($5);
  1475. }
  1476. | operation brace_block
  1477. {
  1478. $2->nd_iter = NEW_FCALL($1, 0);
  1479. $$ = $2;
  1480. fixpos($2->nd_iter, $2);
  1481. }
  1482. | method_call
  1483. | method_call brace_block
  1484. {
  1485. if ($1 && nd_type($1) == NODE_BLOCK_PASS) {
  1486. rb_compile_error(vps, "both block arg and actual block given");
  1487. }
  1488. $2->nd_iter = $1;
  1489. $$ = $2;
  1490. fixpos($$, $1);
  1491. }
  1492. | kIF expr_value then
  1493. compstmt
  1494. if_tail
  1495. kEND
  1496. {
  1497. $$ = NEW_IF(cond($2, vps), $4, $5);
  1498. fixpos($$, $2);
  1499. if (cond_negative(&$$->nd_cond)) {
  1500. NODE *tmp = $$->nd_body;
  1501. $$->nd_body = $$->nd_else;
  1502. $$->nd_else = tmp;
  1503. }
  1504. }
  1505. | kUNLESS expr_value then
  1506. compstmt
  1507. opt_else
  1508. kEND
  1509. {
  1510. $$ = NEW_UNLESS(cond($2, vps), $4, $5);
  1511. fixpos($$, $2);
  1512. if (cond_negative(&$$->nd_cond)) {
  1513. NODE *tmp = $$->nd_body;
  1514. $$->nd_body = $$->nd_else;
  1515. $$->nd_else = tmp;
  1516. }
  1517. }
  1518. | kWHILE {COND_PUSH(1);} expr_value do {COND_POP();}
  1519. compstmt
  1520. kEND
  1521. {
  1522. $$ = NEW_WHILE(cond($3, vps), $6, 1);
  1523. fixpos($$, $3);
  1524. if (cond_negative(&$$->nd_cond)) {
  1525. nd_set_type($$, NODE_UNTIL);
  1526. }
  1527. }
  1528. | kUNTIL {COND_PUSH(1);} expr_value do {COND_POP();}
  1529. compstmt
  1530. kEND
  1531. {
  1532. $$ = NEW_UNTIL(cond($3, vps), $6, 1);
  1533. fixpos($$, $3);
  1534. if (cond_negative(&$$->nd_cond)) {
  1535. nd_set_type($$, NODE_WHILE);
  1536. }
  1537. }
  1538. | kCASE expr_value opt_terms
  1539. case_body
  1540. kEND
  1541. {
  1542. $$ = NEW_CASE($2, $4);
  1543. fixpos($$, $2);
  1544. }
  1545. | kCASE opt_terms case_body kEND
  1546. {
  1547. $$ = $3;
  1548. }
  1549. | kCASE opt_terms kELSE compstmt kEND
  1550. {
  1551. $$ = $4;
  1552. }
  1553. | kFOR block_var kIN {COND_PUSH(1);} expr_value do {COND_POP();}
  1554. compstmt
  1555. kEND
  1556. {
  1557. $$ = NEW_FOR($2, $5, $8);
  1558. fixpos($$, $2);
  1559. }
  1560. | kCLASS cpath superclass
  1561. {
  1562. if (in_def || in_single)
  1563. yyerror("class definition in method body");
  1564. class_nest++;
  1565. local_push(0);
  1566. $<num>$ = ruby_sourceline;
  1567. }
  1568. bodystmt
  1569. kEND
  1570. {
  1571. $$ = NEW_CLASS($2, $5, $3);
  1572. nd_set_line($$, $<num>4);
  1573. local_pop();
  1574. class_nest--;
  1575. }
  1576. | kCLASS tLSHFT expr
  1577. {
  1578. $<num>$ = in_def;
  1579. in_def = 0;
  1580. }
  1581. term
  1582. {
  1583. $<num>$ = in_single;
  1584. in_single = 0;
  1585. class_nest++;
  1586. local_push(0);
  1587. }
  1588. bodystmt
  1589. kEND
  1590. {
  1591. $$ = NEW_SCLASS($3, $7);
  1592. fixpos($$, $3);
  1593. local_pop();
  1594. class_nest--;
  1595. in_def = $<num>4;
  1596. in_single = $<num>6;
  1597. }
  1598. | kMODULE cpath
  1599. {
  1600. if (in_def || in_single)
  1601. yyerror("module definition in method body");
  1602. class_nest++;
  1603. local_push(0);
  1604. $<num>$ = ruby_sourceline;
  1605. }
  1606. bodystmt
  1607. kEND
  1608. {
  1609. $$ = NEW_MODULE($2, $4);
  1610. nd_set_line($$, $<num>3);
  1611. local_pop();
  1612. class_nest--;
  1613. }
  1614. | kDEF fname
  1615. {
  1616. $<id>$ = cur_mid;
  1617. cur_mid = $2;
  1618. in_def++;
  1619. local_push(0);
  1620. }
  1621. f_arglist
  1622. bodystmt
  1623. kEND
  1624. {
  1625. if (!$5) $5 = NEW_NIL();
  1626. $$ = NEW_DEFN($2, $4, $5, NOEX_PRIVATE);
  1627. fixpos($$, $4);
  1628. local_pop();
  1629. in_def--;
  1630. cur_mid = $<id>3;
  1631. }
  1632. | kDEF singleton dot_or_colon {vps->lex_state = EXPR_FNAME;} fname
  1633. {
  1634. in_single++;
  1635. local_push(0);
  1636. vps->lex_state = EXPR_END; /* force for args */
  1637. }
  1638. f_arglist
  1639. bodystmt
  1640. kEND
  1641. {
  1642. $$ = NEW_DEFS($2, $5, $7, $8);
  1643. fixpos($$, $2);
  1644. local_pop();
  1645. in_single--;
  1646. }
  1647. | kBREAK
  1648. {
  1649. $$ = NEW_BREAK(0);
  1650. }
  1651. | kNEXT
  1652. {
  1653. $$ = NEW_NEXT(0);
  1654. }
  1655. | kREDO
  1656. {
  1657. $$ = NEW_REDO();
  1658. }
  1659. | kRETRY
  1660. {
  1661. $$ = NEW_RETRY();
  1662. }
  1663. ;
  1664. primary_value : primary
  1665. {
  1666. value_expr($1);
  1667. $$ = $1;
  1668. }
  1669. ;
  1670. then : term
  1671. | ':'
  1672. | kTHEN
  1673. | term kTHEN
  1674. ;
  1675. do : term
  1676. | ':'
  1677. | kDO_COND
  1678. ;
  1679. if_tail : opt_else
  1680. | kELSIF expr_value then
  1681. compstmt
  1682. if_tail
  1683. {
  1684. $$ = NEW_IF(cond($2, vps), $4, $5);
  1685. fixpos($$, $2);
  1686. }
  1687. ;
  1688. opt_else : none
  1689. | kELSE compstmt
  1690. {
  1691. $$ = $2;
  1692. }
  1693. ;
  1694. block_var : lhs
  1695. | mlhs
  1696. ;
  1697. opt_block_var : none
  1698. | '|' /* none */ '|'
  1699. {
  1700. $$ = (NODE*)1;
  1701. }
  1702. | tOROP
  1703. {
  1704. $$ = (NODE*)1;
  1705. }
  1706. | '|' block_var '|'
  1707. {
  1708. $$ = $2;
  1709. }
  1710. ;
  1711. do_block : kDO_BLOCK
  1712. {
  1713. $<num>1 = ruby_sourceline;
  1714. reset_block(vps);
  1715. }
  1716. opt_block_var
  1717. {
  1718. $<vars>$ = vps->block_vars;
  1719. }
  1720. compstmt
  1721. kEND
  1722. {
  1723. $$ = NEW_ITER($3, 0, extract_block_vars(vps, $5, $<vars>4));
  1724. nd_set_line($$, $<num>1);
  1725. }
  1726. ;
  1727. block_call : command do_block
  1728. {
  1729. if ($1 && nd_type($1) == NODE_BLOCK_PASS) {
  1730. rb_compile_error(vps, "both block arg and actual block given");
  1731. }
  1732. $2->nd_iter = $1;
  1733. $$ = $2;
  1734. fixpos($$, $1);
  1735. }
  1736. | block_call '.' operation2 opt_paren_args
  1737. {
  1738. $$ = new_call(vps, $1, $3, $4);
  1739. }
  1740. | block_call tCOLON2 operation2 opt_paren_args
  1741. {
  1742. $$ = new_call(vps, $1, $3, $4);
  1743. }
  1744. ;
  1745. method_call : operation paren_args
  1746. {
  1747. $$ = new_fcall(vps, $1, $2);
  1748. fixpos($$, $2);
  1749. }
  1750. | primary_value '.' operation2 opt_paren_args
  1751. {
  1752. $$ = new_call(vps, $1, $3, $4);
  1753. fixpos($$, $1);
  1754. }
  1755. | primary_value tCOLON2 operation2 paren_args
  1756. {
  1757. $$ = new_call(vps, $1, $3, $4);
  1758. fixpos($$, $1);
  1759. }
  1760. | primary_value tCOLON2 operation3
  1761. {
  1762. $$ = new_call(vps, $1, $3, 0);
  1763. }
  1764. | primary_value '\\' operation2
  1765. {
  1766. $$ = NEW_CALL($1, rb_intern("get_reference"), NEW_LIST(NEW_LIT(ID2SYM($3))));
  1767. }
  1768. | tUBS operation2
  1769. {
  1770. $$ = NEW_FCALL(rb_intern("get_reference"), NEW_LIST(NEW_LIT(ID2SYM($2))));
  1771. }
  1772. | kSUPER paren_args
  1773. {
  1774. $$ = new_super(vps, $2);
  1775. }
  1776. | kSUPER
  1777. {
  1778. $$ = NEW_ZSUPER();
  1779. }
  1780. ;
  1781. brace_block : '{'
  1782. {
  1783. $<num>1 = ruby_sourceline;
  1784. reset_block(vps);
  1785. }
  1786. opt_block_var { $<vars>$ = vps->block_vars; }
  1787. compstmt '}'
  1788. {
  1789. $$ = NEW_ITER($3, 0, extract_block_vars(vps, $5, $<vars>4));
  1790. nd_set_line($$, $<num>1);
  1791. }
  1792. | kDO
  1793. {
  1794. $<num>1 = ruby_sourceline;
  1795. reset_block(vps);
  1796. }
  1797. opt_block_var { $<vars>$ = vps->block_vars; }
  1798. compstmt kEND
  1799. {
  1800. $$ = NEW_ITER($3, 0, extract_block_vars(vps, $5, $<vars>4));
  1801. nd_set_line($$, $<num>1);
  1802. }
  1803. ;
  1804. case_body : kWHEN when_args then
  1805. compstmt
  1806. cases
  1807. {
  1808. $$ = NEW_WHEN($2, $4, $5);
  1809. }
  1810. ;
  1811. when_args : args
  1812. | args ',' tSTAR arg_value
  1813. {
  1814. $$ = list_append(vps, $1, NEW_WHEN($4, 0, 0));
  1815. }
  1816. | tSTAR arg_value
  1817. {
  1818. $$ = NEW_LIST(NEW_WHEN($2, 0, 0));
  1819. }
  1820. ;
  1821. cases : opt_else
  1822. | case_body
  1823. ;
  1824. opt_rescue : kRESCUE exc_list exc_var then
  1825. compstmt
  1826. opt_rescue
  1827. {
  1828. if ($3) {
  1829. $3 = node_assign($3, NEW_GVAR(rb_intern("$!")), vps);
  1830. $5 = block_append(vps, $3, $5);
  1831. }
  1832. $$ = NEW_RESBODY($2, $5, $6);
  1833. fixpos($$, $2?$2:$5);
  1834. }
  1835. | none
  1836. ;
  1837. exc_list : arg_value
  1838. {
  1839. $$ = NEW_LIST($1);
  1840. }
  1841. | mrhs
  1842. | none
  1843. ;
  1844. exc_var : tASSOC lhs
  1845. {
  1846. $$ = $2;
  1847. }
  1848. | none
  1849. ;
  1850. opt_ensure : kENSURE compstmt
  1851. {
  1852. if ($2)
  1853. $$ = $2;
  1854. else
  1855. /* place holder */
  1856. $$ = NEW_NIL();
  1857. }
  1858. | none
  1859. ;
  1860. literal : numeric
  1861. | symbol
  1862. {
  1863. $$ = NEW_LIT(ID2SYM($1));
  1864. }
  1865. | dsym
  1866. ;
  1867. strings : string
  1868. {
  1869. NODE *node = $1;
  1870. if (!node) {
  1871. node = NEW_STR(string_new(0, 0));
  1872. }
  1873. else {
  1874. node = evstr2dstr(vps, node);
  1875. }
  1876. $$ = node;
  1877. }
  1878. ;
  1879. string : string1
  1880. | string string1
  1881. {
  1882. $$ = literal_concat(vps, $1, $2);
  1883. }
  1884. ;
  1885. string1 : tSTRING_BEG string_contents tSTRING_END
  1886. {
  1887. $$ = $2;
  1888. }
  1889. ;
  1890. xstring : tXSTRING_BEG xstring_contents tSTRING_END
  1891. {
  1892. NODE *node = $2;
  1893. if (!node) {
  1894. node = NEW_XSTR(string_new(0, 0));
  1895. }
  1896. else {
  1897. switch (nd_type(node)) {
  1898. case NODE_STR:
  1899. nd_set_type(node, NODE_XSTR);
  1900. break;
  1901. case NODE_DSTR:
  1902. nd_set_type(node, NODE_DXSTR);
  1903. break;
  1904. default:
  1905. node = NEW_NODE(NODE_DXSTR, string_new(0, 0), 1, NEW_LIST(node));
  1906. break;
  1907. }
  1908. }
  1909. $$ = node;
  1910. }
  1911. ;
  1912. regexp : tREGEXP_BEG xstring_contents tREGEXP_END
  1913. {
  1914. intptr_t options = $3;
  1915. NODE *node = $2;
  1916. if (!node) {
  1917. node = NEW_REGEX(string_new2(""), options & ~RE_OPTION_ONCE);
  1918. }
  1919. else switch (nd_type(node)) {
  1920. case NODE_STR:
  1921. {
  1922. nd_set_type(node, NODE_REGEX);
  1923. node->nd_cnt = options & ~RE_OPTION_ONCE;
  1924. /*
  1925. node->nd_lit = rb_reg_new(RSTRING(src)->ptr,
  1926. RSTRING(src)->len,
  1927. options & ~RE_OPTION_ONCE);
  1928. */
  1929. }
  1930. break;
  1931. default:
  1932. node = NEW_NODE(NODE_DSTR, string_new(0, 0), 1, NEW_LIST(node));
  1933. case NODE_DSTR:
  1934. if (options & RE_OPTION_ONCE) {
  1935. nd_set_type(node, NODE_DREGX_ONCE);
  1936. }
  1937. else {
  1938. nd_set_type(node, NODE_DREGX);
  1939. }
  1940. node->nd_cflag = options & ~RE_OPTION_ONCE;
  1941. break;
  1942. }
  1943. $$ = node;
  1944. }
  1945. ;
  1946. words : tWORDS_BEG ' ' tSTRING_END
  1947. {
  1948. $$ = NEW_ZARRAY();
  1949. }
  1950. | tWORDS_BEG word_list tSTRING_END
  1951. {
  1952. $$ = $2;
  1953. }
  1954. ;
  1955. word_list : /* none */
  1956. {
  1957. $$ = 0;
  1958. }
  1959. | word_list word ' '
  1960. {
  1961. $$ = list_append(vps, $1, evstr2dstr(vps, $2));
  1962. }
  1963. ;
  1964. word : string_content
  1965. | word string_content
  1966. {
  1967. $$ = literal_concat(vps, $1, $2);
  1968. }
  1969. ;
  1970. qwords : tQWORDS_BEG ' ' tSTRING_END
  1971. {
  1972. $$ = NEW_ZARRAY();
  1973. }
  1974. | tQWORDS_BEG qword_list tSTRING_END
  1975. {
  1976. $$ = $2;
  1977. }
  1978. ;
  1979. qword_list : /* none */
  1980. {
  1981. $$ = 0;
  1982. }
  1983. | qword_list tSTRING_CONTENT ' '
  1984. {
  1985. $$ = list_append(vps, $1, $2);
  1986. }
  1987. ;
  1988. string_contents : /* none */
  1989. {
  1990. $$ = 0;
  1991. }
  1992. | string_contents string_content
  1993. {
  1994. $$ = literal_concat(vps, $1, $2);
  1995. }
  1996. ;
  1997. xstring_contents: /* none */
  1998. {
  1999. $$ = 0;
  2000. }
  2001. | xstring_contents string_content
  2002. {
  2003. $$ = literal_concat(vps, $1, $2);
  2004. }
  2005. ;
  2006. string_content : tSTRING_CONTENT
  2007. | tSTRING_DVAR
  2008. {
  2009. $<node>$ = lex_strterm;
  2010. lex_strterm = 0;
  2011. vps->lex_state = EXPR_BEG;
  2012. }
  2013. string_dvar
  2014. {
  2015. lex_strterm = $<node>2;
  2016. $$ = NEW_EVSTR($3);
  2017. }
  2018. | tSTRING_DBEG
  2019. {
  2020. $<node>$ = lex_strterm;
  2021. lex_strterm = 0;
  2022. vps->lex_state = EXPR_BEG;
  2023. COND_PUSH(0);
  2024. CMDARG_PUSH(0);
  2025. }
  2026. compstmt '}'
  2027. {
  2028. lex_strterm = $<node>2;
  2029. COND_LEXPOP();
  2030. CMDARG_LEXPOP();
  2031. if (($$ = $3) && nd_type($$) == NODE_NEWLINE) {
  2032. $$ = $$->nd_next;
  2033. }
  2034. $$ = new_evstr(vps, $$);
  2035. }
  2036. ;
  2037. string_dvar : tGVAR {$$ = NEW_GVAR($1);}
  2038. | tIVAR {$$ = NEW_IVAR($1);}
  2039. | tCVAR {$$ = NEW_CVAR($1);}
  2040. | backref
  2041. ;
  2042. symbol : tSYMBEG sym
  2043. {
  2044. vps->lex_state = EXPR_END;
  2045. $$ = $2;
  2046. }
  2047. ;
  2048. sym : fname
  2049. | tIVAR
  2050. | tGVAR
  2051. | tCVAR
  2052. ;
  2053. dsym : tSYMBEG xstring_contents tSTRING_END
  2054. {
  2055. vps->lex_state = EXPR_END;
  2056. if (!($$ = $2)) {
  2057. yyerror("empty symbol literal");
  2058. }
  2059. else {
  2060. switch (nd_type($$)) {
  2061. case NODE_DSTR:
  2062. nd_set_type($$, NODE_DSYM);
  2063. break;
  2064. case NODE_STR:
  2065. /* TODO: this line should never fail unless nd_str is binary */
  2066. if (strlen(bdatae($$->nd_str,"")) == (size_t)blength($$->nd_str)) {
  2067. ID tmp = rb_intern(bdata($$->nd_str));
  2068. bdestroy($$->nd_str);
  2069. $$->nd_lit = ID2SYM(tmp);
  2070. nd_set_type($$, NODE_LIT);
  2071. break;
  2072. } else {
  2073. bdestroy($$->nd_str);
  2074. }
  2075. /* fall through */
  2076. default:
  2077. $$ = NEW_NODE(NODE_DSYM, string_new(0, 0), 1, NEW_LIST($$));
  2078. break;
  2079. }
  2080. }
  2081. }
  2082. ;
  2083. numeric : tINTEGER
  2084. | tFLOAT
  2085. | tUMINUS_NUM tINTEGER %prec tLOWEST
  2086. {
  2087. $$ = NEW_NEGATE($2);
  2088. }
  2089. | tUMINUS_NUM tFLOAT %prec tLOWEST
  2090. {
  2091. $$ = NEW_NEGATE($2);
  2092. }
  2093. ;
  2094. variable : tIDENTIFIER
  2095. | tIVAR
  2096. | tGVAR
  2097. | tCONSTANT
  2098. | tCVAR
  2099. | kNIL {$$ = kNIL;}
  2100. | kSELF {$$ = kSELF;}
  2101. | kTRUE {$$ = kTRUE;}
  2102. | kFALSE {$$ = kFALSE;}
  2103. | k__FILE__ {$$ = k__FILE__;}
  2104. | k__LINE__ {$$ = k__LINE__;}
  2105. ;
  2106. var_ref : variable
  2107. {
  2108. $$ = gettable($1);
  2109. }
  2110. ;
  2111. var_lhs : variable
  2112. {
  2113. $$ = assignable($1, 0, vps);
  2114. }
  2115. ;
  2116. backref : tNTH_REF
  2117. | tBACK_REF
  2118. ;
  2119. superclass : term
  2120. {
  2121. $$ = 0;
  2122. }
  2123. | '<'
  2124. {
  2125. vps->lex_state = EXPR_BEG;
  2126. }
  2127. expr_value term
  2128. {
  2129. $$ = $3;
  2130. }
  2131. | error term {yyerrok; $$ = 0;}
  2132. ;
  2133. f_arglist : '(' f_args opt_nl ')'
  2134. {
  2135. $$ = $2;
  2136. vps->lex_state = EXPR_BEG;
  2137. }
  2138. | f_args term
  2139. {
  2140. $$ = $1;
  2141. }
  2142. ;
  2143. f_args : f_arg ',' f_optarg ',' f_rest_arg opt_f_block_arg
  2144. {
  2145. $$ = block_append(vps, NEW_ARGS((intptr_t)$1, $3, $5), $6);
  2146. }
  2147. | f_arg ',' f_optarg opt_f_block_arg
  2148. {
  2149. $$ = block_append(vps, NEW_ARGS((intptr_t)$1, $3, 0), $4);
  2150. }
  2151. | f_arg ',' f_rest_arg opt_f_block_arg
  2152. {
  2153. $$ = block_append(vps, NEW_ARGS((intptr_t)$1, 0, $3), $4);
  2154. }
  2155. | f_arg opt_f_block_arg
  2156. {
  2157. $$ = block_append(vps, NEW_ARGS((intptr_t)$1, 0, 0), $2);
  2158. }
  2159. | f_optarg ',' f_rest_arg opt_f_block_arg
  2160. {
  2161. $$ = block_append(vps, NEW_ARGS(0, $1, $3), $4);
  2162. }
  2163. | f_optarg opt_f_block_arg
  2164. {
  2165. $$ = block_append(vps, NEW_ARGS(0, $1, 0), $2);
  2166. }
  2167. | f_rest_arg opt_f_block_arg
  2168. {
  2169. $$ = block_append(vps, NEW_ARGS(0, 0, $1), $2);
  2170. }
  2171. | f_block_arg
  2172. {
  2173. $$ = block_append(vps, NEW_ARGS(0, 0, 0), $1);
  2174. }
  2175. | /* none */
  2176. {
  2177. $$ = NEW_ARGS(0, 0, 0);
  2178. }
  2179. ;
  2180. f_norm_arg : tCONSTANT
  2181. {
  2182. yyerror("formal argument cannot be a constant");
  2183. }
  2184. | tIVAR
  2185. {
  2186. yyerror("formal argument cannot be an instance variable");
  2187. }
  2188. | tGVAR
  2189. {
  2190. yyerror("formal argument cannot be a global variable");
  2191. }
  2192. | tCVAR
  2193. {
  2194. yyerror("formal argument cannot be a class variable");
  2195. }
  2196. | tIDENTIFIER
  2197. {
  2198. if (!is_local_id($1))
  2199. yyerror("formal argument must be local variable");
  2200. else if (local_id($1))
  2201. yyerror("duplicate argument name");
  2202. local_cnt($1);
  2203. $$ = 1;
  2204. }
  2205. ;
  2206. f_arg : f_norm_arg
  2207. | f_arg ',' f_norm_arg
  2208. {
  2209. $$ += 1;
  2210. }
  2211. ;
  2212. f_opt : tIDENTIFIER '=' arg_value
  2213. {
  2214. if (!is_local_id($1))
  2215. yyerror("formal argument must be local variable");
  2216. else if (local_id($1))
  2217. yyerror("duplicate optional argument name");
  2218. $$ = assignable($1, $3, vps);
  2219. }
  2220. ;
  2221. f_optarg : f_opt
  2222. {
  2223. $$ = NEW_BLOCK($1);
  2224. $$->nd_end = $$;
  2225. }
  2226. | f_optarg ',' f_opt
  2227. {
  2228. $$ = block_append(vps, $1, $3);
  2229. }
  2230. ;
  2231. restarg_mark : '*'
  2232. | tSTAR
  2233. ;
  2234. f_rest_arg : restarg_mark tIDENTIFIER
  2235. {
  2236. if (!is_local_id($2))
  2237. yyerror("rest argument must be local variable");
  2238. else if (local_id($2))
  2239. yyerror("duplicate rest argument name");
  2240. $$ = local_cnt($2) + 1;
  2241. }
  2242. | restarg_mark
  2243. {
  2244. $$ = -2;
  2245. }
  2246. ;
  2247. blkarg_mark : '&'
  2248. | tAMPER
  2249. ;
  2250. f_block_arg : blkarg_mark tIDENTIFIER
  2251. {
  2252. if (!is_local_id($2))
  2253. yyerror("block argument must be local variable");
  2254. else if (local_id($2))
  2255. yyerror("duplicate block argument name");
  2256. $$ = NEW_BLOCK_ARG($2);
  2257. }
  2258. ;
  2259. opt_f_block_arg : ',' f_block_arg
  2260. {
  2261. $$ = $2;
  2262. }
  2263. | none
  2264. ;
  2265. singleton : var_ref
  2266. {
  2267. $$ = $1;
  2268. value_expr($$);
  2269. }
  2270. | '(' {vps->lex_state = EXPR_BEG;} expr opt_nl ')'
  2271. {
  2272. if ($3 == 0) {
  2273. yyerror("can't define singleton method for ().");
  2274. }
  2275. else {
  2276. switch (nd_type($3)) {
  2277. case NODE_STR:
  2278. case NODE_DSTR:
  2279. case NODE_XSTR:
  2280. case NODE_DXSTR:
  2281. case NODE_DREGX:
  2282. case NODE_LIT:
  2283. case NODE_ARRAY:
  2284. case NODE_ZARRAY:
  2285. yyerror("can't define singleton method for literals");
  2286. default:
  2287. value_expr($3);
  2288. break;
  2289. }
  2290. }
  2291. $$ = $3;
  2292. }
  2293. ;
  2294. assoc_list : none
  2295. | assocs trailer
  2296. {
  2297. $$ = $1;
  2298. }
  2299. | args trailer
  2300. {
  2301. if ($1->nd_alen%2 != 0) {
  2302. yyerror("odd number list for Hash");
  2303. }
  2304. $$ = $1;
  2305. }
  2306. ;
  2307. assocs : assoc
  2308. | assocs ',' assoc
  2309. {
  2310. $$ = list_concat($1, $3);
  2311. }
  2312. ;
  2313. assoc : arg_value tASSOC arg_value
  2314. {
  2315. $$ = list_append(vps, NEW_LIST($1), $3);
  2316. }
  2317. ;
  2318. operation : tIDENTIFIER
  2319. | tCONSTANT
  2320. | tFID
  2321. ;
  2322. operation2 : tIDENTIFIER
  2323. | tCONSTANT
  2324. | tFID
  2325. | op
  2326. ;
  2327. operation3 : tIDENTIFIER
  2328. | tFID
  2329. | op
  2330. ;
  2331. dot_or_colon : '.'
  2332. | tCOLON2
  2333. ;
  2334. opt_terms : /* none */
  2335. | terms
  2336. ;
  2337. opt_nl : /* none */
  2338. | '\n'
  2339. ;
  2340. trailer : /* none */
  2341. | '\n'
  2342. | ','
  2343. ;
  2344. term : ';' {yyerrok;}
  2345. | '\n'
  2346. ;
  2347. terms : term
  2348. | terms ';' {yyerrok;}
  2349. ;
  2350. none : /* none */ {$$ = 0;}
  2351. ;
  2352. %%
  2353. /* We remove any previous definition of `SIGN_EXTEND_CHAR',
  2354. since ours (we hope) works properly with all combinations of
  2355. machines, compilers, `char' and `unsigned char' argument types.
  2356. (Per Bothner suggested the basic approach.) */
  2357. #undef SIGN_EXTEND_CHAR
  2358. #if __STDC__
  2359. # define SIGN_EXTEND_CHAR(c) ((signed char)(c))
  2360. #else /* not __STDC__ */
  2361. /* As in Harbison and Steele. */
  2362. # define SIGN_EXTEND_CHAR(c) ((((unsigned char)(c)) ^ 128) - 128)
  2363. #endif
  2364. #define is_identchar(c) (SIGN_EXTEND_CHAR(c)!=-1&&(ISALNUM(c) || (c) == '_' || ismbchar(c)))
  2365. #define LEAVE_BS 1
  2366. static int
  2367. syd_yyerror(const char *msg, rb_parse_state *parse_state)
  2368. {
  2369. create_error(parse_state, (char *)msg);
  2370. return 1;
  2371. }
  2372. static int
  2373. yycompile(rb_parse_state *parse_state, char *f, int line)
  2374. {
  2375. int n;
  2376. /* Setup an initial empty scope. */
  2377. heredoc_end = 0;
  2378. lex_strterm = 0;
  2379. ruby_sourcefile = f;
  2380. n = yyparse(parse_state);
  2381. ruby_debug_lines = 0;
  2382. compile_for_eval = 0;
  2383. parse_state->cond_stack = 0;
  2384. parse_state->cmdarg_stack = 0;
  2385. command_start = TRUE;
  2386. class_nest = 0;
  2387. in_single = 0;
  2388. in_def = 0;
  2389. cur_mid = 0;
  2390. lex_strterm = 0;
  2391. return n;
  2392. }
  2393. static bool
  2394. lex_get_str(rb_parse_state *parse_state)
  2395. {
  2396. const char *str;
  2397. const char *beg, *end, *pend;
  2398. int sz;
  2399. str = bdata(parse_state->lex_string);
  2400. beg = str;
  2401. if (parse_state->lex_str_used) {
  2402. if (blength(parse_state->lex_string) == parse_state->lex_str_used) {
  2403. return false;
  2404. }
  2405. beg += parse_state->lex_str_used;
  2406. }
  2407. pend = str + blength(parse_state->lex_string);
  2408. end = beg;
  2409. while(end < pend) {
  2410. if(*end++ == '\n') break;
  2411. }
  2412. sz = end - beg;
  2413. bcatblk(parse_state->line_buffer, beg, sz);
  2414. parse_state->lex_str_used += sz;
  2415. return TRUE;
  2416. }
  2417. void syd_add_to_parse_tree(STATE, rb_parse_state*, Object*, NODE*, ID*);
  2418. static Object* convert_to_sexp(STATE, rb_parse_state *parse_state, NODE *node) {
  2419. Array* ary;
  2420. ary = Array::create(state, 1);
  2421. syd_add_to_parse_tree(state, parse_state, ary, node, NULL);
  2422. return ary->get(state, 0);
  2423. }
  2424. static bool
  2425. lex_getline(rb_parse_state *parse_state)
  2426. {
  2427. if(!parse_state->line_buffer) {
  2428. parse_state->line_buffer = cstr2bstr("");
  2429. } else {
  2430. btrunc(parse_state->line_buffer, 0);
  2431. }
  2432. return parse_state->lex_gets(parse_state);
  2433. }
  2434. Object*
  2435. syd_compile_string(STATE, const char *f, bstring s, int line)
  2436. {
  2437. int n;
  2438. rb_parse_state *parse_state;
  2439. Object* ret;
  2440. parse_state = alloc_parse_state();
  2441. parse_state->state = state;
  2442. parse_state->lex_string = s;
  2443. parse_state->lex_gets = lex_get_str;
  2444. parse_state->lex_pbeg = 0;
  2445. parse_state->lex_p = 0;
  2446. parse_state->lex_pend = 0;
  2447. parse_state->error = Qfalse;
  2448. ruby_sourceline = line - 1;
  2449. compile_for_eval = 1;
  2450. n = yycompile(parse_state, (char*)f, line);
  2451. if(parse_state->error == Qfalse) {
  2452. ret = convert_to_sexp(state, parse_state, parse_state->top);
  2453. } else {
  2454. ret = parse_state->error;
  2455. }
  2456. pt_free(parse_state);
  2457. free(parse_state);
  2458. return ret;
  2459. }
  2460. static bool parse_io_gets(rb_parse_state *parse_state) {
  2461. if(feof(parse_state->lex_io)) {
  2462. return false;
  2463. }
  2464. while(TRUE) {
  2465. char *ptr, buf[1024];
  2466. int read;
  2467. ptr = fgets(buf, sizeof(buf), parse_state->lex_io);
  2468. if(!ptr) {
  2469. return false;
  2470. }
  2471. read = strlen(ptr);
  2472. bcatblk(parse_state->line_buffer, ptr, read);
  2473. /* check whether we read a full line */
  2474. if(!(read == (sizeof(buf) - 1) && ptr[read] != '\n')) {
  2475. break;
  2476. }
  2477. }
  2478. return TRUE;
  2479. }
  2480. Object*
  2481. syd_compile_file(STATE, const char *f, FILE *file, int start)
  2482. {
  2483. int n;
  2484. Object* ret;
  2485. rb_parse_state *parse_state;
  2486. parse_state = alloc_parse_state();
  2487. parse_state->state = state;
  2488. parse_state->lex_io = file;
  2489. parse_state->lex_gets = parse_io_gets;
  2490. parse_state->lex_pbeg = 0;
  2491. parse_state->lex_p = 0;
  2492. parse_state->lex_pend = 0;
  2493. parse_state->error = Qfalse;
  2494. ruby_sourceline = start - 1;
  2495. n = yycompile(parse_state, (char*)f, start);
  2496. if(parse_state->error == Qfalse) {
  2497. ret = convert_to_sexp(state, parse_state, parse_state->top);
  2498. } else {
  2499. ret = parse_state->error;
  2500. }
  2501. pt_free(parse_state);
  2502. free(parse_state);
  2503. return ret;
  2504. }
  2505. #define nextc() ps_nextc(parse_state)
  2506. static inline int
  2507. ps_nextc(rb_parse_state *parse_state)
  2508. {
  2509. int c;
  2510. if (parse_state->lex_p == parse_state->lex_pend) {
  2511. bstring v;
  2512. if (!lex_getline(parse_state)) return -1;
  2513. v = parse_state->line_buffer;
  2514. if (heredoc_end > 0) {
  2515. ruby_sourceline = heredoc_end;
  2516. heredoc_end = 0;
  2517. }
  2518. ruby_sourceline++;
  2519. /* This code is setup so that lex_pend can be compared to
  2520. the data in lex_lastline. Thats important, otherwise
  2521. the heredoc code breaks. */
  2522. if(parse_state->lex_lastline) {
  2523. bassign(parse_state->lex_lastline, v);
  2524. } else {
  2525. parse_state->lex_lastline = bstrcpy(v);
  2526. }
  2527. v = parse_state->lex_lastline;
  2528. parse_state->lex_pbeg = parse_state->lex_p = bdata(v);
  2529. parse_state->lex_pend = parse_state->lex_p + blength(v);
  2530. }
  2531. c = (unsigned char)*(parse_state->lex_p++);
  2532. if (c == '\r' && parse_state->lex_p < parse_state->lex_pend && *(parse_state->lex_p) == '\n') {
  2533. parse_state->lex_p++;
  2534. c = '\n';
  2535. parse_state->column = 0;
  2536. } else if(c == '\n') {
  2537. parse_state->column = 0;
  2538. } else {
  2539. parse_state->column++;
  2540. }
  2541. return c;
  2542. }
  2543. static void
  2544. pushback(int c, rb_parse_state *parse_state)
  2545. {
  2546. if (c == -1) return;
  2547. parse_state->lex_p--;
  2548. }
  2549. /* Indicates if we're currently at the beginning of a line. */
  2550. #define was_bol() (parse_state->lex_p == parse_state->lex_pbeg + 1)
  2551. #define peek(c) (parse_state->lex_p != parse_state->lex_pend && (c) == *(parse_state->lex_p))
  2552. /* The token buffer. It's just a global string that has
  2553. functions to build up the string easily. */
  2554. #define tokfix() (tokenbuf[tokidx]='\0')
  2555. #define tok() tokenbuf
  2556. #define toklen() tokidx
  2557. #define toklast() (tokidx>0?tokenbuf[tokidx-1]:0)
  2558. static char*
  2559. newtok(rb_parse_state *parse_state)
  2560. {
  2561. tokidx = 0;
  2562. if (!tokenbuf) {
  2563. toksiz = 60;
  2564. tokenbuf = ALLOC_N(char, 60);
  2565. }
  2566. if (toksiz > 4096) {
  2567. toksiz = 60;
  2568. REALLOC_N(tokenbuf, char, 60);
  2569. }
  2570. return tokenbuf;
  2571. }
  2572. static void tokadd(char c, rb_parse_state *parse_state)
  2573. {
  2574. assert(tokidx < toksiz && tokidx >= 0);
  2575. tokenbuf[tokidx++] = c;
  2576. if (tokidx >= toksiz) {
  2577. toksiz *= 2;
  2578. REALLOC_N(tokenbuf, char, toksiz);
  2579. }
  2580. }
  2581. static int
  2582. read_escape(rb_parse_state *parse_state)
  2583. {
  2584. int c;
  2585. switch (c = nextc()) {
  2586. case '\\': /* Backslash */
  2587. return c;
  2588. case 'n': /* newline */
  2589. return '\n';
  2590. case 't': /* horizontal tab */
  2591. return '\t';
  2592. case 'r': /* carriage-return */
  2593. return '\r';
  2594. case 'f': /* form-feed */
  2595. return '\f';
  2596. case 'v': /* vertical tab */
  2597. return '\13';
  2598. case 'a': /* alarm(bell) */
  2599. return '\007';
  2600. case 'e': /* escape */
  2601. return 033;
  2602. case '0': case '1': case '2': case '3': /* octal constant */
  2603. case '4': case '5': case '6': case '7':
  2604. {
  2605. int numlen;
  2606. pushback(c, parse_state);
  2607. c = scan_oct(parse_state->lex_p, 3, &numlen);
  2608. parse_state->lex_p += numlen;
  2609. }
  2610. return c;
  2611. case 'x': /* hex constant */
  2612. {
  2613. int numlen;
  2614. c = scan_hex(parse_state->lex_p, 2, &numlen);
  2615. if (numlen == 0) {
  2616. yyerror("Invalid escape character syntax");
  2617. return 0;
  2618. }
  2619. parse_state->lex_p += numlen;
  2620. }
  2621. return c;
  2622. case 'b': /* backspace */
  2623. return '\010';
  2624. case 's': /* space */
  2625. return ' ';
  2626. case 'M':
  2627. if ((c = nextc()) != '-') {
  2628. yyerror("Invalid escape character syntax");
  2629. pushback(c, parse_state);
  2630. return '\0';
  2631. }
  2632. if ((c = nextc()) == '\\') {
  2633. return read_escape(parse_state) | 0x80;
  2634. }
  2635. else if (c == -1) goto eof;
  2636. else {
  2637. return ((c & 0xff) | 0x80);
  2638. }
  2639. case 'C':
  2640. if ((c = nextc()) != '-') {
  2641. yyerror("Invalid escape character syntax");
  2642. pushback(c, parse_state);
  2643. return '\0';
  2644. }
  2645. case 'c':
  2646. if ((c = nextc())== '\\') {
  2647. c = read_escape(parse_state);
  2648. }
  2649. else if (c == '?')
  2650. return 0177;
  2651. else if (c == -1) goto eof;
  2652. return c & 0x9f;
  2653. eof:
  2654. case -1:
  2655. yyerror("Invalid escape character syntax");
  2656. return '\0';
  2657. default:
  2658. return c;
  2659. }
  2660. }
  2661. static int
  2662. tokadd_escape(int term, rb_parse_state *parse_state)
  2663. {
  2664. int c;
  2665. switch (c = nextc()) {
  2666. case '\n':
  2667. return 0; /* just ignore */
  2668. case '0': case '1': case '2': case '3': /* octal constant */
  2669. case '4': case '5': case '6': case '7':
  2670. {
  2671. int i;
  2672. tokadd((char)'\\', parse_state);
  2673. tokadd((char)c, parse_state);
  2674. for (i=0; i<2; i++) {
  2675. c = nextc();
  2676. if (c == -1) goto eof;
  2677. if (c < '0' || '7' < c) {
  2678. pushback(c, parse_state);
  2679. break;
  2680. }
  2681. tokadd((char)c, parse_state);
  2682. }
  2683. }
  2684. return 0;
  2685. case 'x': /* hex constant */
  2686. {
  2687. int numlen;
  2688. tokadd('\\', parse_state);
  2689. tokadd((char)c, parse_state);
  2690. scan_hex(parse_state->lex_p, 2, &numlen);
  2691. if (numlen == 0) {
  2692. yyerror("Invalid escape character syntax");
  2693. return -1;
  2694. }
  2695. while (numlen--)
  2696. tokadd((char)nextc(), parse_state);
  2697. }
  2698. return 0;
  2699. case 'M':
  2700. if ((c = nextc()) != '-') {
  2701. yyerror("Invalid escape character syntax");
  2702. pushback(c, parse_state);
  2703. return 0;
  2704. }
  2705. tokadd('\\',parse_state);
  2706. tokadd('M', parse_state);
  2707. tokadd('-', parse_state);
  2708. goto escaped;
  2709. case 'C':
  2710. if ((c = nextc()) != '-') {
  2711. yyerror("Invalid escape character syntax");
  2712. pushback(c, parse_state);
  2713. return 0;
  2714. }
  2715. tokadd('\\', parse_state);
  2716. tokadd('C', parse_state);
  2717. tokadd('-', parse_state);
  2718. goto escaped;
  2719. case 'c':
  2720. tokadd('\\', parse_state);
  2721. tokadd('c', parse_state);
  2722. escaped:
  2723. if ((c = nextc()) == '\\') {
  2724. return tokadd_escape(term, parse_state);
  2725. }
  2726. else if (c == -1) goto eof;
  2727. tokadd((char)c, parse_state);
  2728. return 0;
  2729. eof:
  2730. case -1:
  2731. yyerror("Invalid escape character syntax");
  2732. return -1;
  2733. default:
  2734. if (c != '\\' || c != term)
  2735. tokadd('\\', parse_state);
  2736. tokadd((char)c, parse_state);
  2737. }
  2738. return 0;
  2739. }
  2740. static int
  2741. regx_options(rb_parse_state *parse_state)
  2742. {
  2743. char kcode = 0;
  2744. int options = 0;
  2745. int c;
  2746. newtok(parse_state);
  2747. while (c = nextc(), ISALPHA(c)) {
  2748. switch (c) {
  2749. case 'i':
  2750. options |= RE_OPTION_IGNORECASE;
  2751. break;
  2752. case 'x':
  2753. options |= RE_OPTION_EXTENDED;
  2754. break;
  2755. case 'm':
  2756. options |= RE_OPTION_MULTILINE;
  2757. break;
  2758. case 'o':
  2759. options |= RE_OPTION_ONCE;
  2760. break;
  2761. case 'n':
  2762. kcode = 16;
  2763. break;
  2764. case 'e':
  2765. kcode = 32;
  2766. break;
  2767. case 's':
  2768. kcode = 48;
  2769. break;
  2770. case 'u':
  2771. kcode = 64;
  2772. break;
  2773. default:
  2774. tokadd((char)c, parse_state);
  2775. break;
  2776. }
  2777. }
  2778. pushback(c, parse_state);
  2779. if (toklen()) {
  2780. tokfix();
  2781. rb_compile_error(parse_state, "unknown regexp option%s - %s",
  2782. toklen() > 1 ? "s" : "", tok());
  2783. }
  2784. return options | kcode;
  2785. }
  2786. #define STR_FUNC_ESCAPE 0x01
  2787. #define STR_FUNC_EXPAND 0x02
  2788. #define STR_FUNC_REGEXP 0x04
  2789. #define STR_FUNC_QWORDS 0x08
  2790. #define STR_FUNC_SYMBOL 0x10
  2791. #define STR_FUNC_INDENT 0x20
  2792. enum string_type {
  2793. str_squote = (0),
  2794. str_dquote = (STR_FUNC_EXPAND),
  2795. str_xquote = (STR_FUNC_EXPAND),
  2796. str_regexp = (STR_FUNC_REGEXP|STR_FUNC_ESCAPE|STR_FUNC_EXPAND),
  2797. str_sword = (STR_FUNC_QWORDS),
  2798. str_dword = (STR_FUNC_QWORDS|STR_FUNC_EXPAND),
  2799. str_ssym = (STR_FUNC_SYMBOL),
  2800. str_dsym = (STR_FUNC_SYMBOL|STR_FUNC_EXPAND),
  2801. };
  2802. static int tokadd_string(int func, int term, int paren, quark *nest, rb_parse_state *parse_state)
  2803. {
  2804. int c;
  2805. while ((c = nextc()) != -1) {
  2806. if (paren && c == paren) {
  2807. ++*nest;
  2808. }
  2809. else if (c == term) {
  2810. if (!nest || !*nest) {
  2811. pushback(c, parse_state);
  2812. break;
  2813. }
  2814. --*nest;
  2815. }
  2816. else if ((func & STR_FUNC_EXPAND) && c == '#' && parse_state->lex_p < parse_state->lex_pend) {
  2817. int c2 = *(parse_state->lex_p);
  2818. if (c2 == '$' || c2 == '@' || c2 == '{') {
  2819. pushback(c, parse_state);
  2820. break;
  2821. }
  2822. }
  2823. else if (c == '\\') {
  2824. c = nextc();
  2825. switch (c) {
  2826. case '\n':
  2827. if (func & STR_FUNC_QWORDS) break;
  2828. if (func & STR_FUNC_EXPAND) continue;
  2829. tokadd('\\', parse_state);
  2830. break;
  2831. case '\\':
  2832. if (func & STR_FUNC_ESCAPE) tokadd((char)c, parse_state);
  2833. break;
  2834. default:
  2835. if (func & STR_FUNC_REGEXP) {
  2836. pushback(c, parse_state);
  2837. if (tokadd_escape(term, parse_state) < 0)
  2838. return -1;
  2839. continue;
  2840. }
  2841. else if (func & STR_FUNC_EXPAND) {
  2842. pushback(c, parse_state);
  2843. if (func & STR_FUNC_ESCAPE) tokadd('\\', parse_state);
  2844. c = read_escape(parse_state);
  2845. }
  2846. else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
  2847. /* ignore backslashed spaces in %w */
  2848. }
  2849. else if (c != term && !(paren && c == paren)) {
  2850. tokadd('\\', parse_state);
  2851. }
  2852. }
  2853. }
  2854. else if (ismbchar(c)) {
  2855. int i, len = mbclen(c)-1;
  2856. for (i = 0; i < len; i++) {
  2857. tokadd((char)c, parse_state);
  2858. c = nextc();
  2859. }
  2860. }
  2861. else if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
  2862. pushback(c, parse_state);
  2863. break;
  2864. }
  2865. if (!c && (func & STR_FUNC_SYMBOL)) {
  2866. func &= ~STR_FUNC_SYMBOL;
  2867. rb_compile_error(parse_state, "symbol cannot contain '\\0'");
  2868. continue;
  2869. }
  2870. tokadd((char)c, parse_state);
  2871. }
  2872. return c;
  2873. }
  2874. #define NEW_STRTERM(func, term, paren) \
  2875. syd_node_newnode(parse_state, NODE_STRTERM, (Object*)(func), (Object*)((term) | ((paren) << (CHAR_BIT * 2))), NULL)
  2876. #define pslval ((YYSTYPE *)parse_state->lval)
  2877. static int
  2878. parse_string(NODE *quote, rb_parse_state *parse_state)
  2879. {
  2880. int func = quote->nd_func;
  2881. int term = nd_term(quote);
  2882. int paren = nd_paren(quote);
  2883. int c, space = 0;
  2884. if (func == -1) return tSTRING_END;
  2885. c = nextc();
  2886. if ((func & STR_FUNC_QWORDS) && ISSPACE(c)) {
  2887. do {c = nextc();} while (ISSPACE(c));
  2888. space = 1;
  2889. }
  2890. if (c == term && !quote->nd_nest) {
  2891. if (func & STR_FUNC_QWORDS) {
  2892. quote->nd_func = -1;
  2893. return ' ';
  2894. }
  2895. if (!(func & STR_FUNC_REGEXP)) return tSTRING_END;
  2896. pslval->num = regx_options(parse_state);
  2897. return tREGEXP_END;
  2898. }
  2899. if (space) {
  2900. pushback(c, parse_state);
  2901. return ' ';
  2902. }
  2903. newtok(parse_state);
  2904. if ((func & STR_FUNC_EXPAND) && c == '#') {
  2905. switch (c = nextc()) {
  2906. case '$':
  2907. case '@':
  2908. pushback(c, parse_state);
  2909. return tSTRING_DVAR;
  2910. case '{':
  2911. return tSTRING_DBEG;
  2912. }
  2913. tokadd('#', parse_state);
  2914. }
  2915. pushback(c, parse_state);
  2916. if (tokadd_string(func, term, paren, &quote->nd_nest, parse_state) == -1) {
  2917. ruby_sourceline = nd_line(quote);
  2918. rb_compile_error(parse_state, "unterminated string meets end of file");
  2919. return tSTRING_END;
  2920. }
  2921. tokfix();
  2922. pslval->node = NEW_STR(string_new(tok(), toklen()));
  2923. return tSTRING_CONTENT;
  2924. }
  2925. /* Called when the lexer detects a heredoc is beginning. This pulls
  2926. in more characters and detects what kind of heredoc it is. */
  2927. static int
  2928. heredoc_identifier(rb_parse_state *parse_state)
  2929. {
  2930. int c = nextc(), term, func = 0;
  2931. size_t len;
  2932. if (c == '-') {
  2933. c = nextc();
  2934. func = STR_FUNC_INDENT;
  2935. }
  2936. switch (c) {
  2937. case '\'':
  2938. func |= str_squote; goto quoted;
  2939. case '"':
  2940. func |= str_dquote; goto quoted;
  2941. case '`':
  2942. func |= str_xquote;
  2943. quoted:
  2944. /* The heredoc indent is quoted, so its easy to find, we just
  2945. continue to consume characters into the token buffer until
  2946. we hit the terminating character. */
  2947. newtok(parse_state);
  2948. tokadd((char)func, parse_state);
  2949. term = c;
  2950. /* Where of where has the term gone.. */
  2951. while ((c = nextc()) != -1 && c != term) {
  2952. len = mbclen(c);
  2953. do {
  2954. tokadd((char)c, parse_state);
  2955. } while (--len > 0 && (c = nextc()) != -1);
  2956. }
  2957. /* Ack! end of file or end of string. */
  2958. if (c == -1) {
  2959. rb_compile_error(parse_state, "unterminated here document identifier");
  2960. return 0;
  2961. }
  2962. break;
  2963. default:
  2964. /* Ok, this is an unquoted heredoc ident. We just consume
  2965. until we hit a non-ident character. */
  2966. /* Do a quick check that first character is actually valid.
  2967. if it's not, then this isn't actually a heredoc at all!
  2968. It sucks that it's way down here in this function that in
  2969. finally bails with this not being a heredoc.*/
  2970. if (!is_identchar(c)) {
  2971. pushback(c, parse_state);
  2972. if (func & STR_FUNC_INDENT) {
  2973. pushback('-', parse_state);
  2974. }
  2975. return 0;
  2976. }
  2977. /* Finally, setup the token buffer and begin to fill it. */
  2978. newtok(parse_state);
  2979. term = '"';
  2980. tokadd((char)(func |= str_dquote), parse_state);
  2981. do {
  2982. len = mbclen(c);
  2983. do { tokadd((char)c, parse_state); } while (--len > 0 && (c = nextc()) != -1);
  2984. } while ((c = nextc()) != -1 && is_identchar(c));
  2985. pushback(c, parse_state);
  2986. break;
  2987. }
  2988. /* Fixup the token buffer, ie set the last character to null. */
  2989. tokfix();
  2990. len = parse_state->lex_p - parse_state->lex_pbeg;
  2991. parse_state->lex_p = parse_state->lex_pend;
  2992. pslval->id = 0;
  2993. /* Tell the lexer that we're inside a string now. nd_lit is
  2994. the heredoc identifier that we watch the stream for to
  2995. detect the end of the heredoc. */
  2996. bstring str = bstrcpy(parse_state->lex_lastline);
  2997. lex_strterm = syd_node_newnode(parse_state, NODE_HEREDOC,
  2998. (Object*)string_new(tok(), toklen()), /* nd_lit */
  2999. (Object*)len, /* nd_nth */
  3000. (Object*)str); /* nd_orig */
  3001. return term == '`' ? tXSTRING_BEG : tSTRING_BEG;
  3002. }
  3003. static void
  3004. heredoc_restore(NODE *here, rb_parse_state *parse_state)
  3005. {
  3006. bstring line = here->nd_orig;
  3007. bdestroy(parse_state->lex_lastline);
  3008. parse_state->lex_lastline = line;
  3009. parse_state->lex_pbeg = bdata(line);
  3010. parse_state->lex_pend = parse_state->lex_pbeg + blength(line);
  3011. parse_state->lex_p = parse_state->lex_pbeg + here->nd_nth;
  3012. heredoc_end = ruby_sourceline;
  3013. ruby_sourceline = nd_line(here);
  3014. bdestroy((bstring)here->nd_lit);
  3015. }
  3016. static int
  3017. whole_match_p(const char *eos, int len, int indent, rb_parse_state *parse_state)
  3018. {
  3019. char *p = parse_state->lex_pbeg;
  3020. int n;
  3021. if (indent) {
  3022. while (*p && ISSPACE(*p)) p++;
  3023. }
  3024. n = parse_state->lex_pend - (p + len);
  3025. if (n < 0 || (n > 0 && p[len] != '\n' && p[len] != '\r')) return FALSE;
  3026. if (strncmp(eos, p, len) == 0) return TRUE;
  3027. return FALSE;
  3028. }
  3029. /* Called when the lexer knows it's inside a heredoc. This function
  3030. is responsible for detecting an expandions (ie #{}) in the heredoc
  3031. and emitting a lex token and also detecting the end of the heredoc. */
  3032. static int
  3033. here_document(NODE *here, rb_parse_state *parse_state)
  3034. {
  3035. int c, func, indent = 0;
  3036. char *eos, *p, *pend;
  3037. long len;
  3038. bstring str = NULL;
  3039. /* eos == the heredoc ident that we found when the heredoc started */
  3040. eos = bdata(here->nd_str);
  3041. len = blength(here->nd_str) - 1;
  3042. /* indicates if we should search for expansions. */
  3043. indent = (func = *eos++) & STR_FUNC_INDENT;
  3044. /* Ack! EOF or end of input string! */
  3045. if ((c = nextc()) == -1) {
  3046. error:
  3047. rb_compile_error(parse_state, "can't find string \"%s\" anywhere before EOF", eos);
  3048. heredoc_restore(lex_strterm, parse_state);
  3049. lex_strterm = 0;
  3050. return 0;
  3051. }
  3052. /* Gr. not yet sure what was_bol() means other than it seems like
  3053. it means only 1 character has been consumed. */
  3054. if (was_bol() && whole_match_p(eos, len, indent, parse_state)) {
  3055. heredoc_restore(lex_strterm, parse_state);
  3056. return tSTRING_END;
  3057. }
  3058. /* If aren't doing expansions, we can just scan until
  3059. we find the identifier. */
  3060. if ((func & STR_FUNC_EXPAND) == 0) {
  3061. do {
  3062. p = bdata(parse_state->lex_lastline);
  3063. pend = parse_state->lex_pend;
  3064. if (pend > p) {
  3065. switch (pend[-1]) {
  3066. case '\n':
  3067. if (--pend == p || pend[-1] != '\r') {
  3068. pend++;
  3069. break;
  3070. }
  3071. case '\r':
  3072. --pend;
  3073. }
  3074. }
  3075. if (str) {
  3076. bcatblk(str, p, pend - p);
  3077. } else {
  3078. str = blk2bstr(p, pend - p);
  3079. }
  3080. if (pend < parse_state->lex_pend) bcatblk(str, "\n", 1);
  3081. parse_state->lex_p = parse_state->lex_pend;
  3082. if (nextc() == -1) {
  3083. if (str) bdestroy(str);
  3084. goto error;
  3085. }
  3086. } while (!whole_match_p(eos, len, indent, parse_state));
  3087. }
  3088. else {
  3089. newtok(parse_state);
  3090. if (c == '#') {
  3091. switch (c = nextc()) {
  3092. case '$':
  3093. case '@':
  3094. pushback(c, parse_state);
  3095. return tSTRING_DVAR;
  3096. case '{':
  3097. return tSTRING_DBEG;
  3098. }
  3099. tokadd('#', parse_state);
  3100. }
  3101. /* Loop while we haven't found a the heredoc ident. */
  3102. do {
  3103. pushback(c, parse_state);
  3104. /* Scan up until a \n and fill in the token buffer. */
  3105. if ((c = tokadd_string(func, '\n', 0, NULL, parse_state)) == -1) goto error;
  3106. /* We finished scanning, but didn't find a \n, so we setup the node
  3107. and have the lexer file in more. */
  3108. if (c != '\n') {
  3109. pslval->node = NEW_STR(string_new(tok(), toklen()));
  3110. return tSTRING_CONTENT;
  3111. }
  3112. /* I think this consumes the \n */
  3113. tokadd((char)nextc(), parse_state);
  3114. if ((c = nextc()) == -1) goto error;
  3115. } while (!whole_match_p(eos, len, indent, parse_state));
  3116. str = string_new(tok(), toklen());
  3117. }
  3118. heredoc_restore(lex_strterm, parse_state);
  3119. lex_strterm = NEW_STRTERM(-1, 0, 0);
  3120. pslval->node = NEW_STR(str);
  3121. return tSTRING_CONTENT;
  3122. }
  3123. #include "parser/grammar_lex.c.tab"
  3124. static void
  3125. arg_ambiguous()
  3126. {
  3127. rb_warning("ambiguous first argument; put parentheses or even spaces");
  3128. }
  3129. #define IS_ARG() (parse_state->lex_state == EXPR_ARG || parse_state->lex_state == EXPR_CMDARG)
  3130. static int
  3131. yylex(void *yylval_v, void *vstate)
  3132. {
  3133. register int c;
  3134. int space_seen = 0;
  3135. int cmd_state, comment_column;
  3136. struct rb_parse_state *parse_state;
  3137. bstring cur_line;
  3138. enum lex_state last_state;
  3139. YYSTYPE *yylval = (YYSTYPE*)yylval_v;
  3140. parse_state = (struct rb_parse_state*)vstate;
  3141. parse_state->lval = (void *)yylval;
  3142. /*
  3143. c = nextc();
  3144. printf("lex char: %c\n", c);
  3145. pushback(c, parse_state);
  3146. */
  3147. if (lex_strterm) {
  3148. int token;
  3149. if (nd_type(lex_strterm) == NODE_HEREDOC) {
  3150. token = here_document(lex_strterm, parse_state);
  3151. if (token == tSTRING_END) {
  3152. lex_strterm = 0;
  3153. parse_state->lex_state = EXPR_END;
  3154. }
  3155. }
  3156. else {
  3157. token = parse_string(lex_strterm, parse_state);
  3158. if (token == tSTRING_END || token == tREGEXP_END) {
  3159. lex_strterm = 0;
  3160. parse_state->lex_state = EXPR_END;
  3161. }
  3162. }
  3163. return token;
  3164. }
  3165. cmd_state = command_start;
  3166. command_start = FALSE;
  3167. retry:
  3168. switch (c = nextc()) {
  3169. case '\0': /* NUL */
  3170. case '\004': /* ^D */
  3171. case '\032': /* ^Z */
  3172. case -1: /* end of script. */
  3173. return 0;
  3174. /* white spaces */
  3175. case ' ': case '\t': case '\f': case '\r':
  3176. case '\13': /* '\v' */
  3177. space_seen++;
  3178. goto retry;
  3179. case '#': /* it's a comment */
  3180. if(parse_state->comments) {
  3181. comment_column = parse_state->column;
  3182. cur_line = bfromcstralloc(50, "");
  3183. while((c = nextc()) != '\n' && c != -1) {
  3184. bconchar(cur_line, c);
  3185. }
  3186. // FIXME: used to have the file and column too, but took it out.
  3187. ptr_array_append(parse_state->comments, cur_line);
  3188. if(c == -1) {
  3189. return 0;
  3190. }
  3191. } else {
  3192. while ((c = nextc()) != '\n') {
  3193. if (c == -1)
  3194. return 0;
  3195. }
  3196. }
  3197. /* fall through */
  3198. case '\n':
  3199. switch (parse_state->lex_state) {
  3200. case EXPR_BEG:
  3201. case EXPR_FNAME:
  3202. case EXPR_DOT:
  3203. case EXPR_CLASS:
  3204. goto retry;
  3205. default:
  3206. break;
  3207. }
  3208. command_start = TRUE;
  3209. parse_state->lex_state = EXPR_BEG;
  3210. return '\n';
  3211. case '*':
  3212. if ((c = nextc()) == '*') {
  3213. if ((c = nextc()) == '=') {
  3214. pslval->id = tPOW;
  3215. parse_state->lex_state = EXPR_BEG;
  3216. return tOP_ASGN;
  3217. }
  3218. pushback(c, parse_state);
  3219. c = tPOW;
  3220. }
  3221. else {
  3222. if (c == '=') {
  3223. pslval->id = '*';
  3224. parse_state->lex_state = EXPR_BEG;
  3225. return tOP_ASGN;
  3226. }
  3227. pushback(c, parse_state);
  3228. if (IS_ARG() && space_seen && !ISSPACE(c)){
  3229. rb_warning("`*' interpreted as argument prefix");
  3230. c = tSTAR;
  3231. }
  3232. else if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3233. c = tSTAR;
  3234. }
  3235. else {
  3236. c = '*';
  3237. }
  3238. }
  3239. switch (parse_state->lex_state) {
  3240. case EXPR_FNAME: case EXPR_DOT:
  3241. parse_state->lex_state = EXPR_ARG; break;
  3242. default:
  3243. parse_state->lex_state = EXPR_BEG; break;
  3244. }
  3245. return c;
  3246. case '!':
  3247. parse_state->lex_state = EXPR_BEG;
  3248. if ((c = nextc()) == '=') {
  3249. return tNEQ;
  3250. }
  3251. if (c == '~') {
  3252. return tNMATCH;
  3253. }
  3254. pushback(c, parse_state);
  3255. return '!';
  3256. case '=':
  3257. if (was_bol()) {
  3258. /* skip embedded rd document */
  3259. if (strncmp(parse_state->lex_p, "begin", 5) == 0 && ISSPACE(parse_state->lex_p[5])) {
  3260. for (;;) {
  3261. parse_state->lex_p = parse_state->lex_pend;
  3262. c = nextc();
  3263. if (c == -1) {
  3264. rb_compile_error(parse_state, "embedded document meets end of file");
  3265. return 0;
  3266. }
  3267. if (c != '=') continue;
  3268. if (strncmp(parse_state->lex_p, "end", 3) == 0 &&
  3269. (parse_state->lex_p + 3 == parse_state->lex_pend || ISSPACE(parse_state->lex_p[3]))) {
  3270. break;
  3271. }
  3272. }
  3273. parse_state->lex_p = parse_state->lex_pend;
  3274. goto retry;
  3275. }
  3276. }
  3277. switch (parse_state->lex_state) {
  3278. case EXPR_FNAME: case EXPR_DOT:
  3279. parse_state->lex_state = EXPR_ARG; break;
  3280. default:
  3281. parse_state->lex_state = EXPR_BEG; break;
  3282. }
  3283. if ((c = nextc()) == '=') {
  3284. if ((c = nextc()) == '=') {
  3285. return tEQQ;
  3286. }
  3287. pushback(c, parse_state);
  3288. return tEQ;
  3289. }
  3290. if (c == '~') {
  3291. return tMATCH;
  3292. }
  3293. else if (c == '>') {
  3294. return tASSOC;
  3295. }
  3296. pushback(c, parse_state);
  3297. return '=';
  3298. case '<':
  3299. c = nextc();
  3300. if (c == '<' &&
  3301. parse_state->lex_state != EXPR_END &&
  3302. parse_state->lex_state != EXPR_DOT &&
  3303. parse_state->lex_state != EXPR_ENDARG &&
  3304. parse_state->lex_state != EXPR_CLASS &&
  3305. (!IS_ARG() || space_seen)) {
  3306. int token = heredoc_identifier(parse_state);
  3307. if (token) return token;
  3308. }
  3309. switch (parse_state->lex_state) {
  3310. case EXPR_FNAME: case EXPR_DOT:
  3311. parse_state->lex_state = EXPR_ARG; break;
  3312. default:
  3313. parse_state->lex_state = EXPR_BEG; break;
  3314. }
  3315. if (c == '=') {
  3316. if ((c = nextc()) == '>') {
  3317. return tCMP;
  3318. }
  3319. pushback(c, parse_state);
  3320. return tLEQ;
  3321. }
  3322. if (c == '<') {
  3323. if ((c = nextc()) == '=') {
  3324. pslval->id = tLSHFT;
  3325. parse_state->lex_state = EXPR_BEG;
  3326. return tOP_ASGN;
  3327. }
  3328. pushback(c, parse_state);
  3329. return tLSHFT;
  3330. }
  3331. pushback(c, parse_state);
  3332. return '<';
  3333. case '>':
  3334. switch (parse_state->lex_state) {
  3335. case EXPR_FNAME: case EXPR_DOT:
  3336. parse_state->lex_state = EXPR_ARG; break;
  3337. default:
  3338. parse_state->lex_state = EXPR_BEG; break;
  3339. }
  3340. if ((c = nextc()) == '=') {
  3341. return tGEQ;
  3342. }
  3343. if (c == '>') {
  3344. if ((c = nextc()) == '=') {
  3345. pslval->id = tRSHFT;
  3346. parse_state->lex_state = EXPR_BEG;
  3347. return tOP_ASGN;
  3348. }
  3349. pushback(c, parse_state);
  3350. return tRSHFT;
  3351. }
  3352. pushback(c, parse_state);
  3353. return '>';
  3354. case '"':
  3355. lex_strterm = NEW_STRTERM(str_dquote, '"', 0);
  3356. return tSTRING_BEG;
  3357. case '`':
  3358. if (parse_state->lex_state == EXPR_FNAME) {
  3359. parse_state->lex_state = EXPR_END;
  3360. return c;
  3361. }
  3362. if (parse_state->lex_state == EXPR_DOT) {
  3363. if (cmd_state)
  3364. parse_state->lex_state = EXPR_CMDARG;
  3365. else
  3366. parse_state->lex_state = EXPR_ARG;
  3367. return c;
  3368. }
  3369. lex_strterm = NEW_STRTERM(str_xquote, '`', 0);
  3370. pslval->id = 0; /* so that xstring gets used normally */
  3371. return tXSTRING_BEG;
  3372. case '\'':
  3373. lex_strterm = NEW_STRTERM(str_squote, '\'', 0);
  3374. pslval->id = 0; /* so that xstring gets used normally */
  3375. return tSTRING_BEG;
  3376. case '?':
  3377. if (parse_state->lex_state == EXPR_END || parse_state->lex_state == EXPR_ENDARG) {
  3378. parse_state->lex_state = EXPR_BEG;
  3379. return '?';
  3380. }
  3381. c = nextc();
  3382. if (c == -1) {
  3383. rb_compile_error(parse_state, "incomplete character syntax");
  3384. return 0;
  3385. }
  3386. if (ISSPACE(c)){
  3387. if (!IS_ARG()){
  3388. int c2 = 0;
  3389. switch (c) {
  3390. case ' ':
  3391. c2 = 's';
  3392. break;
  3393. case '\n':
  3394. c2 = 'n';
  3395. break;
  3396. case '\t':
  3397. c2 = 't';
  3398. break;
  3399. case '\v':
  3400. c2 = 'v';
  3401. break;
  3402. case '\r':
  3403. c2 = 'r';
  3404. break;
  3405. case '\f':
  3406. c2 = 'f';
  3407. break;
  3408. }
  3409. if (c2) {
  3410. rb_warn("invalid character syntax; use ?\\%c", c2);
  3411. }
  3412. }
  3413. ternary:
  3414. pushback(c, parse_state);
  3415. parse_state->lex_state = EXPR_BEG;
  3416. parse_state->ternary_colon = 1;
  3417. return '?';
  3418. }
  3419. else if (ismbchar(c)) {
  3420. rb_warn("multibyte character literal not supported yet; use ?\\%.3o", c);
  3421. goto ternary;
  3422. }
  3423. else if ((ISALNUM(c) || c == '_') && parse_state->lex_p < parse_state->lex_pend && is_identchar(*(parse_state->lex_p))) {
  3424. goto ternary;
  3425. }
  3426. else if (c == '\\') {
  3427. c = read_escape(parse_state);
  3428. }
  3429. c &= 0xff;
  3430. parse_state->lex_state = EXPR_END;
  3431. pslval->node = NEW_FIXNUM((intptr_t)c);
  3432. return tINTEGER;
  3433. case '&':
  3434. if ((c = nextc()) == '&') {
  3435. parse_state->lex_state = EXPR_BEG;
  3436. if ((c = nextc()) == '=') {
  3437. pslval->id = tANDOP;
  3438. parse_state->lex_state = EXPR_BEG;
  3439. return tOP_ASGN;
  3440. }
  3441. pushback(c, parse_state);
  3442. return tANDOP;
  3443. }
  3444. else if (c == '=') {
  3445. pslval->id = '&';
  3446. parse_state->lex_state = EXPR_BEG;
  3447. return tOP_ASGN;
  3448. }
  3449. pushback(c, parse_state);
  3450. if (IS_ARG() && space_seen && !ISSPACE(c)){
  3451. rb_warning("`&' interpreted as argument prefix");
  3452. c = tAMPER;
  3453. }
  3454. else if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3455. c = tAMPER;
  3456. }
  3457. else {
  3458. c = '&';
  3459. }
  3460. switch (parse_state->lex_state) {
  3461. case EXPR_FNAME: case EXPR_DOT:
  3462. parse_state->lex_state = EXPR_ARG; break;
  3463. default:
  3464. parse_state->lex_state = EXPR_BEG;
  3465. }
  3466. return c;
  3467. case '|':
  3468. if ((c = nextc()) == '|') {
  3469. parse_state->lex_state = EXPR_BEG;
  3470. if ((c = nextc()) == '=') {
  3471. pslval->id = tOROP;
  3472. parse_state->lex_state = EXPR_BEG;
  3473. return tOP_ASGN;
  3474. }
  3475. pushback(c, parse_state);
  3476. return tOROP;
  3477. }
  3478. if (c == '=') {
  3479. pslval->id = '|';
  3480. parse_state->lex_state = EXPR_BEG;
  3481. return tOP_ASGN;
  3482. }
  3483. if (parse_state->lex_state == EXPR_FNAME || parse_state->lex_state == EXPR_DOT) {
  3484. parse_state->lex_state = EXPR_ARG;
  3485. }
  3486. else {
  3487. parse_state->lex_state = EXPR_BEG;
  3488. }
  3489. pushback(c, parse_state);
  3490. return '|';
  3491. case '+':
  3492. c = nextc();
  3493. if (parse_state->lex_state == EXPR_FNAME || parse_state->lex_state == EXPR_DOT) {
  3494. parse_state->lex_state = EXPR_ARG;
  3495. if (c == '@') {
  3496. return tUPLUS;
  3497. }
  3498. pushback(c, parse_state);
  3499. return '+';
  3500. }
  3501. if (c == '=') {
  3502. pslval->id = '+';
  3503. parse_state->lex_state = EXPR_BEG;
  3504. return tOP_ASGN;
  3505. }
  3506. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID ||
  3507. (IS_ARG() && space_seen && !ISSPACE(c))) {
  3508. if (IS_ARG()) arg_ambiguous();
  3509. parse_state->lex_state = EXPR_BEG;
  3510. pushback(c, parse_state);
  3511. if (ISDIGIT(c)) {
  3512. c = '+';
  3513. goto start_num;
  3514. }
  3515. return tUPLUS;
  3516. }
  3517. parse_state->lex_state = EXPR_BEG;
  3518. pushback(c, parse_state);
  3519. return '+';
  3520. case '-':
  3521. c = nextc();
  3522. if (parse_state->lex_state == EXPR_FNAME || parse_state->lex_state == EXPR_DOT) {
  3523. parse_state->lex_state = EXPR_ARG;
  3524. if (c == '@') {
  3525. return tUMINUS;
  3526. }
  3527. pushback(c, parse_state);
  3528. return '-';
  3529. }
  3530. if (c == '=') {
  3531. pslval->id = '-';
  3532. parse_state->lex_state = EXPR_BEG;
  3533. return tOP_ASGN;
  3534. }
  3535. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID ||
  3536. (IS_ARG() && space_seen && !ISSPACE(c))) {
  3537. if (IS_ARG()) arg_ambiguous();
  3538. parse_state->lex_state = EXPR_BEG;
  3539. pushback(c, parse_state);
  3540. if (ISDIGIT(c)) {
  3541. return tUMINUS_NUM;
  3542. }
  3543. return tUMINUS;
  3544. }
  3545. parse_state->lex_state = EXPR_BEG;
  3546. pushback(c, parse_state);
  3547. return '-';
  3548. case '.':
  3549. parse_state->lex_state = EXPR_BEG;
  3550. if ((c = nextc()) == '.') {
  3551. if ((c = nextc()) == '.') {
  3552. return tDOT3;
  3553. }
  3554. pushback(c, parse_state);
  3555. return tDOT2;
  3556. }
  3557. pushback(c, parse_state);
  3558. if (ISDIGIT(c)) {
  3559. yyerror("no .<digit> floating literal anymore; put 0 before dot");
  3560. }
  3561. parse_state->lex_state = EXPR_DOT;
  3562. return '.';
  3563. start_num:
  3564. case '0': case '1': case '2': case '3': case '4':
  3565. case '5': case '6': case '7': case '8': case '9':
  3566. {
  3567. int is_float, seen_point, seen_e, nondigit;
  3568. is_float = seen_point = seen_e = nondigit = 0;
  3569. parse_state->lex_state = EXPR_END;
  3570. newtok(parse_state);
  3571. if (c == '-' || c == '+') {
  3572. tokadd((char)c,parse_state);
  3573. c = nextc();
  3574. }
  3575. if (c == '0') {
  3576. int start = toklen();
  3577. c = nextc();
  3578. if (c == 'x' || c == 'X') {
  3579. /* hexadecimal */
  3580. c = nextc();
  3581. if (ISXDIGIT(c)) {
  3582. do {
  3583. if (c == '_') {
  3584. if (nondigit) break;
  3585. nondigit = c;
  3586. continue;
  3587. }
  3588. if (!ISXDIGIT(c)) break;
  3589. nondigit = 0;
  3590. tokadd((char)c,parse_state);
  3591. } while ((c = nextc()) != -1);
  3592. }
  3593. pushback(c, parse_state);
  3594. tokfix();
  3595. if (toklen() == start) {
  3596. yyerror("numeric literal without digits");
  3597. }
  3598. else if (nondigit) goto trailing_uc;
  3599. pslval->node = NEW_HEXNUM(string_new2(tok()));
  3600. return tINTEGER;
  3601. }
  3602. if (c == 'b' || c == 'B') {
  3603. /* binary */
  3604. c = nextc();
  3605. if (c == '0' || c == '1') {
  3606. do {
  3607. if (c == '_') {
  3608. if (nondigit) break;
  3609. nondigit = c;
  3610. continue;
  3611. }
  3612. if (c != '0' && c != '1') break;
  3613. nondigit = 0;
  3614. tokadd((char)c, parse_state);
  3615. } while ((c = nextc()) != -1);
  3616. }
  3617. pushback(c, parse_state);
  3618. tokfix();
  3619. if (toklen() == start) {
  3620. yyerror("numeric literal without digits");
  3621. }
  3622. else if (nondigit) goto trailing_uc;
  3623. pslval->node = NEW_BINNUM(string_new2(tok()));
  3624. return tINTEGER;
  3625. }
  3626. if (c == 'd' || c == 'D') {
  3627. /* decimal */
  3628. c = nextc();
  3629. if (ISDIGIT(c)) {
  3630. do {
  3631. if (c == '_') {
  3632. if (nondigit) break;
  3633. nondigit = c;
  3634. continue;
  3635. }
  3636. if (!ISDIGIT(c)) break;
  3637. nondigit = 0;
  3638. tokadd((char)c, parse_state);
  3639. } while ((c = nextc()) != -1);
  3640. }
  3641. pushback(c, parse_state);
  3642. tokfix();
  3643. if (toklen() == start) {
  3644. yyerror("numeric literal without digits");
  3645. }
  3646. else if (nondigit) goto trailing_uc;
  3647. pslval->node = NEW_NUMBER(string_new2(tok()));
  3648. return tINTEGER;
  3649. }
  3650. if (c == '_') {
  3651. /* 0_0 */
  3652. goto octal_number;
  3653. }
  3654. if (c == 'o' || c == 'O') {
  3655. /* prefixed octal */
  3656. c = nextc();
  3657. if (c == '_') {
  3658. yyerror("numeric literal without digits");
  3659. }
  3660. }
  3661. if (c >= '0' && c <= '7') {
  3662. /* octal */
  3663. octal_number:
  3664. do {
  3665. if (c == '_') {
  3666. if (nondigit) break;
  3667. nondigit = c;
  3668. continue;
  3669. }
  3670. if (c < '0' || c > '7') break;
  3671. nondigit = 0;
  3672. tokadd((char)c, parse_state);
  3673. } while ((c = nextc()) != -1);
  3674. if (toklen() > start) {
  3675. pushback(c, parse_state);
  3676. tokfix();
  3677. if (nondigit) goto trailing_uc;
  3678. pslval->node = NEW_OCTNUM(string_new2(tok()));
  3679. return tINTEGER;
  3680. }
  3681. if (nondigit) {
  3682. pushback(c, parse_state);
  3683. goto trailing_uc;
  3684. }
  3685. }
  3686. if (c > '7' && c <= '9') {
  3687. yyerror("Illegal octal digit");
  3688. }
  3689. else if (c == '.' || c == 'e' || c == 'E') {
  3690. tokadd('0', parse_state);
  3691. }
  3692. else {
  3693. pushback(c, parse_state);
  3694. pslval->node = NEW_FIXNUM(0);
  3695. return tINTEGER;
  3696. }
  3697. }
  3698. for (;;) {
  3699. switch (c) {
  3700. case '0': case '1': case '2': case '3': case '4':
  3701. case '5': case '6': case '7': case '8': case '9':
  3702. nondigit = 0;
  3703. tokadd((char)c, parse_state);
  3704. break;
  3705. case '.':
  3706. if (nondigit) goto trailing_uc;
  3707. if (seen_point || seen_e) {
  3708. goto decode_num;
  3709. }
  3710. else {
  3711. int c0 = nextc();
  3712. if (!ISDIGIT(c0)) {
  3713. pushback(c0, parse_state);
  3714. goto decode_num;
  3715. }
  3716. c = c0;
  3717. }
  3718. tokadd('.', parse_state);
  3719. tokadd((char)c, parse_state);
  3720. is_float++;
  3721. seen_point++;
  3722. nondigit = 0;
  3723. break;
  3724. case 'e':
  3725. case 'E':
  3726. if (nondigit) {
  3727. pushback(c, parse_state);
  3728. c = nondigit;
  3729. goto decode_num;
  3730. }
  3731. if (seen_e) {
  3732. goto decode_num;
  3733. }
  3734. tokadd((char)c, parse_state);
  3735. seen_e++;
  3736. is_float++;
  3737. nondigit = c;
  3738. c = nextc();
  3739. if (c != '-' && c != '+') continue;
  3740. tokadd((char)c, parse_state);
  3741. nondigit = c;
  3742. break;
  3743. case '_': /* `_' in number just ignored */
  3744. if (nondigit) goto decode_num;
  3745. nondigit = c;
  3746. break;
  3747. default:
  3748. goto decode_num;
  3749. }
  3750. c = nextc();
  3751. }
  3752. decode_num:
  3753. pushback(c, parse_state);
  3754. tokfix();
  3755. if (nondigit) {
  3756. char tmp[30];
  3757. trailing_uc:
  3758. snprintf(tmp, sizeof(tmp), "trailing `%c' in number", nondigit);
  3759. yyerror(tmp);
  3760. }
  3761. if (is_float) {
  3762. /* Some implementations of strtod() don't guarantee to
  3763. * set errno, so we need to reset it ourselves.
  3764. */
  3765. errno = 0;
  3766. /* HACK: gcc 4.3.2 refuses to accept (void) to ignore
  3767. * the return value so we have to invent something
  3768. * fake for it to do instead
  3769. */
  3770. if(strtod(tok(), 0));
  3771. if (errno == ERANGE) {
  3772. rb_warn("Float %s out of range", tok());
  3773. errno = 0;
  3774. }
  3775. pslval->node = NEW_FLOAT(string_new2(tok()));
  3776. return tFLOAT;
  3777. }
  3778. pslval->node = NEW_NUMBER(string_new2(tok()));
  3779. return tINTEGER;
  3780. }
  3781. case ']':
  3782. case '}':
  3783. case ')':
  3784. COND_LEXPOP();
  3785. CMDARG_LEXPOP();
  3786. parse_state->lex_state = EXPR_END;
  3787. return c;
  3788. case ':':
  3789. c = nextc();
  3790. if (c == ':') {
  3791. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID ||
  3792. parse_state->lex_state == EXPR_CLASS || (IS_ARG() && space_seen)) {
  3793. parse_state->lex_state = EXPR_BEG;
  3794. return tCOLON3;
  3795. }
  3796. parse_state->lex_state = EXPR_DOT;
  3797. return tCOLON2;
  3798. }
  3799. if (parse_state->lex_state == EXPR_END || parse_state->lex_state == EXPR_ENDARG || ISSPACE(c)) {
  3800. pushback(c, parse_state);
  3801. parse_state->lex_state = EXPR_BEG;
  3802. return ':';
  3803. }
  3804. switch (c) {
  3805. case '\'':
  3806. lex_strterm = NEW_STRTERM(str_ssym, (intptr_t)c, 0);
  3807. break;
  3808. case '"':
  3809. lex_strterm = NEW_STRTERM(str_dsym, (intptr_t)c, 0);
  3810. break;
  3811. default:
  3812. pushback(c, parse_state);
  3813. break;
  3814. }
  3815. parse_state->lex_state = EXPR_FNAME;
  3816. return tSYMBEG;
  3817. case '/':
  3818. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3819. lex_strterm = NEW_STRTERM(str_regexp, '/', 0);
  3820. return tREGEXP_BEG;
  3821. }
  3822. if ((c = nextc()) == '=') {
  3823. pslval->id = '/';
  3824. parse_state->lex_state = EXPR_BEG;
  3825. return tOP_ASGN;
  3826. }
  3827. pushback(c, parse_state);
  3828. if (IS_ARG() && space_seen) {
  3829. if (!ISSPACE(c)) {
  3830. arg_ambiguous();
  3831. lex_strterm = NEW_STRTERM(str_regexp, '/', 0);
  3832. return tREGEXP_BEG;
  3833. }
  3834. }
  3835. switch (parse_state->lex_state) {
  3836. case EXPR_FNAME: case EXPR_DOT:
  3837. parse_state->lex_state = EXPR_ARG; break;
  3838. default:
  3839. parse_state->lex_state = EXPR_BEG; break;
  3840. }
  3841. return '/';
  3842. case '^':
  3843. if ((c = nextc()) == '=') {
  3844. pslval->id = '^';
  3845. parse_state->lex_state = EXPR_BEG;
  3846. return tOP_ASGN;
  3847. }
  3848. switch (parse_state->lex_state) {
  3849. case EXPR_FNAME: case EXPR_DOT:
  3850. parse_state->lex_state = EXPR_ARG; break;
  3851. default:
  3852. parse_state->lex_state = EXPR_BEG; break;
  3853. }
  3854. pushback(c, parse_state);
  3855. return '^';
  3856. case ';':
  3857. command_start = TRUE;
  3858. case ',':
  3859. parse_state->lex_state = EXPR_BEG;
  3860. return c;
  3861. case '~':
  3862. if (parse_state->lex_state == EXPR_FNAME || parse_state->lex_state == EXPR_DOT) {
  3863. if ((c = nextc()) != '@') {
  3864. pushback(c, parse_state);
  3865. }
  3866. }
  3867. switch (parse_state->lex_state) {
  3868. case EXPR_FNAME: case EXPR_DOT:
  3869. parse_state->lex_state = EXPR_ARG; break;
  3870. default:
  3871. parse_state->lex_state = EXPR_BEG; break;
  3872. }
  3873. return '~';
  3874. case '(':
  3875. command_start = TRUE;
  3876. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3877. c = tLPAREN;
  3878. }
  3879. else if (space_seen) {
  3880. if (parse_state->lex_state == EXPR_CMDARG) {
  3881. c = tLPAREN_ARG;
  3882. }
  3883. else if (parse_state->lex_state == EXPR_ARG) {
  3884. rb_warn("don't put space before argument parentheses");
  3885. c = '(';
  3886. }
  3887. }
  3888. COND_PUSH(0);
  3889. CMDARG_PUSH(0);
  3890. parse_state->lex_state = EXPR_BEG;
  3891. return c;
  3892. case '[':
  3893. if (parse_state->lex_state == EXPR_FNAME || parse_state->lex_state == EXPR_DOT) {
  3894. parse_state->lex_state = EXPR_ARG;
  3895. if ((c = nextc()) == ']') {
  3896. if ((c = nextc()) == '=') {
  3897. return tASET;
  3898. }
  3899. pushback(c, parse_state);
  3900. return tAREF;
  3901. }
  3902. pushback(c, parse_state);
  3903. return '[';
  3904. }
  3905. else if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3906. c = tLBRACK;
  3907. }
  3908. else if (IS_ARG() && space_seen) {
  3909. c = tLBRACK;
  3910. }
  3911. parse_state->lex_state = EXPR_BEG;
  3912. COND_PUSH(0);
  3913. CMDARG_PUSH(0);
  3914. return c;
  3915. case '{':
  3916. if (IS_ARG() || parse_state->lex_state == EXPR_END)
  3917. c = '{'; /* block (primary) */
  3918. else if (parse_state->lex_state == EXPR_ENDARG)
  3919. c = tLBRACE_ARG; /* block (expr) */
  3920. else
  3921. c = tLBRACE; /* hash */
  3922. COND_PUSH(0);
  3923. CMDARG_PUSH(0);
  3924. parse_state->lex_state = EXPR_BEG;
  3925. return c;
  3926. case '\\':
  3927. c = nextc();
  3928. if (c == '\n') {
  3929. space_seen = 1;
  3930. goto retry; /* skip \\n */
  3931. }
  3932. pushback(c, parse_state);
  3933. if(parse_state->lex_state == EXPR_BEG
  3934. || parse_state->lex_state == EXPR_MID || space_seen) {
  3935. parse_state->lex_state = EXPR_DOT;
  3936. return tUBS;
  3937. }
  3938. parse_state->lex_state = EXPR_DOT;
  3939. return '\\';
  3940. case '%':
  3941. if (parse_state->lex_state == EXPR_BEG || parse_state->lex_state == EXPR_MID) {
  3942. intptr_t term;
  3943. intptr_t paren;
  3944. char tmpstr[256];
  3945. char *cur;
  3946. c = nextc();
  3947. quotation:
  3948. if (!ISALNUM(c)) {
  3949. term = c;
  3950. c = 'Q';
  3951. }
  3952. else {
  3953. term = nextc();
  3954. if (ISALNUM(term) || ismbchar(term)) {
  3955. cur = tmpstr;
  3956. *cur++ = c;
  3957. while(ISALNUM(term) || ismbchar(term)) {
  3958. *cur++ = term;
  3959. term = nextc();
  3960. }
  3961. *cur = 0;
  3962. c = 1;
  3963. }
  3964. }
  3965. if (c == -1 || term == -1) {
  3966. rb_compile_error(parse_state, "unterminated quoted string meets end of file");
  3967. return 0;
  3968. }
  3969. paren = term;
  3970. if (term == '(') term = ')';
  3971. else if (term == '[') term = ']';
  3972. else if (term == '{') term = '}';
  3973. else if (term == '<') term = '>';
  3974. else paren = 0;
  3975. switch (c) {
  3976. case 'Q':
  3977. lex_strterm = NEW_STRTERM(str_dquote, term, paren);
  3978. return tSTRING_BEG;
  3979. case 'q':
  3980. lex_strterm = NEW_STRTERM(str_squote, term, paren);
  3981. return tSTRING_BEG;
  3982. case 'W':
  3983. lex_strterm = NEW_STRTERM(str_dquote | STR_FUNC_QWORDS, term, paren);
  3984. do {c = nextc();} while (ISSPACE(c));
  3985. pushback(c, parse_state);
  3986. return tWORDS_BEG;
  3987. case 'w':
  3988. lex_strterm = NEW_STRTERM(str_squote | STR_FUNC_QWORDS, term, paren);
  3989. do {c = nextc();} while (ISSPACE(c));
  3990. pushback(c, parse_state);
  3991. return tQWORDS_BEG;
  3992. case 'x':
  3993. lex_strterm = NEW_STRTERM(str_xquote, term, paren);
  3994. pslval->id = 0;
  3995. return tXSTRING_BEG;
  3996. case 'r':
  3997. lex_strterm = NEW_STRTERM(str_regexp, term, paren);
  3998. return tREGEXP_BEG;
  3999. case 's':
  4000. lex_strterm = NEW_STRTERM(str_ssym, term, paren);
  4001. parse_state->lex_state = EXPR_FNAME;
  4002. return tSYMBEG;
  4003. case 1:
  4004. lex_strterm = NEW_STRTERM(str_xquote, term, paren);
  4005. pslval->id = rb_intern(tmpstr);
  4006. return tXSTRING_BEG;
  4007. default:
  4008. lex_strterm = NEW_STRTERM(str_xquote, term, paren);
  4009. tmpstr[0] = c;
  4010. tmpstr[1] = 0;
  4011. pslval->id = rb_intern(tmpstr);
  4012. return tXSTRING_BEG;
  4013. }
  4014. }
  4015. if ((c = nextc()) == '=') {
  4016. pslval->id = '%';
  4017. parse_state->lex_state = EXPR_BEG;
  4018. return tOP_ASGN;
  4019. }
  4020. if (IS_ARG() && space_seen && !ISSPACE(c)) {
  4021. goto quotation;
  4022. }
  4023. switch (parse_state->lex_state) {
  4024. case EXPR_FNAME: case EXPR_DOT:
  4025. parse_state->lex_state = EXPR_ARG; break;
  4026. default:
  4027. parse_state->lex_state = EXPR_BEG; break;
  4028. }
  4029. pushback(c, parse_state);
  4030. return '%';
  4031. case '$':
  4032. last_state = parse_state->lex_state;
  4033. parse_state->lex_state = EXPR_END;
  4034. newtok(parse_state);
  4035. c = nextc();
  4036. switch (c) {
  4037. case '_': /* $_: last read line string */
  4038. c = nextc();
  4039. if (is_identchar(c)) {
  4040. tokadd('$', parse_state);
  4041. tokadd('_', parse_state);
  4042. break;
  4043. }
  4044. pushback(c, parse_state);
  4045. c = '_';
  4046. /* fall through */
  4047. case '~': /* $~: match-data */
  4048. local_cnt(c);
  4049. /* fall through */
  4050. case '*': /* $*: argv */
  4051. case '$': /* $$: pid */
  4052. case '?': /* $?: last status */
  4053. case '!': /* $!: error string */
  4054. case '@': /* $@: error position */
  4055. case '/': /* $/: input record separator */
  4056. case '\\': /* $\: output record separator */
  4057. case ';': /* $;: field separator */
  4058. case ',': /* $,: output field separator */
  4059. case '.': /* $.: last read line number */
  4060. case '=': /* $=: ignorecase */
  4061. case ':': /* $:: load path */
  4062. case '<': /* $<: reading filename */
  4063. case '>': /* $>: default output handle */
  4064. case '\"': /* $": already loaded files */
  4065. tokadd('$', parse_state);
  4066. tokadd((char)c, parse_state);
  4067. tokfix();
  4068. pslval->id = rb_intern(tok());
  4069. return tGVAR;
  4070. case '-':
  4071. tokadd('$', parse_state);
  4072. tokadd((char)c, parse_state);
  4073. c = nextc();
  4074. tokadd((char)c, parse_state);
  4075. gvar:
  4076. tokfix();
  4077. pslval->id = rb_intern(tok());
  4078. /* xxx shouldn't check if valid option variable */
  4079. return tGVAR;
  4080. case '&': /* $&: last match */
  4081. case '`': /* $`: string before last match */
  4082. case '\'': /* $': string after last match */
  4083. case '+': /* $+: string matches last paren. */
  4084. if (last_state == EXPR_FNAME) {
  4085. tokadd((char)'$', parse_state);
  4086. tokadd(c, parse_state);
  4087. goto gvar;
  4088. }
  4089. pslval->node = NEW_BACK_REF((intptr_t)c);
  4090. return tBACK_REF;
  4091. case '1': case '2': case '3':
  4092. case '4': case '5': case '6':
  4093. case '7': case '8': case '9':
  4094. tokadd('$', parse_state);
  4095. do {
  4096. tokadd((char)c, parse_state);
  4097. c = nextc();
  4098. } while (ISDIGIT(c));
  4099. pushback(c, parse_state);
  4100. if (last_state == EXPR_FNAME) goto gvar;
  4101. tokfix();
  4102. pslval->node = NEW_NTH_REF((intptr_t)atoi(tok()+1));
  4103. return tNTH_REF;
  4104. default:
  4105. if (!is_identchar(c)) {
  4106. pushback(c, parse_state);
  4107. return '$';
  4108. }
  4109. case '0':
  4110. tokadd('$', parse_state);
  4111. }
  4112. break;
  4113. case '@':
  4114. c = nextc();
  4115. newtok(parse_state);
  4116. tokadd('@', parse_state);
  4117. if (c == '@') {
  4118. tokadd('@', parse_state);
  4119. c = nextc();
  4120. }
  4121. if (ISDIGIT(c)) {
  4122. if (tokidx == 1) {
  4123. rb_compile_error(parse_state,
  4124. "`@%c' is not allowed as an instance variable name", c);
  4125. }
  4126. else {
  4127. rb_compile_error(parse_state,
  4128. "`@@%c' is not allowed as a class variable name", c);
  4129. }
  4130. }
  4131. if (!is_identchar(c)) {
  4132. pushback(c, parse_state);
  4133. return '@';
  4134. }
  4135. break;
  4136. case '_':
  4137. if (was_bol() && whole_match_p("__END__", 7, 0, parse_state)) {
  4138. parse_state->lex_lastline = 0;
  4139. return -1;
  4140. }
  4141. newtok(parse_state);
  4142. break;
  4143. default:
  4144. if (!is_identchar(c)) {
  4145. rb_compile_error(parse_state, "Invalid char `\\%03o' in expression", c);
  4146. goto retry;
  4147. }
  4148. newtok(parse_state);
  4149. break;
  4150. }
  4151. do {
  4152. tokadd((char)c, parse_state);
  4153. if (ismbchar(c)) {
  4154. int i, len = mbclen(c)-1;
  4155. for (i = 0; i < len; i++) {
  4156. c = nextc();
  4157. tokadd((char)c, parse_state);
  4158. }
  4159. }
  4160. c = nextc();
  4161. } while (is_identchar(c));
  4162. if ((c == '!' || c == '?') && is_identchar(tok()[0]) && !peek('=')) {
  4163. tokadd((char)c, parse_state);
  4164. }
  4165. else {
  4166. pushback(c, parse_state);
  4167. }
  4168. tokfix();
  4169. {
  4170. int result = 0;
  4171. last_state = parse_state->lex_state;
  4172. switch (tok()[0]) {
  4173. case '$':
  4174. parse_state->lex_state = EXPR_END;
  4175. result = tGVAR;
  4176. break;
  4177. case '@':
  4178. parse_state->lex_state = EXPR_END;
  4179. if (tok()[1] == '@')
  4180. result = tCVAR;
  4181. else
  4182. result = tIVAR;
  4183. break;
  4184. default:
  4185. if (toklast() == '!' || toklast() == '?') {
  4186. result = tFID;
  4187. }
  4188. else {
  4189. if (parse_state->lex_state == EXPR_FNAME) {
  4190. if ((c = nextc()) == '=' && !peek('~') && !peek('>') &&
  4191. (!peek('=') || (parse_state->lex_p + 1 < parse_state->lex_pend && (parse_state->lex_p)[1] == '>'))) {
  4192. result = tIDENTIFIER;
  4193. tokadd((char)c, parse_state);
  4194. tokfix();
  4195. }
  4196. else {
  4197. pushback(c, parse_state);
  4198. }
  4199. }
  4200. if (result == 0 && ISUPPER(tok()[0])) {
  4201. result = tCONSTANT;
  4202. }
  4203. else {
  4204. result = tIDENTIFIER;
  4205. }
  4206. }
  4207. if (parse_state->lex_state != EXPR_DOT) {
  4208. const struct kwtable *kw;
  4209. /* See if it is a reserved word. */
  4210. kw = syd_reserved_word(tok(), toklen());
  4211. if (kw) {
  4212. enum lex_state state = parse_state->lex_state;
  4213. parse_state->lex_state = kw->state;
  4214. if (state == EXPR_FNAME) {
  4215. pslval->id = rb_intern(kw->name);
  4216. }
  4217. if (kw->id[0] == kDO) {
  4218. if (COND_P()) return kDO_COND;
  4219. if (CMDARG_P() && state != EXPR_CMDARG)
  4220. return kDO_BLOCK;
  4221. if (state == EXPR_ENDARG)
  4222. return kDO_BLOCK;
  4223. return kDO;
  4224. }
  4225. if (state == EXPR_BEG)
  4226. return kw->id[0];
  4227. else {
  4228. if (kw->id[0] != kw->id[1])
  4229. parse_state->lex_state = EXPR_BEG;
  4230. return kw->id[1];
  4231. }
  4232. }
  4233. }
  4234. if (parse_state->lex_state == EXPR_BEG ||
  4235. parse_state->lex_state == EXPR_MID ||
  4236. parse_state->lex_state == EXPR_DOT ||
  4237. parse_state->lex_state == EXPR_ARG ||
  4238. parse_state->lex_state == EXPR_CMDARG) {
  4239. if (cmd_state) {
  4240. parse_state->lex_state = EXPR_CMDARG;
  4241. }
  4242. else {
  4243. parse_state->lex_state = EXPR_ARG;
  4244. }
  4245. }
  4246. else {
  4247. parse_state->lex_state = EXPR_END;
  4248. }
  4249. }
  4250. pslval->id = rb_intern(tok());
  4251. if(is_local_id(pslval->id) &&
  4252. last_state != EXPR_DOT &&
  4253. local_id(pslval->id)) {
  4254. parse_state->lex_state = EXPR_END;
  4255. }
  4256. /* if (is_local_id(pslval->id) && local_id(pslval->id)) { */
  4257. /* parse_state->lex_state = EXPR_END; */
  4258. /* } */
  4259. return result;
  4260. }
  4261. }
  4262. NODE*
  4263. syd_node_newnode(rb_parse_state *st, enum node_type type,
  4264. Object* a0, Object* a1, Object* a2)
  4265. {
  4266. NODE *n = (NODE*)pt_allocate(st, sizeof(NODE));
  4267. n->flags = 0;
  4268. nd_set_type(n, type);
  4269. nd_set_line(n, ruby_sourceline);
  4270. n->nd_file = ruby_sourcefile;
  4271. n->u1.value = a0;
  4272. n->u2.value = a1;
  4273. n->u3.value = a2;
  4274. return n;
  4275. }
  4276. static NODE*
  4277. newline_node(rb_parse_state *parse_state, NODE *node)
  4278. {
  4279. NODE *nl = 0;
  4280. if (node) {
  4281. if (nd_type(node) == NODE_NEWLINE) return node;
  4282. nl = NEW_NEWLINE(node);
  4283. fixpos(nl, node);
  4284. nl->nd_nth = nd_line(node);
  4285. }
  4286. return nl;
  4287. }
  4288. static void
  4289. fixpos(NODE *node, NODE *orig)
  4290. {
  4291. if (!node) return;
  4292. if (!orig) return;
  4293. if (orig == (NODE*)1) return;
  4294. node->nd_file = orig->nd_file;
  4295. nd_set_line(node, nd_line(orig));
  4296. }
  4297. static void
  4298. parser_warning(rb_parse_state *parse_state, NODE *node, const char *mesg)
  4299. {
  4300. int line = ruby_sourceline;
  4301. if(parse_state->emit_warnings) {
  4302. ruby_sourceline = nd_line(node);
  4303. printf("%s:%zi: warning: %s\n", ruby_sourcefile, ruby_sourceline, mesg);
  4304. ruby_sourceline = line;
  4305. }
  4306. }
  4307. static NODE*
  4308. block_append(rb_parse_state *parse_state, NODE *head, NODE *tail)
  4309. {
  4310. NODE *end, *h = head;
  4311. if (tail == 0) return head;
  4312. again:
  4313. if (h == 0) return tail;
  4314. switch (nd_type(h)) {
  4315. case NODE_NEWLINE:
  4316. h = h->nd_next;
  4317. goto again;
  4318. case NODE_STR:
  4319. case NODE_LIT:
  4320. parser_warning(parse_state, h, "unused literal ignored");
  4321. return tail;
  4322. default:
  4323. h = end = NEW_BLOCK(head);
  4324. end->nd_end = end;
  4325. fixpos(end, head);
  4326. head = end;
  4327. break;
  4328. case NODE_BLOCK:
  4329. end = h->nd_end;
  4330. break;
  4331. }
  4332. if (RTEST(ruby_verbose)) {
  4333. NODE *nd = end->nd_head;
  4334. newline:
  4335. switch (nd_type(nd)) {
  4336. case NODE_RETURN:
  4337. case NODE_BREAK:
  4338. case NODE_NEXT:
  4339. case NODE_REDO:
  4340. case NODE_RETRY:
  4341. parser_warning(parse_state, nd, "statement not reached");
  4342. break;
  4343. case NODE_NEWLINE:
  4344. nd = nd->nd_next;
  4345. goto newline;
  4346. default:
  4347. break;
  4348. }
  4349. }
  4350. if (nd_type(tail) != NODE_BLOCK) {
  4351. tail = NEW_BLOCK(tail);
  4352. tail->nd_end = tail;
  4353. }
  4354. end->nd_next = tail;
  4355. h->nd_end = tail->nd_end;
  4356. return head;
  4357. }
  4358. /* append item to the list */
  4359. static NODE*
  4360. list_append(rb_parse_state *parse_state, NODE *list, NODE *item)
  4361. {
  4362. NODE *last;
  4363. if (list == 0) return NEW_LIST(item);
  4364. if (list->nd_next) {
  4365. last = list->nd_next->nd_end;
  4366. }
  4367. else {
  4368. last = list;
  4369. }
  4370. list->nd_alen += 1;
  4371. last->nd_next = NEW_LIST(item);
  4372. list->nd_next->nd_end = last->nd_next;
  4373. return list;
  4374. }
  4375. /* concat two lists */
  4376. static NODE*
  4377. list_concat(NODE *head, NODE *tail)
  4378. {
  4379. NODE *last;
  4380. if (head->nd_next) {
  4381. last = head->nd_next->nd_end;
  4382. }
  4383. else {
  4384. last = head;
  4385. }
  4386. head->nd_alen += tail->nd_alen;
  4387. last->nd_next = tail;
  4388. if (tail->nd_next) {
  4389. head->nd_next->nd_end = tail->nd_next->nd_end;
  4390. }
  4391. else {
  4392. head->nd_next->nd_end = tail;
  4393. }
  4394. return head;
  4395. }
  4396. /* concat two string literals */
  4397. static NODE *
  4398. literal_concat(rb_parse_state *parse_state, NODE *head, NODE *tail)
  4399. {
  4400. enum node_type htype;
  4401. if (!head) return tail;
  4402. if (!tail) return head;
  4403. htype = (enum node_type)nd_type(head);
  4404. if (htype == NODE_EVSTR) {
  4405. NODE *node = NEW_DSTR(string_new(0, 0));
  4406. head = list_append(parse_state, node, head);
  4407. }
  4408. switch (nd_type(tail)) {
  4409. case NODE_STR:
  4410. if (htype == NODE_STR) {
  4411. bconcat(head->nd_str, tail->nd_str);
  4412. bdestroy(tail->nd_str);
  4413. }
  4414. else {
  4415. list_append(parse_state, head, tail);
  4416. }
  4417. break;
  4418. case NODE_DSTR:
  4419. if (htype == NODE_STR) {
  4420. bconcat(head->nd_str, tail->nd_str);
  4421. bdestroy(tail->nd_str);
  4422. tail->nd_lit = head->nd_lit;
  4423. head = tail;
  4424. }
  4425. else {
  4426. nd_set_type(tail, NODE_ARRAY);
  4427. tail->nd_head = NEW_STR(tail->nd_lit);
  4428. list_concat(head, tail);
  4429. }
  4430. break;
  4431. case NODE_EVSTR:
  4432. if (htype == NODE_STR) {
  4433. nd_set_type(head, NODE_DSTR);
  4434. head->nd_alen = 1;
  4435. }
  4436. list_append(parse_state, head, tail);
  4437. break;
  4438. }
  4439. return head;
  4440. }
  4441. static NODE *
  4442. evstr2dstr(rb_parse_state *parse_state, NODE *node)
  4443. {
  4444. if (nd_type(node) == NODE_EVSTR) {
  4445. node = list_append(parse_state, NEW_DSTR(string_new(0, 0)), node);
  4446. }
  4447. return node;
  4448. }
  4449. static NODE *
  4450. new_evstr(rb_parse_state *parse_state, NODE *node)
  4451. {
  4452. NODE *head = node;
  4453. again:
  4454. if (node) {
  4455. switch (nd_type(node)) {
  4456. case NODE_STR: case NODE_DSTR: case NODE_EVSTR:
  4457. return node;
  4458. case NODE_NEWLINE:
  4459. node = node->nd_next;
  4460. goto again;
  4461. }
  4462. }
  4463. return NEW_EVSTR(head);
  4464. }
  4465. static const struct {
  4466. ID token;
  4467. const char name[12];
  4468. } op_tbl[] = {
  4469. {tDOT2, ".."},
  4470. {tDOT3, "..."},
  4471. {'+', "+"},
  4472. {'-', "-"},
  4473. {'+', "+(binary)"},
  4474. {'-', "-(binary)"},
  4475. {'*', "*"},
  4476. {'/', "/"},
  4477. {'%', "%"},
  4478. {tPOW, "**"},
  4479. {tUPLUS, "+@"},
  4480. {tUMINUS, "-@"},
  4481. {tUPLUS, "+(unary)"},
  4482. {tUMINUS, "-(unary)"},
  4483. {'|', "|"},
  4484. {'^', "^"},
  4485. {'&', "&"},
  4486. {tCMP, "<=>"},
  4487. {'>', ">"},
  4488. {tGEQ, ">="},
  4489. {'<', "<"},
  4490. {tLEQ, "<="},
  4491. {tEQ, "=="},
  4492. {tEQQ, "==="},
  4493. {tNEQ, "!="},
  4494. {tMATCH, "=~"},
  4495. {tNMATCH, "!~"},
  4496. {'!', "!"},
  4497. {'~', "~"},
  4498. {'!', "!(unary)"},
  4499. {'~', "~(unary)"},
  4500. {'!', "!@"},
  4501. {'~', "~@"},
  4502. {tAREF, "[]"},
  4503. {tASET, "[]="},
  4504. {tLSHFT, "<<"},
  4505. {tRSHFT, ">>"},
  4506. {tCOLON2, "::"},
  4507. {'`', "`"},
  4508. {0, ""}
  4509. };
  4510. static ID convert_op(ID id) {
  4511. int i;
  4512. for(i = 0; op_tbl[i].token; i++) {
  4513. if(op_tbl[i].token == id) {
  4514. return rb_intern(op_tbl[i].name);
  4515. }
  4516. }
  4517. return id;
  4518. }
  4519. static NODE *
  4520. call_op(NODE *recv, ID id, int narg, NODE *arg1, rb_parse_state *parse_state)
  4521. {
  4522. value_expr(recv);
  4523. if (narg == 1) {
  4524. value_expr(arg1);
  4525. arg1 = NEW_LIST(arg1);
  4526. }
  4527. else {
  4528. arg1 = 0;
  4529. }
  4530. id = convert_op(id);
  4531. return NEW_CALL(recv, id, arg1);
  4532. }
  4533. static NODE*
  4534. match_gen(NODE *node1, NODE *node2, rb_parse_state *parse_state)
  4535. {
  4536. local_cnt('~');
  4537. value_expr(node1);
  4538. value_expr(node2);
  4539. if (node1) {
  4540. switch (nd_type(node1)) {
  4541. case NODE_DREGX:
  4542. case NODE_DREGX_ONCE:
  4543. return NEW_MATCH2(node1, node2);
  4544. case NODE_REGEX:
  4545. return NEW_MATCH2(node1, node2);
  4546. }
  4547. }
  4548. if (node2) {
  4549. switch (nd_type(node2)) {
  4550. case NODE_DREGX:
  4551. case NODE_DREGX_ONCE:
  4552. return NEW_MATCH3(node2, node1);
  4553. case NODE_REGEX:
  4554. return NEW_MATCH3(node2, node1);
  4555. }
  4556. }
  4557. return NEW_CALL(node1, convert_op(tMATCH), NEW_LIST(node2));
  4558. }
  4559. static NODE*
  4560. syd_gettable(rb_parse_state *parse_state, ID id)
  4561. {
  4562. if (id == kSELF) {
  4563. return NEW_SELF();
  4564. }
  4565. else if (id == kNIL) {
  4566. return NEW_NIL();
  4567. }
  4568. else if (id == kTRUE) {
  4569. return NEW_TRUE();
  4570. }
  4571. else if (id == kFALSE) {
  4572. return NEW_FALSE();
  4573. }
  4574. else if (id == k__FILE__) {
  4575. return NEW_FILE();
  4576. }
  4577. else if (id == k__LINE__) {
  4578. return NEW_FIXNUM(ruby_sourceline);
  4579. }
  4580. else if (is_local_id(id)) {
  4581. if (local_id(id)) return NEW_LVAR(id);
  4582. /* method call without arguments */
  4583. return NEW_VCALL(id);
  4584. }
  4585. else if (is_global_id(id)) {
  4586. return NEW_GVAR(id);
  4587. }
  4588. else if (is_instance_id(id)) {
  4589. return NEW_IVAR(id);
  4590. }
  4591. else if (is_const_id(id)) {
  4592. return NEW_CONST(id);
  4593. }
  4594. else if (is_class_id(id)) {
  4595. return NEW_CVAR(id);
  4596. }
  4597. /* FIXME: indicate which identifier. */
  4598. rb_compile_error(parse_state, "identifier is not valid 1\n");
  4599. return 0;
  4600. }
  4601. static void
  4602. reset_block(rb_parse_state *parse_state) {
  4603. if(!parse_state->block_vars) {
  4604. parse_state->block_vars = var_table_create();
  4605. } else {
  4606. parse_state->block_vars = var_table_push(parse_state->block_vars);
  4607. }
  4608. }
  4609. static NODE *
  4610. extract_block_vars(rb_parse_state *parse_state, NODE* node, var_table vars)
  4611. {
  4612. int i;
  4613. NODE *var, *out = node;
  4614. // we don't create any DASGN_CURR nodes
  4615. goto out;
  4616. if (!node) goto out;
  4617. if(var_table_size(vars) == 0) goto out;
  4618. var = NULL;
  4619. for(i = 0; i < var_table_size(vars); i++) {
  4620. var = NEW_DASGN_CURR(var_table_get(vars, i), var);
  4621. }
  4622. out = block_append(parse_state, var, node);
  4623. out:
  4624. assert(vars == parse_state->block_vars);
  4625. parse_state->block_vars = var_table_pop(parse_state->block_vars);
  4626. return out;
  4627. }
  4628. static NODE*
  4629. assignable(ID id, NODE *val, rb_parse_state *parse_state)
  4630. {
  4631. value_expr(val);
  4632. if (id == kSELF) {
  4633. yyerror("Can't change the value of self");
  4634. }
  4635. else if (id == kNIL) {
  4636. yyerror("Can't assign to nil");
  4637. }
  4638. else if (id == kTRUE) {
  4639. yyerror("Can't assign to true");
  4640. }
  4641. else if (id == kFALSE) {
  4642. yyerror("Can't assign to false");
  4643. }
  4644. else if (id == k__FILE__) {
  4645. yyerror("Can't assign to __FILE__");
  4646. }
  4647. else if (id == k__LINE__) {
  4648. yyerror("Can't assign to __LINE__");
  4649. }
  4650. else if (is_local_id(id)) {
  4651. if(parse_state->block_vars) {
  4652. var_table_add(parse_state->block_vars, id);
  4653. }
  4654. return NEW_LASGN(id, val);
  4655. }
  4656. else if (is_global_id(id)) {
  4657. return NEW_GASGN(id, val);
  4658. }
  4659. else if (is_instance_id(id)) {
  4660. return NEW_IASGN(id, val);
  4661. }
  4662. else if (is_const_id(id)) {
  4663. if (in_def || in_single)
  4664. yyerror("dynamic constant assignment");
  4665. return NEW_CDECL(id, val, 0);
  4666. }
  4667. else if (is_class_id(id)) {
  4668. if (in_def || in_single) return NEW_CVASGN(id, val);
  4669. return NEW_CVDECL(id, val);
  4670. }
  4671. else {
  4672. /* FIXME: indicate which identifier. */
  4673. rb_compile_error(parse_state, "identifier is not valid 2 (%d)\n", id);
  4674. }
  4675. return 0;
  4676. }
  4677. static NODE *
  4678. aryset(NODE *recv, NODE *idx, rb_parse_state *parse_state)
  4679. {
  4680. if (recv && nd_type(recv) == NODE_SELF)
  4681. recv = (NODE *)1;
  4682. else
  4683. value_expr(recv);
  4684. return NEW_ATTRASGN(recv, convert_op(tASET), idx);
  4685. }
  4686. static ID
  4687. rb_id_attrset(ID id)
  4688. {
  4689. id &= ~ID_SCOPE_MASK;
  4690. id |= ID_ATTRSET;
  4691. return id;
  4692. }
  4693. static NODE *
  4694. attrset(NODE *recv, ID id, rb_parse_state *parse_state)
  4695. {
  4696. if (recv && nd_type(recv) == NODE_SELF)
  4697. recv = (NODE *)1;
  4698. else
  4699. value_expr(recv);
  4700. return NEW_ATTRASGN(recv, rb_id_attrset(id), 0);
  4701. }
  4702. static void
  4703. rb_backref_error(NODE *node, rb_parse_state *parse_state)
  4704. {
  4705. switch (nd_type(node)) {
  4706. case NODE_NTH_REF:
  4707. rb_compile_error(parse_state, "Can't set variable $%u", node->nd_nth);
  4708. break;
  4709. case NODE_BACK_REF:
  4710. rb_compile_error(parse_state, "Can't set variable $%c", (int)node->nd_nth);
  4711. break;
  4712. }
  4713. }
  4714. static NODE *
  4715. arg_concat(rb_parse_state *parse_state, NODE *node1, NODE *node2)
  4716. {
  4717. if (!node2) return node1;
  4718. return NEW_ARGSCAT(node1, node2);
  4719. }
  4720. static NODE *
  4721. arg_add(rb_parse_state *parse_state, NODE *node1, NODE *node2)
  4722. {
  4723. if (!node1) return NEW_LIST(node2);
  4724. if (nd_type(node1) == NODE_ARRAY) {
  4725. return list_append(parse_state, node1, node2);
  4726. }
  4727. else {
  4728. return NEW_ARGSPUSH(node1, node2);
  4729. }
  4730. }
  4731. static NODE*
  4732. node_assign(NODE *lhs, NODE *rhs, rb_parse_state *parse_state)
  4733. {
  4734. if (!lhs) return 0;
  4735. value_expr(rhs);
  4736. switch (nd_type(lhs)) {
  4737. case NODE_GASGN:
  4738. case NODE_IASGN:
  4739. case NODE_LASGN:
  4740. case NODE_DASGN:
  4741. case NODE_DASGN_CURR:
  4742. case NODE_MASGN:
  4743. case NODE_CDECL:
  4744. case NODE_CVDECL:
  4745. case NODE_CVASGN:
  4746. lhs->nd_value = rhs;
  4747. break;
  4748. case NODE_ATTRASGN:
  4749. case NODE_CALL:
  4750. lhs->nd_args = arg_add(parse_state, lhs->nd_args, rhs);
  4751. break;
  4752. default:
  4753. /* should not happen */
  4754. break;
  4755. }
  4756. return lhs;
  4757. }
  4758. static int
  4759. value_expr0(NODE *node, rb_parse_state *parse_state)
  4760. {
  4761. int cond = 0;
  4762. while (node) {
  4763. switch (nd_type(node)) {
  4764. case NODE_DEFN:
  4765. case NODE_DEFS:
  4766. parser_warning(parse_state, node, "void value expression");
  4767. return FALSE;
  4768. case NODE_RETURN:
  4769. case NODE_BREAK:
  4770. case NODE_NEXT:
  4771. case NODE_REDO:
  4772. case NODE_RETRY:
  4773. if (!cond) yyerror("void value expression");
  4774. /* or "control never reach"? */
  4775. return FALSE;
  4776. case NODE_BLOCK:
  4777. while (node->nd_next) {
  4778. node = node->nd_next;
  4779. }
  4780. node = node->nd_head;
  4781. break;
  4782. case NODE_BEGIN:
  4783. node = node->nd_body;
  4784. break;
  4785. case NODE_IF:
  4786. if (!value_expr(node->nd_body)) return FALSE;
  4787. node = node->nd_else;
  4788. break;
  4789. case NODE_AND:
  4790. case NODE_OR:
  4791. cond = 1;
  4792. node = node->nd_2nd;
  4793. break;
  4794. case NODE_NEWLINE:
  4795. node = node->nd_next;
  4796. break;
  4797. default:
  4798. return TRUE;
  4799. }
  4800. }
  4801. return TRUE;
  4802. }
  4803. static void
  4804. void_expr0(NODE *node)
  4805. {
  4806. const char *useless = NULL;
  4807. if (!RTEST(ruby_verbose)) return;
  4808. again:
  4809. if (!node) return;
  4810. switch (nd_type(node)) {
  4811. case NODE_NEWLINE:
  4812. node = node->nd_next;
  4813. goto again;
  4814. case NODE_CALL:
  4815. switch (node->nd_mid) {
  4816. case '+':
  4817. case '-':
  4818. case '*':
  4819. case '/':
  4820. case '%':
  4821. case tPOW:
  4822. case tUPLUS:
  4823. case tUMINUS:
  4824. case '|':
  4825. case '^':
  4826. case '&':
  4827. case tCMP:
  4828. case '>':
  4829. case tGEQ:
  4830. case '<':
  4831. case tLEQ:
  4832. case tEQ:
  4833. case tNEQ:
  4834. useless = "";
  4835. break;
  4836. }
  4837. break;
  4838. case NODE_LVAR:
  4839. case NODE_DVAR:
  4840. case NODE_GVAR:
  4841. case NODE_IVAR:
  4842. case NODE_CVAR:
  4843. case NODE_NTH_REF:
  4844. case NODE_BACK_REF:
  4845. useless = "a variable";
  4846. break;
  4847. case NODE_CONST:
  4848. case NODE_CREF:
  4849. useless = "a constant";
  4850. break;
  4851. case NODE_LIT:
  4852. case NODE_STR:
  4853. case NODE_DSTR:
  4854. case NODE_DREGX:
  4855. case NODE_DREGX_ONCE:
  4856. useless = "a literal";
  4857. break;
  4858. case NODE_COLON2:
  4859. case NODE_COLON3:
  4860. useless = "::";
  4861. break;
  4862. case NODE_DOT2:
  4863. useless = "..";
  4864. break;
  4865. case NODE_DOT3:
  4866. useless = "...";
  4867. break;
  4868. case NODE_SELF:
  4869. useless = "self";
  4870. break;
  4871. case NODE_NIL:
  4872. useless = "nil";
  4873. break;
  4874. case NODE_TRUE:
  4875. useless = "true";
  4876. break;
  4877. case NODE_FALSE:
  4878. useless = "false";
  4879. break;
  4880. case NODE_DEFINED:
  4881. useless = "defined?";
  4882. break;
  4883. }
  4884. if (useless) {
  4885. int line = ruby_sourceline;
  4886. ruby_sourceline = nd_line(node);
  4887. rb_warn("useless use of %s in void context", useless);
  4888. ruby_sourceline = line;
  4889. }
  4890. }
  4891. static void
  4892. void_stmts(NODE *node, rb_parse_state *parse_state)
  4893. {
  4894. if (!RTEST(ruby_verbose)) return;
  4895. if (!node) return;
  4896. if (nd_type(node) != NODE_BLOCK) return;
  4897. for (;;) {
  4898. if (!node->nd_next) return;
  4899. void_expr(node->nd_head);
  4900. node = node->nd_next;
  4901. }
  4902. }
  4903. static NODE *
  4904. remove_begin(NODE *node, rb_parse_state *parse_state)
  4905. {
  4906. NODE **n = &node;
  4907. while (*n) {
  4908. switch (nd_type(*n)) {
  4909. case NODE_NEWLINE:
  4910. n = &(*n)->nd_next;
  4911. continue;
  4912. case NODE_BEGIN:
  4913. *n = (*n)->nd_body;
  4914. default:
  4915. return node;
  4916. }
  4917. }
  4918. return node;
  4919. }
  4920. static int
  4921. assign_in_cond(NODE *node, rb_parse_state *parse_state)
  4922. {
  4923. switch (nd_type(node)) {
  4924. case NODE_MASGN:
  4925. yyerror("multiple assignment in conditional");
  4926. return 1;
  4927. case NODE_LASGN:
  4928. case NODE_DASGN:
  4929. case NODE_GASGN:
  4930. case NODE_IASGN:
  4931. break;
  4932. case NODE_NEWLINE:
  4933. default:
  4934. return 0;
  4935. }
  4936. switch (nd_type(node->nd_value)) {
  4937. case NODE_LIT:
  4938. case NODE_STR:
  4939. case NODE_NIL:
  4940. case NODE_TRUE:
  4941. case NODE_FALSE:
  4942. return 1;
  4943. case NODE_DSTR:
  4944. case NODE_XSTR:
  4945. case NODE_DXSTR:
  4946. case NODE_EVSTR:
  4947. case NODE_DREGX:
  4948. default:
  4949. break;
  4950. }
  4951. return 1;
  4952. }
  4953. static int
  4954. e_option_supplied()
  4955. {
  4956. if (strcmp(ruby_sourcefile, "-e") == 0)
  4957. return TRUE;
  4958. return FALSE;
  4959. }
  4960. static void
  4961. warn_unless_e_option(rb_parse_state *ps, NODE *node, const char *str)
  4962. {
  4963. if (!e_option_supplied()) parser_warning(ps, node, str);
  4964. }
  4965. static NODE *cond0(NODE *node, rb_parse_state *parse_state);
  4966. static NODE*
  4967. range_op(NODE *node, rb_parse_state *parse_state)
  4968. {
  4969. enum node_type type;
  4970. if (!e_option_supplied()) return node;
  4971. if (node == 0) return 0;
  4972. value_expr(node);
  4973. node = cond0(node, parse_state);
  4974. type = (enum node_type)nd_type(node);
  4975. if (type == NODE_NEWLINE) {
  4976. node = node->nd_next;
  4977. type = (enum node_type)nd_type(node);
  4978. }
  4979. if (type == NODE_LIT && FIXNUM_P(node->nd_lit)) {
  4980. warn_unless_e_option(parse_state, node, "integer literal in conditional range");
  4981. return call_op(node,tEQ,1,NEW_GVAR(rb_intern("$.")), parse_state);
  4982. }
  4983. return node;
  4984. }
  4985. static int
  4986. literal_node(NODE *node)
  4987. {
  4988. if (!node) return 1; /* same as NODE_NIL */
  4989. switch (nd_type(node)) {
  4990. case NODE_LIT:
  4991. case NODE_STR:
  4992. case NODE_DSTR:
  4993. case NODE_EVSTR:
  4994. case NODE_DREGX:
  4995. case NODE_DREGX_ONCE:
  4996. case NODE_DSYM:
  4997. return 2;
  4998. case NODE_TRUE:
  4999. case NODE_FALSE:
  5000. case NODE_NIL:
  5001. return 1;
  5002. }
  5003. return 0;
  5004. }
  5005. static NODE*
  5006. cond0(NODE *node, rb_parse_state *parse_state)
  5007. {
  5008. if (node == 0) return 0;
  5009. assign_in_cond(node, parse_state);
  5010. switch (nd_type(node)) {
  5011. case NODE_DSTR:
  5012. case NODE_EVSTR:
  5013. case NODE_STR:
  5014. break;
  5015. case NODE_DREGX:
  5016. case NODE_DREGX_ONCE:
  5017. local_cnt('_');
  5018. local_cnt('~');
  5019. return NEW_MATCH2(node, NEW_GVAR(rb_intern("$_")));
  5020. case NODE_AND:
  5021. case NODE_OR:
  5022. node->nd_1st = cond0(node->nd_1st, parse_state);
  5023. node->nd_2nd = cond0(node->nd_2nd, parse_state);
  5024. break;
  5025. case NODE_DOT2:
  5026. case NODE_DOT3:
  5027. node->nd_beg = range_op(node->nd_beg, parse_state);
  5028. node->nd_end = range_op(node->nd_end, parse_state);
  5029. if (nd_type(node) == NODE_DOT2) nd_set_type(node,NODE_FLIP2);
  5030. else if (nd_type(node) == NODE_DOT3) nd_set_type(node, NODE_FLIP3);
  5031. if (!e_option_supplied()) {
  5032. int b = literal_node(node->nd_beg);
  5033. int e = literal_node(node->nd_end);
  5034. if ((b == 1 && e == 1) || (b + e >= 2 && RTEST(ruby_verbose))) {
  5035. }
  5036. }
  5037. break;
  5038. case NODE_DSYM:
  5039. break;
  5040. case NODE_REGEX:
  5041. nd_set_type(node, NODE_MATCH);
  5042. local_cnt('_');
  5043. local_cnt('~');
  5044. default:
  5045. break;
  5046. }
  5047. return node;
  5048. }
  5049. static NODE*
  5050. cond(NODE *node, rb_parse_state *parse_state)
  5051. {
  5052. if (node == 0) return 0;
  5053. value_expr(node);
  5054. if (nd_type(node) == NODE_NEWLINE){
  5055. node->nd_next = cond0(node->nd_next, parse_state);
  5056. return node;
  5057. }
  5058. return cond0(node, parse_state);
  5059. }
  5060. static NODE*
  5061. logop(enum node_type type, NODE *left, NODE *right, rb_parse_state *parse_state)
  5062. {
  5063. value_expr(left);
  5064. if (left && nd_type(left) == type) {
  5065. NODE *node = left, *second;
  5066. while ((second = node->nd_2nd) != 0 && nd_type(second) == type) {
  5067. node = second;
  5068. }
  5069. node->nd_2nd = NEW_NODE(type, second, right, 0);
  5070. return left;
  5071. }
  5072. return NEW_NODE(type, left, right, 0);
  5073. }
  5074. static int
  5075. cond_negative(NODE **nodep)
  5076. {
  5077. NODE *c = *nodep;
  5078. if (!c) return 0;
  5079. switch (nd_type(c)) {
  5080. case NODE_NOT:
  5081. *nodep = c->nd_body;
  5082. return 1;
  5083. case NODE_NEWLINE:
  5084. if (c->nd_next && nd_type(c->nd_next) == NODE_NOT) {
  5085. c->nd_next = c->nd_next->nd_body;
  5086. return 1;
  5087. }
  5088. }
  5089. return 0;
  5090. }
  5091. static void
  5092. no_blockarg(rb_parse_state *parse_state, NODE *node)
  5093. {
  5094. if (node && nd_type(node) == NODE_BLOCK_PASS) {
  5095. rb_compile_error(parse_state, "block argument should not be given");
  5096. }
  5097. }
  5098. static NODE *
  5099. ret_args(rb_parse_state *parse_state, NODE *node)
  5100. {
  5101. if (node) {
  5102. no_blockarg(parse_state, node);
  5103. if (nd_type(node) == NODE_ARRAY && node->nd_next == 0) {
  5104. node = node->nd_head;
  5105. }
  5106. if (node && nd_type(node) == NODE_SPLAT) {
  5107. node = NEW_SVALUE(node);
  5108. }
  5109. }
  5110. return node;
  5111. }
  5112. static NODE *
  5113. new_yield(rb_parse_state *parse_state, NODE *node)
  5114. {
  5115. Object* state = Qtrue;
  5116. if (node) {
  5117. no_blockarg(parse_state, node);
  5118. if (nd_type(node) == NODE_ARRAY && node->nd_next == 0) {
  5119. node = node->nd_head;
  5120. state = Qfalse;
  5121. }
  5122. if (node && nd_type(node) == NODE_SPLAT) {
  5123. state = Qtrue;
  5124. }
  5125. }
  5126. else {
  5127. state = Qfalse;
  5128. }
  5129. return NEW_YIELD(node, state);
  5130. }
  5131. static NODE *
  5132. arg_blk_pass(NODE *node1, NODE *node2)
  5133. {
  5134. if (node2) {
  5135. node2->nd_head = node1;
  5136. return node2;
  5137. }
  5138. return node1;
  5139. }
  5140. static NODE*
  5141. arg_prepend(rb_parse_state *parse_state, NODE *node1, NODE *node2)
  5142. {
  5143. switch (nd_type(node2)) {
  5144. case NODE_ARRAY:
  5145. return list_concat(NEW_LIST(node1), node2);
  5146. case NODE_SPLAT:
  5147. return arg_concat(parse_state, node1, node2->nd_head);
  5148. case NODE_BLOCK_PASS:
  5149. node2->nd_body = arg_prepend(parse_state, node1, node2->nd_body);
  5150. return node2;
  5151. default:
  5152. printf("unknown nodetype(%d) for arg_prepend", nd_type(node2));
  5153. abort();
  5154. }
  5155. return 0; /* not reached */
  5156. }
  5157. static NODE*
  5158. new_call(rb_parse_state *parse_state,NODE *r,ID m,NODE *a)
  5159. {
  5160. if (a && nd_type(a) == NODE_BLOCK_PASS) {
  5161. a->nd_iter = NEW_CALL(r,convert_op(m),a->nd_head);
  5162. return a;
  5163. }
  5164. return NEW_CALL(r,convert_op(m),a);
  5165. }
  5166. static NODE*
  5167. new_fcall(rb_parse_state *parse_state,ID m,NODE *a)
  5168. {
  5169. if (a && nd_type(a) == NODE_BLOCK_PASS) {
  5170. a->nd_iter = NEW_FCALL(m,a->nd_head);
  5171. return a;
  5172. }
  5173. return NEW_FCALL(m,a);
  5174. }
  5175. static NODE*
  5176. new_super(rb_parse_state *parse_state,NODE *a)
  5177. {
  5178. if (a && nd_type(a) == NODE_BLOCK_PASS) {
  5179. a->nd_iter = NEW_SUPER(a->nd_head);
  5180. return a;
  5181. }
  5182. return NEW_SUPER(a);
  5183. }
  5184. static void
  5185. syd_local_push(rb_parse_state *st, int top)
  5186. {
  5187. st->variables = var_table_push(st->variables);
  5188. }
  5189. static void
  5190. syd_local_pop(rb_parse_state *st)
  5191. {
  5192. st->variables = var_table_pop(st->variables);
  5193. }
  5194. static ID*
  5195. syd_local_tbl(rb_parse_state *st)
  5196. {
  5197. ID *lcl_tbl;
  5198. var_table tbl;
  5199. int i, len;
  5200. tbl = st->variables;
  5201. len = var_table_size(tbl);
  5202. lcl_tbl = (ID*)pt_allocate(st, sizeof(ID) * (len + 3));
  5203. lcl_tbl[0] = (ID)len;
  5204. lcl_tbl[1] = '_';
  5205. lcl_tbl[2] = '~';
  5206. for(i = 0; i < len; i++) {
  5207. lcl_tbl[i + 3] = var_table_get(tbl, i);
  5208. }
  5209. return lcl_tbl;
  5210. }
  5211. static intptr_t
  5212. syd_local_cnt(rb_parse_state *st, ID id)
  5213. {
  5214. int idx;
  5215. /* Leave these hardcoded here because they arne't REALLY ids at all. */
  5216. if(id == '_') {
  5217. return 0;
  5218. } else if(id == '~') {
  5219. return 1;
  5220. }
  5221. idx = var_table_find(st->variables, id);
  5222. if(idx >= 0) return idx + 2;
  5223. return var_table_add(st->variables, id);
  5224. }
  5225. static int
  5226. syd_local_id(rb_parse_state *st, ID id)
  5227. {
  5228. if(var_table_find(st->variables, id) >= 0) return 1;
  5229. return 0;
  5230. }
  5231. static ID
  5232. rb_intern(const char *name)
  5233. {
  5234. const char *m = name;
  5235. ID id, pre, qrk, bef;
  5236. int last;
  5237. id = 0;
  5238. last = strlen(name)-1;
  5239. switch (*name) {
  5240. case '$':
  5241. id |= ID_GLOBAL;
  5242. m++;
  5243. if (!is_identchar(*m)) m++;
  5244. break;
  5245. case '@':
  5246. if (name[1] == '@') {
  5247. m++;
  5248. id |= ID_CLASS;
  5249. }
  5250. else {
  5251. id |= ID_INSTANCE;
  5252. }
  5253. m++;
  5254. break;
  5255. default:
  5256. if (name[0] != '_' && !ISALPHA(name[0]) && !ismbchar(name[0])) {
  5257. int i;
  5258. for (i=0; op_tbl[i].token; i++) {
  5259. if (*op_tbl[i].name == *name &&
  5260. strcmp(op_tbl[i].name, name) == 0) {
  5261. id = op_tbl[i].token;
  5262. return id;
  5263. }
  5264. }
  5265. }
  5266. if (name[last] == '=') {
  5267. id = ID_ATTRSET;
  5268. }
  5269. else if (ISUPPER(name[0])) {
  5270. id = ID_CONST;
  5271. }
  5272. else {
  5273. id = ID_LOCAL;
  5274. }
  5275. break;
  5276. }
  5277. while (m <= name + last && is_identchar(*m)) {
  5278. m += mbclen(*m);
  5279. }
  5280. if (*m) id = ID_JUNK;
  5281. qrk = (ID)quark_from_string(name);
  5282. pre = qrk + tLAST_TOKEN;
  5283. bef = id;
  5284. id |= ( pre << ID_SCOPE_SHIFT );
  5285. return id;
  5286. }
  5287. quark id_to_quark(ID id) {
  5288. quark qrk;
  5289. qrk = (quark)((id >> ID_SCOPE_SHIFT) - tLAST_TOKEN);
  5290. return qrk;
  5291. }
  5292. static unsigned long
  5293. scan_oct(const char *start, int len, int *retlen)
  5294. {
  5295. register const char *s = start;
  5296. register unsigned long retval = 0;
  5297. while (len-- && *s >= '0' && *s <= '7') {
  5298. retval <<= 3;
  5299. retval |= *s++ - '0';
  5300. }
  5301. *retlen = s - start;
  5302. return retval;
  5303. }
  5304. static unsigned long
  5305. scan_hex(const char *start, int len, int *retlen)
  5306. {
  5307. static const char hexdigit[] = "0123456789abcdef0123456789ABCDEF";
  5308. register const char *s = start;
  5309. register unsigned long retval = 0;
  5310. char *tmp;
  5311. while (len-- && *s && (tmp = strchr(hexdigit, *s))) {
  5312. retval <<= 4;
  5313. retval |= (tmp - hexdigit) & 15;
  5314. s++;
  5315. }
  5316. *retlen = s - start;
  5317. return retval;
  5318. }
  5319. const char *op_to_name(ID id) {
  5320. if(id < tLAST_TOKEN) {
  5321. int i = 0;
  5322. for (i=0; op_tbl[i].token; i++) {
  5323. if (op_tbl[i].token == id)
  5324. return op_tbl[i].name;
  5325. }
  5326. }
  5327. return NULL;
  5328. }
  5329. }; // namespace parser
  5330. }; // namespace rubinius