> 
> Given the grammar  
> 
>  $s \to aSb \mid bSb \mid a \mid b$;  
> 
>  what is the language generated by the grammar over the alphabet $\{a,b\}$?
> 
> 
> 

When I was solving this question I was a bit confused 
about the language generated by this grammar. Would be set of all palindromes?
Or would the language generated by the above grammar be that of all odd length palindromes?

Is it possible that a palindrome generated by above grammar be of odd length only as there is no rule for $S \to \varepsilon$?