problematice metashar regexp

Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:

Dear Monks, I throw myself on the altar for help on this one

I have the following hash:

    my %key = (
    '1'=>'?', '2'=>'/', '3'=>'>', '4'=>'<', '5'=>':', '6'=>';',
       '7'=>'[', '8'=>']', '9'=>'{', '0'=>'}', '!'=>'p', '@'=>'o',
       '#'=>'i', '$'=>'d', '%'=>'j', '^'=>'h', '&'=>'g', '*'=>'k',
       '('=>'5', ')'=>'3', '-'=>'2', '+'=>'9', '='=>'%', '\\'=>'c',
       '|'=>'1', '~'=>'^'
);
[download]

And two functions,:

sub decode {
    my $char;
    my $meta;
    foreach $char (keys %key){
       $meta =quotemeta $key{$char};
       $$message->{body} =~ s/$meta/$char/gis;
    }
}
[download]

and

    my $char;
    my $meta;
    foreach $char (keys %key){
       $meta =quotemeta $char;
       $$message->{body} =~ s/$meta/$key{$char}/gis;
    }
[download]

But when it comes time to encode or decode a message like: this: ^5*9|1(1#|

becomes this: h:k{1?:?i1

ok, not problem, but going th reverse, this: h:k{1?:?i1

becomes this: \~5*9||5|#|

That's a problem ... can you help me understand why it's not doing the correct subs.

thanks, me

Comment on problematice metashar regexp Select or Download Code

Replies are listed 'Best First'.
Re: problematice metashar regexp by Stevie-O (Friar) on Apr 27, 2004 at 22:53 UTC
Also, if you're only doing character-by-character replacements, you may want to give `tr///` a shot. You can do it all in one go: `# note that I used {} as the delimiter for tr/// $foo =~ tr{1234567890!@#$%^&()-+=\\\|~} {?/><:;[]{}poidjhgk5329%c1^};` [download] This would also help prevent a potential problem: your hash maps '5' to ':' and '(' to '5'. If Perl happens to order your hash so `keys` finds the second of these first, Perl will change '('s in the string to '5's, then later on change those converted '5's to ':'s. `tr///` does everything in one shot, so that sort of thing won't happen. --Stevie-O `$"=$,,$_=q>\|\p4<6 8p<M/_\|<('=> .q>.<4-KI<l\|2$<6%s!<qn#F<>;$, .=pack'N',"@{[unpack'C*',$_] }"for split/</;$_=$,,y[A-Z a-z] {}cd;print lc` [download]	[reply] [d/l] [select]
Re: Re: problematice metashar regexp by Anonymous Monk on Apr 28, 2004 at 13:49 UTC
This looks pretty darn good as well. Trying to play with this, can something like this work? `my $str1="1234567890!@#$%^&*()-+=\\|~"; my $str2="?/><:;[]{}poidjhgk5329%c1^"; $foo =~ tr{$str1}{$str2};` [download] thanks you so much!	[reply] [d/l]
Re: problematice metashar regexp by gjb (Vicar) on Apr 27, 2004 at 22:13 UTC
One of the things that may go wrong is that you substitute in the result of a substitution. Consider the first character 'h', it's replaced by '^', but '^' can in turn be replaced by '~', depending on the order of the keys, something you don't control in a hash. Maybe this effect is intentional, but if not, it could be the source of your problem. If so, replace the global substitution by a while over the characters of the string. Hope this helps, -gjb-	[reply]
Re: Re: problematice metashar regexp by Anonymous Monk on Apr 28, 2004 at 13:42 UTC
This is most likely the problem. I have to say, this was pretty darn intuitive of you, and I really appreciate the help. Since I'm trying to stop benig such a hack (ugly code, procedural, use strict, etc.), is this the prettyiest way to while over a string? `#!/usr/bin/perl -w use strict; my $string="wheristhelove"; my @array=split(/\s*/, $string); foreach (@array){ ...` [download] Again, thank you so much for your help!	[reply] [d/l]
Re: problematice metashar regexp by bart (Canon) on Apr 28, 2004 at 01:11 UTC
Like gjb said: it's not a good idea to do one replacement at a time. Why not do them all at once? It'll probably be faster too, as it wouldn't require recompiling the regex again for every substitution — 26 per sub call. You do have the hash you'd need, already. `my $pattern = join "\|", map quotemeta, keys %key: sub decode { $$message->{body} =~ s/($pattern)/$key{$1}/og; }` [download] The initialization must have run before you call the sub for the first time — but that's no different from the situation like you already had, for the hash. Note that you can't have case insensitive searches this way, or the hash entry for the matched string may not exist — though that's easily fixed. But, it doesn't seem to be necessary anyway. For the other way around, you'll need a reverse hash. An alternative, which will be faster in most cases, is to use the module Regex::PreSuf. That's a module to construct a regex (as a string) out of a word list. At least the most recent version takes care of the quotemeta itself. `use Regex::PreSuf; my $pattern = presuf(keys %key);` [download] Nothing else needs to change. For your case, the pattern ends up looking like: `[\^\~\@\!\#\$\%\&\*\+\-0123456789\\\=\\|]` [download] which is rather nice.	[reply] [d/l] [select]
Re: problematice metashar regexp by Belgarion (Chaplain) on Apr 27, 2004 at 22:00 UTC
I would look at the docs on quotemeta. It can potentially (and likely will) return two characters for every one input. For example, `"` will return `\"`. Your mapping functions do not appear to take that possibility into account.	[reply]