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 subbody cont my_scalar formblock
101 %type <opval> subattrlist myattrlist myattrterm myterm
102 %type <opval> 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 subbody
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 /* Subroutine body - either null or a block */
732 subbody : block { $$ = $1; }
737 PL_parser->expect = XSTATE;
738 TOKEN_GETMAD($1,$$,';');
742 /* Ordinary expressions; logical combinations */
743 expr : expr ANDOP expr
744 { $$ = newLOGOP(OP_AND, 0, $1, $3);
745 TOKEN_GETMAD($2,$$,'o');
748 { $$ = newLOGOP(IVAL($2), 0, $1, $3);
749 TOKEN_GETMAD($2,$$,'o');
752 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
753 TOKEN_GETMAD($2,$$,'o');
755 | listexpr %prec PREC_LOW
758 /* Expressions are a list of terms joined by commas */
759 listexpr: listexpr ','
762 OP* op = newNULLLIST();
763 token_getmad($2,op,',');
764 $$ = op_append_elem(OP_LIST, $1, op);
773 term = newUNOP(OP_NULL, 0, term);
774 token_getmad($2,term,',');
776 $$ = op_append_elem(OP_LIST, $1, term);
778 | term %prec PREC_LOW
782 listop : LSTOP indirob listexpr /* map {...} @args or print $fh @args */
783 { $$ = convert(IVAL($1), OPf_STACKED,
784 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) );
785 TOKEN_GETMAD($1,$$,'o');
787 | FUNC '(' indirob expr ')' /* print ($fh @args */
788 { $$ = convert(IVAL($1), OPf_STACKED,
789 op_prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) );
790 TOKEN_GETMAD($1,$$,'o');
791 TOKEN_GETMAD($2,$$,'(');
792 TOKEN_GETMAD($5,$$,')');
794 | term ARROW method '(' optexpr ')' /* $foo->bar(list) */
795 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
796 op_append_elem(OP_LIST,
797 op_prepend_elem(OP_LIST, scalar($1), $5),
798 newUNOP(OP_METHOD, 0, $3)));
799 TOKEN_GETMAD($2,$$,'A');
800 TOKEN_GETMAD($4,$$,'(');
801 TOKEN_GETMAD($6,$$,')');
803 | term ARROW method /* $foo->bar */
804 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
805 op_append_elem(OP_LIST, scalar($1),
806 newUNOP(OP_METHOD, 0, $3)));
807 TOKEN_GETMAD($2,$$,'A');
809 | METHOD indirob optlistexpr /* new Class @args */
810 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
811 op_append_elem(OP_LIST,
812 op_prepend_elem(OP_LIST, $2, $3),
813 newUNOP(OP_METHOD, 0, $1)));
815 | FUNCMETH indirob '(' optexpr ')' /* method $object (@args) */
816 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
817 op_append_elem(OP_LIST,
818 op_prepend_elem(OP_LIST, $2, $4),
819 newUNOP(OP_METHOD, 0, $1)));
820 TOKEN_GETMAD($3,$$,'(');
821 TOKEN_GETMAD($5,$$,')');
823 | LSTOP optlistexpr /* print @args */
824 { $$ = convert(IVAL($1), 0, $2);
825 TOKEN_GETMAD($1,$$,'o');
827 | FUNC '(' optexpr ')' /* print (@args) */
828 { $$ = convert(IVAL($1), 0, $3);
829 TOKEN_GETMAD($1,$$,'o');
830 TOKEN_GETMAD($2,$$,'(');
831 TOKEN_GETMAD($4,$$,')');
833 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
834 { SvREFCNT_inc_simple_void(PL_compcv);
835 $<opval>$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); }
836 optlistexpr %prec LSTOP /* ... @bar */
837 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
838 op_append_elem(OP_LIST,
839 op_prepend_elem(OP_LIST, $<opval>4, $5), $1));
843 /* Names of methods. May use $object->$methodname */
848 /* Some kind of subscripted expression */
849 subscripted: gelem '{' expr ';' '}' /* *main::{something} */
850 /* In this and all the hash accessors, ';' is
851 * provided by the tokeniser */
852 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
853 PL_parser->expect = XOPERATOR;
854 TOKEN_GETMAD($2,$$,'{');
855 TOKEN_GETMAD($4,$$,';');
856 TOKEN_GETMAD($5,$$,'}');
858 | scalar '[' expr ']' /* $array[$element] */
859 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3));
860 TOKEN_GETMAD($2,$$,'[');
861 TOKEN_GETMAD($4,$$,']');
863 | term ARROW '[' expr ']' /* somearef->[$element] */
864 { $$ = newBINOP(OP_AELEM, 0,
865 ref(newAVREF($1),OP_RV2AV),
867 TOKEN_GETMAD($2,$$,'a');
868 TOKEN_GETMAD($3,$$,'[');
869 TOKEN_GETMAD($5,$$,']');
871 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
872 { $$ = newBINOP(OP_AELEM, 0,
873 ref(newAVREF($1),OP_RV2AV),
875 TOKEN_GETMAD($2,$$,'[');
876 TOKEN_GETMAD($4,$$,']');
878 | scalar '{' expr ';' '}' /* $foo{bar();} */
879 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
880 PL_parser->expect = XOPERATOR;
881 TOKEN_GETMAD($2,$$,'{');
882 TOKEN_GETMAD($4,$$,';');
883 TOKEN_GETMAD($5,$$,'}');
885 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
886 { $$ = newBINOP(OP_HELEM, 0,
887 ref(newHVREF($1),OP_RV2HV),
889 PL_parser->expect = XOPERATOR;
890 TOKEN_GETMAD($2,$$,'a');
891 TOKEN_GETMAD($3,$$,'{');
892 TOKEN_GETMAD($5,$$,';');
893 TOKEN_GETMAD($6,$$,'}');
895 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
896 { $$ = newBINOP(OP_HELEM, 0,
897 ref(newHVREF($1),OP_RV2HV),
899 PL_parser->expect = XOPERATOR;
900 TOKEN_GETMAD($2,$$,'{');
901 TOKEN_GETMAD($4,$$,';');
902 TOKEN_GETMAD($5,$$,'}');
904 | term ARROW '(' ')' /* $subref->() */
905 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
906 newCVREF(0, scalar($1)));
907 TOKEN_GETMAD($2,$$,'a');
908 TOKEN_GETMAD($3,$$,'(');
909 TOKEN_GETMAD($4,$$,')');
911 | term ARROW '(' expr ')' /* $subref->(@args) */
912 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
913 op_append_elem(OP_LIST, $4,
914 newCVREF(0, scalar($1))));
915 TOKEN_GETMAD($2,$$,'a');
916 TOKEN_GETMAD($3,$$,'(');
917 TOKEN_GETMAD($5,$$,')');
920 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
921 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
922 op_append_elem(OP_LIST, $3,
923 newCVREF(0, scalar($1))));
924 TOKEN_GETMAD($2,$$,'(');
925 TOKEN_GETMAD($4,$$,')');
927 | subscripted '(' ')' /* $foo->{bar}->() */
928 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
929 newCVREF(0, scalar($1)));
930 TOKEN_GETMAD($2,$$,'(');
931 TOKEN_GETMAD($3,$$,')');
933 | '(' expr ')' '[' expr ']' /* list slice */
934 { $$ = newSLICEOP(0, $5, $2);
935 TOKEN_GETMAD($1,$$,'(');
936 TOKEN_GETMAD($3,$$,')');
937 TOKEN_GETMAD($4,$$,'[');
938 TOKEN_GETMAD($6,$$,']');
940 | QWLIST '[' expr ']' /* list literal slice */
941 { $$ = newSLICEOP(0, $3, $1);
942 TOKEN_GETMAD($2,$$,'[');
943 TOKEN_GETMAD($4,$$,']');
945 | '(' ')' '[' expr ']' /* empty list slice! */
946 { $$ = newSLICEOP(0, $4, (OP*)NULL);
947 TOKEN_GETMAD($1,$$,'(');
948 TOKEN_GETMAD($2,$$,')');
949 TOKEN_GETMAD($3,$$,'[');
950 TOKEN_GETMAD($5,$$,']');
954 /* Binary operators between terms */
955 termbinop: term ASSIGNOP term /* $x = $y */
956 { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3);
957 TOKEN_GETMAD($2,$$,'o');
959 | term POWOP term /* $x ** $y */
960 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
961 TOKEN_GETMAD($2,$$,'o');
963 | term MULOP term /* $x * $y, $x x $y */
964 { if (IVAL($2) != OP_REPEAT)
966 $$ = newBINOP(IVAL($2), 0, $1, scalar($3));
967 TOKEN_GETMAD($2,$$,'o');
969 | term ADDOP term /* $x + $y */
970 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
971 TOKEN_GETMAD($2,$$,'o');
973 | term SHIFTOP term /* $x >> $y, $x << $y */
974 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
975 TOKEN_GETMAD($2,$$,'o');
977 | term RELOP term /* $x > $y, etc. */
978 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
979 TOKEN_GETMAD($2,$$,'o');
981 | term EQOP term /* $x == $y, $x eq $y */
982 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
983 TOKEN_GETMAD($2,$$,'o');
985 | term BITANDOP term /* $x & $y */
986 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
987 TOKEN_GETMAD($2,$$,'o');
989 | term BITOROP term /* $x | $y */
990 { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3));
991 TOKEN_GETMAD($2,$$,'o');
993 | term DOTDOT term /* $x..$y, $x...$y */
995 $$ = newRANGE(IVAL($2), scalar($1), scalar($3));
999 op = (UNOP*)op->op_first; /* get to flop */
1000 op = (UNOP*)op->op_first; /* get to flip */
1001 op = (UNOP*)op->op_first; /* get to range */
1002 token_getmad($2,(OP*)op,'o');
1005 | term ANDAND term /* $x && $y */
1006 { $$ = newLOGOP(OP_AND, 0, $1, $3);
1007 TOKEN_GETMAD($2,$$,'o');
1009 | term OROR term /* $x || $y */
1010 { $$ = newLOGOP(OP_OR, 0, $1, $3);
1011 TOKEN_GETMAD($2,$$,'o');
1013 | term DORDOR term /* $x // $y */
1014 { $$ = newLOGOP(OP_DOR, 0, $1, $3);
1015 TOKEN_GETMAD($2,$$,'o');
1017 | term MATCHOP term /* $x =~ /$y/ */
1018 { $$ = bind_match(IVAL($2), $1, $3);
1020 ($$->op_type == OP_NOT
1021 ? ((UNOP*)$$)->op_first : $$),
1026 /* Unary operators and terms */
1027 termunop : '-' term %prec UMINUS /* -$x */
1028 { $$ = newUNOP(OP_NEGATE, 0, scalar($2));
1029 TOKEN_GETMAD($1,$$,'o');
1031 | '+' term %prec UMINUS /* +$x */
1033 newUNOP(OP_NULL, 0, $2),
1036 TOKEN_GETMAD($1,$$,'+');
1038 | '!' term /* !$x */
1039 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1040 TOKEN_GETMAD($1,$$,'o');
1042 | '~' term /* ~$x */
1043 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));
1044 TOKEN_GETMAD($1,$$,'o');
1046 | term POSTINC /* $x++ */
1047 { $$ = newUNOP(OP_POSTINC, 0,
1048 op_lvalue(scalar($1), OP_POSTINC));
1049 TOKEN_GETMAD($2,$$,'o');
1051 | term POSTDEC /* $x-- */
1052 { $$ = newUNOP(OP_POSTDEC, 0,
1053 op_lvalue(scalar($1), OP_POSTDEC));
1054 TOKEN_GETMAD($2,$$,'o');
1056 | term POSTJOIN /* implicit join after interpolated ->@ */
1057 { $$ = convert(OP_JOIN, 0,
1066 TOKEN_GETMAD($2,$$,'o');
1068 | PREINC term /* ++$x */
1069 { $$ = newUNOP(OP_PREINC, 0,
1070 op_lvalue(scalar($2), OP_PREINC));
1071 TOKEN_GETMAD($1,$$,'o');
1073 | PREDEC term /* --$x */
1074 { $$ = newUNOP(OP_PREDEC, 0,
1075 op_lvalue(scalar($2), OP_PREDEC));
1076 TOKEN_GETMAD($1,$$,'o');
1081 /* Constructors for anonymous data */
1082 anonymous: '[' expr ']'
1083 { $$ = newANONLIST($2);
1084 TOKEN_GETMAD($1,$$,'[');
1085 TOKEN_GETMAD($3,$$,']');
1088 { $$ = newANONLIST((OP*)NULL);
1089 TOKEN_GETMAD($1,$$,'[');
1090 TOKEN_GETMAD($2,$$,']');
1092 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
1093 { $$ = newANONHASH($2);
1094 TOKEN_GETMAD($1,$$,'{');
1095 TOKEN_GETMAD($3,$$,';');
1096 TOKEN_GETMAD($4,$$,'}');
1098 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
1099 { $$ = newANONHASH((OP*)NULL);
1100 TOKEN_GETMAD($1,$$,'{');
1101 TOKEN_GETMAD($2,$$,';');
1102 TOKEN_GETMAD($3,$$,'}');
1104 | ANONSUB startanonsub proto subattrlist block %prec '('
1105 { SvREFCNT_inc_simple_void(PL_compcv);
1106 $$ = newANONATTRSUB($2, $3, $4, $5);
1107 TOKEN_GETMAD($1,$$,'o');
1108 OP_GETMAD($3,$$,'s');
1109 OP_GETMAD($4,$$,'a');
1114 /* Things called with "do" */
1115 termdo : DO term %prec UNIOP /* do $filename */
1116 { $$ = dofile($2, IVAL($1));
1117 TOKEN_GETMAD($1,$$,'o');
1119 | DO block %prec '(' /* do { code */
1120 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, op_scope($2));
1121 TOKEN_GETMAD($1,$$,'D');
1129 | term '?' term ':' term
1130 { $$ = newCONDOP(0, $1, $3, $5);
1131 TOKEN_GETMAD($2,$$,'?');
1132 TOKEN_GETMAD($4,$$,':');
1134 | REFGEN term /* \$x, \@y, \%z */
1135 { $$ = newUNOP(OP_REFGEN, 0, op_lvalue($2,OP_REFGEN));
1136 TOKEN_GETMAD($1,$$,'o');
1138 | myattrterm %prec UNIOP
1140 | LOCAL term %prec UNIOP
1141 { $$ = localize($2,IVAL($1));
1142 TOKEN_GETMAD($1,$$,'k');
1145 { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2));
1146 TOKEN_GETMAD($1,$$,'(');
1147 TOKEN_GETMAD($3,$$,')');
1150 { $$ = IF_MAD(newUNOP(OP_NULL,0,$1), $1); }
1152 { $$ = sawparens(newNULLLIST());
1153 TOKEN_GETMAD($1,$$,'(');
1154 TOKEN_GETMAD($2,$$,')');
1164 | arylen %prec '(' /* $#x, $#{ something } */
1165 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
1168 | sliceme '[' expr ']' /* array slice */
1169 { $$ = op_prepend_elem(OP_ASLICE,
1170 newOP(OP_PUSHMARK, 0),
1171 newLISTOP(OP_ASLICE, 0,
1173 ref($1, OP_ASLICE)));
1176 $1->op_private & OPpSLICEWARNING;
1177 TOKEN_GETMAD($2,$$,'[');
1178 TOKEN_GETMAD($4,$$,']');
1180 | kvslice '[' expr ']' /* array key/value slice */
1181 { $$ = op_prepend_elem(OP_KVASLICE,
1182 newOP(OP_PUSHMARK, 0),
1183 newLISTOP(OP_KVASLICE, 0,
1185 ref(oopsAV($1), OP_KVASLICE)));
1188 $1->op_private & OPpSLICEWARNING;
1189 TOKEN_GETMAD($2,$$,'[');
1190 TOKEN_GETMAD($4,$$,']');
1192 | sliceme '{' 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)));
1200 $1->op_private & OPpSLICEWARNING;
1201 PL_parser->expect = XOPERATOR;
1202 TOKEN_GETMAD($2,$$,'{');
1203 TOKEN_GETMAD($4,$$,';');
1204 TOKEN_GETMAD($5,$$,'}');
1206 | kvslice '{' expr ';' '}' /* %hash{@keys} */
1207 { $$ = op_prepend_elem(OP_KVHSLICE,
1208 newOP(OP_PUSHMARK, 0),
1209 newLISTOP(OP_KVHSLICE, 0,
1211 ref($1, OP_KVHSLICE)));
1214 $1->op_private & OPpSLICEWARNING;
1215 PL_parser->expect = XOPERATOR;
1216 TOKEN_GETMAD($2,$$,'{');
1217 TOKEN_GETMAD($4,$$,';');
1218 TOKEN_GETMAD($5,$$,'}');
1223 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
1224 | amper '(' ')' /* &foo() or foo() */
1225 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1));
1226 TOKEN_GETMAD($2,$$,'(');
1227 TOKEN_GETMAD($3,$$,')');
1229 | amper '(' expr ')' /* &foo(@args) or foo(@args) */
1231 $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1232 op_append_elem(OP_LIST, $3, scalar($1)));
1235 if (op->op_type == OP_CONST) { /* defeat const fold */
1236 op = (OP*)op->op_madprop->mad_val;
1238 token_getmad($2,op,'(');
1239 token_getmad($4,op,')');
1242 | NOAMP subname optlistexpr /* foo @args (no parens) */
1243 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1244 op_append_elem(OP_LIST, $3, scalar($2)));
1245 TOKEN_GETMAD($1,$$,'o');
1247 | term ARROW '$' '*'
1248 { $$ = newSVREF($1);
1249 TOKEN_GETMAD($3,$$,'$');
1251 | term ARROW '@' '*'
1252 { $$ = newAVREF($1);
1253 TOKEN_GETMAD($3,$$,'@');
1255 | term ARROW '%' '*'
1256 { $$ = newHVREF($1);
1257 TOKEN_GETMAD($3,$$,'%');
1259 | term ARROW '&' '*'
1260 { $$ = newUNOP(OP_ENTERSUB, 0,
1261 scalar(newCVREF(IVAL($3),$1)));
1262 TOKEN_GETMAD($3,$$,'&');
1264 | term ARROW '*' '*' %prec '('
1265 { $$ = newGVREF(0,$1);
1266 TOKEN_GETMAD($3,$$,'*');
1268 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
1269 { $$ = newOP(IVAL($1), OPf_SPECIAL);
1270 PL_hints |= HINT_BLOCK_SCOPE;
1271 TOKEN_GETMAD($1,$$,'o');
1274 { $$ = newLOOPEX(IVAL($1),$2);
1275 TOKEN_GETMAD($1,$$,'o');
1277 | NOTOP listexpr /* not $foo */
1278 { $$ = newUNOP(OP_NOT, 0, scalar($2));
1279 TOKEN_GETMAD($1,$$,'o');
1281 | UNIOP /* Unary op, $_ implied */
1282 { $$ = newOP(IVAL($1), 0);
1283 TOKEN_GETMAD($1,$$,'o');
1285 | UNIOP block /* eval { foo }* */
1286 { $$ = newUNOP(IVAL($1), 0, $2);
1287 TOKEN_GETMAD($1,$$,'o');
1289 | UNIOP term /* Unary op */
1290 { $$ = newUNOP(IVAL($1), 0, $2);
1291 TOKEN_GETMAD($1,$$,'o');
1293 | REQUIRE /* require, $_ implied */
1294 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0);
1295 TOKEN_GETMAD($1,$$,'o');
1297 | REQUIRE term /* require Foo */
1298 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2);
1299 TOKEN_GETMAD($1,$$,'o');
1302 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
1303 | UNIOPSUB term /* Sub treated as unop */
1304 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1305 op_append_elem(OP_LIST, $2, scalar($1))); }
1306 | FUNC0 /* Nullary operator */
1307 { $$ = newOP(IVAL($1), 0);
1308 TOKEN_GETMAD($1,$$,'o');
1311 { $$ = newOP(IVAL($1), 0);
1312 TOKEN_GETMAD($1,$$,'o');
1313 TOKEN_GETMAD($2,$$,'(');
1314 TOKEN_GETMAD($3,$$,')');
1316 | FUNC0OP /* Same as above, but op created in toke.c */
1320 TOKEN_GETMAD($2,$$,'(');
1321 TOKEN_GETMAD($3,$$,')');
1323 | FUNC0SUB /* Sub treated as nullop */
1324 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
1326 | FUNC1 '(' ')' /* not () */
1327 { $$ = (IVAL($1) == OP_NOT)
1328 ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0)))
1329 : newOP(IVAL($1), OPf_SPECIAL);
1331 TOKEN_GETMAD($1,$$,'o');
1332 TOKEN_GETMAD($2,$$,'(');
1333 TOKEN_GETMAD($3,$$,')');
1335 | FUNC1 '(' expr ')' /* not($foo) */
1336 { $$ = newUNOP(IVAL($1), 0, $3);
1337 TOKEN_GETMAD($1,$$,'o');
1338 TOKEN_GETMAD($2,$$,'(');
1339 TOKEN_GETMAD($4,$$,')');
1341 | PMFUNC /* m//, s///, qr//, tr/// */
1343 if ( $1->op_type != OP_TRANS
1344 && $1->op_type != OP_TRANSR
1345 && (((PMOP*)$1)->op_pmflags & PMf_HAS_CV))
1347 $<ival>$ = start_subparse(FALSE, CVf_ANON);
1348 SAVEFREESV(PL_compcv);
1353 { $$ = pmruntime($1, $4, 1, $<ival>2);
1354 TOKEN_GETMAD($3,$$,'(');
1355 TOKEN_GETMAD($5,$$,')');
1361 $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0),
1362 newSVOP(OP_CONST, 0, newSVpvs("Unimplemented")));
1363 TOKEN_GETMAD($1,$$,'X');
1368 /* "my" declarations, with optional attributes */
1369 myattrterm: MY myterm myattrlist
1370 { $$ = my_attrs($2,$3);
1372 token_getmad($1,$$,'d');
1373 append_madprops($3->op_madprop, $$, 'a');
1378 { $$ = localize($2,IVAL($1));
1379 TOKEN_GETMAD($1,$$,'d');
1383 /* Things that can be "my"'d */
1384 myterm : '(' expr ')'
1385 { $$ = sawparens($2);
1386 TOKEN_GETMAD($1,$$,'(');
1387 TOKEN_GETMAD($3,$$,')');
1390 { $$ = sawparens(newNULLLIST());
1391 TOKEN_GETMAD($1,$$,'(');
1392 TOKEN_GETMAD($2,$$,')');
1402 /* Basic list expressions */
1403 optlistexpr: /* NULL */ %prec PREC_LOW
1405 | listexpr %prec PREC_LOW
1415 /* A little bit of trickery to make "for my $foo (@bar)" actually be
1418 { PL_parser->in_my = 0; $$ = my($1); }
1422 { $$ = newCVREF(IVAL($1),$2);
1423 TOKEN_GETMAD($1,$$,'&');
1427 scalar : '$' indirob
1428 { $$ = newSVREF($2);
1429 TOKEN_GETMAD($1,$$,'$');
1434 { $$ = newAVREF($2);
1435 if ($$) $$->op_private |= IVAL($1);
1436 TOKEN_GETMAD($1,$$,'@');
1441 { $$ = newHVREF($2);
1442 if ($$) $$->op_private |= IVAL($1);
1443 TOKEN_GETMAD($1,$$,'%');
1447 arylen : DOLSHARP indirob
1448 { $$ = newAVREF($2);
1449 TOKEN_GETMAD($1,$$,'l');
1451 | term ARROW DOLSHARP '*'
1452 { $$ = newAVREF($1);
1453 TOKEN_GETMAD($3,$$,'l');
1458 { $$ = newGVREF(0,$2);
1459 TOKEN_GETMAD($1,$$,'*');
1465 { $$ = newAVREF($1);
1466 TOKEN_GETMAD($3,$$,'@');
1472 { $$ = newHVREF($1);
1473 TOKEN_GETMAD($3,$$,'@');
1479 { $$ = newGVREF(0,$1);
1480 TOKEN_GETMAD($3,$$,'*');
1484 /* Indirect objects */
1486 { $$ = scalar($1); }
1487 | scalar %prec PREC_LOW
1488 { $$ = scalar($1); }
1490 { $$ = op_scope($1); }