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 GRAMBARESTMT 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 remember mremember
93 %type <ival> startsub startanonsub startformsub
94 /* FIXME for MAD - are these two ival? */
95 %type <ival> mydefsv mintro
97 %type <opval> stmtseq fullstmt barestmt block mblock else
98 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
99 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
100 %type <opval> listexpr listexprcom indirob listop method
101 %type <opval> formname subname proto subbody cont my_scalar
102 %type <opval> subattrlist myattrlist myattrterm myterm
103 %type <opval> termbinop termunop anonymous termdo
104 %type <p_tkval> label
106 %nonassoc <i_tkval> PREC_LOW
109 %left <i_tkval> OROP DOROP
110 %left <i_tkval> ANDOP
111 %right <i_tkval> NOTOP
112 %nonassoc LSTOP LSTOPSUB
114 %right <i_tkval> ASSIGNOP
115 %right <i_tkval> '?' ':'
116 %nonassoc DOTDOT YADAYADA
117 %left <i_tkval> OROR DORDOR
118 %left <i_tkval> ANDAND
119 %left <i_tkval> BITOROP
120 %left <i_tkval> BITANDOP
123 %nonassoc UNIOP UNIOPSUB
125 %left <i_tkval> SHIFTOP
128 %left <i_tkval> MATCHOP
129 %right <i_tkval> '!' '~' UMINUS REFGEN
130 %right <i_tkval> POWOP
131 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
132 %left <i_tkval> ARROW
133 %nonassoc <i_tkval> ')'
141 /* Top-level choice of what kind of thing yyparse was called to parse */
144 PL_parser->expect = XSTATE;
148 newPROG(block_end($3,$4));
153 parser->expect = XBLOCK;
157 PL_pad_reset_pending = TRUE;
161 parser->yychar = YYEOF;
165 parser->expect = XSTATE;
169 PL_pad_reset_pending = TRUE;
173 parser->yychar = YYEOF;
177 parser->expect = XSTATE;
181 PL_pad_reset_pending = TRUE;
185 parser->yychar = YYEOF;
189 parser->expect = XSTATE;
198 /* An ordinary block */
199 block : '{' remember stmtseq '}'
200 { if (PL_parser->copline > (line_t)IVAL($1))
201 PL_parser->copline = (line_t)IVAL($1);
202 $$ = block_end($2, $3);
203 TOKEN_GETMAD($1,$$,'{');
204 TOKEN_GETMAD($4,$$,'}');
208 remember: /* NULL */ /* start a full lexical scope */
209 { $$ = block_start(TRUE); }
212 mydefsv: /* NULL */ /* lexicalize $_ */
213 { $$ = (I32) Perl_allocmy(aTHX_ STR_WITH_LEN("$_"), 0); }
216 mblock : '{' mremember stmtseq '}'
217 { if (PL_parser->copline > (line_t)IVAL($1))
218 PL_parser->copline = (line_t)IVAL($1);
219 $$ = block_end($2, $3);
220 TOKEN_GETMAD($1,$$,'{');
221 TOKEN_GETMAD($4,$$,'}');
225 mremember: /* NULL */ /* start a partial lexical scope */
226 { $$ = block_start(FALSE); }
229 /* A sequence of statements in the program */
233 { $$ = op_append_list(OP_LINESEQ, $1, $2);
234 PL_pad_reset_pending = TRUE;
236 PL_hints |= HINT_BLOCK_SCOPE;
240 /* A statement in the program, including optional label */
241 fullstmt: label barestmt
243 if (PVAL($1) || $2) {
244 $$ = newSTATEOP(0, PVAL($1), $2);
246 $2 ? cLISTOPx($$)->op_first : $$, 'L');
248 $$ = IF_MAD(newOP(OP_NULL, 0), $2);
253 /* A bare statement, lacking label and other aspects of state op */
258 $$ = newOP(OP_NULL,0);
259 TOKEN_GETMAD($1,$$,'p');
261 | FORMAT startformsub formname block
263 CV *fmtcv = PL_compcv;
264 SvREFCNT_inc_simple_void(PL_compcv);
266 $$ = newFORM($2, $3, $4);
267 prepend_madprops($1->tk_mad, $$, 'F');
274 if (CvOUTSIDE(fmtcv) && !CvUNIQUE(CvOUTSIDE(fmtcv))) {
275 SvREFCNT_inc_simple_void(fmtcv);
276 pad_add_anon((SV*)fmtcv, OP_NULL);
279 | SUB startsub subname proto subattrlist subbody
281 SvREFCNT_inc_simple_void(PL_compcv);
284 OP* o = newSVOP(OP_ANONCODE, 0,
285 (SV*)newATTRSUB($2, $3, $4, $5, $6));
286 $$ = newOP(OP_NULL,0);
288 op_getmad($3,$$,'n');
289 op_getmad($4,$$,'s');
290 op_getmad($5,$$,'a');
291 token_getmad($1,$$,'d');
292 append_madprops($6->op_madprop, $$, 0);
296 newATTRSUB($2, $3, $4, $5, $6);
300 | MYSUB startsub subname proto subattrlist subbody
302 /* Unimplemented "my sub foo { }" */
303 SvREFCNT_inc_simple_void(PL_compcv);
305 $$ = newMYSUB($2, $3, $4, $5, $6);
306 token_getmad($1,$$,'d');
308 newMYSUB($2, $3, $4, $5, $6);
312 | PACKAGE WORD WORD ';'
316 token_getmad($1,$$,'o');
319 token_getmad($4,$$,';');
328 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
329 WORD WORD listexpr ';'
331 SvREFCNT_inc_simple_void(PL_compcv);
333 $$ = utilize(IVAL($1), $2, $4, $5, $6);
334 token_getmad($1,$$,'o');
335 token_getmad($7,$$,';');
336 if (PL_parser->rsfp_filters &&
337 AvFILLp(PL_parser->rsfp_filters) >= 0)
338 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
340 utilize(IVAL($1), $2, $4, $5, $6);
344 | IF lpar_or_qw remember mexpr ')' mblock else
347 newCONDOP(0, $4, op_scope($6), $7));
348 TOKEN_GETMAD($1,$$,'I');
349 TOKEN_GETMAD($2,$$,'(');
350 TOKEN_GETMAD($5,$$,')');
351 PL_parser->copline = (line_t)IVAL($1);
353 | UNLESS lpar_or_qw remember miexpr ')' mblock else
356 newCONDOP(0, $4, op_scope($6), $7));
357 TOKEN_GETMAD($1,$$,'I');
358 TOKEN_GETMAD($2,$$,'(');
359 TOKEN_GETMAD($5,$$,')');
360 PL_parser->copline = (line_t)IVAL($1);
362 | GIVEN lpar_or_qw remember mydefsv mexpr ')' mblock
365 newGIVENOP($5, op_scope($7), (PADOFFSET)$4));
366 PL_parser->copline = (line_t)IVAL($1);
368 | WHEN lpar_or_qw remember mexpr ')' mblock
369 { $$ = block_end($3, newWHENOP($4, op_scope($6))); }
371 { $$ = newWHENOP(0, op_scope($2)); }
372 | WHILE lpar_or_qw remember texpr ')' mintro mblock cont
375 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
377 TOKEN_GETMAD($1,$$,'W');
378 TOKEN_GETMAD($2,$$,'(');
379 TOKEN_GETMAD($5,$$,')');
380 PL_parser->copline = (line_t)IVAL($1);
382 | UNTIL lpar_or_qw remember iexpr ')' mintro mblock cont
385 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
387 TOKEN_GETMAD($1,$$,'W');
388 TOKEN_GETMAD($2,$$,'(');
389 TOKEN_GETMAD($5,$$,')');
390 PL_parser->copline = (line_t)IVAL($1);
392 | FOR lpar_or_qw remember mnexpr ';' texpr ';' mintro mnexpr ')'
395 OP *initop = IF_MAD($4 ? $4 : newOP(OP_NULL, 0), $4);
396 OP *forop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
397 scalar($6), $11, $9, $8);
399 forop = op_prepend_elem(OP_LINESEQ, initop,
400 op_append_elem(OP_LINESEQ,
401 newOP(OP_UNSTACK, OPf_SPECIAL),
404 DO_MAD({ forop = newUNOP(OP_NULL, 0, forop); })
405 $$ = block_end($3, forop);
406 TOKEN_GETMAD($1,$$,'3');
407 TOKEN_GETMAD($2,$$,'(');
408 TOKEN_GETMAD($5,$$,'1');
409 TOKEN_GETMAD($7,$$,'2');
410 TOKEN_GETMAD($10,$$,')');
411 PL_parser->copline = (line_t)IVAL($1);
413 | FOR MY remember my_scalar lpar_or_qw mexpr ')' mblock cont
415 $$ = block_end($3, newFOROP(0, $4, $6, $8, $9));
416 TOKEN_GETMAD($1,$$,'W');
417 TOKEN_GETMAD($2,$$,'d');
418 TOKEN_GETMAD($5,$$,'(');
419 TOKEN_GETMAD($7,$$,')');
420 PL_parser->copline = (line_t)IVAL($1);
422 | FOR scalar lpar_or_qw remember mexpr ')' mblock cont
424 $$ = block_end($4, newFOROP(0,
425 op_lvalue($2, OP_ENTERLOOP), $5, $7, $8));
426 TOKEN_GETMAD($1,$$,'W');
427 TOKEN_GETMAD($3,$$,'(');
428 TOKEN_GETMAD($6,$$,')');
429 PL_parser->copline = (line_t)IVAL($1);
431 | FOR lpar_or_qw remember mexpr ')' mblock cont
434 newFOROP(0, (OP*)NULL, $4, $6, $7));
435 TOKEN_GETMAD($1,$$,'W');
436 TOKEN_GETMAD($2,$$,'(');
437 TOKEN_GETMAD($5,$$,')');
438 PL_parser->copline = (line_t)IVAL($1);
442 /* a block is a loop that happens once */
443 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
444 (OP*)NULL, $1, $2, 0);
446 | PACKAGE WORD WORD '{' remember
448 int save_3_latefree = $3->op_latefree;
451 $3->op_latefree = save_3_latefree;
453 int save_2_latefree = $2->op_latefree;
456 $2->op_latefree = save_2_latefree;
461 /* a block is a loop that happens once */
462 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
463 (OP*)NULL, block_end($5, $7), (OP*)NULL, 0);
467 TOKEN_GETMAD($4,$$,'{');
468 TOKEN_GETMAD($8,$$,'}');
469 if (PL_parser->copline > (line_t)IVAL($4))
470 PL_parser->copline = (line_t)IVAL($4);
474 PL_parser->expect = XSTATE;
476 TOKEN_GETMAD($2,$$,';');
480 PL_parser->expect = XSTATE;
481 $$ = IF_MAD(newOP(OP_NULL, 0), (OP*)NULL);
482 TOKEN_GETMAD($1,$$,';');
483 PL_parser->copline = NOLINE;
487 /* An expression which may have a side-effect */
493 { $$ = newLOGOP(OP_AND, 0, $3, $1);
494 TOKEN_GETMAD($2,$$,'i');
497 { $$ = newLOGOP(OP_OR, 0, $3, $1);
498 TOKEN_GETMAD($2,$$,'i');
501 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
502 TOKEN_GETMAD($2,$$,'w');
505 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
506 TOKEN_GETMAD($2,$$,'w');
509 { $$ = newFOROP(0, (OP*)NULL, $3, $1, (OP*)NULL);
510 TOKEN_GETMAD($2,$$,'w');
511 PL_parser->copline = (line_t)IVAL($2);
514 { $$ = newWHENOP($3, op_scope($1)); }
517 /* else and elsif blocks */
522 ($2)->op_flags |= OPf_PARENS;
524 TOKEN_GETMAD($1,$$,'o');
526 | ELSIF lpar_or_qw mexpr ')' mblock else
527 { PL_parser->copline = (line_t)IVAL($1);
529 newSTATEOP(OPf_SPECIAL,NULL,$3),
531 PL_hints |= HINT_BLOCK_SCOPE;
532 TOKEN_GETMAD($1,$$,'I');
533 TOKEN_GETMAD($2,$$,'(');
534 TOKEN_GETMAD($4,$$,')');
538 /* Continue blocks */
544 TOKEN_GETMAD($1,$$,'o');
548 /* determine whether there are any new my declarations */
550 { $$ = (PL_min_intro_pending &&
551 PL_max_intro_pending >= PL_min_intro_pending);
554 /* Normal expression */
560 /* Boolean expression */
561 texpr : /* NULL means true */
563 (void)scan_num("1", &tmplval);
564 $$ = tmplval.opval; }
568 /* Inverted boolean expression */
570 { $$ = invert(scalar($1)); }
573 /* Expression with its own lexical scope */
575 { $$ = $1; intro_my(); }
579 { $$ = $1; intro_my(); }
583 { $$ = $1; intro_my(); }
586 /* Optional "MAIN:"-style loop labels */
592 $$ = newTOKEN(OP_NULL, tmplval, 0);
600 formname: WORD { $$ = $1; }
601 | /* NULL */ { $$ = (OP*)NULL; }
604 startsub: /* NULL */ /* start a regular subroutine scope */
605 { $$ = start_subparse(FALSE, 0);
606 SAVEFREESV(PL_compcv); }
610 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
611 { $$ = start_subparse(FALSE, CVf_ANON);
612 SAVEFREESV(PL_compcv); }
615 startformsub: /* NULL */ /* start a format subroutine scope */
616 { $$ = start_subparse(TRUE, 0);
617 SAVEFREESV(PL_compcv); }
620 /* Name of a subroutine - must be a bareword, could be special */
621 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
622 if (strEQ(name, "BEGIN") || strEQ(name, "END")
623 || strEQ(name, "INIT") || strEQ(name, "CHECK")
624 || strEQ(name, "UNITCHECK"))
625 CvSPECIAL_on(PL_compcv);
629 /* Subroutine prototype */
635 /* Optional list of subroutine attributes */
636 subattrlist: /* NULL */
640 TOKEN_GETMAD($1,$$,':');
647 TOKEN_GETMAD($1,$$,':');
651 /* List of attributes for a "my" variable declaration */
652 myattrlist: COLONATTR THING
654 TOKEN_GETMAD($1,$$,':');
661 TOKEN_GETMAD($1,$$,':');
665 /* Subroutine body - either null or a block */
666 subbody : block { $$ = $1; }
671 PL_parser->expect = XSTATE;
672 TOKEN_GETMAD($1,$$,';');
676 /* Ordinary expressions; logical combinations */
677 expr : expr ANDOP expr
678 { $$ = newLOGOP(OP_AND, 0, $1, $3);
679 TOKEN_GETMAD($2,$$,'o');
682 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
683 TOKEN_GETMAD($2,$$,'o');
686 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
687 TOKEN_GETMAD($2,$$,'o');
689 | argexpr %prec PREC_LOW
692 /* Expressions are a list of terms joined by commas */
693 argexpr : argexpr ','
696 OP* op = newNULLLIST();
697 token_getmad($2,op,',');
698 $$ = op_append_elem(OP_LIST, $1, op);
707 term = newUNOP(OP_NULL, 0, term);
708 token_getmad($2,term,',');
710 $$ = op_append_elem(OP_LIST, $1, term);
712 | term %prec PREC_LOW
716 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
717 { $$ = convert(IVAL($1), OPf_STACKED,
718 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
719 TOKEN_GETMAD($1,$$,'o');
721 | FUNC '(' indirob expr ')' /* print ($fh @args */
722 { $$ = convert(IVAL($1), OPf_STACKED,
723 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
724 TOKEN_GETMAD($1,$$,'o');
725 TOKEN_GETMAD($2,$$,'(');
726 TOKEN_GETMAD($5,$$,')');
728 | term ARROW method lpar_or_qw listexprcom ')' /* $foo->bar(list) */
729 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
730 op_append_elem(OP_LIST,
731 op_prepend_elem(OP_LIST, scalar($1), $5),
732 newUNOP(OP_METHOD, 0, $3)));
733 TOKEN_GETMAD($2,$$,'A');
734 TOKEN_GETMAD($4,$$,'(');
735 TOKEN_GETMAD($6,$$,')');
737 | term ARROW method /* $foo->bar */
738 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
739 op_append_elem(OP_LIST, scalar($1),
740 newUNOP(OP_METHOD, 0, $3)));
741 TOKEN_GETMAD($2,$$,'A');
743 | METHOD indirob listexpr /* new Class @args */
744 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
745 op_append_elem(OP_LIST,
746 op_prepend_elem(OP_LIST, $2, $3),
747 newUNOP(OP_METHOD, 0, $1)));
749 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
750 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
751 op_append_elem(OP_LIST,
752 op_prepend_elem(OP_LIST, $2, $4),
753 newUNOP(OP_METHOD, 0, $1)));
754 TOKEN_GETMAD($3,$$,'(');
755 TOKEN_GETMAD($5,$$,')');
757 | LSTOP listexpr /* print @args */
758 { $$ = convert(IVAL($1), 0, $2);
759 TOKEN_GETMAD($1,$$,'o');
761 | FUNC '(' listexprcom ')' /* print (@args) */
762 { $$ = convert(IVAL($1), 0, $3);
763 TOKEN_GETMAD($1,$$,'o');
764 TOKEN_GETMAD($2,$$,'(');
765 TOKEN_GETMAD($4,$$,')');
767 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
768 { SvREFCNT_inc_simple_void(PL_compcv);
769 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
770 listexpr %prec LSTOP /* ... @bar */
771 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
772 op_append_elem(OP_LIST,
773 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
777 /* Names of methods. May use $object->$methodname */
782 /* Some kind of subscripted expression */
783 subscripted: star '{' expr ';' '}' /* *main::{something} */
784 /* In this and all the hash accessors, ';' is
785 * provided by the tokeniser */
786 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
787 PL_parser->expect = XOPERATOR;
788 TOKEN_GETMAD($2,$$,'{');
789 TOKEN_GETMAD($4,$$,';');
790 TOKEN_GETMAD($5,$$,'}');
792 | scalar '[' expr ']' /* $array[$element] */
793 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
794 TOKEN_GETMAD($2,$$,'[');
795 TOKEN_GETMAD($4,$$,']');
797 | term ARROW '[' expr ']' /* somearef->[$element] */
798 { $$ = newBINOP(OP_AELEM, 0,
799 ref(newAVREF($1),OP_RV2AV),
801 TOKEN_GETMAD($2,$$,'a');
802 TOKEN_GETMAD($3,$$,'[');
803 TOKEN_GETMAD($5,$$,']');
805 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
806 { $$ = newBINOP(OP_AELEM, 0,
807 ref(newAVREF($1),OP_RV2AV),
809 TOKEN_GETMAD($2,$$,'[');
810 TOKEN_GETMAD($4,$$,']');
812 | scalar '{' expr ';' '}' /* $foo->{bar();} */
813 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
814 PL_parser->expect = XOPERATOR;
815 TOKEN_GETMAD($2,$$,'{');
816 TOKEN_GETMAD($4,$$,';');
817 TOKEN_GETMAD($5,$$,'}');
819 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
820 { $$ = newBINOP(OP_HELEM, 0,
821 ref(newHVREF($1),OP_RV2HV),
823 PL_parser->expect = XOPERATOR;
824 TOKEN_GETMAD($2,$$,'a');
825 TOKEN_GETMAD($3,$$,'{');
826 TOKEN_GETMAD($5,$$,';');
827 TOKEN_GETMAD($6,$$,'}');
829 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
830 { $$ = newBINOP(OP_HELEM, 0,
831 ref(newHVREF($1),OP_RV2HV),
833 PL_parser->expect = XOPERATOR;
834 TOKEN_GETMAD($2,$$,'{');
835 TOKEN_GETMAD($4,$$,';');
836 TOKEN_GETMAD($5,$$,'}');
838 | term ARROW '(' ')' /* $subref->() */
839 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
840 newCVREF(0, scalar($1)));
841 TOKEN_GETMAD($2,$$,'a');
842 TOKEN_GETMAD($3,$$,'(');
843 TOKEN_GETMAD($4,$$,')');
845 | term ARROW '(' expr ')' /* $subref->(@args) */
846 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
847 op_append_elem(OP_LIST, $4,
848 newCVREF(0, scalar($1))));
849 TOKEN_GETMAD($2,$$,'a');
850 TOKEN_GETMAD($3,$$,'(');
851 TOKEN_GETMAD($5,$$,')');
854 | subscripted lpar_or_qw expr ')' /* $foo->{bar}->(@args) */
855 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
856 op_append_elem(OP_LIST, $3,
857 newCVREF(0, scalar($1))));
858 TOKEN_GETMAD($2,$$,'(');
859 TOKEN_GETMAD($4,$$,')');
861 | subscripted lpar_or_qw ')' /* $foo->{bar}->() */
862 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
863 newCVREF(0, scalar($1)));
864 TOKEN_GETMAD($2,$$,'(');
865 TOKEN_GETMAD($3,$$,')');
867 | '(' expr ')' '[' expr ']' /* list slice */
868 { $$ = newSLICEOP(0, $5, $2);
869 TOKEN_GETMAD($1,$$,'(');
870 TOKEN_GETMAD($3,$$,')');
871 TOKEN_GETMAD($4,$$,'[');
872 TOKEN_GETMAD($6,$$,']');
874 | QWLIST '[' expr ']' /* list literal slice */
875 { $$ = newSLICEOP(0, $3, $1);
876 TOKEN_GETMAD($2,$$,'[');
877 TOKEN_GETMAD($4,$$,']');
879 | '(' ')' '[' expr ']' /* empty list slice! */
880 { $$ = newSLICEOP(0, $4, (OP*)NULL);
881 TOKEN_GETMAD($1,$$,'(');
882 TOKEN_GETMAD($2,$$,')');
883 TOKEN_GETMAD($3,$$,'[');
884 TOKEN_GETMAD($5,$$,']');
888 /* Binary operators between terms */
889 termbinop: term ASSIGNOP term /* $x = $y */
890 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
891 TOKEN_GETMAD($2,$$,'o');
893 | term POWOP term /* $x ** $y */
894 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
895 TOKEN_GETMAD($2,$$,'o');
897 | term MULOP term /* $x * $y, $x x $y */
898 { if (IVAL($2) != OP_REPEAT)
900 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
901 TOKEN_GETMAD($2,$$,'o');
903 | term ADDOP term /* $x + $y */
904 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
905 TOKEN_GETMAD($2,$$,'o');
907 | term SHIFTOP term /* $x >> $y, $x << $y */
908 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
909 TOKEN_GETMAD($2,$$,'o');
911 | term RELOP term /* $x > $y, etc. */
912 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
913 TOKEN_GETMAD($2,$$,'o');
915 | term EQOP term /* $x == $y, $x eq $y */
916 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
917 TOKEN_GETMAD($2,$$,'o');
919 | term BITANDOP term /* $x & $y */
920 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
921 TOKEN_GETMAD($2,$$,'o');
923 | term BITOROP term /* $x | $y */
924 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
925 TOKEN_GETMAD($2,$$,'o');
927 | term DOTDOT term /* $x..$y, $x...$y */
929 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
933 op = (UNOP*)op->op_first; /* get to flop */
934 op = (UNOP*)op->op_first; /* get to flip */
935 op = (UNOP*)op->op_first; /* get to range */
936 token_getmad($2,(OP*)op,'o');
939 | term ANDAND term /* $x && $y */
940 { $$ = newLOGOP(OP_AND, 0, $1, $3);
941 TOKEN_GETMAD($2,$$,'o');
943 | term OROR term /* $x || $y */
944 { $$ = newLOGOP(OP_OR, 0, $1, $3);
945 TOKEN_GETMAD($2,$$,'o');
947 | term DORDOR term /* $x // $y */
948 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
949 TOKEN_GETMAD($2,$$,'o');
951 | term MATCHOP term /* $x =~ /$y/ */
952 { $$ = bind_match(IVAL($2), $1, $3);
954 ($$->op_type == OP_NOT
955 ? ((UNOP*)$$)->op_first : $$),
960 /* Unary operators and terms */
961 termunop : '-' term %prec UMINUS /* -$x */
962 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
963 TOKEN_GETMAD($1,$$,'o');
965 | '+' term %prec UMINUS /* +$x */
967 newUNOP(OP_NULL, 0, $2),
970 TOKEN_GETMAD($1,$$,'+');
973 { $$ = newUNOP(OP_NOT, 0, scalar($2));
974 TOKEN_GETMAD($1,$$,'o');
977 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
978 TOKEN_GETMAD($1,$$,'o');
980 | term POSTINC /* $x++ */
981 { $$ = newUNOP(OP_POSTINC, 0,
982 op_lvalue(scalar($1), OP_POSTINC));
983 TOKEN_GETMAD($2,$$,'o');
985 | term POSTDEC /* $x-- */
986 { $$ = newUNOP(OP_POSTDEC, 0,
987 op_lvalue(scalar($1), OP_POSTDEC));
988 TOKEN_GETMAD($2,$$,'o');
990 | PREINC term /* ++$x */
991 { $$ = newUNOP(OP_PREINC, 0,
992 op_lvalue(scalar($2), OP_PREINC));
993 TOKEN_GETMAD($1,$$,'o');
995 | PREDEC term /* --$x */
996 { $$ = newUNOP(OP_PREDEC, 0,
997 op_lvalue(scalar($2), OP_PREDEC));
998 TOKEN_GETMAD($1,$$,'o');
1003 /* Constructors for anonymous data */
1004 anonymous: '[' expr ']'
1005 { $$ = newANONLIST($2);
1006 TOKEN_GETMAD($1,$$,'[');
1007 TOKEN_GETMAD($3,$$,']');
1010 { $$ = newANONLIST((OP*)NULL);
1011 TOKEN_GETMAD($1,$$,'[');
1012 TOKEN_GETMAD($2,$$,']');
1014 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1015 { $$ = newANONHASH($2);
1016 TOKEN_GETMAD($1,$$,'{');
1017 TOKEN_GETMAD($3,$$,';');
1018 TOKEN_GETMAD($4,$$,'}');
1020 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1021 { $$ = newANONHASH((OP*)NULL);
1022 TOKEN_GETMAD($1,$$,'{');
1023 TOKEN_GETMAD($2,$$,';');
1024 TOKEN_GETMAD($3,$$,'}');
1026 | ANONSUB startanonsub proto subattrlist block %prec '('
1027 { SvREFCNT_inc_simple_void(PL_compcv);
1028 $$ = newANONATTRSUB($2, $3, $4, $5);
1029 TOKEN_GETMAD($1,$$,'o');
1030 OP_GETMAD($3,$$,'s');
1031 OP_GETMAD($4,$$,'a');
1036 /* Things called with "do" */
1037 termdo : DO term %prec UNIOP /* do $filename */
1038 { $$ = dofile($2, IVAL($1));
1039 TOKEN_GETMAD($1,$$,'o');
1041 | DO block %prec '(' /* do { code */
1042 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1043 TOKEN_GETMAD($1,$$,'D');
1045 | DO WORD lpar_or_qw ')' /* do somesub() */
1046 { $$ = newUNOP(OP_ENTERSUB,
1047 OPf_SPECIAL|OPf_STACKED,
1048 op_prepend_elem(OP_LIST,
1050 (OPpENTERSUB_AMPER<<8),
1052 )),(OP*)NULL)); dep();
1053 TOKEN_GETMAD($1,$$,'o');
1054 TOKEN_GETMAD($3,$$,'(');
1055 TOKEN_GETMAD($4,$$,')');
1057 | DO WORD lpar_or_qw expr ')' /* do somesub(@args) */
1058 { $$ = newUNOP(OP_ENTERSUB,
1059 OPf_SPECIAL|OPf_STACKED,
1060 op_append_elem(OP_LIST,
1063 (OPpENTERSUB_AMPER<<8),
1066 TOKEN_GETMAD($1,$$,'o');
1067 TOKEN_GETMAD($3,$$,'(');
1068 TOKEN_GETMAD($5,$$,')');
1070 | DO scalar lpar_or_qw ')' /* do $subref () */
1071 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1072 op_prepend_elem(OP_LIST,
1073 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1074 TOKEN_GETMAD($1,$$,'o');
1075 TOKEN_GETMAD($3,$$,'(');
1076 TOKEN_GETMAD($4,$$,')');
1078 | DO scalar lpar_or_qw expr ')' /* do $subref (@args) */
1079 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1080 op_prepend_elem(OP_LIST,
1082 scalar(newCVREF(0,scalar($2))))); dep();
1083 TOKEN_GETMAD($1,$$,'o');
1084 TOKEN_GETMAD($3,$$,'(');
1085 TOKEN_GETMAD($5,$$,')');
1094 | term '?' term ':' term
1095 { $$ = newCONDOP(0, $1, $3, $5);
1096 TOKEN_GETMAD($2,$$,'?');
1097 TOKEN_GETMAD($4,$$,':');
1099 | REFGEN term /* \$x, \@y, \%z */
1100 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1101 TOKEN_GETMAD($1,$$,'o');
1103 | myattrterm %prec UNIOP
1105 | LOCAL term %prec UNIOP
1106 { $$ = localize($2,IVAL($1));
1107 TOKEN_GETMAD($1,$$,'k');
1110 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1111 TOKEN_GETMAD($1,$$,'(');
1112 TOKEN_GETMAD($3,$$,')');
1115 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1117 { $$ = sawparens(newNULLLIST());
1118 TOKEN_GETMAD($1,$$,'(');
1119 TOKEN_GETMAD($2,$$,')');
1129 | arylen %prec '(' /* $#x, $#{ something } */
1130 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1133 | ary '[' expr ']' /* array slice */
1134 { $$ = op_prepend_elem(OP_ASLICE,
1135 newOP(OP_PUSHMARK, 0),
1136 newLISTOP(OP_ASLICE, 0,
1138 ref($1, OP_ASLICE)));
1139 TOKEN_GETMAD($2,$$,'[');
1140 TOKEN_GETMAD($4,$$,']');
1142 | ary '{' expr ';' '}' /* @hash{@keys} */
1143 { $$ = op_prepend_elem(OP_HSLICE,
1144 newOP(OP_PUSHMARK, 0),
1145 newLISTOP(OP_HSLICE, 0,
1147 ref(oopsHV($1), OP_HSLICE)));
1148 PL_parser->expect = XOPERATOR;
1149 TOKEN_GETMAD($2,$$,'{');
1150 TOKEN_GETMAD($4,$$,';');
1151 TOKEN_GETMAD($5,$$,'}');
1156 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1157 | amper lpar_or_qw ')' /* &foo() */
1158 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1159 TOKEN_GETMAD($2,$$,'(');
1160 TOKEN_GETMAD($3,$$,')');
1162 | amper lpar_or_qw expr ')' /* &foo(@args) */
1164 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1165 op_append_elem(OP_LIST, $3, scalar($1)));
1168 if (op->op_type == OP_CONST) { /* defeat const fold */
1169 op = (OP*)op->op_madprop->mad_val;
1171 token_getmad($2,op,'(');
1172 token_getmad($4,op,')');
1175 | NOAMP WORD listexpr /* foo(@args) */
1176 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1177 op_append_elem(OP_LIST, $3, scalar($2)));
1178 TOKEN_GETMAD($1,$$,'o');
1180 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1181 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1182 PL_hints |= HINT_BLOCK_SCOPE;
1183 TOKEN_GETMAD($1,$$,'o');
1186 { $$ = newLOOPEX(IVAL($1),$2);
1187 TOKEN_GETMAD($1,$$,'o');
1189 | NOTOP argexpr /* not $foo */
1190 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1191 TOKEN_GETMAD($1,$$,'o');
1193 | UNIOP /* Unary op, $_ implied */
1194 { $$ = newOP(IVAL($1), 0);
1195 TOKEN_GETMAD($1,$$,'o');
1197 | UNIOP block /* eval { foo }* */
1198 { $$ = newUNOP(IVAL($1), 0, $2);
1199 TOKEN_GETMAD($1,$$,'o');
1201 | UNIOP term /* Unary op */
1202 { $$ = newUNOP(IVAL($1), 0, $2);
1203 TOKEN_GETMAD($1,$$,'o');
1205 | REQUIRE /* require, $_ implied */
1206 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1207 TOKEN_GETMAD($1,$$,'o');
1209 | REQUIRE term /* require Foo */
1210 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1211 TOKEN_GETMAD($1,$$,'o');
1214 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1215 | UNIOPSUB term /* Sub treated as unop */
1216 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1217 op_append_elem(OP_LIST, $2, scalar($1))); }
1218 | FUNC0 /* Nullary operator */
1219 { $$ = newOP(IVAL($1), 0);
1220 TOKEN_GETMAD($1,$$,'o');
1223 { $$ = newOP(IVAL($1), 0);
1224 TOKEN_GETMAD($1,$$,'o');
1225 TOKEN_GETMAD($2,$$,'(');
1226 TOKEN_GETMAD($3,$$,')');
1228 | FUNC0SUB /* Sub treated as nullop */
1229 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1231 | FUNC1 '(' ')' /* not () */
1232 { $$ = (IVAL($1) == OP_NOT)
1233 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1234 : newOP(IVAL($1), OPf_SPECIAL);
1236 TOKEN_GETMAD($1,$$,'o');
1237 TOKEN_GETMAD($2,$$,'(');
1238 TOKEN_GETMAD($3,$$,')');
1240 | FUNC1 '(' expr ')' /* not($foo) */
1241 { $$ = newUNOP(IVAL($1), 0, $3);
1242 TOKEN_GETMAD($1,$$,'o');
1243 TOKEN_GETMAD($2,$$,'(');
1244 TOKEN_GETMAD($4,$$,')');
1246 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
1247 { $$ = pmruntime($1, $3, 1);
1248 TOKEN_GETMAD($2,$$,'(');
1249 TOKEN_GETMAD($4,$$,')');
1255 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1256 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1257 TOKEN_GETMAD($1,$$,'X');
1262 /* "my" declarations, with optional attributes */
1263 myattrterm: MY myterm myattrlist
1264 { $$ = my_attrs($2,$3);
1266 token_getmad($1,$$,'d');
1267 append_madprops($3->op_madprop, $$, 'a');
1272 { $$ = localize($2,IVAL($1));
1273 TOKEN_GETMAD($1,$$,'d');
1277 /* Things that can be "my"'d */
1278 myterm : '(' expr ')'
1279 { $$ = sawparens($2);
1280 TOKEN_GETMAD($1,$$,'(');
1281 TOKEN_GETMAD($3,$$,')');
1284 { $$ = sawparens(newNULLLIST());
1285 TOKEN_GETMAD($1,$$,'(');
1286 TOKEN_GETMAD($2,$$,')');
1296 /* Basic list expressions */
1297 listexpr: /* NULL */ %prec PREC_LOW
1299 | argexpr %prec PREC_LOW
1303 listexprcom: /* NULL */
1312 { munge_qwlist_to_paren_list($1); }
1317 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1320 { PL_parser->in_my = 0; $$ = my($1); }
1324 { $$ = newCVREF(IVAL($1),$2);
1325 TOKEN_GETMAD($1,$$,'&');
1329 scalar : '$' indirob
1330 { $$ = newSVREF($2);
1331 TOKEN_GETMAD($1,$$,'$');
1336 { $$ = newAVREF($2);
1337 TOKEN_GETMAD($1,$$,'@');
1342 { $$ = newHVREF($2);
1343 TOKEN_GETMAD($1,$$,'%');
1347 arylen : DOLSHARP indirob
1348 { $$ = newAVREF($2);
1349 TOKEN_GETMAD($1,$$,'l');
1354 { $$ = newGVREF(0,$2);
1355 TOKEN_GETMAD($1,$$,'*');
1359 /* Indirect objects */
1361 { $$ = scalar($1); }
1362 | scalar %prec PREC_LOW
1363 { $$ = scalar($1); }
1365 { $$ = op_scope($1); }