Can we do it using suffix trees and apply DFS on it?? On Tue, Jul 5, 2011 at 11:45 PM, swetha rahul <[email protected]>wrote:
> Hi, > Write a function which takes two char * s as inputs, one is a > regular expression pattern and the other is a test string and check whether > the test string is of the given regular expression pattern. > The regular expression pattern can contain all lower-case letter, asterisk > and question mark. > As usual asterisk stands for 0 or more number of chars and ? for any one > char. > E.g. Regular Expression: a*b?c > Test String: aaavcxbmbcxmbkc > Result: TRUE > Test String: abc > Result: FALSE > Test String: abzx > Result: TRUE > > What is d best way 2 do this... > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=100000655377926 * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
