10. I saw the man on the hill with the telescope:5 Passes
50. :CYKAlgorithm
• 1.Let w be the n length string to be parsed. And G represent the set of rules in
our grammar with start state S.
•
2.Construct a table DP for size n × n.
If w = e (empty string) and S -> e is a rule in G then we accept the string else
we reject.
•
3. For i = 1 to n: For each variable A: We check if A -> b is a rule and b = wi for
some i: If so, we place A in cell (i, i) of our table.
• 4. For l = 2 to n: For i = 1 to n-l+1: j = i+l-1 For k = i to j-1: For each rule A ->
BC: We check if (i, k) cell contains B and (k + 1, j) cell contains C: If so, we
put A in cell (i, j) of our table.
• 5. We check if S is in (1, n): If so, we accept the string Else, we reject.