Skip to content

Latest commit

 

History

History
43 lines (28 loc) · 824 Bytes

README.md

File metadata and controls

43 lines (28 loc) · 824 Bytes

expressionMatch

There are times when one RE can abosrb another RE. For e.g.,

RE1: A quick brown fox jumps {#*#}
RE2: A quick brown fox jumps {#*#} a {#*#} dog.

Now since there is functional requirement for both of the RE, one cannot be deleted. But beacuse of RE1 RE2 can be absorbed.

So, try to find out an optmized way to get the best RE match for a given sentence.

  • v1 string and variable matching
  • v2 variable class diff
  • v3 single vs multichar variable difference
  • v4 multithreaded
{#*#} consider as * -> multiple chars 
{#?#} consider as ? -> one chars

Input

  1. List of REs
  2. Input String

Output Best RE match or NIL str

** NOTE ** Currently not working with {#*#}

sample data obtained from

https://www.smsgatewaycenter.com/site/apartment-society-sms/
thanks