Fred was a happy programmer. Like with so many projects before, Fred neede to verify some data, but this time the data was pretty simple--just numbers and colons. The (small) catch was that the colons must come in pairs, whit no singletons allowed.Ahora, Fred = Full Regular Expression Description.
Sounds like a regular-expression match is just the hammer for this nail, and that's exacly what Fred used.
Jeffrey Friedl - The story of Fred.
mira esto http://www.microsoft.com/spanish/msdn/comu...ices/art101.asp (http://www.microsoft.com/spanish/msdn/comunidad/mtj.net/voices/art101.asp) por lo que veo el .net se copio del perl
The regular expressions that we know and love started out as a formal algebra in the early 1950's, but belive me, I don't want to get into a discussion of the theory.Perl siempre a usado NFA, al igual que vi, sed, GNU emacs, Python, Tcl, expect y muchas versiones de grep.
What is relevant here is there are two basic methods to implement a regular expression engine: NFA and DFA....