If the problem is always to follow the same pattern as in the above question, ie some [a] and [b] constant strings and after the strings it is always an arithmetic progression like 1,2,3... then the problem is still simple. We can have one parse which would tell us the last two patterns say anbn or b'n-1'an where n is the last number. Now since we know the values of [a], [b] and n, we can change the string to the right one in the second parse.
Correct me if I did not get the question right! ~ amit --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
