Librenix
Headlines | Linux | Apps | Coding | BSD | Admin | News
Information for Linux System Administration 

Recursive Regular Expressions

Up
vote
Down

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:7963 | -pkrumins, December 18, 2009
More Programming articles...

Decorate your home or office with Fine Art

Selected articles

Linux dominates Windows

Microsoft to push unlicensed users to Linux

Hacker Haiku

Closed Source Linux Distribution Launched

The Supreme Court is wrong on Copyright Case

The short life and hard times of a Linux virus

 

Firefox sidebar

Site map

Site info

News feed

Features

Login
(to post)

Search

 
Articles are owned by their authors.   © 2000-2012 Ray Yeargin