Example 6.3.1.To illustrate the operation of the CKY algorithm, consider the CNF grammar
S _ AA | BB | AX | BY | a | b,X _ SA, Y _ SB,A _ a, B _ b.
The candidate string we consider is x = abaaba.
V[3,2]•V[5,1] = {SS, SB, XS, XB} and Y _ SB, so Y_V[3,3]
Previous slide | Next slide | Back to first slide | View graphic version |