Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: how to measure strictness of a regex ?

by LanX (Bishop)
on Jan 23, 2013 at 07:39 UTC ( #1014851=note: print w/replies, xml ) Need Help??

in reply to how to measure strictness of a regex ?

> I hope everyone agrees if I pretend "the first regex is stricter than the second one".

No, your definition of strict is very fuzzy.

> For example, the string ' Daddy' matches

Are the strings given or could they come from a defined set? Like [a-zA-Z]{1,20} ? Is the set infinite?

> anything allowing classifying regexes

Please be aware that regexes are almost a complete sub-language with recursions and more. You don't expect us to solve the halting problem for the general case , don't you?

So which restricted regex syntax is allowed?

I have an idea for a clear definition of "strictness" and an approach to solve this by estimating the cardinality of possible solutions...

But I'm reluctant to spend efforts w/o a clear problem description. Sorry!

Like davido already asked, could you please clarify what for you're wanting this?

Seems pretty much to be a XY Problem for me...

Cheers Rolf

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1014851]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2018-03-20 22:25 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (260 votes). Check out past polls.