/prog/ - No language is perfect

Name: Anonymous 2011-05-09 5:35

In this thread we design a perfect language

Name: Anonymous 2011-05-09 5:39

IF OP IS A FAGGOT;
GTFO;

Name: Anonymous 2011-05-09 5:43

use Perl;

Name: Anonymous 2011-05-09 5:48

define "perfect"

Name: Anonymous 2011-05-09 6:00

>>4
Infinitely good.

Name: Anonymous 2011-05-09 6:03

>>5
define "Infinitely"
define "good"

Name: Anonymous 2011-05-09 6:09

>>6
define ``define''

Name: Anonymous 2011-05-09 6:18

>>5
>>6
>>7



#define perfect      0

#define good         1

#define Infinitely   2

#define perfect      3

#define define       4

Name: Anonymous 2011-05-09 6:30

They pointless arguments are getting out of hand.

Name: Anonymous 2011-05-09 6:41

#!/usr/bin/dmd
import std.stdio;

void main()
{
writeln("D is perfect");
}

Name: Anonymous 2011-05-09 7:12

>>10
what the fuck

Name: Anonymous 2011-05-09 7:39

>>10
Another Java? Dont want!

Name: Anonymous 2011-05-09 7:50

>>11,12
Please, try to understand a little of what you're talking about.

Name: Anonymous 2011-05-09 8:07

Name: Anonymous 2011-05-09 9:18



(grammar -> sexp *)

(sexp -> or (#\( sexp * #\))  (#\( sexp * #\. sexp #\)) atom)

(atom -> or symbol string number vector)

Because BNF is obsolete.

Name: Anonymous 2011-05-09 12:57

(define-grammar sexp (sexp (or (#\( (* sexp) #\)) (#\( (* sexp) #\. sexp #\)) atom)) (atom (or symbol string number vector)))
Because fancy syntaxes are obsolete.

Name: Anonymous 2011-05-09 13:23

The main() should be like ThisIsWhereTheProgramStarts() so ein can sell it to the enterprise crew. And after that just something like Perl.

Name: Anonymous 2011-05-09 17:55

I was thinking about making a language like this once.

It would be like LISP but instead of using () all the time (which is hard to read), you would use ({[({[]})]}) and keep repeating that. So every time you nest them, you would go to the next type of parens:



(defun fibonacci {N}

  {if [or (zerop N) (= N 1)]

      1

    [let

    ({F1 [fibonacci (- N 1)]}

     {F2 [fibonacci (- N 2)]})

      (+ F1 F2)]})

It's a lot easier to read.

Name: Anonymous 2011-05-09 17:59

>>18
that's terrible!

Name: Anonymous 2011-05-09 18:05

>>18
That's not (define fib (let* ((√5 (inexact->exact (sqrt 5))) (φ (/ (add1 √5) 2))) (lambda (n) (round (/ (- (expt φ n) (expt (sub1 φ) n)) √5)))))

Name: Anonymous 2011-05-09 21:42

Lisp is already perfect.

Name: Waka Flocka 2011-05-10 0:56

I GO HARD IN THE MOTHERFUCKING PAINT NIGGA

No language is perfect

1 Name: Anonymous 2011-05-09 5:35

2 Name: Anonymous 2011-05-09 5:39

3 Name: Anonymous 2011-05-09 5:43

4 Name: Anonymous 2011-05-09 5:48

5 Name: Anonymous 2011-05-09 6:00

6 Name: Anonymous 2011-05-09 6:03

7 Name: Anonymous 2011-05-09 6:09

8 Name: Anonymous 2011-05-09 6:18

9 Name: Anonymous 2011-05-09 6:30

10 Name: Anonymous 2011-05-09 6:41

11 Name: Anonymous 2011-05-09 7:12

12 Name: Anonymous 2011-05-09 7:39

13 Name: Anonymous 2011-05-09 7:50

14 Name: Anonymous 2011-05-09 8:07

15 Name: Anonymous 2011-05-09 9:18

16 Name: Anonymous 2011-05-09 12:57

17 Name: Anonymous 2011-05-09 13:23

18 Name: Anonymous 2011-05-09 17:55

19 Name: Anonymous 2011-05-09 17:59

20 Name: Anonymous 2011-05-09 18:05

21 Name: Anonymous 2011-05-09 21:42

22 Name: Waka Flocka 2011-05-10 0:56