Ambiguous Grammar Online Exam Quiz

Ambiguous Grammar GK Quiz. Question and Answers related to Ambiguous Grammar. MCQ (Multiple Choice Questions with answers about Ambiguous Grammar

A binary string is divisible by 4 if and only if it ends with:


A : 100

B : 1000

C : 1100

D : 11

View Answer

A language that admits only ambiguous grammar:


A : Inherent Ambiguous language

B : Inherent Unambiguous language

C : Context free language

D : Context Sensitive language

View Answer

CFGs can be parsed in polynomial time using__


A : LR parser

B : CYK algorithm

C : SLR parser

D : None of the mentioned

View Answer

Given Language: {x | it is divisible by 3}^ The total number of final states to be assumed in order to pass the number constituting {0, 1} is


A : 0

B : 1

C : 2

D : 3

View Answer

If L1 and L2 are regular languages, which among the following is an exception?


A : L1 U L2

B : L1 ? L2

C : L1 ? L2

D : All of the mentioned

View Answer

In context to ambiguity, the number of times the following programming statement can be interpreted as:^ Statement: if R then if T then P else V


A : 2

B : 3

C : 4

D : 1

View Answer

Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.


A : 16

B : 11

C : 5

D : 6

View Answer

Predict the analogous operation for the given language:^ A: {[p, q] | p ? A1, q does not belong to A2}


A : A1-A2

B : A2-A1

C : A1.A2

D : A1+A2

View Answer

State true or false:^ Statement: R->R|T T->? is an ambiguous grammar




C : -

D : -

View Answer

Which of the following is an example of inherent ambiguous language?


A : {an|n>1}

B : {anbncmdm| n,m > 0}

C : {0n1n|n>0}

D : None of the mentioned

View Answer

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