<--- Back to Details
First PageDocument Content
Pattern matching / Formal languages / Regular expressions / Automata theory / Scripting languages / ASCII / Control character / Glob / Sed / Computing / Computer programming / Software engineering
Date: 2010-11-15 11:20:43
Pattern matching
Formal languages
Regular expressions
Automata theory
Scripting languages
ASCII
Control character
Glob
Sed
Computing
Computer programming
Software engineering

Regular Expression Quick Reference v1.2  © 2002‐2010 Gordon McKinney. All rights reserved. Literal Characters

Add to Reading List

Source URL: www.night-ray.com

Download Document from Source Website

File Size: 82,09 KB

Share Document on Facebook

Similar Documents

Polynomial Functors Constrained by Regular Expressions A A

DocID: 1uKlC - View Document

Regular Expressions for URL Targeting Regular expressions are used widely in computer programming, allowing people to search through many lines of code for a specific piece of data or find a 

DocID: 1uIrT - View Document

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org SUCCINCTNESS OF THE COMPLEMENT AND INTERSECTION OF REGULAR EXPRESSIONS WOUTER GELADE AND FRANK NEVEN

DocID: 1ukTL - View Document

Tao of Regular Expressions Tao of Regular Expressions Revised: June 5, 1999 by Steve Mansour, Regular expressions explained in three levels: easy, medium, and difficult. Numerous examples. CONTENTS

DocID: 1uhmU - View Document

Regular Expressions Considered Harmful in Client-Side XSS Filters Daniel Bates Adam Barth

DocID: 1tYDb - View Document