Parsing from leaves to root using regular expressions: #!/usr/bin/perl
use Data::Dumper;
use warnings;
use strict;
undef $/;
my $input = <DATA>;
$input =~ s/[ \n]//g;
my %tree;
while ($input =~ /[()]/) {
if (my ($parent, $son) = $input =~ /\(([^()]+)=\(([^()]+)\)/) {
my ($name, $value) = split /=/, $son;
if (length $value) {
push @{ $tree{$parent} }, {$name => $value};
} else {
push @{ $tree{$parent} }, { $name => $tree{$name} };
delete $tree{$name};
}
$input =~ s/\($son\)//;
} elsif (my ($root, $value) = $input =~ /\(([^()]+)=([^()]+)\)/) {
$tree{$root} = $value;
$input =~ s/\($root=$value\)//;
} else {
die "Invalid input\n" unless $input =~ /^\([^()]+=\)$/;
last;
}
}
if (keys %tree > 1) {
die "More than one root\n";
}
print Dumper \%tree;
__DATA__
(S=(SN=ac2.bd)
(I1=(IN=s%1)(NM=1)
(HL=(HLD=kkk kjkjk)(ST=abdc)(HI=REM SSS)(H_M=9)(HL=72)(EB=0)
+(ER=0)(HI=E043-93A-DF0-0AB63E)(PE=aaa)(HN=DEE)(SS=NS)(SED=(APR=(PAD=k
+kk)(PN=9905)(HH=llkjk))(DD=(LLL=kkk))))
(ppp=1)(RAW=kkk)(DN=kkk)(RIN=ppp))
(PPP=1)
(AA=LLI))
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|