| Record ID | harvard_bibliographic_metadata/ab.bib.11.20150123.full.mrc:288158013:1308 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.11.20150123.full.mrc:288158013:1308?format=raw |
LEADER: 01308cam a22003137a 4500
001 011341676-8
005 20080903170027.0
008 070316s2006 enk 001 0 eng d
010 $a 2007272426
020 $a0596528124 (pbk.)
020 $a9780596528126 (pbk.)
035 0 $aocm70844676
040 $aIAY$cIAY$dJRZ$dYDXCP$dIXA$dBAKER$dDLC
042 $alccopycat
050 00 $aQA76.9.T48$bF75 2006
082 04 $a005.711$222
100 1 $aFriedl, Jeffrey E. F.
245 10 $aMastering regular expressions /$cJeffrey E.F. Friedl.
250 $a3rd ed.
260 $aSebastapol, CA :$bO'Reilly,$cc2006.
300 $axxiv, 515 p. :$bill. ;$c23 cm.
500 $aPrevious ed.: 2002.
500 $aIncludes index.
520 $aA regular expression (regex) is a pattern that describes a set of strings. Regular expressions are used for advanced context-sensitive searches (e.g. parsing data streams, data mining) and text modifications. They can be found in many advanced editors (e.g. vi, Emacs), in parser programs (e.g. grep) and in languages (e.g. Perl), mostly in a UNIX environment. This book is the standard work on regexes.
650 0 $aText processing (Computer science)
650 0 $aPerl (Computer program language)
650 0 $aComputer programming.
988 $a20071217
906 $0OCLC