X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=perly.y;h=aad4dd772934dbe0570dbdb863cfc8ebb3029eab;hb=9711599ee3b2375539002b6ddc0873ec478916bb;hp=27af9096abffa537134111c0837b9e5b1ad55f08;hpb=93a17b20b6d176db3f04f51a63b0a781e5ffd11c;p=p5sagit%2Fp5-mst-13.2.git diff --git a/perly.y b/perly.y index 27af909..aad4dd7 100644 --- a/perly.y +++ b/perly.y @@ -1,579 +1,1352 @@ -/* $RCSfile: perly.y,v $$Revision: 4.1 $$Date: 92/08/07 18:26:16 $ +/* perly.y * - * Copyright (c) 1991, Larry Wall + * Copyright (c) 1991-2002, 2003, 2004, 2005, 2006 Larry Wall + * Copyright (c) 2007, 2008 by Larry Wall and others * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. * - * $Log: perly.y,v $ - * Revision 4.1 92/08/07 18:26:16 lwall - * - * Revision 4.0.1.5 92/06/11 21:12:50 lwall - * patch34: expectterm incorrectly set to indicate start of program or block - * - * Revision 4.0.1.4 92/06/08 17:33:25 lwall - * patch20: one of the backdoors to expectterm was on the wrong reduction - * - * Revision 4.0.1.3 92/06/08 15:18:16 lwall - * patch20: an expression may now start with a bareword - * patch20: relaxed requirement for semicolon at the end of a block - * patch20: added ... as variant on .. - * patch20: fixed double debug break in foreach with implicit array assignment - * patch20: if {block} {block} didn't work any more - * patch20: deleted some minor memory leaks - * - * Revision 4.0.1.2 91/11/05 18:17:38 lwall - * patch11: extra comma at end of list is now allowed in more places (Hi, Felix!) - * patch11: once-thru blocks didn't display right in the debugger - * patch11: debugger got confused over nested subroutine definitions - * - * Revision 4.0.1.1 91/06/07 11:42:34 lwall - * patch4: new copyright notice - * - * Revision 4.0 91/03/20 01:38:40 lwall - * 4.0 baseline. - * */ -%{ -#include "EXTERN.h" -#include "perl.h" +/* + * 'I see,' laughed Strider. 'I look foul and feel fair. Is that it? + * All that is gold does not glitter, not all those who wander are lost.' + * + * [p.171 of _The Lord of the Rings_, I/x: "Strider"] + */ + +/* + * This file holds the grammar for the Perl language. If edited, you need + * to run regen_perly.pl, which re-creates the files perly.h, perly.tab + * and perly.act which are derived from this. + * + * Note that these derived files are included and compiled twice; once + * from perly.c, and once from madly.c. The second time, a number of MAD + * macros are defined, which compile in extra code that allows the parse + * tree to be accurately dumped. In particular: + * + * MAD defined if compiling madly.c + * DO_MAD(A) expands to A under madly.c, to null otherwise + * IF_MAD(a,b) expands to A under madly.c, to B otherwise + * TOKEN_GETMAD() expands to token_getmad() under madly.c, to null otherwise + * TOKEN_FREE() similarly + * OP_GETMAD() similarly + * IVAL(i) expands to (i)->tk_lval.ival or (i) + * PVAL(p) expands to (p)->tk_lval.pval or (p) + * + * The main job of of this grammar is to call the various newFOO() + * functions in op.c to build a syntax tree of OP structs. + * It relies on the lexer in toke.c to do the tokenizing. + * + * Note: due to the way that the cleanup code works WRT to freeing ops on + * the parse stack, it is dangerous to assign to the $n variables within + * an action. + */ -/*SUPPRESS 530*/ -/*SUPPRESS 593*/ -/*SUPPRESS 595*/ +/* Make the parser re-entrant. */ -%} +%pure_parser + +/* FIXME for MAD - is the new mintro on while and until important? */ %start prog %union { - I32 ival; + I32 ival; /* __DEFAULT__ (marker for regen_perly.pl; + must always be 1st union member) */ char *pval; OP *opval; GV *gvval; +#ifdef PERL_IN_MADLY_C + TOKEN* p_tkval; + TOKEN* i_tkval; +#else + char *p_tkval; + I32 i_tkval; +#endif +#ifdef PERL_MAD + TOKEN* tkval; +#endif } -%token '{' ')' - -%token WORD METHOD THING PMFUNC PRIVATEREF -%token LABEL -%token FORMAT SUB PACKAGE -%token WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR -%token LOOPEX DOTDOT -%token FUNC0 FUNC1 FUNC -%token RELOP EQOP MULOP ADDOP -%token DOLSHARP DO LOCAL DELETE HASHBRACK NOAMP - -%type prog decl format remember crp crb crhb -%type block lineseq line loop cond nexpr else -%type expr sexpr term scalar ary hsh arylen star amper sideff -%type listexpr indirob -%type texpr listop -%type label -%type cont - -%nonassoc LSTOP -%left ',' -%right '=' -%right '?' ':' -%nonassoc DOTDOT -%left OROR -%left ANDAND -%left BITOROP -%left BITANDOP +%token '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';' + +%token WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF +%token FUNC0SUB UNIOPSUB LSTOPSUB +%token LABEL +%token FORMAT SUB ANONSUB PACKAGE USE +%token WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR +%token GIVEN WHEN DEFAULT +%token LOOPEX DOTDOT YADAYADA +%token FUNC0 FUNC1 FUNC UNIOP LSTOP +%token RELOP EQOP MULOP ADDOP +%token DOLSHARP DO HASHBRACK NOAMP +%token LOCAL MY MYSUB REQUIRE +%token COLONATTR + +%type prog progstart remember mremember +%type startsub startanonsub startformsub +/* FIXME for MAD - are these two ival? */ +%type mydefsv mintro + +%type decl format subrout mysubrout package use peg + +%type block mblock lineseq line loop cond else +%type expr term subscripted scalar ary hsh arylen star amper sideff +%type argexpr nexpr texpr iexpr mexpr mnexpr miexpr +%type listexpr listexprcom indirob listop method +%type formname subname proto subbody cont my_scalar +%type subattrlist myattrlist myattrterm myterm +%type termbinop termunop anonymous termdo +%type switch case +%type label + +%nonassoc PREC_LOW +%nonassoc LOOPEX + +%left OROP DOROP +%left ANDOP +%right NOTOP +%nonassoc LSTOP LSTOPSUB +%left ',' +%right ASSIGNOP +%right '?' ':' +%nonassoc DOTDOT YADAYADA +%left OROR DORDOR +%left ANDAND +%left BITOROP +%left BITANDOP %nonassoc EQOP %nonassoc RELOP -%nonassoc UNIOP -%left SHIFTOP +%nonassoc UNIOP UNIOPSUB +%nonassoc REQUIRE +%left SHIFTOP %left ADDOP %left MULOP -%left MATCHOP ARROW -%right '!' '~' UMINUS REFGEN -%right POWOP -%nonassoc PREINC PREDEC POSTINC POSTDEC -%left '(' +%left MATCHOP +%right '!' '~' UMINUS REFGEN +%right POWOP +%nonassoc PREINC PREDEC POSTINC POSTDEC +%left ARROW +%nonassoc ')' +%left '(' +%left '[' '{' + +%token PEG %% /* RULES */ -prog : /* NULL */ - { -#if defined(YYDEBUG) && defined(DEBUGGING) - yydebug = (debug & 1); -#endif - expect = XBLOCK; - } +/* The whole program */ +prog : progstart /*CONTINUED*/ lineseq - { if (in_eval) { - eval_root = newUNOP(OP_LEAVEEVAL, 0, $2); - eval_start = linklist(eval_root); - eval_root->op_next = 0; - peep(eval_start); - } - else - main_root = block_head($2, &main_start); - } + { $$ = $1; newPROG(block_end($1,$2)); } ; +/* An ordinary block */ block : '{' remember lineseq '}' - { $$ = scalarseq($3); - if (copline > (line_t)$1) - copline = $1; - leave_scope($2); - pad_leavemy(comppadnamefill); - expect = XBLOCK; } + { if (PL_parser->copline > (line_t)IVAL($1)) + PL_parser->copline = (line_t)IVAL($1); + $$ = block_end($2, $3); + TOKEN_GETMAD($1,$$,'{'); + TOKEN_GETMAD($4,$$,'}'); + } + ; + +remember: /* NULL */ /* start a full lexical scope */ + { $$ = block_start(TRUE); } + ; + +mydefsv: /* NULL */ /* lexicalize $_ */ + { $$ = (I32) allocmy("$_"); } ; -remember: /* NULL */ /* in case they push a package name */ - { $$ = savestack_ix; SAVEINT(comppadnamefill); } +progstart: + { + PL_parser->expect = XSTATE; $$ = block_start(TRUE); + } ; + +mblock : '{' mremember lineseq '}' + { if (PL_parser->copline > (line_t)IVAL($1)) + PL_parser->copline = (line_t)IVAL($1); + $$ = block_end($2, $3); + TOKEN_GETMAD($1,$$,'{'); + TOKEN_GETMAD($4,$$,'}'); + } + ; + +mremember: /* NULL */ /* start a partial lexical scope */ + { $$ = block_start(FALSE); } + ; + +/* A collection of "lines" in the program */ lineseq : /* NULL */ - { $$ = Nullop; } + { $$ = (OP*)NULL; } | lineseq decl - { $$ = $1; } + { + $$ = IF_MAD( + append_list(OP_LINESEQ, + (LISTOP*)$1, (LISTOP*)$2), + $1); + } | lineseq line - { $$ = append_list(OP_LINESEQ, $1, $2); pad_reset(); } + { $$ = append_list(OP_LINESEQ, + (LISTOP*)$1, (LISTOP*)$2); + PL_pad_reset_pending = TRUE; + if ($1 && $2) + PL_hints |= HINT_BLOCK_SCOPE; + } ; +/* A "line" in the program */ line : label cond - { $$ = newSTATEOP(0, $1, $2); } + { $$ = newSTATEOP(0, PVAL($1), $2); + TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); } | loop /* loops add their own labels */ + | switch /* ... and so do switches */ + { $$ = $1; } + | label case + { $$ = newSTATEOP(0, PVAL($1), $2); } | label ';' - { if ($1 != Nullch) { - $$ = newSTATEOP(0, $1, newOP(OP_NULL, 0)); - } - else { - $$ = Nullop; - copline = NOLINE; - } - expect = XBLOCK; } + { + if (PVAL($1)) { + $$ = newSTATEOP(0, PVAL($1), newOP(OP_NULL, 0)); + TOKEN_GETMAD($1,$$,'L'); + TOKEN_GETMAD($2,((LISTOP*)$$)->op_first,';'); + } + else { + $$ = IF_MAD( + newOP(OP_NULL, 0), + (OP*)NULL); + PL_parser->copline = NOLINE; + TOKEN_FREE($1); + TOKEN_GETMAD($2,$$,';'); + } + PL_parser->expect = XSTATE; + } | label sideff ';' - { $$ = newSTATEOP(0, $1, $2); - expect = XBLOCK; } + { + $$ = newSTATEOP(0, PVAL($1), $2); + PL_parser->expect = XSTATE; + DO_MAD({ + /* sideff might already have a nexstate */ + OP* op = ((LISTOP*)$$)->op_first; + if (op) { + while (op->op_sibling && + op->op_sibling->op_type == OP_NEXTSTATE) + op = op->op_sibling; + token_getmad($1,op,'L'); + token_getmad($3,op,';'); + } + }) + } ; +/* An expression which may have a side-effect */ sideff : error - { $$ = Nullop; } + { $$ = (OP*)NULL; } | expr { $$ = $1; } | expr IF expr - { $$ = newLOGOP(OP_AND, 0, $3, $1); } + { $$ = newLOGOP(OP_AND, 0, $3, $1); + TOKEN_GETMAD($2,$$,'i'); + } | expr UNLESS expr - { $$ = newLOGOP(OP_OR, 0, $3, $1); } + { $$ = newLOGOP(OP_OR, 0, $3, $1); + TOKEN_GETMAD($2,$$,'i'); + } | expr WHILE expr - { $$ = newLOOPOP(0, 1, scalar($3), $1); } - | expr UNTIL expr - { $$ = newLOOPOP(0, 1, invert(scalar($3)), $1);} + { $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1); + TOKEN_GETMAD($2,$$,'w'); + } + | expr UNTIL iexpr + { $$ = newLOOPOP(OPf_PARENS, 1, $3, $1); + TOKEN_GETMAD($2,$$,'w'); + } + | expr FOR expr + { $$ = newFOROP(0, NULL, (line_t)IVAL($2), + (OP*)NULL, $3, $1, (OP*)NULL); + TOKEN_GETMAD($2,((LISTOP*)$$)->op_first->op_sibling,'w'); + } ; +/* else and elsif blocks */ else : /* NULL */ - { $$ = Nullop; } - | ELSE block - { $$ = scope($2); } - | ELSIF '(' expr ')' block else - { copline = $1; - $$ = newCONDOP(0, $3, scope($5), $6); } - ; - -cond : IF '(' expr ')' block else - { copline = $1; - $$ = newCONDOP(0, $3, scope($5), $6); } - | UNLESS '(' expr ')' block else - { copline = $1; - $$ = newCONDOP(0, - invert(scalar($3)), scope($5), $6); } - | IF block block else - { copline = $1; - $$ = newCONDOP(0, scope($2), scope($3), $4); } - | UNLESS block block else - { copline = $1; - $$ = newCONDOP(0, invert(scalar(scope($2))), - scope($3), $4); } + { $$ = (OP*)NULL; } + | ELSE mblock + { ($2)->op_flags |= OPf_PARENS; $$ = scope($2); + TOKEN_GETMAD($1,$$,'o'); + } + | ELSIF '(' mexpr ')' mblock else + { PL_parser->copline = (line_t)IVAL($1); + $$ = newCONDOP(0, newSTATEOP(OPf_SPECIAL,NULL,$3), scope($5), $6); + PL_hints |= HINT_BLOCK_SCOPE; + TOKEN_GETMAD($1,$$,'I'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + ; + +/* Real conditional expressions */ +cond : IF '(' remember mexpr ')' mblock else + { PL_parser->copline = (line_t)IVAL($1); + $$ = block_end($3, + newCONDOP(0, $4, scope($6), $7)); + TOKEN_GETMAD($1,$$,'I'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + | UNLESS '(' remember miexpr ')' mblock else + { PL_parser->copline = (line_t)IVAL($1); + $$ = block_end($3, + newCONDOP(0, $4, scope($6), $7)); + TOKEN_GETMAD($1,$$,'I'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } ; +/* Cases for a switch statement */ +case : WHEN '(' remember mexpr ')' mblock + { $$ = block_end($3, + newWHENOP($4, scope($6))); } + | DEFAULT block + { $$ = newWHENOP(0, scope($2)); } + ; + +/* Continue blocks */ cont : /* NULL */ - { $$ = Nullop; } + { $$ = (OP*)NULL; } | CONTINUE block - { $$ = scope($2); } - ; - -loop : label WHILE '(' texpr ')' block cont - { copline = $2; - $$ = newSTATEOP(0, $1, - newWHILEOP(0, 1, Nullop, $4, $6, $7) ); } - | label UNTIL '(' expr ')' block cont - { copline = $2; - $$ = newSTATEOP(0, $1, - newWHILEOP(0, 1, Nullop, - invert(scalar($4)), $6, $7) ); } - | label WHILE block block cont - { copline = $2; - $$ = newSTATEOP(0, $1, - newWHILEOP(0, 1, Nullop, - scope($3), $4, $5) ); } - | label UNTIL block block cont - { copline = $2; - $$ = newSTATEOP(0, $1, - newWHILEOP(0, 1, Nullop, - invert(scalar(scope($3))), $4, $5)); } - | label FOR scalar '(' expr crp block cont - { $$ = newFOROP(0, $1, $2, ref($3, OP_ENTERLOOP), - $5, $7, $8); } - | label FOR '(' expr crp block cont - { $$ = newFOROP(0, $1, $2, Nullop, $4, $6, $7); } - | label FOR '(' nexpr ';' texpr ';' nexpr ')' block + { $$ = scope($2); + TOKEN_GETMAD($1,$$,'o'); + } + ; + +/* Loops: while, until, for, and a bare block */ +loop : label WHILE '(' remember texpr ')' mintro mblock cont + { OP *innerop; + PL_parser->copline = (line_t)$2; + $$ = block_end($4, + newSTATEOP(0, PVAL($1), + innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL, + IVAL($2), $5, $8, $9, $7))); + TOKEN_GETMAD($1,innerop,'L'); + TOKEN_GETMAD($2,innerop,'W'); + TOKEN_GETMAD($3,innerop,'('); + TOKEN_GETMAD($6,innerop,')'); + } + + | label UNTIL '(' remember iexpr ')' mintro mblock cont + { OP *innerop; + PL_parser->copline = (line_t)$2; + $$ = block_end($4, + newSTATEOP(0, PVAL($1), + innerop = newWHILEOP(0, 1, (LOOP*)(OP*)NULL, + IVAL($2), $5, $8, $9, $7))); + TOKEN_GETMAD($1,innerop,'L'); + TOKEN_GETMAD($2,innerop,'W'); + TOKEN_GETMAD($3,innerop,'('); + TOKEN_GETMAD($6,innerop,')'); + } + | label FOR MY remember my_scalar '(' mexpr ')' mblock cont + { OP *innerop; + $$ = block_end($4, + innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2), + $5, $7, $9, $10)); + TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L'); + TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W'); + TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'d'); + TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,'('); + TOKEN_GETMAD($8,((LISTOP*)innerop)->op_first->op_sibling,')'); + } + | label FOR scalar '(' remember mexpr ')' mblock cont + { OP *innerop; + $$ = block_end($5, + innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2), + mod($3, OP_ENTERLOOP), $6, $8, $9)); + TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L'); + TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W'); + TOKEN_GETMAD($4,((LISTOP*)innerop)->op_first->op_sibling,'('); + TOKEN_GETMAD($7,((LISTOP*)innerop)->op_first->op_sibling,')'); + } + | label FOR '(' remember mexpr ')' mblock cont + { OP *innerop; + $$ = block_end($4, + innerop = newFOROP(0, PVAL($1), (line_t)IVAL($2), + (OP*)NULL, $5, $7, $8)); + TOKEN_GETMAD($1,((LISTOP*)innerop)->op_first,'L'); + TOKEN_GETMAD($2,((LISTOP*)innerop)->op_first->op_sibling,'W'); + TOKEN_GETMAD($3,((LISTOP*)innerop)->op_first->op_sibling,'('); + TOKEN_GETMAD($6,((LISTOP*)innerop)->op_first->op_sibling,')'); + } + | label FOR '(' remember mnexpr ';' texpr ';' mintro mnexpr ')' + mblock /* basically fake up an initialize-while lineseq */ - { copline = $2; - $$ = append_elem(OP_LINESEQ, - newSTATEOP(0, $1, scalar($4)), - newSTATEOP(0, $1, - newWHILEOP(0, 1, Nullop, - scalar($6), $10, scalar($8)) )); } + { OP *forop; + PL_parser->copline = (line_t)IVAL($2); + forop = newSTATEOP(0, PVAL($1), + newWHILEOP(0, 1, (LOOP*)(OP*)NULL, + IVAL($2), scalar($7), + $12, $10, $9)); +#ifdef MAD + forop = newUNOP(OP_NULL, 0, append_elem(OP_LINESEQ, + newSTATEOP(0, + CopLABEL_alloc(($1)->tk_lval.pval), + ($5 ? $5 : newOP(OP_NULL, 0)) ), + forop)); + + token_getmad($2,forop,'3'); + token_getmad($3,forop,'('); + token_getmad($6,forop,'1'); + token_getmad($8,forop,'2'); + token_getmad($11,forop,')'); + token_getmad($1,forop,'L'); +#else + if ($5) { + forop = append_elem(OP_LINESEQ, + newSTATEOP(0, CopLABEL_alloc($1), $5), + forop); + } + + +#endif + $$ = block_end($4, forop); } | label block cont /* a block is a loop that happens once */ - { $$ = newSTATEOP(0, - $1, newWHILEOP(0, 1, Nullop, Nullop, $2, $3)); } + { $$ = newSTATEOP(0, PVAL($1), + newWHILEOP(0, 1, (LOOP*)(OP*)NULL, + NOLINE, (OP*)NULL, $2, $3, 0)); + TOKEN_GETMAD($1,((LISTOP*)$$)->op_first,'L'); } + ; + +/* Switch blocks */ +switch : label GIVEN '(' remember mydefsv mexpr ')' mblock + { PL_parser->copline = (line_t) $2; + $$ = block_end($4, + newSTATEOP(0, PVAL($1), + newGIVENOP($6, scope($8), + (PADOFFSET) $5) )); } ; +/* determine whether there are any new my declarations */ +mintro : /* NULL */ + { $$ = (PL_min_intro_pending && + PL_max_intro_pending >= PL_min_intro_pending); + intro_my(); } + +/* Normal expression */ nexpr : /* NULL */ - { $$ = Nullop; } + { $$ = (OP*)NULL; } | sideff ; +/* Boolean expression */ texpr : /* NULL means true */ - { (void)scan_num("1"); $$ = yylval.opval; } + { YYSTYPE tmplval; + (void)scan_num("1", &tmplval); + $$ = tmplval.opval; } | expr ; +/* Inverted boolean expression */ +iexpr : expr + { $$ = invert(scalar($1)); } + ; + +/* Expression with its own lexical scope */ +mexpr : expr + { $$ = $1; intro_my(); } + ; + +mnexpr : nexpr + { $$ = $1; intro_my(); } + ; + +miexpr : iexpr + { $$ = $1; intro_my(); } + ; + +/* Optional "MAIN:"-style loop labels */ label : /* empty */ - { $$ = Nullch; } + { +#ifdef MAD + YYSTYPE tmplval; + tmplval.pval = NULL; + $$ = newTOKEN(OP_NULL, tmplval, 0); +#else + $$ = NULL; +#endif + } | LABEL ; +/* Some kind of declaration - just hang on peg in the parse tree */ decl : format - { $$ = 0; } + { $$ = $1; } | subrout - { $$ = 0; } + { $$ = $1; } + | mysubrout + { $$ = $1; } | package - { $$ = 0; } + { $$ = $1; } + | use + { $$ = $1; } + + /* these two are only used by MAD */ + + | peg + { $$ = $1; } ; -format : FORMAT WORD block - { newFORM($1, $2, $3); } - | FORMAT block - { newFORM($1, Nullop, $2); } +peg : PEG + { $$ = newOP(OP_NULL,0); + TOKEN_GETMAD($1,$$,'p'); + } + ; + +format : FORMAT startformsub formname block + { SvREFCNT_inc_simple_void(PL_compcv); +#ifdef MAD + $$ = newFORM($2, $3, $4); + prepend_madprops($1->tk_mad, $$, 'F'); + $1->tk_mad = 0; + token_free($1); +#else + newFORM($2, $3, $4); + $$ = (OP*)NULL; +#endif + } + ; + +formname: WORD { $$ = $1; } + | /* NULL */ { $$ = (OP*)NULL; } + ; + +/* Unimplemented "my sub foo { }" */ +mysubrout: MYSUB startsub subname proto subattrlist subbody + { SvREFCNT_inc_simple_void(PL_compcv); +#ifdef MAD + $$ = newMYSUB($2, $3, $4, $5, $6); + token_getmad($1,$$,'d'); +#else + newMYSUB($2, $3, $4, $5, $6); + $$ = (OP*)NULL; +#endif + } + ; + +/* Subroutine definition */ +subrout : SUB startsub subname proto subattrlist subbody + { SvREFCNT_inc_simple_void(PL_compcv); +#ifdef MAD + { + OP* o = newSVOP(OP_ANONCODE, 0, + (SV*)newATTRSUB($2, $3, $4, $5, $6)); + $$ = newOP(OP_NULL,0); + op_getmad(o,$$,'&'); + op_getmad($3,$$,'n'); + op_getmad($4,$$,'s'); + op_getmad($5,$$,'a'); + token_getmad($1,$$,'d'); + append_madprops($6->op_madprop, $$, 0); + $6->op_madprop = 0; + } +#else + newATTRSUB($2, $3, $4, $5, $6); + $$ = (OP*)NULL; +#endif + } + ; + +startsub: /* NULL */ /* start a regular subroutine scope */ + { $$ = start_subparse(FALSE, 0); + SAVEFREESV(PL_compcv); } + ; -subrout : SUB WORD block - { newSUB($1, $2, $3); } - | SUB WORD ';' - { newSUB($1, $2, Nullop); } +startanonsub: /* NULL */ /* start an anonymous subroutine scope */ + { $$ = start_subparse(FALSE, CVf_ANON); + SAVEFREESV(PL_compcv); } + ; + +startformsub: /* NULL */ /* start a format subroutine scope */ + { $$ = start_subparse(TRUE, 0); + SAVEFREESV(PL_compcv); } + ; + +/* Name of a subroutine - must be a bareword, could be special */ +subname : WORD { const char *const name = SvPV_nolen_const(((SVOP*)$1)->op_sv); + if (strEQ(name, "BEGIN") || strEQ(name, "END") + || strEQ(name, "INIT") || strEQ(name, "CHECK") + || strEQ(name, "UNITCHECK")) + CvSPECIAL_on(PL_compcv); + $$ = $1; } + ; + +/* Subroutine prototype */ +proto : /* NULL */ + { $$ = (OP*)NULL; } + | THING + ; + +/* Optional list of subroutine attributes */ +subattrlist: /* NULL */ + { $$ = (OP*)NULL; } + | COLONATTR THING + { $$ = $2; + TOKEN_GETMAD($1,$$,':'); + } + | COLONATTR + { $$ = IF_MAD( + newOP(OP_NULL, 0), + (OP*)NULL + ); + TOKEN_GETMAD($1,$$,':'); + } + ; + +/* List of attributes for a "my" variable declaration */ +myattrlist: COLONATTR THING + { $$ = $2; + TOKEN_GETMAD($1,$$,':'); + } + | COLONATTR + { $$ = IF_MAD( + newOP(OP_NULL, 0), + (OP*)NULL + ); + TOKEN_GETMAD($1,$$,':'); + } + ; + +/* Subroutine body - either null or a block */ +subbody : block { $$ = $1; } + | ';' { $$ = IF_MAD( + newOP(OP_NULL,0), + (OP*)NULL + ); + PL_parser->expect = XSTATE; + TOKEN_GETMAD($1,$$,';'); + } ; package : PACKAGE WORD ';' - { package($2); } - | PACKAGE ';' - { package(Nullop); } - ; - -expr : expr ',' sexpr - { $$ = append_elem(OP_LIST, $1, $3); } - | sexpr - ; - -listop : LSTOP indirob listexpr - { $$ = convert($1, OPf_STACKED, - prepend_elem(OP_LIST, newGVREF($2), $3) ); } - | FUNC '(' indirob listexpr ')' - { $$ = convert($1, OPf_STACKED, - prepend_elem(OP_LIST, newGVREF($3), $4) ); } - | indirob ARROW LSTOP listexpr - { $$ = convert($3, OPf_STACKED, - prepend_elem(OP_LIST, newGVREF($1), $4) ); } - | indirob ARROW FUNC '(' listexpr ')' - { $$ = convert($3, OPf_STACKED, - prepend_elem(OP_LIST, newGVREF($1), $5) ); } - | term ARROW METHOD '(' listexpr ')' - { $$ = convert(OP_ENTERSUBR, OPf_STACKED|OPf_SPECIAL, - prepend_elem(OP_LIST, newMETHOD($1,$3), $5)); } - | METHOD indirob listexpr - { $$ = convert(OP_ENTERSUBR, OPf_STACKED|OPf_SPECIAL, - prepend_elem(OP_LIST, newMETHOD($2,$1), $3)); } - | LSTOP listexpr - { $$ = convert($1, 0, $2); } - | FUNC '(' listexpr ')' - { $$ = convert($1, 0, $3); } - ; - -sexpr : sexpr '=' sexpr - { $$ = newASSIGNOP(OPf_STACKED, $1, $3); } - | sexpr POWOP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4)); } - | sexpr MULOP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4)); } - | sexpr ADDOP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4));} - | sexpr SHIFTOP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4)); } - | sexpr BITANDOP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4)); } - | sexpr BITOROP '=' sexpr - { $$ = newBINOP($2, OPf_STACKED, - ref(scalar($1), $2), scalar($4)); } - | sexpr ANDAND '=' sexpr - { $$ = newLOGOP(OP_ANDASSIGN, 0, - ref(scalar($1), OP_ANDASSIGN), - newUNOP(OP_SASSIGN, 0, scalar($4))); } - | sexpr OROR '=' sexpr - { $$ = newLOGOP(OP_ORASSIGN, 0, - ref(scalar($1), OP_ORASSIGN), - newUNOP(OP_SASSIGN, 0, scalar($4))); } - - - | sexpr POWOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr MULOP sexpr - { if ($2 != OP_REPEAT) - scalar($1); - $$ = newBINOP($2, 0, $1, scalar($3)); } - | sexpr ADDOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr SHIFTOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr RELOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr EQOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr BITANDOP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr BITOROP sexpr - { $$ = newBINOP($2, 0, scalar($1), scalar($3)); } - | sexpr DOTDOT sexpr - { $$ = newRANGE($2, scalar($1), scalar($3));} - | sexpr ANDAND sexpr - { $$ = newLOGOP(OP_AND, 0, $1, $3); } - | sexpr OROR sexpr - { $$ = newLOGOP(OP_OR, 0, $1, $3); } - | sexpr '?' sexpr ':' sexpr - { $$ = newCONDOP(0, $1, $3, $5); } - | sexpr MATCHOP sexpr - { $$ = bind_match($2, $1, $3); } - | term - { $$ = $1; } + { +#ifdef MAD + $$ = package($2); + token_getmad($1,$$,'o'); + token_getmad($3,$$,';'); +#else + package($2); + $$ = (OP*)NULL; +#endif + } + ; + +use : USE startsub + { CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ } + WORD WORD listexpr ';' + { SvREFCNT_inc_simple_void(PL_compcv); +#ifdef MAD + $$ = utilize(IVAL($1), $2, $4, $5, $6); + token_getmad($1,$$,'o'); + token_getmad($7,$$,';'); + if (PL_parser->rsfp_filters && + AvFILLp(PL_parser->rsfp_filters) >= 0) + append_madprops(newMADPROP('!', MAD_PV, "", 0), $$, 0); +#else + utilize(IVAL($1), $2, $4, $5, $6); + $$ = (OP*)NULL; +#endif + } + ; + +/* Ordinary expressions; logical combinations */ +expr : expr ANDOP expr + { $$ = newLOGOP(OP_AND, 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | expr OROP expr + { $$ = newLOGOP(IVAL($2), 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | expr DOROP expr + { $$ = newLOGOP(OP_DOR, 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | argexpr %prec PREC_LOW ; -term : '-' term %prec UMINUS - { $$ = newUNOP(OP_NEGATE, 0, scalar($2)); } - | '+' term %prec UMINUS - { $$ = $2; } - | '!' term - { $$ = newUNOP(OP_NOT, 0, scalar($2)); } - | '~' term - { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));} - | REFGEN term - { $$ = newUNOP(OP_REFGEN, 0, ref($2, OP_REFGEN)); } - | term POSTINC +/* Expressions are a list of terms joined by commas */ +argexpr : argexpr ',' + { +#ifdef MAD + OP* op = newNULLLIST(); + token_getmad($2,op,','); + $$ = append_elem(OP_LIST, $1, op); +#else + $$ = $1; +#endif + } + | argexpr ',' term + { + OP* term = $3; + DO_MAD( + term = newUNOP(OP_NULL, 0, term); + token_getmad($2,term,','); + ) + $$ = append_elem(OP_LIST, $1, term); + } + | term %prec PREC_LOW + ; + +/* List operators */ +listop : LSTOP indirob argexpr /* map {...} @args or print $fh @args */ + { $$ = convert(IVAL($1), OPf_STACKED, + prepend_elem(OP_LIST, newGVREF(IVAL($1),$2), $3) ); + TOKEN_GETMAD($1,$$,'o'); + } + | FUNC '(' indirob expr ')' /* print ($fh @args */ + { $$ = convert(IVAL($1), OPf_STACKED, + prepend_elem(OP_LIST, newGVREF(IVAL($1),$3), $4) ); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + | term ARROW method '(' listexprcom ')' /* $foo->bar(list) */ + { $$ = convert(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, + prepend_elem(OP_LIST, scalar($1), $5), + newUNOP(OP_METHOD, 0, $3))); + TOKEN_GETMAD($2,$$,'A'); + TOKEN_GETMAD($4,$$,'('); + TOKEN_GETMAD($6,$$,')'); + } + | term ARROW method /* $foo->bar */ + { $$ = convert(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, scalar($1), + newUNOP(OP_METHOD, 0, $3))); + TOKEN_GETMAD($2,$$,'A'); + } + | METHOD indirob listexpr /* new Class @args */ + { $$ = convert(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, + prepend_elem(OP_LIST, $2, $3), + newUNOP(OP_METHOD, 0, $1))); + } + | FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */ + { $$ = convert(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, + prepend_elem(OP_LIST, $2, $4), + newUNOP(OP_METHOD, 0, $1))); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + | LSTOP listexpr /* print @args */ + { $$ = convert(IVAL($1), 0, $2); + TOKEN_GETMAD($1,$$,'o'); + } + | FUNC '(' listexprcom ')' /* print (@args) */ + { $$ = convert(IVAL($1), 0, $3); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | LSTOPSUB startanonsub block /* sub f(&@); f { foo } ... */ + { SvREFCNT_inc_simple_void(PL_compcv); + $$ = newANONATTRSUB($2, 0, (OP*)NULL, $3); } + listexpr %prec LSTOP /* ... @bar */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, + prepend_elem(OP_LIST, $4, $5), $1)); + } + ; + +/* Names of methods. May use $object->$methodname */ +method : METHOD + | scalar + ; + +/* Some kind of subscripted expression */ +subscripted: star '{' expr ';' '}' /* *main::{something} */ + /* In this and all the hash accessors, ';' is + * provided by the tokeniser */ + { $$ = newBINOP(OP_GELEM, 0, $1, scalar($3)); + PL_parser->expect = XOPERATOR; + TOKEN_GETMAD($2,$$,'{'); + TOKEN_GETMAD($4,$$,';'); + TOKEN_GETMAD($5,$$,'}'); + } + | scalar '[' expr ']' /* $array[$element] */ + { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3)); + TOKEN_GETMAD($2,$$,'['); + TOKEN_GETMAD($4,$$,']'); + } + | term ARROW '[' expr ']' /* somearef->[$element] */ + { $$ = newBINOP(OP_AELEM, 0, + ref(newAVREF($1),OP_RV2AV), + scalar($4)); + TOKEN_GETMAD($2,$$,'a'); + TOKEN_GETMAD($3,$$,'['); + TOKEN_GETMAD($5,$$,']'); + } + | subscripted '[' expr ']' /* $foo->[$bar]->[$baz] */ + { $$ = newBINOP(OP_AELEM, 0, + ref(newAVREF($1),OP_RV2AV), + scalar($3)); + TOKEN_GETMAD($2,$$,'['); + TOKEN_GETMAD($4,$$,']'); + } + | scalar '{' expr ';' '}' /* $foo->{bar();} */ + { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3)); + PL_parser->expect = XOPERATOR; + TOKEN_GETMAD($2,$$,'{'); + TOKEN_GETMAD($4,$$,';'); + TOKEN_GETMAD($5,$$,'}'); + } + | term ARROW '{' expr ';' '}' /* somehref->{bar();} */ + { $$ = newBINOP(OP_HELEM, 0, + ref(newHVREF($1),OP_RV2HV), + jmaybe($4)); + PL_parser->expect = XOPERATOR; + TOKEN_GETMAD($2,$$,'a'); + TOKEN_GETMAD($3,$$,'{'); + TOKEN_GETMAD($5,$$,';'); + TOKEN_GETMAD($6,$$,'}'); + } + | subscripted '{' expr ';' '}' /* $foo->[bar]->{baz;} */ + { $$ = newBINOP(OP_HELEM, 0, + ref(newHVREF($1),OP_RV2HV), + jmaybe($3)); + PL_parser->expect = XOPERATOR; + TOKEN_GETMAD($2,$$,'{'); + TOKEN_GETMAD($4,$$,';'); + TOKEN_GETMAD($5,$$,'}'); + } + | term ARROW '(' ')' /* $subref->() */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + newCVREF(0, scalar($1))); + TOKEN_GETMAD($2,$$,'a'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | term ARROW '(' expr ')' /* $subref->(@args) */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, $4, + newCVREF(0, scalar($1)))); + TOKEN_GETMAD($2,$$,'a'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + + | subscripted '(' expr ')' /* $foo->{bar}->(@args) */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, $3, + newCVREF(0, scalar($1)))); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | subscripted '(' ')' /* $foo->{bar}->() */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + newCVREF(0, scalar($1))); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } + | '(' expr ')' '[' expr ']' /* list slice */ + { $$ = newSLICEOP(0, $5, $2); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($3,$$,')'); + TOKEN_GETMAD($4,$$,'['); + TOKEN_GETMAD($6,$$,']'); + } + | '(' ')' '[' expr ']' /* empty list slice! */ + { $$ = newSLICEOP(0, $4, (OP*)NULL); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($2,$$,')'); + TOKEN_GETMAD($3,$$,'['); + TOKEN_GETMAD($5,$$,']'); + } + ; + +/* Binary operators between terms */ +termbinop: term ASSIGNOP term /* $x = $y */ + { $$ = newASSIGNOP(OPf_STACKED, $1, IVAL($2), $3); + TOKEN_GETMAD($2,$$,'o'); + } + | term POWOP term /* $x ** $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term MULOP term /* $x * $y, $x x $y */ + { if (IVAL($2) != OP_REPEAT) + scalar($1); + $$ = newBINOP(IVAL($2), 0, $1, scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term ADDOP term /* $x + $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term SHIFTOP term /* $x >> $y, $x << $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term RELOP term /* $x > $y, etc. */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term EQOP term /* $x == $y, $x eq $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term BITANDOP term /* $x & $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term BITOROP term /* $x | $y */ + { $$ = newBINOP(IVAL($2), 0, scalar($1), scalar($3)); + TOKEN_GETMAD($2,$$,'o'); + } + | term DOTDOT term /* $x..$y, $x...$y */ + { + $$ = newRANGE(IVAL($2), scalar($1), scalar($3)); + DO_MAD({ + UNOP *op; + op = (UNOP*)$$; + op = (UNOP*)op->op_first; /* get to flop */ + op = (UNOP*)op->op_first; /* get to flip */ + op = (UNOP*)op->op_first; /* get to range */ + token_getmad($2,(OP*)op,'o'); + }) + } + | term ANDAND term /* $x && $y */ + { $$ = newLOGOP(OP_AND, 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | term OROR term /* $x || $y */ + { $$ = newLOGOP(OP_OR, 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | term DORDOR term /* $x // $y */ + { $$ = newLOGOP(OP_DOR, 0, $1, $3); + TOKEN_GETMAD($2,$$,'o'); + } + | term MATCHOP term /* $x =~ /$y/ */ + { $$ = bind_match(IVAL($2), $1, $3); + TOKEN_GETMAD($2, + ($$->op_type == OP_NOT + ? ((UNOP*)$$)->op_first : $$), + '~'); + } + ; + +/* Unary operators and terms */ +termunop : '-' term %prec UMINUS /* -$x */ + { $$ = newUNOP(OP_NEGATE, 0, scalar($2)); + TOKEN_GETMAD($1,$$,'o'); + } + | '+' term %prec UMINUS /* +$x */ + { $$ = IF_MAD( + newUNOP(OP_NULL, 0, $2), + $2 + ); + TOKEN_GETMAD($1,$$,'+'); + } + | '!' term /* !$x */ + { $$ = newUNOP(OP_NOT, 0, scalar($2)); + TOKEN_GETMAD($1,$$,'o'); + } + | '~' term /* ~$x */ + { $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2)); + TOKEN_GETMAD($1,$$,'o'); + } + | term POSTINC /* $x++ */ { $$ = newUNOP(OP_POSTINC, 0, - ref(scalar($1), OP_POSTINC)); } - | term POSTDEC + mod(scalar($1), OP_POSTINC)); + TOKEN_GETMAD($2,$$,'o'); + } + | term POSTDEC /* $x-- */ { $$ = newUNOP(OP_POSTDEC, 0, - ref(scalar($1), OP_POSTDEC)); } - | PREINC term + mod(scalar($1), OP_POSTDEC)); + TOKEN_GETMAD($2,$$,'o'); + } + | PREINC term /* ++$x */ { $$ = newUNOP(OP_PREINC, 0, - ref(scalar($2), OP_PREINC)); } - | PREDEC term + mod(scalar($2), OP_PREINC)); + TOKEN_GETMAD($1,$$,'o'); + } + | PREDEC term /* --$x */ { $$ = newUNOP(OP_PREDEC, 0, - ref(scalar($2), OP_PREDEC)); } - | LOCAL sexpr %prec UNIOP - { $$ = localize($2,$1); } - | '(' expr crp - { $$ = sawparens($2); } + mod(scalar($2), OP_PREDEC)); + TOKEN_GETMAD($1,$$,'o'); + } + + ; + +/* Constructors for anonymous data */ +anonymous: '[' expr ']' + { $$ = newANONLIST($2); + TOKEN_GETMAD($1,$$,'['); + TOKEN_GETMAD($3,$$,']'); + } + | '[' ']' + { $$ = newANONLIST((OP*)NULL); + TOKEN_GETMAD($1,$$,'['); + TOKEN_GETMAD($2,$$,']'); + } + | HASHBRACK expr ';' '}' %prec '(' /* { foo => "Bar" } */ + { $$ = newANONHASH($2); + TOKEN_GETMAD($1,$$,'{'); + TOKEN_GETMAD($3,$$,';'); + TOKEN_GETMAD($4,$$,'}'); + } + | HASHBRACK ';' '}' %prec '(' /* { } (';' by tokener) */ + { $$ = newANONHASH((OP*)NULL); + TOKEN_GETMAD($1,$$,'{'); + TOKEN_GETMAD($2,$$,';'); + TOKEN_GETMAD($3,$$,'}'); + } + | ANONSUB startanonsub proto subattrlist block %prec '(' + { SvREFCNT_inc_simple_void(PL_compcv); + $$ = newANONATTRSUB($2, $3, $4, $5); + TOKEN_GETMAD($1,$$,'o'); + OP_GETMAD($3,$$,'s'); + OP_GETMAD($4,$$,'a'); + } + + ; + +/* Things called with "do" */ +termdo : DO term %prec UNIOP /* do $filename */ + { $$ = dofile($2, IVAL($1)); + TOKEN_GETMAD($1,$$,'o'); + } + | DO block %prec '(' /* do { code */ + { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2)); + TOKEN_GETMAD($1,$$,'D'); + } + | DO WORD '(' ')' /* do somesub() */ + { $$ = newUNOP(OP_ENTERSUB, + OPf_SPECIAL|OPf_STACKED, + prepend_elem(OP_LIST, + scalar(newCVREF( + (OPpENTERSUB_AMPER<<8), + scalar($2) + )),(OP*)NULL)); dep(); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | DO WORD '(' expr ')' /* do somesub(@args) */ + { $$ = newUNOP(OP_ENTERSUB, + OPf_SPECIAL|OPf_STACKED, + append_elem(OP_LIST, + $4, + scalar(newCVREF( + (OPpENTERSUB_AMPER<<8), + scalar($2) + )))); dep(); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + | DO scalar '(' ')' /* do $subref () */ + { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED, + prepend_elem(OP_LIST, + scalar(newCVREF(0,scalar($2))), (OP*)NULL)); dep(); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | DO scalar '(' expr ')' /* do $subref (@args) */ + { $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED, + prepend_elem(OP_LIST, + $4, + scalar(newCVREF(0,scalar($2))))); dep(); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($3,$$,'('); + TOKEN_GETMAD($5,$$,')'); + } + + ; + +term : termbinop + | termunop + | anonymous + | termdo + | term '?' term ':' term + { $$ = newCONDOP(0, $1, $3, $5); + TOKEN_GETMAD($2,$$,'?'); + TOKEN_GETMAD($4,$$,':'); + } + | REFGEN term /* \$x, \@y, \%z */ + { $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN)); + TOKEN_GETMAD($1,$$,'o'); + } + | myattrterm %prec UNIOP + { $$ = $1; } + | LOCAL term %prec UNIOP + { $$ = localize($2,IVAL($1)); + TOKEN_GETMAD($1,$$,'k'); + } + | '(' expr ')' + { $$ = sawparens(IF_MAD(newUNOP(OP_NULL,0,$2), $2)); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } | '(' ')' - { $$ = newNULLLIST(); } - | '[' expr crb %prec '(' - { $$ = newANONLIST($2); } - | '[' ']' %prec '(' - { $$ = newANONLIST(Nullop); } - | HASHBRACK expr crhb %prec '(' - { $$ = newANONHASH($2); } - | HASHBRACK ';' '}' %prec '(' - { $$ = newANONHASH(Nullop); } + { $$ = sawparens(newNULLLIST()); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($2,$$,')'); + } | scalar %prec '(' { $$ = $1; } | star %prec '(' { $$ = $1; } - | scalar '[' expr ']' %prec '(' - { $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3)); } - | term ARROW '[' expr ']' %prec '(' - { $$ = newBINOP(OP_AELEM, 0, - scalar(ref(newAVREF($1),OP_RV2AV)), - scalar($4));} | hsh %prec '(' { $$ = $1; } | ary %prec '(' { $$ = $1; } - | arylen %prec '(' + | arylen %prec '(' /* $#x, $#{ something } */ { $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));} - | scalar '{' expr ';' '}' %prec '(' - { $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3)); - expect = XOPERATOR; } - | term ARROW '{' expr ';' '}' %prec '(' - { $$ = newBINOP(OP_HELEM, 0, - scalar(ref(newHVREF($1),OP_RV2HV)), - jmaybe($4)); - expect = XOPERATOR; } - | '(' expr crp '[' expr ']' %prec '(' - { $$ = newSLICEOP(0, $5, $2); } - | '(' ')' '[' expr ']' %prec '(' - { $$ = newSLICEOP(0, $4, Nullop); } - | ary '[' expr ']' %prec '(' + | subscripted + { $$ = $1; } + | ary '[' expr ']' /* array slice */ { $$ = prepend_elem(OP_ASLICE, newOP(OP_PUSHMARK, 0), - list( newLISTOP(OP_ASLICE, 0, list($3), - ref($1, OP_ASLICE)))); } - | ary '{' expr ';' '}' %prec '(' + ref($1, OP_ASLICE))); + TOKEN_GETMAD($2,$$,'['); + TOKEN_GETMAD($4,$$,']'); + } + | ary '{' expr ';' '}' /* @hash{@keys} */ { $$ = prepend_elem(OP_HSLICE, newOP(OP_PUSHMARK, 0), - list( newLISTOP(OP_HSLICE, 0, list($3), - ref(oopsHV($1), OP_HSLICE)))); - expect = XOPERATOR; } - | DELETE scalar '{' expr ';' '}' %prec '(' - { $$ = newBINOP(OP_DELETE, 0, oopsHV($2), jmaybe($4)); - expect = XOPERATOR; } - | DELETE '(' scalar '{' expr ';' '}' ')' %prec '(' - { $$ = newBINOP(OP_DELETE, 0, oopsHV($3), jmaybe($5)); - expect = XOPERATOR; } + ref(oopsHV($1), OP_HSLICE))); + PL_parser->expect = XOPERATOR; + TOKEN_GETMAD($2,$$,'{'); + TOKEN_GETMAD($4,$$,';'); + TOKEN_GETMAD($5,$$,'}'); + } | THING %prec '(' { $$ = $1; } - | amper - { $$ = newUNOP(OP_ENTERSUBR, 0, - scalar($1)); } - | amper '(' ')' - { $$ = newUNOP(OP_ENTERSUBR, OPf_STACKED, scalar($1)); } - | amper '(' expr crp - { $$ = newUNOP(OP_ENTERSUBR, OPf_STACKED, - list(prepend_elem(OP_LIST, scalar($1), $3))); } - | NOAMP WORD listexpr - { $$ = newUNOP(OP_ENTERSUBR, OPf_STACKED, - list(prepend_elem(OP_LIST, - newCVREF(scalar($2)), $3))); } - | DO sexpr %prec UNIOP - { $$ = newUNOP(OP_DOFILE, 0, scalar($2)); - allgvs = TRUE;} - | DO block %prec '(' - { $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2)); } - | DO WORD '(' ')' - { $$ = newUNOP(OP_ENTERSUBR, OPf_SPECIAL|OPf_STACKED, - list(prepend_elem(OP_LIST, - scalar(newCVREF(scalar($2))), newNULLLIST()))); } - | DO WORD '(' expr crp - { $$ = newUNOP(OP_ENTERSUBR, OPf_SPECIAL|OPf_STACKED, - list(prepend_elem(OP_LIST, - scalar(newCVREF(scalar($2))), - $4))); } - | DO scalar '(' ')' - { $$ = newUNOP(OP_ENTERSUBR, OPf_SPECIAL|OPf_STACKED, - list(prepend_elem(OP_LIST, - scalar(newCVREF(scalar($2))), newNULLLIST())));} - | DO scalar '(' expr crp - { $$ = newUNOP(OP_ENTERSUBR, OPf_SPECIAL|OPf_STACKED, - list(prepend_elem(OP_LIST, - scalar(newCVREF(scalar($2))), - $4))); } - | LOOPEX - { $$ = newOP($1, OPf_SPECIAL); } - | LOOPEX WORD - { $$ = newPVOP($1, 0, - savestr(SvPVnx(((SVOP*)$2)->op_sv))); - op_free($2); } - | UNIOP - { $$ = newOP($1, 0); } - | UNIOP block - { $$ = newUNOP($1, 0, $2); } - | UNIOP sexpr - { $$ = newUNOP($1, 0, $2); } - | FUNC0 - { $$ = newOP($1, 0); } + | amper /* &foo; */ + { $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); } + | amper '(' ')' /* &foo() */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } + | amper '(' expr ')' /* &foo(@args) */ + { + $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, $3, scalar($1))); + DO_MAD({ + OP* op = $$; + if (op->op_type == OP_CONST) { /* defeat const fold */ + op = (OP*)op->op_madprop->mad_val; + } + token_getmad($2,op,'('); + token_getmad($4,op,')'); + }) + } + | NOAMP WORD listexpr /* foo(@args) */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, $3, scalar($2))); + TOKEN_GETMAD($1,$$,'o'); + } + | LOOPEX /* loop exiting command (goto, last, dump, etc) */ + { $$ = newOP(IVAL($1), OPf_SPECIAL); + PL_hints |= HINT_BLOCK_SCOPE; + TOKEN_GETMAD($1,$$,'o'); + } + | LOOPEX term + { $$ = newLOOPEX(IVAL($1),$2); + TOKEN_GETMAD($1,$$,'o'); + } + | NOTOP argexpr /* not $foo */ + { $$ = newUNOP(OP_NOT, 0, scalar($2)); + TOKEN_GETMAD($1,$$,'o'); + } + | UNIOP /* Unary op, $_ implied */ + { $$ = newOP(IVAL($1), 0); + TOKEN_GETMAD($1,$$,'o'); + } + | UNIOP block /* eval { foo }* */ + { $$ = newUNOP(IVAL($1), 0, $2); + TOKEN_GETMAD($1,$$,'o'); + } + | UNIOP term /* Unary op */ + { $$ = newUNOP(IVAL($1), 0, $2); + TOKEN_GETMAD($1,$$,'o'); + } + | REQUIRE /* require, $_ implied */ + { $$ = newOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0); + TOKEN_GETMAD($1,$$,'o'); + } + | REQUIRE term /* require Foo */ + { $$ = newUNOP(OP_REQUIRE, $1 ? OPf_SPECIAL : 0, $2); + TOKEN_GETMAD($1,$$,'o'); + } + | UNIOPSUB + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); } + | UNIOPSUB term /* Sub treated as unop */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + append_elem(OP_LIST, $2, scalar($1))); } + | FUNC0 /* Nullary operator */ + { $$ = newOP(IVAL($1), 0); + TOKEN_GETMAD($1,$$,'o'); + } | FUNC0 '(' ')' - { $$ = newOP($1, 0); } - | FUNC1 '(' ')' - { $$ = newOP($1, OPf_SPECIAL); } - | FUNC1 '(' expr ')' - { $$ = newUNOP($1, 0, $3); } - | PMFUNC '(' sexpr ')' - { $$ = pmruntime($1, $3, Nullop); } - | PMFUNC '(' sexpr ',' sexpr ')' - { $$ = pmruntime($1, $3, $5); } + { $$ = newOP(IVAL($1), 0); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } + | FUNC0SUB /* Sub treated as nullop */ + { $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, + scalar($1)); } + | FUNC1 '(' ')' /* not () */ + { $$ = (IVAL($1) == OP_NOT) + ? newUNOP(IVAL($1), 0, newSVOP(OP_CONST, 0, newSViv(0))) + : newOP(IVAL($1), OPf_SPECIAL); + + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } + | FUNC1 '(' expr ')' /* not($foo) */ + { $$ = newUNOP(IVAL($1), 0, $3); + TOKEN_GETMAD($1,$$,'o'); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } + | PMFUNC '(' argexpr ')' /* m//, s///, tr/// */ + { $$ = pmruntime($1, $3, 1); + TOKEN_GETMAD($2,$$,'('); + TOKEN_GETMAD($4,$$,')'); + } | WORD | listop + | YADAYADA + { + $$ = newLISTOP(OP_DIE, 0, newOP(OP_PUSHMARK, 0), + newSVOP(OP_CONST, 0, newSVpvs("Unimplemented"))); + } + ; + +/* "my" declarations, with optional attributes */ +myattrterm: MY myterm myattrlist + { $$ = my_attrs($2,$3); + DO_MAD( + token_getmad($1,$$,'d'); + append_madprops($3->op_madprop, $$, 'a'); + $3->op_madprop = 0; + ) + } + | MY myterm + { $$ = localize($2,IVAL($1)); + TOKEN_GETMAD($1,$$,'d'); + } + ; + +/* Things that can be "my"'d */ +myterm : '(' expr ')' + { $$ = sawparens($2); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($3,$$,')'); + } + | '(' ')' + { $$ = sawparens(newNULLLIST()); + TOKEN_GETMAD($1,$$,'('); + TOKEN_GETMAD($2,$$,')'); + } + | scalar %prec '(' + { $$ = $1; } + | hsh %prec '(' + { $$ = $1; } + | ary %prec '(' + { $$ = $1; } ; -listexpr: /* NULL */ - { $$ = newNULLLIST(); } +/* Basic list expressions */ +listexpr: /* NULL */ %prec PREC_LOW + { $$ = (OP*)NULL; } + | argexpr %prec PREC_LOW + { $$ = $1; } + ; + +listexprcom: /* NULL */ + { $$ = (OP*)NULL; } | expr { $$ = $1; } + | expr ',' + { +#ifdef MAD + OP* op = newNULLLIST(); + token_getmad($2,op,','); + $$ = append_elem(OP_LIST, $1, op); +#else + $$ = $1; +#endif + + } + ; + +/* A little bit of trickery to make "for my $foo (@bar)" actually be + lexical */ +my_scalar: scalar + { PL_parser->in_my = 0; $$ = my($1); } ; amper : '&' indirob - { $$ = newCVREF($2); } + { $$ = newCVREF(IVAL($1),$2); + TOKEN_GETMAD($1,$$,'&'); + } ; scalar : '$' indirob - { $$ = newSVREF($2); } + { $$ = newSVREF($2); + TOKEN_GETMAD($1,$$,'$'); + } ; ary : '@' indirob - { $$ = newAVREF($2); } + { $$ = newAVREF($2); + TOKEN_GETMAD($1,$$,'@'); + } ; hsh : '%' indirob - { $$ = newHVREF($2); } + { $$ = newHVREF($2); + TOKEN_GETMAD($1,$$,'%'); + } ; arylen : DOLSHARP indirob - { $$ = newAVREF($2); } + { $$ = newAVREF($2); + TOKEN_GETMAD($1,$$,'l'); + } ; star : '*' indirob - { $$ = newGVREF($2); } + { $$ = newGVREF(0,$2); + TOKEN_GETMAD($1,$$,'*'); + } ; +/* Indirect objects */ indirob : WORD { $$ = scalar($1); } - | scalar + | scalar %prec PREC_LOW { $$ = scalar($1); } | block - { $$ = scalar(scope($1)); } + { $$ = scope($1); } | PRIVATEREF { $$ = $1; } ; - -crp : ',' ')' - { $$ = 1; } - | ')' - { $$ = 0; } - ; - -crb : ',' ']' - { $$ = 1; } - | ']' - { $$ = 0; } - ; - -crhb : ',' ';' '}' - { $$ = 1; } - | ';' '}' - { $$ = 0; } - ; - -%% /* PROGRAM */