Discrete Structure - Old Questions
13. Let G be the grammar with vocabulary V= {S, A, a, b}, set of terminals T ={a,b}, starting symbol S, and productions P ={S→aA, S→b, A→aa}. What is L(G), the language of this grammar?
4 marks
|
Asked in 2073