Pattern matching vs Regular expression

[LHP]

hi, dear  all, 

I have just read some source code, and found In snort, an implementation of a Aho-Corasick like Boyer-Moore Style Searching Algorthim has given, it allows multiple patterns to be searched for in a packet at the same time.and the snort content rules are placed in a Aho-Corasick like keyword search tree that overlaps similar prefixes.  

best regards

Li hongpei


-----原始邮件-----
发件人: Vern Paxson [mailto:vern at icir.org]
发送时间: 2002年5月24日 22:19
收件人: LHP
抄送: Ashley Thomas; bro at lbl.gov
主题: Re: 答复: Pattern matching vs Regular expression 


> how about the multi-pattern matching algorithms?

Yes, that's what I'm referring to.

		Vern