• closed by
2,318 views
2 2 votes
closed with the note: https://gateoverflow.in//1738/gate1998_23#viewbutton

Let synthesized attribute val give the value of the binary number generated by S in the following grammar. For example, on input 101.101, S.val = 5.625.

$S \rightarrow L.L \mid L$

$L \rightarrow LB \mid B$

$B \rightarrow 0 \mid 1$

Write S-attributed values corresponding to each of the productions to find S.val.

Position:
Show:

Related questions

43 43 votes
6 answers 6 answers
17.4k
17.4k views
Kathleen asked Sep 23, 2014
17,389 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
42 42 votes
3 answers 3 answers
17.2k
17.2k views
Kathleen asked Sep 23, 2014
17,236 views
A grammar that is both left and right recursive for a non-terminal, isAmbiguousUnambiguousInformation is not sufficient to decide whether it is ambiguous or unambiguousNo...
48 48 votes
5 answers 5 answers
24.8k
24.8k views
Kathleen asked Sep 23, 2014
24,806 views
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?XOR gates, NOT gates$2$ to $1$ multiplexersAND gates, XOR gatesT...
26 26 votes
6 answers 6 answers
28.5k
28.5k views
Kathleen asked Sep 23, 2014
28,546 views
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR