Languages Features Creators CSV Resources Challenges Add Language
GitHub icon

Sweet Expressions

Sweet Expressions - Data notation

< >

Sweet Expressions is a data notation created in 2013 by David A. Wheeler and Alan Manuel K. Gloria.

#2158on PLDB 10Years Old 0Books
0Papers

This SRFI describes a set of syntax extensions for Scheme, called sweet-expressions (t-expressions), that has the same descriptive power as s-expressions but is designed to be easier for humans to read.


Example from the web:
define fibfast(n) ; Typical function notation if {n < 2} ; Indentation, infix {...} n ; Single expr = no new list fibup n 2 1 0 ; Simple function calls

Language features

Feature Supported Token Example
Comments
; A comment
Line Comments ;
; A comment
Semantic Indentation
plantuml.html · sweet-expressions.html · verve.html

View source

- Build the next great programming language · Search · Day 214 · About · Blog · Acknowledgements · Traffic · Traffic Today · GitHub · feedback@pldb.com