Difference between revisions of "Theoretical Aspects of Lexical Analysis/Exercise 17"
From Wiki**3
< Theoretical Aspects of Lexical Analysis
(Replaced content 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...") |
(→Solution) |
||
| Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
| + | {{CollapsedCode|Solução completa| | ||
[[Image:asbasasob1.jpg]] | [[Image:asbasasob1.jpg]] | ||
[[Image:asbasasob2.jpg]] | [[Image:asbasasob2.jpg]] | ||
| + | }} | ||
[[category:Compiladores]] | [[category:Compiladores]] | ||
Latest revision as of 20:40, 23 April 2024
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
Solution
| Solução completa |
|---|
|
|
