Theory of Computation20765 marksChomsky Normal Form
Define Chomsky Normal Form and Greibach Normal Form in reference to CFG. Give a suitable example of each.
Define Chomsky Normal Form and Greibach Normal Form in reference to CFG. Give a suitable example of each. [5]
--- A Context-Free Grammar (CFG) is said to be in Chomsky Normal Form if every production rule is of exactly one of the following two forms: A → BC (a non-terminal produces exactly two non-terminals) A → a (a non-terminal produces exactly one terminal) Where A, B, C are non-terminal symbols and a...