Question: Construct a non-ambiguous context free grammar generating the language consisting of all strings over the alphabet ? = (0,1,2), with the number of 1s divisible

Construct a non-ambiguous context free grammar generating the language consisting of all strings over the alphabet ? = (0,1,2), with the number of 1s divisible by 3, i.e., 0, 3, 6, 9, 12, 15, .... Provide a justification of correctness of your construction. - >
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
