The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .
A) CFL
B) CFG
C) GTG
D) None of the given
Correct Answer:
Verified
Q30: Which of the following are regular sets?
A)I
Q31: A minimum state deterministic finite automation accepting
Q32: Let P be a regular language and
Q33: Given a Non-deterministic Finite Automation (NFA) with
Q34: Which one of the following statement is
Q36: Type-1 Grammar is known as_
A)CFG
B)CSG
C)REGULAR
D)All
Q37: If G is "S ? a S/a",
Q38: "S ?a S", what is the type
Q39: A?abA a type _productions
A)Type 0
B)Type 1
C)Type 2
D)Type
Q40: The following CFG is in S ?
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