Explain with an example Chomsky Normal Form

5.3kviews

written 7.8 years ago by

teamques10 ★ 65k

• modified 3.5 years ago

ADD COMMENT EDIT

1 Answer

111views

written 7.8 years ago by

teamques10 ★ 65k

A context-free grammar G = (V, Σ, R, S) is said to be in Chomsky Normal Form (CNF), if and only if every rule in R is of one of the following forms:
1. A → a, for some A ∈ V and some a ∈ Σ
2. A → BC, for …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.