unwanted/regex.py
def match_star(start, front, end, inp, match_len):

    """It matches the data in input 
    which is suurounded by *
    """

    matched_len = 0

    # matches the letter by increasing inp
    # by one at each step

    while(1):
        to_check = front * matched_len
        [is_matched, start_len, end_len] = match(
            start, to_check, inp, match_len
        )
        if(not is_matched):
            break
        else:
            matched_len += 1


    # If the enumeration is more than requied
    # it decreases the length 
    while(matched_len >= 0):
        to_check = (front * matched_len)+end
        [is_matched, start_len, end_len] = match(
            start, to_check, inp, match_len
        )
        if(not is_matched):
            matched_len -= 1
        else:
            return [is_matched, start_len, end_len]

    return [False, None, None]
It matches the data in input 
    which is suurounded by *
    
It matches the data in input
which is suurounded by
It matches the data in input which is suurounded by
def match_star(start, front, end, inp, match_len):
    matched_len = 0
    while(1):
        to_check = front * matched_len
        [is_matched, start_len, end_len] = match(
            start, to_check, inp, match_len
        )
        if(not is_matched):
            break
        else:
            matched_len += 1
    while(matched_len >= 0):
        to_check = (front * matched_len)+end
        [is_matched, start_len, end_len] = match(
            start, to_check, inp, match_len
        )
        if(not is_matched):
            matched_len -= 1
        else:
            return [is_matched, start_len, end_len]
    return [False, None, None]
def match_star ( start , front , end , inp , match_len ) : matched_len = 0 while ( 1 ) : to_check = front * matched_len [ is_matched , start_len , end_len ] = match ( start , to_check , inp , match_len ) if ( not is_matched ) : break else : matched_len += 1 while ( matched_len >= 0 ) : to_check = ( front * matched_len ) + end [ is_matched , start_len , end_len ] = match ( start , to_check , inp , match_len ) if ( not is_matched ) : matched_len -= 1 else : return [ is_matched , start_len , end_len ] return [ False , None , None ]
It matches the data in input
which is suurounded by
It matches the data in input which is suurounded by
"""It matches the data in input 
    which is suurounded by *
    """ # matches the letter by increasing inp # by one at each step # If the enumeration is more than requied # it decreases the length 
start
front
end
inp
match_len