3 * Copyright (c) 1991-2002, 2003, 2004, 2005, 2006 Larry Wall
4 * Copyright (c) 2007, 2008 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 <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
74 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF
75 %token <opval> FUNC0SUB UNIOPSUB LSTOPSUB
76 %token <opval> PLUGEXPR PLUGSTMT
77 %token <p_tkval> LABEL
78 %token <i_tkval> FORMAT SUB ANONSUB PACKAGE USE
79 %token <i_tkval> WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
80 %token <i_tkval> GIVEN WHEN DEFAULT
81 %token <i_tkval> LOOPEX DOTDOT YADAYADA
82 %token <i_tkval> FUNC0 FUNC1 FUNC UNIOP LSTOP
83 %token <i_tkval> RELOP EQOP MULOP ADDOP
84 %token <i_tkval> DOLSHARP DO HASHBRACK NOAMP
85 %token <i_tkval> LOCAL MY MYSUB REQUIRE
86 %token <i_tkval> COLONATTR
88 %type <ival> prog progstart remember mremember
89 %type <ival> startsub startanonsub startformsub
90 /* FIXME for MAD - are these two ival? */
91 %type <ival> mydefsv mintro
93 %type <opval> decl format subrout mysubrout package use peg
95 %type <opval> block package_block mblock lineseq line loop cond else
96 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
97 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
98 %type <opval> listexpr listexprcom 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
102 %type <opval> switch case
103 %type <p_tkval> label
105 %nonassoc <i_tkval> PREC_LOW
108 %left <i_tkval> OROP DOROP
109 %left <i_tkval> ANDOP
110 %right <i_tkval> NOTOP
111 %nonassoc LSTOP LSTOPSUB
113 %right <i_tkval> ASSIGNOP
114 %right <i_tkval> '?' ':'
115 %nonassoc DOTDOT YADAYADA
116 %left <i_tkval> OROR DORDOR
117 %left <i_tkval> ANDAND
118 %left <i_tkval> BITOROP
119 %left <i_tkval> BITANDOP
122 %nonassoc UNIOP UNIOPSUB
124 %left <i_tkval> SHIFTOP
127 %left <i_tkval> MATCHOP
128 %right <i_tkval> '!' '~' UMINUS REFGEN
129 %right <i_tkval> POWOP
130 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
131 %left <i_tkval> ARROW
132 %nonassoc <i_tkval> ')'
140 /* The whole program */
142 /*CONTINUED*/ lineseq
143 { $$ = $1; newPROG(block_end($1,$2)); }
146 /* An ordinary block */
147 block : '{' remember lineseq '}'
148 { if (PL_parser->copline > (line_t)IVAL($1))
149 PL_parser->copline = (line_t)IVAL($1);
150 $$ = block_end($2, $3);
151 TOKEN_GETMAD($1,$$,'{');
152 TOKEN_GETMAD($4,$$,'}');
156 remember: /* NULL */ /* start a full lexical scope */
157 { $$ = block_start(TRUE); }
160 mydefsv: /* NULL */ /* lexicalize $_ */
161 { $$ = (I32) Perl_allocmy(aTHX_ STR_WITH_LEN("$_"), 0); }
166 PL_parser->expect = XSTATE; $$ = block_start(TRUE);
171 mblock : '{' mremember lineseq '}'
172 { if (PL_parser->copline > (line_t)IVAL($1))
173 PL_parser->copline = (line_t)IVAL($1);
174 $$ = block_end($2, $3);
175 TOKEN_GETMAD($1,$$,'{');
176 TOKEN_GETMAD($4,$$,'}');
180 mremember: /* NULL */ /* start a partial lexical scope */
181 { $$ = block_start(FALSE); }
184 /* A collection of "lines" in the program */
190 append_list(OP_LINESEQ,
191 (LISTOP*)$1, (LISTOP*)$2),
195 { $$ = append_list(OP_LINESEQ,
196 (LISTOP*)$1, (LISTOP*)$2);
197 PL_pad_reset_pending = TRUE;
199 PL_hints |= HINT_BLOCK_SCOPE;
203 /* A "line" in the program */
205 { $$ = newSTATEOP(0, PVAL($1), $2);
206 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
207 | loop /* loops add their own labels */
208 | switch /* ... and so do switches */
211 { $$ = newSTATEOP(0, PVAL($1), $2); }
215 $$ = newSTATEOP(0, PVAL($1), newOP(OP_NULL, 0));
216 TOKEN_GETMAD($1,$$,'L');
217 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first,';');
223 PL_parser->copline = NOLINE;
225 TOKEN_GETMAD($2,$$,';');
227 PL_parser->expect = XSTATE;
231 $$ = newSTATEOP(0, PVAL($1), $2);
232 PL_parser->expect = XSTATE;
234 /* sideff might already have a nexstate */
235 OP* op = ((LISTOP*)$$)->op_first;
237 while (op->op_sibling &&
238 op->op_sibling->op_type == OP_NEXTSTATE)
240 token_getmad($1,op,'L');
241 token_getmad($3,op,';');
246 { $$ = newSTATEOP(0, NULL,
247 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
248 NOLINE, (OP*)NULL, $1,
250 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
252 { $$ = newSTATEOP(0, PVAL($1), $2); }
255 /* An expression which may have a side-effect */
261 { $$ = newLOGOP(OP_AND, 0, $3, $1);
262 TOKEN_GETMAD($2,$$,'i');
265 { $$ = newLOGOP(OP_OR, 0, $3, $1);
266 TOKEN_GETMAD($2,$$,'i');
269 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
270 TOKEN_GETMAD($2,$$,'w');
273 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
274 TOKEN_GETMAD($2,$$,'w');
277 { $$ = newFOROP(0, NULL, (line_t)IVAL($2),
278 (OP*)NULL, $3, $1, (OP*)NULL);
279 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first->op_sibling,'w');
282 { $$ = newWHENOP($3, scope($1)); }
285 /* else and elsif blocks */
289 { ($2)->op_flags |= OPf_PARENS; $$ = scope($2);
290 TOKEN_GETMAD($1,$$,'o');
292 | ELSIF '(' mexpr ')' mblock else
293 { PL_parser->copline = (line_t)IVAL($1);
294 $$ = newCONDOP(0, newSTATEOP(OPf_SPECIAL,NULL,$3), scope($5), $6);
295 PL_hints |= HINT_BLOCK_SCOPE;
296 TOKEN_GETMAD($1,$$,'I');
297 TOKEN_GETMAD($2,$$,'(');
298 TOKEN_GETMAD($4,$$,')');
302 /* Real conditional expressions */
303 cond : IF '(' remember mexpr ')' mblock else
304 { PL_parser->copline = (line_t)IVAL($1);
306 newCONDOP(0, $4, scope($6), $7));
307 TOKEN_GETMAD($1,$$,'I');
308 TOKEN_GETMAD($2,$$,'(');
309 TOKEN_GETMAD($5,$$,')');
311 | UNLESS '(' remember miexpr ')' mblock else
312 { PL_parser->copline = (line_t)IVAL($1);
314 newCONDOP(0, $4, scope($6), $7));
315 TOKEN_GETMAD($1,$$,'I');
316 TOKEN_GETMAD($2,$$,'(');
317 TOKEN_GETMAD($5,$$,')');
321 /* Cases for a switch statement */
322 case : WHEN '(' remember mexpr ')' mblock
324 newWHENOP($4, scope($6))); }
326 { $$ = newWHENOP(0, scope($2)); }
329 /* Continue blocks */
334 TOKEN_GETMAD($1,$$,'o');
338 /* Loops: while, until, for, and a bare block */
339 loop : label WHILE '(' remember texpr ')' mintro mblock cont
341 PL_parser->copline = (line_t)IVAL($2);
343 newSTATEOP(0, PVAL($1),
344 innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
345 IVAL($2), $5, $8, $9, $7)));
346 TOKEN_GETMAD($1,innerop,'L');
347 TOKEN_GETMAD($2,innerop,'W');
348 TOKEN_GETMAD($3,innerop,'(');
349 TOKEN_GETMAD($6,innerop,')');
352 | label UNTIL '(' remember iexpr ')' mintro mblock cont
354 PL_parser->copline = (line_t)IVAL($2);
356 newSTATEOP(0, PVAL($1),
357 innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
358 IVAL($2), $5, $8, $9, $7)));
359 TOKEN_GETMAD($1,innerop,'L');
360 TOKEN_GETMAD($2,innerop,'W');
361 TOKEN_GETMAD($3,innerop,'(');
362 TOKEN_GETMAD($6,innerop,')');
364 | label FOR MY remember my_scalar '(' mexpr ')' mblock cont
367 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
369 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
370 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
371 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'d');
372 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,'(');
373 TOKEN_GETMAD($8,((LISTOP*)innerop)->op_first->op_sibling,')');
375 | label FOR scalar '(' remember mexpr ')' mblock cont
378 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
379 mod($3, OP_ENTERLOOP), $6, $8, $9));
380 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
381 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
382 TOKEN_GETMAD($4,((LISTOP*)innerop)->op_first->op_sibling,'(');
383 TOKEN_GETMAD($7,((LISTOP*)innerop)->op_first->op_sibling,')');
385 | label FOR '(' remember mexpr ')' mblock cont
388 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
389 (OP*)NULL, $5, $7, $8));
390 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
391 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
392 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'(');
393 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,')');
395 | label FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
397 /* basically fake up an initialize-while lineseq */
399 PL_parser->copline = (line_t)IVAL($2);
400 forop = newSTATEOP(0, PVAL($1),
401 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
402 IVAL($2), scalar($7),
405 forop = newUNOP(OP_NULL, 0, append_elem(OP_LINESEQ,
407 CopLABEL_alloc(($1)->tk_lval.pval),
408 ($5 ? $5 : newOP(OP_NULL, 0)) ),
411 token_getmad($2,forop,'3');
412 token_getmad($3,forop,'(');
413 token_getmad($6,forop,'1');
414 token_getmad($8,forop,'2');
415 token_getmad($11,forop,')');
416 token_getmad($1,forop,'L');
419 forop = append_elem(OP_LINESEQ,
420 newSTATEOP(0, CopLABEL_alloc($1), $5),
426 $$ = block_end($4, forop); }
427 | label block cont /* a block is a loop that happens once */
428 { $$ = newSTATEOP(0, PVAL($1),
429 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
430 NOLINE, (OP*)NULL, $2, $3, 0));
431 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
435 switch : label GIVEN '(' remember mydefsv mexpr ')' mblock
436 { PL_parser->copline = (line_t) IVAL($2);
438 newSTATEOP(0, PVAL($1),
439 newGIVENOP($6, scope($8),
440 (PADOFFSET) $5) )); }
443 /* determine whether there are any new my declarations */
445 { $$ = (PL_min_intro_pending &&
446 PL_max_intro_pending >= PL_min_intro_pending);
449 /* Normal expression */
455 /* Boolean expression */
456 texpr : /* NULL means true */
458 (void)scan_num("1", &tmplval);
459 $$ = tmplval.opval; }
463 /* Inverted boolean expression */
465 { $$ = invert(scalar($1)); }
468 /* Expression with its own lexical scope */
470 { $$ = $1; intro_my(); }
474 { $$ = $1; intro_my(); }
478 { $$ = $1; intro_my(); }
481 /* Optional "MAIN:"-style loop labels */
487 $$ = newTOKEN(OP_NULL, tmplval, 0);
495 /* Some kind of declaration - just hang on peg in the parse tree */
507 /* these two are only used by MAD */
514 { $$ = newOP(OP_NULL,0);
515 TOKEN_GETMAD($1,$$,'p');
519 format : FORMAT startformsub formname block
521 CV *fmtcv = PL_compcv;
522 SvREFCNT_inc_simple_void(PL_compcv);
524 $$ = newFORM($2, $3, $4);
525 prepend_madprops($1->tk_mad, $$, 'F');
532 if (CvOUTSIDE(fmtcv) && !CvUNIQUE(CvOUTSIDE(fmtcv))) {
533 SvREFCNT_inc_simple_void(fmtcv);
534 pad_add_anon((SV*)fmtcv, OP_NULL);
539 formname: WORD { $$ = $1; }
540 | /* NULL */ { $$ = (OP*)NULL; }
543 /* Unimplemented "my sub foo { }" */
544 mysubrout: MYSUB startsub subname proto subattrlist subbody
545 { SvREFCNT_inc_simple_void(PL_compcv);
547 $$ = newMYSUB($2, $3, $4, $5, $6);
548 token_getmad($1,$$,'d');
550 newMYSUB($2, $3, $4, $5, $6);
556 /* Subroutine definition */
557 subrout : SUB startsub subname proto subattrlist subbody
558 { SvREFCNT_inc_simple_void(PL_compcv);
561 OP* o = newSVOP(OP_ANONCODE, 0,
562 (SV*)newATTRSUB($2, $3, $4, $5, $6));
563 $$ = newOP(OP_NULL,0);
565 op_getmad($3,$$,'n');
566 op_getmad($4,$$,'s');
567 op_getmad($5,$$,'a');
568 token_getmad($1,$$,'d');
569 append_madprops($6->op_madprop, $$, 0);
573 newATTRSUB($2, $3, $4, $5, $6);
579 startsub: /* NULL */ /* start a regular subroutine scope */
580 { $$ = start_subparse(FALSE, 0);
581 SAVEFREESV(PL_compcv); }
585 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
586 { $$ = start_subparse(FALSE, CVf_ANON);
587 SAVEFREESV(PL_compcv); }
590 startformsub: /* NULL */ /* start a format subroutine scope */
591 { $$ = start_subparse(TRUE, 0);
592 SAVEFREESV(PL_compcv); }
595 /* Name of a subroutine - must be a bareword, could be special */
596 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
597 if (strEQ(name, "BEGIN") || strEQ(name, "END")
598 || strEQ(name, "INIT") || strEQ(name, "CHECK")
599 || strEQ(name, "UNITCHECK"))
600 CvSPECIAL_on(PL_compcv);
604 /* Subroutine prototype */
610 /* Optional list of subroutine attributes */
611 subattrlist: /* NULL */
615 TOKEN_GETMAD($1,$$,':');
622 TOKEN_GETMAD($1,$$,':');
626 /* List of attributes for a "my" variable declaration */
627 myattrlist: COLONATTR THING
629 TOKEN_GETMAD($1,$$,':');
636 TOKEN_GETMAD($1,$$,':');
640 /* Subroutine body - either null or a block */
641 subbody : block { $$ = $1; }
646 PL_parser->expect = XSTATE;
647 TOKEN_GETMAD($1,$$,';');
651 package : PACKAGE WORD WORD ';'
655 token_getmad($1,$$,'o');
658 token_getmad($4,$$,';');
668 package_block: PACKAGE WORD WORD '{' remember
670 int save_3_latefree = $3->op_latefree;
673 $3->op_latefree = save_3_latefree;
675 int save_2_latefree = $2->op_latefree;
678 $2->op_latefree = save_2_latefree;
682 { if (PL_parser->copline > (line_t)IVAL($4))
683 PL_parser->copline = (line_t)IVAL($4);
684 $$ = block_end($5, $7);
685 TOKEN_GETMAD($4,$$,'{');
686 TOKEN_GETMAD($8,$$,'}');
694 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
695 WORD WORD listexpr ';'
696 { SvREFCNT_inc_simple_void(PL_compcv);
698 $$ = utilize(IVAL($1), $2, $4, $5, $6);
699 token_getmad($1,$$,'o');
700 token_getmad($7,$$,';');
701 if (PL_parser->rsfp_filters &&
702 AvFILLp(PL_parser->rsfp_filters) >= 0)
703 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
705 utilize(IVAL($1), $2, $4, $5, $6);
711 /* Ordinary expressions; logical combinations */
712 expr : expr ANDOP expr
713 { $$ = newLOGOP(OP_AND, 0, $1, $3);
714 TOKEN_GETMAD($2,$$,'o');
717 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
718 TOKEN_GETMAD($2,$$,'o');
721 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
722 TOKEN_GETMAD($2,$$,'o');
724 | argexpr %prec PREC_LOW
727 /* Expressions are a list of terms joined by commas */
728 argexpr : argexpr ','
731 OP* op = newNULLLIST();
732 token_getmad($2,op,',');
733 $$ = append_elem(OP_LIST, $1, op);
742 term = newUNOP(OP_NULL, 0, term);
743 token_getmad($2,term,',');
745 $$ = append_elem(OP_LIST, $1, term);
747 | term %prec PREC_LOW
751 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
752 { $$ = convert(IVAL($1), OPf_STACKED,
753 prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
754 TOKEN_GETMAD($1,$$,'o');
756 | FUNC '(' indirob expr ')' /* print ($fh @args */
757 { $$ = convert(IVAL($1), OPf_STACKED,
758 prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
759 TOKEN_GETMAD($1,$$,'o');
760 TOKEN_GETMAD($2,$$,'(');
761 TOKEN_GETMAD($5,$$,')');
763 | term ARROW method '(' listexprcom ')' /* $foo->bar(list) */
764 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
766 prepend_elem(OP_LIST, scalar($1), $5),
767 newUNOP(OP_METHOD, 0, $3)));
768 TOKEN_GETMAD($2,$$,'A');
769 TOKEN_GETMAD($4,$$,'(');
770 TOKEN_GETMAD($6,$$,')');
772 | term ARROW method /* $foo->bar */
773 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
774 append_elem(OP_LIST, scalar($1),
775 newUNOP(OP_METHOD, 0, $3)));
776 TOKEN_GETMAD($2,$$,'A');
778 | METHOD indirob listexpr /* new Class @args */
779 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
781 prepend_elem(OP_LIST, $2, $3),
782 newUNOP(OP_METHOD, 0, $1)));
784 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
785 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
787 prepend_elem(OP_LIST, $2, $4),
788 newUNOP(OP_METHOD, 0, $1)));
789 TOKEN_GETMAD($3,$$,'(');
790 TOKEN_GETMAD($5,$$,')');
792 | LSTOP listexpr /* print @args */
793 { $$ = convert(IVAL($1), 0, $2);
794 TOKEN_GETMAD($1,$$,'o');
796 | FUNC '(' listexprcom ')' /* print (@args) */
797 { $$ = convert(IVAL($1), 0, $3);
798 TOKEN_GETMAD($1,$$,'o');
799 TOKEN_GETMAD($2,$$,'(');
800 TOKEN_GETMAD($4,$$,')');
802 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
803 { SvREFCNT_inc_simple_void(PL_compcv);
804 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
805 listexpr %prec LSTOP /* ... @bar */
806 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
808 prepend_elem(OP_LIST, $<opval>4, $5), $1));
812 /* Names of methods. May use $object->$methodname */
817 /* Some kind of subscripted expression */
818 subscripted: star '{' expr ';' '}' /* *main::{something} */
819 /* In this and all the hash accessors, ';' is
820 * provided by the tokeniser */
821 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
822 PL_parser->expect = XOPERATOR;
823 TOKEN_GETMAD($2,$$,'{');
824 TOKEN_GETMAD($4,$$,';');
825 TOKEN_GETMAD($5,$$,'}');
827 | scalar '[' expr ']' /* $array[$element] */
828 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
829 TOKEN_GETMAD($2,$$,'[');
830 TOKEN_GETMAD($4,$$,']');
832 | term ARROW '[' expr ']' /* somearef->[$element] */
833 { $$ = newBINOP(OP_AELEM, 0,
834 ref(newAVREF($1),OP_RV2AV),
836 TOKEN_GETMAD($2,$$,'a');
837 TOKEN_GETMAD($3,$$,'[');
838 TOKEN_GETMAD($5,$$,']');
840 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
841 { $$ = newBINOP(OP_AELEM, 0,
842 ref(newAVREF($1),OP_RV2AV),
844 TOKEN_GETMAD($2,$$,'[');
845 TOKEN_GETMAD($4,$$,']');
847 | scalar '{' expr ';' '}' /* $foo->{bar();} */
848 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
849 PL_parser->expect = XOPERATOR;
850 TOKEN_GETMAD($2,$$,'{');
851 TOKEN_GETMAD($4,$$,';');
852 TOKEN_GETMAD($5,$$,'}');
854 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
855 { $$ = newBINOP(OP_HELEM, 0,
856 ref(newHVREF($1),OP_RV2HV),
858 PL_parser->expect = XOPERATOR;
859 TOKEN_GETMAD($2,$$,'a');
860 TOKEN_GETMAD($3,$$,'{');
861 TOKEN_GETMAD($5,$$,';');
862 TOKEN_GETMAD($6,$$,'}');
864 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
865 { $$ = newBINOP(OP_HELEM, 0,
866 ref(newHVREF($1),OP_RV2HV),
868 PL_parser->expect = XOPERATOR;
869 TOKEN_GETMAD($2,$$,'{');
870 TOKEN_GETMAD($4,$$,';');
871 TOKEN_GETMAD($5,$$,'}');
873 | term ARROW '(' ')' /* $subref->() */
874 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
875 newCVREF(0, scalar($1)));
876 TOKEN_GETMAD($2,$$,'a');
877 TOKEN_GETMAD($3,$$,'(');
878 TOKEN_GETMAD($4,$$,')');
880 | term ARROW '(' expr ')' /* $subref->(@args) */
881 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
882 append_elem(OP_LIST, $4,
883 newCVREF(0, scalar($1))));
884 TOKEN_GETMAD($2,$$,'a');
885 TOKEN_GETMAD($3,$$,'(');
886 TOKEN_GETMAD($5,$$,')');
889 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
890 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
891 append_elem(OP_LIST, $3,
892 newCVREF(0, scalar($1))));
893 TOKEN_GETMAD($2,$$,'(');
894 TOKEN_GETMAD($4,$$,')');
896 | subscripted '(' ')' /* $foo->{bar}->() */
897 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
898 newCVREF(0, scalar($1)));
899 TOKEN_GETMAD($2,$$,'(');
900 TOKEN_GETMAD($3,$$,')');
902 | '(' expr ')' '[' expr ']' /* list slice */
903 { $$ = newSLICEOP(0, $5, $2);
904 TOKEN_GETMAD($1,$$,'(');
905 TOKEN_GETMAD($3,$$,')');
906 TOKEN_GETMAD($4,$$,'[');
907 TOKEN_GETMAD($6,$$,']');
909 | '(' ')' '[' expr ']' /* empty list slice! */
910 { $$ = newSLICEOP(0, $4, (OP*)NULL);
911 TOKEN_GETMAD($1,$$,'(');
912 TOKEN_GETMAD($2,$$,')');
913 TOKEN_GETMAD($3,$$,'[');
914 TOKEN_GETMAD($5,$$,']');
918 /* Binary operators between terms */
919 termbinop: term ASSIGNOP term /* $x = $y */
920 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
921 TOKEN_GETMAD($2,$$,'o');
923 | term POWOP term /* $x ** $y */
924 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
925 TOKEN_GETMAD($2,$$,'o');
927 | term MULOP term /* $x * $y, $x x $y */
928 { if (IVAL($2) != OP_REPEAT)
930 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
931 TOKEN_GETMAD($2,$$,'o');
933 | term ADDOP term /* $x + $y */
934 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
935 TOKEN_GETMAD($2,$$,'o');
937 | term SHIFTOP term /* $x >> $y, $x << $y */
938 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
939 TOKEN_GETMAD($2,$$,'o');
941 | term RELOP term /* $x > $y, etc. */
942 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
943 TOKEN_GETMAD($2,$$,'o');
945 | term EQOP term /* $x == $y, $x eq $y */
946 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
947 TOKEN_GETMAD($2,$$,'o');
949 | term BITANDOP term /* $x & $y */
950 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
951 TOKEN_GETMAD($2,$$,'o');
953 | term BITOROP term /* $x | $y */
954 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
955 TOKEN_GETMAD($2,$$,'o');
957 | term DOTDOT term /* $x..$y, $x...$y */
959 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
963 op = (UNOP*)op->op_first; /* get to flop */
964 op = (UNOP*)op->op_first; /* get to flip */
965 op = (UNOP*)op->op_first; /* get to range */
966 token_getmad($2,(OP*)op,'o');
969 | term ANDAND term /* $x && $y */
970 { $$ = newLOGOP(OP_AND, 0, $1, $3);
971 TOKEN_GETMAD($2,$$,'o');
973 | term OROR term /* $x || $y */
974 { $$ = newLOGOP(OP_OR, 0, $1, $3);
975 TOKEN_GETMAD($2,$$,'o');
977 | term DORDOR term /* $x // $y */
978 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
979 TOKEN_GETMAD($2,$$,'o');
981 | term MATCHOP term /* $x =~ /$y/ */
982 { $$ = bind_match(IVAL($2), $1, $3);
984 ($$->op_type == OP_NOT
985 ? ((UNOP*)$$)->op_first : $$),
990 /* Unary operators and terms */
991 termunop : '-' term %prec UMINUS /* -$x */
992 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
993 TOKEN_GETMAD($1,$$,'o');
995 | '+' term %prec UMINUS /* +$x */
997 newUNOP(OP_NULL, 0, $2),
1000 TOKEN_GETMAD($1,$$,'+');
1002 | '!' term /* !$x */
1003 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1004 TOKEN_GETMAD($1,$$,'o');
1006 | '~' term /* ~$x */
1007 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
1008 TOKEN_GETMAD($1,$$,'o');
1010 | term POSTINC /* $x++ */
1011 { $$ = newUNOP(OP_POSTINC, 0,
1012 mod(scalar($1), OP_POSTINC));
1013 TOKEN_GETMAD($2,$$,'o');
1015 | term POSTDEC /* $x-- */
1016 { $$ = newUNOP(OP_POSTDEC, 0,
1017 mod(scalar($1), OP_POSTDEC));
1018 TOKEN_GETMAD($2,$$,'o');
1020 | PREINC term /* ++$x */
1021 { $$ = newUNOP(OP_PREINC, 0,
1022 mod(scalar($2), OP_PREINC));
1023 TOKEN_GETMAD($1,$$,'o');
1025 | PREDEC term /* --$x */
1026 { $$ = newUNOP(OP_PREDEC, 0,
1027 mod(scalar($2), OP_PREDEC));
1028 TOKEN_GETMAD($1,$$,'o');
1033 /* Constructors for anonymous data */
1034 anonymous: '[' expr ']'
1035 { $$ = newANONLIST($2);
1036 TOKEN_GETMAD($1,$$,'[');
1037 TOKEN_GETMAD($3,$$,']');
1040 { $$ = newANONLIST((OP*)NULL);
1041 TOKEN_GETMAD($1,$$,'[');
1042 TOKEN_GETMAD($2,$$,']');
1044 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1045 { $$ = newANONHASH($2);
1046 TOKEN_GETMAD($1,$$,'{');
1047 TOKEN_GETMAD($3,$$,';');
1048 TOKEN_GETMAD($4,$$,'}');
1050 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1051 { $$ = newANONHASH((OP*)NULL);
1052 TOKEN_GETMAD($1,$$,'{');
1053 TOKEN_GETMAD($2,$$,';');
1054 TOKEN_GETMAD($3,$$,'}');
1056 | ANONSUB startanonsub proto subattrlist block %prec '('
1057 { SvREFCNT_inc_simple_void(PL_compcv);
1058 $$ = newANONATTRSUB($2, $3, $4, $5);
1059 TOKEN_GETMAD($1,$$,'o');
1060 OP_GETMAD($3,$$,'s');
1061 OP_GETMAD($4,$$,'a');
1066 /* Things called with "do" */
1067 termdo : DO term %prec UNIOP /* do $filename */
1068 { $$ = dofile($2, IVAL($1));
1069 TOKEN_GETMAD($1,$$,'o');
1071 | DO block %prec '(' /* do { code */
1072 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2));
1073 TOKEN_GETMAD($1,$$,'D');
1075 | DO WORD '(' ')' /* do somesub() */
1076 { $$ = newUNOP(OP_ENTERSUB,
1077 OPf_SPECIAL|OPf_STACKED,
1078 prepend_elem(OP_LIST,
1080 (OPpENTERSUB_AMPER<<8),
1082 )),(OP*)NULL)); dep();
1083 TOKEN_GETMAD($1,$$,'o');
1084 TOKEN_GETMAD($3,$$,'(');
1085 TOKEN_GETMAD($4,$$,')');
1087 | DO WORD '(' expr ')' /* do somesub(@args) */
1088 { $$ = newUNOP(OP_ENTERSUB,
1089 OPf_SPECIAL|OPf_STACKED,
1090 append_elem(OP_LIST,
1093 (OPpENTERSUB_AMPER<<8),
1096 TOKEN_GETMAD($1,$$,'o');
1097 TOKEN_GETMAD($3,$$,'(');
1098 TOKEN_GETMAD($5,$$,')');
1100 | DO scalar '(' ')' /* do $subref () */
1101 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1102 prepend_elem(OP_LIST,
1103 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1104 TOKEN_GETMAD($1,$$,'o');
1105 TOKEN_GETMAD($3,$$,'(');
1106 TOKEN_GETMAD($4,$$,')');
1108 | DO scalar '(' expr ')' /* do $subref (@args) */
1109 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1110 prepend_elem(OP_LIST,
1112 scalar(newCVREF(0,scalar($2))))); dep();
1113 TOKEN_GETMAD($1,$$,'o');
1114 TOKEN_GETMAD($3,$$,'(');
1115 TOKEN_GETMAD($5,$$,')');
1124 | term '?' term ':' term
1125 { $$ = newCONDOP(0, $1, $3, $5);
1126 TOKEN_GETMAD($2,$$,'?');
1127 TOKEN_GETMAD($4,$$,':');
1129 | REFGEN term /* \$x, \@y, \%z */
1130 { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN));
1131 TOKEN_GETMAD($1,$$,'o');
1133 | myattrterm %prec UNIOP
1135 | LOCAL term %prec UNIOP
1136 { $$ = localize($2,IVAL($1));
1137 TOKEN_GETMAD($1,$$,'k');
1140 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1141 TOKEN_GETMAD($1,$$,'(');
1142 TOKEN_GETMAD($3,$$,')');
1145 { $$ = sawparens(newNULLLIST());
1146 TOKEN_GETMAD($1,$$,'(');
1147 TOKEN_GETMAD($2,$$,')');
1157 | arylen %prec '(' /* $#x, $#{ something } */
1158 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1161 | ary '[' expr ']' /* array slice */
1162 { $$ = prepend_elem(OP_ASLICE,
1163 newOP(OP_PUSHMARK, 0),
1164 newLISTOP(OP_ASLICE, 0,
1166 ref($1, OP_ASLICE)));
1167 TOKEN_GETMAD($2,$$,'[');
1168 TOKEN_GETMAD($4,$$,']');
1170 | ary '{' expr ';' '}' /* @hash{@keys} */
1171 { $$ = prepend_elem(OP_HSLICE,
1172 newOP(OP_PUSHMARK, 0),
1173 newLISTOP(OP_HSLICE, 0,
1175 ref(oopsHV($1), OP_HSLICE)));
1176 PL_parser->expect = XOPERATOR;
1177 TOKEN_GETMAD($2,$$,'{');
1178 TOKEN_GETMAD($4,$$,';');
1179 TOKEN_GETMAD($5,$$,'}');
1184 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1185 | amper '(' ')' /* &foo() */
1186 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1187 TOKEN_GETMAD($2,$$,'(');
1188 TOKEN_GETMAD($3,$$,')');
1190 | amper '(' expr ')' /* &foo(@args) */
1192 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1193 append_elem(OP_LIST, $3, scalar($1)));
1196 if (op->op_type == OP_CONST) { /* defeat const fold */
1197 op = (OP*)op->op_madprop->mad_val;
1199 token_getmad($2,op,'(');
1200 token_getmad($4,op,')');
1203 | NOAMP WORD listexpr /* foo(@args) */
1204 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1205 append_elem(OP_LIST, $3, scalar($2)));
1206 TOKEN_GETMAD($1,$$,'o');
1208 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1209 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1210 PL_hints |= HINT_BLOCK_SCOPE;
1211 TOKEN_GETMAD($1,$$,'o');
1214 { $$ = newLOOPEX(IVAL($1),$2);
1215 TOKEN_GETMAD($1,$$,'o');
1217 | NOTOP argexpr /* not $foo */
1218 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1219 TOKEN_GETMAD($1,$$,'o');
1221 | UNIOP /* Unary op, $_ implied */
1222 { $$ = newOP(IVAL($1), 0);
1223 TOKEN_GETMAD($1,$$,'o');
1225 | UNIOP block /* eval { foo }* */
1226 { $$ = newUNOP(IVAL($1), 0, $2);
1227 TOKEN_GETMAD($1,$$,'o');
1229 | UNIOP term /* Unary op */
1230 { $$ = newUNOP(IVAL($1), 0, $2);
1231 TOKEN_GETMAD($1,$$,'o');
1233 | REQUIRE /* require, $_ implied */
1234 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1235 TOKEN_GETMAD($1,$$,'o');
1237 | REQUIRE term /* require Foo */
1238 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1239 TOKEN_GETMAD($1,$$,'o');
1242 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1243 | UNIOPSUB term /* Sub treated as unop */
1244 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1245 append_elem(OP_LIST, $2, scalar($1))); }
1246 | FUNC0 /* Nullary operator */
1247 { $$ = newOP(IVAL($1), 0);
1248 TOKEN_GETMAD($1,$$,'o');
1251 { $$ = newOP(IVAL($1), 0);
1252 TOKEN_GETMAD($1,$$,'o');
1253 TOKEN_GETMAD($2,$$,'(');
1254 TOKEN_GETMAD($3,$$,')');
1256 | FUNC0SUB /* Sub treated as nullop */
1257 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1259 | FUNC1 '(' ')' /* not () */
1260 { $$ = (IVAL($1) == OP_NOT)
1261 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1262 : newOP(IVAL($1), OPf_SPECIAL);
1264 TOKEN_GETMAD($1,$$,'o');
1265 TOKEN_GETMAD($2,$$,'(');
1266 TOKEN_GETMAD($3,$$,')');
1268 | FUNC1 '(' expr ')' /* not($foo) */
1269 { $$ = newUNOP(IVAL($1), 0, $3);
1270 TOKEN_GETMAD($1,$$,'o');
1271 TOKEN_GETMAD($2,$$,'(');
1272 TOKEN_GETMAD($4,$$,')');
1274 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
1275 { $$ = pmruntime($1, $3, 1);
1276 TOKEN_GETMAD($2,$$,'(');
1277 TOKEN_GETMAD($4,$$,')');
1283 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1284 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1285 TOKEN_GETMAD($1,$$,'X');
1290 /* "my" declarations, with optional attributes */
1291 myattrterm: MY myterm myattrlist
1292 { $$ = my_attrs($2,$3);
1294 token_getmad($1,$$,'d');
1295 append_madprops($3->op_madprop, $$, 'a');
1300 { $$ = localize($2,IVAL($1));
1301 TOKEN_GETMAD($1,$$,'d');
1305 /* Things that can be "my"'d */
1306 myterm : '(' expr ')'
1307 { $$ = sawparens($2);
1308 TOKEN_GETMAD($1,$$,'(');
1309 TOKEN_GETMAD($3,$$,')');
1312 { $$ = sawparens(newNULLLIST());
1313 TOKEN_GETMAD($1,$$,'(');
1314 TOKEN_GETMAD($2,$$,')');
1324 /* Basic list expressions */
1325 listexpr: /* NULL */ %prec PREC_LOW
1327 | argexpr %prec PREC_LOW
1331 listexprcom: /* NULL */
1338 OP* op = newNULLLIST();
1339 token_getmad($2,op,',');
1340 $$ = append_elem(OP_LIST, $1, op);
1348 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1351 { PL_parser->in_my = 0; $$ = my($1); }
1355 { $$ = newCVREF(IVAL($1),$2);
1356 TOKEN_GETMAD($1,$$,'&');
1360 scalar : '$' indirob
1361 { $$ = newSVREF($2);
1362 TOKEN_GETMAD($1,$$,'$');
1367 { $$ = newAVREF($2);
1368 TOKEN_GETMAD($1,$$,'@');
1373 { $$ = newHVREF($2);
1374 TOKEN_GETMAD($1,$$,'%');
1378 arylen : DOLSHARP indirob
1379 { $$ = newAVREF($2);
1380 TOKEN_GETMAD($1,$$,'l');
1385 { $$ = newGVREF(0,$2);
1386 TOKEN_GETMAD($1,$$,'*');
1390 /* Indirect objects */
1392 { $$ = scalar($1); }
1393 | scalar %prec PREC_LOW
1394 { $$ = scalar($1); }