cykp v1.2 starting (many lines not of interest cut)
Start symbol: S
Variables: A B C S 
Terminals: a b 
Sorted productions:
A -> B	A	
A -> a	
B -> C	C	
B -> b	
C -> A	B	
C -> a	
S -> A	B	
S -> B	C	

about to parse baaba
run CYK algorithm to build array, size=5
Finished first row of VV table
VV(1,1)= B 
VV(2,1)= A C 
VV(3,1)= A C 
VV(4,1)= B 
VV(5,1)= A C 
Finished 2 row of VV table
VV(1,2)= A S 
VV(2,2)= B 
VV(3,2)= C S 
VV(4,2)= A S 
VV(5,2)= 
Finished 3 row of VV table
VV(1,3)= 
VV(2,3)= B 
VV(3,3)= B 
VV(4,3)= 
VV(5,3)= 
Finished 4 row of VV table
VV(1,4)= 
VV(2,4)= A C S 
VV(3,4)= 
VV(4,4)= 
VV(5,4)= 
Finished 5 row of VV table
VV(1,5)= A C S 
VV(2,5)= 
VV(3,5)= 
VV(4,5)= 
VV(5,5)= 
finish CYK algorithm, check for S in VV[1][n]and thus Accepted 
string accepted by G, string is in L(G)