This isn't that hard to code, but it's a recursive solution. There are a couple of possibilities. The easiest, if you're familiar with the data structure, would be to turn the arrays into trees. Then, just follow all of the paths from root to leaves.

The other way is similar, but you don't have to build a tree to do it. Write a function that steps through the elements of an array it's given, calls itself when it hits a 2, and returns an array of all of the possible branches. Glue everything together (the only hard part besides getting the recursion correct), and you're in business.

I could provide demo code if you're really curious, but it's nearly naptime.

use Carp;

sub print_possib {
  my @array = @_;
  my $pat = 0; # Counter used as a bit-vector
  print "(\n";
  # A merlyn loop.
  {
    my $x = $pat;
    my @row;
    foreach my $i (@array) {
      if (2 == $i) {
        # Use the bit-vector to choose what to do now
        push @row, $x&1 ? 1 : 0;
        $x >>= 1; # Shift off the used bit
      }
      elsif (0 == $i or 1 == $i) {
        push @row, $i;
      }
      else {
        confess "Illegal value $i: Legal ones are 0, 1, and 0";
      }
    }
    if ($x) {
      # We have more bits than needed, would start repeating.
      # So end instead
      print " )\n";
      return;
    }
    else {
      print (
        ($pat ? ",\n  [ " : "( [ "), # Start or divider
        (join ", ", @row), # Row
        " ]"
      ); # Close the row
      ++$pat;
      redo;
    }
  }
}

print_possib(@ARGV);
[download]

my %ControlMatrix;
$ControlMatrix{Label}   = [ 1, 2, 1, 0, 0, 1, 2, 1, 1, 2, 1 ];
$ControlMatrix{Textbox} = [ 1, 1, 2, 0, 0, 1, 2, 2, 1, 1, 0 ]; 
$ControlMatrix{Button}  = [ 1, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0 ];
[download]

After all, that's what hashes are for, right? :-)

@ControlMatrix = ( [1, 2, 0, 2], [0, 0, 2, 1] )
@perms = (
  ([1, 0, 0, 0], [1, 1, 0, 0], [1, 0, 0, 1], [1, 1, 0, 1])
  ([0, 0, 0, 1], [1, 1, 1, 1])
)
[download]

$index = 0;
$pcount = 1;

for ($names = 0; $names < @ControlNames.length; $names++) {
  for ($fields = 0; $fields < $ControlMatrix[$names].length; $fields++
+) {
    if (@ControlMatrix[$names][$fields] < 2 ) {
      for ($q = 0; $q < $pcount; $q++) {
        @perms[$names][$q][$fields] = @ControlMatrix[$names][$fields];
      }
    } else {
      for ($q = 0; $q < $pcount; $q++) {
        @perms[$names][$q+$pcount] = @perms[names][$q];
        $perms[$names][$q][$fields] = 0;
        $perms[$names][$q+$pcount][$fields] = 1;
      }
      $pcount *= 2;
    }
  }
}
[download]