I found a task where you need to transform context free grammar to normal form. I'm a High Shcool student at this moment. But my Brother learning this at the university. He don't have much time to explan this, this is why I'm writting this question.

This is the task description: A chainless G grammar equivalent to G' grammar, all symbols of which can be used.

And the task is:

G : S → BC | DB
A → BD
B → b | D
C → CD | BC
D → bC | a | bB

If anybody can help me, please write a comment. Thanks :)

  • 1
    $\begingroup$ what is a chainless grammer? $\endgroup$
    – nir shahar
    Apr 24, 2021 at 19:09

1 Answer 1


If you are trying to convert the grammer into Chomsky Normal Form, consider applying this algorithm that can create a new normal grammer from an existing non-normal one.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.