Can it be solved using Finite automata?? On 29 November 2011 06:46, kumar raja <rajkumar.cs...@gmail.com> wrote:
> @harry > > It is not about using existing regexp matching techniques > > You have to design ur own technique using existing Pattern matching > algorithms to handle this stuff... > > > On 29 November 2011 06:35, hary rathor <harry.rat...@gmail.com> wrote: > >> specify language . >> if in c >> then first write code in lex then compile it after that you will got your >> c code. >> if in java then you can use regex class for such code . >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > 10it60...@iitkgp.ac.in > > > -- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, 10it60...@iitkgp.ac.in -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
