The following is/are an approach to process a regexp:
(a) Contruction of NFA and subsequently, a DFA.
(b) Thompson’s Contruction Algorithm
(c) Both (a) and (b)
(d) None of the mentioned
The question was posed to me in homework.
My question is from Converting Regular Expressions to Automata topic in portion Regular Expressions and Languages of Automata Theory