On the size of parsers and LR(k)-grammars

By Leung  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 59-69

Elsevier

Access to resources Recommend Favorite

Assigning phrase breaks from part-of-speech sequences

By Taylor P.   Black A.W.  

Computer Speech & Language, Vol. 12, Iss. 2, 1998-04 ,pp. : 99-117

Academic Press

Access to resources Recommend Favorite

Meta-modelling and graph grammars for multi-paradigm modelling in AToM³

By de Lara Juan   Vangheluwe Hans   Alfonseca Manuel  

Software and Systems Modeling (SoSyM), Vol. 3, Iss. 3, 2004-08 ,pp. : 194-209

Springer Publishing Company

Access to resources Recommend Favorite

Generation of Positive and Negative Tests for Parsers

By Zelenov S.   Zelenova S.  

Programming and Computer Software, Vol. 31, Iss. 6, 2005-11 ,pp. : 310-320

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Polynomial-time identification of very simple grammars from positive data

By Yokomori T.  

Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. : 179-206

Elsevier

Access to resources Recommend Favorite