3 * Copyright (c) 1991-2002, 2003, 2004, 2005, 2006 Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * 'I see,' laughed Strider. 'I look foul and feel fair. Is that it?
12 * All that is gold does not glitter, not all those who wander are lost.'
14 * This file holds the grammar for the Perl language. If edited, you need
15 * to run regen_perly.pl, which re-creates the files perly.h, perly.tab
16 * and perly.act which are derived from this.
18 * Note that these derived files are included and compiled twice; once
19 * from perly.c, and once from madly.c. The second time, a number of MAD
20 * macros are defined, which compile in extra code that allows the parse
21 * tree to be accurately dumped. In particular:
23 * MAD defined if compiling madly.c
24 * DO_MAD(A) expands to A under madly.c, to null otherwise
25 * IF_MAD(a,b) expands to A under madly.c, to B otherwise
26 * TOKEN_GETMAD() expands to token_getmad() under madly.c, to null otherwise
27 * TOKEN_FREE() similarly
28 * OP_GETMAD() similarly
29 * IVAL(i) expands to (i)->tk_lval.ival or (i)
30 * PVAL(p) expands to (p)->tk_lval.pval or (p)
32 * The main job of of this grammar is to call the various newFOO()
33 * functions in op.c to build a syntax tree of OP structs.
34 * It relies on the lexer in toke.c to do the tokenizing.
37 /* Make the parser re-entrant. */
41 /* FIXME for MAD - is the new mintro on while and until important? */
50 #ifdef PERL_IN_MADLY_C
59 %token <tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
61 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF
62 %token <opval> FUNC0SUB UNIOPSUB LSTOPSUB
63 %token <p_tkval> LABEL
64 %token <tkval> FORMAT SUB ANONSUB PACKAGE USE
65 %token <tkval> WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
66 %token <tkval> GIVEN WHEN DEFAULT
67 %token <tkval> LOOPEX DOTDOT
68 %token <tkval> FUNC0 FUNC1 FUNC UNIOP LSTOP
69 %token <tkval> RELOP EQOP MULOP ADDOP
70 %token <tkval> DOLSHARP DO HASHBRACK NOAMP
71 %token <tkval> LOCAL MY MYSUB REQUIRE
72 %token <tkval> COLONATTR
74 %type <ival> prog progstart remember mremember savescope
75 %type <ival> startsub startanonsub startformsub
76 /* FIXME for MAD - are these two ival? */
77 %type <ival> mydefsv mintro
79 %type <opval> decl format subrout mysubrout package use peg
81 %type <opval> block mblock lineseq line loop cond else
82 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
83 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
84 %type <opval> listexpr listexprcom indirob listop method
85 %type <opval> formname subname proto subbody cont my_scalar
86 %type <opval> subattrlist myattrlist myattrterm myterm
87 %type <opval> termbinop termunop anonymous termdo
88 %type <opval> switch case
91 %nonassoc <tkval> PREC_LOW
94 %left <tkval> OROP DOROP
97 %nonassoc LSTOP LSTOPSUB
99 %right <tkval> ASSIGNOP
100 %right <tkval> '?' ':'
102 %left <tkval> OROR DORDOR
104 %left <tkval> BITOROP
105 %left <tkval> BITANDOP
108 %nonassoc UNIOP UNIOPSUB
110 %left <tkval> SHIFTOP
113 %left <tkval> MATCHOP
114 %right <tkval> '!' '~' UMINUS REFGEN
116 %nonassoc <tkval> PREINC PREDEC POSTINC POSTDEC
118 %nonassoc <tkval> ')'
126 /* The whole program */
128 /*CONTINUED*/ lineseq
129 { $$ = $1; newPROG(block_end($1,$2)); }
132 /* An ordinary block */
133 block : '{' remember lineseq '}'
134 { if (PL_copline > (line_t)IVAL($1))
135 PL_copline = (line_t)IVAL($1);
136 $$ = block_end($2, $3);
137 TOKEN_GETMAD($1,$$,'{');
138 TOKEN_GETMAD($4,$$,'}');
142 remember: /* NULL */ /* start a full lexical scope */
143 { $$ = block_start(TRUE); }
146 mydefsv: /* NULL */ /* lexicalize $_ */
147 { $$ = (I32) allocmy("$_"); }
152 PL_expect = XSTATE; $$ = block_start(TRUE);
157 mblock : '{' mremember lineseq '}'
158 { if (PL_copline > (line_t)IVAL($1))
159 PL_copline = (line_t)IVAL($1);
160 $$ = block_end($2, $3);
161 TOKEN_GETMAD($1,$$,'{');
162 TOKEN_GETMAD($4,$$,'}');
166 mremember: /* NULL */ /* start a partial lexical scope */
167 { $$ = block_start(FALSE); }
170 savescope: /* NULL */ /* remember stack pos in case of error */
171 { $$ = PL_savestack_ix; }
173 /* A collection of "lines" in the program */
179 append_list(OP_LINESEQ,
180 (LISTOP*)$1, (LISTOP*)$2),
183 | lineseq savescope line
185 $$ = append_list(OP_LINESEQ,
186 (LISTOP*)$1, (LISTOP*)$3);
187 PL_pad_reset_pending = TRUE;
188 if ($1 && $3) PL_hints |= HINT_BLOCK_SCOPE; }
191 /* A "line" in the program */
193 { $$ = newSTATEOP(0, PVAL($1), $2);
194 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
195 | loop /* loops add their own labels */
196 | switch /* ... and so do switches */
199 { $$ = newSTATEOP(0, PVAL($1), $2); }
203 $$ = newSTATEOP(0, PVAL($1), newOP(OP_NULL, 0));
204 TOKEN_GETMAD($1,$$,'L');
205 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first,';');
213 TOKEN_GETMAD($2,$$,';');
219 $$ = newSTATEOP(0, PVAL($1), $2);
222 /* sideff might already have a nexstate */
223 OP* op = ((LISTOP*)$$)->op_first;
225 while (op->op_sibling &&
226 op->op_sibling->op_type == OP_NEXTSTATE)
228 token_getmad($1,op,'L');
229 token_getmad($3,op,';');
235 /* An expression which may have a side-effect */
241 { $$ = newLOGOP(OP_AND, 0, $3, $1);
242 TOKEN_GETMAD($2,$$,'i');
245 { $$ = newLOGOP(OP_OR, 0, $3, $1);
246 TOKEN_GETMAD($2,$$,'i');
249 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
250 TOKEN_GETMAD($2,$$,'w');
253 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
254 TOKEN_GETMAD($2,$$,'w');
257 { $$ = newFOROP(0, Nullch, (line_t)IVAL($2),
258 Nullop, $3, $1, Nullop);
259 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first->op_sibling,'w');
263 /* else and elsif blocks */
267 { ($2)->op_flags |= OPf_PARENS; $$ = scope($2);
268 TOKEN_GETMAD($1,$$,'o');
270 | ELSIF '(' mexpr ')' mblock else
271 { PL_copline = (line_t)IVAL($1);
272 $$ = newCONDOP(0, $3, scope($5), $6);
273 PL_hints |= HINT_BLOCK_SCOPE;
274 TOKEN_GETMAD($1,$$,'I');
275 TOKEN_GETMAD($2,$$,'(');
276 TOKEN_GETMAD($4,$$,')');
280 /* Real conditional expressions */
281 cond : IF '(' remember mexpr ')' mblock else
282 { PL_copline = (line_t)IVAL($1);
284 newCONDOP(0, $4, scope($6), $7));
285 TOKEN_GETMAD($1,$$,'I');
286 TOKEN_GETMAD($2,$$,'(');
287 TOKEN_GETMAD($5,$$,')');
289 | UNLESS '(' remember miexpr ')' mblock else
290 { PL_copline = (line_t)IVAL($1);
292 newCONDOP(0, $4, scope($6), $7));
293 TOKEN_GETMAD($1,$$,'I');
294 TOKEN_GETMAD($2,$$,'(');
295 TOKEN_GETMAD($5,$$,')');
299 /* Cases for a switch statement */
300 case : WHEN '(' remember mexpr ')' mblock
302 newWHENOP($4, scope($6))); }
304 { $$ = newWHENOP(0, scope($2)); }
307 /* Continue blocks */
312 TOKEN_GETMAD($1,$$,'o');
316 /* Loops: while, until, for, and a bare block */
317 loop : label WHILE '(' remember texpr ')' mintro mblock cont
319 PL_copline = (line_t)$2;
321 newSTATEOP(0, PVAL($1),
322 innerop = newWHILEOP(0, 1, (LOOP*)Nullop,
323 IVAL($2), $5, $8, $9, $7)));
324 TOKEN_GETMAD($1,innerop,'L');
325 TOKEN_GETMAD($2,innerop,'W');
326 TOKEN_GETMAD($3,innerop,'(');
327 TOKEN_GETMAD($6,innerop,')');
330 | label UNTIL '(' remember iexpr ')' mintro mblock cont
332 PL_copline = (line_t)$2;
334 newSTATEOP(0, PVAL($1),
335 innerop = newWHILEOP(0, 1, (LOOP*)Nullop,
336 IVAL($2), $5, $8, $9, $7)));
337 TOKEN_GETMAD($1,innerop,'L');
338 TOKEN_GETMAD($2,innerop,'W');
339 TOKEN_GETMAD($3,innerop,'(');
340 TOKEN_GETMAD($6,innerop,')');
342 | label FOR MY remember my_scalar '(' mexpr ')' mblock cont
345 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
347 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
348 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
349 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'d');
350 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,'(');
351 TOKEN_GETMAD($8,((LISTOP*)innerop)->op_first->op_sibling,')');
353 | label FOR scalar '(' remember mexpr ')' mblock cont
356 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
357 mod($3, OP_ENTERLOOP), $6, $8, $9));
358 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
359 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
360 TOKEN_GETMAD($4,((LISTOP*)innerop)->op_first->op_sibling,'(');
361 TOKEN_GETMAD($7,((LISTOP*)innerop)->op_first->op_sibling,')');
363 | label FOR '(' remember mexpr ')' mblock cont
366 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
367 Nullop, $5, $7, $8));
368 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
369 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
370 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'(');
371 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,')');
373 | label FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
375 /* basically fake up an initialize-while lineseq */
377 PL_copline = (line_t)IVAL($2);
378 forop = newSTATEOP(0, PVAL($1),
379 newWHILEOP(0, 1, (LOOP*)Nullop,
380 IVAL($2), scalar($7),
384 $5 = newOP(OP_NULL, 0);
385 forop = newUNOP(OP_NULL, 0, append_elem(OP_LINESEQ,
388 ?savepv(($1)->tk_lval.pval):Nullch),
392 token_getmad($2,forop,'3');
393 token_getmad($3,forop,'(');
394 token_getmad($6,forop,'1');
395 token_getmad($8,forop,'2');
396 token_getmad($11,forop,')');
397 token_getmad($1,forop,'L');
400 forop = append_elem(OP_LINESEQ,
401 newSTATEOP(0, ($1?savepv($1):Nullch),
408 $$ = block_end($4, forop); }
409 | label block cont /* a block is a loop that happens once */
410 { $$ = newSTATEOP(0, PVAL($1),
411 newWHILEOP(0, 1, (LOOP*)Nullop,
412 NOLINE, Nullop, $2, $3, 0));
413 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
417 switch : label GIVEN '(' remember mydefsv mexpr ')' mblock
418 { PL_copline = (line_t) $2;
420 newSTATEOP(0, PVAL($1),
421 newGIVENOP($6, scope($8),
422 (PADOFFSET) $5) )); }
425 /* determine whether there are any new my declarations */
427 { $$ = (PL_min_intro_pending &&
428 PL_max_intro_pending >= PL_min_intro_pending);
431 /* Normal expression */
437 /* Boolean expression */
438 texpr : /* NULL means true */
440 (void)scan_num("1", &tmplval);
441 $$ = tmplval.opval; }
445 /* Inverted boolean expression */
447 { $$ = invert(scalar($1)); }
450 /* Expression with its own lexical scope */
452 { $$ = $1; intro_my(); }
456 { $$ = $1; intro_my(); }
460 { $$ = $1; intro_my(); }
463 /* Optional "MAIN:"-style loop labels */
468 tmplval.pval = Nullch;
469 $$ = newTOKEN(OP_NULL, tmplval, 0);
477 /* Some kind of declaration - just hang on peg in the parse tree */
489 /* these two are only used by MAD */
496 { $$ = newOP(OP_NULL,0);
497 TOKEN_GETMAD($1,$$,'p');
501 format : FORMAT startformsub formname block
502 { SvREFCNT_inc(PL_compcv);
504 $$ = newFORM($2, $3, $4);
505 prepend_madprops($1->tk_mad, $$, 'F');
514 formname: WORD { $$ = $1; }
515 | /* NULL */ { $$ = Nullop; }
518 /* Unimplemented "my sub foo { }" */
519 mysubrout: MYSUB startsub subname proto subattrlist subbody
520 { SvREFCNT_inc(PL_compcv);
522 $$ = newMYSUB($2, $3, $4, $5, $6);
523 token_getmad($1,$$,'d');
525 newMYSUB($2, $3, $4, $5, $6);
530 /* Subroutine definition */
531 subrout : SUB startsub subname proto subattrlist subbody
532 { SvREFCNT_inc(PL_compcv);
534 OP* o = newSVOP(OP_ANONCODE, 0,
535 (SV*)newATTRSUB($2, $3, $4, $5, $6));
536 $$ = newOP(OP_NULL,0);
538 op_getmad($3,$$,'n');
539 op_getmad($4,$$,'s');
540 op_getmad($5,$$,'a');
541 token_getmad($1,$$,'d');
542 append_madprops($6->op_madprop, $$, 0);
545 newATTRSUB($2, $3, $4, $5, $6);
551 startsub: /* NULL */ /* start a regular subroutine scope */
552 { $$ = start_subparse(FALSE, 0);
553 SAVEFREESV(PL_compcv); }
557 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
558 { $$ = start_subparse(FALSE, CVf_ANON);
559 SAVEFREESV(PL_compcv); }
562 startformsub: /* NULL */ /* start a format subroutine scope */
563 { $$ = start_subparse(TRUE, 0);
564 SAVEFREESV(PL_compcv); }
567 /* Name of a subroutine - must be a bareword, could be special */
568 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
569 if (strEQ(name, "BEGIN") || strEQ(name, "END")
570 || strEQ(name, "INIT") || strEQ(name, "CHECK")
571 || strEQ(name, "UNITCHECK"))
572 CvSPECIAL_on(PL_compcv);
576 /* Subroutine prototype */
582 /* Optional list of subroutine attributes */
583 subattrlist: /* NULL */
587 TOKEN_GETMAD($1,$$,':');
594 TOKEN_GETMAD($1,$$,':');
598 /* List of attributes for a "my" variable declaration */
599 myattrlist: COLONATTR THING
601 TOKEN_GETMAD($1,$$,':');
608 TOKEN_GETMAD($1,$$,':');
612 /* Subroutine body - either null or a block */
613 subbody : block { $$ = $1; }
619 TOKEN_GETMAD($1,$$,';');
623 package : PACKAGE WORD ';'
627 token_getmad($1,$$,'o');
628 token_getmad($3,$$,';');
636 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
637 WORD WORD listexpr ';'
638 { SvREFCNT_inc(PL_compcv);
640 $$ = utilize(IVAL($1), $2, $4, $5, $6);
641 token_getmad($1,$$,'o');
642 token_getmad($7,$$,';');
643 if (PL_rsfp_filters && AvFILLp(PL_rsfp_filters) >= 0)
644 append_madprops(newMADPROP('!', MAD_PV, "", 0), $$, 0);
646 utilize(IVAL($1), $2, $4, $5, $6);
651 /* Ordinary expressions; logical combinations */
652 expr : expr ANDOP expr
653 { $$ = newLOGOP(OP_AND, 0, $1, $3);
654 TOKEN_GETMAD($2,$$,'o');
657 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
658 TOKEN_GETMAD($2,$$,'o');
661 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
662 TOKEN_GETMAD($2,$$,'o');
664 | argexpr %prec PREC_LOW
667 /* Expressions are a list of terms joined by commas */
668 argexpr : argexpr ','
671 OP* op = newNULLLIST();
672 token_getmad($2,op,',');
673 $$ = append_elem(OP_LIST, $1, op);
681 $3 = newUNOP(OP_NULL, 0, $3);
682 token_getmad($2,$3,',');
684 $$ = append_elem(OP_LIST, $1, $3);
686 | term %prec PREC_LOW
690 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
691 { $$ = convert(IVAL($1), OPf_STACKED,
692 prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
693 TOKEN_GETMAD($1,$$,'o');
695 | FUNC '(' indirob expr ')' /* print ($fh @args */
696 { $$ = convert(IVAL($1), OPf_STACKED,
697 prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
698 TOKEN_GETMAD($1,$$,'o');
699 TOKEN_GETMAD($2,$$,'(');
700 TOKEN_GETMAD($5,$$,')');
702 | term ARROW method '(' listexprcom ')' /* $foo->bar(list) */
703 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
705 prepend_elem(OP_LIST, scalar($1), $5),
706 newUNOP(OP_METHOD, 0, $3)));
707 TOKEN_GETMAD($2,$$,'A');
708 TOKEN_GETMAD($4,$$,'(');
709 TOKEN_GETMAD($6,$$,')');
711 | term ARROW method /* $foo->bar */
712 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
713 append_elem(OP_LIST, scalar($1),
714 newUNOP(OP_METHOD, 0, $3)));
715 TOKEN_GETMAD($2,$$,'A');
717 | METHOD indirob listexpr /* new Class @args */
718 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
720 prepend_elem(OP_LIST, $2, $3),
721 newUNOP(OP_METHOD, 0, $1)));
723 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
724 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
726 prepend_elem(OP_LIST, $2, $4),
727 newUNOP(OP_METHOD, 0, $1)));
728 TOKEN_GETMAD($3,$$,'(');
729 TOKEN_GETMAD($5,$$,')');
731 | LSTOP listexpr /* print @args */
732 { $$ = convert(IVAL($1), 0, $2);
733 TOKEN_GETMAD($1,$$,'o');
735 | FUNC '(' listexprcom ')' /* print (@args) */
736 { $$ = convert(IVAL($1), 0, $3);
737 TOKEN_GETMAD($1,$$,'o');
738 TOKEN_GETMAD($2,$$,'(');
739 TOKEN_GETMAD($4,$$,')');
741 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
742 { SvREFCNT_inc(PL_compcv);
743 $3 = newANONATTRSUB($2, 0, Nullop, $3); }
744 listexpr %prec LSTOP /* ... @bar */
745 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
747 prepend_elem(OP_LIST, $3, $5), $1));
751 /* Names of methods. May use $object->$methodname */
756 /* Some kind of subscripted expression */
757 subscripted: star '{' expr ';' '}' /* *main::{something} */
758 /* In this and all the hash accessors, ';' is
759 * provided by the tokeniser */
760 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
761 PL_expect = XOPERATOR;
762 TOKEN_GETMAD($2,$$,'{');
763 TOKEN_GETMAD($4,$$,';');
764 TOKEN_GETMAD($5,$$,'}');
766 | scalar '[' expr ']' /* $array[$element] */
767 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
768 TOKEN_GETMAD($2,$$,'[');
769 TOKEN_GETMAD($4,$$,']');
771 | term ARROW '[' expr ']' /* somearef->[$element] */
772 { $$ = newBINOP(OP_AELEM, 0,
773 ref(newAVREF($1),OP_RV2AV),
775 TOKEN_GETMAD($2,$$,'a');
776 TOKEN_GETMAD($3,$$,'[');
777 TOKEN_GETMAD($5,$$,']');
779 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
780 { $$ = newBINOP(OP_AELEM, 0,
781 ref(newAVREF($1),OP_RV2AV),
783 TOKEN_GETMAD($2,$$,'[');
784 TOKEN_GETMAD($4,$$,']');
786 | scalar '{' expr ';' '}' /* $foo->{bar();} */
787 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
788 PL_expect = XOPERATOR;
789 TOKEN_GETMAD($2,$$,'{');
790 TOKEN_GETMAD($4,$$,';');
791 TOKEN_GETMAD($5,$$,'}');
793 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
794 { $$ = newBINOP(OP_HELEM, 0,
795 ref(newHVREF($1),OP_RV2HV),
797 PL_expect = XOPERATOR;
798 TOKEN_GETMAD($2,$$,'a');
799 TOKEN_GETMAD($3,$$,'{');
800 TOKEN_GETMAD($5,$$,';');
801 TOKEN_GETMAD($6,$$,'}');
803 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
804 { $$ = newBINOP(OP_HELEM, 0,
805 ref(newHVREF($1),OP_RV2HV),
807 PL_expect = XOPERATOR;
808 TOKEN_GETMAD($2,$$,'{');
809 TOKEN_GETMAD($4,$$,';');
810 TOKEN_GETMAD($5,$$,'}');
812 | term ARROW '(' ')' /* $subref->() */
813 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
814 newCVREF(0, scalar($1)));
815 TOKEN_GETMAD($2,$$,'a');
816 TOKEN_GETMAD($3,$$,'(');
817 TOKEN_GETMAD($4,$$,')');
819 | term ARROW '(' expr ')' /* $subref->(@args) */
820 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
821 append_elem(OP_LIST, $4,
822 newCVREF(0, scalar($1))));
823 TOKEN_GETMAD($2,$$,'a');
824 TOKEN_GETMAD($3,$$,'(');
825 TOKEN_GETMAD($5,$$,')');
828 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
829 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
830 append_elem(OP_LIST, $3,
831 newCVREF(0, scalar($1))));
832 TOKEN_GETMAD($2,$$,'(');
833 TOKEN_GETMAD($4,$$,')');
835 | subscripted '(' ')' /* $foo->{bar}->() */
836 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
837 newCVREF(0, scalar($1)));
838 TOKEN_GETMAD($2,$$,'(');
839 TOKEN_GETMAD($3,$$,')');
841 | '(' expr ')' '[' expr ']' /* list slice */
842 { $$ = newSLICEOP(0, $5, $2);
843 TOKEN_GETMAD($1,$$,'(');
844 TOKEN_GETMAD($3,$$,')');
845 TOKEN_GETMAD($4,$$,'[');
846 TOKEN_GETMAD($6,$$,']');
848 | '(' ')' '[' expr ']' /* empty list slice! */
849 { $$ = newSLICEOP(0, $4, Nullop);
850 TOKEN_GETMAD($1,$$,'(');
851 TOKEN_GETMAD($2,$$,')');
852 TOKEN_GETMAD($3,$$,'[');
853 TOKEN_GETMAD($5,$$,']');
857 /* Binary operators between terms */
858 termbinop: term ASSIGNOP term /* $x = $y */
859 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
860 TOKEN_GETMAD($2,$$,'o');
862 | term POWOP term /* $x ** $y */
863 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
864 TOKEN_GETMAD($2,$$,'o');
866 | term MULOP term /* $x * $y, $x x $y */
867 { if (IVAL($2) != OP_REPEAT)
869 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
870 TOKEN_GETMAD($2,$$,'o');
872 | term ADDOP term /* $x + $y */
873 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
874 TOKEN_GETMAD($2,$$,'o');
876 | term SHIFTOP term /* $x >> $y, $x << $y */
877 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
878 TOKEN_GETMAD($2,$$,'o');
880 | term RELOP term /* $x > $y, etc. */
881 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
882 TOKEN_GETMAD($2,$$,'o');
884 | term EQOP term /* $x == $y, $x eq $y */
885 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
886 TOKEN_GETMAD($2,$$,'o');
888 | term BITANDOP term /* $x & $y */
889 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
890 TOKEN_GETMAD($2,$$,'o');
892 | term BITOROP term /* $x | $y */
893 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
894 TOKEN_GETMAD($2,$$,'o');
896 | term DOTDOT term /* $x..$y, $x...$y */
898 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
902 op = (UNOP*)op->op_first; /* get to flop */
903 op = (UNOP*)op->op_first; /* get to flip */
904 op = (UNOP*)op->op_first; /* get to range */
905 token_getmad($2,(OP*)op,'o');
908 | term ANDAND term /* $x && $y */
909 { $$ = newLOGOP(OP_AND, 0, $1, $3);
910 TOKEN_GETMAD($2,$$,'o');
912 | term OROR term /* $x || $y */
913 { $$ = newLOGOP(OP_OR, 0, $1, $3);
914 TOKEN_GETMAD($2,$$,'o');
916 | term DORDOR term /* $x // $y */
917 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
918 TOKEN_GETMAD($2,$$,'o');
920 | term MATCHOP term /* $x =~ /$y/ */
921 { $$ = bind_match(IVAL($2), $1, $3);
923 ($$->op_type == OP_NOT
924 ? ((UNOP*)$$)->op_first : $$),
929 /* Unary operators and terms */
930 termunop : '-' term %prec UMINUS /* -$x */
931 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
932 TOKEN_GETMAD($1,$$,'o');
934 | '+' term %prec UMINUS /* +$x */
936 newUNOP(OP_NULL, 0, $2),
939 TOKEN_GETMAD($1,$$,'+');
942 { $$ = newUNOP(OP_NOT, 0, scalar($2));
943 TOKEN_GETMAD($1,$$,'o');
946 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
947 TOKEN_GETMAD($1,$$,'o');
949 | term POSTINC /* $x++ */
950 { $$ = newUNOP(OP_POSTINC, 0,
951 mod(scalar($1), OP_POSTINC));
952 TOKEN_GETMAD($2,$$,'o');
954 | term POSTDEC /* $x-- */
955 { $$ = newUNOP(OP_POSTDEC, 0,
956 mod(scalar($1), OP_POSTDEC));
957 TOKEN_GETMAD($2,$$,'o');
959 | PREINC term /* ++$x */
960 { $$ = newUNOP(OP_PREINC, 0,
961 mod(scalar($2), OP_PREINC));
962 TOKEN_GETMAD($1,$$,'o');
964 | PREDEC term /* --$x */
965 { $$ = newUNOP(OP_PREDEC, 0,
966 mod(scalar($2), OP_PREDEC));
967 TOKEN_GETMAD($1,$$,'o');
972 /* Constructors for anonymous data */
973 anonymous: '[' expr ']'
974 { $$ = newANONLIST($2);
975 TOKEN_GETMAD($1,$$,'[');
976 TOKEN_GETMAD($3,$$,']');
979 { $$ = newANONLIST(Nullop);
980 TOKEN_GETMAD($1,$$,'[');
981 TOKEN_GETMAD($2,$$,']');
983 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
984 { $$ = newANONHASH($2);
985 TOKEN_GETMAD($1,$$,'{');
986 TOKEN_GETMAD($3,$$,';');
987 TOKEN_GETMAD($4,$$,'}');
989 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
990 { $$ = newANONHASH(Nullop);
991 TOKEN_GETMAD($1,$$,'{');
992 TOKEN_GETMAD($2,$$,';');
993 TOKEN_GETMAD($3,$$,'}');
995 | ANONSUB startanonsub proto subattrlist block %prec '('
996 { SvREFCNT_inc(PL_compcv);
997 $$ = newANONATTRSUB($2, $3, $4, $5);
998 TOKEN_GETMAD($1,$$,'o');
999 OP_GETMAD($3,$$,'s');
1000 OP_GETMAD($4,$$,'a');
1005 /* Things called with "do" */
1006 termdo : DO term %prec UNIOP /* do $filename */
1007 { $$ = dofile($2, $1);
1008 TOKEN_GETMAD($1,$$,'o');
1010 | DO block %prec '(' /* do { code */
1011 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2));
1012 TOKEN_GETMAD($1,$$,'D');
1014 | DO WORD '(' ')' /* do somesub() */
1015 { $$ = newUNOP(OP_ENTERSUB,
1016 OPf_SPECIAL|OPf_STACKED,
1017 prepend_elem(OP_LIST,
1019 (OPpENTERSUB_AMPER<<8),
1022 TOKEN_GETMAD($1,$$,'o');
1023 TOKEN_GETMAD($3,$$,'(');
1024 TOKEN_GETMAD($4,$$,')');
1026 | DO WORD '(' expr ')' /* do somesub(@args) */
1027 { $$ = newUNOP(OP_ENTERSUB,
1028 OPf_SPECIAL|OPf_STACKED,
1029 append_elem(OP_LIST,
1032 (OPpENTERSUB_AMPER<<8),
1035 TOKEN_GETMAD($1,$$,'o');
1036 TOKEN_GETMAD($3,$$,'(');
1037 TOKEN_GETMAD($5,$$,')');
1039 | DO scalar '(' ')' /* do $subref () */
1040 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1041 prepend_elem(OP_LIST,
1042 scalar(newCVREF(0,scalar($2))), Nullop)); dep();
1043 TOKEN_GETMAD($1,$$,'o');
1044 TOKEN_GETMAD($3,$$,'(');
1045 TOKEN_GETMAD($4,$$,')');
1047 | DO scalar '(' expr ')' /* do $subref (@args) */
1048 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1049 prepend_elem(OP_LIST,
1051 scalar(newCVREF(0,scalar($2))))); dep();
1052 TOKEN_GETMAD($1,$$,'o');
1053 TOKEN_GETMAD($3,$$,'(');
1054 TOKEN_GETMAD($5,$$,')');
1063 | term '?' term ':' term
1064 { $$ = newCONDOP(0, $1, $3, $5);
1065 TOKEN_GETMAD($2,$$,'?');
1066 TOKEN_GETMAD($4,$$,':');
1068 | REFGEN term /* \$x, \@y, \%z */
1069 { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN));
1070 TOKEN_GETMAD($1,$$,'o');
1072 | myattrterm %prec UNIOP
1074 | LOCAL term %prec UNIOP
1075 { $$ = localize($2,IVAL($1));
1076 TOKEN_GETMAD($1,$$,'d');
1079 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1080 TOKEN_GETMAD($1,$$,'(');
1081 TOKEN_GETMAD($3,$$,')');
1084 { $$ = sawparens(newNULLLIST());
1085 TOKEN_GETMAD($1,$$,'(');
1086 TOKEN_GETMAD($2,$$,')');
1096 | arylen %prec '(' /* $#x, $#{ something } */
1097 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1100 | ary '[' expr ']' /* array slice */
1101 { $$ = prepend_elem(OP_ASLICE,
1102 newOP(OP_PUSHMARK, 0),
1103 newLISTOP(OP_ASLICE, 0,
1105 ref($1, OP_ASLICE)));
1106 TOKEN_GETMAD($2,$$,'[');
1107 TOKEN_GETMAD($4,$$,']');
1109 | ary '{' expr ';' '}' /* @hash{@keys} */
1110 { $$ = prepend_elem(OP_HSLICE,
1111 newOP(OP_PUSHMARK, 0),
1112 newLISTOP(OP_HSLICE, 0,
1114 ref(oopsHV($1), OP_HSLICE)));
1115 PL_expect = XOPERATOR;
1116 TOKEN_GETMAD($2,$$,'{');
1117 TOKEN_GETMAD($4,$$,';');
1118 TOKEN_GETMAD($5,$$,'}');
1123 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1124 | amper '(' ')' /* &foo() */
1125 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1126 TOKEN_GETMAD($2,$$,'(');
1127 TOKEN_GETMAD($3,$$,')');
1129 | amper '(' expr ')' /* &foo(@args) */
1131 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1132 append_elem(OP_LIST, $3, scalar($1)));
1135 if (op->op_type == OP_CONST) { /* defeat const fold */
1136 op = (OP*)op->op_madprop->mad_val;
1138 token_getmad($2,op,'(');
1139 token_getmad($4,op,')');
1142 | NOAMP WORD listexpr /* foo(@args) */
1143 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1144 append_elem(OP_LIST, $3, scalar($2)));
1145 TOKEN_GETMAD($1,$$,'o');
1147 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1148 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1149 PL_hints |= HINT_BLOCK_SCOPE;
1150 TOKEN_GETMAD($1,$$,'o');
1153 { $$ = newLOOPEX(IVAL($1),$2);
1154 TOKEN_GETMAD($1,$$,'o');
1156 | NOTOP argexpr /* not $foo */
1157 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1158 TOKEN_GETMAD($1,$$,'o');
1160 | UNIOP /* Unary op, $_ implied */
1161 { $$ = newOP(IVAL($1), 0);
1162 TOKEN_GETMAD($1,$$,'o');
1164 | UNIOP block /* eval { foo }* */
1165 { $$ = newUNOP(IVAL($1), 0, $2);
1166 TOKEN_GETMAD($1,$$,'o');
1168 | UNIOP term /* Unary op */
1169 { $$ = newUNOP(IVAL($1), 0, $2);
1170 TOKEN_GETMAD($1,$$,'o');
1172 | REQUIRE /* require, $_ implied *//* FIMXE for MAD needed? */
1173 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0); }
1174 | REQUIRE term /* require Foo *//* FIMXE for MAD needed? */
1175 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2); }
1177 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1178 | UNIOPSUB term /* Sub treated as unop */
1179 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1180 append_elem(OP_LIST, $2, scalar($1))); }
1181 | FUNC0 /* Nullary operator */
1182 { $$ = newOP(IVAL($1), 0);
1183 TOKEN_GETMAD($1,$$,'o');
1186 { $$ = newOP(IVAL($1), 0);
1187 TOKEN_GETMAD($1,$$,'o');
1188 TOKEN_GETMAD($2,$$,'(');
1189 TOKEN_GETMAD($3,$$,')');
1191 | FUNC0SUB /* Sub treated as nullop */
1192 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1194 | FUNC1 '(' ')' /* not () */
1195 { $$ = (IVAL($1) == OP_NOT)
1196 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1197 : newOP(IVAL($1), OPf_SPECIAL);
1199 TOKEN_GETMAD($1,$$,'o');
1200 TOKEN_GETMAD($2,$$,'(');
1201 TOKEN_GETMAD($3,$$,')');
1203 | FUNC1 '(' expr ')' /* not($foo) */
1204 { $$ = newUNOP(IVAL($1), 0, $3);
1205 TOKEN_GETMAD($1,$$,'o');
1206 TOKEN_GETMAD($2,$$,'(');
1207 TOKEN_GETMAD($4,$$,')');
1209 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
1210 { $$ = pmruntime($1, $3, 1);
1211 TOKEN_GETMAD($2,$$,'(');
1212 TOKEN_GETMAD($4,$$,')');
1218 /* "my" declarations, with optional attributes */
1219 myattrterm: MY myterm myattrlist
1220 { $$ = my_attrs($2,$3);
1222 token_getmad($1,$$,'d');
1223 append_madprops($3->op_madprop, $$, 'a');
1228 { $$ = localize($2,IVAL($1));
1229 TOKEN_GETMAD($1,$$,'d');
1233 /* Things that can be "my"'d */
1234 myterm : '(' expr ')'
1235 { $$ = sawparens($2);
1236 TOKEN_GETMAD($1,$$,'(');
1237 TOKEN_GETMAD($3,$$,')');
1240 { $$ = sawparens(newNULLLIST());
1241 TOKEN_GETMAD($1,$$,'(');
1242 TOKEN_GETMAD($2,$$,')');
1252 /* Basic list expressions */
1253 listexpr: /* NULL */ %prec PREC_LOW
1255 | argexpr %prec PREC_LOW
1259 listexprcom: /* NULL */
1266 OP* op = newNULLLIST();
1267 token_getmad($2,op,',');
1268 $$ = append_elem(OP_LIST, $1, op);
1276 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1279 { PL_in_my = 0; $$ = my($1); }
1283 { $$ = newCVREF(IVAL($1),$2);
1284 TOKEN_GETMAD($1,$$,'&');
1288 scalar : '$' indirob
1289 { $$ = newSVREF($2);
1290 TOKEN_GETMAD($1,$$,'$');
1295 { $$ = newAVREF($2);
1296 TOKEN_GETMAD($1,$$,'@');
1301 { $$ = newHVREF($2);
1302 TOKEN_GETMAD($1,$$,'%');
1306 arylen : DOLSHARP indirob
1307 { $$ = newAVREF($2);
1308 TOKEN_GETMAD($1,$$,'l');
1313 { $$ = newGVREF(0,$2);
1314 TOKEN_GETMAD($1,$$,'*');
1318 /* Indirect objects */
1320 { $$ = scalar($1); }
1321 | scalar %prec PREC_LOW
1322 { $$ = scalar($1); }