For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Parse Algorithm for a Context-Sensitive Language
Eiichi TANAKA King SUNG FU
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1977/04/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Automata and Languages
Full Text: PDF(148.1KB)>>
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.