I am trying to use the Thompson's method to draw an NFA for a RegEx given by: $(a+b|c?)c$
I am wondering if I should deconstruct the RegEx as -
- Concatenation of $a+$, $(b|c?)$ together with $c$ OR
- Union of $a$ and $(b|c?)$ concatenated with $c$
In either case, I would the need the atomic NFA construction for the $c?$. I am unable to figure it out.