Chomsky Normal Form Definition/Meaning:

A restricted type of context-free grammar, namely one in which each production has the form

A→ BC or A → d,

i.e. each right-hand side consists of either two nonterminals or one terminal. Any context-free language is generated by such a grammar, except that derivation of the empty string, A, requires the additional production

S → A

Near by Terms:
	Chad
	Chain
	Chain Code
	Chained File
	Chained List
	Chaining Search
	Chain Printer
	Change Dump
	Change File
	Change Record
	Channel
	Channel Capacity
	Channel Coding
	Channel Coding Theorem
	Channel Controller
	Channel Error
	Channel Switching
	Character
	Character Encoding
	Characteristic (biased exponent)
	Characteristic Function of a subset S of a universal set U
	Characteristic Vector
	Character Machine
	Character Recognition
	Character Set
	Character String
	Charge-Coupled Device (CCD)
	Chassis
	CHDL
	Check
	Check Character
	Checking Program
	Checkout
	Checkpoint
	Checksum (molulo-n check, residue check)
	Chief Programmer Learn
	Child (son; offspring; daughter)
	CHILL
	Chinese Remainder Theorem
	Chip
	Chip Card
	Chip Set
	Chomsky Hierarchy
	Chomsky Normal Form
	Church-Rosser Theorem
	Church's Thesis