From: Tanaka Akira <akr@...17n.org>
Date: 2002-08-13T16:37:05+09:00
Subject: [ruby-dev:17997] Re: optimization module (Re: [ruby-list:35735] Re: tail recursion elimination)

In article <hvoeld3dxlh.fsf@coulee.a02.aist.go.jp>,
  Tanaka Akira <akr@m17n.org> writes:

> > $B%$%F%l!<%?$KEO$5$l$?%V%m%C%/$,$I$3$K$bJ]B8$5$l$F$$$J$$$H$$$&J](B
> > $B>Z$O$J$$$N$G!"L5M}$8$c$J$$$+$H;W$$$^$9!#(B
> 
> $B$O$$!#%$%F%l!<%?$NCf?H$r2r@O$7$J$$8B$j$O!#(B

$B$=$&$=$&!"$D$$K:$l$F$^$7$?$,!"$I$N%$%F%l!<%?$,8F$S=P$5$l$k2DG=@-$,$"$k(B
$B$+$rD4$Y$k$N$K(B alias analysis $B$,I,MW$G$9!#(B
-- 
[$BEDCf(B $BE/(B][$B$?$J$+(B $B$"$-$i(B][Tanaka Akira]
$B!V$U$($m(B! $B$o$+$a$A$c$s:n@o$G$9$(C"=$B!W(B(Little Worker, $B7KM7@84](B)