A recursive approach (which is what I would use) would involve breaking the problem into isomorphic subproblems: to find all permutations of a string, find all permutations of the string without a ...

Context-free Grammar: A recursive combinatorial framework used for generating sequences and functions that describe permutation properties.