Theoretical Aspects of Lexical Analysis - Wiki**3

Theoretical Aspects of Lexical Analysis

From Wiki**3

Revision as of 02:58, 14 March 2008 by Root (talk | contribs) (New page: == Regular Expressions == == Recognizing Regular Expressions == == Building the NFA: Thompson's Algorithm == == Building DFAs from NFAs == == DFA Minimization == == Input Processing...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Contents

1 Regular Expressions
2 Recognizing Regular Expressions
3 Building the NFA: Thompson's Algorithm
4 Building DFAs from NFAs
5 DFA Minimization
6 Input Processing
7 Recognizing Multiple Expressions
8 Example 1: Ambiguous Expressions
9 Example 2: Backtracking

Regular Expressions

Recognizing Regular Expressions

Building the NFA: Thompson's Algorithm

Building DFAs from NFAs

DFA Minimization

Input Processing

Recognizing Multiple Expressions

Example 1: Ambiguous Expressions

Example 2: Backtracking

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis&oldid=2237"