Cfg Solved Examples | 100% FAST |

Check: ( S \Rightarrow aA \Rightarrow abS \Rightarrow ab\varepsilon = ab ) (length 2). Works. Language : All strings of ( and ) that are balanced.

So to get m=3,n=2: S ⇒ aSbb (add a, b,b) Now S ⇒ aSb (add a, b) Total: a(aSb)bb ⇒ a(aεb)bb = a a b b b = 2 a, 3 b. Works. cfg solved examples

Better approach — known correct grammar: [ S \to aSb \mid aSbb \mid \varepsilon ] For m=3, n=2: S → aSbb → a(aSb)bb → aa(ε)bbbb? No — that’s 4 b’s. So maybe n=2, m=3 not possible? Actually it is: ( a^2 b^3 ) = a a b b b. Let’s test: Check: ( S \Rightarrow aA \Rightarrow abS \Rightarrow

: [ S \Rightarrow aSa \Rightarrow aba ] 7. Example 6 – ( a^i b^j c^k ) with i+j = k Language : ( a^i b^j c^i+j \mid i,j \ge 0 ) So to get m=3,n=2: S ⇒ aSbb (add

Better: [ S \to aaS \mid abS \mid baS \mid bbS \mid \varepsilon ] But that forces pairs. Actually, simpler:

S → aSbb → a(aSbb)bb → aa(ε)bbbb → aabbbb (wrong). So that’s 4 b’s, not 3.

: [ S \Rightarrow SS \Rightarrow (S)S \Rightarrow ((S))S \Rightarrow (())S \Rightarrow (())(S) \Rightarrow (())() ] 4. Example 3 – ( a^n b^n ) (equal number of a’s and b’s) Language : ( a^n b^n \mid n \ge 0 )