Design an attribute grammar recognizing the language consisting of binary strings containing the same number of O's and 1's. Explain your construction. Hint: Modify the attribute grammar of problem below Basic results from automata theory tell us that the language L anbnc"-6, abc, aabbcc, aaabbbccc, is not context free. It can be captured, however, using an attribute grammar. Give an underlying CFG and a set of attribute rules that associates a Boolean attribute ok with the root R of each parse tree, such that R.ok = true if and only if the string corresponding to the fringe of the tree is in L. Answer: GAs Bs C.s Asia As2 D G.ok :(As.val Bs.val Cs.val) Asi .Val := As2.Val + 1 As.val:0 D Bs.val:0 Cs.val0 D Bsi.val: Bs2.val 1 Bs D Csi.val: Cs2.val 1