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 <ival> GRAMPROG GRAMBLOCK GRAMFULLSTMT GRAMSTMTSEQ
74 %token <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
76 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF QWLIST
77 %token <opval> 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 <i_tkval> lpar_or_qw
92 %type <ival> grammar prog progstart remember mremember
93 %type <ival> startsub startanonsub startformsub
94 /* FIXME for MAD - are these two ival? */
95 %type <ival> mydefsv mintro
97 %type <opval> fullstmt decl format subrout mysubrout package use peg
98 %type <opval> block package_block mblock stmtseq loop cond else
99 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
100 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
101 %type <opval> listexpr listexprcom indirob listop method
102 %type <opval> formname subname proto subbody cont my_scalar
103 %type <opval> subattrlist myattrlist myattrterm myterm
104 %type <opval> termbinop termunop anonymous termdo
105 %type <opval> switch case
106 %type <p_tkval> label
108 %nonassoc <i_tkval> PREC_LOW
111 %left <i_tkval> OROP DOROP
112 %left <i_tkval> ANDOP
113 %right <i_tkval> NOTOP
114 %nonassoc LSTOP LSTOPSUB
116 %right <i_tkval> ASSIGNOP
117 %right <i_tkval> '?' ':'
118 %nonassoc DOTDOT YADAYADA
119 %left <i_tkval> OROR DORDOR
120 %left <i_tkval> ANDAND
121 %left <i_tkval> BITOROP
122 %left <i_tkval> BITANDOP
125 %nonassoc UNIOP UNIOPSUB
127 %left <i_tkval> SHIFTOP
130 %left <i_tkval> MATCHOP
131 %right <i_tkval> '!' '~' UMINUS REFGEN
132 %right <i_tkval> POWOP
133 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
134 %left <i_tkval> ARROW
135 %nonassoc <i_tkval> ')'
143 /* Top-level choice of what kind of thing yyparse was called to parse */
144 grammar : GRAMPROG prog
148 parser->expect = XBLOCK;
152 PL_pad_reset_pending = TRUE;
156 parser->yychar = YYEOF;
160 parser->expect = XSTATE;
164 PL_pad_reset_pending = TRUE;
168 parser->yychar = YYEOF;
172 parser->expect = XSTATE;
181 /* The whole program */
183 /*CONTINUED*/ stmtseq
184 { $$ = $1; newPROG(block_end($1,$2)); }
187 /* An ordinary block */
188 block : '{' remember stmtseq '}'
189 { if (PL_parser->copline > (line_t)IVAL($1))
190 PL_parser->copline = (line_t)IVAL($1);
191 $$ = block_end($2, $3);
192 TOKEN_GETMAD($1,$$,'{');
193 TOKEN_GETMAD($4,$$,'}');
197 remember: /* NULL */ /* start a full lexical scope */
198 { $$ = block_start(TRUE); }
201 mydefsv: /* NULL */ /* lexicalize $_ */
202 { $$ = (I32) Perl_allocmy(aTHX_ STR_WITH_LEN("$_"), 0); }
207 PL_parser->expect = XSTATE; $$ = block_start(TRUE);
212 mblock : '{' mremember stmtseq '}'
213 { if (PL_parser->copline > (line_t)IVAL($1))
214 PL_parser->copline = (line_t)IVAL($1);
215 $$ = block_end($2, $3);
216 TOKEN_GETMAD($1,$$,'{');
217 TOKEN_GETMAD($4,$$,'}');
221 mremember: /* NULL */ /* start a partial lexical scope */
222 { $$ = block_start(FALSE); }
225 /* A collection of "lines" in the program */
229 { $$ = op_append_list(OP_LINESEQ, $1, $2);
230 PL_pad_reset_pending = TRUE;
232 PL_hints |= HINT_BLOCK_SCOPE;
236 /* A statement in the program */
238 { $$ = newSTATEOP(0, PVAL($1), $2);
239 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
240 | loop /* loops add their own labels */
241 | switch /* ... and so do switches */
244 { $$ = newSTATEOP(0, PVAL($1), $2); }
248 $$ = newSTATEOP(0, PVAL($1), newOP(OP_NULL, 0));
249 TOKEN_GETMAD($1,$$,'L');
250 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first,';');
256 PL_parser->copline = NOLINE;
258 TOKEN_GETMAD($2,$$,';');
260 PL_parser->expect = XSTATE;
264 $$ = newSTATEOP(0, PVAL($1), $2);
265 PL_parser->expect = XSTATE;
267 /* sideff might already have a nexstate */
268 OP* op = ((LISTOP*)$$)->op_first;
270 while (op->op_sibling &&
271 op->op_sibling->op_type == OP_NEXTSTATE)
273 token_getmad($1,op,'L');
274 token_getmad($3,op,';');
278 | label package_block
279 { $$ = newSTATEOP(0, PVAL($1),
280 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
281 NOLINE, (OP*)NULL, $2,
284 { $$ = newSTATEOP(0, PVAL($1), $2); }
288 $$ = newSTATEOP(0, PVAL($1), $2);
290 $$ = IF_MAD($2 ? $2 : newOP(OP_NULL, 0), $2);
295 /* An expression which may have a side-effect */
301 { $$ = newLOGOP(OP_AND, 0, $3, $1);
302 TOKEN_GETMAD($2,$$,'i');
305 { $$ = newLOGOP(OP_OR, 0, $3, $1);
306 TOKEN_GETMAD($2,$$,'i');
309 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
310 TOKEN_GETMAD($2,$$,'w');
313 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
314 TOKEN_GETMAD($2,$$,'w');
317 { $$ = newFOROP(0, NULL, (line_t)IVAL($2),
318 (OP*)NULL, $3, $1, (OP*)NULL);
319 TOKEN_GETMAD($2,((LISTOP*)$$)->op_first->op_sibling,'w');
322 { $$ = newWHENOP($3, scope($1)); }
325 /* else and elsif blocks */
329 { ($2)->op_flags |= OPf_PARENS; $$ = scope($2);
330 TOKEN_GETMAD($1,$$,'o');
332 | ELSIF lpar_or_qw mexpr ')' mblock else
333 { PL_parser->copline = (line_t)IVAL($1);
334 $$ = newCONDOP(0, newSTATEOP(OPf_SPECIAL,NULL,$3), scope($5), $6);
335 PL_hints |= HINT_BLOCK_SCOPE;
336 TOKEN_GETMAD($1,$$,'I');
337 TOKEN_GETMAD($2,$$,'(');
338 TOKEN_GETMAD($4,$$,')');
342 /* Real conditional expressions */
343 cond : IF lpar_or_qw remember mexpr ')' mblock else
344 { PL_parser->copline = (line_t)IVAL($1);
346 newCONDOP(0, $4, scope($6), $7));
347 TOKEN_GETMAD($1,$$,'I');
348 TOKEN_GETMAD($2,$$,'(');
349 TOKEN_GETMAD($5,$$,')');
351 | UNLESS lpar_or_qw remember miexpr ')' mblock else
352 { PL_parser->copline = (line_t)IVAL($1);
354 newCONDOP(0, $4, scope($6), $7));
355 TOKEN_GETMAD($1,$$,'I');
356 TOKEN_GETMAD($2,$$,'(');
357 TOKEN_GETMAD($5,$$,')');
361 /* Cases for a switch statement */
362 case : WHEN lpar_or_qw remember mexpr ')' mblock
364 newWHENOP($4, scope($6))); }
366 { $$ = newWHENOP(0, scope($2)); }
369 /* Continue blocks */
374 TOKEN_GETMAD($1,$$,'o');
378 /* Loops: while, until, for, and a bare block */
379 loop : label WHILE lpar_or_qw remember texpr ')' mintro mblock cont
381 PL_parser->copline = (line_t)IVAL($2);
383 newSTATEOP(0, PVAL($1),
384 innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
385 IVAL($2), $5, $8, $9, $7)));
386 TOKEN_GETMAD($1,innerop,'L');
387 TOKEN_GETMAD($2,innerop,'W');
388 TOKEN_GETMAD($3,innerop,'(');
389 TOKEN_GETMAD($6,innerop,')');
392 | label UNTIL lpar_or_qw remember iexpr ')' mintro mblock cont
394 PL_parser->copline = (line_t)IVAL($2);
396 newSTATEOP(0, PVAL($1),
397 innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
398 IVAL($2), $5, $8, $9, $7)));
399 TOKEN_GETMAD($1,innerop,'L');
400 TOKEN_GETMAD($2,innerop,'W');
401 TOKEN_GETMAD($3,innerop,'(');
402 TOKEN_GETMAD($6,innerop,')');
404 | label FOR MY remember my_scalar lpar_or_qw mexpr ')' mblock cont
407 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
409 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
410 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
411 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'d');
412 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,'(');
413 TOKEN_GETMAD($8,((LISTOP*)innerop)->op_first->op_sibling,')');
415 | label FOR scalar lpar_or_qw remember mexpr ')' mblock cont
418 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
419 mod($3, OP_ENTERLOOP), $6, $8, $9));
420 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
421 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
422 TOKEN_GETMAD($4,((LISTOP*)innerop)->op_first->op_sibling,'(');
423 TOKEN_GETMAD($7,((LISTOP*)innerop)->op_first->op_sibling,')');
425 | label FOR lpar_or_qw remember mexpr ')' mblock cont
428 innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2),
429 (OP*)NULL, $5, $7, $8));
430 TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L');
431 TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W');
432 TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'(');
433 TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,')');
435 | label FOR lpar_or_qw remember mnexpr ';' texpr ';' mintro mnexpr ')'
437 /* basically fake up an initialize-while stmtseq */
439 PL_parser->copline = (line_t)IVAL($2);
440 forop = newSTATEOP(0, PVAL($1),
441 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
442 IVAL($2), scalar($7),
445 forop = newUNOP(OP_NULL, 0, op_append_elem(OP_LINESEQ,
447 CopLABEL_alloc(($1)->tk_lval.pval),
448 ($5 ? $5 : newOP(OP_NULL, 0)) ),
451 token_getmad($2,forop,'3');
452 token_getmad($3,forop,'(');
453 token_getmad($6,forop,'1');
454 token_getmad($8,forop,'2');
455 token_getmad($11,forop,')');
456 token_getmad($1,forop,'L');
459 forop = op_append_elem(OP_LINESEQ,
460 newSTATEOP(0, CopLABEL_alloc($1), $5),
466 $$ = block_end($4, forop); }
467 | label block cont /* a block is a loop that happens once */
468 { $$ = newSTATEOP(0, PVAL($1),
469 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
470 NOLINE, (OP*)NULL, $2, $3, 0));
471 TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); }
475 switch : label GIVEN lpar_or_qw remember mydefsv mexpr ')' mblock
476 { PL_parser->copline = (line_t) IVAL($2);
478 newSTATEOP(0, PVAL($1),
479 newGIVENOP($6, scope($8),
480 (PADOFFSET) $5) )); }
483 /* determine whether there are any new my declarations */
485 { $$ = (PL_min_intro_pending &&
486 PL_max_intro_pending >= PL_min_intro_pending);
489 /* Normal expression */
495 /* Boolean expression */
496 texpr : /* NULL means true */
498 (void)scan_num("1", &tmplval);
499 $$ = tmplval.opval; }
503 /* Inverted boolean expression */
505 { $$ = invert(scalar($1)); }
508 /* Expression with its own lexical scope */
510 { $$ = $1; intro_my(); }
514 { $$ = $1; intro_my(); }
518 { $$ = $1; intro_my(); }
521 /* Optional "MAIN:"-style loop labels */
527 $$ = newTOKEN(OP_NULL, tmplval, 0);
535 /* Some kind of declaration - just hang on peg in the parse tree */
547 /* these two are only used by MAD */
554 { $$ = newOP(OP_NULL,0);
555 TOKEN_GETMAD($1,$$,'p');
559 format : FORMAT startformsub formname block
561 CV *fmtcv = PL_compcv;
562 SvREFCNT_inc_simple_void(PL_compcv);
564 $$ = newFORM($2, $3, $4);
565 prepend_madprops($1->tk_mad, $$, 'F');
572 if (CvOUTSIDE(fmtcv) && !CvUNIQUE(CvOUTSIDE(fmtcv))) {
573 SvREFCNT_inc_simple_void(fmtcv);
574 pad_add_anon((SV*)fmtcv, OP_NULL);
579 formname: WORD { $$ = $1; }
580 | /* NULL */ { $$ = (OP*)NULL; }
583 /* Unimplemented "my sub foo { }" */
584 mysubrout: MYSUB startsub subname proto subattrlist subbody
585 { SvREFCNT_inc_simple_void(PL_compcv);
587 $$ = newMYSUB($2, $3, $4, $5, $6);
588 token_getmad($1,$$,'d');
590 newMYSUB($2, $3, $4, $5, $6);
596 /* Subroutine definition */
597 subrout : SUB startsub subname proto subattrlist subbody
598 { SvREFCNT_inc_simple_void(PL_compcv);
601 OP* o = newSVOP(OP_ANONCODE, 0,
602 (SV*)newATTRSUB($2, $3, $4, $5, $6));
603 $$ = newOP(OP_NULL,0);
605 op_getmad($3,$$,'n');
606 op_getmad($4,$$,'s');
607 op_getmad($5,$$,'a');
608 token_getmad($1,$$,'d');
609 append_madprops($6->op_madprop, $$, 0);
613 newATTRSUB($2, $3, $4, $5, $6);
619 startsub: /* NULL */ /* start a regular subroutine scope */
620 { $$ = start_subparse(FALSE, 0);
621 SAVEFREESV(PL_compcv); }
625 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
626 { $$ = start_subparse(FALSE, CVf_ANON);
627 SAVEFREESV(PL_compcv); }
630 startformsub: /* NULL */ /* start a format subroutine scope */
631 { $$ = start_subparse(TRUE, 0);
632 SAVEFREESV(PL_compcv); }
635 /* Name of a subroutine - must be a bareword, could be special */
636 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
637 if (strEQ(name, "BEGIN") || strEQ(name, "END")
638 || strEQ(name, "INIT") || strEQ(name, "CHECK")
639 || strEQ(name, "UNITCHECK"))
640 CvSPECIAL_on(PL_compcv);
644 /* Subroutine prototype */
650 /* Optional list of subroutine attributes */
651 subattrlist: /* NULL */
655 TOKEN_GETMAD($1,$$,':');
662 TOKEN_GETMAD($1,$$,':');
666 /* List of attributes for a "my" variable declaration */
667 myattrlist: COLONATTR THING
669 TOKEN_GETMAD($1,$$,':');
676 TOKEN_GETMAD($1,$$,':');
680 /* Subroutine body - either null or a block */
681 subbody : block { $$ = $1; }
686 PL_parser->expect = XSTATE;
687 TOKEN_GETMAD($1,$$,';');
691 package : PACKAGE WORD WORD ';'
695 token_getmad($1,$$,'o');
698 token_getmad($4,$$,';');
708 package_block: PACKAGE WORD WORD '{' remember
710 int save_3_latefree = $3->op_latefree;
713 $3->op_latefree = save_3_latefree;
715 int save_2_latefree = $2->op_latefree;
718 $2->op_latefree = save_2_latefree;
722 { if (PL_parser->copline > (line_t)IVAL($4))
723 PL_parser->copline = (line_t)IVAL($4);
724 $$ = block_end($5, $7);
725 TOKEN_GETMAD($4,$$,'{');
726 TOKEN_GETMAD($8,$$,'}');
734 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
735 WORD WORD listexpr ';'
736 { SvREFCNT_inc_simple_void(PL_compcv);
738 $$ = utilize(IVAL($1), $2, $4, $5, $6);
739 token_getmad($1,$$,'o');
740 token_getmad($7,$$,';');
741 if (PL_parser->rsfp_filters &&
742 AvFILLp(PL_parser->rsfp_filters) >= 0)
743 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
745 utilize(IVAL($1), $2, $4, $5, $6);
751 /* Ordinary expressions; logical combinations */
752 expr : expr ANDOP expr
753 { $$ = newLOGOP(OP_AND, 0, $1, $3);
754 TOKEN_GETMAD($2,$$,'o');
757 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
758 TOKEN_GETMAD($2,$$,'o');
761 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
762 TOKEN_GETMAD($2,$$,'o');
764 | argexpr %prec PREC_LOW
767 /* Expressions are a list of terms joined by commas */
768 argexpr : argexpr ','
771 OP* op = newNULLLIST();
772 token_getmad($2,op,',');
773 $$ = op_append_elem(OP_LIST, $1, op);
782 term = newUNOP(OP_NULL, 0, term);
783 token_getmad($2,term,',');
785 $$ = op_append_elem(OP_LIST, $1, term);
787 | term %prec PREC_LOW
791 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
792 { $$ = convert(IVAL($1), OPf_STACKED,
793 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
794 TOKEN_GETMAD($1,$$,'o');
796 | FUNC '(' indirob expr ')' /* print ($fh @args */
797 { $$ = convert(IVAL($1), OPf_STACKED,
798 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
799 TOKEN_GETMAD($1,$$,'o');
800 TOKEN_GETMAD($2,$$,'(');
801 TOKEN_GETMAD($5,$$,')');
803 | term ARROW method lpar_or_qw listexprcom ')' /* $foo->bar(list) */
804 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
805 op_append_elem(OP_LIST,
806 op_prepend_elem(OP_LIST, scalar($1), $5),
807 newUNOP(OP_METHOD, 0, $3)));
808 TOKEN_GETMAD($2,$$,'A');
809 TOKEN_GETMAD($4,$$,'(');
810 TOKEN_GETMAD($6,$$,')');
812 | term ARROW method /* $foo->bar */
813 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
814 op_append_elem(OP_LIST, scalar($1),
815 newUNOP(OP_METHOD, 0, $3)));
816 TOKEN_GETMAD($2,$$,'A');
818 | METHOD indirob listexpr /* new Class @args */
819 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
820 op_append_elem(OP_LIST,
821 op_prepend_elem(OP_LIST, $2, $3),
822 newUNOP(OP_METHOD, 0, $1)));
824 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
825 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
826 op_append_elem(OP_LIST,
827 op_prepend_elem(OP_LIST, $2, $4),
828 newUNOP(OP_METHOD, 0, $1)));
829 TOKEN_GETMAD($3,$$,'(');
830 TOKEN_GETMAD($5,$$,')');
832 | LSTOP listexpr /* print @args */
833 { $$ = convert(IVAL($1), 0, $2);
834 TOKEN_GETMAD($1,$$,'o');
836 | FUNC '(' listexprcom ')' /* print (@args) */
837 { $$ = convert(IVAL($1), 0, $3);
838 TOKEN_GETMAD($1,$$,'o');
839 TOKEN_GETMAD($2,$$,'(');
840 TOKEN_GETMAD($4,$$,')');
842 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
843 { SvREFCNT_inc_simple_void(PL_compcv);
844 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
845 listexpr %prec LSTOP /* ... @bar */
846 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
847 op_append_elem(OP_LIST,
848 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
852 /* Names of methods. May use $object->$methodname */
857 /* Some kind of subscripted expression */
858 subscripted: star '{' expr ';' '}' /* *main::{something} */
859 /* In this and all the hash accessors, ';' is
860 * provided by the tokeniser */
861 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
862 PL_parser->expect = XOPERATOR;
863 TOKEN_GETMAD($2,$$,'{');
864 TOKEN_GETMAD($4,$$,';');
865 TOKEN_GETMAD($5,$$,'}');
867 | scalar '[' expr ']' /* $array[$element] */
868 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
869 TOKEN_GETMAD($2,$$,'[');
870 TOKEN_GETMAD($4,$$,']');
872 | term ARROW '[' expr ']' /* somearef->[$element] */
873 { $$ = newBINOP(OP_AELEM, 0,
874 ref(newAVREF($1),OP_RV2AV),
876 TOKEN_GETMAD($2,$$,'a');
877 TOKEN_GETMAD($3,$$,'[');
878 TOKEN_GETMAD($5,$$,']');
880 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
881 { $$ = newBINOP(OP_AELEM, 0,
882 ref(newAVREF($1),OP_RV2AV),
884 TOKEN_GETMAD($2,$$,'[');
885 TOKEN_GETMAD($4,$$,']');
887 | scalar '{' expr ';' '}' /* $foo->{bar();} */
888 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
889 PL_parser->expect = XOPERATOR;
890 TOKEN_GETMAD($2,$$,'{');
891 TOKEN_GETMAD($4,$$,';');
892 TOKEN_GETMAD($5,$$,'}');
894 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
895 { $$ = newBINOP(OP_HELEM, 0,
896 ref(newHVREF($1),OP_RV2HV),
898 PL_parser->expect = XOPERATOR;
899 TOKEN_GETMAD($2,$$,'a');
900 TOKEN_GETMAD($3,$$,'{');
901 TOKEN_GETMAD($5,$$,';');
902 TOKEN_GETMAD($6,$$,'}');
904 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
905 { $$ = newBINOP(OP_HELEM, 0,
906 ref(newHVREF($1),OP_RV2HV),
908 PL_parser->expect = XOPERATOR;
909 TOKEN_GETMAD($2,$$,'{');
910 TOKEN_GETMAD($4,$$,';');
911 TOKEN_GETMAD($5,$$,'}');
913 | term ARROW '(' ')' /* $subref->() */
914 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
915 newCVREF(0, scalar($1)));
916 TOKEN_GETMAD($2,$$,'a');
917 TOKEN_GETMAD($3,$$,'(');
918 TOKEN_GETMAD($4,$$,')');
920 | term ARROW '(' expr ')' /* $subref->(@args) */
921 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
922 op_append_elem(OP_LIST, $4,
923 newCVREF(0, scalar($1))));
924 TOKEN_GETMAD($2,$$,'a');
925 TOKEN_GETMAD($3,$$,'(');
926 TOKEN_GETMAD($5,$$,')');
929 | subscripted lpar_or_qw expr ')' /* $foo->{bar}->(@args) */
930 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
931 op_append_elem(OP_LIST, $3,
932 newCVREF(0, scalar($1))));
933 TOKEN_GETMAD($2,$$,'(');
934 TOKEN_GETMAD($4,$$,')');
936 | subscripted lpar_or_qw ')' /* $foo->{bar}->() */
937 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
938 newCVREF(0, scalar($1)));
939 TOKEN_GETMAD($2,$$,'(');
940 TOKEN_GETMAD($3,$$,')');
942 | '(' expr ')' '[' expr ']' /* list slice */
943 { $$ = newSLICEOP(0, $5, $2);
944 TOKEN_GETMAD($1,$$,'(');
945 TOKEN_GETMAD($3,$$,')');
946 TOKEN_GETMAD($4,$$,'[');
947 TOKEN_GETMAD($6,$$,']');
949 | QWLIST '[' expr ']' /* list literal slice */
950 { $$ = newSLICEOP(0, $3, $1);
951 TOKEN_GETMAD($2,$$,'[');
952 TOKEN_GETMAD($4,$$,']');
954 | '(' ')' '[' expr ']' /* empty list slice! */
955 { $$ = newSLICEOP(0, $4, (OP*)NULL);
956 TOKEN_GETMAD($1,$$,'(');
957 TOKEN_GETMAD($2,$$,')');
958 TOKEN_GETMAD($3,$$,'[');
959 TOKEN_GETMAD($5,$$,']');
963 /* Binary operators between terms */
964 termbinop: term ASSIGNOP term /* $x = $y */
965 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
966 TOKEN_GETMAD($2,$$,'o');
968 | term POWOP term /* $x ** $y */
969 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
970 TOKEN_GETMAD($2,$$,'o');
972 | term MULOP term /* $x * $y, $x x $y */
973 { if (IVAL($2) != OP_REPEAT)
975 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
976 TOKEN_GETMAD($2,$$,'o');
978 | term ADDOP term /* $x + $y */
979 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
980 TOKEN_GETMAD($2,$$,'o');
982 | term SHIFTOP term /* $x >> $y, $x << $y */
983 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
984 TOKEN_GETMAD($2,$$,'o');
986 | term RELOP term /* $x > $y, etc. */
987 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
988 TOKEN_GETMAD($2,$$,'o');
990 | term EQOP term /* $x == $y, $x eq $y */
991 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
992 TOKEN_GETMAD($2,$$,'o');
994 | term BITANDOP term /* $x & $y */
995 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
996 TOKEN_GETMAD($2,$$,'o');
998 | term BITOROP term /* $x | $y */
999 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1000 TOKEN_GETMAD($2,$$,'o');
1002 | term DOTDOT term /* $x..$y, $x...$y */
1004 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
1008 op = (UNOP*)op->op_first; /* get to flop */
1009 op = (UNOP*)op->op_first; /* get to flip */
1010 op = (UNOP*)op->op_first; /* get to range */
1011 token_getmad($2,(OP*)op,'o');
1014 | term ANDAND term /* $x && $y */
1015 { $$ = newLOGOP(OP_AND, 0, $1, $3);
1016 TOKEN_GETMAD($2,$$,'o');
1018 | term OROR term /* $x || $y */
1019 { $$ = newLOGOP(OP_OR, 0, $1, $3);
1020 TOKEN_GETMAD($2,$$,'o');
1022 | term DORDOR term /* $x // $y */
1023 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
1024 TOKEN_GETMAD($2,$$,'o');
1026 | term MATCHOP term /* $x =~ /$y/ */
1027 { $$ = bind_match(IVAL($2), $1, $3);
1029 ($$->op_type == OP_NOT
1030 ? ((UNOP*)$$)->op_first : $$),
1035 /* Unary operators and terms */
1036 termunop : '-' term %prec UMINUS /* -$x */
1037 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
1038 TOKEN_GETMAD($1,$$,'o');
1040 | '+' term %prec UMINUS /* +$x */
1042 newUNOP(OP_NULL, 0, $2),
1045 TOKEN_GETMAD($1,$$,'+');
1047 | '!' term /* !$x */
1048 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1049 TOKEN_GETMAD($1,$$,'o');
1051 | '~' term /* ~$x */
1052 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
1053 TOKEN_GETMAD($1,$$,'o');
1055 | term POSTINC /* $x++ */
1056 { $$ = newUNOP(OP_POSTINC, 0,
1057 mod(scalar($1), OP_POSTINC));
1058 TOKEN_GETMAD($2,$$,'o');
1060 | term POSTDEC /* $x-- */
1061 { $$ = newUNOP(OP_POSTDEC, 0,
1062 mod(scalar($1), OP_POSTDEC));
1063 TOKEN_GETMAD($2,$$,'o');
1065 | PREINC term /* ++$x */
1066 { $$ = newUNOP(OP_PREINC, 0,
1067 mod(scalar($2), OP_PREINC));
1068 TOKEN_GETMAD($1,$$,'o');
1070 | PREDEC term /* --$x */
1071 { $$ = newUNOP(OP_PREDEC, 0,
1072 mod(scalar($2), OP_PREDEC));
1073 TOKEN_GETMAD($1,$$,'o');
1078 /* Constructors for anonymous data */
1079 anonymous: '[' expr ']'
1080 { $$ = newANONLIST($2);
1081 TOKEN_GETMAD($1,$$,'[');
1082 TOKEN_GETMAD($3,$$,']');
1085 { $$ = newANONLIST((OP*)NULL);
1086 TOKEN_GETMAD($1,$$,'[');
1087 TOKEN_GETMAD($2,$$,']');
1089 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1090 { $$ = newANONHASH($2);
1091 TOKEN_GETMAD($1,$$,'{');
1092 TOKEN_GETMAD($3,$$,';');
1093 TOKEN_GETMAD($4,$$,'}');
1095 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1096 { $$ = newANONHASH((OP*)NULL);
1097 TOKEN_GETMAD($1,$$,'{');
1098 TOKEN_GETMAD($2,$$,';');
1099 TOKEN_GETMAD($3,$$,'}');
1101 | ANONSUB startanonsub proto subattrlist block %prec '('
1102 { SvREFCNT_inc_simple_void(PL_compcv);
1103 $$ = newANONATTRSUB($2, $3, $4, $5);
1104 TOKEN_GETMAD($1,$$,'o');
1105 OP_GETMAD($3,$$,'s');
1106 OP_GETMAD($4,$$,'a');
1111 /* Things called with "do" */
1112 termdo : DO term %prec UNIOP /* do $filename */
1113 { $$ = dofile($2, IVAL($1));
1114 TOKEN_GETMAD($1,$$,'o');
1116 | DO block %prec '(' /* do { code */
1117 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2));
1118 TOKEN_GETMAD($1,$$,'D');
1120 | DO WORD lpar_or_qw ')' /* do somesub() */
1121 { $$ = newUNOP(OP_ENTERSUB,
1122 OPf_SPECIAL|OPf_STACKED,
1123 op_prepend_elem(OP_LIST,
1125 (OPpENTERSUB_AMPER<<8),
1127 )),(OP*)NULL)); dep();
1128 TOKEN_GETMAD($1,$$,'o');
1129 TOKEN_GETMAD($3,$$,'(');
1130 TOKEN_GETMAD($4,$$,')');
1132 | DO WORD lpar_or_qw expr ')' /* do somesub(@args) */
1133 { $$ = newUNOP(OP_ENTERSUB,
1134 OPf_SPECIAL|OPf_STACKED,
1135 op_append_elem(OP_LIST,
1138 (OPpENTERSUB_AMPER<<8),
1141 TOKEN_GETMAD($1,$$,'o');
1142 TOKEN_GETMAD($3,$$,'(');
1143 TOKEN_GETMAD($5,$$,')');
1145 | DO scalar lpar_or_qw ')' /* do $subref () */
1146 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1147 op_prepend_elem(OP_LIST,
1148 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1149 TOKEN_GETMAD($1,$$,'o');
1150 TOKEN_GETMAD($3,$$,'(');
1151 TOKEN_GETMAD($4,$$,')');
1153 | DO scalar lpar_or_qw expr ')' /* do $subref (@args) */
1154 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1155 op_prepend_elem(OP_LIST,
1157 scalar(newCVREF(0,scalar($2))))); dep();
1158 TOKEN_GETMAD($1,$$,'o');
1159 TOKEN_GETMAD($3,$$,'(');
1160 TOKEN_GETMAD($5,$$,')');
1169 | term '?' term ':' term
1170 { $$ = newCONDOP(0, $1, $3, $5);
1171 TOKEN_GETMAD($2,$$,'?');
1172 TOKEN_GETMAD($4,$$,':');
1174 | REFGEN term /* \$x, \@y, \%z */
1175 { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN));
1176 TOKEN_GETMAD($1,$$,'o');
1178 | myattrterm %prec UNIOP
1180 | LOCAL term %prec UNIOP
1181 { $$ = localize($2,IVAL($1));
1182 TOKEN_GETMAD($1,$$,'k');
1185 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1186 TOKEN_GETMAD($1,$$,'(');
1187 TOKEN_GETMAD($3,$$,')');
1190 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1192 { $$ = sawparens(newNULLLIST());
1193 TOKEN_GETMAD($1,$$,'(');
1194 TOKEN_GETMAD($2,$$,')');
1204 | arylen %prec '(' /* $#x, $#{ something } */
1205 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1208 | ary '[' expr ']' /* array slice */
1209 { $$ = op_prepend_elem(OP_ASLICE,
1210 newOP(OP_PUSHMARK, 0),
1211 newLISTOP(OP_ASLICE, 0,
1213 ref($1, OP_ASLICE)));
1214 TOKEN_GETMAD($2,$$,'[');
1215 TOKEN_GETMAD($4,$$,']');
1217 | ary '{' expr ';' '}' /* @hash{@keys} */
1218 { $$ = op_prepend_elem(OP_HSLICE,
1219 newOP(OP_PUSHMARK, 0),
1220 newLISTOP(OP_HSLICE, 0,
1222 ref(oopsHV($1), OP_HSLICE)));
1223 PL_parser->expect = XOPERATOR;
1224 TOKEN_GETMAD($2,$$,'{');
1225 TOKEN_GETMAD($4,$$,';');
1226 TOKEN_GETMAD($5,$$,'}');
1231 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1232 | amper lpar_or_qw ')' /* &foo() */
1233 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1234 TOKEN_GETMAD($2,$$,'(');
1235 TOKEN_GETMAD($3,$$,')');
1237 | amper lpar_or_qw expr ')' /* &foo(@args) */
1239 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1240 op_append_elem(OP_LIST, $3, scalar($1)));
1243 if (op->op_type == OP_CONST) { /* defeat const fold */
1244 op = (OP*)op->op_madprop->mad_val;
1246 token_getmad($2,op,'(');
1247 token_getmad($4,op,')');
1250 | NOAMP WORD listexpr /* foo(@args) */
1251 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1252 op_append_elem(OP_LIST, $3, scalar($2)));
1253 TOKEN_GETMAD($1,$$,'o');
1255 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1256 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1257 PL_hints |= HINT_BLOCK_SCOPE;
1258 TOKEN_GETMAD($1,$$,'o');
1261 { $$ = newLOOPEX(IVAL($1),$2);
1262 TOKEN_GETMAD($1,$$,'o');
1264 | NOTOP argexpr /* not $foo */
1265 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1266 TOKEN_GETMAD($1,$$,'o');
1268 | UNIOP /* Unary op, $_ implied */
1269 { $$ = newOP(IVAL($1), 0);
1270 TOKEN_GETMAD($1,$$,'o');
1272 | UNIOP block /* eval { foo }* */
1273 { $$ = newUNOP(IVAL($1), 0, $2);
1274 TOKEN_GETMAD($1,$$,'o');
1276 | UNIOP term /* Unary op */
1277 { $$ = newUNOP(IVAL($1), 0, $2);
1278 TOKEN_GETMAD($1,$$,'o');
1280 | REQUIRE /* require, $_ implied */
1281 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1282 TOKEN_GETMAD($1,$$,'o');
1284 | REQUIRE term /* require Foo */
1285 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1286 TOKEN_GETMAD($1,$$,'o');
1289 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1290 | UNIOPSUB term /* Sub treated as unop */
1291 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1292 op_append_elem(OP_LIST, $2, scalar($1))); }
1293 | FUNC0 /* Nullary operator */
1294 { $$ = newOP(IVAL($1), 0);
1295 TOKEN_GETMAD($1,$$,'o');
1298 { $$ = newOP(IVAL($1), 0);
1299 TOKEN_GETMAD($1,$$,'o');
1300 TOKEN_GETMAD($2,$$,'(');
1301 TOKEN_GETMAD($3,$$,')');
1303 | FUNC0SUB /* Sub treated as nullop */
1304 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1306 | FUNC1 '(' ')' /* not () */
1307 { $$ = (IVAL($1) == OP_NOT)
1308 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1309 : newOP(IVAL($1), OPf_SPECIAL);
1311 TOKEN_GETMAD($1,$$,'o');
1312 TOKEN_GETMAD($2,$$,'(');
1313 TOKEN_GETMAD($3,$$,')');
1315 | FUNC1 '(' expr ')' /* not($foo) */
1316 { $$ = newUNOP(IVAL($1), 0, $3);
1317 TOKEN_GETMAD($1,$$,'o');
1318 TOKEN_GETMAD($2,$$,'(');
1319 TOKEN_GETMAD($4,$$,')');
1321 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
1322 { $$ = pmruntime($1, $3, 1);
1323 TOKEN_GETMAD($2,$$,'(');
1324 TOKEN_GETMAD($4,$$,')');
1330 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1331 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1332 TOKEN_GETMAD($1,$$,'X');
1337 /* "my" declarations, with optional attributes */
1338 myattrterm: MY myterm myattrlist
1339 { $$ = my_attrs($2,$3);
1341 token_getmad($1,$$,'d');
1342 append_madprops($3->op_madprop, $$, 'a');
1347 { $$ = localize($2,IVAL($1));
1348 TOKEN_GETMAD($1,$$,'d');
1352 /* Things that can be "my"'d */
1353 myterm : '(' expr ')'
1354 { $$ = sawparens($2);
1355 TOKEN_GETMAD($1,$$,'(');
1356 TOKEN_GETMAD($3,$$,')');
1359 { $$ = sawparens(newNULLLIST());
1360 TOKEN_GETMAD($1,$$,'(');
1361 TOKEN_GETMAD($2,$$,')');
1371 /* Basic list expressions */
1372 listexpr: /* NULL */ %prec PREC_LOW
1374 | argexpr %prec PREC_LOW
1378 listexprcom: /* NULL */
1387 { munge_qwlist_to_paren_list($1); }
1392 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1395 { PL_parser->in_my = 0; $$ = my($1); }
1399 { $$ = newCVREF(IVAL($1),$2);
1400 TOKEN_GETMAD($1,$$,'&');
1404 scalar : '$' indirob
1405 { $$ = newSVREF($2);
1406 TOKEN_GETMAD($1,$$,'$');
1411 { $$ = newAVREF($2);
1412 TOKEN_GETMAD($1,$$,'@');
1417 { $$ = newHVREF($2);
1418 TOKEN_GETMAD($1,$$,'%');
1422 arylen : DOLSHARP indirob
1423 { $$ = newAVREF($2);
1424 TOKEN_GETMAD($1,$$,'l');
1429 { $$ = newGVREF(0,$2);
1430 TOKEN_GETMAD($1,$$,'*');
1434 /* Indirect objects */
1436 { $$ = scalar($1); }
1437 | scalar %prec PREC_LOW
1438 { $$ = scalar($1); }