Register

context free grammar

603 views

1 Answer

0 0 votes
S-> aSd|S1|S2|S3

S1->aS1c|S3

S2->bS2d|S3

S3-> bS3c|$\varepsilon$

assuming (i,j,n,m >=0)
• edited by
Voting & Accepting an answer helps improve the community
← Previous · DFA and Reg ExpNext → · Tree data structure
← Previous in category · DFA and Reg ExpNext in category → · Regular expression
Position:
Show:

Related questions

2 2 votes
1 1 answer
120
120 views
GO Classes asked Sep 1
120 views
GO Classes DPP | GATE CS | Theory of Computation | Context Free Grammar
Which CFG generates the language $L = \{a^i b^j c^k \mid i+k=j\}$?$S \to AB$ $A \to aAb \mid \epsilon$ $B \to bBc \mid \epsilon$ $S \to aSb \mid bSc \mid \epsilon$ $S \to...