How hard would it be to implement a method to get all valid follow-up tokens to an incomplete sequence? For example, let's say a valid string is alternating letters and numbers. If I provided the string "a", then the valid follow-up tokens would be {1,2,3,4,5,6,7,8,9,0}. Would this even be possible?
How hard would it be to implement a method to get all valid follow-up tokens to an incomplete sequence? For example, let's say a valid string is alternating letters and numbers. If I provided the string "a", then the valid follow-up tokens would be
{1,2,3,4,5,6,7,8,9,0}. Would this even be possible?