1 1 vote what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this? Theory of Computation context-free-language theory-of-computation context-free-grammar + – aditi19 2.3k views answer comment Share Follow Print See all 15 Comments 15 15 Comments reply Show 12 previous comments srestha commented Mar 8, 2019 reply Follow flag that means every cfl has cfg, but every cfg may not have cfl 0 0 replyShare srestha commented Mar 8, 2019 reply Follow flag @Shaik Masthan chk this question https://gateoverflow.in/204109/gate2018-35 here chk this line "this grammar is CFG, so it can generate CFL" So, can we not say, every CFG can generate CFL? 0 0 replyShare Shaik Masthan commented Mar 9, 2019 reply Follow flag that means every cfl has cfg, but every cfg may not have cfl WHO SAYS ? 0 0 replyShare Please log in or register to add a comment.
Best answer 3 3 votes i am getting this . abhishekmehta4u answered Mar 8, 2019 • selected Mar 8, 2019 by aditi19 abhishekmehta4u comment Share Follow See 1 comment 1 1 comment reply Shaik Masthan commented Mar 8, 2019 reply Follow flag i think this is correct. 0 0 replyShare Please log in or register to add a comment.
