Compiler for compiling content search rules comprising a regular expression using a programmable intelligent search memory (PRISM) and vectors
OwnerAshish A. Pandyainventor
Life of this patent
Estimating the term…
Loading patent…
OwnerAshish A. Pandyainventor
Estimating the term…
Memory architecture provides capabilities for high performance content search. Content search rules comprise of regular expressions which are compiled to finite state automata and then programmed in Programmable Intelligent Search Memory (PRISM) for evaluating content with the search rules. A compiler compiles the content search rules for evaluation by PRISM memory. The PRISM memory architecture creates an innovative memory that can be programmed with content search rules which are used by the memory to evaluate presented content for matching with the programmed rules. When the content being searched matches any of the rules programmed in the Programmable Intelligent Search Memory (PRISM) action(s) associated with the matched rule(s) are taken.
A compiler for compilation of a content search rule, the content search rule comprising a regular expression, the regular expression comprising a symbol, the compiler generating a data structure derived from the regular expression, the data structure comprising a finite state automata representing functionality of the regular expression, the finite state automata(FSA) comprising a compiled representation of the symbol;
Dependencies are inferred from the claim text.