User:Whiteknight/Regular Expressions

From Wikibooks, open books for an open world
Jump to navigation Jump to search
This page is an outline for a proposed book or project. This is only a planning page, not an actual book.
  1. Do not add sub-pages to this outline.
  2. Any user may edit this outline, but Whiteknight maintains complete editorial control on this page.
  3. This page may be deleted without warning.

This outline was last edited on 3 December 2008. Last edit over 184 months ago. Please update.

(Whiteknight) (Discuss) (Book Foundry) (Current Books) (VBD Edit)

This plan is going to be implemented to improve the existing stub-book at Regular Expressions.

The Plan[edit | edit source]

Target Audience
Computer programmers and IT professionals
Scope
Will cover mathematical foundations of regular expressions, particular implementations, uses/tips/tricks, and mechanics (how to create a new engine).
Prerequisites
Nothing specific, although at least 1 high-level language (Perl Programming or similar)
Corequisites
None.

Preface[edit | edit source]

Table of Contents[edit | edit source]

  • Introduction
  • Finite State Automata

Regular Expression Basics[edit | edit source]

  • Symbols
  • Repetition
  • Alternation
  • Character Classes
  • Clustering and Cloistering
  • Backreferences

Effective Uses[edit | edit source]

Particular Implementations[edit | edit source]

  • Perl 5
  • Perl 6
  • Grep
  • Lex
  • Java
  • .NET and Mono
  • TCL

Engine Mechanics[edit | edit source]

  • NFA and DFA Engines

Resources[edit | edit source]

Existing Pages[edit | edit source]