Consider the following statements about the context free grammarG = {S - >SS, S - >ab, S - >ba, S - ?}I. G is ambiguousII. G produces all strings with equal number of a's and b'sIII. G can be accepted by a deterministic PDA.Which combination below expresses all the true statements about G?
A) 1 only
B) 1 and 3
C) 2 and 3
D) 1,2 and 3
Correct Answer:
Verified
Q12: The language L = { 0^i 2
Q13: A minimum state deterministic finite automation accepting
Q14: If s is a string over (0
Q15: For S € (0+1)* let d(s)denote the
Q16: Let SHAM3 be the problem of finding
Q18: Let L1 be a regular language, L2
Q19: Consider the regular language L =(111+11111)*. The
Q20: Consider the languages: GATE[2005]L1 = {wwR w
Q21: Consider the languages: L1 ={a^n b^n c^m
Q22: Let L1 be a recursive language, and
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents