Adaptable parsing expression grammars

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The term "extensible language" is especially used when a language allows the extension of its own concrete syntax and the definition of the semantics of new constructs. Most popular tools designed for automatic generation of syntactic analyzers do not offer any desirable resources for the specification of extensible languages. When used in the implementation of features like syntax macro definitions, these tools usually impose severe restrictions. We claim that one of the main reasons for these limitations is the lack of formal models that are appropriate for the definition of the syntax of extensible languages. This paper presents the design and formal definition for Adaptable Parsing Expression Grammars (APEG), an extension to the PEG model that allows the manipulation of its own production rules during the analysis of an input string. It is shown that the proposed model may compare favorably with similar approaches for the definition of the syntax of extensible languages. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Dos Santos Reis, L. V., Da Silva Bigonha, R., Di Iorio, V. O., & De Souza Amorim, L. E. (2012). Adaptable parsing expression grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7554 LNCS, pp. 72–86). https://doi.org/10.1007/978-3-642-33182-4_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free