#!/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=kkk)(PN=9905)(HH=llkjk))(DD=(LLL=kkk))))
           (ppp=1)(RAW=kkk)(DN=kkk)(RIN=ppp))
         (PPP=1)
         (AA=LLI))