MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
A grammar with more than one parse tree is called:
1.
A grammar with more than one parse tree is called:
A.
Unambiguous
B.
Ambiguous
C.
Regular
D.
None of the mentioned
Answer» C. Regular
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
__________ is the acyclic graphical representation of a grammar.
A grammar with more than one parse tree is called:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies