Consider the language containing those strings consisting of asingle a character followed by two or more xcharacters.
{axx,axxx,axxxx,axxxxx,…}
1. Draw a diagram of a DFA that recognizes this language.
2. Write a BNF grammar that generates this language.
3. Is your grammar from the previous step ambiguous? Justifyyour answer.
Expert Answer
An answer will be send to you shortly. . . . .