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

I need help Designing a Java compiler for a Simple Programming Language involves creating a software system that can translate code written in the Simple Programming Language (SPL) into machine code that can be executed on a computer. The compiler needs the follow  Defining the syntax of the SPL, including its basic data types, control structures, and functions. Implementing a lexical analyzer to tokenize the SPL source code into a stream of tokens. Implementing a parser to construct an abstract syntax tree (AST) from the token stream that represents the structure of the program. Implementing a semantic analyzer to check for type errors, undefined variables, and other semantic errors in the program. Generating intermediate code from the AST, such as three-address code or bytecode. Optimizing the intermediate code to improve the efficiency of the generated machine code. Generating the final machine code, such as x86 assembly language, that can be executed on a computer. I…

Please written by computer source

Describe, in English, the language defined by the following grammar:<S> → <A> <B> <C><A> → a <A> | a<B> → b <B> | b<C> → e