A Parse Algorithm for a Context-Sensitive Language

Eiichi TANAKA  King SUNG FU  

Publication
IEICE TRANSACTIONS (1976-1990)   Vol.E60   No.4   pp.183-184
Publication Date: 1977/04/25
Online ISSN: 
DOI: 
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Automata and Languages
Keyword: 


Full Text: PDF(148.1KB)>>
Buy this Article




Summary: 
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.