A recognition and parsing algorithm for arbitrary conjunctive grammars

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 365-399

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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. : 269-294

Taylor & Francis Ltd

Access to resources Recommend Favorite

Recursive descent parsing for Boolean grammars

By Okhotin Alexander

Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. : 167-189

Springer Publishing Company

Access to resources Recommend Favorite

Compilation versus abstract machines for fast parsing of typed feature structure grammars

By Brown J.C. Manandhar S.

Future Generation Computer Systems, Vol. 16, Iss. 7, 2000-05 ,pp. : 771-791

Elsevier

Access to resources Recommend Favorite

Image Parsing: Unifying Segmentation, Detection, and Recognition

By Tu Zhuowen Chen Xiangrong Yuille Alan Zhu Song-Chun

International Journal of Computer Vision, Vol. 63, Iss. 2, 2005-07 ,pp. : 113-140

Springer Publishing Company

Access to resources Recommend Favorite

BRNGLR: a cubic Tomita-style GLR parsing algorithm

By Scott Elizabeth Johnstone Adrian Economopoulos Rob

Acta Informatica, Vol. 44, Iss. 6, 2007-10 ,pp. : 427-461

Springer Publishing Company

Access to resources Recommend Favorite