Given the regular expression $(a \mid b)^* abb$ over the alphabet $\S…
Previous year question for Compiler Design.
Question
Given the regular expression $(a \mid b)^* abb$ over the alphabet $\Sigma = \{a, b\}$ :
(i) Construct a NFA with $\epsilon$-transition using Thompson Construction Algorithm.
(ii) Discuss and use the algorithm to convert NFA into DFA with minimised state.
- Year: 2018
- Subject: Compiler Design