/prog/ - ABC language

Name: Anonymous 2008-05-11 10:17

does it really exist? if not ... how would we go about creating a touring complete language with only 3 symbols? how much LOC would a haskell implementation be?



AAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCC

AAAAAAAABBBBBBBBBBBBCCCCCCCCCCCCCCCCBBBBBBBBBBBBAAAAAAAA

AAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBCCCCC

CCCCCCCCCCCCCBBBBBBBBBABAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBA

AAAAAAAABBBBBBBBBAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBC

AAAAABBBBBBBBBAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBB

AABBBBBBBBBBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBB

BBBBBBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBB

BBBBBBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBB

BBBBBBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYHBT

BBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA

AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA

Name: Anonymous 2008-05-11 10:18

Anal Touring would approve.

Name: Anonymous 2008-05-11 10:23

>>1
how would we go about creating a touring complete language with only 3 symbols?
SKI

Name: Anonymous 2008-05-11 10:53

>>1
YHBT
RAAAAAAAAAAAAAAAGE

Name: Anonymous 2008-05-11 11:30

W3Nwb2lsZXJdWUhCVFsvc3BvaWxlcl0NCg==

Name: Anonymous 2008-05-11 11:32

W2JdW2ldW29dW3VdUkFBQUFBQUFBQUFBQUFBQUFBQUdFWy91XVsvb11bL2ldWy9iXQ==

Name: Anonymous 2008-05-11 11:36

aGF4IG15IGFudXMK

Name: Anonymous 2008-05-11 11:42

>>1
OUTPUT:



3 3 3 3 3 3 3 3 3 3 3 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 -2

Name: Anonymous 2008-05-11 17:52

I have created the language A. The only valid character is 'A'. I'd love to post hello world written in it, but this edit box is too small to contain it. It is Touring Complete, because it can be translated to Brainfuck:

import Data.List



brainfuckToA :: [Char] -> String

brainfuckToA =

 (foldr

  (\x y ->

   ((++)

    (replicate

     (case

      (elemIndex x " <>+-.,[]") of

       Just x -> x

       Nothing -> 0)

     'A')

    (concat (replicate 9 y))))

 "")



aToBrainfuck :: String -> [Char]

aToBrainfuck =

 (unfoldr

  (\x ->

   (\l ->

    (if ((==) l 0) then

     (Nothing) else

     (Just ((!!) " <>+-.,[]" (mod l 9),

            replicate (div l 9) 'A'))))

   (length x)))

Name: Anonymous 2008-05-11 19:13

>>9
I don't understand

Name: Anonymous 2008-05-11 23:15

>>>9

Already invented. Twice.
http://esolangs.org/wiki/Main_Page

Name: Trollbot9000 2009-07-01 10:44

We just hate GPL.

Name: Anonymous 2010-12-09 22:13

Name: Anonymous 2011-02-04 13:45

Name: Sgt.Kabukiman╋䙢 2012-05-23 5:31

All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy

ABC language

1 Name: Anonymous 2008-05-11 10:17

2 Name: Anonymous 2008-05-11 10:18

3 Name: Anonymous 2008-05-11 10:23

4 Name: Anonymous 2008-05-11 10:53

5 Name: Anonymous 2008-05-11 11:30

6 Name: Anonymous 2008-05-11 11:32

7 Name: Anonymous 2008-05-11 11:36

8 Name: Anonymous 2008-05-11 11:42

9 Name: Anonymous 2008-05-11 17:52

10 Name: Anonymous 2008-05-11 19:13

11 Name: Anonymous 2008-05-11 23:15

12 Name: Trollbot9000 2009-07-01 10:44

14 Name: Anonymous 2010-12-09 22:13

15 Name: Anonymous 2011-02-04 13:45

16 Name: Sgt.Kabukiman╋䙢 2012-05-23 5:31