Register

GATE CSE 1999 | Question: 9
closed

• closed by
1,690 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

28 votes
28 votes
2 answers
1
Kathleen asked Sep 23, 2014
9,692 views
GATE CSE 1999 | Question: 2.15
A grammar that is both left and right recursive for a non-terminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
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
37 votes
37 votes
5 answers
2
Kathleen asked Sep 23, 2014
15,184 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$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
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
21 votes
21 votes
6 answers
3
Kathleen asked Sep 23, 2014
23,247 views
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
User Avatar
13 votes
13 votes
1 answer
4
Kathleen asked Sep 23, 2014
5,893 views
GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x; end; begin a:= b:= 3; P(a+b, a, a); Print(a); end
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!