The idea is, once you have that structure, to walk down that structure, and each time you end up in a leaf (that is, you find no more children), to output the whole path you've taken :

# Just walk the created structure, and output
# the name whenever we hit a leaf :

sub walk {
  my ($hashref, $path) = @_;
  #print $path,"\n";
  my @keys = keys %$hashref;
  if (@keys) {
    walk( $hashref->{$_}, $path . "/$_" ) foreach (@keys);
  } else {
    print "$path\n";
  };
};

walk( \%thingy, "" );
[download]

Of course, the whole method of hashes has the problem of not maintaining the order of the keys, but it's not clear if that will be a problem for The_Rev :-))

perl -MHTTP::Daemon -MHTTP::Response -MLWP::Simple -e ' ;    # The  
$d = new HTTP::Daemon and fork and getprint $d->url and exit;#spider
($c = $d->accept())->get_request(); $c->send_response( new   #in the
HTTP::Response(200,$_,$_,qq(Just another Perl hacker\n))); ' #  web
[download]