For the grammar E -> E + E | E * E | a, select all leftmost derivations for the string a+a*a1 pointE => E + E => E + E * E => E + E * a => E + a * a => a + a * aE => E + E => E + E * E => a + E * E => a + a * E => a + a * aE => E * E => E + E * E => E + E * a => E + a * a => a + a * aE => E * E => E + E * E => a + E * E => a + a * E => a + a * a

Given the grammar E -> a + E | a. Select the properties satisfied by the string "a+a+a".1 pointIt is in the languageIt is not in the languageIt has a unique leftmost derivationIt is derived by two distinct leftmost derivationsThe parse tree is left-associativeThe parse tree is right-associative

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:

For alphabet {i, t, e, a}. Consider the if-then-else grammar S -> a | iatS | iatSeS. Select all strings derived ambiguously by this grammar.1 pointaiataiatiataeaiateaiatiataeaeaiataeiataea

Consider the following derivation    S->aB    A->aaBB    B->aaBb    C->aabSb    D->Aab   E->aabbab*A leftmost GrammerA Right most GrammerLinear grammerCombination of above three

Which representation of grammar corresponds to the a(aUb)*b expression?a)(1) S →→ bMa  (2) M →→  eb  (3) M →→  abM  (4) M →→  baMb)(1) S →→  aMb(2) M →→  e(3) M →→  aMb(4) M →→  bMac)(1) S →→ aMb  (2) M →→  e  (3) M →→  aM  (4) M →→  bMd)(1) S →→ baMab  (2) M →→  ea  (3) M →→  abM  (4) M →→  baMe)(1) S →→  aMb(2) M →→  Mab(3) M →→  aM(4) M →→  bM