Which of the following are valid membership algorithms?
(a) CYK algorithm
(b) Exhaustive search parser
(c) Both (a) and (b)
(d) None of the mentioned
I have been asked this question in exam.
This intriguing question originated from Intersection with Regular Languages topic in section Properties of Context Free Languages of Automata Theory