I have been searching for an answer to the following problem:
Given a regexp and the maximal length of the string results know all possible outputs.
I am concretely thingking about a method call that would expand into an array of possible strings of charaters.
It could be mathematically demostrated that given the possible maximal length of the result strings, there is a finite number of them.
Intuition could be squarely wrong, but I have the very strong feeling that there should be something like that. Well, maybe I am getting to these issues from another perspective and I am wishfully thinking (and lazzyly wanting :-), for there to be something like that.
Again, I could be basically wrong in my approach.