lets say u entered a*.nw aab is i/p string then recursivley substitute a and check for it.or use a table for storing the augmented grammer....
On Sun, Jun 6, 2010 at 6:02 PM, Veer Sharma <[email protected]>wrote: > Hi All > > Here is a problem for us to solve: > > Write a function which takes as parameters one regular > expression(only ? and * are the special characters to consider) and a > string and returns whether the string matched the regular expression. > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- yezhu malai vaasa venkataramana Govinda Govinda -- 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.
