PageRenderTime 65ms CodeModel.GetById 33ms RepoModel.GetById 0ms app.codeStats 0ms

/opensource.apple.com/source/perl/perl-24.1/perl/perly.y

#
Happy | 826 lines | 738 code | 88 blank | 0 comment | 0 complexity | 3431f398193b00c0ae28185c1fe59aae MD5 | raw file
Possible License(s): LGPL-2.0, MPL-2.0, GPL-2.0, ISC, LGPL-2.1, Apache-2.0, MPL-2.0-no-copyleft-exception, BSD-3-Clause, WTFPL, MIT, AGPL-1.0, AGPL-3.0 
    

  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
    2. 

  2.     "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
    3. 

  3. <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
    4. 

  4. <head>
    5. 

  5. <title>perly.y</title>
    6. 

  6. <style type="text/css">
    7. 

  7. .enscript-comment { font-style: italic; color: rgb(178,34,34); }
    8. 

  8. .enscript-function-name { font-weight: bold; color: rgb(0,0,255); }
    9. 

  9. .enscript-variable-name { font-weight: bold; color: rgb(184,134,11); }
    10. 

  10. .enscript-keyword { font-weight: bold; color: rgb(160,32,240); }
    11. 

  11. .enscript-reference { font-weight: bold; color: rgb(95,158,160); }
    12. 

  12. .enscript-string { font-weight: bold; color: rgb(188,143,143); }
    13. 

  13. .enscript-builtin { font-weight: bold; color: rgb(218,112,214); }
    14. 

  14. .enscript-type { font-weight: bold; color: rgb(34,139,34); }
    15. 

  15. .enscript-highlight { text-decoration: underline; color: 0; }
    16. 

  16. </style>
    17. 

  17. </head>
    18. 

  18. <body id="top">
    19. 

  19. <h1 style="margin:8px;" id="f1">perly.y&nbsp;&nbsp;&nbsp;<span style="font-weight: normal; font-size: 0.5em;">[<a href="?txt">plain text</a>]</span></h1>
    20. 

  20. <hr/>
    21. 

  21. <div></div>
    22. 

  22. <pre>
    23. 

  23. /*    perly.y
    24. 

  24.  *
    25. 

  25.  *    Copyright (c) 1991-2002, Larry Wall
    26. 

  26.  *
    27. 

  27.  *    You may distribute under the terms of either the GNU General Public
    28. 

  28.  *    License or the Artistic License, as specified in the README file.
    29. 

  29.  *
    30. 

  30.  */
    31. 

  31. 

  32. /*
    33. 

  33.  * 'I see,' laughed Strider.  'I look foul and feel fair.  Is that it?
    34. 

  34.  * All that is gold does not glitter, not all those who wander are lost.'
    35. 

  35.  */
    36. 

  36. 

  37. %{
    38. 

  38. #include &quot;EXTERN.h&quot;
    39. 

  39. #define PERL_IN_PERLY_C
    40. 

  40. #include &quot;perl.h&quot;
    41. 

  41. #ifdef EBCDIC
    42. 

  42. #undef YYDEBUG
    43. 

  43. #endif
    44. 

  44. #define dep() deprecate(&quot;\&quot;do\&quot; to call subroutines&quot;)
    45. 

  45. 

  46. /* stuff included here to make perly_c.diff apply better */
    47. 

  47. 

  48. #define yydebug	    PL_yydebug
    49. 

  49. #define yynerrs	    PL_yynerrs
    50. 

  50. #define yyerrflag   PL_yyerrflag
    51. 

  51. #define yychar	    PL_yychar
    52. 

  52. #define yyval	    PL_yyval
    53. 

  53. #define yylval	    PL_yylval
    54. 

  54. 

  55. struct ysv {
    56. 

  56.     short* yyss;
    57. 

  57.     YYSTYPE* yyvs;
    58. 

  58.     int oldyydebug;
    59. 

  59.     int oldyynerrs;
    60. 

  60.     int oldyyerrflag;
    61. 

  61.     int oldyychar;
    62. 

  62.     YYSTYPE oldyyval;
    63. 

  63.     YYSTYPE oldyylval;
    64. 

  64. };
    65. 

  65. 

  66. static void yydestruct(pTHX_ void *ptr);
    67. 

  67. 

  68. %}
    69. 

  69. 

  70. %start prog
    71. 

  71. 

  72. %{
    73. 

  73. #if 0 /* get this from perly.h instead */
    74. 

  74. %}
    75. 

  75. 

  76. %union {
    77. 

  77.     I32	ival;
    78. 

  78.     char *pval;
    79. 

  79.     OP *opval;
    80. 

  80.     GV *gvval;
    81. 

  81. }
    82. 

  82. 

  83. %{
    84. 

  84. #endif /* 0 */
    85. 

  85. 

  86. #ifdef USE_PURE_BISON
    87. 

  87. #define YYLEX_PARAM (&amp;yychar)
    88. 

  88. #define yylex yylex_r
    89. 

  89. #endif
    90. 

  90. 

  91. %}
    92. 

  92. 

  93. %token &lt;ival&gt; '{'
    94. 

  94. 

  95. %token &lt;opval&gt; WORD METHOD FUNCMETH THING PMFUNC PRIVATEREF
    96. 

  96. %token &lt;opval&gt; FUNC0SUB UNIOPSUB LSTOPSUB
    97. 

  97. %token &lt;pval&gt; LABEL
    98. 

  98. %token &lt;ival&gt; FORMAT SUB ANONSUB PACKAGE USE
    99. 

  99. %token &lt;ival&gt; WHILE UNTIL IF UNLESS ELSE ELSIF CONTINUE FOR
    100. 

  100. %token &lt;ival&gt; LOOPEX DOTDOT
    101. 

  101. %token &lt;ival&gt; FUNC0 FUNC1 FUNC UNIOP LSTOP
    102. 

  102. %token &lt;ival&gt; RELOP EQOP MULOP ADDOP
    103. 

  103. %token &lt;ival&gt; DOLSHARP DO HASHBRACK NOAMP
    104. 

  104. %token &lt;ival&gt; LOCAL MY MYSUB
    105. 

  105. %token COLONATTR
    106. 

  106. 

  107. %type &lt;ival&gt; prog decl format startsub startanonsub startformsub
    108. 

  108. %type &lt;ival&gt; progstart remember mremember '&amp;'
    109. 

  109. %type &lt;opval&gt; block mblock lineseq line loop cond else
    110. 

  110. %type &lt;opval&gt; expr term subscripted scalar ary hsh arylen star amper sideff
    111. 

  111. %type &lt;opval&gt; argexpr nexpr texpr iexpr mexpr mnexpr mtexpr miexpr
    112. 

  112. %type &lt;opval&gt; listexpr listexprcom indirob listop method
    113. 

  113. %type &lt;opval&gt; formname subname proto subbody cont my_scalar
    114. 

  114. %type &lt;opval&gt; subattrlist myattrlist mysubrout myattrterm myterm
    115. 

  115. %type &lt;opval&gt; termbinop termunop anonymous termdo
    116. 

  116. %type &lt;pval&gt; label
    117. 

  117. 

  118. %nonassoc PREC_LOW
    119. 

  119. %nonassoc LOOPEX
    120. 

  120. 

  121. %left &lt;ival&gt; OROP
    122. 

  122. %left ANDOP
    123. 

  123. %right NOTOP
    124. 

  124. %nonassoc LSTOP LSTOPSUB
    125. 

  125. %left ','
    126. 

  126. %right &lt;ival&gt; ASSIGNOP
    127. 

  127. %right '?' ':'
    128. 

  128. %nonassoc DOTDOT
    129. 

  129. %left OROR
    130. 

  130. %left ANDAND
    131. 

  131. %left &lt;ival&gt; BITOROP
    132. 

  132. %left &lt;ival&gt; BITANDOP
    133. 

  133. %nonassoc EQOP
    134. 

  134. %nonassoc RELOP
    135. 

  135. %nonassoc UNIOP UNIOPSUB
    136. 

  136. %left &lt;ival&gt; SHIFTOP
    137. 

  137. %left ADDOP
    138. 

  138. %left MULOP
    139. 

  139. %left &lt;ival&gt; MATCHOP
    140. 

  140. %right '!' '~' UMINUS REFGEN
    141. 

  141. %right &lt;ival&gt; POWOP
    142. 

  142. %nonassoc PREINC PREDEC POSTINC POSTDEC
    143. 

  143. %left ARROW
    144. 

  144. %nonassoc &lt;ival&gt; ')'
    145. 

  145. %left '('
    146. 

  146. %left '[' '{'
    147. 

  147. 

  148. %% /* RULES */
    149. 

  149. 

  150. /* The whole program */
    151. 

  151. prog	:	progstart
    152. 

  152. 	/*CONTINUED*/	lineseq
    153. 

  153. 			{ $$ = $1; newPROG(block_end($1,$2)); }
    154. 

  154. 	;
    155. 

  155. 

  156. /* An ordinary block */
    157. 

  157. block	:	'{' remember lineseq '}'
    158. 

  158. 			{ if (PL_copline &gt; (line_t)$1)
    159. 

  159. 			      PL_copline = (line_t)$1;
    160. 

  160. 			  $$ = block_end($2, $3); }
    161. 

  161. 	;
    162. 

  162. 

  163. remember:	/* NULL */	/* start a full lexical scope */
    164. 

  164. 			{ $$ = block_start(TRUE); }
    165. 

  165. 	;
    166. 

  166. 

  167. progstart:
    168. 

  168. 		{
    169. 

  169. #if defined(YYDEBUG) &amp;&amp; defined(DEBUGGING)
    170. 

  170. 		    yydebug = (DEBUG_p_TEST);
    171. 

  171. #endif
    172. 

  172. 		    PL_expect = XSTATE; $$ = block_start(TRUE);
    173. 

  173. 		}
    174. 

  174. 	;
    175. 

  175. 

  176. 

  177. mblock	:	'{' mremember lineseq '}'
    178. 

  178. 			{ if (PL_copline &gt; (line_t)$1)
    179. 

  179. 			      PL_copline = (line_t)$1;
    180. 

  180. 			  $$ = block_end($2, $3); }
    181. 

  181. 	;
    182. 

  182. 

  183. mremember:	/* NULL */	/* start a partial lexical scope */
    184. 

  184. 			{ $$ = block_start(FALSE); }
    185. 

  185. 	;
    186. 

  186. 

  187. /* A collection of &quot;lines&quot; in the program */
    188. 

  188. lineseq	:	/* NULL */
    189. 

  189. 			{ $$ = Nullop; }
    190. 

  190. 	|	lineseq decl
    191. 

  191. 			{ $$ = $1; }
    192. 

  192. 	|	lineseq line
    193. 

  193. 			{   $$ = append_list(OP_LINESEQ,
    194. 

  194. 				(LISTOP*)$1, (LISTOP*)$2);
    195. 

  195. 			    PL_pad_reset_pending = TRUE;
    196. 

  196. 			    if ($1 &amp;&amp; $2) PL_hints |= HINT_BLOCK_SCOPE; }
    197. 

  197. 	;
    198. 

  198. 

  199. /* A &quot;line&quot; in the program */
    200. 

  200. line	:	label cond
    201. 

  201. 			{ $$ = newSTATEOP(0, $1, $2); }
    202. 

  202. 	|	loop	/* loops add their own labels */
    203. 

  203. 	|	label ';'
    204. 

  204. 			{ if ($1 != Nullch) {
    205. 

  205. 			      $$ = newSTATEOP(0, $1, newOP(OP_NULL, 0));
    206. 

  206. 			    }
    207. 

  207. 			    else {
    208. 

  208. 			      $$ = Nullop;
    209. 

  209. 			      PL_copline = NOLINE;
    210. 

  210. 			    }
    211. 

  211. 			    PL_expect = XSTATE; }
    212. 

  212. 	|	label sideff ';'
    213. 

  213. 			{ $$ = newSTATEOP(0, $1, $2);
    214. 

  214. 			  PL_expect = XSTATE; }
    215. 

  215. 	;
    216. 

  216. 

  217. /* An expression which may have a side-effect */
    218. 

  218. sideff	:	error
    219. 

  219. 			{ $$ = Nullop; }
    220. 

  220. 	|	expr
    221. 

  221. 			{ $$ = $1; }
    222. 

  222. 	|	expr IF expr
    223. 

  223. 			{ $$ = newLOGOP(OP_AND, 0, $3, $1); }
    224. 

  224. 	|	expr UNLESS expr
    225. 

  225. 			{ $$ = newLOGOP(OP_OR, 0, $3, $1); }
    226. 

  226. 	|	expr WHILE expr
    227. 

  227. 			{ $$ = newLOOPOP(OPf_PARENS, 1, scalar($3), $1); }
    228. 

  228. 	|	expr UNTIL iexpr
    229. 

  229. 			{ $$ = newLOOPOP(OPf_PARENS, 1, $3, $1);}
    230. 

  230. 	|	expr FOR expr
    231. 

  231. 			{ $$ = newFOROP(0, Nullch, (line_t)$2,
    232. 

  232. 					Nullop, $3, $1, Nullop); }
    233. 

  233. 	;
    234. 

  234. 

  235. /* else and elsif blocks */
    236. 

  236. else	:	/* NULL */
    237. 

  237. 			{ $$ = Nullop; }
    238. 

  238. 	|	ELSE mblock
    239. 

  239. 			{ ($2)-&gt;op_flags |= OPf_PARENS; $$ = scope($2); }
    240. 

  240. 	|	ELSIF '(' mexpr ')' mblock else
    241. 

  241. 			{ PL_copline = (line_t)$1;
    242. 

  242. 			    $$ = newCONDOP(0, $3, scope($5), $6);
    243. 

  243. 			    PL_hints |= HINT_BLOCK_SCOPE; }
    244. 

  244. 	;
    245. 

  245. 

  246. /* Real conditional expressions */
    247. 

  247. cond	:	IF '(' remember mexpr ')' mblock else
    248. 

  248. 			{ PL_copline = (line_t)$1;
    249. 

  249. 			    $$ = block_end($3,
    250. 

  250. 				   newCONDOP(0, $4, scope($6), $7)); }
    251. 

  251. 	|	UNLESS '(' remember miexpr ')' mblock else
    252. 

  252. 			{ PL_copline = (line_t)$1;
    253. 

  253. 			    $$ = block_end($3,
    254. 

  254. 				   newCONDOP(0, $4, scope($6), $7)); }
    255. 

  255. 	;
    256. 

  256. 

  257. /* Continue blocks */
    258. 

  258. cont	:	/* NULL */
    259. 

  259. 			{ $$ = Nullop; }
    260. 

  260. 	|	CONTINUE block
    261. 

  261. 			{ $$ = scope($2); }
    262. 

  262. 	;
    263. 

  263. 

  264. /* Loops: while, until, for, and a bare block */
    265. 

  265. loop	:	label WHILE '(' remember mtexpr ')' mblock cont
    266. 

  266. 			{ PL_copline = (line_t)$2;
    267. 

  267. 			    $$ = block_end($4,
    268. 

  268. 				   newSTATEOP(0, $1,
    269. 

  269. 				     newWHILEOP(0, 1, (LOOP*)Nullop,
    270. 

  270. 						$2, $5, $7, $8))); }
    271. 

  271. 	|	label UNTIL '(' remember miexpr ')' mblock cont
    272. 

  272. 			{ PL_copline = (line_t)$2;
    273. 

  273. 			    $$ = block_end($4,
    274. 

  274. 				   newSTATEOP(0, $1,
    275. 

  275. 				     newWHILEOP(0, 1, (LOOP*)Nullop,
    276. 

  276. 						$2, $5, $7, $8))); }
    277. 

  277. 	|	label FOR MY remember my_scalar '(' mexpr ')' mblock cont
    278. 

  278. 			{ $$ = block_end($4,
    279. 

  279. 				 newFOROP(0, $1, (line_t)$2, $5, $7, $9, $10)); }
    280. 

  280. 	|	label FOR scalar '(' remember mexpr ')' mblock cont
    281. 

  281. 			{ $$ = block_end($5,
    282. 

  282. 				 newFOROP(0, $1, (line_t)$2, mod($3, OP_ENTERLOOP),
    283. 

  283. 					  $6, $8, $9)); }
    284. 

  284. 	|	label FOR '(' remember mexpr ')' mblock cont
    285. 

  285. 			{ $$ = block_end($4,
    286. 

  286. 				 newFOROP(0, $1, (line_t)$2, Nullop, $5, $7, $8)); }
    287. 

  287. 	|	label FOR '(' remember mnexpr ';' mtexpr ';' mnexpr ')' mblock
    288. 

  288. 			/* basically fake up an initialize-while lineseq */
    289. 

  289. 			{ OP *forop;
    290. 

  290. 			  PL_copline = (line_t)$2;
    291. 

  291. 			  forop = newSTATEOP(0, $1,
    292. 

  292. 					    newWHILEOP(0, 1, (LOOP*)Nullop,
    293. 

  293. 						$2, scalar($7),
    294. 

  294. 						$11, $9));
    295. 

  295. 			  if ($5) {
    296. 

  296. 				forop = append_elem(OP_LINESEQ,
    297. 

  297.                                         newSTATEOP(0, ($1?savepv($1):Nullch),
    298. 

  298. 						   $5),
    299. 

  299. 					forop);
    300. 

  300. 			  }
    301. 

  301. 

  302. 			  $$ = block_end($4, forop); }
    303. 

  303. 	|	label block cont  /* a block is a loop that happens once */
    304. 

  304. 			{ $$ = newSTATEOP(0, $1,
    305. 

  305. 				 newWHILEOP(0, 1, (LOOP*)Nullop,
    306. 

  306. 					    NOLINE, Nullop, $2, $3)); }
    307. 

  307. 	;
    308. 

  308. 

  309. /* Normal expression */
    310. 

  310. nexpr	:	/* NULL */
    311. 

  311. 			{ $$ = Nullop; }
    312. 

  312. 	|	sideff
    313. 

  313. 	;
    314. 

  314. 

  315. /* Boolean expression */
    316. 

  316. texpr	:	/* NULL means true */
    317. 

  317. 			{ (void)scan_num(&quot;1&quot;, &amp;yylval); $$ = yylval.opval; }
    318. 

  318. 	|	expr
    319. 

  319. 	;
    320. 

  320. 

  321. /* Inverted boolean expression */
    322. 

  322. iexpr	:	expr
    323. 

  323. 			{ $$ = invert(scalar($1)); }
    324. 

  324. 	;
    325. 

  325. 

  326. /* Expression with its own lexical scope */
    327. 

  327. mexpr	:	expr
    328. 

  328. 			{ $$ = $1; intro_my(); }
    329. 

  329. 	;
    330. 

  330. 

  331. mnexpr	:	nexpr
    332. 

  332. 			{ $$ = $1; intro_my(); }
    333. 

  333. 	;
    334. 

  334. 

  335. mtexpr	:	texpr
    336. 

  336. 			{ $$ = $1; intro_my(); }
    337. 

  337. 	;
    338. 

  338. 

  339. miexpr	:	iexpr
    340. 

  340. 			{ $$ = $1; intro_my(); }
    341. 

  341. 	;
    342. 

  342. 

  343. /* Optional &quot;MAIN:&quot;-style loop labels */
    344. 

  344. label	:	/* empty */
    345. 

  345. 			{ $$ = Nullch; }
    346. 

  346. 	|	LABEL
    347. 

  347. 	;
    348. 

  348. 

  349. /* Some kind of declaration - does not take part in the parse tree */
    350. 

  350. decl	:	format
    351. 

  351. 			{ $$ = 0; }
    352. 

  352. 	|	subrout
    353. 

  353. 			{ $$ = 0; }
    354. 

  354. 	|	mysubrout
    355. 

  355. 			{ $$ = 0; }
    356. 

  356. 	|	package
    357. 

  357. 			{ $$ = 0; }
    358. 

  358. 	|	use
    359. 

  359. 			{ $$ = 0; }
    360. 

  360. 	;
    361. 

  361. 

  362. format	:	FORMAT startformsub formname block
    363. 

  363. 			{ newFORM($2, $3, $4); }
    364. 

  364. 	;
    365. 

  365. 

  366. formname:	WORD		{ $$ = $1; }
    367. 

  367. 	|	/* NULL */	{ $$ = Nullop; }
    368. 

  368. 	;
    369. 

  369. 

  370. /* Unimplemented &quot;my sub foo { }&quot; */
    371. 

  371. mysubrout:	MYSUB startsub subname proto subattrlist subbody
    372. 

  372. 			{ newMYSUB($2, $3, $4, $5, $6); }
    373. 

  373. 	;
    374. 

  374. 

  375. /* Subroutine definition */
    376. 

  376. subrout	:	SUB startsub subname proto subattrlist subbody
    377. 

  377. 			{ newATTRSUB($2, $3, $4, $5, $6); }
    378. 

  378. 	;
    379. 

  379. 

  380. startsub:	/* NULL */	/* start a regular subroutine scope */
    381. 

  381. 			{ $$ = start_subparse(FALSE, 0); }
    382. 

  382. 	;
    383. 

  383. 

  384. startanonsub:	/* NULL */	/* start an anonymous subroutine scope */
    385. 

  385. 			{ $$ = start_subparse(FALSE, CVf_ANON); }
    386. 

  386. 	;
    387. 

  387. 

  388. startformsub:	/* NULL */	/* start a format subroutine scope */
    389. 

  389. 			{ $$ = start_subparse(TRUE, 0); }
    390. 

  390. 	;
    391. 

  391. 

  392. /* Name of a subroutine - must be a bareword, could be special */
    393. 

  393. subname	:	WORD	{ STRLEN n_a; char *name = SvPV(((SVOP*)$1)-&gt;op_sv,n_a);
    394. 

  394. 			  if (strEQ(name, &quot;BEGIN&quot;) || strEQ(name, &quot;END&quot;)
    395. 

  395. 			      || strEQ(name, &quot;INIT&quot;) || strEQ(name, &quot;CHECK&quot;))
    396. 

  396. 			      CvSPECIAL_on(PL_compcv);
    397. 

  397. 			  $$ = $1; }
    398. 

  398. 	;
    399. 

  399. 

  400. /* Subroutine prototype */
    401. 

  401. proto	:	/* NULL */
    402. 

  402. 			{ $$ = Nullop; }
    403. 

  403. 	|	THING
    404. 

  404. 	;
    405. 

  405. 

  406. /* Optional list of subroutine attributes */
    407. 

  407. subattrlist:	/* NULL */
    408. 

  408. 			{ $$ = Nullop; }
    409. 

  409. 	|	COLONATTR THING
    410. 

  410. 			{ $$ = $2; }
    411. 

  411. 	|	COLONATTR
    412. 

  412. 			{ $$ = Nullop; }
    413. 

  413. 	;
    414. 

  414. 

  415. /* List of attributes for a &quot;my&quot; variable declaration */
    416. 

  416. myattrlist:	COLONATTR THING
    417. 

  417. 			{ $$ = $2; }
    418. 

  418. 	|	COLONATTR
    419. 

  419. 			{ $$ = Nullop; }
    420. 

  420. 	;
    421. 

  421. 

  422. /* Subroutine body - either null or a block */
    423. 

  423. subbody	:	block	{ $$ = $1; }
    424. 

  424. 	|	';'	{ $$ = Nullop; PL_expect = XSTATE; }
    425. 

  425. 	;
    426. 

  426. 

  427. package :	PACKAGE WORD ';'
    428. 

  428. 			{ package($2); }
    429. 

  429. 	|	PACKAGE ';'
    430. 

  430. 			{ package(Nullop); }
    431. 

  431. 	;
    432. 

  432. 

  433. use	:	USE startsub
    434. 

  434. 			{ CvSPECIAL_on(PL_compcv); /* It's a BEGIN {} */ }
    435. 

  435. 		    WORD WORD listexpr ';'
    436. 

  436. 			{ utilize($1, $2, $4, $5, $6); }
    437. 

  437. 	;
    438. 

  438. 

  439. /* Ordinary expressions; logical combinations */
    440. 

  440. expr	:	expr ANDOP expr
    441. 

  441. 			{ $$ = newLOGOP(OP_AND, 0, $1, $3); }
    442. 

  442. 	|	expr OROP expr
    443. 

  443. 			{ $$ = newLOGOP($2, 0, $1, $3); }
    444. 

  444. 	|	argexpr %prec PREC_LOW
    445. 

  445. 	;
    446. 

  446. 

  447. /* Expressions are a list of terms joined by commas */
    448. 

  448. argexpr	:	argexpr ','
    449. 

  449. 			{ $$ = $1; }
    450. 

  450. 	|	argexpr ',' term
    451. 

  451. 			{ $$ = append_elem(OP_LIST, $1, $3); }
    452. 

  452. 	|	term %prec PREC_LOW
    453. 

  453. 	;
    454. 

  454. 

  455. /* List operators */
    456. 

  456. listop	:	LSTOP indirob argexpr          /* print $fh @args */
    457. 

  457. 			{ $$ = convert($1, OPf_STACKED,
    458. 

  458. 				prepend_elem(OP_LIST, newGVREF($1,$2), $3) ); }
    459. 

  459. 	|	FUNC '(' indirob expr ')'      /* print ($fh @args */
    460. 

  460. 			{ $$ = convert($1, OPf_STACKED,
    461. 

  461. 				prepend_elem(OP_LIST, newGVREF($1,$3), $4) ); }
    462. 

  462. 	|	term ARROW method '(' listexprcom ')' /* $foo-&gt;bar(list) */
    463. 

  463. 			{ $$ = convert(OP_ENTERSUB, OPf_STACKED,
    464. 

  464. 				append_elem(OP_LIST,
    465. 

  465. 				    prepend_elem(OP_LIST, scalar($1), $5),
    466. 

  466. 				    newUNOP(OP_METHOD, 0, $3))); }
    467. 

  467. 	|	term ARROW method                     /* $foo-&gt;bar */
    468. 

  468. 			{ $$ = convert(OP_ENTERSUB, OPf_STACKED,
    469. 

  469. 				append_elem(OP_LIST, scalar($1),
    470. 

  470. 				    newUNOP(OP_METHOD, 0, $3))); }
    471. 

  471. 	|	METHOD indirob listexpr              /* new Class @args */
    472. 

  472. 			{ $$ = convert(OP_ENTERSUB, OPf_STACKED,
    473. 

  473. 				append_elem(OP_LIST,
    474. 

  474. 				    prepend_elem(OP_LIST, $2, $3),
    475. 

  475. 				    newUNOP(OP_METHOD, 0, $1))); }
    476. 

  476. 	|	FUNCMETH indirob '(' listexprcom ')' /* method $object (@args) */
    477. 

  477. 			{ $$ = convert(OP_ENTERSUB, OPf_STACKED,
    478. 

  478. 				append_elem(OP_LIST,
    479. 

  479. 				    prepend_elem(OP_LIST, $2, $4),
    480. 

  480. 				    newUNOP(OP_METHOD, 0, $1))); }
    481. 

  481. 	|	LSTOP listexpr                       /* print @args */
    482. 

  482. 			{ $$ = convert($1, 0, $2); }
    483. 

  483. 	|	FUNC '(' listexprcom ')'             /* print (@args) */
    484. 

  484. 			{ $$ = convert($1, 0, $3); }
    485. 

  485. 	|	LSTOPSUB startanonsub block          /* map { foo } ... */
    486. 

  486. 			{ $3 = newANONATTRSUB($2, 0, Nullop, $3); }
    487. 

  487. 		    listexpr		%prec LSTOP  /* ... @bar */
    488. 

  488. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    489. 

  489. 				 append_elem(OP_LIST,
    490. 

  490. 				   prepend_elem(OP_LIST, $3, $5), $1)); }
    491. 

  491. 	;
    492. 

  492. 

  493. /* Names of methods. May use $object-&gt;$methodname */
    494. 

  494. method	:	METHOD
    495. 

  495. 	|	scalar
    496. 

  496. 	;
    497. 

  497. 

  498. /* Some kind of subscripted expression */
    499. 

  499. subscripted:    star '{' expr ';' '}'        /* *main::{something} */
    500. 

  500.                         /* In this and all the hash accessors, ';' is
    501. 

  501.                          * provided by the tokeniser */
    502. 

  502. 			{ $$ = newBINOP(OP_GELEM, 0, $1, scalar($3)); }
    503. 

  503. 	|	scalar '[' expr ']'          /* $array[$element] */
    504. 

  504. 			{ $$ = newBINOP(OP_AELEM, 0, oopsAV($1), scalar($3)); }
    505. 

  505. 	|	term ARROW '[' expr ']'      /* somearef-&gt;[$element] */
    506. 

  506. 			{ $$ = newBINOP(OP_AELEM, 0,
    507. 

  507. 					ref(newAVREF($1),OP_RV2AV),
    508. 

  508. 					scalar($4));}
    509. 

  509. 	|	subscripted '[' expr ']'    /* $foo-&gt;[$bar]-&gt;[$baz] */
    510. 

  510. 			{ $$ = newBINOP(OP_AELEM, 0,
    511. 

  511. 					ref(newAVREF($1),OP_RV2AV),
    512. 

  512. 					scalar($3));}
    513. 

  513. 	|	scalar '{' expr ';' '}'    /* $foo-&gt;{bar();} */
    514. 

  514. 			{ $$ = newBINOP(OP_HELEM, 0, oopsHV($1), jmaybe($3));
    515. 

  515. 			    PL_expect = XOPERATOR; }
    516. 

  516. 	|	term ARROW '{' expr ';' '}' /* somehref-&gt;{bar();} */
    517. 

  517. 			{ $$ = newBINOP(OP_HELEM, 0,
    518. 

  518. 					ref(newHVREF($1),OP_RV2HV),
    519. 

  519. 					jmaybe($4));
    520. 

  520. 			    PL_expect = XOPERATOR; }
    521. 

  521. 	|	subscripted '{' expr ';' '}' /* $foo-&gt;[bar]-&gt;{baz;} */
    522. 

  522. 			{ $$ = newBINOP(OP_HELEM, 0,
    523. 

  523. 					ref(newHVREF($1),OP_RV2HV),
    524. 

  524. 					jmaybe($3));
    525. 

  525. 			    PL_expect = XOPERATOR; }
    526. 

  526. 	|	term ARROW '(' ')'          /* $subref-&gt;() */
    527. 

  527. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    528. 

  528. 				   newCVREF(0, scalar($1))); }
    529. 

  529. 	|	term ARROW '(' expr ')'     /* $subref-&gt;(@args) */
    530. 

  530. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    531. 

  531. 				   append_elem(OP_LIST, $4,
    532. 

  532. 				       newCVREF(0, scalar($1)))); }
    533. 

  533. 

  534. 	|	subscripted '(' expr ')'   /* $foo-&gt;{bar}-&gt;(@args) */
    535. 

  535. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    536. 

  536. 				   append_elem(OP_LIST, $3,
    537. 

  537. 					       newCVREF(0, scalar($1)))); }
    538. 

  538. 	|	subscripted '(' ')'        /* $foo-&gt;{bar}-&gt;() */
    539. 

  539. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    540. 

  540. 				   newCVREF(0, scalar($1))); }
    541. 

  541.     ;
    542. 

  542. 

  543. /* Binary operators between terms */
    544. 

  544. termbinop	:	term ASSIGNOP term             /* $x = $y */
    545. 

  545. 			{ $$ = newASSIGNOP(OPf_STACKED, $1, $2, $3); }
    546. 

  546. 	|	term POWOP term                        /* $x ** $y */
    547. 

  547. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    548. 

  548. 	|	term MULOP term                        /* $x * $y, $x x $y */
    549. 

  549. 			{   if ($2 != OP_REPEAT)
    550. 

  550. 				scalar($1);
    551. 

  551. 			    $$ = newBINOP($2, 0, $1, scalar($3)); }
    552. 

  552. 	|	term ADDOP term                        /* $x + $y */
    553. 

  553. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    554. 

  554. 	|	term SHIFTOP term                      /* $x &gt;&gt; $y, $x &lt;&lt; $y */
    555. 

  555. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    556. 

  556. 	|	term RELOP term                        /* $x &gt; $y, etc. */
    557. 

  557. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    558. 

  558. 	|	term EQOP term                         /* $x == $y, $x eq $y */
    559. 

  559. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    560. 

  560. 	|	term BITANDOP term                     /* $x &amp; $y */
    561. 

  561. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    562. 

  562. 	|	term BITOROP term                      /* $x | $y */
    563. 

  563. 			{ $$ = newBINOP($2, 0, scalar($1), scalar($3)); }
    564. 

  564. 	|	term DOTDOT term                       /* $x..$y, $x...$y */
    565. 

  565. 			{ $$ = newRANGE($2, scalar($1), scalar($3));}
    566. 

  566. 	|	term ANDAND term                       /* $x &amp;&amp; $y */
    567. 

  567. 			{ $$ = newLOGOP(OP_AND, 0, $1, $3); }
    568. 

  568. 	|	term OROR term                         /* $x || $y */
    569. 

  569. 			{ $$ = newLOGOP(OP_OR, 0, $1, $3); }
    570. 

  570. 	|	term MATCHOP term                      /* $x =~ /$y/ */
    571. 

  571. 			{ $$ = bind_match($2, $1, $3); }
    572. 

  572.     ;
    573. 

  573. 

  574. /* Unary operators and terms */
    575. 

  575. termunop : '-' term %prec UMINUS                       /* -$x */
    576. 

  576. 			{ $$ = newUNOP(OP_NEGATE, 0, scalar($2)); }
    577. 

  577. 	|	'+' term %prec UMINUS                  /* +$x */
    578. 

  578. 			{ $$ = $2; }
    579. 

  579. 	|	'!' term                               /* !$x */
    580. 

  580. 			{ $$ = newUNOP(OP_NOT, 0, scalar($2)); }
    581. 

  581. 	|	'~' term                               /* ~$x */
    582. 

  582. 			{ $$ = newUNOP(OP_COMPLEMENT, 0, scalar($2));}
    583. 

  583. 	|	term POSTINC                           /* $x++ */
    584. 

  584. 			{ $$ = newUNOP(OP_POSTINC, 0,
    585. 

  585. 					mod(scalar($1), OP_POSTINC)); }
    586. 

  586. 	|	term POSTDEC                           /* $x-- */
    587. 

  587. 			{ $$ = newUNOP(OP_POSTDEC, 0,
    588. 

  588. 					mod(scalar($1), OP_POSTDEC)); }
    589. 

  589. 	|	PREINC term                            /* ++$x */
    590. 

  590. 			{ $$ = newUNOP(OP_PREINC, 0,
    591. 

  591. 					mod(scalar($2), OP_PREINC)); }
    592. 

  592. 	|	PREDEC term                            /* --$x */
    593. 

  593. 			{ $$ = newUNOP(OP_PREDEC, 0,
    594. 

  594. 					mod(scalar($2), OP_PREDEC)); }
    595. 

  595. 

  596.     ;
    597. 

  597. 

  598. /* Constructors for anonymous data */
    599. 

  599. anonymous:	'[' expr ']'
    600. 

  600. 			{ $$ = newANONLIST($2); }
    601. 

  601. 	|	'[' ']'
    602. 

  602. 			{ $$ = newANONLIST(Nullop); }
    603. 

  603. 	|	HASHBRACK expr ';' '}'	%prec '(' /* { foo =&gt; &quot;Bar&quot; } */
    604. 

  604. 			{ $$ = newANONHASH($2); }
    605. 

  605. 	|	HASHBRACK ';' '}'	%prec '(' /* { } (';' by tokener) */
    606. 

  606. 			{ $$ = newANONHASH(Nullop); }
    607. 

  607. 	|	ANONSUB startanonsub proto subattrlist block	%prec '('
    608. 

  608. 			{ $$ = newANONATTRSUB($2, $3, $4, $5); }
    609. 

  609. 

  610.     ;
    611. 

  611. 

  612. /* Things called with &quot;do&quot; */
    613. 

  613. termdo	:       DO term	%prec UNIOP                     /* do $filename */
    614. 

  614. 			{ $$ = dofile($2); }
    615. 

  615. 	|	DO block	%prec '('               /* do { code */
    616. 

  616. 			{ $$ = newUNOP(OP_NULL, OPf_SPECIAL, scope($2)); }
    617. 

  617. 	|	DO WORD '(' ')'                         /* do somesub() */
    618. 

  618. 			{ $$ = newUNOP(OP_ENTERSUB,
    619. 

  619. 			    OPf_SPECIAL|OPf_STACKED,
    620. 

  620. 			    prepend_elem(OP_LIST,
    621. 

  621. 				scalar(newCVREF(
    622. 

  622. 				    (OPpENTERSUB_AMPER&lt;&lt;8),
    623. 

  623. 				    scalar($2)
    624. 

  624. 				)),Nullop)); dep();}
    625. 

  625. 	|	DO WORD '(' expr ')'                    /* do somesub(@args) */
    626. 

  626. 			{ $$ = newUNOP(OP_ENTERSUB,
    627. 

  627. 			    OPf_SPECIAL|OPf_STACKED,
    628. 

  628. 			    append_elem(OP_LIST,
    629. 

  629. 				$4,
    630. 

  630. 				scalar(newCVREF(
    631. 

  631. 				    (OPpENTERSUB_AMPER&lt;&lt;8),
    632. 

  632. 				    scalar($2)
    633. 

  633. 				)))); dep();}
    634. 

  634. 	|	DO scalar '(' ')'                      /* do $subref () */
    635. 

  635. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
    636. 

  636. 			    prepend_elem(OP_LIST,
    637. 

  637. 				scalar(newCVREF(0,scalar($2))), Nullop)); dep();}
    638. 

  638. 	|	DO scalar '(' expr ')'                 /* do $subref (@args) */
    639. 

  639. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_SPECIAL|OPf_STACKED,
    640. 

  640. 			    prepend_elem(OP_LIST,
    641. 

  641. 				$4,
    642. 

  642. 				scalar(newCVREF(0,scalar($2))))); dep();}
    643. 

  643. 

  644.         ;
    645. 

  645. 

  646. term	:	termbinop
    647. 

  647. 	|	termunop
    648. 

  648. 	|	anonymous
    649. 

  649. 	|	termdo
    650. 

  650. 	|	term '?' term ':' term
    651. 

  651. 			{ $$ = newCONDOP(0, $1, $3, $5); }
    652. 

  652. 	|	REFGEN term                          /* \$x, \@y, \%z */
    653. 

  653. 			{ $$ = newUNOP(OP_REFGEN, 0, mod($2,OP_REFGEN)); }
    654. 

  654. 	|	myattrterm	%prec UNIOP
    655. 

  655. 			{ $$ = $1; }
    656. 

  656. 	|	LOCAL term	%prec UNIOP
    657. 

  657. 			{ $$ = localize($2,$1); }
    658. 

  658. 	|	'(' expr ')'
    659. 

  659. 			{ $$ = sawparens($2); }
    660. 

  660. 	|	'(' ')'
    661. 

  661. 			{ $$ = sawparens(newNULLLIST()); }
    662. 

  662. 	|	scalar	%prec '('
    663. 

  663. 			{ $$ = $1; }
    664. 

  664. 	|	star	%prec '('
    665. 

  665. 			{ $$ = $1; }
    666. 

  666. 	|	hsh 	%prec '('
    667. 

  667. 			{ $$ = $1; }
    668. 

  668. 	|	ary 	%prec '('
    669. 

  669. 			{ $$ = $1; }
    670. 

  670. 	|	arylen 	%prec '('                    /* $#x, $#{ something } */
    671. 

  671. 			{ $$ = newUNOP(OP_AV2ARYLEN, 0, ref($1, OP_AV2ARYLEN));}
    672. 

  672. 	|       subscripted
    673. 

  673. 			{ $$ = $1; }
    674. 

  674. 	|	'(' expr ')' '[' expr ']'            /* list slice */
    675. 

  675. 			{ $$ = newSLICEOP(0, $5, $2); }
    676. 

  676. 	|	'(' ')' '[' expr ']'                 /* empty list slice! */
    677. 

  677. 			{ $$ = newSLICEOP(0, $4, Nullop); }
    678. 

  678. 	|	ary '[' expr ']'                     /* array slice */
    679. 

  679. 			{ $$ = prepend_elem(OP_ASLICE,
    680. 

  680. 				newOP(OP_PUSHMARK, 0),
    681. 

  681. 				    newLISTOP(OP_ASLICE, 0,
    682. 

  682. 					list($3),
    683. 

  683. 					ref($1, OP_ASLICE))); }
    684. 

  684. 	|	ary '{' expr ';' '}'                 /* @hash{@keys} */
    685. 

  685. 			{ $$ = prepend_elem(OP_HSLICE,
    686. 

  686. 				newOP(OP_PUSHMARK, 0),
    687. 

  687. 				    newLISTOP(OP_HSLICE, 0,
    688. 

  688. 					list($3),
    689. 

  689. 					ref(oopsHV($1), OP_HSLICE)));
    690. 

  690. 			    PL_expect = XOPERATOR; }
    691. 

  691. 	|	THING	%prec '('
    692. 

  692. 			{ $$ = $1; }
    693. 

  693. 	|	amper                                /* &amp;foo; */
    694. 

  694. 			{ $$ = newUNOP(OP_ENTERSUB, 0, scalar($1)); }
    695. 

  695. 	|	amper '(' ')'                        /* &amp;foo() */
    696. 

  696. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED, scalar($1)); }
    697. 

  697. 	|	amper '(' expr ')'                   /* &amp;foo(@args) */
    698. 

  698. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    699. 

  699. 			    append_elem(OP_LIST, $3, scalar($1))); }
    700. 

  700. 	|	NOAMP WORD listexpr                  /* foo(@args) */
    701. 

  701. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    702. 

  702. 			    append_elem(OP_LIST, $3, scalar($2))); }
    703. 

  703. 	|	LOOPEX  /* loop exiting command (goto, last, dump, etc) */
    704. 

  704. 			{ $$ = newOP($1, OPf_SPECIAL);
    705. 

  705. 			    PL_hints |= HINT_BLOCK_SCOPE; }
    706. 

  706. 	|	LOOPEX term
    707. 

  707. 			{ $$ = newLOOPEX($1,$2); }
    708. 

  708. 	|	NOTOP argexpr                        /* not $foo */
    709. 

  709. 			{ $$ = newUNOP(OP_NOT, 0, scalar($2)); }
    710. 

  710. 	|	UNIOP                                /* Unary op, $_ implied */
    711. 

  711. 			{ $$ = newOP($1, 0); }
    712. 

  712. 	|	UNIOP block                          /* eval { foo }, I *think* */
    713. 

  713. 			{ $$ = newUNOP($1, 0, $2); }
    714. 

  714. 	|	UNIOP term                           /* Unary op */
    715. 

  715. 			{ $$ = newUNOP($1, 0, $2); }
    716. 

  716. 	|	UNIOPSUB term                        /* Sub treated as unop */
    717. 

  717. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    718. 

  718. 			    append_elem(OP_LIST, $2, scalar($1))); }
    719. 

  719. 	|	FUNC0                                /* Nullary operator */
    720. 

  720. 			{ $$ = newOP($1, 0); }
    721. 

  721. 	|	FUNC0 '(' ')'
    722. 

  722. 			{ $$ = newOP($1, 0); }
    723. 

  723. 	|	FUNC0SUB                             /* Sub treated as nullop */
    724. 

  724. 			{ $$ = newUNOP(OP_ENTERSUB, OPf_STACKED,
    725. 

  725. 				scalar($1)); }
    726. 

  726. 	|	FUNC1 '(' ')'                        /* not () */
    727. 

  727. 			{ $$ = newOP($1, OPf_SPECIAL); }
    728. 

  728. 	|	FUNC1 '(' expr ')'                   /* not($foo) */
    729. 

  729. 			{ $$ = newUNOP($1, 0, $3); }
    730. 

  730. 	|	PMFUNC '(' term ')'                  /* split (/foo/) */
    731. 

  731. 			{ $$ = pmruntime($1, $3, Nullop); }
    732. 

  732. 	|	PMFUNC '(' term ',' term ')'         /* split (/foo/,$bar) */
    733. 

  733. 			{ $$ = pmruntime($1, $3, $5); }
    734. 

  734. 	|	WORD
    735. 

  735. 	|	listop
    736. 

  736. 	;
    737. 

  737. 

  738. /* &quot;my&quot; declarations, with optional attributes */
    739. 

  739. myattrterm:	MY myterm myattrlist
    740. 

  740. 			{ $$ = my_attrs($2,$3); }
    741. 

  741. 	|	MY myterm
    742. 

  742. 			{ $$ = localize($2,$1); }
    743. 

  743. 	;
    744. 

  744. 

  745. /* Things that can be &quot;my&quot;'d */
    746. 

  746. myterm	:	'(' expr ')'
    747. 

  747. 			{ $$ = sawparens($2); }
    748. 

  748. 	|	'(' ')'
    749. 

  749. 			{ $$ = sawparens(newNULLLIST()); }
    750. 

  750. 	|	scalar	%prec '('
    751. 

  751. 			{ $$ = $1; }
    752. 

  752. 	|	hsh 	%prec '('
    753. 

  753. 			{ $$ = $1; }
    754. 

  754. 	|	ary 	%prec '('
    755. 

  755. 			{ $$ = $1; }
    756. 

  756. 	;
    757. 

  757. 

  758. /* Basic list expressions */
    759. 

  759. listexpr:	/* NULL */ %prec PREC_LOW
    760. 

  760. 			{ $$ = Nullop; }
    761. 

  761. 	|	argexpr    %prec PREC_LOW
    762. 

  762. 			{ $$ = $1; }
    763. 

  763. 	;
    764. 

  764. 

  765. listexprcom:	/* NULL */
    766. 

  766. 			{ $$ = Nullop; }
    767. 

  767. 	|	expr
    768. 

  768. 			{ $$ = $1; }
    769. 

  769. 	|	expr ','
    770. 

  770. 			{ $$ = $1; }
    771. 

  771. 	;
    772. 

  772. 

  773. /* A little bit of trickery to make &quot;for my $foo (@bar)&quot; actually be
    774. 

  774.    lexical */
    775. 

  775. my_scalar:	scalar
    776. 

  776. 			{ PL_in_my = 0; $$ = my($1); }
    777. 

  777. 	;
    778. 

  778. 

  779. amper	:	'&amp;' indirob
    780. 

  780. 			{ $$ = newCVREF($1,$2); }
    781. 

  781. 	;
    782. 

  782. 

  783. scalar	:	'$' indirob
    784. 

  784. 			{ $$ = newSVREF($2); }
    785. 

  785. 	;
    786. 

  786. 

  787. ary	:	'@' indirob
    788. 

  788. 			{ $$ = newAVREF($2); }
    789. 

  789. 	;
    790. 

  790. 

  791. hsh	:	'%' indirob
    792. 

  792. 			{ $$ = newHVREF($2); }
    793. 

  793. 	;
    794. 

  794. 

  795. arylen	:	DOLSHARP indirob
    796. 

  796. 			{ $$ = newAVREF($2); }
    797. 

  797. 	;
    798. 

  798. 

  799. star	:	'*' indirob
    800. 

  800. 			{ $$ = newGVREF(0,$2); }
    801. 

  801. 	;
    802. 

  802. 

  803. /* Indirect objects */
    804. 

  804. indirob	:	WORD
    805. 

  805. 			{ $$ = scalar($1); }
    806. 

  806. 	|	scalar %prec PREC_LOW
    807. 

  807. 			{ $$ = scalar($1);  }
    808. 

  808. 	|	block
    809. 

  809. 			{ $$ = scope($1); }
    810. 

  810. 

  811. 	|	PRIVATEREF
    812. 

  812. 			{ $$ = $1; }
    813. 

  813. 	;
    814. 

  814. 

  815. %% /* PROGRAM */
    816. 

  816. 

  817. /* more stuff added to make perly_c.diff easier to apply */
    818. 

  818. 

  819. #ifdef yyparse
    820. 

  820. #undef yyparse
    821. 

  821. #endif
    822. 

  822. #define yyparse() Perl_yyparse(pTHX)
    823. 

  823. 

  824. </pre>
    825. 

  825. <hr />
    826. 

  826. </body></html>
    827.