Computer scienceData scienceNLPFormal grammar

Formal grammars

Prove it wrong!

Report a typo

There is a following formal grammar. Prove that it's a generative one!

$G = (N, Σ, P, S)\\N = \{X, Y, Z\}, Σ = \{e, f, g\}\\P = \{S \to Xef, S \to Z, S \to ZY, e \to ε, e \to f^3, Y \to e^5, Z \to gY\}$

Select one or more options from the list

It isn't a generative grammar

It's generative because it has rules of type A→a, where A is non terminal and a is terminal

This grammar has start symbol, non terminals, terminals and production rules

Rules is a subset of a combination of nonempty N and Σ multiplied on combination of all N and Σ

Because it has ε in the production rules

Its set of non-terminals N doesn't intersect with terminals Σ

Because terminals aren't empty

___

Create a free account to access the full topic