Sweet Expressions - Data notation

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

#1987on PLDB

11Years Old

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.

Tags: dataNotation
See also: (2 related languages) I-expressions, S-expressions
Read more about Sweet Expressions on the web: 1.

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	Example	Token
Comments	✓	; A comment
Line Comments	✓	; A comment	;
Semantic Indentation	✓