Towards a taxonomy for ECFG and RRPG parsing

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings)
EditorsA.H. Dediu, A.M. Ionescu, C. Martín-Vide
Place of PublicationBerlin
PublisherSpringer
Pages410-421
ISBN (Print)978-3-642-00981-5
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5457
ISSN (Print)0302-9743

Fingerprint

Context free grammars
Taxonomies

Cite this

Hemerik, C. (2009). Towards a taxonomy for ECFG and RRPG parsing. In A. H. Dediu, A. M. Ionescu, & C. Martín-Vide (Eds.), Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings) (pp. 410-421). (Lecture Notes in Computer Science; Vol. 5457). Berlin: Springer. https://doi.org/10.1007/978-3-642-00982-2_35
Hemerik, C. / Towards a taxonomy for ECFG and RRPG parsing. Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings). editor / A.H. Dediu ; A.M. Ionescu ; C. Martín-Vide. Berlin : Springer, 2009. pp. 410-421 (Lecture Notes in Computer Science).
@inproceedings{d0ed9fe548d946c1809ce0b3c67e0926,
title = "Towards a taxonomy for ECFG and RRPG parsing",
abstract = "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.",
author = "C. Hemerik",
year = "2009",
doi = "10.1007/978-3-642-00982-2_35",
language = "English",
isbn = "978-3-642-00981-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "410--421",
editor = "A.H. Dediu and A.M. Ionescu and C. Mart{\'i}n-Vide",
booktitle = "Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings)",
address = "Germany",

}

Hemerik, C 2009, Towards a taxonomy for ECFG and RRPG parsing. in AH Dediu, AM Ionescu & C Martín-Vide (eds), Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings). Lecture Notes in Computer Science, vol. 5457, Springer, Berlin, pp. 410-421. https://doi.org/10.1007/978-3-642-00982-2_35

Towards a taxonomy for ECFG and RRPG parsing. / Hemerik, C.

Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings). ed. / A.H. Dediu; A.M. Ionescu; C. Martín-Vide. Berlin : Springer, 2009. p. 410-421 (Lecture Notes in Computer Science; Vol. 5457).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Towards a taxonomy for ECFG and RRPG parsing

AU - Hemerik, C.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-00982-2_35

DO - 10.1007/978-3-642-00982-2_35

M3 - Conference contribution

SN - 978-3-642-00981-5

T3 - Lecture Notes in Computer Science

SP - 410

EP - 421

BT - Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings)

A2 - Dediu, A.H.

A2 - Ionescu, A.M.

A2 - Martín-Vide, C.

PB - Springer

CY - Berlin

ER -

Hemerik C. Towards a taxonomy for ECFG and RRPG parsing. In Dediu AH, Ionescu AM, Martín-Vide C, editors, Language and Automata Theory and Applications (3rd International Conference, LATA'09, Tarragona, Spain, April 2-8, 2009. Proceedings). Berlin: Springer. 2009. p. 410-421. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-00982-2_35