Re: Re: Recursive Regex: Update

If it were released as a module, it would be very nice.

Well, writing a PCRE module with a procedural or object-oriented interface would be reasonably easy, if that's what you mean. Getting slightly more ambitious, if perl's regex engine were made properly pluggable, you could write a pragma to switch in the PCRE implementation.

  use PCRE;
  print "Well formed!\n" if /$Juerds_regex/;
[download]

Out of interest, why wouldn't you like it replacing Perl's built-in engine? (supposing the UTF8 support were properly finished)

Comment on Re: Re: Recursive Regex: Update Download Code

Replies are listed 'Best First'.
Re: Re: Re: Recursive Regex: Update by Juerd (Abbot) on Apr 20, 2002 at 17:31 UTC
Out of interest, why wouldn't you like it replacing Perl's built-in engine? As far as I know (although I haven't benchmarked), Perl's regex engine is faster. If it's not, PCRE may as well replace Perl's own regex engine, when UTF8 is fixed :) Then we'd have Perl with a Regex Engine that is Perl Compatible, which sounds reasonable... - Yes, I reinvent wheels. - Spam: Visit eurotraQ.	[reply]
Re: Re: Re: Re: Recursive Regex: Update by robin (Chaplain) on Apr 21, 2002 at 14:35 UTC
Perl's regex engine is faster. Interesting: several people have said that. If anyone knows of any actual benchmarks, please let me know. Otherwise I'll try and do some of my own.	[reply]
Re: Re: Re: Recursive Regex: Update by demerphq (Chancellor) on Apr 22, 2002 at 13:25 UTC
if perl's regex engine were made properly pluggable Thats a great idea. Ive wanted to be able to use a DFA based engine under certain situations... Yves / DeMerphq --- Writing a good benchmark isnt as easy as it might look.	[reply]


Perl: the Markov chain saw
	PerlMonks