Question- Write an unambiguous grammar for the given languages.
Part 1- Palindromes over the alphabet {a,b}.
Part 2- Non-empty palindromes over the alphabet {a,b}.
Part 3- Strings that match the regular expression (a*b*).
Part 4- Strings that match the regular expression (a*b*) and have the same number of a's and b's.
Part 5- Strings that match the regular expression (a*b*) and have more a's than b's.
Part 6- Strings that match (xy*x) | (yx*x).
You have to prepare unambiguous grammar for the above languages. Please help! I am stuck on this question