Last Updated：2025/11/30
(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Chomsky Normal Form
Edit Histories（0）
Source Word
Chomsky Normal Form
Noun
uncountable
Japanese Meaning
ショムスキー正規形：計算理論における文脈自由文法の一形式であり、各生成規則の右辺が単一の終端記号または二つの非終端記号のみで構成されるもの
Sense（1）
Sense（2）
(computing
theory)
A
context-free
grammar
in
which
the
right
hand
side
of
any
production
rule
consists
of
either
one
terminal
symbol
or
two
non-terminal
symbols
(neither
of
which
is
the
start
symbol)
or
the
epsilon
(i.e.
null
string)
symbol,
but
only
if
the
left
hand
side
is
the
start
symbol.
(Note:
this
is
the
full-fledged
version,
whereas
the
previous
definition
may
be
said
to
be
defining
Chomsky
reduced
form.)
