good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
I have a program that I use for this sort of thing, specifically written always to generate a single regular expression. The program is 'word', and it includes flags -a for "anagram", -u for "use any subset of the letters", and -D for "just show me the regexp". For an exact anagram, word -Da rtesamcna gives:
That is: require each of the single letters, require a double "a", and require exactly 9 letters. For all subsets, word -Dua rtesamcna gives:
That is: require all matching letters to be from the list, and additionally don't allow more than one of any of [encrmst], nor more than two "a"s. (Note: normal use of the word program also requires wrap from the same place.) Hugo In reply to Re: regex for word puzzle
by hv
|
|