Consider the following grammar G G: S → EF   E → a|∈F → abF|ac                  Which of the following is true about the grammar G?1. G is a LL(1) grammar2. G is a regular Grammar                                                                 1 only2 only1 and 2 bothNone of these

Prove that the given grammar is LL(1) grammarS  aBDhB  cCC  D  EFE  F  

Which of the following statement is true about regular grammar? Options : Regular grammar and context free grammar are the same entity All context free grammar are regular grammar but not vice versa All Regular grammar are context free but not vice versa All of above mentioned

Consider the Grammar, G, with the production rule: S-> aS | bS | ε Which of the following is generated by G? Options :{a n b m | m,n >=0}{w ∈ {a, b}*, w has equal number of a’s and b’s}{a, b}*{an |n >=0} ∪ {bn |n >=0} ∪ {anbn |n >=0}

Whether or not is the following grammar LL(1)? Why (State the reasons.)? If thegrammar is not LL(1), then convert it to an LL(1) grammar. Next, present thetransition table and show the parsing process by parsing the string “ababbbb”according to the prepared transition table.• S->aAbB | bS• A->AbB|λ• B->Bb|a

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:ans.S->aS| AB| A| B, D-> bS->aS| AB| A| BNone of the mentionedS->aS| AB| A| B| a, D-> b