Piraha: A simplified grammar parser for component little languages

Steven R. Brandt; Gabrielle Allen

doi:10.1109/GRID.2010.5698011

Piraha: A simplified grammar parser for component little languages

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Software codes in scientific computing often implement their own little languages for expressing configuration data, interface definitions, and runtime parameters. Such languages are of particular importance for component-based frameworks. These languages can initially be somewhat ad-hoc and then expand organically. We describe how parsing expression grammars (PEG) can provide the capabilities for scientific application developers to easily construct appropriate parsers which will enable improved and more robust little languages. We show how a little language parser could be used with the Cactus Configuration Language in the Cactus Framework.

Original language	English (US)
Title of host publication	Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010
Pages	379-382
Number of pages	4
DOIs	https://doi.org/10.1109/GRID.2010.5698011
State	Published - 2010
Externally published	Yes
Event	2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010 - Brussels, Belgium Duration: Oct 25 2010 → Oct 29 2010

Publication series

Name	Proceedings - IEEE/ACM International Workshop on Grid Computing
ISSN (Print)	1550-5510

Other

Other	2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010
Country	Belgium
City	Brussels
Period	10/25/10 → 10/29/10

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/GRID.2010.5698011

Fingerprint Dive into the research topics of 'Piraha: A simplified grammar parser for component little languages'. Together they form a unique fingerprint.

Cite this

Piraha : A simplified grammar parser for component little languages. / Brandt, Steven R.; Allen, Gabrielle.

Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010. 2010. p. 379-382 5698011 (Proceedings - IEEE/ACM International Workshop on Grid Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Brandt, SR & Allen, G 2010, Piraha: A simplified grammar parser for component little languages. in Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010., 5698011, Proceedings - IEEE/ACM International Workshop on Grid Computing, pp. 379-382, 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010, Brussels, Belgium, 10/25/10. https://doi.org/10.1109/GRID.2010.5698011

@inproceedings{0054a54f22fe4451ae5b3ead17d1bc7a,

title = "Piraha: A simplified grammar parser for component little languages",

abstract = "Software codes in scientific computing often implement their own little languages for expressing configuration data, interface definitions, and runtime parameters. Such languages are of particular importance for component-based frameworks. These languages can initially be somewhat ad-hoc and then expand organically. We describe how parsing expression grammars (PEG) can provide the capabilities for scientific application developers to easily construct appropriate parsers which will enable improved and more robust little languages. We show how a little language parser could be used with the Cactus Configuration Language in the Cactus Framework.",

author = "Brandt, {Steven R.} and Gabrielle Allen",

year = "2010",

doi = "10.1109/GRID.2010.5698011",

language = "English (US)",

isbn = "9781424493487",

series = "Proceedings - IEEE/ACM International Workshop on Grid Computing",

pages = "379--382",

booktitle = "Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010",

}

TY - GEN

T1 - Piraha

T2 - 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010

AU - Brandt, Steven R.

AU - Allen, Gabrielle

PY - 2010

Y1 - 2010

N2 - Software codes in scientific computing often implement their own little languages for expressing configuration data, interface definitions, and runtime parameters. Such languages are of particular importance for component-based frameworks. These languages can initially be somewhat ad-hoc and then expand organically. We describe how parsing expression grammars (PEG) can provide the capabilities for scientific application developers to easily construct appropriate parsers which will enable improved and more robust little languages. We show how a little language parser could be used with the Cactus Configuration Language in the Cactus Framework.

AB - Software codes in scientific computing often implement their own little languages for expressing configuration data, interface definitions, and runtime parameters. Such languages are of particular importance for component-based frameworks. These languages can initially be somewhat ad-hoc and then expand organically. We describe how parsing expression grammars (PEG) can provide the capabilities for scientific application developers to easily construct appropriate parsers which will enable improved and more robust little languages. We show how a little language parser could be used with the Cactus Configuration Language in the Cactus Framework.

UR - http://www.scopus.com/inward/record.url?scp=79951636784&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951636784&partnerID=8YFLogxK

U2 - 10.1109/GRID.2010.5698011

DO - 10.1109/GRID.2010.5698011

M3 - Conference contribution

AN - SCOPUS:79951636784

SN - 9781424493487

T3 - Proceedings - IEEE/ACM International Workshop on Grid Computing

SP - 379

EP - 382

BT - Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, Grid 2010

Y2 - 25 October 2010 through 29 October 2010

ER -