Convert the following Context Free Grammar into Chomsky Normal Form S -> ASB A -> aAS | a | ɛ B -> A | bb | ɛ

1. Given the following Context Free Grammar, show the derivation for the following strings. -> = ; -> -> -> ; -> x -> y -> z -> + -> * -> - -> 1 | 2 | 3 | 4 |5 | 6 | 7 | 8 | 9 | 0 String to be derived: x = x +y 2 - z 2. Show a left-derivation for the following grammar based on the for the string aaaab 1. S→ AB 2. А> ааA 4. В > ВЬ 3. А >1 5. В >1 3. Consider CFG G = ({S}, {a, b, c}, R, S) where R = {S > Sbbs | SacS | a}. Show how the %3D string abbaacabba 4. What cause ambiguity?

Context Free Grammar State whether it is ambiguous or unambiguous. If it is ambiguous give an equivalent unambiguous grammar. If it is unambiguous, state all the precedences and associativities enforced by the grammar. 1. <S > -> <S > - <T > | <T > - <S > | <T ><T > -> N + <T > | N | ( <S >)

5. Construct npda that accept the following context-free grammars: (a)     S -> aAB | bBB     A -> aA | bB | b     B -> b   (b)     S -> ABb | a | b     A -> aaA | Ba     B -> bb

Problem 4 For each of the following grammars state whether it is ambiguous or unambiguous. If it is ambiguous give an equivalent unambiguous grammar. If it is unambiguous, state all the precedences and associativities enforced by the grammar. Assume Id generates identifiers. a) E = E + F | F F := F + F | Id | (E)

refer to the grammar S -> aSa | aXa X ->aXa | bYb Y -> bYb | empty where S is the start symbol, non-terminals = {S, X, Y}, terminals = {a, b} Construct a NPDA for the language generated by this grammar.

4) Please look at the attached image.