Hi,
I want to know some direction towards the problem of pattern matching with
regular expressions.
Suppose we are given two strings say S and T. Where S is pattern that can
contain regular expression and T is some large string . Then how to say
that S is substring of T.
Eg. S= ab.bc* T=
Can it be solved using Finite automata??
On 29 November 2011 06:46, kumar raja 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:3
@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 wrote:
> specify language .
> if in c
> then first write code in lex then compile it af
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 e
string pattern matching with reg exp.
ex: str : abccdefpattern : bc*dk*
should return true; because bccd is subset of str.
--
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"
There is Pattern class Java and also same like function in C++
http://leepoint.net/notes-java/data/strings/40regular_expressions/26pattern-matcher.html
On Sat, Sep 3, 2011 at 2:41 PM, Dheeraj Sharma
wrote:
> for '?' u just increment ur pointer(which is returned by previous one.) by
> 1..
>
>
> O
for '?' u just increment ur pointer(which is returned by previous one.) by
1..
On Sun, Sep 4, 2011 at 12:09 AM, Dheeraj Sharma wrote:
> for * it can be like.. for example we have any string say *ab*c*de*
> it is composed of three strings ..that has to be searched.in that sequece
> in only..whic
for * it can be like.. for example we have any string say *ab*c*de*
it is composed of three strings ..that has to be searched.in that sequece in
only..which means..first ab would appear..then c ..then de..
first search for pattern "ab" in string..using pattern matching function..
then search for c
Implement a function that receive a string S and a pattern containing
wild characters ( * and ? only) in string P. Function return true if S
matches the pattern P.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send em
wht is KMP? pls give some info ..
On Fri, Sep 2, 2011 at 11:59 PM, sukran dhawan wrote:
> start drom brue force.then interviewer will ask u to optimize it.then
> refine it.dont jum into the optimised soln directly
>
> On Sat, Sep 3, 2011 at 12:35 AM, Aman Kumar wrote:
>
>> Hiii
>>
>> Friends ,if
start drom brue force.then interviewer will ask u to optimize it.then refine
it.dont jum into the optimised soln directly
On Sat, Sep 3, 2011 at 12:35 AM, Aman Kumar wrote:
> Hiii
>
> Friends ,if pattern matching question is asked in the interview , we
> should answer brute force(with some optim
Use KMP dude if u know it ...Who told not to use it ??
Dont read absurd things from net
Regards
Ankur
On Sat, Sep 3, 2011 at 12:35 AM, Aman Kumar wrote:
> Hiii
>
> Friends ,if pattern matching question is asked in the interview , we
> should answer brute force(with some optimization) approach
Hiii
Friends ,if pattern matching question is asked in the interview , we
should answer brute force(with some optimization) approach or use
ADVANCED algorithm like KMP?
I am very much confused regarding this because in on blog i have read
that we should not use advanced data structure in intervie
Given a text file, implement a solution to find out if a pattern
similar to wild cards can be detected.
fort example find if a*b*cd*, or *win or *def* exists in the text.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group,
14 matches
Mail list logo
