|
Recursive Regular Expressions |
vote
 |
|
The regular expressions we use in our daily lives are actually not that "regular." Most of the languages support some kind of extended regular expressions that are computationally more powerful than the "regular" regular expressions as defined by the formal language theory.
This article explains the power of modern regular expressions and shows how Perl's recursive regular expressions can solve context-free grammar problems, such as matching string 0n1n or matching valid parenthesis expression like (()(())).
| | |
| |
|
|
| read more | mail this link | score:7201 | -pkrumins, December 18, 2009 |
