• retagged by
3,656 views

2 Answers

Best answer
5 5 votes
Parse tree for $5 * 4 + 10 * 6 – 7 – 8$ based on above grammar will contains $18$ internal nodes and $6$ leaf nodes.

PS:) Will update this answer after Gate with Parse tree drawn
• selected by
Position:
Show:

Related questions

3 3 votes
1 1 answer
2.5k
2.5k views
mohitbawankar asked Jan 10, 2018
2,529 views
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
1 1 vote
0 0 answers
179
179 views
Tin_ku asked Aug 2
179 views
We know that the class of languages of LR(0), SLR(1), LALR(1), CLR(1) is the class of DCFLs, with the only exception being that...An LR(0) language is a DCFL that has the...
0 0 votes
1 1 answer
7.4k
7.4k views
admin asked Sep 6, 2019
7,398 views
This grammar generates binary numbers with a "decimal" point:$S\rightarrow L.L\mid L$$L\rightarrow LB\mid B$$B\rightarrow 0\mid 1$ Design an S-attributed SDD to compute $...
0 0 votes
0 0 answers
2.1k
2.1k views
admin asked Sep 6, 2019
2,110 views
This grammar generates binary numbers with a "decimal" point:$S\rightarrow L.L\mid L$$L\rightarrow LB\mid B$$B\rightarrow 0\mid 1$ Design an L-attributed SDD to compute $...