Concept drill
epsilon-productions
GATE CSE & IT · Context-Free Languages · 1996-2008
2
PYQs
50%
keyed
0
elite explanations
2
years appeared
Study anchor
Hopcroft-Ullman / Dragon Book
Automata, languages, parsing, syntax-directed translation
Practice action
Start latest PYQPYQs in this concept
All concepts →2008 PYQ
Which of the following statements are true? $$1.$$ Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa $$2.$$ All ε-productions can be removed...
mediumanswer key
1996 PYQ
Let $$G$$ be a context free grammar where $$G = \left( {\left\{ {S,A,.B,C} \right\},\left\{ {a,b,d} \right\},P,S} \right)$$ with productions $$P$$ given below $$\eqalign{ & S \to A...
medium