71.  A shift reduce parser suffers from 
a.  shift reduce conflict only 
b.  reduce reduce conflict only 
c.  both shift reduce conflict and reduce reduce conflict 
d.  shift handle and reduce handle conflicts 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (c).both shift reduce conflict and reduce reduce conflict

72.  The context free grammar for language L = {a^nb^mc^k  k = n  m, n≥0,m≥0,k≥0} is 
a.  S→S1S3, S1→aS1c S2λ, S2→aS2bλ, S3→aS3bS4 λ, S4→bS4cλ 
b.  S→S1S3, S1→aS1S2c λ, S2→aS2bλ, S3→aS3bS4 λ, S4→bS4cλ 
c.  S→S1S2, S1→aS1S2cλ, S2→aS2bλ, S3→aS3bS4 λ, S4→bS4cλ 
d.  S→S1S3, S1→aS1c S2λ, S2→aS2bλ, S3→aS3bS4 λ, S4→bS4cλ 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (d).S→S1S3, S1→aS1c S2λ, S2→aS2bλ, S3→aS3bS4 λ, S4→bS4cλ

73.  The number of states in a minimal deterministic finite automaton corresponding to the language L = { an  n≥4 } is 
a.  3 
b.  4 
c.  5 
d.  6 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (c).5

74.  Regular expression for the language L = { w ∈ {0, 1}*  w has no pair of consecutive zeros} is 
a.  (1 + 010)* 
b.  (01 + 10)* 
c.  (1 + 010)* (0 + λ) 
d.  (1 + 01)* (0 + λ) 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (d).(1 + 01)* (0 + λ)

75.  Consider the following two languages:
L1 = {a^n b^l a^k  n + l +k>5 } L2 = {a^n b^l a^k n>5, l >3, k≤ l } Which of the following is true? 
a.  L1 is regular language and L2 is not regular language 
b.  Both L1 and L2 are regular languages 
c.  Both L1 and L2 are not regular languages 
d.  L1 is not regular language and L2 is regular language 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (a).L1 is regular language and L2 is not regular language

76.  LL grammar for the language L = {a^n b^m c^n+m  m≥0, n≥0} is 
a.  S → aSc  S1 ; S1 → bS1c  λ 
b.  S → aSc  S1 λ ; S1 → bS1c 
c.  S → aSc  S1 λ ; S1 → bS1c λ 
d.  S → aSc  λ ; S1 → bS1c λ 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (c).S → aSc  S1 λ ; S1 → bS1c λ

77.  Assume the statements S1 and S2 given as:
S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true? 
a.  S1 is correct and S2 is not correct 
b.  Both S1 and S2 are correct 
c.  Both S1 and S2 are not correct 
d.  S1 is not correct and S2 is correct 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (a).S1 is correct and S2 is not correct

78.  Assume, L is regular language. Let statements S1 and S2 be defined as :
S1 : SQRT(L) = { x for some y with y = x^2, xy ∈L} S2 : LOG(L) = { x for some y with y = 2^x, xy ∈ L} Which of the following is true ? 
a.  S1 is correct and S2 is not correct 
b.  Both S1 and S2 are correct 
c.  Both S1 and S2 are not correct 
d.  S1 is not correct and S2 is correct 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (b).Both S1 and S2 are correct

79.  A regular grammar for the language L = {a^nb^m  n is even and m is even}is given by 
a.  S→aSb  S1; S1 → bS1a  λ 
b.  S→aaS  S1; S1 → bSb  λ 
c.  S→aSb  S1; S1 → S1ab  λ 
d.  S→aaS  S1; S1 → bbS1  λ 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (d).S→aaS  S1; S1 → bbS1  λ

80.  Given the following productions of a grammar :
S→ aA aBB; A→aaA λ ; B→ bB bbC; C→ B Which of the following is true ? 
a.  The language corresponding to the given grammar is a set of even number of a’s. 
b.  The language corresponding to the given grammar is a set of odd number of a’s. 
c.  The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s. 
d.  The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s. 
View Answer Report Discuss Too Difficult! Search Google 
Answer: (b).The language corresponding to the given grammar is a set of odd number of a’s.
