Question: 4. Write a grammar G for the language L consisiting of strings of 0's and 1 's that are the binary representation of odd integers

4. Write a grammar G for the language L consisiting of strings of 0's and 1 's that are the binary representation of odd integers greater that 4 . For example 11/L,101L,110/L. Draw parse trees for the strings 1011 and 1101
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
