Author： Brown J.C. Manandhar S.
Publisher： Elsevier
ISSN： 0167-739X
Source： Future Generation Computer Systems, Vol.16, Iss.7, 2000-05, pp. : 771-791
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
Confluent Preorder Parsing of Deterministic Grammars
By Ho Kei Shiu Edward Chan Lai Wan
Connection Science, Vol. 9, Iss. 3, 1997-11 ,pp. :
Access to resources
Recommend
Recursive descent parsing for Boolean grammars
Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. :
A recognition and parsing algorithm for arbitrary conjunctive grammars
By Okhotin A.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Parsing as abstract interpretation of grammar semantics
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Parsing natural language idioms with bidirectional finite-state machines
By Poibeau T.
Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. :