OurBigBook About$ Donate
 Sign in Sign up

Conversion of a context-free grammar to Chomsky normal form

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Formal language theory Context-free language Context-free grammar Chomsky normal form
2026-10-03  0 By others on same topic  0 Discussions Create my own version
To convert a context-free grammar to Chomsky normal form, first add a fresh start symbol. Remove epsilon productions, retaining the exceptional start production only when the empty word is to remain in the language; then remove unit productions and symbols that cannot participate in a terminal derivation. Replace each terminal occurring in a right-hand side of length at least two by a new nonterminal that produces that terminal. Finally split every right-hand side of length greater than two into binary productions using fresh nonterminals.

 Ancestors (8)

  1. Chomsky normal form
  2. Context-free grammar
  3. Context-free language
  4. Formal language theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 3 / 4G / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook