Register

GATE CSE 1999 | Question: 9
closed

• closed by
1,654 views
2 votes
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.

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

9.7k
views
2 answers
28 votes
Kathleen asked Sep 23, 2014
9,690 views
GATE CSE 1999 | Question: 2.15
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...
User Avatar
15.2k
views
5 answers
37 votes
Kathleen asked Sep 23, 2014
15,181 views
GATE CSE 1999 | Question: 2.9
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...
User Avatar
23.0k
views
6 answers
21 votes
Kathleen asked Sep 23, 2014
23,032 views
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
User Avatar
5.9k
views
1 answers
13 votes
Kathleen asked Sep 23, 2014
5,874 views
GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...
User Avatar
Link Copied!