search
Log In
0 votes
259 views

Do the following productions mean the same

Bb->bb and B->b

My doubt is that will the first production be used only when we have b in the follow of B or it can be used in any case.

If it can be used in any case then will the first production be equal to second production.

in Theory of Computation
retagged by
259 views

1 Answer

1 vote
 
Best answer
Bb - > bb is context sensitive grammer and it can only be used when b is in follow of B i.e Bb
B -> b is context free grammer and it can be used anywhere you see B

selected by

Related questions

0 votes
0 answers
1
106 views
Consider the following CFG 'G' S--> aA/bSS/SS A--> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these
asked Oct 18, 2018 in Theory of Computation Sambhrant Maurya 106 views
1 vote
1 answer
2
303 views
Construct context-free grammars to accept the following languages. $\begin{align*} \large L = \left \{ 0^i1^j2^k \;\; | \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$
asked Mar 25, 2017 in Theory of Computation gabbar 303 views
2 votes
1 answer
3
195 views
... Please verify all grammars. third grammar In Linz book it is given as $\begin{align*} & S\rightarrow aSbSa|aaSb|bSaa|SS|a \\ \end{align*}$ ..better explanation if possible.??
asked Dec 8, 2016 in Theory of Computation dd 195 views
0 votes
0 answers
4
114 views
consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL?
asked Dec 24, 2018 in Theory of Computation Rahul_Rathod_ 114 views
...