use strict;
use warnings;

use Algorithm::Loops qw( NestedLoops );
use Data::Dumper     qw( Dumper );
use Parser           qw( );


{
   our %symtab;

   my %eval = (
      var => sub { $symtab{$_[1]} },
      not => sub { ( ~ eval_node($_[1]) ) & 1 },
      and => sub { eval_node($_[1]) & eval_node($_[2]) },
      or  => sub { eval_node($_[1]) | eval_node($_[2]) },
      xor => sub { eval_node($_[1]) ^ eval_node($_[2]) },
   );

   sub eval_node {
      my ($node) = @_;
      $eval{$node->[0]}->(@$node)
   }

   sub eval_expr {
      my ($tree, $vars, $vals) = @_;
      local %symtab;
      @symtab{ @$vars } = @$vals;
      eval_node($tree)
   }
}

my $parser = Parser->new();

foreach my $expr (
   "a*b*!(c)",
   "a'+b'+c'",
   "!(A*B)",
) {
   my $results = $parser->parse($expr)
      or die("Bad expression $expr\n");

   my ($tree, $vars) = @$results;

   print(join("\t", @$vars), "\t$expr\n");
   my $i = NestedLoops([ ([0,1])x@$vars ]);
   while (my @vals = $i->()) {
      my $result = eval_expr($tree, $vars, \@vals);
      print(join("\t", @vals), "\t$result\n");
   }
   print("\n");
}