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.
36 * Note: due to the way that the cleanup code works WRT to freeing ops on
37 * the parse stack, it is dangerous to assign to the $n variables within
41 /* Make the parser re-entrant. */
45 /* FIXME for MAD - is the new mintro on while and until important? */
50 I32 ival; /* __DEFAULT__ (marker for regen_perly.pl;
51 must always be 1st union member) */
55 #ifdef PERL_IN_MADLY_C
67 %token <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
69 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF
70 %token <opval> FUNC0SUB UNIOPSUB LSTOPSUB
71 %token <p_tkval> LABEL
72 %token <i_tkval> FORMAT SUB ANONSUB PACKAGE USE
73 %token <i_tkval> WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
74 %token <i_tkval> GIVEN WHEN DEFAULT
75 %token <i_tkval> LOOPEX DOTDOT
76 %token <i_tkval> FUNC0 FUNC1 FUNC UNIOP LSTOP
77 %token <i_tkval> RELOP EQOP MULOP ADDOP
78 %token <i_tkval> DOLSHARP DO HASHBRACK NOAMP
79 %token <i_tkval> LOCAL MY MYSUB REQUIRE
80 %token <i_tkval> COLONATTR
82 %type <ival> prog progstart remember mremember savescope
83 %type <ival> startsub startanonsub startformsub
84 /* FIXME for MAD - are these two ival? */
85 %type <ival> mydefsv mintro
87 %type <opval> decl format subrout mysubrout package use peg
89 %type <opval> block mblock lineseq line loop cond else
90 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
91 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
92 %type <opval> listexpr listexprcom indirob listop method
93 %type <opval> formname subname proto subbody cont my_scalar
94 %type <opval> subattrlist myattrlist myattrterm myterm
95 %type <opval> termbinop termunop anonymous termdo
96 %type <opval> switch case
99 %nonassoc <i_tkval> PREC_LOW
102 %left <i_tkval> OROP DOROP
103 %left <i_tkval> ANDOP
104 %right <i_tkval> NOTOP
105 %nonassoc LSTOP LSTOPSUB
107 %right <i_tkval> ASSIGNOP
108 %right <i_tkval> '?' ':'
110 %left <i_tkval> OROR DORDOR
111 %left <i_tkval> ANDAND
112 %left <i_tkval> BITOROP
113 %left <i_tkval> BITANDOP
116 %nonassoc UNIOP UNIOPSUB
118 %left <i_tkval> SHIFTOP
121 %left <i_tkval> MATCHOP
122 %right <i_tkval> '!' '~' UMINUS REFGEN
123 %right <i_tkval> POWOP
124 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
125 %left <i_tkval> ARROW
126 %nonassoc <i_tkval> ')'
134 /* The whole program */
136 /*CONTINUED*/ lineseq
137 { $$ = $1; newPROG(block_end($1,$2)); }
140 /* An ordinary block */
141 block : '{' remember lineseq '}'
142 { if (PL_parser->copline > (line_t)IVAL($1))
143 PL_parser->copline = (line_t)IVAL($1);
144 $$ = block_end($2, $3);
145 TOKEN_GETMAD($1,$$,'{');
146 TOKEN_GETMAD($4,$$,'}');
150 remember: /* NULL */ /* start a full lexical scope */
151 { $$ = block_start(TRUE); }
154 mydefsv: /* NULL */ /* lexicalize $_ */
155 { $$ = (I32) allocmy("$_"); }
160 PL_parser->expect = XSTATE; $$ = block_start(TRUE);
165 mblock : '{' mremember lineseq '}'
166 { if (PL_parser->copline > (line_t)IVAL($1))
167 PL_parser->copline = (line_t)IVAL($1);
168 $$ = block_end($2, $3);
169 TOKEN_GETMAD($1,$$,'{');
170 TOKEN_GETMAD($4,$$,'}');
174 mremember: /* NULL */ /* start a partial lexical scope */
175 { $$ = block_start(FALSE); }
178 savescope: /* NULL */ /* remember stack pos in case of error */
179 { $$ = PL_savestack_ix; }
181 /* A collection of "lines" in the program */
187 append_list(OP_LINESEQ,
188 (LISTOP*)$1, (LISTOP*)$2),
191 | lineseq savescope line
193 $$ = append_list(OP_LINESEQ,
194 (LISTOP*)$1, (LISTOP*)$3);
195 PL_pad_reset_pending = TRUE;
196 if ($1 && $3) PL_hints |= HINT_BLOCK_SCOPE; }
199 /* A "line" in the program */
201 { $$ = newSTATEOP(0, PVAL($1), $2);
202 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
203 | loop /* loops add their own labels */
204 | switch /* ... and so do switches */
207 { $$ = newSTATEOP(0, PVAL($1), $2); }
211 $$ = newSTATEOP(0, PVAL($1), newOP(OP_NULL, 0));
212 TOKEN_GETMAD($1,$$,'L');
213 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first,';');
219 PL_parser->copline = NOLINE;
221 TOKEN_GETMAD($2,$$,';');
223 PL_parser->expect = XSTATE;
227 $$ = newSTATEOP(0, PVAL($1), $2);
228 PL_parser->expect = XSTATE;
230 /* sideff might already have a nexstate */
231 OP* op = ((LISTOP*)$$)->op_first;
233 while (op->op_sibling &&
234 op->op_sibling->op_type == OP_NEXTSTATE)
236 token_getmad($1,op,'L');
237 token_getmad($3,op,';');
243 /* An expression which may have a side-effect */
249 { $$ = newLOGOP(OP_AND, 0, $3, $1);
250 TOKEN_GETMAD($2,$$,'i');
253 { $$ = newLOGOP(OP_OR, 0, $3, $1);
254 TOKEN_GETMAD($2,$$,'i');
257 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
258 TOKEN_GETMAD($2,$$,'w');
261 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
262 TOKEN_GETMAD($2,$$,'w');
265 { $$ = newFOROP(0, Nullch, (line_t)IVAL($2),
266 Nullop, $3, $1, Nullop);
267 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first->op_sibling,'w');
271 /* else and elsif blocks */
275 { ($2)->op_flags |= OPf_PARENS; $$ = scope($2);
276 TOKEN_GETMAD($1,$$,'o');
278 | ELSIF '(' mexpr ')' mblock else
279 { PL_parser->copline = (line_t)IVAL($1);
280 $$ = newCONDOP(0, $3, scope($5), $6);
281 PL_hints |= HINT_BLOCK_SCOPE;
282 TOKEN_GETMAD($1,$$,'I');
283 TOKEN_GETMAD($2,$$,'(');
284 TOKEN_GETMAD($4,$$,')');
288 /* Real conditional expressions */
289 cond : IF '(' remember mexpr ')' mblock else
290 { PL_parser->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,$$,')');
297 | UNLESS '(' remember miexpr ')' mblock else
298 { PL_parser->copline = (line_t)IVAL($1);
300 newCONDOP(0, $4, scope($6), $7));
301 TOKEN_GETMAD($1,$$,'I');
302 TOKEN_GETMAD($2,$$,'(');
303 TOKEN_GETMAD($5,$$,')');
307 /* Cases for a switch statement */
308 case : WHEN '(' remember mexpr ')' mblock
310 newWHENOP($4, scope($6))); }
312 { $$ = newWHENOP(0, scope($2)); }
315 /* Continue blocks */
320 TOKEN_GETMAD($1,$$,'o');
324 /* Loops: while, until, for, and a bare block */
325 loop : label WHILE '(' remember texpr ')' mintro mblock cont
327 PL_parser->copline = (line_t)$2;
329 newSTATEOP(0, PVAL($1),
330 innerop = newWHILEOP(0, 1, (LOOP*)Nullop,
331 IVAL($2), $5, $8, $9, $7)));
332 TOKEN_GETMAD($1,innerop,'L');
333 TOKEN_GETMAD($2,innerop,'W');
334 TOKEN_GETMAD($3,innerop,'(');
335 TOKEN_GETMAD($6,innerop,')');
338 | label UNTIL '(' remember iexpr ')' mintro mblock cont
340 PL_parser->copline = (line_t)$2;
342 newSTATEOP(0, PVAL($1),
343 innerop = newWHILEOP(0, 1, (LOOP*)Nullop,
344 IVAL($2), $5, $8, $9, $7)));
345 TOKEN_GETMAD($1,innerop,'L');
346 TOKEN_GETMAD($2,innerop,'W');
347 TOKEN_GETMAD($3,innerop,'(');
348 TOKEN_GETMAD($6,innerop,')');
350 | label FOR MY remember my_scalar '(' mexpr ')' mblock cont
353 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
355 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
356 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
357 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'d');
358 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,'(');
359 TOKEN_GETMAD($8,((LISTOP*)innerop)->op_first->op_sibling,')');
361 | label FOR scalar '(' remember mexpr ')' mblock cont
364 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
365 mod($3, OP_ENTERLOOP), $6, $8, $9));
366 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
367 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
368 TOKEN_GETMAD($4,((LISTOP*)innerop)->op_first->op_sibling,'(');
369 TOKEN_GETMAD($7,((LISTOP*)innerop)->op_first->op_sibling,')');
371 | label FOR '(' remember mexpr ')' mblock cont
374 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
375 Nullop, $5, $7, $8));
376 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
377 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
378 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'(');
379 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,')');
381 | label FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
383 /* basically fake up an initialize-while lineseq */
385 PL_parser->copline = (line_t)IVAL($2);
386 forop = newSTATEOP(0, PVAL($1),
387 newWHILEOP(0, 1, (LOOP*)Nullop,
388 IVAL($2), scalar($7),
391 forop = newUNOP(OP_NULL, 0, append_elem(OP_LINESEQ,
393 CopLABEL_alloc(($1)->tk_lval.pval),
394 ($5 ? $5 : newOP(OP_NULL, 0)) ),
397 token_getmad($2,forop,'3');
398 token_getmad($3,forop,'(');
399 token_getmad($6,forop,'1');
400 token_getmad($8,forop,'2');
401 token_getmad($11,forop,')');
402 token_getmad($1,forop,'L');
405 forop = append_elem(OP_LINESEQ,
406 newSTATEOP(0, CopLABEL_alloc($1), $5),
412 $$ = block_end($4, forop); }
413 | label block cont /* a block is a loop that happens once */
414 { $$ = newSTATEOP(0, PVAL($1),
415 newWHILEOP(0, 1, (LOOP*)Nullop,
416 NOLINE, Nullop, $2, $3, 0));
417 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
421 switch : label GIVEN '(' remember mydefsv mexpr ')' mblock
422 { PL_parser->copline = (line_t) $2;
424 newSTATEOP(0, PVAL($1),
425 newGIVENOP($6, scope($8),
426 (PADOFFSET) $5) )); }
429 /* determine whether there are any new my declarations */
431 { $$ = (PL_min_intro_pending &&
432 PL_max_intro_pending >= PL_min_intro_pending);
435 /* Normal expression */
441 /* Boolean expression */
442 texpr : /* NULL means true */
444 (void)scan_num("1", &tmplval);
445 $$ = tmplval.opval; }
449 /* Inverted boolean expression */
451 { $$ = invert(scalar($1)); }
454 /* Expression with its own lexical scope */
456 { $$ = $1; intro_my(); }
460 { $$ = $1; intro_my(); }
464 { $$ = $1; intro_my(); }
467 /* Optional "MAIN:"-style loop labels */
472 tmplval.pval = Nullch;
473 $$ = newTOKEN(OP_NULL, tmplval, 0);
481 /* Some kind of declaration - just hang on peg in the parse tree */
493 /* these two are only used by MAD */
500 { $$ = newOP(OP_NULL,0);
501 TOKEN_GETMAD($1,$$,'p');
505 format : FORMAT startformsub formname block
506 { SvREFCNT_inc_simple_void(PL_compcv);
508 $$ = newFORM($2, $3, $4);
509 prepend_madprops($1->tk_mad, $$, 'F');
519 formname: WORD { $$ = $1; }
520 | /* NULL */ { $$ = Nullop; }
523 /* Unimplemented "my sub foo { }" */
524 mysubrout: MYSUB startsub subname proto subattrlist subbody
525 { SvREFCNT_inc_simple_void(PL_compcv);
527 $$ = newMYSUB($2, $3, $4, $5, $6);
528 token_getmad($1,$$,'d');
530 newMYSUB($2, $3, $4, $5, $6);
536 /* Subroutine definition */
537 subrout : SUB startsub subname proto subattrlist subbody
538 { SvREFCNT_inc_simple_void(PL_compcv);
541 OP* o = newSVOP(OP_ANONCODE, 0,
542 (SV*)newATTRSUB($2, $3, $4, $5, $6));
543 $$ = newOP(OP_NULL,0);
545 op_getmad($3,$$,'n');
546 op_getmad($4,$$,'s');
547 op_getmad($5,$$,'a');
548 token_getmad($1,$$,'d');
549 append_madprops($6->op_madprop, $$, 0);
553 newATTRSUB($2, $3, $4, $5, $6);
559 startsub: /* NULL */ /* start a regular subroutine scope */
560 { $$ = start_subparse(FALSE, 0);
561 SAVEFREESV(PL_compcv); }
565 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
566 { $$ = start_subparse(FALSE, CVf_ANON);
567 SAVEFREESV(PL_compcv); }
570 startformsub: /* NULL */ /* start a format subroutine scope */
571 { $$ = start_subparse(TRUE, 0);
572 SAVEFREESV(PL_compcv); }
575 /* Name of a subroutine - must be a bareword, could be special */
576 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
577 if (strEQ(name, "BEGIN") || strEQ(name, "END")
578 || strEQ(name, "INIT") || strEQ(name, "CHECK")
579 || strEQ(name, "UNITCHECK"))
580 CvSPECIAL_on(PL_compcv);
584 /* Subroutine prototype */
590 /* Optional list of subroutine attributes */
591 subattrlist: /* NULL */
595 TOKEN_GETMAD($1,$$,':');
602 TOKEN_GETMAD($1,$$,':');
606 /* List of attributes for a "my" variable declaration */
607 myattrlist: COLONATTR THING
609 TOKEN_GETMAD($1,$$,':');
616 TOKEN_GETMAD($1,$$,':');
620 /* Subroutine body - either null or a block */
621 subbody : block { $$ = $1; }
626 PL_parser->expect = XSTATE;
627 TOKEN_GETMAD($1,$$,';');
631 package : PACKAGE WORD ';'
635 token_getmad($1,$$,'o');
636 token_getmad($3,$$,';');
645 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
646 WORD WORD listexpr ';'
647 { SvREFCNT_inc_simple_void(PL_compcv);
649 $$ = utilize(IVAL($1), $2, $4, $5, $6);
650 token_getmad($1,$$,'o');
651 token_getmad($7,$$,';');
652 if (PL_parser->rsfp_filters &&
653 AvFILLp(PL_parser->rsfp_filters) >= 0)
654 append_madprops(newMADPROP('!', MAD_PV, "", 0), $$, 0);
656 utilize(IVAL($1), $2, $4, $5, $6);
662 /* Ordinary expressions; logical combinations */
663 expr : expr ANDOP expr
664 { $$ = newLOGOP(OP_AND, 0, $1, $3);
665 TOKEN_GETMAD($2,$$,'o');
668 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
669 TOKEN_GETMAD($2,$$,'o');
672 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
673 TOKEN_GETMAD($2,$$,'o');
675 | argexpr %prec PREC_LOW
678 /* Expressions are a list of terms joined by commas */
679 argexpr : argexpr ','
682 OP* op = newNULLLIST();
683 token_getmad($2,op,',');
684 $$ = append_elem(OP_LIST, $1, op);
693 term = newUNOP(OP_NULL, 0, term);
694 token_getmad($2,term,',');
696 $$ = append_elem(OP_LIST, $1, term);
698 | term %prec PREC_LOW
702 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
703 { $$ = convert(IVAL($1), OPf_STACKED,
704 prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
705 TOKEN_GETMAD($1,$$,'o');
707 | FUNC '(' indirob expr ')' /* print ($fh @args */
708 { $$ = convert(IVAL($1), OPf_STACKED,
709 prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
710 TOKEN_GETMAD($1,$$,'o');
711 TOKEN_GETMAD($2,$$,'(');
712 TOKEN_GETMAD($5,$$,')');
714 | term ARROW method '(' listexprcom ')' /* $foo->bar(list) */
715 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
717 prepend_elem(OP_LIST, scalar($1), $5),
718 newUNOP(OP_METHOD, 0, $3)));
719 TOKEN_GETMAD($2,$$,'A');
720 TOKEN_GETMAD($4,$$,'(');
721 TOKEN_GETMAD($6,$$,')');
723 | term ARROW method /* $foo->bar */
724 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
725 append_elem(OP_LIST, scalar($1),
726 newUNOP(OP_METHOD, 0, $3)));
727 TOKEN_GETMAD($2,$$,'A');
729 | METHOD indirob listexpr /* new Class @args */
730 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
732 prepend_elem(OP_LIST, $2, $3),
733 newUNOP(OP_METHOD, 0, $1)));
735 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
736 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
738 prepend_elem(OP_LIST, $2, $4),
739 newUNOP(OP_METHOD, 0, $1)));
740 TOKEN_GETMAD($3,$$,'(');
741 TOKEN_GETMAD($5,$$,')');
743 | LSTOP listexpr /* print @args */
744 { $$ = convert(IVAL($1), 0, $2);
745 TOKEN_GETMAD($1,$$,'o');
747 | FUNC '(' listexprcom ')' /* print (@args) */
748 { $$ = convert(IVAL($1), 0, $3);
749 TOKEN_GETMAD($1,$$,'o');
750 TOKEN_GETMAD($2,$$,'(');
751 TOKEN_GETMAD($4,$$,')');
753 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
754 { SvREFCNT_inc_simple_void(PL_compcv);
755 $<opval>$ = newANONATTRSUB($2, 0, Nullop, $3); }
756 listexpr %prec LSTOP /* ... @bar */
757 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
759 prepend_elem(OP_LIST, $<opval>4, $5), $1));
763 /* Names of methods. May use $object->$methodname */
768 /* Some kind of subscripted expression */
769 subscripted: star '{' expr ';' '}' /* *main::{something} */
770 /* In this and all the hash accessors, ';' is
771 * provided by the tokeniser */
772 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
773 PL_parser->expect = XOPERATOR;
774 TOKEN_GETMAD($2,$$,'{');
775 TOKEN_GETMAD($4,$$,';');
776 TOKEN_GETMAD($5,$$,'}');
778 | scalar '[' expr ']' /* $array[$element] */
779 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
780 TOKEN_GETMAD($2,$$,'[');
781 TOKEN_GETMAD($4,$$,']');
783 | term ARROW '[' expr ']' /* somearef->[$element] */
784 { $$ = newBINOP(OP_AELEM, 0,
785 ref(newAVREF($1),OP_RV2AV),
787 TOKEN_GETMAD($2,$$,'a');
788 TOKEN_GETMAD($3,$$,'[');
789 TOKEN_GETMAD($5,$$,']');
791 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
792 { $$ = newBINOP(OP_AELEM, 0,
793 ref(newAVREF($1),OP_RV2AV),
795 TOKEN_GETMAD($2,$$,'[');
796 TOKEN_GETMAD($4,$$,']');
798 | scalar '{' expr ';' '}' /* $foo->{bar();} */
799 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
800 PL_parser->expect = XOPERATOR;
801 TOKEN_GETMAD($2,$$,'{');
802 TOKEN_GETMAD($4,$$,';');
803 TOKEN_GETMAD($5,$$,'}');
805 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
806 { $$ = newBINOP(OP_HELEM, 0,
807 ref(newHVREF($1),OP_RV2HV),
809 PL_parser->expect = XOPERATOR;
810 TOKEN_GETMAD($2,$$,'a');
811 TOKEN_GETMAD($3,$$,'{');
812 TOKEN_GETMAD($5,$$,';');
813 TOKEN_GETMAD($6,$$,'}');
815 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
816 { $$ = newBINOP(OP_HELEM, 0,
817 ref(newHVREF($1),OP_RV2HV),
819 PL_parser->expect = XOPERATOR;
820 TOKEN_GETMAD($2,$$,'{');
821 TOKEN_GETMAD($4,$$,';');
822 TOKEN_GETMAD($5,$$,'}');
824 | term ARROW '(' ')' /* $subref->() */
825 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
826 newCVREF(0, scalar($1)));
827 TOKEN_GETMAD($2,$$,'a');
828 TOKEN_GETMAD($3,$$,'(');
829 TOKEN_GETMAD($4,$$,')');
831 | term ARROW '(' expr ')' /* $subref->(@args) */
832 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
833 append_elem(OP_LIST, $4,
834 newCVREF(0, scalar($1))));
835 TOKEN_GETMAD($2,$$,'a');
836 TOKEN_GETMAD($3,$$,'(');
837 TOKEN_GETMAD($5,$$,')');
840 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
841 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
842 append_elem(OP_LIST, $3,
843 newCVREF(0, scalar($1))));
844 TOKEN_GETMAD($2,$$,'(');
845 TOKEN_GETMAD($4,$$,')');
847 | subscripted '(' ')' /* $foo->{bar}->() */
848 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
849 newCVREF(0, scalar($1)));
850 TOKEN_GETMAD($2,$$,'(');
851 TOKEN_GETMAD($3,$$,')');
853 | '(' expr ')' '[' expr ']' /* list slice */
854 { $$ = newSLICEOP(0, $5, $2);
855 TOKEN_GETMAD($1,$$,'(');
856 TOKEN_GETMAD($3,$$,')');
857 TOKEN_GETMAD($4,$$,'[');
858 TOKEN_GETMAD($6,$$,']');
860 | '(' ')' '[' expr ']' /* empty list slice! */
861 { $$ = newSLICEOP(0, $4, Nullop);
862 TOKEN_GETMAD($1,$$,'(');
863 TOKEN_GETMAD($2,$$,')');
864 TOKEN_GETMAD($3,$$,'[');
865 TOKEN_GETMAD($5,$$,']');
869 /* Binary operators between terms */
870 termbinop: term ASSIGNOP term /* $x = $y */
871 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
872 TOKEN_GETMAD($2,$$,'o');
874 | term POWOP term /* $x ** $y */
875 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
876 TOKEN_GETMAD($2,$$,'o');
878 | term MULOP term /* $x * $y, $x x $y */
879 { if (IVAL($2) != OP_REPEAT)
881 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
882 TOKEN_GETMAD($2,$$,'o');
884 | term ADDOP term /* $x + $y */
885 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
886 TOKEN_GETMAD($2,$$,'o');
888 | term SHIFTOP term /* $x >> $y, $x << $y */
889 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
890 TOKEN_GETMAD($2,$$,'o');
892 | term RELOP term /* $x > $y, etc. */
893 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
894 TOKEN_GETMAD($2,$$,'o');
896 | term EQOP term /* $x == $y, $x eq $y */
897 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
898 TOKEN_GETMAD($2,$$,'o');
900 | term BITANDOP term /* $x & $y */
901 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
902 TOKEN_GETMAD($2,$$,'o');
904 | term BITOROP term /* $x | $y */
905 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
906 TOKEN_GETMAD($2,$$,'o');
908 | term DOTDOT term /* $x..$y, $x...$y */
910 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
914 op = (UNOP*)op->op_first; /* get to flop */
915 op = (UNOP*)op->op_first; /* get to flip */
916 op = (UNOP*)op->op_first; /* get to range */
917 token_getmad($2,(OP*)op,'o');
920 | term ANDAND term /* $x && $y */
921 { $$ = newLOGOP(OP_AND, 0, $1, $3);
922 TOKEN_GETMAD($2,$$,'o');
924 | term OROR term /* $x || $y */
925 { $$ = newLOGOP(OP_OR, 0, $1, $3);
926 TOKEN_GETMAD($2,$$,'o');
928 | term DORDOR term /* $x // $y */
929 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
930 TOKEN_GETMAD($2,$$,'o');
932 | term MATCHOP term /* $x =~ /$y/ */
933 { $$ = bind_match(IVAL($2), $1, $3);
935 ($$->op_type == OP_NOT
936 ? ((UNOP*)$$)->op_first : $$),
941 /* Unary operators and terms */
942 termunop : '-' term %prec UMINUS /* -$x */
943 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
944 TOKEN_GETMAD($1,$$,'o');
946 | '+' term %prec UMINUS /* +$x */
948 newUNOP(OP_NULL, 0, $2),
951 TOKEN_GETMAD($1,$$,'+');
954 { $$ = newUNOP(OP_NOT, 0, scalar($2));
955 TOKEN_GETMAD($1,$$,'o');
958 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
959 TOKEN_GETMAD($1,$$,'o');
961 | term POSTINC /* $x++ */
962 { $$ = newUNOP(OP_POSTINC, 0,
963 mod(scalar($1), OP_POSTINC));
964 TOKEN_GETMAD($2,$$,'o');
966 | term POSTDEC /* $x-- */
967 { $$ = newUNOP(OP_POSTDEC, 0,
968 mod(scalar($1), OP_POSTDEC));
969 TOKEN_GETMAD($2,$$,'o');
971 | PREINC term /* ++$x */
972 { $$ = newUNOP(OP_PREINC, 0,
973 mod(scalar($2), OP_PREINC));
974 TOKEN_GETMAD($1,$$,'o');
976 | PREDEC term /* --$x */
977 { $$ = newUNOP(OP_PREDEC, 0,
978 mod(scalar($2), OP_PREDEC));
979 TOKEN_GETMAD($1,$$,'o');
984 /* Constructors for anonymous data */
985 anonymous: '[' expr ']'
986 { $$ = newANONLIST($2);
987 TOKEN_GETMAD($1,$$,'[');
988 TOKEN_GETMAD($3,$$,']');
991 { $$ = newANONLIST(Nullop);
992 TOKEN_GETMAD($1,$$,'[');
993 TOKEN_GETMAD($2,$$,']');
995 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
996 { $$ = newANONHASH($2);
997 TOKEN_GETMAD($1,$$,'{');
998 TOKEN_GETMAD($3,$$,';');
999 TOKEN_GETMAD($4,$$,'}');
1001 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1002 { $$ = newANONHASH(Nullop);
1003 TOKEN_GETMAD($1,$$,'{');
1004 TOKEN_GETMAD($2,$$,';');
1005 TOKEN_GETMAD($3,$$,'}');
1007 | ANONSUB startanonsub proto subattrlist block %prec '('
1008 { SvREFCNT_inc_simple_void(PL_compcv);
1009 $$ = newANONATTRSUB($2, $3, $4, $5);
1010 TOKEN_GETMAD($1,$$,'o');
1011 OP_GETMAD($3,$$,'s');
1012 OP_GETMAD($4,$$,'a');
1017 /* Things called with "do" */
1018 termdo : DO term %prec UNIOP /* do $filename */
1019 { $$ = dofile($2, IVAL($1));
1020 TOKEN_GETMAD($1,$$,'o');
1022 | DO block %prec '(' /* do { code */
1023 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2));
1024 TOKEN_GETMAD($1,$$,'D');
1026 | DO WORD '(' ')' /* do somesub() */
1027 { $$ = newUNOP(OP_ENTERSUB,
1028 OPf_SPECIAL|OPf_STACKED,
1029 prepend_elem(OP_LIST,
1031 (OPpENTERSUB_AMPER<<8),
1034 TOKEN_GETMAD($1,$$,'o');
1035 TOKEN_GETMAD($3,$$,'(');
1036 TOKEN_GETMAD($4,$$,')');
1038 | DO WORD '(' expr ')' /* do somesub(@args) */
1039 { $$ = newUNOP(OP_ENTERSUB,
1040 OPf_SPECIAL|OPf_STACKED,
1041 append_elem(OP_LIST,
1044 (OPpENTERSUB_AMPER<<8),
1047 TOKEN_GETMAD($1,$$,'o');
1048 TOKEN_GETMAD($3,$$,'(');
1049 TOKEN_GETMAD($5,$$,')');
1051 | DO scalar '(' ')' /* do $subref () */
1052 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1053 prepend_elem(OP_LIST,
1054 scalar(newCVREF(0,scalar($2))), Nullop)); dep();
1055 TOKEN_GETMAD($1,$$,'o');
1056 TOKEN_GETMAD($3,$$,'(');
1057 TOKEN_GETMAD($4,$$,')');
1059 | DO scalar '(' expr ')' /* do $subref (@args) */
1060 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1061 prepend_elem(OP_LIST,
1063 scalar(newCVREF(0,scalar($2))))); dep();
1064 TOKEN_GETMAD($1,$$,'o');
1065 TOKEN_GETMAD($3,$$,'(');
1066 TOKEN_GETMAD($5,$$,')');
1075 | term '?' term ':' term
1076 { $$ = newCONDOP(0, $1, $3, $5);
1077 TOKEN_GETMAD($2,$$,'?');
1078 TOKEN_GETMAD($4,$$,':');
1080 | REFGEN term /* \$x, \@y, \%z */
1081 { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN));
1082 TOKEN_GETMAD($1,$$,'o');
1084 | myattrterm %prec UNIOP
1086 | LOCAL term %prec UNIOP
1087 { $$ = localize($2,IVAL($1));
1088 TOKEN_GETMAD($1,$$,'k');
1091 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1092 TOKEN_GETMAD($1,$$,'(');
1093 TOKEN_GETMAD($3,$$,')');
1096 { $$ = sawparens(newNULLLIST());
1097 TOKEN_GETMAD($1,$$,'(');
1098 TOKEN_GETMAD($2,$$,')');
1108 | arylen %prec '(' /* $#x, $#{ something } */
1109 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1112 | ary '[' expr ']' /* array slice */
1113 { $$ = prepend_elem(OP_ASLICE,
1114 newOP(OP_PUSHMARK, 0),
1115 newLISTOP(OP_ASLICE, 0,
1117 ref($1, OP_ASLICE)));
1118 TOKEN_GETMAD($2,$$,'[');
1119 TOKEN_GETMAD($4,$$,']');
1121 | ary '{' expr ';' '}' /* @hash{@keys} */
1122 { $$ = prepend_elem(OP_HSLICE,
1123 newOP(OP_PUSHMARK, 0),
1124 newLISTOP(OP_HSLICE, 0,
1126 ref(oopsHV($1), OP_HSLICE)));
1127 PL_parser->expect = XOPERATOR;
1128 TOKEN_GETMAD($2,$$,'{');
1129 TOKEN_GETMAD($4,$$,';');
1130 TOKEN_GETMAD($5,$$,'}');
1135 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1136 | amper '(' ')' /* &foo() */
1137 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1138 TOKEN_GETMAD($2,$$,'(');
1139 TOKEN_GETMAD($3,$$,')');
1141 | amper '(' expr ')' /* &foo(@args) */
1143 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1144 append_elem(OP_LIST, $3, scalar($1)));
1147 if (op->op_type == OP_CONST) { /* defeat const fold */
1148 op = (OP*)op->op_madprop->mad_val;
1150 token_getmad($2,op,'(');
1151 token_getmad($4,op,')');
1154 | NOAMP WORD listexpr /* foo(@args) */
1155 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1156 append_elem(OP_LIST, $3, scalar($2)));
1157 TOKEN_GETMAD($1,$$,'o');
1159 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1160 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1161 PL_hints |= HINT_BLOCK_SCOPE;
1162 TOKEN_GETMAD($1,$$,'o');
1165 { $$ = newLOOPEX(IVAL($1),$2);
1166 TOKEN_GETMAD($1,$$,'o');
1168 | NOTOP argexpr /* not $foo */
1169 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1170 TOKEN_GETMAD($1,$$,'o');
1172 | UNIOP /* Unary op, $_ implied */
1173 { $$ = newOP(IVAL($1), 0);
1174 TOKEN_GETMAD($1,$$,'o');
1176 | UNIOP block /* eval { foo }* */
1177 { $$ = newUNOP(IVAL($1), 0, $2);
1178 TOKEN_GETMAD($1,$$,'o');
1180 | UNIOP term /* Unary op */
1181 { $$ = newUNOP(IVAL($1), 0, $2);
1182 TOKEN_GETMAD($1,$$,'o');
1184 | REQUIRE /* require, $_ implied */
1185 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1186 TOKEN_GETMAD($1,$$,'o');
1188 | REQUIRE term /* require Foo */
1189 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1190 TOKEN_GETMAD($1,$$,'o');
1193 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1194 | UNIOPSUB term /* Sub treated as unop */
1195 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1196 append_elem(OP_LIST, $2, scalar($1))); }
1197 | FUNC0 /* Nullary operator */
1198 { $$ = newOP(IVAL($1), 0);
1199 TOKEN_GETMAD($1,$$,'o');
1202 { $$ = newOP(IVAL($1), 0);
1203 TOKEN_GETMAD($1,$$,'o');
1204 TOKEN_GETMAD($2,$$,'(');
1205 TOKEN_GETMAD($3,$$,')');
1207 | FUNC0SUB /* Sub treated as nullop */
1208 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1210 | FUNC1 '(' ')' /* not () */
1211 { $$ = (IVAL($1) == OP_NOT)
1212 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1213 : newOP(IVAL($1), OPf_SPECIAL);
1215 TOKEN_GETMAD($1,$$,'o');
1216 TOKEN_GETMAD($2,$$,'(');
1217 TOKEN_GETMAD($3,$$,')');
1219 | FUNC1 '(' expr ')' /* not($foo) */
1220 { $$ = newUNOP(IVAL($1), 0, $3);
1221 TOKEN_GETMAD($1,$$,'o');
1222 TOKEN_GETMAD($2,$$,'(');
1223 TOKEN_GETMAD($4,$$,')');
1225 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
1226 { $$ = pmruntime($1, $3, 1);
1227 TOKEN_GETMAD($2,$$,'(');
1228 TOKEN_GETMAD($4,$$,')');
1234 /* "my" declarations, with optional attributes */
1235 myattrterm: MY myterm myattrlist
1236 { $$ = my_attrs($2,$3);
1238 token_getmad($1,$$,'d');
1239 append_madprops($3->op_madprop, $$, 'a');
1244 { $$ = localize($2,IVAL($1));
1245 TOKEN_GETMAD($1,$$,'d');
1249 /* Things that can be "my"'d */
1250 myterm : '(' expr ')'
1251 { $$ = sawparens($2);
1252 TOKEN_GETMAD($1,$$,'(');
1253 TOKEN_GETMAD($3,$$,')');
1256 { $$ = sawparens(newNULLLIST());
1257 TOKEN_GETMAD($1,$$,'(');
1258 TOKEN_GETMAD($2,$$,')');
1268 /* Basic list expressions */
1269 listexpr: /* NULL */ %prec PREC_LOW
1271 | argexpr %prec PREC_LOW
1275 listexprcom: /* NULL */
1282 OP* op = newNULLLIST();
1283 token_getmad($2,op,',');
1284 $$ = append_elem(OP_LIST, $1, op);
1292 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1295 { PL_parser->in_my = 0; $$ = my($1); }
1299 { $$ = newCVREF(IVAL($1),$2);
1300 TOKEN_GETMAD($1,$$,'&');
1304 scalar : '$' indirob
1305 { $$ = newSVREF($2);
1306 TOKEN_GETMAD($1,$$,'$');
1311 { $$ = newAVREF($2);
1312 TOKEN_GETMAD($1,$$,'@');
1317 { $$ = newHVREF($2);
1318 TOKEN_GETMAD($1,$$,'%');
1322 arylen : DOLSHARP indirob
1323 { $$ = newAVREF($2);
1324 TOKEN_GETMAD($1,$$,'l');
1329 { $$ = newGVREF(0,$2);
1330 TOKEN_GETMAD($1,$$,'*');
1334 /* Indirect objects */
1336 { $$ = scalar($1); }
1337 | scalar %prec PREC_LOW
1338 { $$ = scalar($1); }