This isn't really a Perl question, but more of a programming logic one. It just happens that the only language I'm a little fluent in is Perl.

Given an array of arrays of unknown dimensions, how do I generate all possible combinations, as in:

my @array = (
    [ "a", "b", "c", ],
    [ "1", "2", "3", "4", ],
    [ "x", "y", ],
    ); 

a1x, a1y, a2x, a2y, a3x, a3y, a4x, a4y, b1x, b1y, b2x, b2y, b3x, b3y, 
+b4x, b4y, c1x, c1y, c2x, c2y, c3x, c3y, c4x, c4y
[download]

Until now all I've managed is:

my @as = @{ $array[0] };
foreach my $a (@as) {
    my @bs = @{ $array[1] };
    foreach my $b (@bs) {
        my @cs = @{ $array[2] };
        foreach my $c (@cs) {
            print $a;
            print $b;
            print $c . ", ";
        }
    }
}
[download]

I need to abstract away from the indices (1,2,3) in that code, meaning I need this to work independent of dimension of the first array (it will always remain a array of arrays though, no further embedding is necessary).

Or am I approaching this wrong in the first place?