![]() In general, #(L,U) represents a run of arbitrary characters with length from L (lower-bound) to U (upper-bound), inclusively. With that, P can match bbaaa, bbabaa, bbacada, etc. While a and b are regular characters, #(1,3) means any sequence of arbitrary characters with length in the range from 1 to 3. Instead of being literal, the Pattern now contains some flexible-length sequence of arbitrary characters. Bounded-length runs for Arbitrary characters In particular, we are interested in patterns with bounded-length runs for arbitrary characters and patterns with optional characters. ![]() Today, we examine how the same algorithm can be modified for some types of generalized string patterns (i.e. In the previous post, we looked at how the Shift-AND algorithm can efficiently solve the problem of exact pattern matching.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |