Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this community
In formal language theory, a context-free grammar G is said to be in Chomsky normal form if $$ S → A B$$ $$ A → a $$ $$S → ε $$
My question is that if $B$ in the the form of $$ B → abcd $$
where $abcd$ are terminal symbol, is this still in Chomsky Normal Form? ?
The above given CFG cannot be in Chomsky Normal Form since the production B→abcd has multiple terminals on left hand side of the production. In order to convert the given CFG to Chomsky Normal Form, will need to replace the terminals on lhs of production B→abcd as follows - B->abcd B->FG F->AE G->CD E->b C->c D->d.
