edited by
415 views
1 votes
1 votes
Consider the following transition rules:

A--> BC

C-->+BC | A | epsilion

B--> DB{print '+';} | epsilion

D--> (A)| id{print id.value;}

On input ' 5+67 ', this translation schme will print..............
edited by

1 Answer

1 votes
1 votes
draw the tree with respect to given input 5+67, traverse left to the right manner you get 5+67++ as output

Related questions

0 votes
0 votes
2 answers
1
Subhadeeppathak asked Nov 28, 2022
421 views
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?
1 votes
1 votes
1 answer
4
Na462 asked Jan 13, 2019
1,246 views
Consider the following Translation rules for the Grammar G :What will be the output for input string abebebe for bottom up parser ?CBBPBPBPCBBBPPBBCBPBPBPBCBPBBPPB