Consider the following sequence of a generic program written in an unknown programming language:

case (j) of 1:

a,b,c: ;

2..8: ;

12,abc: ;

default

i. (20 marks) Construct a context-free grammar (in BNF/EBNF format) such that the above sequence of program can be generated as a case statement.

ii. (20 marks) Construct corresponding syntax graphs such that the above sequence of program can be accepted as a case statement.

(h) (35 marks maximum Consider the following sequence of a generic program written in an unknown programming language: case (j) of 1: ; a,b,c: ; 2..8: ; 12, abc: ; default ; i. (20 marks) Construct a context-free grammar in BNF/EBNF format) such that the above sequence of program can be generated as a case statement. ii. (20 marks) Construct corresponding syntax graphs such that the above sequence of program can be accepted as a case statement