Question

If for the Context Free Grammar (CFG) you have the following:

E -> E + T | T

T -> T * F | F

F -> ( E ) | N

N -> N D | D

D -> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

Then please for the following please draw a parse tree for the string "3 * 4 + 5 * 6 + 7"

Answer 1

if you have any doubts please post an comment.