Revision as of 07:19, 28 March 2009 edit DragonBot (talk \| contribs) 56,554 edits m robot Adding: af, cs, de, es, pt ← Previous edit		Revision as of 19:17, 7 May 2009 edit undo Corky laputa (talk \| contribs) 1 edit m →As pseudocode Next edit →
Line 20: ===As pseudocode=== '''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.

CYK algorithm: Difference between revisions