Hi, Monks.
Sorry if you discuss this question many time but search (and Super Search) did't help me so...
I need to generate all word from the pattern. The pattern looks like so: LLL (generate all free letter words), LLN (generate all words with two letters at beginig and digit at the end), LNNLLN.
Maybe there is a way to translate Perl regex pattern (like /[a-z]{3}/ or /[a-z]{2}\d/) to words list?
All i can invent is ugly nested for circles:
my @first_symbol_range = @second_symbol_range = ( 'a'..'z' ); my @fird_symbol_range = ( 0..9 ); for my $first_symbol (@first_symbol_range) { for my $second_symbol (@second_symbol_range) { for my $fird_symbol (@fird_symbol_range) { my $word = $first_symbol . $second_symbol . $fird_symbol; } } }
But i don't know length of the result string (it could be 10 symbols) :-(. So please show me the right way. Thanks!
In reply to Words generation algorithm by Gangabass
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |