[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: [mind game] Seeking for simple task impossible via regexps
- From: Martin <eden_martin_fuhrspam@...>
- Date: Fri, 24 Feb 2017 01:29:57 -0800
I'm seeking for simply formulated and easy-coding string matching
task which is impossible to solve via currently existing regular
(Indeed I'm seeking for a complete definition of task classes that
regexps can't handle in principle.)
Check that given string in lowercase contains no more than one entry
of alphabet character.
(so all permutations of subset of alphabet [a-z] should be matched)
Check that given string in lowercase contains all symbols of
predefined alphabet. Ignore spaces.
(so "the quick brown fox jumps over the lazy dog" should match)
My bet is that no existing regexp facilities may handle this
tasks. But maybe some of them can, so asking.
(I assume that calling user-supplied function from regexp handler
is not allowed. Or else this is trivially solved by Lua's gsub().)