User:Whiteknight/Regular Expressions
This page is an outline for a proposed book or project. This is only a planning page, not an actual book.
(Whiteknight) (Discuss) (Book Foundry) (Current Books) (VBD Edit)
- Do not add sub-pages to this outline.
- Any user may edit this outline, but Whiteknight maintains complete editorial control on this page.
- This page may be deleted without warning.
This outline was last edited on 3 December 2008. Last edit over 192 months ago. Please update.
This plan is going to be implemented to improve the existing stub-book at Regular Expressions.
The Plan
edit- 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
editTable of Contents
edit- Introduction
- Finite State Automata
Regular Expression Basics
edit- Symbols
- Repetition
- Alternation
- Character Classes
- Clustering and Cloistering
- Backreferences
Effective Uses
editParticular Implementations
edit- Perl 5
- Perl 6
- Grep
- Lex
- Java
- .NET and Mono
- TCL
Engine Mechanics
edit- NFA and DFA Engines