Question

Define a grammar by setting Σ = {σ} and let F consist of the following instruction formulas. 1.    σ → N V.2.    N → n, for some n  {he, she, José, Sal, Anna}.3.    V → v, for some v  {runs, jumps, skips, falls, swims}.4.    σ → σ P σ.5.    P → p, for some p  {and, while until}.6.    σ → either σ or σ. Consider the following string in the given grammar. Draw the corresponding tree. (Submit a file with a maximum size of 10MB.) Sal runs while Anna jumps.

Answer 1