This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Inductive arguments Heres question 9 on midterm 2: Let G be a context-free grammar in Chomsky normal form and S * w be a derivation of w * with a derivation tree T . Suppose the height of T is n . Prove that | w | 2 n- 1 . Some of you pointed out that derivation trees in Chomsky normal form are binary trees and this is a property of binary trees. I didnt accept this answer. The fact that trees where each node has at most two children are binary trees should be completely obvious to any freshman CS major! Its an unacceptable proof for an exam in a 300 level course. Instead, this is a straightforward inductive argument. If you dont understand how to make clear inductive arguments, you will have difficulty passing this class (hint for the final). This skill is also extremely important to your success in a career as a computer scientist and/or programmer. Heres how to prove this. Production rules in Chomsky normal form appear only as follows....
View Full Document
- Spring '10