Theoretical Aspects of Lexical Analysis: Difference between revisions

From Wiki**3

(New page: == Regular Expressions == == Recognizing Regular Expressions == == Building the NFA: Thompson's Algorithm == == Building DFAs from NFAs == == DFA Minimization == == Input Processing...)
 
 
(99 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Regular Expressions ==
#REDIRECT [[ist:Theoretical Aspects of Lexical Analysis]]
 
 
== 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 ==
 
[[category:Teaching]]
[[category:Compilers]]

Latest revision as of 22:06, 5 December 2018

Redirect to:

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis&oldid=10996"