PageRenderTime 42ms CodeModel.GetById 26ms RepoModel.GetById 0ms app.codeStats 0ms

/lib/ext/melbourne/grammar.y

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