edited by
5,373 views
0 votes
0 votes

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

  • $S\rightarrow L.L\mid L$
  • $L\rightarrow LB\mid B$
  • $B\rightarrow 0\mid 1$ 

Design an S-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$.

edited by

1 Answer

1 votes
1 votes
$S\rightarrow L.L$ $S.val=L_{1}.val+\frac{L_{2}.val}{2^{L_{2}.count}}$
$S\rightarrow L$ $S.val=L.val$
$L\rightarrow LB$

$L.val=2*L_{1}.val+B.val$

$L.count=L_{1}.count+B.count$

$L\rightarrow B$

$L.val=B.val$

$L.count=B.count$

$B\rightarrow 0$

$B.val=0$

$B.count=1$

$B\rightarrow 1$

$B.val=1$

$B.count=1$

 

Related questions

0 votes
0 votes
0 answers
3
admin asked Sep 6, 2019
1,770 views
For the SDD of Fig. $5.8$, give annotated parse trees for the following expressions:int a,b,c.float w,x,y,z.