Q1) 1. Construct CFG for given rules of language. 2. Remove ambiguity if present. 3. Remove left recursion if required 4. Apply left factoring if required. 5. Construct LL(1) parse table after finding first and follows.

Requirements of xyz language: 1- Identifiers - start with letter, followed by letter or digits 2- Keywords int, print, get,if, while 3- int-literals - start with non-zero digit 07 not a int literal 7 is intliteral 4- operators =,-,*,/,<,<= 5- Punctuations ; { } () , 6- delimiters (ignored) Sample Program1 {int a23; a=25 print a } Sample program 2 {int a; int b; get a c= a+b; print c }