Computer Sciences > Gate 2016 Set-1 > SDT
Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals
{S, A} and terminals {a, b}.
Using the above SDTS, the output printed by a bottom-up parser, for the input aab is:
S −→ aA { print 1 }
S −→ a { print 2 }
A −→ Sb { print 3 }
S −→ a { print 2 }
A −→ Sb { print 3 }
Using the above SDTS, the output printed by a bottom-up parser, for the input aab is:
Correct : SDT
Similar Questions
Consider the productions A → PQ and A → XY. Each of the five non-terminals A,P,Q,X, and Y has two attributes: s is a synthesized attribute, and i is an inherite...
Consider the productions A → PQ and A → XY. Each of the five non-terminals A,P,Q,X, and Y has two attributes: s is a synthesized attribute, and i is an inherite...
Consider the productions A → PQ and A → XY. Each of the five non-terminals A,P,Q,X, and Y has two attributes: s is a synthesized attribute, and i is an inherite...
Total Unique Visitors
Loading......