0 votes 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 asked Jul 15, 2016 sh!va 942 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 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 See all 7 7 Comments reply Show 4 previous comments Devwritt commented Jul 16, 2016 reply Follow Share we can write regular expression for regular language thats why regular language please check 0 votes 0 votes sh!va commented Jul 16, 2016 reply Follow Share 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 votes 0 votes shantanu kaushik commented Jul 18, 2016 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.