Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Let be a context free grammar where the rule ... Start Learning for Free
Let    be a context free grammar where the rule set R is    Which of the following statements is true?
  • a)
    G is not ambiguous
  • b)
    There exis x,y ∈ L(G) such that xy ∉ L(G)
  • c)
    There is a deterministic pushdown automaton that accepts L(G)
  • d)
    We can find a deterministic finite state automaton that accepts L(G)
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
Let be a context free grammar where the rule set R is Which of the fol...
It will be easy to analyze the problem if we replace terminal a and b by ( and ) respectively. 
S →(S) | SS | ε
L(G) = balanced parentheses [each left parenthesis has a matching right parenthesis and are well nested ]
example () , ()(), (()), (()()()).
String () can be derived by above three way each having different derivation tree.
So G is Ambiguous
b) Concatenation of two balance parenthesis will be balanced also . eq. x = (()) y= () xy= (())().
c) We can design Deterministic PDA for L. put left parenthesis (only) in stack and pop with right parenthesis.
d) We cannot design DFA for L because we need a stack to match left parenthesis with right parenthesis.
only option C is true.
View all questions of this test
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer?
Question Description
Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer?.
Solutions for Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Let be a context free grammar where the rule set R is Which of the following statements is true?a)G is not ambiguousb)There exis x,y∈ L(G)such that xy∉ L(G)c)There is a deterministic pushdown automaton that accepts L(G)d)We can find a deterministic finite state automaton that accepts L(G)Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev