So the sequence of rules: aSbb then aSb then ε. Good. So grammar works. Language : ( w \in a,b^* \mid w = w^R )
: [ S \to aSa \mid bSb \mid a \mid b \mid \varepsilon ]
: [ S \Rightarrow aSb \Rightarrow aaSbb \Rightarrow aaaSbbb \Rightarrow aaabbb ] 5. Example 4 – ( a^n b^m ) with ( n \le m \le 2n ) Language : ( a^n b^m \mid n \ge 0, m \ge n, m \le 2n )
So the sequence of rules: aSbb then aSb then ε. Good. So grammar works. Language : ( w \in a,b^* \mid w = w^R )
: [ S \to aSa \mid bSb \mid a \mid b \mid \varepsilon ] cfg solved examples
: [ S \Rightarrow aSb \Rightarrow aaSbb \Rightarrow aaaSbbb \Rightarrow aaabbb ] 5. Example 4 – ( a^n b^m ) with ( n \le m \le 2n ) Language : ( a^n b^m \mid n \ge 0, m \ge n, m \le 2n ) So the sequence of rules: aSbb then aSb then ε