Linguine
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
Linguine, created by Jeffry Johnston in November 2005, is designed as a "flattened Spaghetti", and adds unbounded memory and cell values, negative cell indices, unlimited pointers, and multiple commands per line.
Examples
Hello World
1[0=72,0$,0+29,0$,0+7,0$,0$,0+3,0$,1=32,1$,0-24,0$,0+24,0$,0+3,0$,0-6,0$,0-8,0$,1+1,1$,1-23,1$]0
Cat program
1[0?,0$,0~10:0]1
Fibonacci sequence calculator
1[0=32,2=1,1#,0$,2#]2 2[1+*2,3=*1,1=*2,2=*3,0$,2#]2
Digital root calculator
1[1?,1~10:3,0+*1,0-49,0<9:2,0-9]2 2[0+1]1 3[0#,1$]0
ROT13
1[-2?,-2~10:3,-2<65:2,-2<91:5,-2<97:2,-2<123:6]2 2[*-1=*-2,-1+1]1 3[*-3~0:4,*-3$,-3+1]3 4[-2$]0 5[-2+13,-2<91:2,-2-26]2 6[-2+13,-2<123:2,-2-26]2
Computational class
A Brainfuck implementation is given in the spec, featuring 8-bit (wrapping) cells and the required unbounded memory tape.
See also
- Spaghetti, the language Linguine was based upon