2. A production (grammar rule) in BNF has the form: where A is a nonterminal, Xi(i = 1, . .. , m.1,.> 0) are grammar symbols. Write a context-free grammar for the language of productions in BNF. You can assume that cach nonterminal is a single uppercase letter and cach terminal is a single lowercase letter. Yoiu 3. Implement a parser using lex and yacc for the language of productions given in question 2, For cach production, your parscr prints a mcssage like "a BNF production has becn recognized." N() sellall.lc: :Li(ll s required 1. Given the following productions of a context-frcc grammar (1) A - x B y (2) B CD (3) C -+ z (4) D wB (5) D where A, B, C are non-terminals and w: x. y. z are terminals. Calculate the PREDICT sct of cach production in the grammar. Show your work 5. Given the following productions of a context-free grammar: (1) D + v A T b (2) A B:c (3) B iK (5) K- (6) T where (b, c, i, v, ,, :, ;}are terminals, [D, A, T, B, K are non-terminals, and D is the go symbol. The parse table is given below: Irace the LL(I) parsing process for the token sequen Your trae should be in the format similar to the one given in the lecture slides, like this remaining input stackproduction used action