Question: Design an attribute grammar recognizing the language consisting of binary strings containing the same number of 0s and 1s. Explain your construction. Hint: Modify the
Design an attribute grammar recognizing the language consisting of binary strings containing the same number of 0s and 1s. Explain your construction.
Hint: Modify the attribute grammar of problem below

Basic results from automata theory tell us that the language L- a"b"c"- e, 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 IL. Answer: GAs Bs Cs D G.ok(As.val Bs.val Cs.val) D As1.val: As2.val 1 D As.val:-0 D Bs1.val:Bs2.val 1 Bs.val0 D Cs1.val:- Cs2.val 1 Cs.val:0 Cs > Basic results from automata theory tell us that the language L- a"b"c"- e, 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 IL. Answer: GAs Bs Cs D G.ok(As.val Bs.val Cs.val) D As1.val: As2.val 1 D As.val:-0 D Bs1.val:Bs2.val 1 Bs.val0 D Cs1.val:- Cs2.val 1 Cs.val:0 Cs >
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
