Thanks for the thoughtful consideration. Austin's given some high-
level examples of the kind I was hoping for,
"AH>" = Austin Hastings
AH> grammar Rainbow;
AH> use Colorific; # Import C and C, among others.
AH>
AH> What I don't know is how to recognize a color, which is to say I don't
AH> kno
W= Andrew Wilson, AH=Austin Hastings
AH> This is really probably bad code. Maybe a better rule would be:
AH>
AH> rule same_color($color is Colorific)
AH> {
AH>::: { fail unless $color.looks_like($1); }
AH> }
AH>
AH> I KNOW that $color is an object-of-type-Colorific, while I'm not sure,
AH> fra
A couple nights ago I read RFC93 as discussed in Apoc. 5 and got
fired up- it reminded me of some ideas from when I was hacking
Henry Spencer's regexp package. How to futher generalize regular
expression input. It's a bit orthoginal- a properly implemented
RFC93 make some difficult things easier-
>This isn't quite meaningful. What does a "non-letter atom" mean?
>
>If you're processing a file or a string, that's the basic P6 model.
>
>But consider \u for unicode -- that's a multi-byte object in the
>stream. So for streams of bytes, the right way is just to code Ccolor> such that it recogniz
a = arcadi shehter <[EMAIL PROTECTED]>
a>I think this was already discussed once and then it was proposed to
a>attach a property to characters of the string
a>
a> sub peek_at_sky {
a>
a> my Color @numbers = peek_with_some_hardware;
a>
a> my $say_it = join map { "1" but color($_) } @number
>making *productions* of strings/sounds/whatever that could possibly
>match the regular expression?
>
>>Correct me if I am wrong, but isn't this the :any switch of apoc 5?
>>http://www.perl.com/pub/a/2002/06/26/synopsis5.html
Not really, unless the input string is infinite! :any returns all
subst
