Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re: Crafting a regex

by ahunter (Monk)
on Oct 11, 2000 at 21:29 UTC ( #36262=note: print w/replies, xml ) Need Help??

in reply to Crafting a regex

Perl is fairly good at compiling regexps, and provided you only use the constructs that can be simulated with a 'standard' regexp (which is to say, provided you can construct a deterministic finite automata from the expression), the running time should be O(n), where n is the length of the string being matched against.

This means you should avoid using anything that might cause perl to backtrack or lookahead - mostly that means the (?...) operators.

Anyhow, from your example, it looks like the closing quote is always the last one, so you could just take advantage of perl's greediness and use the following regexp, which should run at exactly the same speed as your original:

/^(\S+).*?\[(\S+).*?] (\S+) "(.+)" (\d+)/

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://36262]
and the monks are mute...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2017-12-14 01:17 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (382 votes). Check out past polls.