Computer scienceData scienceNLPFormal grammar

Formal grammars

Theory

Language generation

Report a typo

You have the following formal grammar:

N={A,B,C},Σ={a,b,c}N = \{A, B, C\}, \Sigma = \{a, b, c\}

P={S→A,S→B,C→a,B→b,A→c,c→a,b→a}P=\{S \to A, S \to B, C \to a, B \to b, A \to c, c \to a, b \to a\}

What would such grammar generate?

Select one option from the list
___

Create a free account to access the full topic