assemble tag expression into binary tree, respecting precedence

[id3fs.git] / lib / ID3FS / Path / Node.pm

diff --git a/lib/ID3FS/Path/Node.pm b/lib/ID3FS/Path/Node.pm
index 08c2088..b692750 100644 (file)
--- a/lib/ID3FS/Path/Node.pm
+++ b/lib/ID3FS/Path/Node.pm
@@ -37,9 +37,9 @@ sub print
     my $op=$self->op();
     my $left=$self->left();
     my $right=$self->right();
-    return undef unless($left || $right);
+    return "" unless($left || $right);
     my $str .= $self->print_node($left);
-    $str .= " $op " if($op);
+    $str .= (" " . $op->{name} . " ") if($op);
     $str .= $self->print_node($right);
     if($op || ($left && $right))
     {
@@ -53,7 +53,7 @@ sub print_node
     my($self, $node)=@_;
     return "" unless(defined($node));
     return $node->print() if(ref($node) eq "ID3FS::Path::Node");
-    return $node;
+    return $node->{name};
 }
 
 1;