Theoretical Aspects of Lexical Analysis/Exercise 1: Difference between revisions
From Wiki**3
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
* <nowiki>(a|b)*</nowiki> | * <nowiki>(a|b)*</nowiki> | ||
== Solution == | |||
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] | ||
[[en:Theoretical Aspects of Lexical Analysis]] | [[en:Theoretical Aspects of Lexical Analysis]] | ||
Revision as of 20:18, 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)*