Hello, I am having issues translating BNF/EBNF grammar into a Antlr4 Grammar file with proper Parser/Lexer rules.

Below are screenshots of the grammar and a small guide of Antlr4 syntax. I am hoping to use this grammar file to generate a parser and lexer in java.

Grammar specification for Antlr below:

I am trying to create a correct grammar .g4 file with the corresponding BNF/EBNF I linked. Thanks in advance for any help or tips!

2 Grammar The grammer specifies the syntax of regular expressions. The grammar has three unary operators, *4. and ?' These are all quantifiers of equal precedence. The precedence of all operators, from highest to lowest, is as follows: parentheses, quantifiers, character sequence (or concatenation), and alternation. The BNF given below specifies the precedence hierarchy. The BNF grammar specifies the structure of concrete syntax trees, but with one exception. We allow operators such as "" to take an arbitrary number of arguments. Therefore the arguments will all be at the same level in the hierarchy. BNF 2. 3. ::- "I* ::- I ::- *" *+" elementary-re> "?" 4. :-" ")" "[ "]*I "[ " 5. :- any NON-METACHAR I any METACHAR except "\* 6. set-items > "" METACHAR :- The EBNF is given below and is translated from the BNF. The EBNF is used to generate syntax diagrams that determine the flow of control of the parser EBNE 1. 2. 3. 4. :-" ")" ::- { "l" :- } -elementary-re> 2"] "[ "]*I "[ set-items > "j" S. "" METACHAR - The terminal constituents NON-METACHAR and METACHAR represent token types. This grammar requires two-step look ahead in order to process the last clause in line 4. Because of this, we need to be able to unread a character. Java Grammer specification for the antir tool Grammar for expressions written for antlr4: www.antrl.org Put the following on file "Expr.g4" The antlr tool generates a scanner and parser, written in Java, to match the specifications of this grammar The parser will produce as output some form of semantic representation, such as abstract syntax trees (ASTS) grammar Expr stat: expr expr exprexpr // precedence 4 // precedence 3 // primary (precedence 2) // primary (precedence 1) | exprexpr INT ID IDa--z INT[e-91+ ws tn - skip; In the above, notice how terminal symbols are specified as regular expressions while non-terminals are specified using a form of BNF