3 * Copyright (c) 1991-2002, 2003, 2004, 2005, 2006 Larry Wall
4 * Copyright (c) 2007, 2008, 2009, 2010, 2011 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'I see,' laughed Strider. 'I look foul and feel fair. Is that it?
13 * All that is gold does not glitter, not all those who wander are lost.'
15 * [p.171 of _The Lord of the Rings_, I/x: "Strider"]
19 * This file holds the grammar for the Perl language. If edited, you need
20 * to run regen_perly.pl, which re-creates the files perly.h, perly.tab
21 * and perly.act which are derived from this.
23 * Note that these derived files are included and compiled twice; once
24 * from perly.c, and once from madly.c. The second time, a number of MAD
25 * macros are defined, which compile in extra code that allows the parse
26 * tree to be accurately dumped. In particular:
28 * MAD defined if compiling madly.c
29 * DO_MAD(A) expands to A under madly.c, to null otherwise
30 * IF_MAD(a,b) expands to A under madly.c, to B otherwise
31 * TOKEN_GETMAD() expands to token_getmad() under madly.c, to null otherwise
32 * TOKEN_FREE() similarly
33 * OP_GETMAD() similarly
34 * IVAL(i) expands to (i)->tk_lval.ival or (i)
35 * PVAL(p) expands to (p)->tk_lval.pval or (p)
37 * The main job of of this grammar is to call the various newFOO()
38 * functions in op.c to build a syntax tree of OP structs.
39 * It relies on the lexer in toke.c to do the tokenizing.
41 * Note: due to the way that the cleanup code works WRT to freeing ops on
42 * the parse stack, it is dangerous to assign to the $n variables within
46 /* Make the parser re-entrant. */
50 /* FIXME for MAD - is the new mintro on while and until important? */
55 I32 ival; /* __DEFAULT__ (marker for regen_perly.pl;
56 must always be 1st union member) */
60 #ifdef PERL_IN_MADLY_C
72 %token <ival> GRAMPROG GRAMEXPR GRAMBLOCK GRAMBARESTMT GRAMFULLSTMT GRAMSTMTSEQ
74 %token <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
76 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF QWLIST
77 %token <opval> FUNC0OP FUNC0SUB UNIOPSUB LSTOPSUB
78 %token <opval> PLUGEXPR PLUGSTMT
79 %token <p_tkval> LABEL
80 %token <i_tkval> FORMAT SUB ANONSUB PACKAGE USE
81 %token <i_tkval> WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
82 %token <i_tkval> GIVEN WHEN DEFAULT
83 %token <i_tkval> LOOPEX DOTDOT YADAYADA
84 %token <i_tkval> FUNC0 FUNC1 FUNC UNIOP LSTOP
85 %token <i_tkval> RELOP EQOP MULOP ADDOP
86 %token <i_tkval> DOLSHARP DO HASHBRACK NOAMP
87 %token <i_tkval> LOCAL MY MYSUB REQUIRE
88 %token <i_tkval> COLONATTR
90 %type <ival> grammar remember mremember
91 %type <ival> startsub startanonsub startformsub
92 /* FIXME for MAD - are these two ival? */
93 %type <ival> mydefsv mintro
95 %type <opval> stmtseq fullstmt labfullstmt barestmt block mblock else
96 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
97 %type <opval> listexpr nexpr texpr iexpr mexpr mnexpr miexpr
98 %type <opval> optlistexpr optexpr indirob listop method
99 %type <opval> formname subname proto subbody cont my_scalar
100 %type <opval> subattrlist myattrlist myattrterm myterm
101 %type <opval> termbinop termunop anonymous termdo
103 %nonassoc <i_tkval> PREC_LOW
106 %left <i_tkval> OROP DOROP
107 %left <i_tkval> ANDOP
108 %right <i_tkval> NOTOP
109 %nonassoc LSTOP LSTOPSUB
111 %right <i_tkval> ASSIGNOP
112 %right <i_tkval> '?' ':'
113 %nonassoc DOTDOT YADAYADA
114 %left <i_tkval> OROR DORDOR
115 %left <i_tkval> ANDAND
116 %left <i_tkval> BITOROP
117 %left <i_tkval> BITANDOP
120 %nonassoc UNIOP UNIOPSUB
122 %left <i_tkval> SHIFTOP
125 %left <i_tkval> MATCHOP
126 %right <i_tkval> '!' '~' UMINUS REFGEN
127 %right <i_tkval> POWOP
128 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
129 %left <i_tkval> ARROW
130 %nonassoc <i_tkval> ')'
138 /* Top-level choice of what kind of thing yyparse was called to parse */
141 PL_parser->expect = XSTATE;
145 newPROG(block_end($3,$4));
150 parser->expect = XTERM;
159 parser->expect = XBLOCK;
163 PL_pad_reset_pending = TRUE;
167 parser->yychar = YYEOF;
171 parser->expect = XSTATE;
175 PL_pad_reset_pending = TRUE;
179 parser->yychar = YYEOF;
183 parser->expect = XSTATE;
187 PL_pad_reset_pending = TRUE;
191 parser->yychar = YYEOF;
195 parser->expect = XSTATE;
204 /* An ordinary block */
205 block : '{' remember stmtseq '}'
206 { if (PL_parser->copline > (line_t)IVAL($1))
207 PL_parser->copline = (line_t)IVAL($1);
208 $$ = block_end($2, $3);
209 TOKEN_GETMAD($1,$$,'{');
210 TOKEN_GETMAD($4,$$,'}');
214 remember: /* NULL */ /* start a full lexical scope */
215 { $$ = block_start(TRUE); }
218 mydefsv: /* NULL */ /* lexicalize $_ */
219 { $$ = (I32) Perl_allocmy(aTHX_ STR_WITH_LEN("$_"), 0); }
222 mblock : '{' mremember stmtseq '}'
223 { if (PL_parser->copline > (line_t)IVAL($1))
224 PL_parser->copline = (line_t)IVAL($1);
225 $$ = block_end($2, $3);
226 TOKEN_GETMAD($1,$$,'{');
227 TOKEN_GETMAD($4,$$,'}');
231 mremember: /* NULL */ /* start a partial lexical scope */
232 { $$ = block_start(FALSE); }
235 /* A sequence of statements in the program */
239 { $$ = op_append_list(OP_LINESEQ, $1, $2);
240 PL_pad_reset_pending = TRUE;
242 PL_hints |= HINT_BLOCK_SCOPE;
246 /* A statement in the program, including optional labels */
250 $$ = newSTATEOP(0, NULL, $1);
252 $$ = IF_MAD(newOP(OP_NULL, 0), NULL);
259 labfullstmt: LABEL barestmt
261 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
262 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
264 $2 ? cLISTOPx($$)->op_first : $$, 'L');
268 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
269 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
270 TOKEN_GETMAD($1, cLISTOPx($$)->op_first, 'L');
274 /* A bare statement, lacking label and other aspects of state op */
279 $$ = newOP(OP_NULL,0);
280 TOKEN_GETMAD($1,$$,'p');
282 | FORMAT startformsub formname block
284 CV *fmtcv = PL_compcv;
285 SvREFCNT_inc_simple_void(PL_compcv);
287 $$ = newFORM($2, $3, $4);
288 prepend_madprops($1->tk_mad, $$, 'F');
295 if (CvOUTSIDE(fmtcv) && !CvUNIQUE(CvOUTSIDE(fmtcv))) {
296 SvREFCNT_inc_simple_void(fmtcv);
297 pad_add_anon(fmtcv, OP_NULL);
300 | SUB startsub subname proto subattrlist subbody
302 SvREFCNT_inc_simple_void(PL_compcv);
305 OP* o = newSVOP(OP_ANONCODE, 0,
306 (SV*)newATTRSUB($2, $3, $4, $5, $6));
307 $$ = newOP(OP_NULL,0);
309 op_getmad($3,$$,'n');
310 op_getmad($4,$$,'s');
311 op_getmad($5,$$,'a');
312 token_getmad($1,$$,'d');
313 append_madprops($6->op_madprop, $$, 0);
317 newATTRSUB($2, $3, $4, $5, $6);
321 | MYSUB startsub subname proto subattrlist subbody
323 /* Unimplemented "my sub foo { }" */
324 SvREFCNT_inc_simple_void(PL_compcv);
326 $$ = newMYSUB($2, $3, $4, $5, $6);
327 token_getmad($1,$$,'d');
329 newMYSUB($2, $3, $4, $5, $6);
333 | PACKAGE WORD WORD ';'
337 token_getmad($1,$$,'o');
340 token_getmad($4,$$,';');
349 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
350 WORD WORD optlistexpr ';'
352 SvREFCNT_inc_simple_void(PL_compcv);
354 $$ = utilize(IVAL($1), $2, $4, $5, $6);
355 token_getmad($1,$$,'o');
356 token_getmad($7,$$,';');
357 if (PL_parser->rsfp_filters &&
358 AvFILLp(PL_parser->rsfp_filters) >= 0)
359 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
361 utilize(IVAL($1), $2, $4, $5, $6);
365 | IF '(' remember mexpr ')' mblock else
368 newCONDOP(0, $4, op_scope($6), $7));
369 TOKEN_GETMAD($1,$$,'I');
370 TOKEN_GETMAD($2,$$,'(');
371 TOKEN_GETMAD($5,$$,')');
372 PL_parser->copline = (line_t)IVAL($1);
374 | UNLESS '(' remember miexpr ')' mblock else
377 newCONDOP(0, $4, op_scope($6), $7));
378 TOKEN_GETMAD($1,$$,'I');
379 TOKEN_GETMAD($2,$$,'(');
380 TOKEN_GETMAD($5,$$,')');
381 PL_parser->copline = (line_t)IVAL($1);
383 | GIVEN '(' remember mydefsv mexpr ')' mblock
386 newGIVENOP($5, op_scope($7), (PADOFFSET)$4));
387 PL_parser->copline = (line_t)IVAL($1);
389 | WHEN '(' remember mexpr ')' mblock
390 { $$ = block_end($3, newWHENOP($4, op_scope($6))); }
392 { $$ = newWHENOP(0, op_scope($2)); }
393 | WHILE '(' remember texpr ')' mintro mblock cont
396 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
398 TOKEN_GETMAD($1,$$,'W');
399 TOKEN_GETMAD($2,$$,'(');
400 TOKEN_GETMAD($5,$$,')');
401 PL_parser->copline = (line_t)IVAL($1);
403 | UNTIL '(' remember iexpr ')' mintro mblock cont
406 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
408 TOKEN_GETMAD($1,$$,'W');
409 TOKEN_GETMAD($2,$$,'(');
410 TOKEN_GETMAD($5,$$,')');
411 PL_parser->copline = (line_t)IVAL($1);
413 | FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
416 OP *initop = IF_MAD($4 ? $4 : newOP(OP_NULL, 0), $4);
417 OP *forop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
418 scalar($6), $11, $9, $8);
420 forop = op_prepend_elem(OP_LINESEQ, initop,
421 op_append_elem(OP_LINESEQ,
422 newOP(OP_UNSTACK, OPf_SPECIAL),
425 DO_MAD({ forop = newUNOP(OP_NULL, 0, forop); })
426 $$ = block_end($3, forop);
427 TOKEN_GETMAD($1,$$,'3');
428 TOKEN_GETMAD($2,$$,'(');
429 TOKEN_GETMAD($5,$$,'1');
430 TOKEN_GETMAD($7,$$,'2');
431 TOKEN_GETMAD($10,$$,')');
432 PL_parser->copline = (line_t)IVAL($1);
434 | FOR MY remember my_scalar '(' mexpr ')' mblock cont
436 $$ = block_end($3, newFOROP(0, $4, $6, $8, $9));
437 TOKEN_GETMAD($1,$$,'W');
438 TOKEN_GETMAD($2,$$,'d');
439 TOKEN_GETMAD($5,$$,'(');
440 TOKEN_GETMAD($7,$$,')');
441 PL_parser->copline = (line_t)IVAL($1);
443 | FOR scalar '(' remember mexpr ')' mblock cont
445 $$ = block_end($4, newFOROP(0,
446 op_lvalue($2, OP_ENTERLOOP), $5, $7, $8));
447 TOKEN_GETMAD($1,$$,'W');
448 TOKEN_GETMAD($3,$$,'(');
449 TOKEN_GETMAD($6,$$,')');
450 PL_parser->copline = (line_t)IVAL($1);
452 | FOR '(' remember mexpr ')' mblock cont
455 newFOROP(0, (OP*)NULL, $4, $6, $7));
456 TOKEN_GETMAD($1,$$,'W');
457 TOKEN_GETMAD($2,$$,'(');
458 TOKEN_GETMAD($5,$$,')');
459 PL_parser->copline = (line_t)IVAL($1);
463 /* a block is a loop that happens once */
464 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
465 (OP*)NULL, $1, $2, 0);
467 | PACKAGE WORD WORD '{' remember
469 int save_3_latefree = $3->op_latefree;
472 $3->op_latefree = save_3_latefree;
474 int save_2_latefree = $2->op_latefree;
477 $2->op_latefree = save_2_latefree;
482 /* a block is a loop that happens once */
483 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
484 (OP*)NULL, block_end($5, $7), (OP*)NULL, 0);
488 TOKEN_GETMAD($4,$$,'{');
489 TOKEN_GETMAD($8,$$,'}');
490 if (PL_parser->copline > (line_t)IVAL($4))
491 PL_parser->copline = (line_t)IVAL($4);
495 PL_parser->expect = XSTATE;
497 TOKEN_GETMAD($2,$$,';');
501 PL_parser->expect = XSTATE;
502 $$ = IF_MAD(newOP(OP_NULL, 0), (OP*)NULL);
503 TOKEN_GETMAD($1,$$,';');
504 PL_parser->copline = NOLINE;
508 /* An expression which may have a side-effect */
514 { $$ = newLOGOP(OP_AND, 0, $3, $1);
515 TOKEN_GETMAD($2,$$,'i');
518 { $$ = newLOGOP(OP_OR, 0, $3, $1);
519 TOKEN_GETMAD($2,$$,'i');
522 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
523 TOKEN_GETMAD($2,$$,'w');
526 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
527 TOKEN_GETMAD($2,$$,'w');
530 { $$ = newFOROP(0, (OP*)NULL, $3, $1, (OP*)NULL);
531 TOKEN_GETMAD($2,$$,'w');
532 PL_parser->copline = (line_t)IVAL($2);
535 { $$ = newWHENOP($3, op_scope($1)); }
538 /* else and elsif blocks */
543 ($2)->op_flags |= OPf_PARENS;
545 TOKEN_GETMAD($1,$$,'o');
547 | ELSIF '(' mexpr ')' mblock else
548 { PL_parser->copline = (line_t)IVAL($1);
550 newSTATEOP(OPf_SPECIAL,NULL,$3),
552 PL_hints |= HINT_BLOCK_SCOPE;
553 TOKEN_GETMAD($1,$$,'I');
554 TOKEN_GETMAD($2,$$,'(');
555 TOKEN_GETMAD($4,$$,')');
559 /* Continue blocks */
565 TOKEN_GETMAD($1,$$,'o');
569 /* determine whether there are any new my declarations */
571 { $$ = (PL_min_intro_pending &&
572 PL_max_intro_pending >= PL_min_intro_pending);
575 /* Normal expression */
581 /* Boolean expression */
582 texpr : /* NULL means true */
584 (void)scan_num("1", &tmplval);
585 $$ = tmplval.opval; }
589 /* Inverted boolean expression */
591 { $$ = invert(scalar($1)); }
594 /* Expression with its own lexical scope */
596 { $$ = $1; intro_my(); }
600 { $$ = $1; intro_my(); }
604 { $$ = $1; intro_my(); }
607 formname: WORD { $$ = $1; }
608 | /* NULL */ { $$ = (OP*)NULL; }
611 startsub: /* NULL */ /* start a regular subroutine scope */
612 { $$ = start_subparse(FALSE, 0);
613 SAVEFREESV(PL_compcv); }
617 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
618 { $$ = start_subparse(FALSE, CVf_ANON);
619 SAVEFREESV(PL_compcv); }
622 startformsub: /* NULL */ /* start a format subroutine scope */
623 { $$ = start_subparse(TRUE, 0);
624 SAVEFREESV(PL_compcv); }
627 /* Name of a subroutine - must be a bareword, could be special */
628 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
629 if (strEQ(name, "BEGIN") || strEQ(name, "END")
630 || strEQ(name, "INIT") || strEQ(name, "CHECK")
631 || strEQ(name, "UNITCHECK"))
632 CvSPECIAL_on(PL_compcv);
636 /* Subroutine prototype */
642 /* Optional list of subroutine attributes */
643 subattrlist: /* NULL */
647 TOKEN_GETMAD($1,$$,':');
654 TOKEN_GETMAD($1,$$,':');
658 /* List of attributes for a "my" variable declaration */
659 myattrlist: COLONATTR THING
661 TOKEN_GETMAD($1,$$,':');
668 TOKEN_GETMAD($1,$$,':');
672 /* Subroutine body - either null or a block */
673 subbody : block { $$ = $1; }
678 PL_parser->expect = XSTATE;
679 TOKEN_GETMAD($1,$$,';');
683 /* Ordinary expressions; logical combinations */
684 expr : expr ANDOP expr
685 { $$ = newLOGOP(OP_AND, 0, $1, $3);
686 TOKEN_GETMAD($2,$$,'o');
689 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
690 TOKEN_GETMAD($2,$$,'o');
693 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
694 TOKEN_GETMAD($2,$$,'o');
696 | listexpr %prec PREC_LOW
699 /* Expressions are a list of terms joined by commas */
700 listexpr: listexpr ','
703 OP* op = newNULLLIST();
704 token_getmad($2,op,',');
705 $$ = op_append_elem(OP_LIST, $1, op);
714 term = newUNOP(OP_NULL, 0, term);
715 token_getmad($2,term,',');
717 $$ = op_append_elem(OP_LIST, $1, term);
719 | term %prec PREC_LOW
723 listop : LSTOP indirob listexpr /* map {...} @args or print $fh @args */
724 { $$ = convert(IVAL($1), OPf_STACKED,
725 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
726 TOKEN_GETMAD($1,$$,'o');
728 | FUNC '(' indirob expr ')' /* print ($fh @args */
729 { $$ = convert(IVAL($1), OPf_STACKED,
730 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
731 TOKEN_GETMAD($1,$$,'o');
732 TOKEN_GETMAD($2,$$,'(');
733 TOKEN_GETMAD($5,$$,')');
735 | term ARROW method '(' optexpr ')' /* $foo->bar(list) */
736 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
737 op_append_elem(OP_LIST,
738 op_prepend_elem(OP_LIST, scalar($1), $5),
739 newUNOP(OP_METHOD, 0, $3)));
740 TOKEN_GETMAD($2,$$,'A');
741 TOKEN_GETMAD($4,$$,'(');
742 TOKEN_GETMAD($6,$$,')');
744 | term ARROW method /* $foo->bar */
745 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
746 op_append_elem(OP_LIST, scalar($1),
747 newUNOP(OP_METHOD, 0, $3)));
748 TOKEN_GETMAD($2,$$,'A');
750 | METHOD indirob optlistexpr /* new Class @args */
751 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
752 op_append_elem(OP_LIST,
753 op_prepend_elem(OP_LIST, $2, $3),
754 newUNOP(OP_METHOD, 0, $1)));
756 | FUNCMETH indirob '(' optexpr ')' /* method $object (@args) */
757 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
758 op_append_elem(OP_LIST,
759 op_prepend_elem(OP_LIST, $2, $4),
760 newUNOP(OP_METHOD, 0, $1)));
761 TOKEN_GETMAD($3,$$,'(');
762 TOKEN_GETMAD($5,$$,')');
764 | LSTOP optlistexpr /* print @args */
765 { $$ = convert(IVAL($1), 0, $2);
766 TOKEN_GETMAD($1,$$,'o');
768 | FUNC '(' optexpr ')' /* print (@args) */
769 { $$ = convert(IVAL($1), 0, $3);
770 TOKEN_GETMAD($1,$$,'o');
771 TOKEN_GETMAD($2,$$,'(');
772 TOKEN_GETMAD($4,$$,')');
774 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
775 { SvREFCNT_inc_simple_void(PL_compcv);
776 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
777 optlistexpr %prec LSTOP /* ... @bar */
778 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
779 op_append_elem(OP_LIST,
780 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
784 /* Names of methods. May use $object->$methodname */
789 /* Some kind of subscripted expression */
790 subscripted: star '{' expr ';' '}' /* *main::{something} */
791 /* In this and all the hash accessors, ';' is
792 * provided by the tokeniser */
793 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
794 PL_parser->expect = XOPERATOR;
795 TOKEN_GETMAD($2,$$,'{');
796 TOKEN_GETMAD($4,$$,';');
797 TOKEN_GETMAD($5,$$,'}');
799 | scalar '[' expr ']' /* $array[$element] */
800 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
801 TOKEN_GETMAD($2,$$,'[');
802 TOKEN_GETMAD($4,$$,']');
804 | term ARROW '[' expr ']' /* somearef->[$element] */
805 { $$ = newBINOP(OP_AELEM, 0,
806 ref(newAVREF($1),OP_RV2AV),
808 TOKEN_GETMAD($2,$$,'a');
809 TOKEN_GETMAD($3,$$,'[');
810 TOKEN_GETMAD($5,$$,']');
812 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
813 { $$ = newBINOP(OP_AELEM, 0,
814 ref(newAVREF($1),OP_RV2AV),
816 TOKEN_GETMAD($2,$$,'[');
817 TOKEN_GETMAD($4,$$,']');
819 | scalar '{' expr ';' '}' /* $foo{bar();} */
820 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
821 PL_parser->expect = XOPERATOR;
822 TOKEN_GETMAD($2,$$,'{');
823 TOKEN_GETMAD($4,$$,';');
824 TOKEN_GETMAD($5,$$,'}');
826 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
827 { $$ = newBINOP(OP_HELEM, 0,
828 ref(newHVREF($1),OP_RV2HV),
830 PL_parser->expect = XOPERATOR;
831 TOKEN_GETMAD($2,$$,'a');
832 TOKEN_GETMAD($3,$$,'{');
833 TOKEN_GETMAD($5,$$,';');
834 TOKEN_GETMAD($6,$$,'}');
836 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
837 { $$ = newBINOP(OP_HELEM, 0,
838 ref(newHVREF($1),OP_RV2HV),
840 PL_parser->expect = XOPERATOR;
841 TOKEN_GETMAD($2,$$,'{');
842 TOKEN_GETMAD($4,$$,';');
843 TOKEN_GETMAD($5,$$,'}');
845 | term ARROW '(' ')' /* $subref->() */
846 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
847 newCVREF(0, scalar($1)));
848 TOKEN_GETMAD($2,$$,'a');
849 TOKEN_GETMAD($3,$$,'(');
850 TOKEN_GETMAD($4,$$,')');
852 | term ARROW '(' expr ')' /* $subref->(@args) */
853 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
854 op_append_elem(OP_LIST, $4,
855 newCVREF(0, scalar($1))));
856 TOKEN_GETMAD($2,$$,'a');
857 TOKEN_GETMAD($3,$$,'(');
858 TOKEN_GETMAD($5,$$,')');
861 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
862 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
863 op_append_elem(OP_LIST, $3,
864 newCVREF(0, scalar($1))));
865 TOKEN_GETMAD($2,$$,'(');
866 TOKEN_GETMAD($4,$$,')');
868 | subscripted '(' ')' /* $foo->{bar}->() */
869 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
870 newCVREF(0, scalar($1)));
871 TOKEN_GETMAD($2,$$,'(');
872 TOKEN_GETMAD($3,$$,')');
874 | '(' expr ')' '[' expr ']' /* list slice */
875 { $$ = newSLICEOP(0, $5, $2);
876 TOKEN_GETMAD($1,$$,'(');
877 TOKEN_GETMAD($3,$$,')');
878 TOKEN_GETMAD($4,$$,'[');
879 TOKEN_GETMAD($6,$$,']');
881 | QWLIST '[' expr ']' /* list literal slice */
882 { $$ = newSLICEOP(0, $3, $1);
883 TOKEN_GETMAD($2,$$,'[');
884 TOKEN_GETMAD($4,$$,']');
886 | '(' ')' '[' expr ']' /* empty list slice! */
887 { $$ = newSLICEOP(0, $4, (OP*)NULL);
888 TOKEN_GETMAD($1,$$,'(');
889 TOKEN_GETMAD($2,$$,')');
890 TOKEN_GETMAD($3,$$,'[');
891 TOKEN_GETMAD($5,$$,']');
895 /* Binary operators between terms */
896 termbinop: term ASSIGNOP term /* $x = $y */
897 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
898 TOKEN_GETMAD($2,$$,'o');
900 | term POWOP term /* $x ** $y */
901 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
902 TOKEN_GETMAD($2,$$,'o');
904 | term MULOP term /* $x * $y, $x x $y */
905 { if (IVAL($2) != OP_REPEAT)
907 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
908 TOKEN_GETMAD($2,$$,'o');
910 | term ADDOP term /* $x + $y */
911 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
912 TOKEN_GETMAD($2,$$,'o');
914 | term SHIFTOP term /* $x >> $y, $x << $y */
915 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
916 TOKEN_GETMAD($2,$$,'o');
918 | term RELOP term /* $x > $y, etc. */
919 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
920 TOKEN_GETMAD($2,$$,'o');
922 | term EQOP term /* $x == $y, $x eq $y */
923 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
924 TOKEN_GETMAD($2,$$,'o');
926 | term BITANDOP term /* $x & $y */
927 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
928 TOKEN_GETMAD($2,$$,'o');
930 | term BITOROP term /* $x | $y */
931 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
932 TOKEN_GETMAD($2,$$,'o');
934 | term DOTDOT term /* $x..$y, $x...$y */
936 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
940 op = (UNOP*)op->op_first; /* get to flop */
941 op = (UNOP*)op->op_first; /* get to flip */
942 op = (UNOP*)op->op_first; /* get to range */
943 token_getmad($2,(OP*)op,'o');
946 | term ANDAND term /* $x && $y */
947 { $$ = newLOGOP(OP_AND, 0, $1, $3);
948 TOKEN_GETMAD($2,$$,'o');
950 | term OROR term /* $x || $y */
951 { $$ = newLOGOP(OP_OR, 0, $1, $3);
952 TOKEN_GETMAD($2,$$,'o');
954 | term DORDOR term /* $x // $y */
955 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
956 TOKEN_GETMAD($2,$$,'o');
958 | term MATCHOP term /* $x =~ /$y/ */
959 { $$ = bind_match(IVAL($2), $1, $3);
961 ($$->op_type == OP_NOT
962 ? ((UNOP*)$$)->op_first : $$),
967 /* Unary operators and terms */
968 termunop : '-' term %prec UMINUS /* -$x */
969 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
970 TOKEN_GETMAD($1,$$,'o');
972 | '+' term %prec UMINUS /* +$x */
974 newUNOP(OP_NULL, 0, $2),
977 TOKEN_GETMAD($1,$$,'+');
980 { $$ = newUNOP(OP_NOT, 0, scalar($2));
981 TOKEN_GETMAD($1,$$,'o');
984 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
985 TOKEN_GETMAD($1,$$,'o');
987 | term POSTINC /* $x++ */
988 { $$ = newUNOP(OP_POSTINC, 0,
989 op_lvalue(scalar($1), OP_POSTINC));
990 TOKEN_GETMAD($2,$$,'o');
992 | term POSTDEC /* $x-- */
993 { $$ = newUNOP(OP_POSTDEC, 0,
994 op_lvalue(scalar($1), OP_POSTDEC));
995 TOKEN_GETMAD($2,$$,'o');
997 | PREINC term /* ++$x */
998 { $$ = newUNOP(OP_PREINC, 0,
999 op_lvalue(scalar($2), OP_PREINC));
1000 TOKEN_GETMAD($1,$$,'o');
1002 | PREDEC term /* --$x */
1003 { $$ = newUNOP(OP_PREDEC, 0,
1004 op_lvalue(scalar($2), OP_PREDEC));
1005 TOKEN_GETMAD($1,$$,'o');
1010 /* Constructors for anonymous data */
1011 anonymous: '[' expr ']'
1012 { $$ = newANONLIST($2);
1013 TOKEN_GETMAD($1,$$,'[');
1014 TOKEN_GETMAD($3,$$,']');
1017 { $$ = newANONLIST((OP*)NULL);
1018 TOKEN_GETMAD($1,$$,'[');
1019 TOKEN_GETMAD($2,$$,']');
1021 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1022 { $$ = newANONHASH($2);
1023 TOKEN_GETMAD($1,$$,'{');
1024 TOKEN_GETMAD($3,$$,';');
1025 TOKEN_GETMAD($4,$$,'}');
1027 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1028 { $$ = newANONHASH((OP*)NULL);
1029 TOKEN_GETMAD($1,$$,'{');
1030 TOKEN_GETMAD($2,$$,';');
1031 TOKEN_GETMAD($3,$$,'}');
1033 | ANONSUB startanonsub proto subattrlist block %prec '('
1034 { SvREFCNT_inc_simple_void(PL_compcv);
1035 $$ = newANONATTRSUB($2, $3, $4, $5);
1036 TOKEN_GETMAD($1,$$,'o');
1037 OP_GETMAD($3,$$,'s');
1038 OP_GETMAD($4,$$,'a');
1043 /* Things called with "do" */
1044 termdo : DO term %prec UNIOP /* do $filename */
1045 { $$ = dofile($2, IVAL($1));
1046 TOKEN_GETMAD($1,$$,'o');
1048 | DO block %prec '(' /* do { code */
1049 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1050 TOKEN_GETMAD($1,$$,'D');
1052 | DO WORD '(' ')' /* do somesub() */
1053 { $$ = newUNOP(OP_ENTERSUB,
1054 OPf_SPECIAL|OPf_STACKED,
1055 op_prepend_elem(OP_LIST,
1057 (OPpENTERSUB_AMPER<<8),
1059 )),(OP*)NULL)); dep();
1060 TOKEN_GETMAD($1,$$,'o');
1061 TOKEN_GETMAD($3,$$,'(');
1062 TOKEN_GETMAD($4,$$,')');
1064 | DO WORD '(' expr ')' /* do somesub(@args) */
1065 { $$ = newUNOP(OP_ENTERSUB,
1066 OPf_SPECIAL|OPf_STACKED,
1067 op_append_elem(OP_LIST,
1070 (OPpENTERSUB_AMPER<<8),
1073 TOKEN_GETMAD($1,$$,'o');
1074 TOKEN_GETMAD($3,$$,'(');
1075 TOKEN_GETMAD($5,$$,')');
1077 | DO scalar '(' ')' /* do $subref () */
1078 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1079 op_prepend_elem(OP_LIST,
1080 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1081 TOKEN_GETMAD($1,$$,'o');
1082 TOKEN_GETMAD($3,$$,'(');
1083 TOKEN_GETMAD($4,$$,')');
1085 | DO scalar '(' expr ')' /* do $subref (@args) */
1086 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1087 op_prepend_elem(OP_LIST,
1089 scalar(newCVREF(0,scalar($2))))); dep();
1090 TOKEN_GETMAD($1,$$,'o');
1091 TOKEN_GETMAD($3,$$,'(');
1092 TOKEN_GETMAD($5,$$,')');
1101 | term '?' term ':' term
1102 { $$ = newCONDOP(0, $1, $3, $5);
1103 TOKEN_GETMAD($2,$$,'?');
1104 TOKEN_GETMAD($4,$$,':');
1106 | REFGEN term /* \$x, \@y, \%z */
1107 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1108 TOKEN_GETMAD($1,$$,'o');
1110 | myattrterm %prec UNIOP
1112 | LOCAL term %prec UNIOP
1113 { $$ = localize($2,IVAL($1));
1114 TOKEN_GETMAD($1,$$,'k');
1117 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1118 TOKEN_GETMAD($1,$$,'(');
1119 TOKEN_GETMAD($3,$$,')');
1122 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1124 { $$ = sawparens(newNULLLIST());
1125 TOKEN_GETMAD($1,$$,'(');
1126 TOKEN_GETMAD($2,$$,')');
1136 | arylen %prec '(' /* $#x, $#{ something } */
1137 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1140 | ary '[' expr ']' /* array slice */
1141 { $$ = op_prepend_elem(OP_ASLICE,
1142 newOP(OP_PUSHMARK, 0),
1143 newLISTOP(OP_ASLICE, 0,
1145 ref($1, OP_ASLICE)));
1146 TOKEN_GETMAD($2,$$,'[');
1147 TOKEN_GETMAD($4,$$,']');
1149 | ary '{' expr ';' '}' /* @hash{@keys} */
1150 { $$ = op_prepend_elem(OP_HSLICE,
1151 newOP(OP_PUSHMARK, 0),
1152 newLISTOP(OP_HSLICE, 0,
1154 ref(oopsHV($1), OP_HSLICE)));
1155 PL_parser->expect = XOPERATOR;
1156 TOKEN_GETMAD($2,$$,'{');
1157 TOKEN_GETMAD($4,$$,';');
1158 TOKEN_GETMAD($5,$$,'}');
1163 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1164 | amper '(' ')' /* &foo() */
1165 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1166 TOKEN_GETMAD($2,$$,'(');
1167 TOKEN_GETMAD($3,$$,')');
1169 | amper '(' expr ')' /* &foo(@args) */
1171 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1172 op_append_elem(OP_LIST, $3, scalar($1)));
1175 if (op->op_type == OP_CONST) { /* defeat const fold */
1176 op = (OP*)op->op_madprop->mad_val;
1178 token_getmad($2,op,'(');
1179 token_getmad($4,op,')');
1182 | NOAMP WORD optlistexpr /* foo(@args) */
1183 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1184 op_append_elem(OP_LIST, $3, scalar($2)));
1185 TOKEN_GETMAD($1,$$,'o');
1187 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1188 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1189 PL_hints |= HINT_BLOCK_SCOPE;
1190 TOKEN_GETMAD($1,$$,'o');
1193 { $$ = newLOOPEX(IVAL($1),$2);
1194 TOKEN_GETMAD($1,$$,'o');
1196 | NOTOP listexpr /* not $foo */
1197 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1198 TOKEN_GETMAD($1,$$,'o');
1200 | UNIOP /* Unary op, $_ implied */
1201 { $$ = newOP(IVAL($1), 0);
1202 TOKEN_GETMAD($1,$$,'o');
1204 | UNIOP block /* eval { foo }* */
1205 { $$ = newUNOP(IVAL($1), 0, $2);
1206 TOKEN_GETMAD($1,$$,'o');
1208 | UNIOP term /* Unary op */
1209 { $$ = newUNOP(IVAL($1), 0, $2);
1210 TOKEN_GETMAD($1,$$,'o');
1212 | REQUIRE /* require, $_ implied */
1213 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1214 TOKEN_GETMAD($1,$$,'o');
1216 | REQUIRE term /* require Foo */
1217 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1218 TOKEN_GETMAD($1,$$,'o');
1221 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1222 | UNIOPSUB term /* Sub treated as unop */
1223 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1224 op_append_elem(OP_LIST, $2, scalar($1))); }
1225 | FUNC0 /* Nullary operator */
1226 { $$ = newOP(IVAL($1), 0);
1227 TOKEN_GETMAD($1,$$,'o');
1230 { $$ = newOP(IVAL($1), 0);
1231 TOKEN_GETMAD($1,$$,'o');
1232 TOKEN_GETMAD($2,$$,'(');
1233 TOKEN_GETMAD($3,$$,')');
1235 | FUNC0OP /* Same as above, but op created in toke.c */
1239 TOKEN_GETMAD($2,$$,'(');
1240 TOKEN_GETMAD($3,$$,')');
1242 | FUNC0SUB /* Sub treated as nullop */
1243 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1245 | FUNC1 '(' ')' /* not () */
1246 { $$ = (IVAL($1) == OP_NOT)
1247 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1248 : newOP(IVAL($1), OPf_SPECIAL);
1250 TOKEN_GETMAD($1,$$,'o');
1251 TOKEN_GETMAD($2,$$,'(');
1252 TOKEN_GETMAD($3,$$,')');
1254 | FUNC1 '(' expr ')' /* not($foo) */
1255 { $$ = newUNOP(IVAL($1), 0, $3);
1256 TOKEN_GETMAD($1,$$,'o');
1257 TOKEN_GETMAD($2,$$,'(');
1258 TOKEN_GETMAD($4,$$,')');
1260 | PMFUNC /* m//, s///, qr//, tr/// */
1262 if ( $1->op_type != OP_TRANS
1263 && $1->op_type != OP_TRANSR
1264 && (((PMOP*)$1)->op_pmflags & PMf_HAS_CV))
1266 $<ival>$ = start_subparse(FALSE, CVf_ANON);
1267 SAVEFREESV(PL_compcv);
1272 { $$ = pmruntime($1, $4, 1, $<ival>2);
1273 TOKEN_GETMAD($3,$$,'(');
1274 TOKEN_GETMAD($5,$$,')');
1280 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1281 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1282 TOKEN_GETMAD($1,$$,'X');
1287 /* "my" declarations, with optional attributes */
1288 myattrterm: MY myterm myattrlist
1289 { $$ = my_attrs($2,$3);
1291 token_getmad($1,$$,'d');
1292 append_madprops($3->op_madprop, $$, 'a');
1297 { $$ = localize($2,IVAL($1));
1298 TOKEN_GETMAD($1,$$,'d');
1302 /* Things that can be "my"'d */
1303 myterm : '(' expr ')'
1304 { $$ = sawparens($2);
1305 TOKEN_GETMAD($1,$$,'(');
1306 TOKEN_GETMAD($3,$$,')');
1309 { $$ = sawparens(newNULLLIST());
1310 TOKEN_GETMAD($1,$$,'(');
1311 TOKEN_GETMAD($2,$$,')');
1321 /* Basic list expressions */
1322 optlistexpr: /* NULL */ %prec PREC_LOW
1324 | listexpr %prec PREC_LOW
1334 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1337 { PL_parser->in_my = 0; $$ = my($1); }
1341 { $$ = newCVREF(IVAL($1),$2);
1342 TOKEN_GETMAD($1,$$,'&');
1346 scalar : '$' indirob
1347 { $$ = newSVREF($2);
1348 TOKEN_GETMAD($1,$$,'$');
1353 { $$ = newAVREF($2);
1354 TOKEN_GETMAD($1,$$,'@');
1359 { $$ = newHVREF($2);
1360 TOKEN_GETMAD($1,$$,'%');
1364 arylen : DOLSHARP indirob
1365 { $$ = newAVREF($2);
1366 TOKEN_GETMAD($1,$$,'l');
1371 { $$ = newGVREF(0,$2);
1372 TOKEN_GETMAD($1,$$,'*');
1376 /* Indirect objects */
1378 { $$ = scalar($1); }
1379 | scalar %prec PREC_LOW
1380 { $$ = scalar($1); }
1382 { $$ = op_scope($1); }