1 votes 1 votes Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0A A->0 | SS rahul sharma 5 asked Aug 5, 2017 rahul sharma 5 648 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply rahul sharma 5 commented Aug 5, 2017 reply Follow Share Is it odd number of zeros? 0 votes 0 votes joshi_nitish commented Aug 5, 2017 reply Follow Share it is generating L={ $0^{2+3i}$ | i>=0} 1 votes 1 votes rahul sharma 5 commented Aug 5, 2017 reply Follow Share Can you explain ? 0 votes 0 votes joshi_nitish commented Aug 5, 2017 reply Follow Share find 4 or 5 starting strings, you will find some pattern, analyze it and get answer. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes S->0A A->0 | SS Language generated by above grammar is L={ 03n+2 | n>=0} Raushank2 answered Aug 5, 2017 Raushank2 comment Share Follow See 1 comment See all 1 1 comment reply rahul sharma 5 commented Aug 5, 2017 reply Follow Share Can you please explain how did you solve this? 0 votes 0 votes Please log in or register to add a comment.