Content deleted Content added
No edit summary |
|||
Line 12:
The CYK algorithm for the membership problem is as follows:
'''Let''' the input string consist of ''n'' letters, ''a''<sub>1</sub> ... ''a''<sub>''n''</sub>.
'''Let''' the grammar contain ''r'' terminal and 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.
'''For each''' i = 1 to n
| |||