Programming Languages Homework:

1. Use recursion method to define grammar inductively, 2. Use semantic meanning for non-terminals method for the following language: strings have equal numbers of O and 1. For example your language will accept following strings 01, 0101, 010101, 000111, 001011, but will reject 010, 00011, 001, 11000, Also show that grammar you created is ambiguos or not by using parse tree approach 1. Use recursion method to define grammar inductively, 2. Use semantic meanning for non-terminals method for the following language: strings have equal numbers of O and 1. For example your language will accept following strings 01, 0101, 010101, 000111, 001011, but will reject 010, 00011, 001, 11000, Also show that grammar you created is ambiguos or not by using parse tree approach