Define a grammar by setting = {} and let F consist of the following three formulas. N V N. N n, for some n is in {Moe, Larry, Curly}.

Need help with this question:

Define a grammar by setting Σ = {σ} and let F consist of the following three formulas.

1. σ → N V N. 

Save your time - order a paper!

Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlines

Order Paper Now

2. N → n, for some n is in {Moe, Larry, Curly}. 

3. V → v, for some v is in {hit, poked, spanked, kicked, punched}.

How many different grammatical sentences are there in the terminal language defined by the grammar?

I think the answer would be 30 but that doesn’t seem correct

"Our Prices Start at $11.99. As Our First Client, Use Coupon Code GET15 to claim 15% Discount This Month!!":

Get started