1. Give an EBNF grammar for the language "The set of all strings consists of zero or more As" with a semicolon after each one.

2. Give a BNF grammar for the language "The set of all strings consists of zero or more As" with a semicolon after each one.

3. Start with the grammar G6, repeated here: G6: ::= + | ::= * | ::= () | a | b | c

add right-associative operator = at lower precedence than any of the other operators.

Please explain your answer, this is the second time I post these questions and the person did it wrong the first time. So please don't copy and paste his answers for this post.