Sweet Expressions

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.

Sweet Expressions website
See also: (2 related languages)I-expressions, S-expressions
Read more about Sweet Expressions on the web: 1.
HTML of this page generated by LanguagePage.ts

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

Feature	Supported	Token	Example
Comments	✓		; A comment
Line Comments	✓	;	; A comment
Semantic Indentation	✓

Sweet Expressions - Data notation

Language features