Question

You have given grammar
S->S’$
S’->NP VP|N VP|N V|NP V
VP->V N|NP PP|N PP
PP->P NP|P N
You may have terminals of these productions as
N->john, girl, car
V->saw, walks
P->in
A->the, a
Now solve the following question for above grammar;
1.1- Apply Semantics rules for given production
1.2- Generate Parse Tree for this input string “girl saw john in a car” from given grammar rules. And apply Parse Tree for SDT (it may include L-attributed SDT).

Answer 1

Answer:

I don't understand your question but I will try my best to get it to you as soon as possible