Assignment 2 1. Convert the BNF written below to EBNF A Grammar for a Small Language begin | ; svar> - ABC + svar> - | 2. Convert the BNF written below to EBNF An Ambiguous Grammar for Simple Assignment Statements - ABC + | * 1 ( ) | 3. 4. Convert the following EBNF to BNF: SA{bA} A + a[b] A Compute the weakest precondition for each of the following assignment statements: a =5* (b - 1) - 2 {a >0} b = c + 10)/4 {b>6} Compute the weakest precondition for each of the following sequences of assignment statements and their postconditions: a = 2*b+ 1; b = a -2 {b 5} 5