At first, string processing might seem very hard to optimize. If you’re looking for a newline in some text, you have to check every character in the string against every type of newline, right?

At first, string processing might seem very hard to optimize. If you’re looking for a newline in some text, you have to check every character in the string against every type of newline, right?

If you’ve programmed in Perl or any other language with built-in regular-expression capabilities, then you probably know how much easier regular expressions make text processing and pattern matching.

Texts in computer science is represented in strings. Simply, a string is defined as a finite sequence of characters belonging to an alphabet. All text processing tools or operations must rely on ...