Abstract
Adams' extension of parsing expression grammars enables specifying
indentation sensitivity using two non-standard grammar constructs - indentation by a binary relation and alignment. This paper is a theoretical study of Adams' grammars. It proposes a
step-by-step transformation of well-formed Adams' grammars for
elimination of the alignment construct from the grammar. The idea that alignment could be avoided was suggested by Adams but no
process for achieving this aim has been described before.
This paper also establishes general conditions that binary
relations used in indentation constructs must satisfy in order to enable efficient parsing.
BibTeX - Entry
@InProceedings{nestra:LIPIcs:2017:8078,
author = {H{\"a}rmel Nestra},
title = {{Grammars for Indentation-Sensitive Parsing}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8078},
URN = {urn:nbn:de:0030-drops-80788},
doi = {10.4230/LIPIcs.MFCS.2017.45},
annote = {Keywords: Parsing expression grammars, indentation, grammar transformation}
}
|
Keywords: |
|
Parsing expression grammars, indentation, grammar transformation |
|
Collection: |
|
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
01.12.2017 |
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)