Question: 3. Consider the following BNF: A ::= 0 B | 0 MI OB M 0 ::= w | x | s | m ::=
3. Consider the following BNF: A ::= 0 B | 0 MI OB M 0 ::= "w" | "x" | "s" | "m" ::= "i" | "f" | "c" | "r" M ::= "o" | "t" | "p" | "a" | "h" B (a) How many nonterminal symbols are in the grammar? (b) How many terminal symbols are in the grammar? (c) Write two strings that are valid according to the BNF.
Step by Step Solution
3.37 Rating (156 Votes )
There are 3 Steps involved in it
Based on the BackusNaur Form BNF grammar provided in the image lets answer the questions one by one ... View full answer
Get step-by-step solutions from verified subject matter experts
