Question: Regular Expression to BNF grammar. My regular expression is aa(a)*x to produce {aax, aaax, aaaax....} Write a BNF grammar (not EBNF!) that generates this language
Regular Expression to BNF grammar.
My regular expression is aa(a)*x to produce {aax, aaax, aaaax....}
Write a BNF grammar (not EBNF!) that generates this language and then is the grammar ambiguous and how do I know that?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
