Theoretical Aspects of Lexical Analysis/Exercise 17: Difference between revisions
From Wiki**3
Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = {..." |
No edit summary |
||
| Line 247: | Line 247: | ||
--> | --> | ||
[[category: | [[category:Compiladores]] | ||
[[category: | [[category:Ensino]] | ||
[[en:Theoretical Aspects of Lexical Analysis]] | [[en:Theoretical Aspects of Lexical Analysis]] | ||
Revision as of 14:37, 6 April 2015
Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).
The alphabet is Σ = { a, b }. Indicate the number of processing steps for the given input string.
- G = { a*, ba*, a*|b }, input string = aababb
NFA
The following is the result of applying Thompson's algorithm.
DFA
Determination table for the above NFA: Graphically, the DFA is represented as follows: The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.