On Sunday 21 October 2007 23:45, Michael Alipio wrote:
> Hi,
Hello,
> I'm trying to create a dictionary file for my
> bruteforce program.
>
>
> I have a huge dictionary file and I want to trim it
> down according the requirements.
>
> The output should be a dic
On Oct 22, 2:18 pm, [EMAIL PROTECTED] (Jay Savage) wrote:
> On 10/22/07, Paul Lalli <[EMAIL PROTECTED]> wrote:
>
> > On Oct 22, 2:45 am, [EMAIL PROTECTED] (Michael Alipio) wrote:
>
> > > The output should be a dictionary file that is minimum
> > > 6 chara
On 10/22/07, Paul Lalli <[EMAIL PROTECTED]> wrote:
> On Oct 22, 2:45 am, [EMAIL PROTECTED] (Michael Alipio) wrote:
>
> > The output should be a dictionary file that is minimum
> > 6 characters and maximum 15 characters with at least 4
> > letters and 2 numbers
Michael Alipio wrote:
Here's what I came up with:
#!/usr/bin/perl
use warnings;
use strict;
my $wordlist = shift @ARGV;
open INPUTFILE, "$wordlist" or die $!;
while (){
# Find all words that are 6-15 characters with at
least 2 digits and 4 letters that can appear anywhere
next unless (
On Oct 22, 7:56 am, [EMAIL PROTECTED] (Michael Alipio) wrote:
> Here's what I came up with:
/\b\w{6,15}\b\n/ && /.*(\d).*\d/ && /(.*([a-z]|[A-Z]).*){4}/)
\b is a word boundary. It is simply true at spaces in between word
characters and non-word characters. Your regexps do not at all
preclude s
osition, it must have at
least 4 letters and 2 numbers and of course it should
fall between 6 to 15 characters.
In the meantime, let me look at your solution...
--- Paul Lalli <[EMAIL PROTECTED]> wrote:
> On Oct 22, 2:45 am, [EMAIL PROTECTED] (Michael
> Alipio) wrote:
>
>
On Oct 22, 2:45 am, [EMAIL PROTECTED] (Michael Alipio) wrote:
> The output should be a dictionary file that is minimum
> 6 characters and maximum 15 characters with at least 4
> letters and 2 numbers in it.. no special characters
> whatsoever.. This should be a simple regex but i
Hi,
I'm trying to create a dictionary file for my
bruteforce program.
I have a huge dictionary file and I want to trim it
down according the requirements.
The output should be a dictionary file that is minimum
6 characters and maximum 15 characters with at least 4
letters and 2 numbers
List::Compare.
http://search.cpan.org/search?query=list-compare&mode=all
-Chris
-Original Message-
From: Jim Witte [mailto:[EMAIL PROTECTED]
Sent: Wednesday, May 26, 2004 10:15 PM
To: [EMAIL PROTECTED]
Subject: Program to scan dictionary for words with letters in a
particular
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (Jose Alves De Castro) writes:
>On Thu, 2004-05-27 at 11:21, Ramprasad A Padmanabhan wrote:
>> But to think of it there is one hitch
>>
>> suppose my string is 'god'
>>
>> Assume
>> $word = "good"
>> $r = qr/^[god]+$/
>>
>>
>> then $r would mat
On Thu, 2004-05-27 at 11:21, Ramprasad A Padmanabhan wrote:
> On Thu, 2004-05-27 at 15:09, Jose Alves de Castro wrote:
> That was simply neat. I had read in a perl book ' there is always a
> shorter way in perl '. I think this proves it.
>
> But to think of it there is one hitch
>
> suppose my s
On Thu, 2004-05-27 at 15:09, Jose Alves de Castro wrote:
> On Thu, 2004-05-27 at 06:14, Jim Witte wrote:
> > Given a file of words W such as 'cat dog at home ...' (or perhaps read
> > into an array, though that would be a very large array), and a set of
> > letters L (a string 'aoeuidhtns' - perh
On Thu, 2004-05-27 at 06:14, Jim Witte wrote:
> Given a file of words W such as 'cat dog at home ...' (or perhaps read
> into an array, though that would be a very large array), and a set of
> letters L (a string 'aoeuidhtns' - perhaps put into a array), how would
> I write a program to extract
On Thu, 27 May 2004 00:14:57 -0500, Jim Witte wrote:
> Given a file of words W such as 'cat dog at home ...'
> and a set of letters L 'aoeuidhtns'
> how would I write a program to extract all words in W whose letters
> are all in L?
Here is an overview that should get you going:
Split L with a
I think this is more of an algorithm question, not perl tho very
interesting to do it in perl.
I am not gr8 in algorithms , but this is what I will do
Write a function that will return all the letters sorted in a word
For eg for the word home , return ehmo
sub wkey {
my(@l)=sort split(//,$_[
Given a file of words W such as 'cat dog at home ...' (or perhaps read
into an array, though that would be a very large array), and a set of
letters L (a string 'aoeuidhtns' - perhaps put into a array), how would
I write a program to extract all words in W whose letters are all in L?
I'm think
On Thu, 19 Jul 2001, Ela Jarecka wrote:
Ok, lemme take a crack at it. ;)
> while(defined($line = )) {
Couldn't you just: while ($line = ) {
or is there something I'm missing?
>if ( $toBf =~ /^\n$/) {
> die "Bye, bye!\n";
>}
This would typically be considered bad form, I think. D
> - I've created several fairly small dictionary files - each line in them
> looks more or less like that:
> 'aufgedreht: lit up, activated, attracted to, interested in'
if this is how the file looks, just use a simple hash:
$dict{'aufgedreht'} = 'lit up,
Hi folks,
Trying to make learning of German adjectives easier for me ( and to learn
Perl, of course :-) ) I've decided to create a small dictionary in Perl.. Is
using a hash of lists a good approach to solve the problem?
- I've created several fairly small dictionary files - each li
19 matches
Mail list logo
