Exercise $1\mathrm{.}4$ Given the regular expression $(b((b,b|)|))$ :

$($a$)$ Construct an equivalent NFA using the method in Sect$\mathrm{.}1\mathrm{.}3.$

$($b$)$ Convert this NFA to a DFA using Algorithm $1\mathrm{.}3.$

Introduction to compiler design second edition

Torben mogensen