in reply to Latest results
in thread Is Perl less compact than Ruby? (Kind of competition)

Beta version, 325 bytes, expanded view, subject to optimizations:

sub p{$_=pop@n}
sub w{push@n,@_}
%D=(
H=>'0p;w$n[-1-abs];$_>0&&splice@n,-2-$_,1',
T=>'1$t=p;p&&goto"L$t"',
A=>'2w$L+1',
O=>'3print chr p',
I=>'4w+($_=getc)?ord:-1',
N=>'5w$N++',
S=>'6w-(p)+p',
E=>'7$0=p;p;w int$_/$0,$_%$0'
);
$/=\-1;$_=uc<>;
s#.#$D{$&}=~/(.)(.*)$/&&"\$N?$1>6?\$N=0:w $1+7*p:do{$2};"#eg;
s/^/$i++,"L$i:\$L=$i;"/emg;
eval;
L0:

[download]

Replies are listed 'Best First'.
Re: Completely different algorithm
by japhy (Canon) on Feb 20, 2002 at 19:51 UTC
    Here's some more, then. It also adds the (missing?) newline to the end of each command. 
    sub p{$_=pop@n}
sub w{push@n,@_}
$/=$T;$_=uc<>;
s#.#+{qw(
H 0p;w$n[-1-abs];$_>0&&splice@n,-2-$_,1
T 1$t=p;p&&goto"L$t"
A 2w$L+1
O 3print+chr+p
I 4w+($_=getc)?ord:-1
N 5w$N++
S 6w-(p)+p
E 7$0=p;p;w+int$_/$0,$_%$0
)}->{$&}=~/./&&"\$N?$&>6?\$N=0:w $&+7*p:do{$'};\n"#eg;
s/^/L${\++$i}:\$L=$i;/mg;
eval;
L0:

    [download]

    _____________________________________________________
    Jeff[japhy]Pinyan: Perl, regex, and perl hacker, who'd like a (from-home) job
    s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;

[reply]
[d/l]

      Now world record is 290 bytes:

      sub p{$_=pop@n}sub w{push@n,@_}$/=$T;$_=uc<>;s#.#+{qw(E 7$0=p;p;w+int$
+_/$0,$_%$0
H 0p;w$n[-1-abs];$_>0&&splice@n,-2-$_,1 I 4w+($_=getc)?ord:-1 A 2w$L+1
+ N 5w$N++
S 6w-(p)+p O 3print+chr(p) T 1$t=p;p&&goto"L$t")}->{$&}=~/./&&"\$N?$&>
+6?\$N=0:".
"w $&+7*p:do{$'};"#eg;s/^/L${\++$i}:\$L=$i;/mg;eval

      [download]

      Everything working as expected, no cheating.

      We did it! Perl is winner!

      It also adds the (missing?) newline

      Nope, it was ok. I also fixed warning and unused last label.

      Please note that Tic-Tac-Toe program unrolled to around megabyte of Perl code, so eval takes some time.

        In light of this newline problem, I offer: 
        sub p{$_=pop@n}sub w{push@n,@_}$/=$T;$_=uc<>;s#.#+{qw(E 7$0=p;p;w+int$
+_/$0,$_%$0
H 0p;w$n[-1-abs];$_>0&&splice@n,-2-$_,1 I 4w+($_=getc)?ord:-1 A 2w$L+1
+ N 5w$N++
S 6w-(p)+p O 3print+chr(p) T 1$t=p;p&&goto"L$t")}->{$&}=~/./&&"~\$N?$&
+>6?\$N=0:
w $&+7*p:do{$'};"#eg;s/~/L${\++$i}:\$L=$i;/g;eval

        [download]

        _____________________________________________________
        Jeff[japhy]Pinyan: Perl, regex, and perl hacker, who'd like a (from-home) job
        s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;

[reply]
[d/l]
        I don't get it. Where are the Ln: labels being inserted? At the beginning of each line, right? So then, where are the newlines in $_?

        _____________________________________________________
        Jeff[japhy]Pinyan: Perl, regex, and perl hacker, who'd like a (from-home) job
        s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;

[reply]
Re: Completely different algorithm
by dragonchild (Archbishop) on Feb 20, 2002 at 17:58 UTC
    Nicely done! Shave three with I=>'4w ord getc||-1',.

    ------
    We are the carpenters and bricklayers of the Information Age.

    Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.

[reply]
[d/l]

In Section Seekers of Perl Wisdom