Date:         Wed, 29 Oct 2003 16:58:44 -0800
From: MWP <mpalmer@JPS.NET>
Subject: OMPHALOSOPHY 101
To: WRYTING-L@LISTSERV.UTORONTO.CA

# # # # #

----TITLE


OMPHALOSOPHY 101


----STATEMENT


It's probably been done before (nothing is new under the sun, alas), but I
utilize here as source DATA for the program's OUTPUT the original program
CODE itself in a snake-eating-its-own-tail kind of way.

Process: Every data-value of the original Perl code is paired with its
neighbor(s), then sorted. (mwp)


----DATA


$text = '$tlen = length($text);

for ($ii = 0; $ii < $tlen; $ii++) {
    $taaa[$ii] = substr($text, $ii, 2);
}

@txaa = sort @taaa;

for ($ii = 0; $ii < $tlen; $ii++) {
    print "$txaa[$ii]";
}

print "\n";

';


----OUTPUT


    $    p













@
f
f
p
}
} " " $ $ $ $ $ $ $ $ ( ( 0 0 2 < < = = = = = @ l s s {
{"$";";"\$i$i$i$i$i$i$i$i$i$i$t$t$t$t$t$t$t($($($($) ) ););+)+)++++, ,
0;0;2);
;
;
;
;
; ; ; ; < < = = = = = @t@t[$[$\n\n] ]\a
a;a[a[aaaaaaaaaaaabsenenenenexexfofogth(i i i i i
i+i+i,i]i]iiiiiiiiiiiiiiiiiiiiininlelelelen n"n"n;n;ngntntorororprprr r
r(ririrtsostsut t t t)t,tatatetethtltltltrtxtxubxaxaxtxt{
{
}
}




----COPYRIGHT 2003



(c) mwp