Which of the following is FALSE?(A) The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.(B) SLR is powerful than LALR.(C) An LL(1) parser is a top-down parser.(D) YACC tool is an LALR(1) parser generator.

Which of the following is FALSE?(A) The grammar S → a Sb |bSa|SS|∈

1.	Which of the following is FALSE?(A) The grammar S → a Sb \|bSa\|SS\|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.(B) SLR is powerful than LALR.(C) An LL(1) parser is a top-down parser.(D) YACC tool is an LALR(1) parser generator.
Answer»

Discussion

No Comment Found

Related InterviewSolutions

In _______, the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other.(A) Loop unrolling(B) Strength reduction(C) Loop concatenation(D) Loop jamming
The content of the accumulator after the execution of the following 8085 assembly language program, is:MVI A, 42HMVI B, 05HUGC: ADD BDCR BJNZ UGCADI 25HHLT(A) 82H(B) 78H(C) 76H(D) 47H
There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. We pick a card at random and observe only one side.What is the probability that the opposite side is the same colour as the one side we observed?(A) 3/4(B) 2/3(C) 1/2(D) 1/3
Given i = 0, j = 1, k = –1x = 0.5, y = 0.0What is the output of the following expression in C language ?x * y < i + j || k(A) -1(B) 0(C) 1(D) 2
The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ______ and _______ respectively.(A) 14, 14(B) 16, 14(C) 16, 4(D) 14, 4
In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be _____ on the rising edge of the clock.(A) No change(B) Set(C) Reset(D) Toggle
Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct ?(A) R1 ∩ R2 is reflexive and R1 ∪ R2 is irreflexive.(B) R1 ∩ R2 is irreflexive and R1 ∪ R2 is reflexive.(C) Both R1 ∩ R2 and R1 ∪ R2 are reflexive.(D) Both R1 ∩ R2 and R1 ∪ R2 are irreflexive.
The IEEE-754 double-precision format to represent floating point numbers, has a length of _____ bits.(A) 16(B) 32(C) 48(D) 64
Simplified Boolean equation for the following truth table is:(A) F = yz` + y`z(B) F = xy` + x`y(C) F = x`z + xz`(D) F = x`z + xz` + xyz
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?(A) 2(B) 4(C) 5(D) 6

Which of the following is FALSE?(A) The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.(B) SLR is powerful than LALR.(C) An LL(1) parser is a top-down parser.(D) YACC tool is an LALR(1) parser generator.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment