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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Eiichi TANAKA, King SUNG FU, "A Parse Algorithm for a Context-Sensitive Language" in IEICE TRANSACTIONS on transactions,
vol. E60-E, no. 4, pp. 183-184, April 1977, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e60-e_4_183/_p
Copy
@ARTICLE{e60-e_4_183,
author={Eiichi TANAKA, King SUNG FU, },
journal={IEICE TRANSACTIONS on transactions},
title={A Parse Algorithm for a Context-Sensitive Language},
year={1977},
volume={E60-E},
number={4},
pages={183-184},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Parse Algorithm for a Context-Sensitive Language
T2 - IEICE TRANSACTIONS on transactions
SP - 183
EP - 184
AU - Eiichi TANAKA
AU - King SUNG FU
PY - 1977
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E60-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1977
AB - 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.
ER -