•

•

•

•

•

•

•

X

:(){ :|:& };:

myfun [] = []

myfun (x:xs) = myfun elts_lt_x ++ [x] ++ myfun elts_greq_x

where

elts_lt_x = [y | y <- xs, y < x]

elts_greq_x = [y | y <- xs, y >= x]

<syntax> ::= <rule> | <rule> <syntax>

<rule> ::= <opt-whitespace> "<" <rule-name> ">" <opt-whitespace> "::="

<opt-whitespace> <expression> <line-end>

<opt-whitespace> ::= " " <opt-whitespace> | ""

<expression> ::= <list> | <list> <opt-whitespace> "|" <opt-whitespace>

<expression>

<line-end> ::= <opt-whitespace> <EOL> | <line-end> <line-end>

<list> ::= <term> | <term> <opt-whitespace> <list>

<term> ::= <literal> | "<" <rule-name> ">"

<literal> ::= '"' <text> '"' | "'" <text> "'"

main()

{ long long P = 1,

E = 2,

T = 5,

A = 61,

L = 251,

N = 3659,

R = 271173410,

G = 1479296389,

x[] = { G * R * E * E * T , P * L * A * N * E * T };

puts((char*)x);

}

let rec funx a b = if b = 0 then a else funx b (a mod b);;

let ascii n =

let rec ascii' = function

| 0 -> ()

| i ->

let s = "N" ^ String.make (n-2) ' ' ^ "N" in

String.fill s (n-i) 1 'N';

print_endline s;

ascii' (i-1)

in ascii' n;;

filter(None,map(lambda y:y*reduce(lambda x,y:x*y!=0, map(lambda

x,y=y:y%x,range(2,int(pow(y,0.5)+1))),1),range(2,1000)))

•

•α

•

•α

(define check-equality (lambda (argument)

(if (= argument argument) (do-something) (do-something-else))))

.

X0,...,N−1 ← funX(x, N, s):if N = 1 then

X0 ← x0else

X0,...,N/2−1 ← funX(x, N/2, 2s)XN/2,...,N−1 ← funX(x+s, N/2, 2s)for k = 0 to N/2−1 :

t ← XkXk ← t + exp(−2πi k/N) Xk+N/2Xk+N/2 ← t − exp(−2πi k/N) Xk+N/2

endforendif

n L