What wiil be grammar rules for the language L={a^n b^n c^n d^n; n>0}
Asked
Active
Viewed 940 times
1 Answers
1
May I propose the following indexed grammar $G= ( \{S,A,C\}, \{a,b,c,d\}, \{f\}, S )$:
$S[\sigma] \to S[f\sigma]$
$S[\sigma] \to A[\sigma]\, C[\sigma]$
$A[f\sigma] \to a\, A[\sigma]\, b$, $\quad A[\,] \to \varepsilon$
$C[f\sigma] \to c\, C[\sigma]\, d$, $\quad C[\,] \to \varepsilon$
Hendrik Jan
- 31,459
- 1
- 54
- 109