Question: A grammar with more than one parse tree is called:
Options
A : Unambiguous
B : Ambiguous
C : Regular
D : None of the mentioned
Previous ||
Automata Theory Construction Yield Parse Tree more questions
What type of memory is suitable for medium volume production?
Which of the following is an open-source extension of the....
Electronic Business using eXtensible Markup Language standard is maintained by....
Which of these following is used to match the outlet....
What is a relationship called when it is maintained between....
Which of the following operators has the highest precedence?
Which of the following operator has left to right associativity?
Which of the following is not done by cyber criminals?
The right and left-hand webs should be identified based on....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Campus Interviews
Automata Theory Cfl Closure Properties
Automata Theory Cfl Substitution Theorem
Automata Theory Chomsky Normal Form
Automata Theory Context Free Grammar Derivations Definitions
Automata Theory Converting Regular Expressions Automata
Automata Theory Deterministic Pda