Content deleted Content added
Line 23:
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
'''For each''' unit production R<sub>j</sub> -> a<sub>i</sub>, '''set''' P[i,1,j] = true.
| |||