3 * Copyright (c) 1991-2002, 2003, 2004 Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * 'I see,' laughed Strider. 'I look foul and feel fair. Is that it?
12 * All that is gold does not glitter, not all those who wander are lost.'
15 /* This file holds the grammar for the Perl language. If edited, you need
16 * to run regen_perly.pl, which re-creates the files perly.h, perly.tab
17 * and perly.act which are derived from this.
19 * The main job of of this grammar is to call the various newFOO()
20 * functions in op.c to build a syntax tree of OP structs.
21 * It relies on the lexer in toke.c to do the tokenizing.
24 /* Make the parser re-entrant. */
42 %token <opval> WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF
43 %token <opval> FUNC0SUB UNIOPSUB LSTOPSUB
45 %token <ival> FORMAT SUB ANONSUB PACKAGE USE
46 %token <ival> WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
47 %token <ival> GIVEN WHEN DEFAULT
48 %token <ival> LOOPEX DOTDOT
49 %token <ival> FUNC0 FUNC1 FUNC UNIOP LSTOP
50 %token <ival> RELOP EQOP MULOP ADDOP
51 %token <ival> DOLSHARP DO HASHBRACK NOAMP
52 %token <ival> LOCAL MY MYSUB REQUIRE
55 %type <ival> prog decl format startsub startanonsub startformsub mintro
56 %type <ival> progstart remember mremember '&' savescope mydefsv
57 %type <opval> block mblock lineseq line loop cond else
58 %type <opval> expr term subscripted scalar ary hsh arylen star amper sideff
59 %type <opval> argexpr nexpr texpr iexpr mexpr mnexpr miexpr
60 %type <opval> listexpr listexprcom indirob listop method
61 %type <opval> formname subname proto subbody cont my_scalar
62 %type <opval> subattrlist myattrlist mysubrout myattrterm myterm
63 %type <opval> termbinop termunop anonymous termdo
64 %type <opval> switch case
70 %left <ival> OROP DOROP
73 %nonassoc LSTOP LSTOPSUB
75 %right <ival> ASSIGNOP
84 %nonassoc UNIOP UNIOPSUB
90 %right '!' '~' UMINUS REFGEN
92 %nonassoc PREINC PREDEC POSTINC POSTDEC
102 /* The whole program */
104 /*CONTINUED*/ lineseq
105 { $$ = $1; newPROG(block_end($1,$2)); }
108 /* An ordinary block */
109 block : '{' remember lineseq '}'
110 { if (PL_copline > (line_t)$1)
111 PL_copline = (line_t)$1;
112 $$ = block_end($2, $3); }
115 remember: /* NULL */ /* start a full lexical scope */
116 { $$ = block_start(TRUE); }
119 mydefsv: /* NULL */ /* lexicalize $_ */
120 { $$ = (I32) allocmy("$_"); }
125 PL_expect = XSTATE; $$ = block_start(TRUE);
130 mblock : '{' mremember lineseq '}'
131 { if (PL_copline > (line_t)$1)
132 PL_copline = (line_t)$1;
133 $$ = block_end($2, $3); }
136 mremember: /* NULL */ /* start a partial lexical scope */
137 { $$ = block_start(FALSE); }
140 savescope: /* NULL */ /* remember stack pos in case of error */
141 { $$ = PL_savestack_ix; }
143 /* A collection of "lines" in the program */
148 | lineseq savescope line
150 $$ = append_list(OP_LINESEQ,
151 (LISTOP*)$1, (LISTOP*)$3);
152 PL_pad_reset_pending = TRUE;
153 if ($1 && $3) PL_hints |= HINT_BLOCK_SCOPE; }
156 /* A "line" in the program */
158 { $$ = newSTATEOP(0, $1, $2); }
159 | loop /* loops add their own labels */
160 | switch /* ... and so do switches */
163 { $$ = newSTATEOP(0, $1, $2); }
165 { if ($1 != Nullch) {
166 $$ = newSTATEOP(0, $1, newOP(OP_NULL, 0));
172 PL_expect = XSTATE; }
174 { $$ = newSTATEOP(0, $1, $2);
175 PL_expect = XSTATE; }
178 /* An expression which may have a side-effect */
184 { $$ = newLOGOP(OP_AND, 0, $3, $1); }
186 { $$ = newLOGOP(OP_OR, 0, $3, $1); }
188 { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1); }
190 { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);}
192 { $$ = newFOROP(0, Nullch, (line_t)$2,
193 Nullop, $3, $1, Nullop); }
196 /* else and elsif blocks */
200 { ($2)->op_flags |= OPf_PARENS; $$ = scope($2); }
201 | ELSIF '(' mexpr ')' mblock else
202 { PL_copline = (line_t)$1;
203 $$ = newCONDOP(0, $3, scope($5), $6);
204 PL_hints |= HINT_BLOCK_SCOPE; }
207 /* Real conditional expressions */
208 cond : IF '(' remember mexpr ')' mblock else
209 { PL_copline = (line_t)$1;
211 newCONDOP(0, $4, scope($6), $7)); }
212 | UNLESS '(' remember miexpr ')' mblock else
213 { PL_copline = (line_t)$1;
215 newCONDOP(0, $4, scope($6), $7)); }
218 /* Cases for a switch statement */
219 case : WHEN '(' remember mexpr ')' mblock
221 newWHENOP($4, scope($6))); }
223 { $$ = newWHENOP(0, scope($2)); }
226 /* Continue blocks */
233 /* Loops: while, until, for, and a bare block */
234 loop : label WHILE '(' remember texpr ')' mintro mblock cont
235 { PL_copline = (line_t)$2;
238 newWHILEOP(0, 1, (LOOP*)Nullop,
239 $2, $5, $8, $9, $7))); }
240 | label UNTIL '(' remember iexpr ')' mintro mblock cont
241 { PL_copline = (line_t)$2;
244 newWHILEOP(0, 1, (LOOP*)Nullop,
245 $2, $5, $8, $9, $7))); }
246 | label FOR MY remember my_scalar '(' mexpr ')' mblock cont
248 newFOROP(0, $1, (line_t)$2, $5, $7, $9, $10)); }
249 | label FOR scalar '(' remember mexpr ')' mblock cont
251 newFOROP(0, $1, (line_t)$2, mod($3, OP_ENTERLOOP),
253 | label FOR '(' remember mexpr ')' mblock cont
255 newFOROP(0, $1, (line_t)$2, Nullop, $5, $7, $8)); }
256 | label FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')'
258 /* basically fake up an initialize-while lineseq */
260 PL_copline = (line_t)$2;
261 forop = newSTATEOP(0, $1,
262 newWHILEOP(0, 1, (LOOP*)Nullop,
266 forop = append_elem(OP_LINESEQ,
267 newSTATEOP(0, ($1?savepv($1):Nullch),
272 $$ = block_end($4, forop); }
273 | label block cont /* a block is a loop that happens once */
274 { $$ = newSTATEOP(0, $1,
275 newWHILEOP(0, 1, (LOOP*)Nullop,
276 NOLINE, Nullop, $2, $3, 0)); }
280 switch : label GIVEN '(' remember mydefsv mexpr ')' mblock
281 { PL_copline = (line_t) $2;
284 newGIVENOP($6, scope($8),
285 (PADOFFSET) $5) )); }
288 /* determine whether there are any new my declarations */
290 { $$ = (PL_min_intro_pending &&
291 PL_max_intro_pending >= PL_min_intro_pending);
294 /* Normal expression */
300 /* Boolean expression */
301 texpr : /* NULL means true */
302 { (void)scan_num("1", &yylval); $$ = yylval.opval; }
306 /* Inverted boolean expression */
308 { $$ = invert(scalar($1)); }
311 /* Expression with its own lexical scope */
313 { $$ = $1; intro_my(); }
317 { $$ = $1; intro_my(); }
321 { $$ = $1; intro_my(); }
324 /* Optional "MAIN:"-style loop labels */
330 /* Some kind of declaration - does not take part in the parse tree */
343 format : FORMAT startformsub formname block
344 { SvREFCNT_inc(PL_compcv);
345 newFORM($2, $3, $4); }
348 formname: WORD { $$ = $1; }
349 | /* NULL */ { $$ = Nullop; }
352 /* Unimplemented "my sub foo { }" */
353 mysubrout: MYSUB startsub subname proto subattrlist subbody
354 { SvREFCNT_inc(PL_compcv);
355 newMYSUB($2, $3, $4, $5, $6); }
358 /* Subroutine definition */
359 subrout : SUB startsub subname proto subattrlist subbody
360 { SvREFCNT_inc(PL_compcv);
361 newATTRSUB($2, $3, $4, $5, $6); }
364 startsub: /* NULL */ /* start a regular subroutine scope */
365 { $$ = start_subparse(FALSE, 0);
366 SAVEFREESV(PL_compcv); }
369 startanonsub: /* NULL */ /* start an anonymous subroutine scope */
370 { $$ = start_subparse(FALSE, CVf_ANON);
371 SAVEFREESV(PL_compcv); }
374 startformsub: /* NULL */ /* start a format subroutine scope */
375 { $$ = start_subparse(TRUE, 0);
376 SAVEFREESV(PL_compcv); }
379 /* Name of a subroutine - must be a bareword, could be special */
380 subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv);
381 if (strEQ(name, "BEGIN") || strEQ(name, "END")
382 || strEQ(name, "INIT") || strEQ(name, "CHECK")
383 || strEQ(name, "UNITCHECK"))
384 CvSPECIAL_on(PL_compcv);
388 /* Subroutine prototype */
394 /* Optional list of subroutine attributes */
395 subattrlist: /* NULL */
403 /* List of attributes for a "my" variable declaration */
404 myattrlist: COLONATTR THING
410 /* Subroutine body - either null or a block */
411 subbody : block { $$ = $1; }
412 | ';' { $$ = Nullop; PL_expect = XSTATE; }
415 package : PACKAGE WORD ';'
420 { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
421 WORD WORD listexpr ';'
422 { SvREFCNT_inc(PL_compcv);
423 utilize($1, $2, $4, $5, $6); }
426 /* Ordinary expressions; logical combinations */
427 expr : expr ANDOP expr
428 { $$ = newLOGOP(OP_AND, 0, $1, $3); }
430 { $$ = newLOGOP($2, 0, $1, $3); }
432 { $$ = newLOGOP(OP_DOR, 0, $1, $3); }
433 | argexpr %prec PREC_LOW
436 /* Expressions are a list of terms joined by commas */
437 argexpr : argexpr ','
440 { $$ = append_elem(OP_LIST, $1, $3); }
441 | term %prec PREC_LOW
445 listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */
446 { $$ = convert($1, OPf_STACKED,
447 prepend_elem(OP_LIST, newGVREF($1,$2), $3) ); }
448 | FUNC '(' indirob expr ')' /* print ($fh @args */
449 { $$ = convert($1, OPf_STACKED,
450 prepend_elem(OP_LIST, newGVREF($1,$3), $4) ); }
451 | term ARROW method '(' listexprcom ')' /* $foo->bar(list) */
452 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
454 prepend_elem(OP_LIST, scalar($1), $5),
455 newUNOP(OP_METHOD, 0, $3))); }
456 | term ARROW method /* $foo->bar */
457 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
458 append_elem(OP_LIST, scalar($1),
459 newUNOP(OP_METHOD, 0, $3))); }
460 | METHOD indirob listexpr /* new Class @args */
461 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
463 prepend_elem(OP_LIST, $2, $3),
464 newUNOP(OP_METHOD, 0, $1))); }
465 | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
466 { $$ = convert(OP_ENTERSUB, OPf_STACKED,
468 prepend_elem(OP_LIST, $2, $4),
469 newUNOP(OP_METHOD, 0, $1))); }
470 | LSTOP listexpr /* print @args */
471 { $$ = convert($1, 0, $2); }
472 | FUNC '(' listexprcom ')' /* print (@args) */
473 { $$ = convert($1, 0, $3); }
474 | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */
475 { SvREFCNT_inc(PL_compcv);
476 $3 = newANONATTRSUB($2, 0, Nullop, $3); }
477 listexpr %prec LSTOP /* ... @bar */
478 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
480 prepend_elem(OP_LIST, $3, $5), $1)); }
483 /* Names of methods. May use $object->$methodname */
488 /* Some kind of subscripted expression */
489 subscripted: star '{' expr ';' '}' /* *main::{something} */
490 /* In this and all the hash accessors, ';' is
491 * provided by the tokeniser */
492 { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3));
493 PL_expect = XOPERATOR; }
494 | scalar '[' expr ']' /* $array[$element] */
495 { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3)); }
496 | term ARROW '[' expr ']' /* somearef->[$element] */
497 { $$ = newBINOP(OP_AELEM, 0,
498 ref(newAVREF($1),OP_RV2AV),
500 | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */
501 { $$ = newBINOP(OP_AELEM, 0,
502 ref(newAVREF($1),OP_RV2AV),
504 | scalar '{' expr ';' '}' /* $foo->{bar();} */
505 { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
506 PL_expect = XOPERATOR; }
507 | term ARROW '{' expr ';' '}' /* somehref->{bar();} */
508 { $$ = newBINOP(OP_HELEM, 0,
509 ref(newHVREF($1),OP_RV2HV),
511 PL_expect = XOPERATOR; }
512 | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */
513 { $$ = newBINOP(OP_HELEM, 0,
514 ref(newHVREF($1),OP_RV2HV),
516 PL_expect = XOPERATOR; }
517 | term ARROW '(' ')' /* $subref->() */
518 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
519 newCVREF(0, scalar($1))); }
520 | term ARROW '(' expr ')' /* $subref->(@args) */
521 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
522 append_elem(OP_LIST, $4,
523 newCVREF(0, scalar($1)))); }
525 | subscripted '(' expr ')' /* $foo->{bar}->(@args) */
526 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
527 append_elem(OP_LIST, $3,
528 newCVREF(0, scalar($1)))); }
529 | subscripted '(' ')' /* $foo->{bar}->() */
530 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
531 newCVREF(0, scalar($1))); }
532 | '(' expr ')' '[' expr ']' /* list slice */
533 { $$ = newSLICEOP(0, $5, $2); }
534 | '(' ')' '[' expr ']' /* empty list slice! */
535 { $$ = newSLICEOP(0, $4, Nullop); }
538 /* Binary operators between terms */
539 termbinop : term ASSIGNOP term /* $x = $y */
540 { $$ = newASSIGNOP(OPf_STACKED, $1, $2, $3); }
541 | term POWOP term /* $x ** $y */
542 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
543 | term MULOP term /* $x * $y, $x x $y */
544 { if ($2 != OP_REPEAT)
546 $$ = newBINOP($2, 0, $1, scalar($3)); }
547 | term ADDOP term /* $x + $y */
548 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
549 | term SHIFTOP term /* $x >> $y, $x << $y */
550 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
551 | term RELOP term /* $x > $y, etc. */
552 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
553 | term EQOP term /* $x == $y, $x eq $y */
554 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
555 | term BITANDOP term /* $x & $y */
556 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
557 | term BITOROP term /* $x | $y */
558 { $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
559 | term DOTDOT term /* $x..$y, $x...$y */
560 { $$ = newRANGE($2, scalar($1), scalar($3));}
561 | term ANDAND term /* $x && $y */
562 { $$ = newLOGOP(OP_AND, 0, $1, $3); }
563 | term OROR term /* $x || $y */
564 { $$ = newLOGOP(OP_OR, 0, $1, $3); }
565 | term DORDOR term /* $x // $y */
566 { $$ = newLOGOP(OP_DOR, 0, $1, $3); }
567 | term MATCHOP term /* $x =~ /$y/ */
568 { $$ = bind_match($2, $1, $3); }
571 /* Unary operators and terms */
572 termunop : '-' term %prec UMINUS /* -$x */
573 { $$ = newUNOP(OP_NEGATE, 0, scalar($2)); }
574 | '+' term %prec UMINUS /* +$x */
577 { $$ = newUNOP(OP_NOT, 0, scalar($2)); }
579 { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));}
580 | term POSTINC /* $x++ */
581 { $$ = newUNOP(OP_POSTINC, 0,
582 mod(scalar($1), OP_POSTINC)); }
583 | term POSTDEC /* $x-- */
584 { $$ = newUNOP(OP_POSTDEC, 0,
585 mod(scalar($1), OP_POSTDEC)); }
586 | PREINC term /* ++$x */
587 { $$ = newUNOP(OP_PREINC, 0,
588 mod(scalar($2), OP_PREINC)); }
589 | PREDEC term /* --$x */
590 { $$ = newUNOP(OP_PREDEC, 0,
591 mod(scalar($2), OP_PREDEC)); }
595 /* Constructors for anonymous data */
596 anonymous: '[' expr ']'
597 { $$ = newANONLIST($2); }
599 { $$ = newANONLIST(Nullop); }
600 | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */
601 { $$ = newANONHASH($2); }
602 | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */
603 { $$ = newANONHASH(Nullop); }
604 | ANONSUB startanonsub proto subattrlist block %prec '('
605 { SvREFCNT_inc(PL_compcv);
606 $$ = newANONATTRSUB($2, $3, $4, $5); }
610 /* Things called with "do" */
611 termdo : DO term %prec UNIOP /* do $filename */
612 { $$ = dofile($2, $1); }
613 | DO block %prec '(' /* do { code */
614 { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2)); }
615 | DO WORD '(' ')' /* do somesub() */
616 { $$ = newUNOP(OP_ENTERSUB,
617 OPf_SPECIAL|OPf_STACKED,
618 prepend_elem(OP_LIST,
620 (OPpENTERSUB_AMPER<<8),
623 | DO WORD '(' expr ')' /* do somesub(@args) */
624 { $$ = newUNOP(OP_ENTERSUB,
625 OPf_SPECIAL|OPf_STACKED,
629 (OPpENTERSUB_AMPER<<8),
632 | DO scalar '(' ')' /* do $subref () */
633 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
634 prepend_elem(OP_LIST,
635 scalar(newCVREF(0,scalar($2))), Nullop)); dep();}
636 | DO scalar '(' expr ')' /* do $subref (@args) */
637 { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
638 prepend_elem(OP_LIST,
640 scalar(newCVREF(0,scalar($2))))); dep();}
648 | term '?' term ':' term
649 { $$ = newCONDOP(0, $1, $3, $5); }
650 | REFGEN term /* \$x, \@y, \%z */
651 { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN)); }
652 | myattrterm %prec UNIOP
654 | LOCAL term %prec UNIOP
655 { $$ = localize($2,$1); }
657 { $$ = sawparens($2); }
659 { $$ = sawparens(newNULLLIST()); }
668 | arylen %prec '(' /* $#x, $#{ something } */
669 { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
672 | ary '[' expr ']' /* array slice */
673 { $$ = prepend_elem(OP_ASLICE,
674 newOP(OP_PUSHMARK, 0),
675 newLISTOP(OP_ASLICE, 0,
677 ref($1, OP_ASLICE))); }
678 | ary '{' expr ';' '}' /* @hash{@keys} */
679 { $$ = prepend_elem(OP_HSLICE,
680 newOP(OP_PUSHMARK, 0),
681 newLISTOP(OP_HSLICE, 0,
683 ref(oopsHV($1), OP_HSLICE)));
684 PL_expect = XOPERATOR; }
688 { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
689 | amper '(' ')' /* &foo() */
690 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
691 | amper '(' expr ')' /* &foo(@args) */
692 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
693 append_elem(OP_LIST, $3, scalar($1))); }
694 | NOAMP WORD listexpr /* foo(@args) */
695 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
696 append_elem(OP_LIST, $3, scalar($2))); }
697 | LOOPEX /* loop exiting command (goto, last, dump, etc) */
698 { $$ = newOP($1, OPf_SPECIAL);
699 PL_hints |= HINT_BLOCK_SCOPE; }
701 { $$ = newLOOPEX($1,$2); }
702 | NOTOP argexpr /* not $foo */
703 { $$ = newUNOP(OP_NOT, 0, scalar($2)); }
704 | UNIOP /* Unary op, $_ implied */
705 { $$ = newOP($1, 0); }
706 | UNIOP block /* eval { foo } */
707 { $$ = newUNOP($1, 0, $2); }
708 | UNIOP term /* Unary op */
709 { $$ = newUNOP($1, 0, $2); }
710 | REQUIRE /* require, $_ implied */
711 { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0); }
712 | REQUIRE term /* require Foo */
713 { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2); }
714 | UNIOPSUB term /* Sub treated as unop */
715 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
716 append_elem(OP_LIST, $2, scalar($1))); }
717 | FUNC0 /* Nullary operator */
718 { $$ = newOP($1, 0); }
720 { $$ = newOP($1, 0); }
721 | FUNC0SUB /* Sub treated as nullop */
722 { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
724 | FUNC1 '(' ')' /* not () */
725 { $$ = $1 == OP_NOT ? newUNOP($1, 0, newSVOP(OP_CONST, 0, newSViv(0)))
726 : newOP($1, OPf_SPECIAL); }
727 | FUNC1 '(' expr ')' /* not($foo) */
728 { $$ = newUNOP($1, 0, $3); }
729 | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */
730 { $$ = pmruntime($1, $3, 1); }
735 /* "my" declarations, with optional attributes */
736 myattrterm: MY myterm myattrlist
737 { $$ = my_attrs($2,$3); }
739 { $$ = localize($2,$1); }
742 /* Things that can be "my"'d */
743 myterm : '(' expr ')'
744 { $$ = sawparens($2); }
746 { $$ = sawparens(newNULLLIST()); }
755 /* Basic list expressions */
756 listexpr: /* NULL */ %prec PREC_LOW
758 | argexpr %prec PREC_LOW
762 listexprcom: /* NULL */
770 /* A little bit of trickery to make "for my $foo (@bar)" actually be
773 { PL_in_my = 0; $$ = my($1); }
777 { $$ = newCVREF($1,$2); }
781 { $$ = newSVREF($2); }
785 { $$ = newAVREF($2); }
789 { $$ = newHVREF($2); }
792 arylen : DOLSHARP indirob
793 { $$ = newAVREF($2); }
797 { $$ = newGVREF(0,$2); }
800 /* Indirect objects */
803 | scalar %prec PREC_LOW