3. Whether or not is the following grammar LL(1)? Why (State the reasons.)? If the grammar is not LL(1), then convert it to an LL(1) grammar. Next, present the transition table and show the parsing...

I want a solution from a professor in software engineeringaAbB | bS A->AbB|A B->Bb|a "/>
Extracted text: 3. Whether or not is the following grammar LL(1)? Why (State the reasons.)? If the grammar is not LL(1), then convert it to an LL(1) grammar. Next, present the transition table and show the parsing process by parsing the string "ababbbb" according to the prepared transition table. S->aAbB | bS A->AbB|A B->Bb|a