Soldato
Getting castrated by 2 half bricks?
I'd go as far as to say the syntax is similar. e.g for & while loops, switch statements, if statements, etc are almost identical (well, in most case they *are* identical).Stringy said:The syntax looks aesthetically similar.
MiGSY said:Assembly?
kreeeee said:It's an incredibly easy and fluid language :s
Why do you dislike it? It's like C but easier to use and stuff liek Haskell is a joke in comparison.
Java proper? Javascript is nothing to do with JavaJest3r said:java proper....
it's horrible
/ http://www.kuro5hin.org/story/2002/6/25/122237/078
/ find one-letter change paths for the following
x:(`make`love;`bread`wheat;`resist`futile;`effaces`cabaret
`wood`fire;`climb`rocks;`stones`chisel;`amperes`voltage)
/ words grouped by count
\t W@:8#{((=x),,!0)u?/:!1+|/u:?x}@#:'W:0:"word.lst"
/ graphs from equivalence classes of one-letter deletes `an`in<`n<`an`in
\t G:{(?,/@[n#,!0;x;,;!n:#x]@)'x:+{x?/:x:26 _sv 1_ x}'(1!)\_ic+x}'W
/ f-path to x from y http://kx.com/a/k/examples/graph.k (f-path to x from y)
p:{[f;x;y]:[#*y:|{(#y)&~x _in y}[x]{_dvl[?,/f x]v,:x}\y,v::();x{y@*&x _in/:f y}\1_ y;()]}
/ wrapper
W:`$W;P:{W[n] p[G[n]]. W[n:#$*x]?/:x}
\t P'x
/ cache results
A:B:();C:{:[(x@:<x)_in A;B A?x;*|B,:,P@*|A,:,x]}
\t C't,|:'t:x,x,x,x
++++++++++
[
>+++++++>++++++++++>+++>+<<<<-
]
>++.
>+.
+++++++.
.
+++.
>++.
<<+++++++++++++++.
>.
+++.
------.
--------.
>+.
>.
MiGSY said:I've just remembered a programming language I stumbled across a few years ago. It's called Brain****
```s``s``sii`ki
`k.*``s``s`ks
``s`k`s`ks``s``s`ks``s`k`s`kr``s`k`sikk
`k``s`ksk
phykell said:Cambridge LISP written using the vi editor...