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 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> sliceme kvslice gelem
98 %type <opval> listexpr nexpr texpr iexpr mexpr mnexpr miexpr
99 %type <opval> optlistexpr optexpr indirob listop method
100 %type <opval> formname subname proto optsubbody cont my_scalar formblock
101 %type <opval> subattrlist myattrlist myattrterm myterm
102 %type <opval> realsubbody subsignature termbinop termunop anonymous termdo
103 %type <opval> formstmtseq formline formarg
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 POSTJOIN
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,$$,'}');
217 formblock: '=' remember ';' FORMRBRACK formstmtseq ';' '.'
218 { if (PL_parser->copline > (line_t)IVAL($1))
219 PL_parser->copline = (line_t)IVAL($1);
220 $$ = block_end($2, $5);
221 TOKEN_GETMAD($1,$$,'{');
222 TOKEN_GETMAD($7,$$,'}');
226 remember: /* NULL */ /* start a full lexical scope */
227 { $$ = block_start(TRUE); }
230 mblock : '{' mremember stmtseq '}'
231 { if (PL_parser->copline > (line_t)IVAL($1))
232 PL_parser->copline = (line_t)IVAL($1);
233 $$ = block_end($2, $3);
234 TOKEN_GETMAD($1,$$,'{');
235 TOKEN_GETMAD($4,$$,'}');
239 mremember: /* NULL */ /* start a partial lexical scope */
240 { $$ = block_start(FALSE); }
243 /* A sequence of statements in the program */
247 { $$ = op_append_list(OP_LINESEQ, $1, $2);
248 PL_pad_reset_pending = TRUE;
250 PL_hints |= HINT_BLOCK_SCOPE;
254 /* A sequence of format lines */
255 formstmtseq: /* NULL */
257 | formstmtseq formline
258 { $$ = op_append_list(OP_LINESEQ, $1, $2);
259 PL_pad_reset_pending = TRUE;
261 PL_hints |= HINT_BLOCK_SCOPE;
265 /* A statement in the program, including optional labels */
269 $$ = newSTATEOP(0, NULL, $1);
271 $$ = IF_MAD(newOP(OP_NULL, 0), NULL);
278 labfullstmt: LABEL barestmt
280 $$ = newSTATEOP(SVf_UTF8
281 * PVAL($1)[strlen(PVAL($1))+1],
284 $2 ? cLISTOPx($$)->op_first : $$, 'L');
288 $$ = newSTATEOP(SVf_UTF8
289 * PVAL($1)[strlen(PVAL($1))+1],
291 TOKEN_GETMAD($1, cLISTOPx($$)->op_first, 'L');
295 /* A bare statement, lacking label and other aspects of state op */
300 $$ = newOP(OP_NULL,0);
301 TOKEN_GETMAD($1,$$,'p');
303 | FORMAT startformsub formname formblock
305 CV *fmtcv = PL_compcv;
307 $$ = newFORM($2, $3, $4);
308 prepend_madprops($1->tk_mad, $$, 'F');
315 if (CvOUTSIDE(fmtcv) && !CvEVAL(CvOUTSIDE(fmtcv))) {
316 SvREFCNT_inc_simple_void(fmtcv);
317 pad_add_anon(fmtcv, OP_NULL);
320 | SUB subname startsub
322 if ($2->op_type == OP_CONST) {
323 const char *const name =
324 SvPV_nolen_const(((SVOP*)$2)->op_sv);
325 if (strEQ(name, "BEGIN") || strEQ(name, "END")
326 || strEQ(name, "INIT") || strEQ(name, "CHECK")
327 || strEQ(name, "UNITCHECK"))
328 CvSPECIAL_on(PL_compcv);
331 /* State subs inside anonymous subs need to be
332 clonable themselves. */
333 if (CvANON(CvOUTSIDE(PL_compcv))
334 || CvCLONE(CvOUTSIDE(PL_compcv))
335 || !PadnameIsSTATE(PadlistNAMESARRAY(CvPADLIST(
338 CvCLONE_on(PL_compcv);
339 PL_parser->in_my = 0;
340 PL_parser->in_my_stash = NULL;
342 proto subattrlist optsubbody
344 SvREFCNT_inc_simple_void(PL_compcv);
347 OP* o = newSVOP(OP_ANONCODE, 0,
350 $2->op_type == OP_CONST
351 ? newATTRSUB($3, $2, $5, $6, $7)
352 : newMYSUB($3, $2, $5, $6, $7)
355 $$ = newOP(OP_NULL,0);
357 op_getmad($2,$$,'n');
358 op_getmad($5,$$,'s');
359 op_getmad($6,$$,'a');
360 token_getmad($1,$$,'d');
361 append_madprops($7->op_madprop, $$, 0);
370 | PACKAGE WORD WORD ';'
374 token_getmad($1,$$,'o');
377 token_getmad($4,$$,';');
386 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
387 WORD WORD optlistexpr ';'
389 SvREFCNT_inc_simple_void(PL_compcv);
391 $$ = utilize(IVAL($1), $2, $4, $5, $6);
392 token_getmad($1,$$,'o');
393 token_getmad($7,$$,';');
394 if (PL_parser->rsfp_filters &&
395 AvFILLp(PL_parser->rsfp_filters) >= 0)
396 append_madprops(newMADPROP('!', MAD_NULL, NULL, 0), $$, 0);
398 utilize(IVAL($1), $2, $4, $5, $6);
402 | IF '(' remember mexpr ')' mblock else
405 newCONDOP(0, $4, op_scope($6), $7));
406 TOKEN_GETMAD($1,$$,'I');
407 TOKEN_GETMAD($2,$$,'(');
408 TOKEN_GETMAD($5,$$,')');
409 PL_parser->copline = (line_t)IVAL($1);
411 | UNLESS '(' remember miexpr ')' mblock else
414 newCONDOP(0, $4, op_scope($6), $7));
415 TOKEN_GETMAD($1,$$,'I');
416 TOKEN_GETMAD($2,$$,'(');
417 TOKEN_GETMAD($5,$$,')');
418 PL_parser->copline = (line_t)IVAL($1);
420 | GIVEN '(' remember mexpr ')' mblock
422 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
424 newGIVENOP($4, op_scope($6),
426 || PAD_COMPNAME_FLAGS_isOUR(offset)
429 PL_parser->copline = (line_t)IVAL($1);
431 | WHEN '(' remember mexpr ')' mblock
432 { $$ = block_end($3, newWHENOP($4, op_scope($6))); }
434 { $$ = newWHENOP(0, op_scope($2)); }
435 | WHILE '(' remember texpr ')' mintro mblock cont
438 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
440 TOKEN_GETMAD($1,$$,'W');
441 TOKEN_GETMAD($2,$$,'(');
442 TOKEN_GETMAD($5,$$,')');
443 PL_parser->copline = (line_t)IVAL($1);
445 | UNTIL '(' remember iexpr ')' mintro mblock cont
448 newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
450 TOKEN_GETMAD($1,$$,'W');
451 TOKEN_GETMAD($2,$$,'(');
452 TOKEN_GETMAD($5,$$,')');
453 PL_parser->copline = (line_t)IVAL($1);
455 | FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
458 OP *initop = IF_MAD($4 ? $4 : newOP(OP_NULL, 0), $4);
459 OP *forop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
460 scalar($6), $11, $9, $8);
462 forop = op_prepend_elem(OP_LINESEQ, initop,
463 op_append_elem(OP_LINESEQ,
464 newOP(OP_UNSTACK, OPf_SPECIAL),
467 DO_MAD({ forop = newUNOP(OP_NULL, 0, forop); })
468 $$ = block_end($3, forop);
469 TOKEN_GETMAD($1,$$,'3');
470 TOKEN_GETMAD($2,$$,'(');
471 TOKEN_GETMAD($5,$$,'1');
472 TOKEN_GETMAD($7,$$,'2');
473 TOKEN_GETMAD($10,$$,')');
474 PL_parser->copline = (line_t)IVAL($1);
476 | FOR MY remember my_scalar '(' mexpr ')' mblock cont
478 $$ = block_end($3, newFOROP(0, $4, $6, $8, $9));
479 TOKEN_GETMAD($1,$$,'W');
480 TOKEN_GETMAD($2,$$,'d');
481 TOKEN_GETMAD($5,$$,'(');
482 TOKEN_GETMAD($7,$$,')');
483 PL_parser->copline = (line_t)IVAL($1);
485 | FOR scalar '(' remember mexpr ')' mblock cont
487 $$ = block_end($4, newFOROP(0,
488 op_lvalue($2, OP_ENTERLOOP), $5, $7, $8));
489 TOKEN_GETMAD($1,$$,'W');
490 TOKEN_GETMAD($3,$$,'(');
491 TOKEN_GETMAD($6,$$,')');
492 PL_parser->copline = (line_t)IVAL($1);
494 | FOR '(' remember mexpr ')' mblock cont
497 newFOROP(0, (OP*)NULL, $4, $6, $7));
498 TOKEN_GETMAD($1,$$,'W');
499 TOKEN_GETMAD($2,$$,'(');
500 TOKEN_GETMAD($5,$$,')');
501 PL_parser->copline = (line_t)IVAL($1);
505 /* a block is a loop that happens once */
506 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
507 (OP*)NULL, $1, $2, 0);
509 | PACKAGE WORD WORD '{' remember
518 /* a block is a loop that happens once */
519 $$ = newWHILEOP(0, 1, (LOOP*)(OP*)NULL,
520 (OP*)NULL, block_end($5, $7), (OP*)NULL, 0);
521 TOKEN_GETMAD($4,$$,'{');
522 TOKEN_GETMAD($8,$$,'}');
523 if (PL_parser->copline > (line_t)IVAL($4))
524 PL_parser->copline = (line_t)IVAL($4);
528 PL_parser->expect = XSTATE;
530 TOKEN_GETMAD($2,$$,';');
534 PL_parser->expect = XSTATE;
535 $$ = IF_MAD(newOP(OP_NULL, 0), (OP*)NULL);
536 TOKEN_GETMAD($1,$$,';');
537 PL_parser->copline = NOLINE;
542 formline: THING formarg
546 DO_MAD(term = newUNOP(OP_NULL, 0, term));
547 list = op_append_elem(OP_LIST, $1, term);
551 OP *op = newNULLLIST();
552 list = op_append_elem(OP_LIST, $1, op);
557 if (PL_parser->copline == NOLINE)
558 PL_parser->copline = CopLINE(PL_curcop)-1;
559 else PL_parser->copline--;
560 $$ = newSTATEOP(0, NULL,
561 convert(OP_FORMLINE, 0, list));
567 | FORMLBRACK stmtseq FORMRBRACK
568 { $$ = op_unscope($2); }
571 /* An expression which may have a side-effect */
577 { $$ = newLOGOP(OP_AND, 0, $3, $1);
578 TOKEN_GETMAD($2,$$,'i');
581 { $$ = newLOGOP(OP_OR, 0, $3, $1);
582 TOKEN_GETMAD($2,$$,'i');
585 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1);
586 TOKEN_GETMAD($2,$$,'w');
589 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);
590 TOKEN_GETMAD($2,$$,'w');
593 { $$ = newFOROP(0, (OP*)NULL, $3, $1, (OP*)NULL);
594 TOKEN_GETMAD($2,$$,'w');
595 PL_parser->copline = (line_t)IVAL($2);
598 { $$ = newWHENOP($3, op_scope($1)); }
601 /* else and elsif blocks */
606 ($2)->op_flags |= OPf_PARENS;
608 TOKEN_GETMAD($1,$$,'o');
610 | ELSIF '(' mexpr ')' mblock else
611 { PL_parser->copline = (line_t)IVAL($1);
613 newSTATEOP(OPf_SPECIAL,NULL,$3),
615 PL_hints |= HINT_BLOCK_SCOPE;
616 TOKEN_GETMAD($1,$$,'I');
617 TOKEN_GETMAD($2,$$,'(');
618 TOKEN_GETMAD($4,$$,')');
622 /* Continue blocks */
628 TOKEN_GETMAD($1,$$,'o');
632 /* determine whether there are any new my declarations */
634 { $$ = (PL_min_intro_pending &&
635 PL_max_intro_pending >= PL_min_intro_pending);
638 /* Normal expression */
644 /* Boolean expression */
645 texpr : /* NULL means true */
647 (void)scan_num("1", &tmplval);
648 $$ = tmplval.opval; }
652 /* Inverted boolean expression */
654 { $$ = invert(scalar($1)); }
657 /* Expression with its own lexical scope */
659 { $$ = $1; intro_my(); }
663 { $$ = $1; intro_my(); }
667 { $$ = $1; intro_my(); }
670 formname: WORD { $$ = $1; }
671 | /* NULL */ { $$ = (OP*)NULL; }
674 startsub: /* NULL */ /* start a regular subroutine scope */
675 { $$ = start_subparse(FALSE, 0);
676 SAVEFREESV(PL_compcv); }
680 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
681 { $$ = start_subparse(FALSE, CVf_ANON);
682 SAVEFREESV(PL_compcv); }
685 startformsub: /* NULL */ /* start a format subroutine scope */
686 { $$ = start_subparse(TRUE, 0);
687 SAVEFREESV(PL_compcv); }
690 /* Name of a subroutine - must be a bareword, could be special */
695 /* Subroutine prototype */
701 /* Optional list of subroutine attributes */
702 subattrlist: /* NULL */
706 TOKEN_GETMAD($1,$$,':');
713 TOKEN_GETMAD($1,$$,':');
717 /* List of attributes for a "my" variable declaration */
718 myattrlist: COLONATTR THING
720 TOKEN_GETMAD($1,$$,':');
727 TOKEN_GETMAD($1,$$,':');
731 /* Optional subroutine signature */
732 subsignature: /* NULL */ { $$ = (OP*)NULL; }
735 if (!FEATURE_SIGNATURES_IS_ENABLED)
736 Perl_croak(aTHX_ "Experimental "
737 "subroutine signatures not enabled");
738 Perl_ck_warner_d(aTHX_
739 packWARN(WARN_EXPERIMENTAL__SIGNATURES),
740 "The signatures feature is experimental");
741 $<opval>$ = parse_subsignature();
745 $$ = op_append_list(OP_LINESEQ, $<opval>2,
746 newSTATEOP(0, NULL, sawparens(newNULLLIST())));
747 PL_parser->expect = XBLOCK;
751 /* Subroutine body - block with optional signature */
752 realsubbody: remember subsignature '{' stmtseq '}'
754 if (PL_parser->copline > (line_t)IVAL($3))
755 PL_parser->copline = (line_t)IVAL($3);
757 op_append_list(OP_LINESEQ, $2, $4));
758 TOKEN_GETMAD($3,$$,'{');
759 TOKEN_GETMAD($5,$$,'}');
763 /* Optional subroutine body, for named subroutine declaration */
764 optsubbody: realsubbody { $$ = $1; }
769 PL_parser->expect = XSTATE;
770 TOKEN_GETMAD($1,$$,';');
774 /* Ordinary expressions; logical combinations */
775 expr : expr ANDOP expr
776 { $$ = newLOGOP(OP_AND, 0, $1, $3);
777 TOKEN_GETMAD($2,$$,'o');
780 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
781 TOKEN_GETMAD($2,$$,'o');
784 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
785 TOKEN_GETMAD($2,$$,'o');
787 | listexpr %prec PREC_LOW
790 /* Expressions are a list of terms joined by commas */
791 listexpr: listexpr ','
794 OP* op = newNULLLIST();
795 token_getmad($2,op,',');
796 $$ = op_append_elem(OP_LIST, $1, op);
805 term = newUNOP(OP_NULL, 0, term);
806 token_getmad($2,term,',');
808 $$ = op_append_elem(OP_LIST, $1, term);
810 | term %prec PREC_LOW
814 listop : LSTOP indirob listexpr /* map {...} @args or print $fh @args */
815 { $$ = convert(IVAL($1), OPf_STACKED,
816 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
817 TOKEN_GETMAD($1,$$,'o');
819 | FUNC '(' indirob expr ')' /* print ($fh @args */
820 { $$ = convert(IVAL($1), OPf_STACKED,
821 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
822 TOKEN_GETMAD($1,$$,'o');
823 TOKEN_GETMAD($2,$$,'(');
824 TOKEN_GETMAD($5,$$,')');
826 | term ARROW method '(' optexpr ')' /* $foo->bar(list) */
827 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
828 op_append_elem(OP_LIST,
829 op_prepend_elem(OP_LIST, scalar($1), $5),
830 newUNOP(OP_METHOD, 0, $3)));
831 TOKEN_GETMAD($2,$$,'A');
832 TOKEN_GETMAD($4,$$,'(');
833 TOKEN_GETMAD($6,$$,')');
835 | term ARROW method /* $foo->bar */
836 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
837 op_append_elem(OP_LIST, scalar($1),
838 newUNOP(OP_METHOD, 0, $3)));
839 TOKEN_GETMAD($2,$$,'A');
841 | METHOD indirob optlistexpr /* new Class @args */
842 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
843 op_append_elem(OP_LIST,
844 op_prepend_elem(OP_LIST, $2, $3),
845 newUNOP(OP_METHOD, 0, $1)));
847 | FUNCMETH indirob '(' optexpr ')' /* method $object (@args) */
848 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
849 op_append_elem(OP_LIST,
850 op_prepend_elem(OP_LIST, $2, $4),
851 newUNOP(OP_METHOD, 0, $1)));
852 TOKEN_GETMAD($3,$$,'(');
853 TOKEN_GETMAD($5,$$,')');
855 | LSTOP optlistexpr /* print @args */
856 { $$ = convert(IVAL($1), 0, $2);
857 TOKEN_GETMAD($1,$$,'o');
859 | FUNC '(' optexpr ')' /* print (@args) */
860 { $$ = convert(IVAL($1), 0, $3);
861 TOKEN_GETMAD($1,$$,'o');
862 TOKEN_GETMAD($2,$$,'(');
863 TOKEN_GETMAD($4,$$,')');
865 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
866 { SvREFCNT_inc_simple_void(PL_compcv);
867 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
868 optlistexpr %prec LSTOP /* ... @bar */
869 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
870 op_append_elem(OP_LIST,
871 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
875 /* Names of methods. May use $object->$methodname */
880 /* Some kind of subscripted expression */
881 subscripted: gelem '{' expr ';' '}' /* *main::{something} */
882 /* In this and all the hash accessors, ';' is
883 * provided by the tokeniser */
884 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
885 PL_parser->expect = XOPERATOR;
886 TOKEN_GETMAD($2,$$,'{');
887 TOKEN_GETMAD($4,$$,';');
888 TOKEN_GETMAD($5,$$,'}');
890 | scalar '[' expr ']' /* $array[$element] */
891 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
892 TOKEN_GETMAD($2,$$,'[');
893 TOKEN_GETMAD($4,$$,']');
895 | term ARROW '[' expr ']' /* somearef->[$element] */
896 { $$ = newBINOP(OP_AELEM, 0,
897 ref(newAVREF($1),OP_RV2AV),
899 TOKEN_GETMAD($2,$$,'a');
900 TOKEN_GETMAD($3,$$,'[');
901 TOKEN_GETMAD($5,$$,']');
903 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
904 { $$ = newBINOP(OP_AELEM, 0,
905 ref(newAVREF($1),OP_RV2AV),
907 TOKEN_GETMAD($2,$$,'[');
908 TOKEN_GETMAD($4,$$,']');
910 | scalar '{' expr ';' '}' /* $foo{bar();} */
911 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
912 PL_parser->expect = XOPERATOR;
913 TOKEN_GETMAD($2,$$,'{');
914 TOKEN_GETMAD($4,$$,';');
915 TOKEN_GETMAD($5,$$,'}');
917 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
918 { $$ = newBINOP(OP_HELEM, 0,
919 ref(newHVREF($1),OP_RV2HV),
921 PL_parser->expect = XOPERATOR;
922 TOKEN_GETMAD($2,$$,'a');
923 TOKEN_GETMAD($3,$$,'{');
924 TOKEN_GETMAD($5,$$,';');
925 TOKEN_GETMAD($6,$$,'}');
927 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
928 { $$ = newBINOP(OP_HELEM, 0,
929 ref(newHVREF($1),OP_RV2HV),
931 PL_parser->expect = XOPERATOR;
932 TOKEN_GETMAD($2,$$,'{');
933 TOKEN_GETMAD($4,$$,';');
934 TOKEN_GETMAD($5,$$,'}');
936 | term ARROW '(' ')' /* $subref->() */
937 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
938 newCVREF(0, scalar($1)));
939 TOKEN_GETMAD($2,$$,'a');
940 TOKEN_GETMAD($3,$$,'(');
941 TOKEN_GETMAD($4,$$,')');
943 | term ARROW '(' expr ')' /* $subref->(@args) */
944 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
945 op_append_elem(OP_LIST, $4,
946 newCVREF(0, scalar($1))));
947 TOKEN_GETMAD($2,$$,'a');
948 TOKEN_GETMAD($3,$$,'(');
949 TOKEN_GETMAD($5,$$,')');
952 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
953 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
954 op_append_elem(OP_LIST, $3,
955 newCVREF(0, scalar($1))));
956 TOKEN_GETMAD($2,$$,'(');
957 TOKEN_GETMAD($4,$$,')');
959 | subscripted '(' ')' /* $foo->{bar}->() */
960 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
961 newCVREF(0, scalar($1)));
962 TOKEN_GETMAD($2,$$,'(');
963 TOKEN_GETMAD($3,$$,')');
965 | '(' expr ')' '[' expr ']' /* list slice */
966 { $$ = newSLICEOP(0, $5, $2);
967 TOKEN_GETMAD($1,$$,'(');
968 TOKEN_GETMAD($3,$$,')');
969 TOKEN_GETMAD($4,$$,'[');
970 TOKEN_GETMAD($6,$$,']');
972 | QWLIST '[' expr ']' /* list literal slice */
973 { $$ = newSLICEOP(0, $3, $1);
974 TOKEN_GETMAD($2,$$,'[');
975 TOKEN_GETMAD($4,$$,']');
977 | '(' ')' '[' expr ']' /* empty list slice! */
978 { $$ = newSLICEOP(0, $4, (OP*)NULL);
979 TOKEN_GETMAD($1,$$,'(');
980 TOKEN_GETMAD($2,$$,')');
981 TOKEN_GETMAD($3,$$,'[');
982 TOKEN_GETMAD($5,$$,']');
986 /* Binary operators between terms */
987 termbinop: term ASSIGNOP term /* $x = $y */
988 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
989 TOKEN_GETMAD($2,$$,'o');
991 | term POWOP term /* $x ** $y */
992 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
993 TOKEN_GETMAD($2,$$,'o');
995 | term MULOP term /* $x * $y, $x x $y */
996 { if (IVAL($2) != OP_REPEAT)
998 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
999 TOKEN_GETMAD($2,$$,'o');
1001 | term ADDOP term /* $x + $y */
1002 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1003 TOKEN_GETMAD($2,$$,'o');
1005 | term SHIFTOP term /* $x >> $y, $x << $y */
1006 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1007 TOKEN_GETMAD($2,$$,'o');
1009 | term RELOP term /* $x > $y, etc. */
1010 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1011 TOKEN_GETMAD($2,$$,'o');
1013 | term EQOP term /* $x == $y, $x eq $y */
1014 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1015 TOKEN_GETMAD($2,$$,'o');
1017 | term BITANDOP term /* $x & $y */
1018 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1019 TOKEN_GETMAD($2,$$,'o');
1021 | term BITOROP term /* $x | $y */
1022 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
1023 TOKEN_GETMAD($2,$$,'o');
1025 | term DOTDOT term /* $x..$y, $x...$y */
1027 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
1031 op = (UNOP*)op->op_first; /* get to flop */
1032 op = (UNOP*)op->op_first; /* get to flip */
1033 op = (UNOP*)op->op_first; /* get to range */
1034 token_getmad($2,(OP*)op,'o');
1037 | term ANDAND term /* $x && $y */
1038 { $$ = newLOGOP(OP_AND, 0, $1, $3);
1039 TOKEN_GETMAD($2,$$,'o');
1041 | term OROR term /* $x || $y */
1042 { $$ = newLOGOP(OP_OR, 0, $1, $3);
1043 TOKEN_GETMAD($2,$$,'o');
1045 | term DORDOR term /* $x // $y */
1046 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
1047 TOKEN_GETMAD($2,$$,'o');
1049 | term MATCHOP term /* $x =~ /$y/ */
1050 { $$ = bind_match(IVAL($2), $1, $3);
1052 ($$->op_type == OP_NOT
1053 ? ((UNOP*)$$)->op_first : $$),
1058 /* Unary operators and terms */
1059 termunop : '-' term %prec UMINUS /* -$x */
1060 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
1061 TOKEN_GETMAD($1,$$,'o');
1063 | '+' term %prec UMINUS /* +$x */
1065 newUNOP(OP_NULL, 0, $2),
1068 TOKEN_GETMAD($1,$$,'+');
1070 | '!' term /* !$x */
1071 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1072 TOKEN_GETMAD($1,$$,'o');
1074 | '~' term /* ~$x */
1075 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
1076 TOKEN_GETMAD($1,$$,'o');
1078 | term POSTINC /* $x++ */
1079 { $$ = newUNOP(OP_POSTINC, 0,
1080 op_lvalue(scalar($1), OP_POSTINC));
1081 TOKEN_GETMAD($2,$$,'o');
1083 | term POSTDEC /* $x-- */
1084 { $$ = newUNOP(OP_POSTDEC, 0,
1085 op_lvalue(scalar($1), OP_POSTDEC));
1086 TOKEN_GETMAD($2,$$,'o');
1088 | term POSTJOIN /* implicit join after interpolated ->@ */
1089 { $$ = convert(OP_JOIN, 0,
1098 TOKEN_GETMAD($2,$$,'o');
1100 | PREINC term /* ++$x */
1101 { $$ = newUNOP(OP_PREINC, 0,
1102 op_lvalue(scalar($2), OP_PREINC));
1103 TOKEN_GETMAD($1,$$,'o');
1105 | PREDEC term /* --$x */
1106 { $$ = newUNOP(OP_PREDEC, 0,
1107 op_lvalue(scalar($2), OP_PREDEC));
1108 TOKEN_GETMAD($1,$$,'o');
1113 /* Constructors for anonymous data */
1114 anonymous: '[' expr ']'
1115 { $$ = newANONLIST($2);
1116 TOKEN_GETMAD($1,$$,'[');
1117 TOKEN_GETMAD($3,$$,']');
1120 { $$ = newANONLIST((OP*)NULL);
1121 TOKEN_GETMAD($1,$$,'[');
1122 TOKEN_GETMAD($2,$$,']');
1124 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1125 { $$ = newANONHASH($2);
1126 TOKEN_GETMAD($1,$$,'{');
1127 TOKEN_GETMAD($3,$$,';');
1128 TOKEN_GETMAD($4,$$,'}');
1130 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1131 { $$ = newANONHASH((OP*)NULL);
1132 TOKEN_GETMAD($1,$$,'{');
1133 TOKEN_GETMAD($2,$$,';');
1134 TOKEN_GETMAD($3,$$,'}');
1136 | ANONSUB startanonsub proto subattrlist realsubbody %prec '('
1137 { SvREFCNT_inc_simple_void(PL_compcv);
1138 $$ = newANONATTRSUB($2, $3, $4, $5);
1139 TOKEN_GETMAD($1,$$,'o');
1140 OP_GETMAD($3,$$,'s');
1141 OP_GETMAD($4,$$,'a');
1146 /* Things called with "do" */
1147 termdo : DO term %prec UNIOP /* do $filename */
1148 { $$ = dofile($2, IVAL($1));
1149 TOKEN_GETMAD($1,$$,'o');
1151 | DO block %prec '(' /* do { code */
1152 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1153 TOKEN_GETMAD($1,$$,'D');
1161 | term '?' term ':' term
1162 { $$ = newCONDOP(0, $1, $3, $5);
1163 TOKEN_GETMAD($2,$$,'?');
1164 TOKEN_GETMAD($4,$$,':');
1166 | REFGEN term /* \$x, \@y, \%z */
1167 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1168 TOKEN_GETMAD($1,$$,'o');
1170 | myattrterm %prec UNIOP
1172 | LOCAL term %prec UNIOP
1173 { $$ = localize($2,IVAL($1));
1174 TOKEN_GETMAD($1,$$,'k');
1177 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1178 TOKEN_GETMAD($1,$$,'(');
1179 TOKEN_GETMAD($3,$$,')');
1182 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1184 { $$ = sawparens(newNULLLIST());
1185 TOKEN_GETMAD($1,$$,'(');
1186 TOKEN_GETMAD($2,$$,')');
1196 | arylen %prec '(' /* $#x, $#{ something } */
1197 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1200 | sliceme '[' expr ']' /* array slice */
1201 { $$ = op_prepend_elem(OP_ASLICE,
1202 newOP(OP_PUSHMARK, 0),
1203 newLISTOP(OP_ASLICE, 0,
1205 ref($1, OP_ASLICE)));
1208 $1->op_private & OPpSLICEWARNING;
1209 TOKEN_GETMAD($2,$$,'[');
1210 TOKEN_GETMAD($4,$$,']');
1212 | kvslice '[' expr ']' /* array key/value slice */
1213 { $$ = op_prepend_elem(OP_KVASLICE,
1214 newOP(OP_PUSHMARK, 0),
1215 newLISTOP(OP_KVASLICE, 0,
1217 ref(oopsAV($1), OP_KVASLICE)));
1220 $1->op_private & OPpSLICEWARNING;
1221 TOKEN_GETMAD($2,$$,'[');
1222 TOKEN_GETMAD($4,$$,']');
1224 | sliceme '{' expr ';' '}' /* @hash{@keys} */
1225 { $$ = op_prepend_elem(OP_HSLICE,
1226 newOP(OP_PUSHMARK, 0),
1227 newLISTOP(OP_HSLICE, 0,
1229 ref(oopsHV($1), OP_HSLICE)));
1232 $1->op_private & OPpSLICEWARNING;
1233 PL_parser->expect = XOPERATOR;
1234 TOKEN_GETMAD($2,$$,'{');
1235 TOKEN_GETMAD($4,$$,';');
1236 TOKEN_GETMAD($5,$$,'}');
1238 | kvslice '{' expr ';' '}' /* %hash{@keys} */
1239 { $$ = op_prepend_elem(OP_KVHSLICE,
1240 newOP(OP_PUSHMARK, 0),
1241 newLISTOP(OP_KVHSLICE, 0,
1243 ref($1, OP_KVHSLICE)));
1246 $1->op_private & OPpSLICEWARNING;
1247 PL_parser->expect = XOPERATOR;
1248 TOKEN_GETMAD($2,$$,'{');
1249 TOKEN_GETMAD($4,$$,';');
1250 TOKEN_GETMAD($5,$$,'}');
1255 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1256 | amper '(' ')' /* &foo() or foo() */
1257 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1258 TOKEN_GETMAD($2,$$,'(');
1259 TOKEN_GETMAD($3,$$,')');
1261 | amper '(' expr ')' /* &foo(@args) or foo(@args) */
1263 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1264 op_append_elem(OP_LIST, $3, scalar($1)));
1267 if (op->op_type == OP_CONST) { /* defeat const fold */
1268 op = (OP*)op->op_madprop->mad_val;
1270 token_getmad($2,op,'(');
1271 token_getmad($4,op,')');
1274 | NOAMP subname optlistexpr /* foo @args (no parens) */
1275 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1276 op_append_elem(OP_LIST, $3, scalar($2)));
1277 TOKEN_GETMAD($1,$$,'o');
1279 | term ARROW '$' '*'
1280 { $$ = newSVREF($1);
1281 TOKEN_GETMAD($3,$$,'$');
1283 | term ARROW '@' '*'
1284 { $$ = newAVREF($1);
1285 TOKEN_GETMAD($3,$$,'@');
1287 | term ARROW '%' '*'
1288 { $$ = newHVREF($1);
1289 TOKEN_GETMAD($3,$$,'%');
1291 | term ARROW '&' '*'
1292 { $$ = newUNOP(OP_ENTERSUB, 0,
1293 scalar(newCVREF(IVAL($3),$1)));
1294 TOKEN_GETMAD($3,$$,'&');
1296 | term ARROW '*' '*' %prec '('
1297 { $$ = newGVREF(0,$1);
1298 TOKEN_GETMAD($3,$$,'*');
1300 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1301 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1302 PL_hints |= HINT_BLOCK_SCOPE;
1303 TOKEN_GETMAD($1,$$,'o');
1306 { $$ = newLOOPEX(IVAL($1),$2);
1307 TOKEN_GETMAD($1,$$,'o');
1309 | NOTOP listexpr /* not $foo */
1310 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1311 TOKEN_GETMAD($1,$$,'o');
1313 | UNIOP /* Unary op, $_ implied */
1314 { $$ = newOP(IVAL($1), 0);
1315 TOKEN_GETMAD($1,$$,'o');
1317 | UNIOP block /* eval { foo }* */
1318 { $$ = newUNOP(IVAL($1), 0, $2);
1319 TOKEN_GETMAD($1,$$,'o');
1321 | UNIOP term /* Unary op */
1322 { $$ = newUNOP(IVAL($1), 0, $2);
1323 TOKEN_GETMAD($1,$$,'o');
1325 | REQUIRE /* require, $_ implied */
1326 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1327 TOKEN_GETMAD($1,$$,'o');
1329 | REQUIRE term /* require Foo */
1330 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1331 TOKEN_GETMAD($1,$$,'o');
1334 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1335 | UNIOPSUB term /* Sub treated as unop */
1336 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1337 op_append_elem(OP_LIST, $2, scalar($1))); }
1338 | FUNC0 /* Nullary operator */
1339 { $$ = newOP(IVAL($1), 0);
1340 TOKEN_GETMAD($1,$$,'o');
1343 { $$ = newOP(IVAL($1), 0);
1344 TOKEN_GETMAD($1,$$,'o');
1345 TOKEN_GETMAD($2,$$,'(');
1346 TOKEN_GETMAD($3,$$,')');
1348 | FUNC0OP /* Same as above, but op created in toke.c */
1352 TOKEN_GETMAD($2,$$,'(');
1353 TOKEN_GETMAD($3,$$,')');
1355 | FUNC0SUB /* Sub treated as nullop */
1356 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1358 | FUNC1 '(' ')' /* not () */
1359 { $$ = (IVAL($1) == OP_NOT)
1360 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1361 : newOP(IVAL($1), OPf_SPECIAL);
1363 TOKEN_GETMAD($1,$$,'o');
1364 TOKEN_GETMAD($2,$$,'(');
1365 TOKEN_GETMAD($3,$$,')');
1367 | FUNC1 '(' expr ')' /* not($foo) */
1368 { $$ = newUNOP(IVAL($1), 0, $3);
1369 TOKEN_GETMAD($1,$$,'o');
1370 TOKEN_GETMAD($2,$$,'(');
1371 TOKEN_GETMAD($4,$$,')');
1373 | PMFUNC /* m//, s///, qr//, tr/// */
1375 if ( $1->op_type != OP_TRANS
1376 && $1->op_type != OP_TRANSR
1377 && (((PMOP*)$1)->op_pmflags & PMf_HAS_CV))
1379 $<ival>$ = start_subparse(FALSE, CVf_ANON);
1380 SAVEFREESV(PL_compcv);
1385 { $$ = pmruntime($1, $4, 1, $<ival>2);
1386 TOKEN_GETMAD($3,$$,'(');
1387 TOKEN_GETMAD($5,$$,')');
1393 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1394 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1395 TOKEN_GETMAD($1,$$,'X');
1400 /* "my" declarations, with optional attributes */
1401 myattrterm: MY myterm myattrlist
1402 { $$ = my_attrs($2,$3);
1404 token_getmad($1,$$,'d');
1405 append_madprops($3->op_madprop, $$, 'a');
1410 { $$ = localize($2,IVAL($1));
1411 TOKEN_GETMAD($1,$$,'d');
1415 /* Things that can be "my"'d */
1416 myterm : '(' expr ')'
1417 { $$ = sawparens($2);
1418 TOKEN_GETMAD($1,$$,'(');
1419 TOKEN_GETMAD($3,$$,')');
1422 { $$ = sawparens(newNULLLIST());
1423 TOKEN_GETMAD($1,$$,'(');
1424 TOKEN_GETMAD($2,$$,')');
1434 /* Basic list expressions */
1435 optlistexpr: /* NULL */ %prec PREC_LOW
1437 | listexpr %prec PREC_LOW
1447 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1450 { PL_parser->in_my = 0; $$ = my($1); }
1454 { $$ = newCVREF(IVAL($1),$2);
1455 TOKEN_GETMAD($1,$$,'&');
1459 scalar : '$' indirob
1460 { $$ = newSVREF($2);
1461 TOKEN_GETMAD($1,$$,'$');
1466 { $$ = newAVREF($2);
1467 if ($$) $$->op_private |= IVAL($1);
1468 TOKEN_GETMAD($1,$$,'@');
1473 { $$ = newHVREF($2);
1474 if ($$) $$->op_private |= IVAL($1);
1475 TOKEN_GETMAD($1,$$,'%');
1479 arylen : DOLSHARP indirob
1480 { $$ = newAVREF($2);
1481 TOKEN_GETMAD($1,$$,'l');
1483 | term ARROW DOLSHARP '*'
1484 { $$ = newAVREF($1);
1485 TOKEN_GETMAD($3,$$,'l');
1490 { $$ = newGVREF(0,$2);
1491 TOKEN_GETMAD($1,$$,'*');
1497 { $$ = newAVREF($1);
1498 TOKEN_GETMAD($3,$$,'@');
1504 { $$ = newHVREF($1);
1505 TOKEN_GETMAD($3,$$,'@');
1511 { $$ = newGVREF(0,$1);
1512 TOKEN_GETMAD($3,$$,'*');
1516 /* Indirect objects */
1518 { $$ = scalar($1); }
1519 | scalar %prec PREC_LOW
1520 { $$ = scalar($1); }
1522 { $$ = op_scope($1); }