Posted: January 7th, 2022
Consider the following BNF:
(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.
(d) For each of your two strings, give two valid mutants of the
string.
(e) For each of your two strings, give two invalid mutants of the
string.
Place an order in 3 easy steps. Takes less than 5 mins.