Simplify the given grammar:A-> a| aaA| abBcB-> abba| b (a) A-> a| aaA| ababbAc| abbc(b) A-> a| aaA| ababbAc| abbc, B-> abba|b(c) A-> a| aaA| abbc, B->abba(d) None of the mentionedThe question was asked in an online interview.My enquiry is from CFG-Eliminating Useless Symbols in division Properties of Context Free Languages of Automata Theory

Simplify the given grammar:A-> a| aaA| abBcB-> abba| b (a) A-> a| aaA|

1.	Simplify the given grammar:A-> a\| aaA\| abBcB-> abba\| b (a) A-> a\| aaA\| ababbAc\| abbc(b) A-> a\| aaA\| ababbAc\| abbc, B-> abba\|b(c) A-> a\| aaA\| abbc, B->abba(d) None of the mentionedThe question was asked in an online interview.My enquiry is from CFG-Eliminating Useless Symbols in division Properties of Context Free Languages of Automata Theory
Answer» Correct CHOICE is (a) A-> a\| aaA\| ababbAc\| abbc For explanation I would say: Using the SUBSTITUTION rules, we can simply ERADICATE what is useless and thus produce the SIMPLIFIED result i.e. A-> a\| aaA\| ababbAc\| abbc.

Discussion

No Comment Found

Related InterviewSolutions

A___________ is context free grammar with atmost one non terminal in the right handside of the production.(a) linear grammar(b) linear bounded grammar(c) regular grammar(d) none of the mentionedThe question was asked during an online interview.My question is based upon CFL- Closure Properties/Decision Properties in division Properties of Context Free Languages of Automata Theory
Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in ___________.(a) restricted form(b) parsed form(c) normal form(d) all of the mentionedThis question was addressed to me during an online interview.This intriguing question originated from Chomsky Normal Form topic in division Properties of Context Free Languages of Automata Theory
In which of the following, does the CNF conversion find its use?(a) CYK Algorithm(b) Bottom up parsing(c) Preprocessing step in some algorithms(d) All of the mentionedI have been asked this question by my school principal while I was bunking the class.Enquiry is from Chomsky Normal Form in division Properties of Context Free Languages of Automata Theory
Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.(a) n, 2n-1(b) 2n, n(c) n+1, 3n+6(d) 0, n+1The question was posed to me during an online interview.Asked question is from CFL- Closure Properties/Decision Properties topic in division Properties of Context Free Languages of Automata Theory
If L1 and L2 are context free languages, L1-L2 are context free:(a) always(b) sometimes(c) never(d) none of the mentionedThis question was posed to me in quiz.This intriguing question comes from CFL- Closure Properties/Decision Properties topic in portion Properties of Context Free Languages of Automata Theory
What is the pumping length of string of length x?(a) x+1(b) x(c) x-1(d) x2This question was addressed to me during an online interview.This interesting question is from Pumping Lemma for Context Free Language in division Properties of Context Free Languages of Automata Theory
The pumping lemma is often used to prove that a language is:(a) Context free(b) Not context free(c) Regular(d) None of the mentionedThis question was posed to me in homework.I want to ask this question from Pumping Lemma for Context Free Language in section Properties of Context Free Languages of Automata Theory
Which of the following does not have left recursions?(a) Chomsky Normal Form(b) Greibach Normal Form(c) Backus Naur Form(d) Allof the mentionedI have been asked this question in a national level competition.Enquiry is from Chomsky Normal Form in portion Properties of Context Free Languages of Automata Theory
The use of variable dependency graph is in:(a) Removal of useless variables(b) Removal of null productions(c) Removal of unit productions(d) None of the mentionedI have been asked this question in unit test.This key question is from Eliminating Epsilon Productions topic in section Properties of Context Free Languages of Automata Theory
Inorder to simplify a context free grammar, we can skip the following operation:(a) Removal of null production(b) Removal of useless symbols(c) Removal of unit productions(d) None of the mentionedI got this question in homework.This interesting question is from CFG-Eliminating Useless Symbols in chapter Properties of Context Free Languages of Automata Theory

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment