Extended Context-Free Grammars (ECFGs) and Regular Right-Part Grammars (RRPGs) have many applications, but they are sparsely covered in the vast literature on parsing and grammars. This paper presents first steps towards a taxonomy of parsers for ECFGs and RRPGs, in order to make this subject more accessible.
|Title of host publication||Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings)|
|Editors||A.H. Dediu, A.M. Ionescu, C. Martín-Vide|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|