CYK algorithm: Difference between revisions

Content deleted Content added
Line 21:
'''Let''' the input be a string ''S'' consisting of ''n''
characters: ''a''<sub>1</sub> ... ''a''<sub>''n''</sub>.
 
'''Let''' the grammar contain ''r'' nonterminal
symbols ''R''<sub>1</sub> ... ''R''<sub>''r''</sub>.
This grammar contains the subset R<sub>s</sub> which is the set of start symbols.
 
'''Let''' P[n,n,r] be an array of booleans. Initialize all elements of P to false.