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

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

Q: 08 of 15Choose the right set of terminals from the given production rules of grammar as:S->(S) | aA | epsilonA-> A+B | aB-> B *C | bC -> cOptions :T= ( ,a,b,),+,*T= ( ,a,b,),+,*,cT= a,b,cNone of the above mentioned

A grammar that produces more than one parse tree for some sentence iscalled ____ a) Ambiguous b) Unambiguous c) Regular d) None of the mentioned

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:ans.S->aS| AB| A| B, D-> bNone of the mentionedS->aS| AB| A| B| a, D-> bS->aS| AB| A| B Previous Marked for Review Next