Grammar that produce more than one Parse tree for same sentence is:
A) Ambiguous
B) Unambiguous
C) Complementation
D) Concatenation
Correct Answer:
Verified
Q4: The following CFG is in S ?
Q5: Which of the following statements is wrong?
A)The
Q6: Context free grammar is not closed under
A)Product
Q7: Let the class of language accepted by
Q8: Which of the following statement is wrong?
A)Any
Q10: The language accepted by a Push down
Q11: The PDA is called non-deterministic PDA when
Q12: Let L be a language defined over
Q13: All NonNull words of the CFL can
Q14: Let L={w (0 + 1)* w has
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