Context-free grammar can be recognized by
| A. | finite state automation |
| B. | 2-way linear bounded automata |
| C. | push down automata |
| D. | both (b) and (c) |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
