try to solve it by recursion .. http://www.leetcode.com/2011/09/regular-expression-matching.html
Regards, Ritesh Kumar Mishra Information Technology Third Year Undergraduate MNNIT Allahabad On Sun, Dec 23, 2012 at 11:14 PM, Prem Krishna Chettri <hprem...@gmail.com>wrote: > Well I can tell you Something about design pattern to solve this case.. > > What I mean is by using The State Machine Design Pattern, Anyone > can solve this. but Ofcourse it is complicated. > > > > > On Sun, Dec 23, 2012 at 11:01 PM, shady <sinv...@gmail.com> wrote: > >> that's the point, Have to implement it from scratch... otherwise java has >> regex and matcher, pattern to solve it........... >> >> >> On Sun, Dec 23, 2012 at 10:28 PM, saurabh singh <saurab...@gmail.com>wrote: >> >>> If you need to implement this for some project then python and java have >>> a very nice library >>> >>> >>> Saurabh Singh >>> B.Tech (Computer Science) >>> MNNIT >>> blog:geekinessthecoolway.blogspot.com >>> >>> >>> On Sun, Dec 23, 2012 at 7:48 PM, shady <sinv...@gmail.com> wrote: >>> >>>> >>>> http://stackoverflow.com/questions/13144590/to-check-if-two-strings-match-with-alphabets-digits-and-special-characters >>>> >>>> any solution for this......... we need to implement such regex >>>> tester................ >>>> >>>> some complex cases : >>>> *string* * regex * -> * status* >>>> * >>>> * >>>> reesd re*.d -> match >>>> re*eed reeed -> match >>>> >>>> can some one help with this ? >>>> >>>> -- >>>> >>>> >>>> >>> >>> -- >>> >>> >>> >> >> -- >> >> >> > > -- > > > --
