Now, I don't think the language {1n | n = bc, c > 1} is context-free, but that's harder to prove than it being non-regular. And it's still not sufficient to prove it cannot be matched by a Perl regexp without the use of (?{ }) or (??{ }).
In reply to Re^2: check for power of a number with regex
by JavaFan
in thread check for power of a number with regex
by spx2
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |