Regular expression matching method and device
A technology of expression matching and expression, which is applied in the field of data processing, can solve the problems of slow matching speed of regular expressions, and achieve the effect of improving the matching speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0085] Example 1: The regular expression "a(bcd)ef" contains a layer of nested metacharacters "()". This layer of nested metacharacters does not contain branch metacharacters "|", and there are no repeated metacharacters behind them. Therefore, the nested metacharacter "()" can be deleted to obtain the required string "abcdef" of the regular expression "a(bcd)ef". Therefore, the fingerprint of the regular expression "a(bcd)ef" is "abc ", "bcd", "cde", and "def".
example 2
[0086] Example 2: The regular expression "abc+de" contains repeated metacharacters "+", indicating that the character "c" is repeated one or more times. When extracting the necessary strings of the regular expression "abc+de", the regular expression "abc+de" can be split into two branch regular expressions "abc" and "cde", and the branch regular expression "abc " is "abc", the required string of branch regular expression "cde" is "cde", and the required string of regular expression "abc+de" is "abc" and " cde", therefore, the fingerprints of the regular expression "abc+de" are "abc" and "cde".
example 3
[0087] Example 3: The regular expression "a(bc)+f" contains nested metacharacters "()" and repeated metacharacters "+", indicating that the string "bc" is repeated one or more times. Similar to Example 2, when extracting the necessary strings of the regular expression "a(bc)+f", the regular expression "a(bc)+f" can be split into two branches. The regular expression "a( bc)" and "(bc)f". Similar to Example 1, the nested metacharacter "()" in the two branch regular expressions can be deleted to obtain "abc" and "bcf", and the necessary strings of the branch regular expression "a(bc)" are is "abc", the required string of branch regular expression "(bc)f" is "bcf", and the required string of regular expression "a(bc)+f" is "abc" and "bcf ", so the regular expression "a(bc)+f" has fingerprints of "abc" and "bcf".
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com