13 return { key => $k, left => undef, right => undef, flags => "" };
19 if ($s =~ /^ \s* _ \s* (.*) $/x) { return undef, $1; }
20 $s =~ /^ \s* \( \s* (.*) $/x or die "bad string";
21 (my $left, $s) = read_tree $1;
22 $s =~ /^ \s* ([*]*) \s* (\d+) \s* (.*) $/x or die "bad string";
23 (my $flags, my $key) = ($1, $2);
24 (my $right, $s) = read_tree $3;
25 $s =~ /^ \s* \) \s* (.*) $/x or die "bad string";
27 $node->{left} = $left; $node->{right} = $right; $node->{flags} = $flags;
40 if ($firstp && /^\s*[(_]/) {
41 ($tree, my $tail) = read_tree $_;
42 $tail =~ /^ \s* $/x or die "bad string";
47 m{^ \s+ \#0x[0-9a-f]{8} \s+ \(n \s* = \s* \d+\)
48 (\s+) \(([ *+=-])\) (?: \s+ (0x[0-9a-f]{8} \s* \$)) \s+ (\d+) $}x
49 or die "bad line `$_'";
56 if ($opt_r && $sigil eq "*") { $node->{flags} .= "*"; }
57 if (defined $weight) { $node->{flags} .= $weight . " "; }
59 while ($SP && $LV[$SP - 1] > $lv)
60 { $SP--; my $n = $N[$SP]; $n->{right} = $left; $left = $n; }
61 $node->{left} = $left; $N[$SP] = $node; $LV[$SP] = $lv; $SP++;
63 while ($SP) { $SP--; my $n = $N[$SP]; $n->{right} = $tree; $tree = $n; }
66 sub show_tree ($$$$) {
67 my ($node, $dp, $lp, $nl) = @_;
68 if ($node->{flags} eq "*") { $dp = ($dp&-2) + 1; }
70 show_tree $node->{left}, $dp + 1, $lp + 1, $nl;
71 print "\n" . "\t" x $dp . $node->{flags} . $node->{key};
74 print "\t" x $dp . "(" x $lp . "_ " . $node->{flags} . $node->{key};
76 if ($node->{right}) { show_tree $node->{right}, $dp + 1, 1, 1; }
80 show_tree $tree, 1, 1, 0;