Note that .NET regular expressions have a possible solution to the composability problem, as described in <http://research.swtch.com/irregexp>: >.NET introduces a variant on the named capture, (?<-x>...), which, during >the match, deletes the last captured substring for x, exposing the one that >was there before. Is this something that would be easy to implement in Perl? The compatibility for regexps ported from .NET languages such as C# might be enough reason in itself. -- Ed Avis <eda@waniasset.com>Thread Previous | Thread Next