发明申请
US20080077587A1 System and method for determining the start of a match of a regular expression
有权
用于确定正则表达式匹配的开始的系统和方法
- 专利标题: System and method for determining the start of a match of a regular expression
- 专利标题(中): 用于确定正则表达式匹配的开始的系统和方法
-
申请号: US11901515申请日: 2007-09-18
-
公开(公告)号: US20080077587A1公开(公告)日: 2008-03-27
- 发明人: Daniel Wyschogrod , Leonid Leibman
- 申请人: Daniel Wyschogrod , Leonid Leibman
- 专利权人: SafeNet, Inc.
- 当前专利权人: SafeNet, Inc.
- 主分类号: G06F7/06
- IPC分类号: G06F7/06 ; G06F17/30
摘要:
A system for determining the start of a match of a regular expression has a special state table which contains start state entries and terminal state entries; a plurality of start state registers for storing offset information indicative of the start of a match of the regular expression; a deterministic finite state automaton (DFA) next state table which, given the current state and an input character, returns the next state. The DFA next state table includes a settable indicator for any next state table entry which indicates whether to perform a lookup into the special state table. A compiler loads values into the special state table based on the regular expression.
公开/授权文献
信息查询