Definition 4.1.4: A production _______of grammar G = (V, _, P, S) is called context-free if ___V. The grammar G is context-free if all its productions are context-free.
Theorem 4.1.1: For context-free grammar G = (V, _, P, S), if w = _1_2 … _k, where kŤ1 and _i_(V ___), 1ŠiŠk, and w _* x, then there exist xi__(V ___)*, 1ŠiŠk, so x = x1x2 … xk and _i _* xi for i =1, 2, … , k.
| Previous slide | Next slide | Back to first slide | View graphic version |