Reputation: 8
I have to construct a certain grammar for a given language where the language consists of strings of 0s and 1s that are the binary repr. of odd numbers greater that 6. I also have to create a parse tree for something like 10001 which is 17. How do I go about this problem?
Upvotes: 1
Views: 85