Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-

Ani Programming

Name: Anonymous 2011-03-29 11:56

http://code.google.com/p/anic/

Name: Anonymous 2011-03-29 11:58

Time to start haxing.

Name: Anonymous 2011-03-29 11:59

The language is so unbelievably ugly.

Name: Anonymous 2011-03-29 12:50

>>1
Try to imagine, if you will, the amount of time and effort it would take you to write a bug-free, efficiently multithreaded real-time clock + infix calculator hybrid application in a language like C.

Watch and learn kids, this is not some measly fibs and facs hybrid application, it's a real-time clock + infix calculator hybrid application, yo.

I doubt it can be written in the in-lisp DSL even!

Name: Anonymous 2011-03-29 12:55

>>4
At least the ``in Lisp'' DSL is readable compared to that shit, otherwise it's just VALID PERL CODE.

Name: Anonymous 2011-03-29 12:58

>>5
You're not refuting >>4?

Name: Anonymous 2011-03-29 13:05

>>6
I didn't read the ENTERPRISE part.

Name: Anonymous 2011-03-29 13:08

a=[int\]<-0; op=[char\]<-' '; b=[int\]<-0; r=[int\]<-0;
0 { clock => [int ms] { ("\r" + ms/1000.0 + ":" + a + op + b + "=" + r) ->std.out; 1 std.delay (ms+1) clock} };
inLoop => {\std.in->a \std.in->op \std.in->b inLoop};
\\op ?? {'+': (\a+\b) '-': (\a-\b) '*': (\a*\b) '/': (\a/\b) : 0} <->r;

b.u.i.o.s VALID PERL/(QUASIQUOTE (QUASIQUOTE IN-LISP (QUOTE {QUOTE DSL)))) CODE.

Name: Anonymous 2011-03-29 13:10

>>8
SEXPCode FAILURE

Not even the Sexpcode→BBCode compiler can accept that shit.

Name: Anonymous 2011-03-29 13:47

>>9
remove the opening curly brace at ``{QUOTE''
VALID PERL/(QUASIQUOTE (QUASIQUOTE IN-LISP (QUOTE QUOTE DSL)))) CODE. 

Name: Anonymous 2011-03-30 9:39

Bump for ANI

Name: Anonymous 2011-03-30 11:40

[int\]
static typing never was so ugly.

(\a/\b)
FFFfffuuuuuuu.... and I thought Haskell is complicted.

Name: Anonymous 2011-03-30 11:43

>>8
And it doesn't support operator priorities and/or parentheses.

Name: Anonymous 2011-03-30 11:50

>>5
Nope. Comparatively sized infix calculator would look just as messy.

<: Parser for infix expressions
   Usage: parse "2*(3+4)"
:>
parseNumber [@xs] -> {:r n [x:@!digit @xs] -> r 10n+x xs; n [] -> n} 0 xs
parseOp [x:{\+; \-; \*; \/}] -> x.asSym
parseTerm x -> x.{[\( a:@Expr \)] -> [a]
                 ;[a:@Number]     -> a}
parseExpr x -> x.{[a:@Term o:@Op b:@Expr] -> [o a b]
                 ;[a:@Term]               -> a}
parse string -> string.asList.(strip \Space ?).parseExpr

Name: Anonymous 2011-03-30 11:55

>>14

parseNumber [@xs] -> {:r n [x:@!digit @xs] -> r 10n+x xs; n [] -> n} 0 xs
parseOp [x:{\+; \-; \*; \/}]->x.asSym
parseTerm [\( a:@Expr \)]->[a]; [a:@Number]->a
parseExpr [a:@Term o:@Op b:@Expr]->[o a b]; [a:@Term]->a
parse string -> string.asList.(strip \Space ?).parseExpr

Name: Anonymous 2011-03-30 11:57

>>14-15
But where is THE CLOCK?

Name: Anonymous 2011-03-30 12:04

>>16
I don't understand the clock part. Why do you need it in parser?

Name: Anonymous 2011-03-30 12:05

>>17
http://en.wikipedia.org/wiki/Gimmick

Name: Anonymous 2011-03-30 12:10

>>17
You don't, it was just expected because it was also part of ANI's sample program

Name: Anonymous 2011-03-30 12:17

Oh, ok. Just spawn a thread that will flood screen with "say (time)/1MS -> sleep MS"

Name: Anonymous 2011-03-30 12:19

Which domain is the ``In Lisp DSL'' for?
Has any more than random code fragments been posted?

Name: Anonymous 2011-03-30 12:21

Still op=[char\]<-0[/cood] looks butt-ugly compared to [code]char op=0

Name: Anonymous 2011-03-30 12:23

>>21
List processing, because "In Lisp DSL" is a Lisp dialect and it's programs are lists.

Name: Anonymous 2011-03-30 12:27

>>22
You wanna make this a beauty contest? I could swear, the amount of energy invested in complaining by ``æsthetics critics'' vastly exceeds that of creating languages by their designers.
I'm respecting your opinion, but what do you want to achieve with posting it here? We can't change how it looks, you know?
One more thing, are you also one of those Perl haters that thinks sigils are a crime against whatever doctrine you subscribe to? Fucking kids.
IHIHBT

Name: Anonymous 2011-03-30 12:27

WHAT THE FUCK WITH \ ? They are everywhere! MY EYES!

Name: Anonymous 2011-03-30 12:33

>>24
Then why sigils are named after the nails, Christ was nailed to the cross? You've to endure them. The way christianity.

Name: Anonymous 2011-03-30 13:29

>>14
What the... Did you just admit that your DSL is valid Perl code‽

Name: Anonymous 2011-03-30 13:31

>>24
fuck you faggot and your shitty (($languages))

Name: Anonymous 2011-03-30 14:08

>>28
I knew it!

Name: Anonymous 2011-03-30 14:15

>>27
No. My DSL is based on LISP and BASH - two languages I respect. Perl isn't a list processing language, it is a text-processing language, that has unreasonably amount of complicated operators and it uses OOP-classes from Set Theory, which I hate.

Name: Anonymous 2011-03-30 14:19

By "list-processing" I mean that language is sharpened towards working with lists. For example, LISP hash quasiquote operator for List construction, which in Perl allocated for something less useful. Lisp dosn't require comas between list elements, but Perl requires them for disambiguation of "-" operator.

Name: Anonymous 2011-03-30 14:25

>>30
Your language is based on Lisp and ML.

Name: Anonymous 2011-03-30 14:25

>>32
s/language/DSL/

Name: Anonymous 2011-03-30 14:26

>>30
exec not useful ?

Name: Anonymous 2011-03-30 14:33

>>32
ML is all about purity and typeclasses, but my language ideally shouldn't have types at all, because types types make language complicated and distract from solving the problem at hand. Why types, when lists are enough for everything?

Name: Anonymous 2011-03-30 14:35

>>34
it can't handle lists.

Name: Anonymous 2011-03-30 14:59

Well, at least in Haskell, types are important, if say, I want to calculate the factorial of 1000.

Name: Anonymous 2011-03-30 15:00

And I mean to get the *exact* number to the factorial of 1000. None of this approximation crap that some of your loser languages like Python like to pull on people.

Name: Anonymous 2011-03-30 15:02

>>37
That is why only PhDs can factorials in Haskell.

Name: Anonymous 2011-03-30 15:05


fold `*` [1..1000]
402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Name: Anonymous 2011-03-30 15:08

It seems like an ideal language to implement sleepsort in.

Name: Anonymous 2011-03-30 15:13

WARNING: TROLLS

Name: Anonymous 2011-03-30 15:21


delay x -> spawnThread {-> sleep x -> say x}
sleepSort xs -> map delay xs

the nice part about sleep sort is that it has only O(n) space/time complexity

Name: Anonymous 2011-03-30 15:25

>>41
ANI or [sup]\[/sup]In Lisp|| DSL?

Name: Anonymous 2011-03-30 15:26

BTW, sleep sort is just a version of radix sort.

Name: Anonymous 2011-03-30 15:43

sleepSort [1,2,3,∞]
WILL THIS PROGRAM HALT?

Name: Anonymous 2011-03-30 20:27

>>46
Infinite values can only be Fibonacci buttsorted

Name: Anonymous 2011-03-30 23:36

>>46
It will if a logistic function is used on inputs.

Name: Anonymous 2011-09-19 6:36

pantsu

Name: Anonymous 2011-09-19 15:22

>>46
The compiler would optimize it to [0x01, 0x02, 0x03, 0x04].
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -