Wed Jun 3 07:09:24 CEST 2009
On Jun 2, 2009, at 10:03 PM, Richard O'Keefe wrote:
> There are several stages in the compilation of a regular
> expression, at least notionally:
> linear representation -> AST
> AST -> matching engine
> It's good that Reia has a clue about regular expression literals
> (as AWK did). It would be even better if it _also_ provided an
> API for the AST, so that one could say
> "I want that regular expression followed by this string
> followed by that regular expression."
> It would be nice to tag the matches one wants with atoms rather
> than invisible integers. And so on.
So, you'd like it to be Perl, then?
More information about the erlang-questions