Re^3: Exact string matching

Looking at what you are trying to achieve, here is the code

use Data::Dumper; 
open (HAN,'employee.pm');
 my $cont = <HAN>; # assume $cont = 'package Employee df df'; 
my %hash = (); 
while ( $cont =~ m/(\w+)/g )
{ $hash{$1}++;
 } 

print Dumper(\%hash); --------- output 
$VAR1 = { 
'Employee' => 1, 
'df' => 2, 
'package' => 1 };
[download]

it prints how many time each word occured ..

Comment on Re^3: Exact string matching Download Code

Replies are listed 'Best First'.
Re^4: Exact string matching by Anonymous Monk on Oct 16, 2011 at 12:40 UTC
Dear Ram, Thank you very much for your kind assistance but this works only if the words in the file is separated with a defined spacer such as a white space, what if the file contains only strings without any spacer (junk of characters or sequence of characters to be precise). That's where I am stuck. I need to find the number of occurrence of all possible substrings, that to in linear time (sry, that I was not clear). example: $text = 'howdoidoit' and the answer should be like, for substring of length 3 => how = 1 ; owd = 1 ; wdo = 1 ; doi = 2 ; oid = 1 ; ido = 1 ; oit = 1 ;	[reply]

Replies are listed 'Best First'.

Re^4: Exact string matching
by Anonymous Monk on Oct 16, 2011 at 12:40 UTC

Dear Ram, Thank you very much for your kind assistance but this works only if the words in the file is separated with a defined spacer such as a white space, what if the file contains only strings without any spacer (junk of characters or sequence of characters to be precise). That's where I am stuck. I need to find the number of occurrence of all possible substrings, that to in linear time (sry, that I was not clear). example: $text = 'howdoidoit' and the answer should be like, for substring of length 3 => how = 1 ; owd = 1 ; wdo = 1 ; doi = 2 ; oid = 1 ; ido = 1 ; oit = 1 ;

[reply]