Method for matching in speedup regular expression based on finite automaton containing memorization determination
A finite automaton and expression matching technology, applied in the field of information processing, can solve the problems of increasing the number of states of regular expressions, and achieve the effects of size reduction, development difficulty, cost and complexity reduction
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0039] Regular expression matching acceleration method based on deterministic finite automata with memory: its core is to use deterministic finite automata with memory to directly support the repetition operator (A{n, m}), which basically does not reduce the matching performance Under the condition, for rules with a large number of repetitions, the scale of generating deterministic finite automata (DFA) can be greatly reduced, and the storage cost can be reduced. At the same time, it can also simplify the design of the compiler and greatly reduce the rule processing time. To use a deterministic finite automaton with memory, both the rule compiler and the pattern matching engine must support it.
[0040] The rule description file: the rule description file contains the character strings (regular expressions) to be searched. There can be any rule in the rule description file, and each rule consists of the following parts: a unique identifier, used to distinguish it from other r...
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