1-1hit |
This paper descrives a deterministic parse algorithm for a context-sensitive language. The algorithm is an extension of the Cocke-Kasami-Younger's parse algorithm for a contest-free language to an algorithm for a context-sensitive language. The execution labor by the algorithm is more than 0(n3) for an input with length n.