ITEM METADATA RECORD
Title: Explicitly recursive grammar combinators - A better model for shallow parser DSLs
Authors: Devriese, Dominique
Piessens, Frank
Issue Date: Jan-2011
Publisher: Springer
Host Document: Practical Aspects of Declarative Languages (PADL 2011) vol:6539 pages:84-98
Series Title: Lecture Notes in Computer Science
Conference: Practical Aspects of Declarative Languages edition:13 location:Austin, Texas, USA date:24-25 January 2011
Abstract: We propose a novel context-free grammar representation for parsing
libraries in a pure programming language. Our representation
explicitizes the recursion in the grammar, thus avoiding fundamental
limitations of the grammar model currently employed by parser combi-
nator libraries. Additionally, we decouple the grammar from its
semantic actions using techniques from the Multirec generic
programming library. The look and feel of the grammar and semantic
actions remain close to traditional EBNF and syntax-directed
deļ¬nitions respectively. In an accompanying technical report, we
demonstrate that our representation supports more declarative
implementations of grammar transformations than other work. The ideas
described in this paper form the basis for our freely available
grammar-combinators parsing library.
ISBN: 978-3-642-18377-5
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section

Files in This Item:
File Description Status SizeFormat
tekst.pdf Published 284KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science