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

A recognition and parsing algorithm for arbitrary conjunctive grammars

By Okhotin A.  

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

Elsevier

Access to resources Recommend Favorite

Recursive Parser Optimization by Rewriting Context-Free Grammars

By Giannone A.   Eltantawi M.R.A.   Maresca P.  

Engineering Applications of Artificial Intelligence, Vol. 10, Iss. 6, 1997-12 ,pp. : 607-615

Elsevier

Access to resources Recommend Favorite

Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging

By Juditsky A.   Nazin A.   Tsybakov A.   Vayatis N.  

Problems of Information Transmission, Vol. 41, Iss. 4, 2005-10 ,pp. : 368-384

MAIK Nauka/Interperiodica

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