Powerful and seamless syntax extensions on a statically typed language

Authors:
Kazuhiro Ichikawa
Affiliations:
Tokyo Institute of Technology, Tokyo, Japan
Venue:
Proceedings of the 12th annual international conference companion on Aspect-oriented software development
Year:
2013

Citing 4
Cited 0

Parsing expression grammars: a recognition-based syntactic foundation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Packrat parsers can support left recursion

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Programming in Scala: A Comprehensive Step-by-step Guide

Programming in Scala: A Comprehensive Step-by-step Guide
Parsing mixfix operators

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a mechanism of user-defined operators with better expressiveness while keeping composability. Our user-defined operators, named protean operators, can express arbitrary Parsing Expression Grammar (PEG) syntax, and they can also express complex user-defined literals. A library of user-defined operators is composable - the library can use with any other libraries. We have developed ProteaJ, which is an extension of Java 1.4 supporting protean operators.