Definition 7.1.4: if G = (V, _, P, S) is a context-sensitivegrammar, for w1,w2_(V__)* a rewriting is leftmost, w1 _l w2, if w1 = xyA__, w2 = xy___, yA______y____P, and x,y__*; a derivation is leftmost if each of its steps is; the leftmost language of G is LL(G) = {w__* | S _*l w}.
Theorem 7.1.6: if G is a context-sensitive grammar, then LL(G) is context-free.
Previous slide | Next slide | Back to first slide | View graphic version |