At 6:28 PM -0800 1/30/02, Steve Fink wrote:
>I'm sure in Apoc 5 Larry's going to go way beyond that and embed full
>parsers, not just regularish language matchers, but the above is
>easier to grasp.
Odds are, yes. And don't be surprised if the RE engine's required to
return data structures as well. (Nested parens returns you a tree
struct, for example)
I think we may want trees as a fundamental data type at some point...
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
