Author： Blum N.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.267, Iss.1, 2001-09, pp. : 49-59
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On parsing coupled-context-free languages
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
Access to resources
Recommend
On parsing and condensing substrings of LR languages in linear time
By Goeman H.
Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. :
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
Parsing schemata and correctness of parsing algorithms
By Sikkel K.
Theoretical Computer Science, Vol. 199, Iss. 1, 1998-06 ,pp. :
By Dean T.R.
Automated Software Engineering, Vol. 10, Iss. 4, 2003-10 ,pp. :