Which among the following can parse a context free grammar?
(a) top down parser
(b) bottom up parser
(c) CYK algorithm
(d) all of the mentioned
I got this question in examination.
I want to ask this question from CFL- Other Normal Forms in chapter Properties of Context Free Languages of Automata Theory