Question: Consider the following BNF grammar: A -> I = E E -> P O P | P O -> + | - | * |
Consider the following BNF grammar:
A -> I = E E -> P O P | P O -> + | - | * | / | ** P -> I | L | UI | UL | (E) U -> + | - | ! I -> C | CI C -> a | b | ... | y | z L -> D | DL D -> 0 | 1 | ... | 8 | 9
Are the strings "a=b++c" and "a=(((b)))" in the language provided , and if/if not, why
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
