Theoretical Aspects of Lexical Analysis/Exercise 2: Difference between revisions
From Wiki**3
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> |
No edit summary |
||
| 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 20: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*)*