En op 09 september 2002 sprak Julien Quint: > > s// $2 $1/ while /x(.)(\PL+)/ + /x([*\/](\PL+)/ > > (the + has the same effect as the | here, with the benefit of improving the > tie-breaker score, which I needed badly to match Alexey's score). Note here > that I am also exploiting the empty regex, which repeats the last match. I'll > be very sad to see it go in Perl 6.
Wow. That's good! > On the theoretical side, the very simple idea of iterating a regular > substution until a fixed point is reached in order to recognized > expressions that are not regular is found in [1], for instance; I am > also discussing it in my PhD thesis which I am supposed to finish > instead of playing perl golf. No! Argh! Do not mention the T word! Please! (Mine could have been finished some months ago already... if not for golfing) > Sorry for the long post, I hope it was clear to everyone. I'm going to have to read your post, and those of Michael, Rick, and Jason, very slowly to see what all of you are doing. I'm not a computer scientist and I don't know much about parsing. That's why I tried to let Perl do all the work, with overload or B::Deparse. (-ugene -- Not that the story need be long, but it will take a long while to make it short. -- |-|enry |)avid 7`horeau
