PageRenderTime 79ms CodeModel.GetById 22ms RepoModel.GetById 0ms app.codeStats 0ms

/lib/ext/melbourne/grammar.y

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