3 * Copyright (c) 1991-2002, 2003, 2004, 2005, 2006 Larry Wall
4 * Copyright (c) 2007, 2008, 2009, 2010, 2011 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 GRAMEXPR GRAMBLOCK GRAMBARESTMT GRAMFULLSTMT GRAMSTMTSEQ
74 %token <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
76 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF QWLIST
77 %token <opval> FUNC0OP 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 labfullstmt barestmt block mblock else
98 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
99 %type <opval> listexpr nexpr texpr iexpr mexpr mnexpr miexpr
100 %type <opval> optlistexpr optexpr 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
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 /* Top-level choice of what kind of thing yyparse was called to parse */
143 PL_parser->expect = XSTATE;
147 newPROG(block_end($3,$4));
152 parser->expect = XTERM;
161 parser->expect = XBLOCK;
165 PL_pad_reset_pending = TRUE;
169 parser->yychar = YYEOF;
173 parser->expect = XSTATE;
177 PL_pad_reset_pending = TRUE;
181 parser->yychar = YYEOF;
185 parser->expect = XSTATE;
189 PL_pad_reset_pending = TRUE;
193 parser->yychar = YYEOF;
197 parser->expect = XSTATE;
206 /* An ordinary block */
207 block : '{' remember stmtseq '}'
208 { if (PL_parser->copline > (line_t)IVAL($1))
209 PL_parser->copline = (line_t)IVAL($1);
210 $$ = block_end($2, $3);
211 TOKEN_GETMAD($1,$$,'{');
212 TOKEN_GETMAD($4,$$,'}');
216 remember: /* NULL */ /* start a full lexical scope */
217 { $$ = block_start(TRUE); }
220 mydefsv: /* NULL */ /* lexicalize $_ */
221 { $$ = (I32) Perl_allocmy(aTHX_ STR_WITH_LEN("$_"), 0); }
224 mblock : '{' mremember stmtseq '}'
225 { if (PL_parser->copline > (line_t)IVAL($1))
226 PL_parser->copline = (line_t)IVAL($1);
227 $$ = block_end($2, $3);
228 TOKEN_GETMAD($1,$$,'{');
229 TOKEN_GETMAD($4,$$,'}');
233 mremember: /* NULL */ /* start a partial lexical scope */
234 { $$ = block_start(FALSE); }
237 /* A sequence of statements in the program */
241 { $$ = op_append_list(OP_LINESEQ, $1, $2);
242 PL_pad_reset_pending = TRUE;
244 PL_hints |= HINT_BLOCK_SCOPE;
248 /* A statement in the program, including optional labels */
252 $$ = newSTATEOP(0, NULL, $1);
254 $$ = IF_MAD(newOP(OP_NULL, 0), NULL);
261 labfullstmt: LABEL barestmt
263 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
264 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
266 $2 ? cLISTOPx($$)->op_first : $$, 'L');
270 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
271 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
272 TOKEN_GETMAD($1, cLISTOPx($$)->op_first, 'L');
276 /* A bare statement, lacking label and other aspects of state op */
281 $$ = newOP(OP_NULL,0);
282 TOKEN_GETMAD($1,$$,'p');
284 | FORMAT startformsub formname block
286 CV *fmtcv = PL_compcv;
287 SvREFCNT_inc_simple_void(PL_compcv);
289 $$ = newFORM($2, $3, $4);
290 prepend_madprops($1->tk_mad, $$, 'F');
297 if (CvOUTSIDE(fmtcv) && !CvUNIQUE(CvOUTSIDE(fmtcv))) {
298 SvREFCNT_inc_simple_void(fmtcv);
299 pad_add_anon(fmtcv, OP_NULL);
302 | SUB startsub subname proto subattrlist subbody
304 SvREFCNT_inc_simple_void(PL_compcv);
307 OP* o = newSVOP(OP_ANONCODE, 0,
308 (SV*)newATTRSUB($2, $3, $4, $5, $6));
309 $$ = newOP(OP_NULL,0);
311 op_getmad($3,$$,'n');
312 op_getmad($4,$$,'s');
313 op_getmad($5,$$,'a');
314 token_getmad($1,$$,'d');
315 append_madprops($6->op_madprop, $$, 0);
319 newATTRSUB($2, $3, $4, $5, $6);
323 | MYSUB startsub subname proto subattrlist subbody
325 /* Unimplemented "my sub foo { }" */
326 SvREFCNT_inc_simple_void(PL_compcv);
328 $$ = newMYSUB($2, $3, $4, $5, $6);
329 token_getmad($1,$$,'d');
331 newMYSUB($2, $3, $4, $5, $6);
335 | PACKAGE WORD WORD ';'
339 token_getmad($1,$$,'o');
342 token_getmad($4,$$,';');
351 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
352 WORD WORD optlistexpr ';'
354 SvREFCNT_inc_simple_void(PL_compcv);
356 $$ = utilize(IVAL($1), $2, $4, $5, $6);
357 token_getmad($1,$$,'o');
358 token_getmad($7,$$,';');
359 if (PL_parser->rsfp_filters &&
360 AvFILLp(PL_parser->rsfp_filters) >= 0)
361 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
363 utilize(IVAL($1), $2, $4, $5, $6);
367 | IF lpar_or_qw remember mexpr ')' mblock else
370 newCONDOP(0, $4, op_scope($6), $7));
371 TOKEN_GETMAD($1,$$,'I');
372 TOKEN_GETMAD($2,$$,'(');
373 TOKEN_GETMAD($5,$$,')');
374 PL_parser->copline = (line_t)IVAL($1);
376 | UNLESS lpar_or_qw remember miexpr ')' mblock else
379 newCONDOP(0, $4, op_scope($6), $7));
380 TOKEN_GETMAD($1,$$,'I');
381 TOKEN_GETMAD($2,$$,'(');
382 TOKEN_GETMAD($5,$$,')');
383 PL_parser->copline = (line_t)IVAL($1);
385 | GIVEN lpar_or_qw remember mydefsv mexpr ')' mblock
388 newGIVENOP($5, op_scope($7), (PADOFFSET)$4));
389 PL_parser->copline = (line_t)IVAL($1);
391 | WHEN lpar_or_qw remember mexpr ')' mblock
392 { $$ = block_end($3, newWHENOP($4, op_scope($6))); }
394 { $$ = newWHENOP(0, op_scope($2)); }
395 | WHILE lpar_or_qw remember texpr ')' mintro mblock cont
398 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
400 TOKEN_GETMAD($1,$$,'W');
401 TOKEN_GETMAD($2,$$,'(');
402 TOKEN_GETMAD($5,$$,')');
403 PL_parser->copline = (line_t)IVAL($1);
405 | UNTIL lpar_or_qw remember iexpr ')' mintro mblock cont
408 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
410 TOKEN_GETMAD($1,$$,'W');
411 TOKEN_GETMAD($2,$$,'(');
412 TOKEN_GETMAD($5,$$,')');
413 PL_parser->copline = (line_t)IVAL($1);
415 | FOR lpar_or_qw remember mnexpr ';' texpr ';' mintro mnexpr ')'
418 OP *initop = IF_MAD($4 ? $4 : newOP(OP_NULL, 0), $4);
419 OP *forop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
420 scalar($6), $11, $9, $8);
422 forop = op_prepend_elem(OP_LINESEQ, initop,
423 op_append_elem(OP_LINESEQ,
424 newOP(OP_UNSTACK, OPf_SPECIAL),
427 DO_MAD({ forop = newUNOP(OP_NULL, 0, forop); })
428 $$ = block_end($3, forop);
429 TOKEN_GETMAD($1,$$,'3');
430 TOKEN_GETMAD($2,$$,'(');
431 TOKEN_GETMAD($5,$$,'1');
432 TOKEN_GETMAD($7,$$,'2');
433 TOKEN_GETMAD($10,$$,')');
434 PL_parser->copline = (line_t)IVAL($1);
436 | FOR MY remember my_scalar lpar_or_qw mexpr ')' mblock cont
438 $$ = block_end($3, newFOROP(0, $4, $6, $8, $9));
439 TOKEN_GETMAD($1,$$,'W');
440 TOKEN_GETMAD($2,$$,'d');
441 TOKEN_GETMAD($5,$$,'(');
442 TOKEN_GETMAD($7,$$,')');
443 PL_parser->copline = (line_t)IVAL($1);
445 | FOR scalar lpar_or_qw remember mexpr ')' mblock cont
447 $$ = block_end($4, newFOROP(0,
448 op_lvalue($2, OP_ENTERLOOP), $5, $7, $8));
449 TOKEN_GETMAD($1,$$,'W');
450 TOKEN_GETMAD($3,$$,'(');
451 TOKEN_GETMAD($6,$$,')');
452 PL_parser->copline = (line_t)IVAL($1);
454 | FOR lpar_or_qw remember mexpr ')' mblock cont
457 newFOROP(0, (OP*)NULL, $4, $6, $7));
458 TOKEN_GETMAD($1,$$,'W');
459 TOKEN_GETMAD($2,$$,'(');
460 TOKEN_GETMAD($5,$$,')');
461 PL_parser->copline = (line_t)IVAL($1);
465 /* a block is a loop that happens once */
466 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
467 (OP*)NULL, $1, $2, 0);
469 | PACKAGE WORD WORD '{' remember
471 int save_3_latefree = $3->op_latefree;
474 $3->op_latefree = save_3_latefree;
476 int save_2_latefree = $2->op_latefree;
479 $2->op_latefree = save_2_latefree;
484 /* a block is a loop that happens once */
485 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
486 (OP*)NULL, block_end($5, $7), (OP*)NULL, 0);
490 TOKEN_GETMAD($4,$$,'{');
491 TOKEN_GETMAD($8,$$,'}');
492 if (PL_parser->copline > (line_t)IVAL($4))
493 PL_parser->copline = (line_t)IVAL($4);
497 PL_parser->expect = XSTATE;
499 TOKEN_GETMAD($2,$$,';');
503 PL_parser->expect = XSTATE;
504 $$ = IF_MAD(newOP(OP_NULL, 0), (OP*)NULL);
505 TOKEN_GETMAD($1,$$,';');
506 PL_parser->copline = NOLINE;
510 /* An expression which may have a side-effect */
516 { $$ = newLOGOP(OP_AND, 0, $3, $1);
517 TOKEN_GETMAD($2,$$,'i');
520 { $$ = newLOGOP(OP_OR, 0, $3, $1);
521 TOKEN_GETMAD($2,$$,'i');
524 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
525 TOKEN_GETMAD($2,$$,'w');
528 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
529 TOKEN_GETMAD($2,$$,'w');
532 { $$ = newFOROP(0, (OP*)NULL, $3, $1, (OP*)NULL);
533 TOKEN_GETMAD($2,$$,'w');
534 PL_parser->copline = (line_t)IVAL($2);
537 { $$ = newWHENOP($3, op_scope($1)); }
540 /* else and elsif blocks */
545 ($2)->op_flags |= OPf_PARENS;
547 TOKEN_GETMAD($1,$$,'o');
549 | ELSIF lpar_or_qw mexpr ')' mblock else
550 { PL_parser->copline = (line_t)IVAL($1);
552 newSTATEOP(OPf_SPECIAL,NULL,$3),
554 PL_hints |= HINT_BLOCK_SCOPE;
555 TOKEN_GETMAD($1,$$,'I');
556 TOKEN_GETMAD($2,$$,'(');
557 TOKEN_GETMAD($4,$$,')');
561 /* Continue blocks */
567 TOKEN_GETMAD($1,$$,'o');
571 /* determine whether there are any new my declarations */
573 { $$ = (PL_min_intro_pending &&
574 PL_max_intro_pending >= PL_min_intro_pending);
577 /* Normal expression */
583 /* Boolean expression */
584 texpr : /* NULL means true */
586 (void)scan_num("1", &tmplval);
587 $$ = tmplval.opval; }
591 /* Inverted boolean expression */
593 { $$ = invert(scalar($1)); }
596 /* Expression with its own lexical scope */
598 { $$ = $1; intro_my(); }
602 { $$ = $1; intro_my(); }
606 { $$ = $1; intro_my(); }
609 formname: WORD { $$ = $1; }
610 | /* NULL */ { $$ = (OP*)NULL; }
613 startsub: /* NULL */ /* start a regular subroutine scope */
614 { $$ = start_subparse(FALSE, 0);
615 SAVEFREESV(PL_compcv); }
619 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
620 { $$ = start_subparse(FALSE, CVf_ANON);
621 SAVEFREESV(PL_compcv); }
624 startformsub: /* NULL */ /* start a format subroutine scope */
625 { $$ = start_subparse(TRUE, 0);
626 SAVEFREESV(PL_compcv); }
629 /* Name of a subroutine - must be a bareword, could be special */
630 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
631 if (strEQ(name, "BEGIN") || strEQ(name, "END")
632 || strEQ(name, "INIT") || strEQ(name, "CHECK")
633 || strEQ(name, "UNITCHECK"))
634 CvSPECIAL_on(PL_compcv);
638 /* Subroutine prototype */
644 /* Optional list of subroutine attributes */
645 subattrlist: /* NULL */
649 TOKEN_GETMAD($1,$$,':');
656 TOKEN_GETMAD($1,$$,':');
660 /* List of attributes for a "my" variable declaration */
661 myattrlist: COLONATTR THING
663 TOKEN_GETMAD($1,$$,':');
670 TOKEN_GETMAD($1,$$,':');
674 /* Subroutine body - either null or a block */
675 subbody : block { $$ = $1; }
680 PL_parser->expect = XSTATE;
681 TOKEN_GETMAD($1,$$,';');
685 /* Ordinary expressions; logical combinations */
686 expr : expr ANDOP expr
687 { $$ = newLOGOP(OP_AND, 0, $1, $3);
688 TOKEN_GETMAD($2,$$,'o');
691 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
692 TOKEN_GETMAD($2,$$,'o');
695 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
696 TOKEN_GETMAD($2,$$,'o');
698 | listexpr %prec PREC_LOW
701 /* Expressions are a list of terms joined by commas */
702 listexpr: listexpr ','
705 OP* op = newNULLLIST();
706 token_getmad($2,op,',');
707 $$ = op_append_elem(OP_LIST, $1, op);
716 term = newUNOP(OP_NULL, 0, term);
717 token_getmad($2,term,',');
719 $$ = op_append_elem(OP_LIST, $1, term);
721 | term %prec PREC_LOW
725 listop : LSTOP indirob listexpr /* map {...} @args or print $fh @args */
726 { $$ = convert(IVAL($1), OPf_STACKED,
727 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
728 TOKEN_GETMAD($1,$$,'o');
730 | FUNC '(' indirob expr ')' /* print ($fh @args */
731 { $$ = convert(IVAL($1), OPf_STACKED,
732 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
733 TOKEN_GETMAD($1,$$,'o');
734 TOKEN_GETMAD($2,$$,'(');
735 TOKEN_GETMAD($5,$$,')');
737 | term ARROW method lpar_or_qw optexpr ')' /* $foo->bar(list) */
738 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
739 op_append_elem(OP_LIST,
740 op_prepend_elem(OP_LIST, scalar($1), $5),
741 newUNOP(OP_METHOD, 0, $3)));
742 TOKEN_GETMAD($2,$$,'A');
743 TOKEN_GETMAD($4,$$,'(');
744 TOKEN_GETMAD($6,$$,')');
746 | term ARROW method /* $foo->bar */
747 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
748 op_append_elem(OP_LIST, scalar($1),
749 newUNOP(OP_METHOD, 0, $3)));
750 TOKEN_GETMAD($2,$$,'A');
752 | METHOD indirob optlistexpr /* new Class @args */
753 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
754 op_append_elem(OP_LIST,
755 op_prepend_elem(OP_LIST, $2, $3),
756 newUNOP(OP_METHOD, 0, $1)));
758 | FUNCMETH indirob '(' optexpr ')' /* method $object (@args) */
759 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
760 op_append_elem(OP_LIST,
761 op_prepend_elem(OP_LIST, $2, $4),
762 newUNOP(OP_METHOD, 0, $1)));
763 TOKEN_GETMAD($3,$$,'(');
764 TOKEN_GETMAD($5,$$,')');
766 | LSTOP optlistexpr /* print @args */
767 { $$ = convert(IVAL($1), 0, $2);
768 TOKEN_GETMAD($1,$$,'o');
770 | FUNC '(' optexpr ')' /* print (@args) */
771 { $$ = convert(IVAL($1), 0, $3);
772 TOKEN_GETMAD($1,$$,'o');
773 TOKEN_GETMAD($2,$$,'(');
774 TOKEN_GETMAD($4,$$,')');
776 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
777 { SvREFCNT_inc_simple_void(PL_compcv);
778 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
779 optlistexpr %prec LSTOP /* ... @bar */
780 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
781 op_append_elem(OP_LIST,
782 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
786 /* Names of methods. May use $object->$methodname */
791 /* Some kind of subscripted expression */
792 subscripted: star '{' expr ';' '}' /* *main::{something} */
793 /* In this and all the hash accessors, ';' is
794 * provided by the tokeniser */
795 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
796 PL_parser->expect = XOPERATOR;
797 TOKEN_GETMAD($2,$$,'{');
798 TOKEN_GETMAD($4,$$,';');
799 TOKEN_GETMAD($5,$$,'}');
801 | scalar '[' expr ']' /* $array[$element] */
802 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
803 TOKEN_GETMAD($2,$$,'[');
804 TOKEN_GETMAD($4,$$,']');
806 | term ARROW '[' expr ']' /* somearef->[$element] */
807 { $$ = newBINOP(OP_AELEM, 0,
808 ref(newAVREF($1),OP_RV2AV),
810 TOKEN_GETMAD($2,$$,'a');
811 TOKEN_GETMAD($3,$$,'[');
812 TOKEN_GETMAD($5,$$,']');
814 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
815 { $$ = newBINOP(OP_AELEM, 0,
816 ref(newAVREF($1),OP_RV2AV),
818 TOKEN_GETMAD($2,$$,'[');
819 TOKEN_GETMAD($4,$$,']');
821 | scalar '{' expr ';' '}' /* $foo{bar();} */
822 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
823 PL_parser->expect = XOPERATOR;
824 TOKEN_GETMAD($2,$$,'{');
825 TOKEN_GETMAD($4,$$,';');
826 TOKEN_GETMAD($5,$$,'}');
828 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
829 { $$ = newBINOP(OP_HELEM, 0,
830 ref(newHVREF($1),OP_RV2HV),
832 PL_parser->expect = XOPERATOR;
833 TOKEN_GETMAD($2,$$,'a');
834 TOKEN_GETMAD($3,$$,'{');
835 TOKEN_GETMAD($5,$$,';');
836 TOKEN_GETMAD($6,$$,'}');
838 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
839 { $$ = newBINOP(OP_HELEM, 0,
840 ref(newHVREF($1),OP_RV2HV),
842 PL_parser->expect = XOPERATOR;
843 TOKEN_GETMAD($2,$$,'{');
844 TOKEN_GETMAD($4,$$,';');
845 TOKEN_GETMAD($5,$$,'}');
847 | term ARROW '(' ')' /* $subref->() */
848 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
849 newCVREF(0, scalar($1)));
850 TOKEN_GETMAD($2,$$,'a');
851 TOKEN_GETMAD($3,$$,'(');
852 TOKEN_GETMAD($4,$$,')');
854 | term ARROW '(' expr ')' /* $subref->(@args) */
855 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
856 op_append_elem(OP_LIST, $4,
857 newCVREF(0, scalar($1))));
858 TOKEN_GETMAD($2,$$,'a');
859 TOKEN_GETMAD($3,$$,'(');
860 TOKEN_GETMAD($5,$$,')');
863 | subscripted lpar_or_qw expr ')' /* $foo->{bar}->(@args) */
864 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
865 op_append_elem(OP_LIST, $3,
866 newCVREF(0, scalar($1))));
867 TOKEN_GETMAD($2,$$,'(');
868 TOKEN_GETMAD($4,$$,')');
870 | subscripted lpar_or_qw ')' /* $foo->{bar}->() */
871 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
872 newCVREF(0, scalar($1)));
873 TOKEN_GETMAD($2,$$,'(');
874 TOKEN_GETMAD($3,$$,')');
876 | '(' expr ')' '[' expr ']' /* list slice */
877 { $$ = newSLICEOP(0, $5, $2);
878 TOKEN_GETMAD($1,$$,'(');
879 TOKEN_GETMAD($3,$$,')');
880 TOKEN_GETMAD($4,$$,'[');
881 TOKEN_GETMAD($6,$$,']');
883 | QWLIST '[' expr ']' /* list literal slice */
884 { $$ = newSLICEOP(0, $3, $1);
885 TOKEN_GETMAD($2,$$,'[');
886 TOKEN_GETMAD($4,$$,']');
888 | '(' ')' '[' expr ']' /* empty list slice! */
889 { $$ = newSLICEOP(0, $4, (OP*)NULL);
890 TOKEN_GETMAD($1,$$,'(');
891 TOKEN_GETMAD($2,$$,')');
892 TOKEN_GETMAD($3,$$,'[');
893 TOKEN_GETMAD($5,$$,']');
897 /* Binary operators between terms */
898 termbinop: term ASSIGNOP term /* $x = $y */
899 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
900 TOKEN_GETMAD($2,$$,'o');
902 | term POWOP term /* $x ** $y */
903 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
904 TOKEN_GETMAD($2,$$,'o');
906 | term MULOP term /* $x * $y, $x x $y */
907 { if (IVAL($2) != OP_REPEAT)
909 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
910 TOKEN_GETMAD($2,$$,'o');
912 | term ADDOP term /* $x + $y */
913 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
914 TOKEN_GETMAD($2,$$,'o');
916 | term SHIFTOP term /* $x >> $y, $x << $y */
917 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
918 TOKEN_GETMAD($2,$$,'o');
920 | term RELOP term /* $x > $y, etc. */
921 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
922 TOKEN_GETMAD($2,$$,'o');
924 | term EQOP term /* $x == $y, $x eq $y */
925 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
926 TOKEN_GETMAD($2,$$,'o');
928 | term BITANDOP term /* $x & $y */
929 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
930 TOKEN_GETMAD($2,$$,'o');
932 | term BITOROP term /* $x | $y */
933 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
934 TOKEN_GETMAD($2,$$,'o');
936 | term DOTDOT term /* $x..$y, $x...$y */
938 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
942 op = (UNOP*)op->op_first; /* get to flop */
943 op = (UNOP*)op->op_first; /* get to flip */
944 op = (UNOP*)op->op_first; /* get to range */
945 token_getmad($2,(OP*)op,'o');
948 | term ANDAND term /* $x && $y */
949 { $$ = newLOGOP(OP_AND, 0, $1, $3);
950 TOKEN_GETMAD($2,$$,'o');
952 | term OROR term /* $x || $y */
953 { $$ = newLOGOP(OP_OR, 0, $1, $3);
954 TOKEN_GETMAD($2,$$,'o');
956 | term DORDOR term /* $x // $y */
957 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
958 TOKEN_GETMAD($2,$$,'o');
960 | term MATCHOP term /* $x =~ /$y/ */
961 { $$ = bind_match(IVAL($2), $1, $3);
963 ($$->op_type == OP_NOT
964 ? ((UNOP*)$$)->op_first : $$),
969 /* Unary operators and terms */
970 termunop : '-' term %prec UMINUS /* -$x */
971 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
972 TOKEN_GETMAD($1,$$,'o');
974 | '+' term %prec UMINUS /* +$x */
976 newUNOP(OP_NULL, 0, $2),
979 TOKEN_GETMAD($1,$$,'+');
982 { $$ = newUNOP(OP_NOT, 0, scalar($2));
983 TOKEN_GETMAD($1,$$,'o');
986 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
987 TOKEN_GETMAD($1,$$,'o');
989 | term POSTINC /* $x++ */
990 { $$ = newUNOP(OP_POSTINC, 0,
991 op_lvalue(scalar($1), OP_POSTINC));
992 TOKEN_GETMAD($2,$$,'o');
994 | term POSTDEC /* $x-- */
995 { $$ = newUNOP(OP_POSTDEC, 0,
996 op_lvalue(scalar($1), OP_POSTDEC));
997 TOKEN_GETMAD($2,$$,'o');
999 | PREINC term /* ++$x */
1000 { $$ = newUNOP(OP_PREINC, 0,
1001 op_lvalue(scalar($2), OP_PREINC));
1002 TOKEN_GETMAD($1,$$,'o');
1004 | PREDEC term /* --$x */
1005 { $$ = newUNOP(OP_PREDEC, 0,
1006 op_lvalue(scalar($2), OP_PREDEC));
1007 TOKEN_GETMAD($1,$$,'o');
1012 /* Constructors for anonymous data */
1013 anonymous: '[' expr ']'
1014 { $$ = newANONLIST($2);
1015 TOKEN_GETMAD($1,$$,'[');
1016 TOKEN_GETMAD($3,$$,']');
1019 { $$ = newANONLIST((OP*)NULL);
1020 TOKEN_GETMAD($1,$$,'[');
1021 TOKEN_GETMAD($2,$$,']');
1023 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1024 { $$ = newANONHASH($2);
1025 TOKEN_GETMAD($1,$$,'{');
1026 TOKEN_GETMAD($3,$$,';');
1027 TOKEN_GETMAD($4,$$,'}');
1029 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1030 { $$ = newANONHASH((OP*)NULL);
1031 TOKEN_GETMAD($1,$$,'{');
1032 TOKEN_GETMAD($2,$$,';');
1033 TOKEN_GETMAD($3,$$,'}');
1035 | ANONSUB startanonsub proto subattrlist block %prec '('
1036 { SvREFCNT_inc_simple_void(PL_compcv);
1037 $$ = newANONATTRSUB($2, $3, $4, $5);
1038 TOKEN_GETMAD($1,$$,'o');
1039 OP_GETMAD($3,$$,'s');
1040 OP_GETMAD($4,$$,'a');
1045 /* Things called with "do" */
1046 termdo : DO term %prec UNIOP /* do $filename */
1047 { $$ = dofile($2, IVAL($1));
1048 TOKEN_GETMAD($1,$$,'o');
1050 | DO block %prec '(' /* do { code */
1051 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1052 TOKEN_GETMAD($1,$$,'D');
1054 | DO WORD lpar_or_qw ')' /* do somesub() */
1055 { $$ = newUNOP(OP_ENTERSUB,
1056 OPf_SPECIAL|OPf_STACKED,
1057 op_prepend_elem(OP_LIST,
1059 (OPpENTERSUB_AMPER<<8),
1061 )),(OP*)NULL)); dep();
1062 TOKEN_GETMAD($1,$$,'o');
1063 TOKEN_GETMAD($3,$$,'(');
1064 TOKEN_GETMAD($4,$$,')');
1066 | DO WORD lpar_or_qw expr ')' /* do somesub(@args) */
1067 { $$ = newUNOP(OP_ENTERSUB,
1068 OPf_SPECIAL|OPf_STACKED,
1069 op_append_elem(OP_LIST,
1072 (OPpENTERSUB_AMPER<<8),
1075 TOKEN_GETMAD($1,$$,'o');
1076 TOKEN_GETMAD($3,$$,'(');
1077 TOKEN_GETMAD($5,$$,')');
1079 | DO scalar lpar_or_qw ')' /* do $subref () */
1080 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1081 op_prepend_elem(OP_LIST,
1082 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1083 TOKEN_GETMAD($1,$$,'o');
1084 TOKEN_GETMAD($3,$$,'(');
1085 TOKEN_GETMAD($4,$$,')');
1087 | DO scalar lpar_or_qw expr ')' /* do $subref (@args) */
1088 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1089 op_prepend_elem(OP_LIST,
1091 scalar(newCVREF(0,scalar($2))))); dep();
1092 TOKEN_GETMAD($1,$$,'o');
1093 TOKEN_GETMAD($3,$$,'(');
1094 TOKEN_GETMAD($5,$$,')');
1103 | term '?' term ':' term
1104 { $$ = newCONDOP(0, $1, $3, $5);
1105 TOKEN_GETMAD($2,$$,'?');
1106 TOKEN_GETMAD($4,$$,':');
1108 | REFGEN term /* \$x, \@y, \%z */
1109 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1110 TOKEN_GETMAD($1,$$,'o');
1112 | myattrterm %prec UNIOP
1114 | LOCAL term %prec UNIOP
1115 { $$ = localize($2,IVAL($1));
1116 TOKEN_GETMAD($1,$$,'k');
1119 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1120 TOKEN_GETMAD($1,$$,'(');
1121 TOKEN_GETMAD($3,$$,')');
1124 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1126 { $$ = sawparens(newNULLLIST());
1127 TOKEN_GETMAD($1,$$,'(');
1128 TOKEN_GETMAD($2,$$,')');
1138 | arylen %prec '(' /* $#x, $#{ something } */
1139 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1142 | ary '[' expr ']' /* array slice */
1143 { $$ = op_prepend_elem(OP_ASLICE,
1144 newOP(OP_PUSHMARK, 0),
1145 newLISTOP(OP_ASLICE, 0,
1147 ref($1, OP_ASLICE)));
1148 TOKEN_GETMAD($2,$$,'[');
1149 TOKEN_GETMAD($4,$$,']');
1151 | ary '{' expr ';' '}' /* @hash{@keys} */
1152 { $$ = op_prepend_elem(OP_HSLICE,
1153 newOP(OP_PUSHMARK, 0),
1154 newLISTOP(OP_HSLICE, 0,
1156 ref(oopsHV($1), OP_HSLICE)));
1157 PL_parser->expect = XOPERATOR;
1158 TOKEN_GETMAD($2,$$,'{');
1159 TOKEN_GETMAD($4,$$,';');
1160 TOKEN_GETMAD($5,$$,'}');
1165 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1166 | amper lpar_or_qw ')' /* &foo() */
1167 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1168 TOKEN_GETMAD($2,$$,'(');
1169 TOKEN_GETMAD($3,$$,')');
1171 | amper lpar_or_qw expr ')' /* &foo(@args) */
1173 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1174 op_append_elem(OP_LIST, $3, scalar($1)));
1177 if (op->op_type == OP_CONST) { /* defeat const fold */
1178 op = (OP*)op->op_madprop->mad_val;
1180 token_getmad($2,op,'(');
1181 token_getmad($4,op,')');
1184 | NOAMP WORD optlistexpr /* foo(@args) */
1185 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1186 op_append_elem(OP_LIST, $3, scalar($2)));
1187 TOKEN_GETMAD($1,$$,'o');
1189 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1190 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1191 PL_hints |= HINT_BLOCK_SCOPE;
1192 TOKEN_GETMAD($1,$$,'o');
1195 { $$ = newLOOPEX(IVAL($1),$2);
1196 TOKEN_GETMAD($1,$$,'o');
1198 | NOTOP listexpr /* not $foo */
1199 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1200 TOKEN_GETMAD($1,$$,'o');
1202 | UNIOP /* Unary op, $_ implied */
1203 { $$ = newOP(IVAL($1), 0);
1204 TOKEN_GETMAD($1,$$,'o');
1206 | UNIOP block /* eval { foo }* */
1207 { $$ = newUNOP(IVAL($1), 0, $2);
1208 TOKEN_GETMAD($1,$$,'o');
1210 | UNIOP term /* Unary op */
1211 { $$ = newUNOP(IVAL($1), 0, $2);
1212 TOKEN_GETMAD($1,$$,'o');
1214 | REQUIRE /* require, $_ implied */
1215 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1216 TOKEN_GETMAD($1,$$,'o');
1218 | REQUIRE term /* require Foo */
1219 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1220 TOKEN_GETMAD($1,$$,'o');
1223 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1224 | UNIOPSUB term /* Sub treated as unop */
1225 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1226 op_append_elem(OP_LIST, $2, scalar($1))); }
1227 | FUNC0 /* Nullary operator */
1228 { $$ = newOP(IVAL($1), 0);
1229 TOKEN_GETMAD($1,$$,'o');
1232 { $$ = newOP(IVAL($1), 0);
1233 TOKEN_GETMAD($1,$$,'o');
1234 TOKEN_GETMAD($2,$$,'(');
1235 TOKEN_GETMAD($3,$$,')');
1237 | FUNC0OP /* Same as above, but op created in toke.c */
1241 TOKEN_GETMAD($2,$$,'(');
1242 TOKEN_GETMAD($3,$$,')');
1244 | FUNC0SUB /* Sub treated as nullop */
1245 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1247 | FUNC1 '(' ')' /* not () */
1248 { $$ = (IVAL($1) == OP_NOT)
1249 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1250 : newOP(IVAL($1), OPf_SPECIAL);
1252 TOKEN_GETMAD($1,$$,'o');
1253 TOKEN_GETMAD($2,$$,'(');
1254 TOKEN_GETMAD($3,$$,')');
1256 | FUNC1 '(' expr ')' /* not($foo) */
1257 { $$ = newUNOP(IVAL($1), 0, $3);
1258 TOKEN_GETMAD($1,$$,'o');
1259 TOKEN_GETMAD($2,$$,'(');
1260 TOKEN_GETMAD($4,$$,')');
1262 | PMFUNC '(' listexpr ')' /* m//, s///, tr/// */
1263 { $$ = pmruntime($1, $3, 1);
1264 TOKEN_GETMAD($2,$$,'(');
1265 TOKEN_GETMAD($4,$$,')');
1271 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1272 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1273 TOKEN_GETMAD($1,$$,'X');
1278 /* "my" declarations, with optional attributes */
1279 myattrterm: MY myterm myattrlist
1280 { $$ = my_attrs($2,$3);
1282 token_getmad($1,$$,'d');
1283 append_madprops($3->op_madprop, $$, 'a');
1288 { $$ = localize($2,IVAL($1));
1289 TOKEN_GETMAD($1,$$,'d');
1293 /* Things that can be "my"'d */
1294 myterm : '(' expr ')'
1295 { $$ = sawparens($2);
1296 TOKEN_GETMAD($1,$$,'(');
1297 TOKEN_GETMAD($3,$$,')');
1300 { $$ = sawparens(newNULLLIST());
1301 TOKEN_GETMAD($1,$$,'(');
1302 TOKEN_GETMAD($2,$$,')');
1312 /* Basic list expressions */
1313 optlistexpr: /* NULL */ %prec PREC_LOW
1315 | listexpr %prec PREC_LOW
1328 { munge_qwlist_to_paren_list($1); }
1333 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1336 { PL_parser->in_my = 0; $$ = my($1); }
1340 { $$ = newCVREF(IVAL($1),$2);
1341 TOKEN_GETMAD($1,$$,'&');
1345 scalar : '$' indirob
1346 { $$ = newSVREF($2);
1347 TOKEN_GETMAD($1,$$,'$');
1352 { $$ = newAVREF($2);
1353 TOKEN_GETMAD($1,$$,'@');
1358 { $$ = newHVREF($2);
1359 TOKEN_GETMAD($1,$$,'%');
1363 arylen : DOLSHARP indirob
1364 { $$ = newAVREF($2);
1365 TOKEN_GETMAD($1,$$,'l');
1370 { $$ = newGVREF(0,$2);
1371 TOKEN_GETMAD($1,$$,'*');
1375 /* Indirect objects */
1377 { $$ = scalar($1); }
1378 | scalar %prec PREC_LOW
1379 { $$ = scalar($1); }
1381 { $$ = op_scope($1); }