Consider the following CFG which is not in CNF: S→ AbC A → аA | Съ В → аАС CaBA Create a PDA for the CNF version of the above grammar.

Consider the context free grammar (CFG) with the rules, S is the start variable • A and B are variables • 0 and 1 are terminals S - A|B|0 A - S1 B - SOS1 Show that this grammar is 'Ambiguous Grammar', For example: Provide an example of a string language that contains two different leftmost derivations Please demonstrate your work, especially the derivations.

Consider the following BNF grammar (G1) for simple assignment statements. Assign = Id "=" Expr. Id= "a" | "b" | "c". Expr = Expr"_ Expr. | Expr "/" Expr. Id. Give an unambiguous grammar G2 that is equivalent to G1. Consider the alphabet Σ = {a, b, c, %, &} and let G be the following grammar, where S is the start symbol. E → a E → b E→C S→T%S S→T T→ T&E T→ E a) Draw a parse tree for a%b&c. b) What is the associativity of the % operator? a) left b) right c) neither c) What is the associativity of the & operator? a) left b) right c) neither 1

Explain the abab string in the following ambiguous grammar: