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 FORMLBRACK FORMRBRACK
90 %type <ival> grammar remember mremember
91 %type <ival> startsub startanonsub startformsub
92 /* FIXME for MAD - are these two ival? */
95 %type <opval> stmtseq fullstmt labfullstmt barestmt block mblock else
96 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
97 %type <opval> listexpr nexpr texpr iexpr mexpr mnexpr miexpr
98 %type <opval> optlistexpr optexpr indirob listop method
99 %type <opval> formname subname proto subbody cont my_scalar formblock
100 %type <opval> subattrlist myattrlist myattrterm myterm
101 %type <opval> termbinop termunop anonymous termdo
102 %type <opval> formstmtseq formline formarg
104 %nonassoc <i_tkval> PREC_LOW
107 %left <i_tkval> OROP DOROP
108 %left <i_tkval> ANDOP
109 %right <i_tkval> NOTOP
110 %nonassoc LSTOP LSTOPSUB
112 %right <i_tkval> ASSIGNOP
113 %right <i_tkval> '?' ':'
114 %nonassoc DOTDOT YADAYADA
115 %left <i_tkval> OROR DORDOR
116 %left <i_tkval> ANDAND
117 %left <i_tkval> BITOROP
118 %left <i_tkval> BITANDOP
121 %nonassoc UNIOP UNIOPSUB
123 %left <i_tkval> SHIFTOP
126 %left <i_tkval> MATCHOP
127 %right <i_tkval> '!' '~' UMINUS REFGEN
128 %right <i_tkval> POWOP
129 %nonassoc <i_tkval> PREINC PREDEC POSTINC POSTDEC
130 %left <i_tkval> ARROW
131 %nonassoc <i_tkval> ')'
139 /* Top-level choice of what kind of thing yyparse was called to parse */
142 PL_parser->expect = XSTATE;
146 newPROG(block_end($3,$4));
151 parser->expect = XTERM;
160 parser->expect = XBLOCK;
164 PL_pad_reset_pending = TRUE;
168 parser->yychar = YYEOF;
172 parser->expect = XSTATE;
176 PL_pad_reset_pending = TRUE;
180 parser->yychar = YYEOF;
184 parser->expect = XSTATE;
188 PL_pad_reset_pending = TRUE;
192 parser->yychar = YYEOF;
196 parser->expect = XSTATE;
205 /* An ordinary block */
206 block : '{' remember stmtseq '}'
207 { if (PL_parser->copline > (line_t)IVAL($1))
208 PL_parser->copline = (line_t)IVAL($1);
209 $$ = block_end($2, $3);
210 TOKEN_GETMAD($1,$$,'{');
211 TOKEN_GETMAD($4,$$,'}');
216 formblock: '=' remember ';' FORMRBRACK formstmtseq ';' '.'
217 { if (PL_parser->copline > (line_t)IVAL($1))
218 PL_parser->copline = (line_t)IVAL($1);
219 $$ = block_end($2, $5);
220 TOKEN_GETMAD($1,$$,'{');
221 TOKEN_GETMAD($7,$$,'}');
225 remember: /* NULL */ /* start a full lexical scope */
226 { $$ = block_start(TRUE); }
229 mblock : '{' mremember stmtseq '}'
230 { if (PL_parser->copline > (line_t)IVAL($1))
231 PL_parser->copline = (line_t)IVAL($1);
232 $$ = block_end($2, $3);
233 TOKEN_GETMAD($1,$$,'{');
234 TOKEN_GETMAD($4,$$,'}');
238 mremember: /* NULL */ /* start a partial lexical scope */
239 { $$ = block_start(FALSE); }
242 /* A sequence of statements in the program */
246 { $$ = op_append_list(OP_LINESEQ, $1, $2);
247 PL_pad_reset_pending = TRUE;
249 PL_hints |= HINT_BLOCK_SCOPE;
253 /* A sequence of format lines */
254 formstmtseq: /* NULL */
256 | formstmtseq formline
257 { $$ = op_append_list(OP_LINESEQ, $1, $2);
258 PL_pad_reset_pending = TRUE;
260 PL_hints |= HINT_BLOCK_SCOPE;
264 /* A statement in the program, including optional labels */
268 $$ = newSTATEOP(0, NULL, $1);
270 $$ = IF_MAD(newOP(OP_NULL, 0), NULL);
277 labfullstmt: LABEL barestmt
279 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
280 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
282 $2 ? cLISTOPx($$)->op_first : $$, 'L');
286 $$ = newSTATEOP(SvUTF8(((SVOP*)$1)->op_sv),
287 savepv(SvPVX(((SVOP*)$1)->op_sv)), $2);
288 TOKEN_GETMAD($1, cLISTOPx($$)->op_first, 'L');
292 /* A bare statement, lacking label and other aspects of state op */
297 $$ = newOP(OP_NULL,0);
298 TOKEN_GETMAD($1,$$,'p');
300 | FORMAT startformsub formname formblock
302 CV *fmtcv = PL_compcv;
304 $$ = newFORM($2, $3, $4);
305 prepend_madprops($1->tk_mad, $$, 'F');
312 if (CvOUTSIDE(fmtcv) && !CvEVAL(CvOUTSIDE(fmtcv))) {
313 SvREFCNT_inc_simple_void(fmtcv);
314 pad_add_anon(fmtcv, OP_NULL);
317 | SUB startsub subname proto subattrlist subbody
319 SvREFCNT_inc_simple_void(PL_compcv);
322 OP* o = newSVOP(OP_ANONCODE, 0,
323 (SV*)newATTRSUB($2, $3, $4, $5, $6));
324 $$ = newOP(OP_NULL,0);
326 op_getmad($3,$$,'n');
327 op_getmad($4,$$,'s');
328 op_getmad($5,$$,'a');
329 token_getmad($1,$$,'d');
330 append_madprops($6->op_madprop, $$, 0);
334 newATTRSUB($2, $3, $4, $5, $6);
338 | MYSUB startsub subname proto subattrlist subbody
340 /* Unimplemented "my sub foo { }" */
341 SvREFCNT_inc_simple_void(PL_compcv);
343 $$ = newMYSUB($2, $3, $4, $5, $6);
344 token_getmad($1,$$,'d');
346 newMYSUB($2, $3, $4, $5, $6);
350 | PACKAGE WORD WORD ';'
354 token_getmad($1,$$,'o');
357 token_getmad($4,$$,';');
366 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
367 WORD WORD optlistexpr ';'
369 SvREFCNT_inc_simple_void(PL_compcv);
371 $$ = utilize(IVAL($1), $2, $4, $5, $6);
372 token_getmad($1,$$,'o');
373 token_getmad($7,$$,';');
374 if (PL_parser->rsfp_filters &&
375 AvFILLp(PL_parser->rsfp_filters) >= 0)
376 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
378 utilize(IVAL($1), $2, $4, $5, $6);
382 | IF '(' remember mexpr ')' mblock else
385 newCONDOP(0, $4, op_scope($6), $7));
386 TOKEN_GETMAD($1,$$,'I');
387 TOKEN_GETMAD($2,$$,'(');
388 TOKEN_GETMAD($5,$$,')');
389 PL_parser->copline = (line_t)IVAL($1);
391 | UNLESS '(' remember miexpr ')' mblock else
394 newCONDOP(0, $4, op_scope($6), $7));
395 TOKEN_GETMAD($1,$$,'I');
396 TOKEN_GETMAD($2,$$,'(');
397 TOKEN_GETMAD($5,$$,')');
398 PL_parser->copline = (line_t)IVAL($1);
400 | GIVEN '(' remember mexpr ')' mblock
402 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
404 newGIVENOP($4, op_scope($6),
406 || PAD_COMPNAME_FLAGS_isOUR(offset)
409 PL_parser->copline = (line_t)IVAL($1);
411 | WHEN '(' remember mexpr ')' mblock
412 { $$ = block_end($3, newWHENOP($4, op_scope($6))); }
414 { $$ = newWHENOP(0, op_scope($2)); }
415 | WHILE '(' remember texpr ')' mintro mblock cont
418 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
420 TOKEN_GETMAD($1,$$,'W');
421 TOKEN_GETMAD($2,$$,'(');
422 TOKEN_GETMAD($5,$$,')');
423 PL_parser->copline = (line_t)IVAL($1);
425 | UNTIL '(' remember iexpr ')' mintro mblock cont
428 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
430 TOKEN_GETMAD($1,$$,'W');
431 TOKEN_GETMAD($2,$$,'(');
432 TOKEN_GETMAD($5,$$,')');
433 PL_parser->copline = (line_t)IVAL($1);
435 | FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
438 OP *initop = IF_MAD($4 ? $4 : newOP(OP_NULL, 0), $4);
439 OP *forop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
440 scalar($6), $11, $9, $8);
442 forop = op_prepend_elem(OP_LINESEQ, initop,
443 op_append_elem(OP_LINESEQ,
444 newOP(OP_UNSTACK, OPf_SPECIAL),
447 DO_MAD({ forop = newUNOP(OP_NULL, 0, forop); })
448 $$ = block_end($3, forop);
449 TOKEN_GETMAD($1,$$,'3');
450 TOKEN_GETMAD($2,$$,'(');
451 TOKEN_GETMAD($5,$$,'1');
452 TOKEN_GETMAD($7,$$,'2');
453 TOKEN_GETMAD($10,$$,')');
454 PL_parser->copline = (line_t)IVAL($1);
456 | FOR MY remember my_scalar '(' mexpr ')' mblock cont
458 $$ = block_end($3, newFOROP(0, $4, $6, $8, $9));
459 TOKEN_GETMAD($1,$$,'W');
460 TOKEN_GETMAD($2,$$,'d');
461 TOKEN_GETMAD($5,$$,'(');
462 TOKEN_GETMAD($7,$$,')');
463 PL_parser->copline = (line_t)IVAL($1);
465 | FOR scalar '(' remember mexpr ')' mblock cont
467 $$ = block_end($4, newFOROP(0,
468 op_lvalue($2, OP_ENTERLOOP), $5, $7, $8));
469 TOKEN_GETMAD($1,$$,'W');
470 TOKEN_GETMAD($3,$$,'(');
471 TOKEN_GETMAD($6,$$,')');
472 PL_parser->copline = (line_t)IVAL($1);
474 | FOR '(' remember mexpr ')' mblock cont
477 newFOROP(0, (OP*)NULL, $4, $6, $7));
478 TOKEN_GETMAD($1,$$,'W');
479 TOKEN_GETMAD($2,$$,'(');
480 TOKEN_GETMAD($5,$$,')');
481 PL_parser->copline = (line_t)IVAL($1);
485 /* a block is a loop that happens once */
486 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
487 (OP*)NULL, $1, $2, 0);
489 | PACKAGE WORD WORD '{' remember
498 /* a block is a loop that happens once */
499 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
500 (OP*)NULL, block_end($5, $7), (OP*)NULL, 0);
501 TOKEN_GETMAD($4,$$,'{');
502 TOKEN_GETMAD($8,$$,'}');
503 if (PL_parser->copline > (line_t)IVAL($4))
504 PL_parser->copline = (line_t)IVAL($4);
508 PL_parser->expect = XSTATE;
510 TOKEN_GETMAD($2,$$,';');
514 PL_parser->expect = XSTATE;
515 $$ = IF_MAD(newOP(OP_NULL, 0), (OP*)NULL);
516 TOKEN_GETMAD($1,$$,';');
517 PL_parser->copline = NOLINE;
522 formline: THING formarg
526 DO_MAD(term = newUNOP(OP_NULL, 0, term));
527 list = op_append_elem(OP_LIST, $1, term);
531 OP *op = newNULLLIST();
532 list = op_append_elem(OP_LIST, $1, op);
537 if (PL_parser->copline == NOLINE)
538 PL_parser->copline = CopLINE(PL_curcop)-1;
539 else PL_parser->copline--;
540 $$ = newSTATEOP(0, NULL,
541 convert(OP_FORMLINE, 0, list));
547 | FORMLBRACK stmtseq FORMRBRACK
548 { $$ = op_unscope($2); }
551 /* An expression which may have a side-effect */
557 { $$ = newLOGOP(OP_AND, 0, $3, $1);
558 TOKEN_GETMAD($2,$$,'i');
561 { $$ = newLOGOP(OP_OR, 0, $3, $1);
562 TOKEN_GETMAD($2,$$,'i');
565 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
566 TOKEN_GETMAD($2,$$,'w');
569 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
570 TOKEN_GETMAD($2,$$,'w');
573 { $$ = newFOROP(0, (OP*)NULL, $3, $1, (OP*)NULL);
574 TOKEN_GETMAD($2,$$,'w');
575 PL_parser->copline = (line_t)IVAL($2);
578 { $$ = newWHENOP($3, op_scope($1)); }
581 /* else and elsif blocks */
586 ($2)->op_flags |= OPf_PARENS;
588 TOKEN_GETMAD($1,$$,'o');
590 | ELSIF '(' mexpr ')' mblock else
591 { PL_parser->copline = (line_t)IVAL($1);
593 newSTATEOP(OPf_SPECIAL,NULL,$3),
595 PL_hints |= HINT_BLOCK_SCOPE;
596 TOKEN_GETMAD($1,$$,'I');
597 TOKEN_GETMAD($2,$$,'(');
598 TOKEN_GETMAD($4,$$,')');
602 /* Continue blocks */
608 TOKEN_GETMAD($1,$$,'o');
612 /* determine whether there are any new my declarations */
614 { $$ = (PL_min_intro_pending &&
615 PL_max_intro_pending >= PL_min_intro_pending);
618 /* Normal expression */
624 /* Boolean expression */
625 texpr : /* NULL means true */
627 (void)scan_num("1", &tmplval);
628 $$ = tmplval.opval; }
632 /* Inverted boolean expression */
634 { $$ = invert(scalar($1)); }
637 /* Expression with its own lexical scope */
639 { $$ = $1; intro_my(); }
643 { $$ = $1; intro_my(); }
647 { $$ = $1; intro_my(); }
650 formname: WORD { $$ = $1; }
651 | /* NULL */ { $$ = (OP*)NULL; }
654 startsub: /* NULL */ /* start a regular subroutine scope */
655 { $$ = start_subparse(FALSE, 0);
656 SAVEFREESV(PL_compcv); }
660 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
661 { $$ = start_subparse(FALSE, CVf_ANON);
662 SAVEFREESV(PL_compcv); }
665 startformsub: /* NULL */ /* start a format subroutine scope */
666 { $$ = start_subparse(TRUE, 0);
667 SAVEFREESV(PL_compcv); }
670 /* Name of a subroutine - must be a bareword, could be special */
671 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
672 if (strEQ(name, "BEGIN") || strEQ(name, "END")
673 || strEQ(name, "INIT") || strEQ(name, "CHECK")
674 || strEQ(name, "UNITCHECK"))
675 CvSPECIAL_on(PL_compcv);
679 /* Subroutine prototype */
685 /* Optional list of subroutine attributes */
686 subattrlist: /* NULL */
690 TOKEN_GETMAD($1,$$,':');
697 TOKEN_GETMAD($1,$$,':');
701 /* List of attributes for a "my" variable declaration */
702 myattrlist: COLONATTR THING
704 TOKEN_GETMAD($1,$$,':');
711 TOKEN_GETMAD($1,$$,':');
715 /* Subroutine body - either null or a block */
716 subbody : block { $$ = $1; }
721 PL_parser->expect = XSTATE;
722 TOKEN_GETMAD($1,$$,';');
726 /* Ordinary expressions; logical combinations */
727 expr : expr ANDOP expr
728 { $$ = newLOGOP(OP_AND, 0, $1, $3);
729 TOKEN_GETMAD($2,$$,'o');
732 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
733 TOKEN_GETMAD($2,$$,'o');
736 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
737 TOKEN_GETMAD($2,$$,'o');
739 | listexpr %prec PREC_LOW
742 /* Expressions are a list of terms joined by commas */
743 listexpr: listexpr ','
746 OP* op = newNULLLIST();
747 token_getmad($2,op,',');
748 $$ = op_append_elem(OP_LIST, $1, op);
757 term = newUNOP(OP_NULL, 0, term);
758 token_getmad($2,term,',');
760 $$ = op_append_elem(OP_LIST, $1, term);
762 | term %prec PREC_LOW
766 listop : LSTOP indirob listexpr /* map {...} @args or print $fh @args */
767 { $$ = convert(IVAL($1), OPf_STACKED,
768 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
769 TOKEN_GETMAD($1,$$,'o');
771 | FUNC '(' indirob expr ')' /* print ($fh @args */
772 { $$ = convert(IVAL($1), OPf_STACKED,
773 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
774 TOKEN_GETMAD($1,$$,'o');
775 TOKEN_GETMAD($2,$$,'(');
776 TOKEN_GETMAD($5,$$,')');
778 | term ARROW method '(' optexpr ')' /* $foo->bar(list) */
779 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
780 op_append_elem(OP_LIST,
781 op_prepend_elem(OP_LIST, scalar($1), $5),
782 newUNOP(OP_METHOD, 0, $3)));
783 TOKEN_GETMAD($2,$$,'A');
784 TOKEN_GETMAD($4,$$,'(');
785 TOKEN_GETMAD($6,$$,')');
787 | term ARROW method /* $foo->bar */
788 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
789 op_append_elem(OP_LIST, scalar($1),
790 newUNOP(OP_METHOD, 0, $3)));
791 TOKEN_GETMAD($2,$$,'A');
793 | METHOD indirob optlistexpr /* new Class @args */
794 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
795 op_append_elem(OP_LIST,
796 op_prepend_elem(OP_LIST, $2, $3),
797 newUNOP(OP_METHOD, 0, $1)));
799 | FUNCMETH indirob '(' optexpr ')' /* method $object (@args) */
800 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
801 op_append_elem(OP_LIST,
802 op_prepend_elem(OP_LIST, $2, $4),
803 newUNOP(OP_METHOD, 0, $1)));
804 TOKEN_GETMAD($3,$$,'(');
805 TOKEN_GETMAD($5,$$,')');
807 | LSTOP optlistexpr /* print @args */
808 { $$ = convert(IVAL($1), 0, $2);
809 TOKEN_GETMAD($1,$$,'o');
811 | FUNC '(' optexpr ')' /* print (@args) */
812 { $$ = convert(IVAL($1), 0, $3);
813 TOKEN_GETMAD($1,$$,'o');
814 TOKEN_GETMAD($2,$$,'(');
815 TOKEN_GETMAD($4,$$,')');
817 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
818 { SvREFCNT_inc_simple_void(PL_compcv);
819 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
820 optlistexpr %prec LSTOP /* ... @bar */
821 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
822 op_append_elem(OP_LIST,
823 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
827 /* Names of methods. May use $object->$methodname */
832 /* Some kind of subscripted expression */
833 subscripted: star '{' expr ';' '}' /* *main::{something} */
834 /* In this and all the hash accessors, ';' is
835 * provided by the tokeniser */
836 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
837 PL_parser->expect = XOPERATOR;
838 TOKEN_GETMAD($2,$$,'{');
839 TOKEN_GETMAD($4,$$,';');
840 TOKEN_GETMAD($5,$$,'}');
842 | scalar '[' expr ']' /* $array[$element] */
843 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
844 TOKEN_GETMAD($2,$$,'[');
845 TOKEN_GETMAD($4,$$,']');
847 | term ARROW '[' expr ']' /* somearef->[$element] */
848 { $$ = newBINOP(OP_AELEM, 0,
849 ref(newAVREF($1),OP_RV2AV),
851 TOKEN_GETMAD($2,$$,'a');
852 TOKEN_GETMAD($3,$$,'[');
853 TOKEN_GETMAD($5,$$,']');
855 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
856 { $$ = newBINOP(OP_AELEM, 0,
857 ref(newAVREF($1),OP_RV2AV),
859 TOKEN_GETMAD($2,$$,'[');
860 TOKEN_GETMAD($4,$$,']');
862 | scalar '{' expr ';' '}' /* $foo{bar();} */
863 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
864 PL_parser->expect = XOPERATOR;
865 TOKEN_GETMAD($2,$$,'{');
866 TOKEN_GETMAD($4,$$,';');
867 TOKEN_GETMAD($5,$$,'}');
869 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
870 { $$ = newBINOP(OP_HELEM, 0,
871 ref(newHVREF($1),OP_RV2HV),
873 PL_parser->expect = XOPERATOR;
874 TOKEN_GETMAD($2,$$,'a');
875 TOKEN_GETMAD($3,$$,'{');
876 TOKEN_GETMAD($5,$$,';');
877 TOKEN_GETMAD($6,$$,'}');
879 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
880 { $$ = newBINOP(OP_HELEM, 0,
881 ref(newHVREF($1),OP_RV2HV),
883 PL_parser->expect = XOPERATOR;
884 TOKEN_GETMAD($2,$$,'{');
885 TOKEN_GETMAD($4,$$,';');
886 TOKEN_GETMAD($5,$$,'}');
888 | term ARROW '(' ')' /* $subref->() */
889 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
890 newCVREF(0, scalar($1)));
891 TOKEN_GETMAD($2,$$,'a');
892 TOKEN_GETMAD($3,$$,'(');
893 TOKEN_GETMAD($4,$$,')');
895 | term ARROW '(' expr ')' /* $subref->(@args) */
896 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
897 op_append_elem(OP_LIST, $4,
898 newCVREF(0, scalar($1))));
899 TOKEN_GETMAD($2,$$,'a');
900 TOKEN_GETMAD($3,$$,'(');
901 TOKEN_GETMAD($5,$$,')');
904 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
905 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
906 op_append_elem(OP_LIST, $3,
907 newCVREF(0, scalar($1))));
908 TOKEN_GETMAD($2,$$,'(');
909 TOKEN_GETMAD($4,$$,')');
911 | subscripted '(' ')' /* $foo->{bar}->() */
912 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
913 newCVREF(0, scalar($1)));
914 TOKEN_GETMAD($2,$$,'(');
915 TOKEN_GETMAD($3,$$,')');
917 | '(' expr ')' '[' expr ']' /* list slice */
918 { $$ = newSLICEOP(0, $5, $2);
919 TOKEN_GETMAD($1,$$,'(');
920 TOKEN_GETMAD($3,$$,')');
921 TOKEN_GETMAD($4,$$,'[');
922 TOKEN_GETMAD($6,$$,']');
924 | QWLIST '[' expr ']' /* list literal slice */
925 { $$ = newSLICEOP(0, $3, $1);
926 TOKEN_GETMAD($2,$$,'[');
927 TOKEN_GETMAD($4,$$,']');
929 | '(' ')' '[' expr ']' /* empty list slice! */
930 { $$ = newSLICEOP(0, $4, (OP*)NULL);
931 TOKEN_GETMAD($1,$$,'(');
932 TOKEN_GETMAD($2,$$,')');
933 TOKEN_GETMAD($3,$$,'[');
934 TOKEN_GETMAD($5,$$,']');
938 /* Binary operators between terms */
939 termbinop: term ASSIGNOP term /* $x = $y */
940 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
941 TOKEN_GETMAD($2,$$,'o');
943 | term POWOP term /* $x ** $y */
944 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
945 TOKEN_GETMAD($2,$$,'o');
947 | term MULOP term /* $x * $y, $x x $y */
948 { if (IVAL($2) != OP_REPEAT)
950 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
951 TOKEN_GETMAD($2,$$,'o');
953 | term ADDOP term /* $x + $y */
954 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
955 TOKEN_GETMAD($2,$$,'o');
957 | term SHIFTOP term /* $x >> $y, $x << $y */
958 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
959 TOKEN_GETMAD($2,$$,'o');
961 | term RELOP term /* $x > $y, etc. */
962 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
963 TOKEN_GETMAD($2,$$,'o');
965 | term EQOP term /* $x == $y, $x eq $y */
966 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
967 TOKEN_GETMAD($2,$$,'o');
969 | term BITANDOP term /* $x & $y */
970 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
971 TOKEN_GETMAD($2,$$,'o');
973 | term BITOROP term /* $x | $y */
974 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
975 TOKEN_GETMAD($2,$$,'o');
977 | term DOTDOT term /* $x..$y, $x...$y */
979 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
983 op = (UNOP*)op->op_first; /* get to flop */
984 op = (UNOP*)op->op_first; /* get to flip */
985 op = (UNOP*)op->op_first; /* get to range */
986 token_getmad($2,(OP*)op,'o');
989 | term ANDAND term /* $x && $y */
990 { $$ = newLOGOP(OP_AND, 0, $1, $3);
991 TOKEN_GETMAD($2,$$,'o');
993 | term OROR term /* $x || $y */
994 { $$ = newLOGOP(OP_OR, 0, $1, $3);
995 TOKEN_GETMAD($2,$$,'o');
997 | term DORDOR term /* $x // $y */
998 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
999 TOKEN_GETMAD($2,$$,'o');
1001 | term MATCHOP term /* $x =~ /$y/ */
1002 { $$ = bind_match(IVAL($2), $1, $3);
1004 ($$->op_type == OP_NOT
1005 ? ((UNOP*)$$)->op_first : $$),
1010 /* Unary operators and terms */
1011 termunop : '-' term %prec UMINUS /* -$x */
1012 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
1013 TOKEN_GETMAD($1,$$,'o');
1015 | '+' term %prec UMINUS /* +$x */
1017 newUNOP(OP_NULL, 0, $2),
1020 TOKEN_GETMAD($1,$$,'+');
1022 | '!' term /* !$x */
1023 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1024 TOKEN_GETMAD($1,$$,'o');
1026 | '~' term /* ~$x */
1027 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
1028 TOKEN_GETMAD($1,$$,'o');
1030 | term POSTINC /* $x++ */
1031 { $$ = newUNOP(OP_POSTINC, 0,
1032 op_lvalue(scalar($1), OP_POSTINC));
1033 TOKEN_GETMAD($2,$$,'o');
1035 | term POSTDEC /* $x-- */
1036 { $$ = newUNOP(OP_POSTDEC, 0,
1037 op_lvalue(scalar($1), OP_POSTDEC));
1038 TOKEN_GETMAD($2,$$,'o');
1040 | PREINC term /* ++$x */
1041 { $$ = newUNOP(OP_PREINC, 0,
1042 op_lvalue(scalar($2), OP_PREINC));
1043 TOKEN_GETMAD($1,$$,'o');
1045 | PREDEC term /* --$x */
1046 { $$ = newUNOP(OP_PREDEC, 0,
1047 op_lvalue(scalar($2), OP_PREDEC));
1048 TOKEN_GETMAD($1,$$,'o');
1053 /* Constructors for anonymous data */
1054 anonymous: '[' expr ']'
1055 { $$ = newANONLIST($2);
1056 TOKEN_GETMAD($1,$$,'[');
1057 TOKEN_GETMAD($3,$$,']');
1060 { $$ = newANONLIST((OP*)NULL);
1061 TOKEN_GETMAD($1,$$,'[');
1062 TOKEN_GETMAD($2,$$,']');
1064 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1065 { $$ = newANONHASH($2);
1066 TOKEN_GETMAD($1,$$,'{');
1067 TOKEN_GETMAD($3,$$,';');
1068 TOKEN_GETMAD($4,$$,'}');
1070 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1071 { $$ = newANONHASH((OP*)NULL);
1072 TOKEN_GETMAD($1,$$,'{');
1073 TOKEN_GETMAD($2,$$,';');
1074 TOKEN_GETMAD($3,$$,'}');
1076 | ANONSUB startanonsub proto subattrlist block %prec '('
1077 { SvREFCNT_inc_simple_void(PL_compcv);
1078 $$ = newANONATTRSUB($2, $3, $4, $5);
1079 TOKEN_GETMAD($1,$$,'o');
1080 OP_GETMAD($3,$$,'s');
1081 OP_GETMAD($4,$$,'a');
1086 /* Things called with "do" */
1087 termdo : DO term %prec UNIOP /* do $filename */
1088 { $$ = dofile($2, IVAL($1));
1089 TOKEN_GETMAD($1,$$,'o');
1091 | DO block %prec '(' /* do { code */
1092 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1093 TOKEN_GETMAD($1,$$,'D');
1095 | DO WORD '(' ')' /* do somesub() */
1096 { $$ = newUNOP(OP_ENTERSUB,
1097 OPf_SPECIAL|OPf_STACKED,
1098 op_prepend_elem(OP_LIST,
1100 (OPpENTERSUB_AMPER<<8),
1102 )),(OP*)NULL)); dep();
1103 TOKEN_GETMAD($1,$$,'o');
1104 TOKEN_GETMAD($3,$$,'(');
1105 TOKEN_GETMAD($4,$$,')');
1107 | DO WORD '(' expr ')' /* do somesub(@args) */
1108 { $$ = newUNOP(OP_ENTERSUB,
1109 OPf_SPECIAL|OPf_STACKED,
1110 op_append_elem(OP_LIST,
1113 (OPpENTERSUB_AMPER<<8),
1116 TOKEN_GETMAD($1,$$,'o');
1117 TOKEN_GETMAD($3,$$,'(');
1118 TOKEN_GETMAD($5,$$,')');
1120 | DO scalar '(' ')' /* do $subref () */
1121 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1122 op_prepend_elem(OP_LIST,
1123 scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep();
1124 TOKEN_GETMAD($1,$$,'o');
1125 TOKEN_GETMAD($3,$$,'(');
1126 TOKEN_GETMAD($4,$$,')');
1128 | DO scalar '(' expr ')' /* do $subref (@args) */
1129 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
1130 op_prepend_elem(OP_LIST,
1132 scalar(newCVREF(0,scalar($2))))); dep();
1133 TOKEN_GETMAD($1,$$,'o');
1134 TOKEN_GETMAD($3,$$,'(');
1135 TOKEN_GETMAD($5,$$,')');
1144 | term '?' term ':' term
1145 { $$ = newCONDOP(0, $1, $3, $5);
1146 TOKEN_GETMAD($2,$$,'?');
1147 TOKEN_GETMAD($4,$$,':');
1149 | REFGEN term /* \$x, \@y, \%z */
1150 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1151 TOKEN_GETMAD($1,$$,'o');
1153 | myattrterm %prec UNIOP
1155 | LOCAL term %prec UNIOP
1156 { $$ = localize($2,IVAL($1));
1157 TOKEN_GETMAD($1,$$,'k');
1160 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1161 TOKEN_GETMAD($1,$$,'(');
1162 TOKEN_GETMAD($3,$$,')');
1165 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1167 { $$ = sawparens(newNULLLIST());
1168 TOKEN_GETMAD($1,$$,'(');
1169 TOKEN_GETMAD($2,$$,')');
1179 | arylen %prec '(' /* $#x, $#{ something } */
1180 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1183 | ary '[' expr ']' /* array slice */
1184 { $$ = op_prepend_elem(OP_ASLICE,
1185 newOP(OP_PUSHMARK, 0),
1186 newLISTOP(OP_ASLICE, 0,
1188 ref($1, OP_ASLICE)));
1189 TOKEN_GETMAD($2,$$,'[');
1190 TOKEN_GETMAD($4,$$,']');
1192 | ary '{' expr ';' '}' /* @hash{@keys} */
1193 { $$ = op_prepend_elem(OP_HSLICE,
1194 newOP(OP_PUSHMARK, 0),
1195 newLISTOP(OP_HSLICE, 0,
1197 ref(oopsHV($1), OP_HSLICE)));
1198 PL_parser->expect = XOPERATOR;
1199 TOKEN_GETMAD($2,$$,'{');
1200 TOKEN_GETMAD($4,$$,';');
1201 TOKEN_GETMAD($5,$$,'}');
1206 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1207 | amper '(' ')' /* &foo() */
1208 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1209 TOKEN_GETMAD($2,$$,'(');
1210 TOKEN_GETMAD($3,$$,')');
1212 | amper '(' expr ')' /* &foo(@args) */
1214 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1215 op_append_elem(OP_LIST, $3, scalar($1)));
1218 if (op->op_type == OP_CONST) { /* defeat const fold */
1219 op = (OP*)op->op_madprop->mad_val;
1221 token_getmad($2,op,'(');
1222 token_getmad($4,op,')');
1225 | NOAMP WORD optlistexpr /* foo(@args) */
1226 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1227 op_append_elem(OP_LIST, $3, scalar($2)));
1228 TOKEN_GETMAD($1,$$,'o');
1230 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1231 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1232 PL_hints |= HINT_BLOCK_SCOPE;
1233 TOKEN_GETMAD($1,$$,'o');
1236 { $$ = newLOOPEX(IVAL($1),$2);
1237 TOKEN_GETMAD($1,$$,'o');
1239 | NOTOP listexpr /* not $foo */
1240 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1241 TOKEN_GETMAD($1,$$,'o');
1243 | UNIOP /* Unary op, $_ implied */
1244 { $$ = newOP(IVAL($1), 0);
1245 TOKEN_GETMAD($1,$$,'o');
1247 | UNIOP block /* eval { foo }* */
1248 { $$ = newUNOP(IVAL($1), 0, $2);
1249 TOKEN_GETMAD($1,$$,'o');
1251 | UNIOP term /* Unary op */
1252 { $$ = newUNOP(IVAL($1), 0, $2);
1253 TOKEN_GETMAD($1,$$,'o');
1255 | REQUIRE /* require, $_ implied */
1256 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1257 TOKEN_GETMAD($1,$$,'o');
1259 | REQUIRE term /* require Foo */
1260 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1261 TOKEN_GETMAD($1,$$,'o');
1264 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1265 | UNIOPSUB term /* Sub treated as unop */
1266 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1267 op_append_elem(OP_LIST, $2, scalar($1))); }
1268 | FUNC0 /* Nullary operator */
1269 { $$ = newOP(IVAL($1), 0);
1270 TOKEN_GETMAD($1,$$,'o');
1273 { $$ = newOP(IVAL($1), 0);
1274 TOKEN_GETMAD($1,$$,'o');
1275 TOKEN_GETMAD($2,$$,'(');
1276 TOKEN_GETMAD($3,$$,')');
1278 | FUNC0OP /* Same as above, but op created in toke.c */
1282 TOKEN_GETMAD($2,$$,'(');
1283 TOKEN_GETMAD($3,$$,')');
1285 | FUNC0SUB /* Sub treated as nullop */
1286 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1288 | FUNC1 '(' ')' /* not () */
1289 { $$ = (IVAL($1) == OP_NOT)
1290 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1291 : newOP(IVAL($1), OPf_SPECIAL);
1293 TOKEN_GETMAD($1,$$,'o');
1294 TOKEN_GETMAD($2,$$,'(');
1295 TOKEN_GETMAD($3,$$,')');
1297 | FUNC1 '(' expr ')' /* not($foo) */
1298 { $$ = newUNOP(IVAL($1), 0, $3);
1299 TOKEN_GETMAD($1,$$,'o');
1300 TOKEN_GETMAD($2,$$,'(');
1301 TOKEN_GETMAD($4,$$,')');
1303 | PMFUNC /* m//, s///, qr//, tr/// */
1305 if ( $1->op_type != OP_TRANS
1306 && $1->op_type != OP_TRANSR
1307 && (((PMOP*)$1)->op_pmflags & PMf_HAS_CV))
1309 $<ival>$ = start_subparse(FALSE, CVf_ANON);
1310 SAVEFREESV(PL_compcv);
1315 { $$ = pmruntime($1, $4, 1, $<ival>2);
1316 TOKEN_GETMAD($3,$$,'(');
1317 TOKEN_GETMAD($5,$$,')');
1323 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1324 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1325 TOKEN_GETMAD($1,$$,'X');
1330 /* "my" declarations, with optional attributes */
1331 myattrterm: MY myterm myattrlist
1332 { $$ = my_attrs($2,$3);
1334 token_getmad($1,$$,'d');
1335 append_madprops($3->op_madprop, $$, 'a');
1340 { $$ = localize($2,IVAL($1));
1341 TOKEN_GETMAD($1,$$,'d');
1345 /* Things that can be "my"'d */
1346 myterm : '(' expr ')'
1347 { $$ = sawparens($2);
1348 TOKEN_GETMAD($1,$$,'(');
1349 TOKEN_GETMAD($3,$$,')');
1352 { $$ = sawparens(newNULLLIST());
1353 TOKEN_GETMAD($1,$$,'(');
1354 TOKEN_GETMAD($2,$$,')');
1364 /* Basic list expressions */
1365 optlistexpr: /* NULL */ %prec PREC_LOW
1367 | listexpr %prec PREC_LOW
1377 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1380 { PL_parser->in_my = 0; $$ = my($1); }
1384 { $$ = newCVREF(IVAL($1),$2);
1385 TOKEN_GETMAD($1,$$,'&');
1389 scalar : '$' indirob
1390 { $$ = newSVREF($2);
1391 TOKEN_GETMAD($1,$$,'$');
1396 { $$ = newAVREF($2);
1397 TOKEN_GETMAD($1,$$,'@');
1402 { $$ = newHVREF($2);
1403 TOKEN_GETMAD($1,$$,'%');
1407 arylen : DOLSHARP indirob
1408 { $$ = newAVREF($2);
1409 TOKEN_GETMAD($1,$$,'l');
1414 { $$ = newGVREF(0,$2);
1415 TOKEN_GETMAD($1,$$,'*');
1419 /* Indirect objects */
1421 { $$ = scalar($1); }
1422 | scalar %prec PREC_LOW
1423 { $$ = scalar($1); }
1425 { $$ = op_scope($1); }