Assignment 1 1. Using the grammar written below, show a parse tree and a leftmost derivation for A Grammar for Simple Assignment Statements - sid> ABC sid>+ | * 1 ( ) I sids each of the following statements: A=A* (B+C * A)) B-C* (A+B) + A A=A* (B+ (C)) 2. Using the grammar written below, show a parse tree and a leftmost derivation for An Unambiguous Grammar for Expressions - cexpr> ABC + | | ( cexpr> ) | each of the following statements: A = (A+B) A=B+C+ A+B A=B* (A + B)) + C 3. Consider the following grammar: a b - bb a a Which of the following sentences are in the language generated by this grammar? Show a parse tree for these sentences. baab bbbab bbaaaaa bbaab bababa bbaabbaa 4. Consider the following grammar: a c | b C d| Which of the following sentences are in the language generated by this grammar? Show a parse tree for these sentences. abcd acccbd acccbcc acd accc abbcd