• Gianluca,

    Your solution, while helpful, does not return the desired result set.

    I think I see the confusion in my explanation of the problem.

    The problem is to come up with all of the unique GROUP combinations.

    The result set must have one fruit from Group1 and one fruit from Group2 ... 1 fruit from GroupN.

    So if the string field has 1 ';' then there are two groups; Group1 and Group2 (left and right of the ';'). The output should be one fruit from Group1 plus a ',' plus one fruit from Group2. More specifically, all the possible single-fruit-per-group combinations that keep Group1 fruits on the left and Group2 fruits on the right. With no fruit simultaneously in Group1 and Group2 spots during output.

    So if the string field has 2 ';' then there are three groups; Group1, Group2, Group3. Group1's fruits are to the left of the first ';' and Group3's are to the right of the last ';' and Group2's are in the the middle. Then re-concatenate them such that all the possible single-fruit-per-group combinations that keep Group1 fruits on the left and Group2 fruits in the middle and Group3 fruits on the right. With no fruit simultaneously in Group1, Group2 and/or Group3 spots during output.

    Etc.

    In my original post I list out all the valid combinations for output. That is the format that is desired. I hope this helps clear things up and expedites aid.

    Thank you all again for taking a look at this.