Bissoy.com
Doctors Medicines MCQs Q&A

Consider the following grammar G S → F | H F → p | c H → d | c Where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all string that are generated using grammar G

Consider the following grammar G S → F | H F → p | c H → d | c Where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all string that are generated using grammar G Correct Answer Neither S1 nor S2

Concept:

First, check the grammar is ambiguous or not. If a grammar is ambiguous then it cannot be LL(1) and LR(1).

Explanation:

Given grammar is: S → F | H

F → p | c

H → d | c

First derivation for “c”:

S → F → c

Second derivation for “c”:

S → H → c

Two parse tree exists for single string and hence given grammar is ambiguous. It is neither LL(1) nor LR(1).

Related Questions

Consider the following grammar G: P → Q + R | Q – R | Q | R Q → q | r R → r | s where P, Q, and R are non-terminal symbols, and q, r, and s are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar G
Given below are three statements followed by two conclusions । and II. You have to consider the statements to be true even if they seem to be at variance from commonly known facts. Decide which of the conclusions follow from the statements. Statements: 1. No guitar is a violin. 2. All violins are strings 3. No string is metal. Conclusion: I. No string being violin is a possibility. II. Some guitars are not strings.
In the question two statements are given, followed by two conclusions, I and II. You have to consider the statements to be true even if it seems to beat variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All threads are strings. Statement II: All fibres are threads. Conclusion I: All strings are fibres. Conclusion II: All fibres are strings.
In the question two statements are given, followed by two conclusions, I and II. You have to consider the statements to be true even if it seems to beat variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All threads are strings Statement II: All fibres are threads Conclusion I: All strings are fibres Conclusion II: All fibres are strings
Consider the alphabet Σ = {0, 1}, the null/empty string ? and the sets of strings X0, X1, and X2 generated by the corresponding non - terminals of a regular grammar. X0, X1, and X2 are related as follows. X0 = 1 X1 X1 = 0 X1 + 1 X2 X2 = 0 X1 + {?} Which one of the following choices precisely represents the strings in X0?
Consider the following statements. S1 : Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1). S2 : For any context-free grammar, there is a parser that takes at most O(n3) time to parse a string of length n. Which one of the following option is correct?
You install Terminal Services on a Windows 2000 domain controller. You install Terminal Services Client on users' client computers. Users report that when they try to connect to the Terminal server, they receive the following error message: "The local policy of this system does not allow you to logon interactively." When you attempt to log on to the Terminal server as an administrator from a user's computer, you log on successfully. You want users to be able to log on to the Terminal server. What should you do?
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision problems are undecidable? I. Given a regular expression R and a string w, is w ∈ L(R)? II. Given a context-free grammar G, is L(G) = ϕ? III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑? IV. Given a Turing machine M and a string w, is w ∈ L(M)?  
How many objects will be created? String a = new String("Examveda"); String b = new String("Examveda"); String c = "Examveda"; String d = "Examveda";
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?