Adaptable parsing expression grammars

Authors:
Leonardo Vieira dos Santos Reis;Roberto da Silva Bigonha;Vladimir Oliveira Di Iorio;Luis Eduardo de Souza Amorim
Affiliations:
Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil;Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil;Departamento de Informática, Universidade Federal de Viçosa, Brazil;Departamento de Informática, Universidade Federal de Viçosa, Brazil
Venue:
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Year:
2012

Citing 17
Cited 0

A survey of adaptable grammars

ACM SIGPLAN Notices
Generation and recognition of formal languages by modifiable grammars

ACM SIGPLAN Notices
USSA—universal syntax and semantics analyzer

ACM SIGPLAN Notices
Dynamic parsers and evolving grammars

ACM SIGPLAN Notices
Growing a language

Addendum to the 1998 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum)
Packrat parsing:: simple, powerful, lazy, linear time, functional pearl

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Parsing expression grammars: a recognition-based syntactic foundation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Better extensibility through modular syntax

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Stratego/XT 0.17. A language and toolset for program transformation

Science of Computer Programming
Adaptable Grammars for Non-Context-Free Languages

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Parsing Fortress syntax

PPPJ '09 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java
Semantics and algorithms for data-dependent grammars

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental concrete syntax for embedded languages

Proceedings of the 2011 ACM Symposium on Applied Computing
Parsing reflective grammars

Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
LL(*): the foundation of the ANTLR parser generator

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
OCaml for the masses

Communications of the ACM
SugarJ: library-based syntactic language extensibility

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

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.