Author： Ho Kei Shiu Edward Chan Lai Wan
Publisher： Taylor & Francis Ltd
ISSN： 1360-0494
Source： Connection Science, Vol.9, Iss.3, 1997-11, pp. : 269-294
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
Recursive descent parsing for Boolean grammars
Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. :
Access to resources
Recommend
A recognition and parsing algorithm for arbitrary conjunctive grammars
By Okhotin A.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Learning deterministic context free grammars: The Omphalos competition
Machine Learning, Vol. 66, Iss. 1, 2007-01 ,pp. :
Parsing schemata and correctness of parsing algorithms
By Sikkel K.
Theoretical Computer Science, Vol. 199, Iss. 1, 1998-06 ,pp. :