0 votes 0 votes A context free grammar is : type $0$ type $1$ type $2$ type $3$ Theory of Computation ugcnetcse-dec2007-paper2 + – go_editor asked Mar 28, 2020 • edited Jun 11, 2020 by soujanyareddy13 go_editor 551 views answer comment Share Follow See 1 comment See all 1 1 comment reply vg653 commented Mar 29, 2020 reply Follow Share Answer should be C. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes C is correct. Ref: https://www.geeksforgeeks.org/chomsky-hierarchy-in-theory-of-computation/ smsubham answered Apr 1, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.