Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages
Tetsuro MatsumuraKimio Kuramitsu
Author information
JOURNALS FREE ACCESS

2016 Volume 24 Issue 2 Pages 256-264

Details
Abstract

Parsing Expression Grammars are a popular foundation for describing syntax. Unfortunately, several syntax of programming languages are still hard to recognize with pure PEGs. Notorious cases appears: typedef-defined names in C/C++, indentation-based code layout in Python, and HERE document in many scripting languages. To recognize such PEG-hard syntax, we have addressed a declarative extension to PEGs. The “declarative” extension means no programmed semantic actions, which are traditionally used to realize the extended parsing behavior. Nez is our extended PEG language, including symbol tables and conditional parsing. This paper demonstrates that the use of Nez Extensions can realize many practical programming languages, such as C, C#, Ruby, and Python, which involve PEG-hard syntax.

Information related to the author
© 2016 by the Information Processing Society of Japan
Previous article Next article
feedback
Top