1. ## Writing Grammar Problems

I have a grammar problem that I just re-did and I'd like to hear your feed back on it:

Given the alphabet {a, b} write a grammar for the following language:

This will give only strings that start with a string of $a$'s and end with a string of $b$'s. There is no way to get, for example, $aba$