> Sam and Acme use a simple, pure form of regular expressions. If they
> had the counting operations, this would be a trivial task, but to add
> them would open the door to the enormous, ill-conceived complexity of
> (no longer) regular expressions as the open source community thinks of
> them.
Is it really so? R. Cox (Regular Expression Matching Can Be Simple And
Fast), I think, shows, that repetition can be first expanded and then
used even by the nice (non-backtracking) algorithms, like this:
e{3} --> eee
e{3,5} --> eeee?e?
e{3,} --> eee+
where would the problem arise?
Thanks
Ruda
>
> So yes: use other tools, with my apologies.
>
> -rob
