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

Buy Large Abstract Art Prints

Selected articles

Librenix T-Shirts and Coffee Mugs!

Mono-culture and the .NETwork effect

The Network Computer: An opportunity for Linux

Why Programmers are not Software Engineers

Programming Language Tradeoffs: 3GL vs 4GL

Download: Linux 3D Client for Starship Traders

 

Firefox sidebar

Site map

Site info

News feed

Features

Login
(to post)

Search

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