Question: A language that admits only ambiguous grammar:

Options

A : Inherent Ambiguous language

B : Inherent Unambiguous language

C : Context free language

D : Context Sensitive language

Click to view Correct Answer

Previous || Next

Ambiguous Grammar more questions

What among the following is/are the best example of semantic....

What is Antonymy relation?

What is Synonymy relation?

Which of the following is not the style of inference?

A binary string is divisible by 4 if and only....

CFGs can be parsed in polynomial time using__

Given Language: {x | it is divisible by 3}^ The....

If L1 and L2 are regular languages, which among the....

In context to ambiguity, the number of times the following....

Let L be a language whose FA consist of 5....

Ambiguous Grammar more Online Exam Quiz

Natural Language Processing - 2

Neural Networks - 2

Robotics - 2

Rule Based System - 2

Semantic Net - 2

Applications - Parsers

Applications of DFA

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols