PageRenderTime 119ms CodeModel.GetById 19ms RepoModel.GetById 1ms app.codeStats 1ms

/vm/parser/grammar.y

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