retagged by
682 views

1 Answer

Best answer
3 votes
3 votes
$$\begin{align*} &S\rightarrow S_1 \;\; | \;\; S_2 \\ \\ &S_1 \rightarrow ABD \;\; | \;\; CAD \\ \\ &A \rightarrow 0A1 \;\; | \;\; \epsilon \\ \\ &B \rightarrow 1B \;\; | \;\; 1 \\ &C \rightarrow 0C \;\; | \;\; 0 \\ &D \rightarrow 2D \;\; | \;\; \epsilon \\ \\ &S_2 \rightarrow GEF \;\; | \;\; GBE \\ \\ &E \rightarrow 1E2 \;\; | \;\; \epsilon \\ &F \rightarrow 2F \;\; | \;\; 2 \\ &G \rightarrow 0G \;\; | \;\; \epsilon \\ \end{align*}$$
selected by

Related questions

0 votes
0 votes
2 answers
1
moe12leb asked Jan 21, 2023
252 views
what is the langauge generated by this grammar ?S >aS | aSbS | ε what is the language
1 votes
1 votes
1 answer
3
Mk Utkarsh asked Mar 22, 2018
1,320 views
Please post few examples of Linear Ambiguous Context Free Grammar.It would be helpful if you post grammars for famous languages.