Theoretical Aspects of Lexical Analysis/Exercise 1: Difference between revisions

From Wiki**3

< Theoretical Aspects of Lexical Analysis
← Older edit
Root (talk | contribs)
PRIVATE, Bureaucrats, Administrators
15,362 edits
No edit summary
Root (talk | contribs)
PRIVATE, Bureaucrats, Administrators
15,362 edits
No edit summary
 
(20 intermediate revisions by the same user not shown)
Line 1: Line 1:
__NOTOC__
<div class="section-container auto" data-section>
  <div class="section">
    <p class="title" data-section-title>Problem</p>
    <div class="content" data-section-content>
<!-- ====================== START OF PROBLEM ====================== -->
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.


* <nowiki>(a|b)*</nowiki>
* '''<nowiki>(a|b)*</nowiki>'''
 
<!-- ====================== END OF PROBLEM ====================== -->
== Solution ==
    </div>
 
  </div>
=== NFA ===
  <div class="section">
 
    <p class="title" data-section-title>Solution</p>
The following is the result of applying Thompson's algorithm.
    <div class="content" data-section-content>
 
<!-- ====================== START OF SOLUTION ====================== -->
<graph>
The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>(a|b)*</nowiki>''' is the following:
 
{{CollapsedCode|NFA for <nowiki>(a|b)*</nowiki>|
<kroki lang="graphviz">
digraph nfa {
digraph nfa {
 
    { node [shape=circle style=invis] start }
rankdir=LR;
  rankdir=LR; ratio=0.5
ratio=0.5
  node [shape=doublecircle,fixedsize=true,width=0.2,fontsize=10]; 7
node [shape=doublecircle,fixedsize=true,width=0.2,fontsize=10]; 7
  node [shape=circle,fixedsize=true,width=0.2,fontsize=10];
node [shape=circle,fixedsize=true,width=0.2,fontsize=10];
  start -> 0
 
   0 -> 1  
   0 -> 1  
   1 -> 2  
   1 -> 2  
Line 27: Line 34:
   6 -> 1
   6 -> 1
   6 -> 7
   6 -> 7
   0 -> 7
   0 -> 7
   fontsize=10
   fontsize=10
  label="NFA for (a|b)*"
}
}
</graph>
</kroki>
 
}}
=== DFA ===
 
Determination table for the above NFA:


Applying the determination algorithm to the above NFA, the following determination table is obtained:
{| cellspacing="2"
{| cellspacing="2"
! style="padding-left: 20px; padding-right: 20px; background: wheat;" | I<sub>n</sub>
! style="padding-left: 20px; padding-right: 20px; background: wheat;" | I<sub>n</sub>
Line 61: Line 63:
! style="font-weight: normal; align: center; background: #e6e6e6;" | b  
! style="font-weight: normal; align: center; background: #e6e6e6;" | b  
! style="font-weight: normal; align: center; background: #e6e6e6;" | 5
! style="font-weight: normal; align: center; background: #e6e6e6;" | 5
! style="font-weight: normal; align: left;  background: #e6e6e6;" | 1, 2, 3, 4, 6, '''7'''
! style="font-weight: normal; align: left;  background: #e6e6e6;" | 1, 2, 4, 5, 6, '''7'''
! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2'''
! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2'''
|-
|-
Line 73: Line 75:
! style="font-weight: normal; align: center; background: #ffffcc;" | b  
! style="font-weight: normal; align: center; background: #ffffcc;" | b  
! style="font-weight: normal; align: center; background: #ffffcc;" | 5
! style="font-weight: normal; align: center; background: #ffffcc;" | 5
! style="font-weight: normal; align: left;  background: #ffffcc;" | 1, 2, 3, 4, 6, '''7'''
! style="font-weight: normal; align: left;  background: #ffffcc;" | 1, 2, 4, 5, 6, '''7'''
! style="font-weight: normal; align: center; background: #ffffcc;" | '''2'''
! style="font-weight: normal; align: center; background: #ffffcc;" | '''2'''
|-
|-
Line 85: Line 87:
! style="font-weight: normal; align: center; background: #e6e6e6;" | b  
! style="font-weight: normal; align: center; background: #e6e6e6;" | b  
! style="font-weight: normal; align: center; background: #e6e6e6;" | 5
! style="font-weight: normal; align: center; background: #e6e6e6;" | 5
! style="font-weight: normal; align: left;  background: #e6e6e6;" | 1, 2, 3, 4, 6, '''7'''
! style="font-weight: normal; align: left;  background: #e6e6e6;" | 1, 2, 4, 5, 6, '''7'''
! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2'''
! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2'''
|}
|}


[[category:Teaching]]
{| width="100%"
[[category:Compilers]]
! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" |Graphically, the DFA is represented as follows:
<kroki lang="graphviz">
digraph dfa {
    { node [shape=circle style=invis] start }
  rankdir=LR; ratio=0.5
  node [shape=doublecircle,fixedsize=true,width=0.2,fontsize=10]; 0 1 2
  node [shape=circle,fixedsize=true,width=0.2,fontsize=10];
  start -> 0
  0 -> 1 [label="a"]
  0 -> 2 [label="b"]
  1 -> 1  [label="a"]
  1 -> 2  [label="b"]
  2 -> 1 [label="a"]
  2 -> 2 [label="b"]
  fontsize=10
}
</kroki>
 
Given the minimization tree to the right, the final minimal DFA is:
<kroki lang="graphviz">
digraph dfamin {
    { node [shape=circle style=invis] start }
  rankdir=LR; ratio=0.5
  node [shape=doublecircle,fixedsize=true,width=0.4,fontsize=10]; 012
  node [shape=circle,fixedsize=true,width=0.2,fontsize=10];
  start -> 012
  012 -> 012 [label="a"]
  012 -> 012 [label="b"]
  fontsize=10
  /*label="DFA for (a|b)*"*/
}
</kroki>
 
! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" | The minimization tree is as follows. As can be seen, the states are indistinguishable.
 
<kroki lang="graphviz">
digraph mintree {
  node [shape=none,fixedsize=true,width=0.2,fontsize=10]
  " {0, 1, 2}" -> "{}" [label="NF",fontsize=10]
  " {0, 1, 2}" -> "{0, 1, 2}" [label="F",fontsize=10]
  "{0, 1, 2}" -> "{0, 1, 2} " [label="a,b",fontsize=10]
  fontsize=10
  /*label="Minimization tree"*/
}
</kroki>
|}
<!-- ====================== END OF SOLUTION ====================== -->
    </div>
  </div>
</div>
 
[[category:Compiladores]]
[[category:Ensino]]
[[en:Theoretical Aspects of Lexical Analysis]]
[[en:Theoretical Aspects of Lexical Analysis]]

Latest revision as of 18:22, 26 April 2026


Problem

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

  • (a|b)*

Solution

The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression (a|b)* is the following:

NFA for (a|b)*

Applying the determination algorithm to the above NFA, the following determination table is obtained:

In α∈Σ move(In, α) ε-closure(move(In, α)) In+1 = ε-closure(move(In, α))
- - 0 0, 1, 2, 4, 7 0
0 a 3 1, 2, 3, 4, 6, 7 1
0 b 5 1, 2, 4, 5, 6, 7 2
1 a 3 1, 2, 3, 4, 6, 7 1
1 b 5 1, 2, 4, 5, 6, 7 2
2 a 3 1, 2, 3, 4, 6, 7 1
2 b 5 1, 2, 4, 5, 6, 7 2
Graphically, the DFA is represented as follows:

Given the minimization tree to the right, the final minimal DFA is:

The minimization tree is as follows. As can be seen, the states are indistinguishable.
Retrieved from "https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_1&oldid=17693"