Honu

Rafkind, Jon; Flatt, Matthew

doi:10.1145/2371401.2371420

Cited by 16 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We discuss the most relevant and modern approaches below. Unlike most extensible language approaches, our work uses S-expressions rather than extensible lexical syntax, but see the work of Rafkind and Flatt [2012] on integrating macros and conventional syntax.…”

Section: Related Workmentioning

confidence: 99%

Macros for domain-specific languages

Ballantyne

King

Felleisen

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Macros provide a powerful means of extending languages. They have proven useful in both general-purpose and domain-specific programming contexts. This paper presents an architecture for implementing macroextensible DSLs on top of macro-extensible host languages. The macro expanders of these DSLs inherit the syntax system, hygienic expansion, and more from the host. They transform the extensible DSL syntax into a DSL core language. This arrangement has several important consequences. It becomes straightforward to integrate the syntax of various DSLs and the host language when their expanders share these inherited components. Also, a DSL compiler may be designed around a fixed core language, even for an extensible DSL. Finally, macros empower programmers to safely grow DSLs on their own and tailor them to their needs. CCS Concepts: • Software and its engineering → Macro languages; Domain specific languages.

show abstract

Section: Related Workmentioning

confidence: 99%

Macros for domain-specific languages

Ballantyne

King

Felleisen

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…SugarJ [11] provides a method for extending Java syntax. ProteaJ [19], Wyvern [24], and Honu [26] are programming languages that natively support syntax extension. Using these syntax extension mechanisms, domain-specific notation can be embedded as is.…”

Section: Domain-specific Languagementioning

confidence: 99%

Generating a Generic Fluent API in Java

Nakamaru

Chiba

2020

Programming

View full text Add to dashboard Cite

Context: Algorithms for generating a safe fluent API have been actively studied in recent years. A safe fluent API is a fluent API that reports incorrect chaining of the API methods as a type error to the API users. Although such a safety property improves the productivity of users, the construction of a safe fluent API is excessively complicated for developers. Therefore, generation algorithms are studied to reduce the development costs of a safe fluent API. Such studies may benefit many programmers, as a fluent API is a popular design in the real world. Inquiry: The generation of a generic fluent API remains unaddressed. A generic fluent API refers to a fluent API that provides generic methods (those that contain type parameters in their definitions). The Stream API in Java is an example of a generic fluent API. Previous studies on safe fluent API generation have focused on the grammar classes that the algorithms can deal with for syntax checking. The key concept of such studies is using nested generics to represent a stack structure for the parser built on top of the type system. Within this context, the role of a type parameter has been limited to the internal representation of a stack element of that parser on the type system. Library developers cannot use type parameters to include a generic method in their API so that the semantic constraints for their API will be statically checked; for example, the type constraint on the items passed through a stream. Approach: We propose an algorithm for generating a generic fluent API. Our translation algorithm is modeled as the construction of deterministic finite automaton (DFA) with type parameter information. Each state of the DFA holds information regarding which type parameters are already bound in that state. This information is used to identify whether a method invocation in a chain newly binds a type to a type parameter or refers to a previously bound type. This identification is necessary because a type parameter in a chain is bound at a particular method invocation, and the bound type is referenced in the following method invocations. Our algorithm constructs the DFA by analyzing the binding times of the type parameters and their propagation among the states in a DFA that is naively constructed using the given grammar. Knowledge: With our algorithm, the generation of a safe fluent API can be introduced into practical use. Grounding: We implemented a generator named Protocool to demonstrate our algorithm. Moreover, we generated several libraries using Protocool to demonstrate the ability and limitations of our algorithm. Importance: Our algorithm can aid library developers to develop a generic fluent API, which is essential for bringing safe fluent API generation to the real world, as the use of type parameters is a common technique in library API design. ACM CCS 2012Software and its engineering → Domain-specific languages; Source code generation;

show abstract

“…In contrast to SugarJ and similar to Lisp, Racket [7] and Honu [6] provide facilities for adapting its lexical syntax using reader macro. In Racket, the capability of the syntactically extension is limited to the host language syntax.…”

Section: Related Workmentioning

confidence: 99%

Implementing a scripting language parser with self-extensible syntax

Ide

2013

Proceedings of the 2013 Companion Publication for Conference on Systems, Programming, &Amp; Applications: Software for Humanity

View full text Add to dashboard Cite

Today, many developers try to create a new scripting language to provide scripting features to their own application domain. We proposed The DeSugar parser that provides a flexible means of extending the user-defined syntax by scripting. The goal of the DeSugar parser is to make it easier for users to adopt the language syntax to their own application domain. This paper presents Konoha, which is fully integrated with the DeSugar parser, and which allows users to extend its own syntax through the DeSugar parser scripting interfaces.

show abstract

Honu

Cited by 16 publications

References 21 publications

Macros for domain-specific languages

Macros for domain-specific languages

Generating a Generic Fluent API in Java

Implementing a scripting language parser with self-extensible syntax

Contact Info

Product

Resources

About