: [ S \to aSa \mid bSb \mid a \mid b \mid \varepsilon ]
: [ 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 ) cfg solved examples
[ S \to aA \mid bA \mid \varepsilon ] [ A \to aS \mid bS ] : [ S \to aSa \mid bSb \mid
So the sequence of rules: aSbb then aSb then ε. Good. So grammar works. Language : ( w \in a,b^* \mid w = w^R ) So grammar works
: [ S \to aSbS \mid bSaS \mid \varepsilon ]
: [ E \to E + T \mid T ] [ T \to T \times F \mid F ] [ F \to (E) \mid a \mid b ]