Question: Consider the following grammar in BNF notation: ::= 0 | 1 ::= 0 ::= 1 | 1 Which of the following sentences are in the
Consider the following grammar in BNF notation:
::= 0 | 1
::= 1 | 1
Which of the following sentences are in the language generated by this grammar? For those that are in the language, show a possible derivation. For the others, explain why they cannot be generated using the rules of the grammar.
a. 10101
b. 10110
c. 001010
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
