Difference between revisions of "Theoretical Aspects of Lexical Analysis/Exercise 3"

From Wiki**3

< Theoretical Aspects of Lexical Analysis
(New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>((ε|a)b)*</nowiki>)
 
Line 2: Line 2:
  
 
* <nowiki>((ε|a)b)*</nowiki>
 
* <nowiki>((ε|a)b)*</nowiki>
 +
 +
[[category:Teaching]]
 +
[[category:Compilers]]
 +
[[en:Theoretical Aspects of Lexical Analysis]]

Revision as of 22:17, 21 March 2009

Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.

  • ((ε|a)b)*