This grammar generates binary numbers with a "decimal" point: S-* L . L | L L-+LB\B B -> 0 | 1 Design an L-attributed SDD to compute S.val, the decimal-number value of an input string. For example,...

This grammar generates binary numbers with a "decimal" point:


S-* L . L | L L-+LB\B B -> 0 | 1


Design an L-attributed SDD to compute S.val, the decimal-number value of an input string. For example, the translation of string 101.101 should be the decimal number 5.625. Hint: use an inherited attribute L.side that tells which side of the decimal point a bit is on.