1 1 vote Identify type of grammer:- S-> a | $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3 Theory of Computation theory-of-computation identify-class-language + – rahul sharma 5 877 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Rishabh Gupta 2 commented Sep 11, 2017 reply Follow flag All. 0 0 replyShare hs_yadav commented Sep 11, 2017 reply Follow flag Rishabh Gupta in the case of type 1 grammar (CSL).... let x->y .... x,y-> (v+t)+ and length(x)<=length(y) ...??? not type 1... 0 0 replyShare G.K.T commented Sep 11, 2017 reply Follow flag this constraint is relaxed for starting symbol untill and unless that starting symbol not used elsewhere in the grammar on the right hand side. 0 0 replyShare stblue commented Sep 12, 2017 reply Follow flag All are correct, but here if you have to choose strongest answer, then answer would be Type - 3 grammer. 0 0 replyShare Please log in or register to add a comment.
0 0 votes type 3 or regular grammar Priyanka Agarwal answered Sep 12, 2017 Priyanka Agarwal comment Share Follow 0 reply Please log in or register to add a comment.
