#Charm , 52 bytes
Charm , 52 bytes
This outputs all of the reserved words in Charm.
" [ := :: \" " 0 2 copyfrom 3 * substring pstring
Since all non-recursive code in Charm is inline-able, this is an anonymous function. Call like this:
4 " [ := :: \" " 0 2 copyfrom 3 * substring pstring
(outputs [ := :: ", the only four reserved words.)
Giving this function a name adds 5 bytes:
f := " [ := :: \" " 0 2 copyfrom 3 * substring pstring
#Charm , 52 bytes
This outputs all of the reserved words in Charm.
" [ := :: \" " 0 2 copyfrom 3 * substring pstring
Since all non-recursive code in Charm is inline-able, this is an anonymous function. Call like this:
4 " [ := :: \" " 0 2 copyfrom 3 * substring pstring
(outputs [ := :: ", the only four reserved words.)
Giving this function a name adds 5 bytes:
f := " [ := :: \" " 0 2 copyfrom 3 * substring pstring
Charm , 52 bytes
This outputs all of the reserved words in Charm.
" [ := :: \" " 0 2 copyfrom 3 * substring pstring
Since all non-recursive code in Charm is inline-able, this is an anonymous function. Call like this:
4 " [ := :: \" " 0 2 copyfrom 3 * substring pstring
(outputs [ := :: ", the only four reserved words.)
Giving this function a name adds 5 bytes:
f := " [ := :: \" " 0 2 copyfrom 3 * substring pstring
#Charm, 52 bytes
This outputs all of the reserved words in Charm.
" [ := :: \" " 0 2 copyfrom 3 * substring pstring
Since all non-recursive code in Charm is inline-able, this is an anonymous function. Call like this:
4 " [ := :: \" " 0 2 copyfrom 3 * substring pstring
(outputs [ := :: ", the only four reserved words.)
Giving this function a name adds 5 bytes:
f := " [ := :: \" " 0 2 copyfrom 3 * substring pstring