0 0 votes S --> 0S1 S -->0S S-->S1 S-->0 THE LANGUAGE GENERATED BY THIS GRAMMAR IS_____? A. regular language B. Context free language C. Context sensitive language D. Recursively enumerable language Theory of Computation theory-of-computation + – sh!va 1.8k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes The grammar generates .. (0^+ ) + (0^+ 1^+ ) .. Which is regular ..so language generated by given grammar is all of the given options... But strongly speaking it is regular... papesh answered Jul 16, 2016 papesh comment Share Follow See all 7 Comments 7 7 Comments reply LeenSharma commented Jul 16, 2016 i edited by LeenSharma Jul 16, 2016 reply Follow flag L=0+1* or L={ 0n 1m | n>0 , m≥0 } 0 0 replyShare papesh commented Jul 16, 2016 reply Follow flag How 1 can be generated ?? And what's ur point sir ?? 0 0 replyShare LeenSharma commented Jul 16, 2016 reply Follow flag wrote by mistake .my point was you can also write this language as L=0+1* or L={ 0n 1m | n>0 , m≥0 } 1 1 replyShare Anjali_aspirant commented Jul 16, 2016 reply Follow flag i have one doubt.. a grammar is regular when it is left linear or right linear . this grammar is not regular bt language generated by this grammr is regular ? am i correct 1 1 replyShare Devwritt commented Jul 16, 2016 reply Follow flag we can write regular expression for regular language thats why regular language please check 0 0 replyShare sh!va commented Jul 16, 2016 reply Follow flag a grammar is regular when it is left linear or right linear. A non linear grammar may or may not be regular. Am I correct? @Leensharma @ Gabbar 0 0 replyShare shantanu kaushik commented Jul 18, 2016 reply Follow flag yes you are correct. A grammar that is not left linear or right linear may or may not be regular but if it is regular then there will be definitely a way to express it in left linear or right linear form. 0 0 replyShare Please log in or register to add a comment.
