The following BNF grammar defines the grammar of the scientific notation for non-negative floating point numbers.  -> | E -> | . -> | + | - -> | -> 0 | -> 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9   Show the right-most derivation for 3.14E3; show every step.

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

Considering the following BNF grammar answer the questions.   <s> ::= <a> <b> <a> ::= <a> # <c> | <a> @ <c> | <c> <c> ::= <d> $ <c> | <c> ^ <d> | <d> <b> ::= end | <a> ! <b> <d> ::= just   2a - What is the associativity of the @ operator? Why?.  2b - What is the associativity of the $ operator? Why? In one sentence explain how you determine the answer.  2c – Which one of # and ! operators has a higher precedence? Why? In one sentence explain how you determine the answer. 2d - Which of @ and ^ operators has a higher precedence? Why? In one sentence explain how you determine the answer.

Prove this grammar is Ambiguous <S> -> <A> <A> -> <A> + <A> | <id> <id> -> a | b | c

Describe in english what this grammar means <S> -> <A> <B> <C>  <A> -> a<A> | a <B> -> b<B> | b <C> -> c<C> | c