Difference between revisions of "Theoretical Aspects of Lexical Analysis"

From Wiki**3

(New page: == Regular Expressions == == Recognizing Regular Expressions == == Building the NFA: Thompson's Algorithm == == Building DFAs from NFAs == == DFA Minimization == == Input Processing...)
 
Line 1: Line 1:
 +
{{TOCright}}
 
== Regular Expressions ==
 
== Regular Expressions ==
  

Revision as of 03:01, 14 March 2008

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