| Bytes | Lang | Time | Link |
|---|---|---|---|
| 241 | Python 3.13.5 | 250716T031101Z | IHaveAQu |
| 047 | Dyalog APL | 250715T173249Z | Aaron |
| nan | Commodore 64 Assembler | 250710T102935Z | Jani Joe |
| 150 | Nim | 250709T042625Z | janAkali |
| 025 | Japt P | 250709T233903Z | Shaggy |
| 017 | Vyxal 3 | 250708T232217Z | pacman25 |
| 021 | Thunno 2 J | 230525T180344Z | The Thon |
| 1925 | Vyxal | 230518T141243Z | emirps |
| 288 | TIBASIC | 190429T165512Z | absolute |
| 148 | JavaScript | 190429T214130Z | Naruyoko |
| 027 | Japt v2.0a0 P | 190428T060556Z | Gymhgy |
| 083 | JavaScript ES6 | 160228T223909Z | ETHprodu |
| 031 | Pyke | 160416T164732Z | Blue |
| 167 | C++ | 160301T024059Z | tucuxi |
| 081 | Perl 6 | 160303T064951Z | Hotkeys |
| 079 | Ruby 79 Bytes | 160228T234320Z | FuzzyTre |
| 098 | Matlab | 160302T140858Z | Jonas |
| 192 | Mathematica | 160302T063235Z | hYPotenu |
| 1515 | oOo | 160229T021947Z | nneonneo |
| 070 | Retina | 160228T194307Z | Martin E |
| 112 | Python 2 | 160301T122356Z | Griffin |
| 120 | Lua | 160229T130208Z | Katenkyo |
| 027 | Jelly | 160229T155059Z | Sp3000 |
| 107 | Julia | 160229T021251Z | Alex A. |
| 212 | Hoon | 160229T000427Z | RenderSe |
| 091 | Python 3 | 160229T011205Z | Sp3000 |
| 034 | Jolf | 160228T230624Z | Conor O& |
| nan | Perl | 160228T185056Z | Andreas |
| 095 | JavaScript ES6 | 160228T183858Z | Neil |
| 036 | Japt | 160228T221337Z | ETHprodu |
| 032 | 05AB1E | 160228T182323Z | Adnan |
| 040 | Pyth | 160228T200225Z | Denker |
| 035 | CJam | 160228T192059Z | Martin E |
| 032 | MATL | 160228T181731Z | Luis Men |
Python 3.13.5, 241 bytes
i=0;a=[];s="".join([x for x in open('o').read() if 64<ord(x)<91 or 96<ord(x)<123])
while i<len(s)-2:a.append(s[i:i+3]);i+=3;
print("".join(["><[]-+.,"[x] for x in [int("".join(['1' if 64<ord(c)<91 else '0' for c in p]), 2) for p in a]]))
Save the oOo program as o (no file extension) in the same folder as the Python program.
Slightly less minified, and commented version that retains the same flow:
i=0
a=[]
# Filter out all the non-letters
s = "".join([x for x in open('o').read() if 64<ord(x)<91 or 96<ord(x)<123])
while i<len(s)-2: # i <= len(s)-3, there are still more 3 letter segments to read
a.append(s[i:i+3]) # i, i+1, and i+2
i+=3 # jump to the start of the next 3 letter segment
# segments interpreted as binary where 1 is upper and 0 is lower
codes = [int("".join(['1' if 64<ord(c)<91 else '0' for c in p]), 2) for p in a]
print("".join(["><[]-+.,"[x] for x in codes])) # conveniently oOo interpreted as binary maps to the correct indeces
Dyalog APL, ⎕IO←0, 47 chars
{'><[]-+.,'[2⊥¨{⍵⊂⍨0=3|⍳≢⍵}97>⎕UCS⍵/⍨⎕A∊⍨1⎕C⍵]}
Explanation
{'><[]-+.,'[2⊥¨{⍵⊂⍨0=3|⍳≢⍵}97>⎕UCS⍵/⍨⎕A∊⍨1⎕C⍵]}
1⎕C⍵ ⍝ Capitalize input
⎕A∊⍨ ⍝ see which of those are in the alphabet
⍵/⍨ ⍝ and only select those elements
⎕UCS ⍝ Convert each letter to its value
97> ⍝ Turn to boolean mask of which are capitalized and which are not
{ } ⍝ To break into groups of three
⍳≢⍵ ⍝ generate indices for length of input
0=3| ⍝ find where the index mod 3 equals 0. This makes a series of [1 0 0 1 0 0 ...]
⍵⊂⍨ ⍝ and partition
2⊥¨ ⍝ Decode each as if it were a binary number
'><[]-+.,'[ ] ⍝ Select from this mapping of BF characters
Commodore 64 Assembler, 43 Bytes (6502/KickAssembler)
TL;DR
The program reads chars from the top of the screen and checks if the char is lowercase (0) or uppercase (1), skipping non-alphabetic chars. After combining three bits into a number, it uses the number as an index to look up the matching char from the BF char table, and prints it out using a KERNAL ROM routine. It repeats this until it reaches a null terminator ('@' char = screen code $00).
Code
.encoding "petscii_mixed"
* = $f7
chars: .te "><[]-+.,"
reset: lda #3 // 2 Run with SYS255. Load oOo letter count to A...
sta $2 // 2 ...and store it on zero page.
next: iny // 1 Increment input char index (starts from 1).
ldx $0400-1,y // 3 Load char from screen-1,y to X.
beq * // 2 If char = '@' (screen code $00), we're done.
cpx #$1b // 2 Is char under $1b, ie. $01-$1a = lowercase?
bcc letter // 2 If yes, go process letter. C is clear = 'o'.
cpx #$5b // 2 Is char over $5b?
bcs next // 2 If yes, it is non-alphabetic - read next char.
cpx #$41 // 2 Is char under $41, ie. non-alphabetic?
bcc next // 2 If yes, read next. Otherwise fall through with C=1.
letter: rol // 1 Rotate A left, LSB<-C (Carry is 0='o' or 1='O').
dec $2 // 2 Decrement letter count.
bne next // 2 If not zero, go read next char.
tax // 1 If yes, make A into output chars table index.
lda chars-24,x // 2 Read char from chars,x (offset -24 = 3 ROL'd thrice).
jsr $ffd2 // 3 ROM routine, prints the char.
bvc reset // 2 Go reset letter count & continue (branch always taken).
Usage
Load the program. Press C= + Shift to switch from C64's default screen mode of uppercase letters & PETSCII symbols to mixed case letters (not mandatory, but makes entering the input string a whole lot easier 😁). Type your input to the top of the screen, and run the program with SYS 255.
Explanation
The code itself takes 35 bytes and the table of eight BF chars, unsurprisingly, takes an additional 8 bytes. Several tricks were used to make the code smaller:
- Program is loaded into a 'safe' area (ie. an area that KERNAL nor BASIC won't corrupt when loading the program) at the end of zero page, starting from memory address $f7. The chars table is at the very beginning of the program, fully on zero page, meaning that we can use 8bit addressing when accessing the table instead of 16bit. This saves a byte.
- When counting the groups of three letters, the count is held on zero page. Saves two bytes.
Yregister (used as an index when reading the input chars) is 0 afterSYS, thus we skip initialising it. Saves two bytes.- The comparisons in the logic to check if char is uppercase or lowercase are chosen carefully in such a way, that when we have determined that a char is a letter and continue to processing it, the Carry flag always holds the correct binary value for the given char (0 for lowercase char or 'o', 1 for uppercase or 'O'). Then we can just
ROLto left shift the previous letter(s) value and insert the carry as the new least significant bit, and we'll end up with the correct value (e.g. 00000101 for OoO). Hard to say exactly how many bytes this saves vs. other implementations, but the letter processing is very compact and exactly the same regardless of the case, thus we can completely omit any "if uppercase do this, if lowercase do that" code. - The three-bit number we came up with is simply used as an index to the 8 byte BF chars lookup table. However, in code we're pointing to chars,x minus 24 bytes. This is because...
- ...
Aregister is used for combining the bits of the three letters, but it is also used to re-init the letter downcounter to three after a BF char has been printed. Instead of clearing out A after downcounter init, we keep the value '3' there. We know that A will always be rotated left three times, thus the value 3 will be doubled three times: 3 -> 6 -> 12 -> 24, thus A will always hold the three-letter binary value for the BF char plus 24 at the time when we need to look up for the output char. To compensate for this, when accessing the chars table we simply offset the beginning of the table by -24. Not having to clear A saves 2 bytes. - After we've printed a BF char, we use
BVC(Branch if oVerflow Clear) to loop back to the beginning of the program. We're not using any of the few instructions that could set the overflow flag, thus the branch will always be taken. This saves a byte in comparison toJMP nnnn.
Nim, 157 152 150 bytes
import re,math
var
s,r=stdin.readall.replace re"\PL"
t,m=0
while t<s.len-2:(m=0;for i,c in s[t..t+2]:(if c<'a':m+=2^i);r&=">-[.<+],"[m];t+=3)
echo r
Thunno 2 J, 21 bytes
Ị³fæl3=;2ȷḋkŻ8ṗ«@ṅisi
Port of emirps's Vyxal answer.
Explanation
Ị³fæl3=;2ȷḋkŻ8ṗ«@ṅisi # Implicit input
Ị # Remove non-alphabets
³ # Split into groups of length 3
f # Case of each character in each group
æ ; # Filtered by:
l # Length
3= # Equals 3
ȷ # To each:
2 ḋ # Convert from binary
kŻ # Push "[]<>-+.,"
8ṗ # All permutations
«@ṅ # Compressed integer 16560
i # Index into permutations
si # Index into the above
# Implicit output of joined list
Vyxal, 154 bitsv2, 19.25 bytes
Ǎvæ3ẇ'L3=;vBkTṖ»AǑ»iiṅ
Ǎ # remove non alphabeticals
væ # get the case of each char (0 for lower, 1 for upper)
3ẇ # wrapped into chunks of length 3
'L3=; # keep only those of length 3
vB i # converted from binary and indexed into
kTṖ»AǑ»i # the 16560th permutation of the BF instruction set
ṅ # join by nothing
TI-BASIC, 311 288 bytes
What, no TI-BASIC answers? Time for me to fix that!
Ans→Str1:" →Str2:" →Str6:"ABCDEFGHIJKLMNOPQRSTUVWXYZ→Str4:For(S,1,length(Str1:sub(Str1,S,1:If inString(Str4+"abcdefghijklmnopqrstuvwxyz",Ans:Str2+Ans→Str2:End:sub(Str2,2,length(Str2)-1→Str2:For(B,1,.1+3⁻¹length(Str2:sub(Str2,3B-2,3→Str3:1+sum({4,2,1}seq(0≠inString(Str4,sub(Str3,X,1)),X,1,3→L₁(B:End:For(C,1,.1+dim(L₁:Str6+sub("><[]-+.,",L₁(C),1→Str6:End:sub(Str6,2,length(Str6)-1→Str6
Input is the oOo code in Ans.
Output is the translated BF code.
Examples:
"AbcDef
AbcDef
prgmCDGF18
--
"PROgRam reVERsES giVeN iNPut sEqUENcE
PROgRam reVERsES giVeN iNPut sEqUENcE
prgmCDGF18
.[>,]<[.<]+
"AbcDe
AbcDe
prgmCDGF18
-
Un-golfed:
(Newlines and comments added)
Ans→Str1 ;store the input in "Str1"
" →Str2 ;set "Str2" and "Str6" to a
" →Str6 ; space character
; (needed b/c TI-BASIC doesn't
; like concatenating empty
; strings)
"ABCDEFGHIJKLMNOPQRSTUVWXYZ→Str4 ;store the uppercase alphabet
; in "Str4"
For(S,1,length(Str1 ;loop over the input string
sub(Str1,S,1 ;get the current character
If inString(Str4+"abcdefghijklmnopqrstuvwxyz",Ans ;if the character is in either
; the uppercase or lowercase
; alphabet
Str2+Ans→Str2 ;add it to "Str2", the code
; string
End
sub(Str2,2,length(Str2)-1→Str2 ;remove the space added earlier
For(B,1,.1+3⁻¹length(Str2 ;loop over each 3-char substring
; and skip any extra chars
; (.1 is added to force one
; loop)
sub(Str2,3B-2,3→Str3 ;store said substring in "Ans"
1+sum({4,2,1}seq(0≠inString(Str4,sub(Str3,X,1)),X,1,3→L₁(B ;convert to the respective
; index in "><[]-+.,"
; (1-indexed)
End
For(C,1,.1+dim(L₁ ;loop over each index
; (.1 is added to force one
; loop)
Str6+sub("><[]-+.,",L₁(C),1→Str6 ;add the char to the translation
; string
End
sub(Str6,2,length(Str6)-1→Str6 ;remove the added space and
; store the result in "Str6"
; and "Ans"
;implicit print of "Ans"
Notes:
- TI-BASIC is a tokenized language. Character count does not equal byte count.
JavaScript, 148 bytes
function a(s){function b(c){return c.charCodeAt()&32}return (l=(s=s.replace(/[^a-z]/gi)).substr(3))?",.+-][<>"[b(s[0])*4+b(s[1])*2+b(s[2])]+a(l):""}
JavaScript (ES6), 94 93 91 85 84 83 bytes
Saved 1 byte thanks to @dev-null
x=>x.replace(/[a-z]/gi,c=>(a+=c<'a'|0)[2]?b+="><[]-+.,"['0b'+a-(a="")]:0,a=b="")&&b
I've tried many variants of this, but this seems to be the shortest. Also works on empty input!
How it works
First, with x.replace(/[a-z]/gi,c=>, we find take each letter c in the input. We set a and b to "" at the other end of the function call, since the function ignores any parameters past the second. a will store a binary string for determining which character we are currently making, and b will store the result.
Now for the confusing part: first, with (a+=+(c<'a')), we append a 0 to a if c is uppercase; 1 otherwise. This expression returns the new value of a, so then we can check if it has reached three chars of length with by checking if the character at index 2 exists:[2]?. If not, we simply end the function with :0.
If a is now three chars in length, it is a binary number between 000 and 111. We can convert this to a decimal number by appending "0b" to the beginning, then forcing the engine to parse it as a number with '0b'+a-0.
However, we still need to reset a to the empty string. We can't just do '0b'+(a="")-0 because that would mean the string parsed is just 0b. Fortunately, when parsed as a number, the empty string becomes 0, so we can replace the 0 with (a="").
Now we have our number, and we can just append the character at that index in "><[]-+.," to b. After the replace is done, we use &&b to return it from the function. (Well, unless the result of .replace is empty, which only happens on empty input and returns the empty string anyway.)
Pyke, 31 bytes, noncompetitive
Pyke is older than the challenge, but I added some features to make it more competitive - chunk function. I used the same trick as @Martin Büttner used.
#~l{)\`Lm<0+3cFb2"><[]-+.,"@)st
C++, 173 167 bytes
Full program, golfed (reads from standard input):
#include <cstdio>
main(){for(char*a="@[`{>-[.<+],",c,o=0,t=1;(c=getchar())>0;)if(c=c>*a&&c<a[1]?2:c>a[2]&&c<a[3]?1:0){o|=c>1?t:0;t*=2;if(t>4)putchar(a[o+4]),o=0,t=1;}}
Somewhat ungolfed:
#include <cstdio>
main(){
for(char*a="@[`{>-[.<+],",c,o=0,t=1;(c=getchar())>0;)
if(c=c>*a&&c<a[1]?2:c>a[2]&&c<a[3]?1:0){
o|=c>1?t:0;
t*=2;
if(t>4)putchar(a[o+4]),o=0,t=1;
}
}
Note that @A ... Z[ in ASCII, and likewise for `a ... z}.
Perl 6, 81 bytes
This can probably be done better, but this is my go at it
{m:g/:i<[a..z]>/;[~] ("><[]-+.,".comb[:2[$_]]for (+(91>$_.ord)for |$/).rotor(3))}
Usage
> my &f = {m:g/:i<[a..z]>/;[~] ("><[]-+.,".comb[:2[$_]]for (+(91>$_.ord)for |$/).rotor(3))}
-> ;; $_? is raw { #`(Block|149805328) ... }
> f("PROgRamreVERsESgiVeNiNPutsEqUENcE")
,[>,]<[.<]+
Ungolfed
sub oOo ($_) {
m:g/:i<[a..z]>/; # Match all letters and put them in $/
my @digits = (
for |$/ -> $c { # For all $c in $/
+(91>$c.ord) # 1 if $c.ord < 91 else 0
}
);
@digits.=rotor(3); # Split the digits into chunks of 3
my @chars = (
for @digits -> @l {
"><[]-+.,".comb[:2[@l]] # Take the character from "><[]-+.,"
# at an index given by converting
# @l (a list of 3 binary digits)
# from base 2 to base 10
}
);
@chars.join # Join the list of chars into a string and return
}
Ruby 117 114 113 111 86 79 Bytes
gets.tr(?^+m='a-zA-Z','').tr(m,?0*26+?1).scan(/.../){$><<"><[]-+.,"[$&.to_i 2]}
tr(?^+m='a-zA-Z','')sets m to'a-zA-Z'and removes non-letters.tr(m,?0*26+?1)converts lowercase to 0, uppercase to 1.scan(/.../)chunk string into groups of 3 and discard last group if it has less than 3{$><<"><[]-+.,"[$&.to_i 2]}convert each binary number to a character
Matlab, 98 bytes
function t(s);s=s(isletter(s));s=s(1:end-mod(end,3));r='><[]-+.,';r([4 2 1]*reshape(s<92,3,[])+1)
- Clean
- Trim
- reshape into a 3xn Matrix m with UC = 1, lc =0
- (4 2 1)*m+1 results in an index list
- Index to the right chars
Mathematica, 192 bytes
StringJoin[FromDigits[#,2]&/@Partition[ToCharacterCode@#-48,3]&[StringDelete[#,a_/;!LetterQ[a]]~StringReplace~{_?UpperCaseQ->"1",_?LowerCaseQ->"0"}]/.Thread[0~Range~7->Characters@"><[]-+.,"]]&
Anonymous function that takes the desired string as an argument. Steps in the (pretty straightforward) algorithm:
- Clean the string
- Replace UC->"1", lc->"0"
- Turn the string into a binary list
- Partition the list into threes and interpret each chunk as a base-2 number
- Replace the numbers with their appropriate symbols and join back into a string.
oOo, 1569 1515 bytes
Had to be done. Try it here.
Golfed:
oooooooooOoOoooooooooooooooOoOooooooOOOoOoooooooOoOOoOOoOOoOOoOOoOOoOOoOoOoooOOoOOoOOoOOoOOoOOoOOoOOoOoooOoooOOooOOoOooOoOoOoooooOoooOoooooOOooOooOoOOooOoOoOoooooOoOooooOoOoooooOoOooOoOOoooOoOooooooOoOOoOOoOOoOOoOoOoooOOoOOoOOoOOoOOoOoooOoooOOooOOoOOoOooOoOoOoooooOoooOoooooOOooOooOoOOooOoOoOoooooOoOooooOoOoooooOoOooOoOOoooOoOoooOoOOoOOoOOoOOoOOoOOoOooOoOoOoooooOoooOoooooOOooOooOoOOooOoOoOoooooOoOooooOoOoooooOoOooOoOOoooOoOooooooOoOOoOOoOOoOOoOoOoooOOoOOoOOoOOoOOoOoooOoooOOooOOoOOoOooOoOoOoooooOoooOoooooOOooOooOoOOooOoOoOoooooooooOoOoooOOooOooOoOOooOoOoOooooOooOooOooOooOooOooOooOooOooOooOOoOoooooooooooooooooooooooooooooooooooooooooooOoOoooOOooOooOooOooOoOOoOOooOoOoOooooooooooooOoOoooOOooOooOooOooOoOOoOOooOoOoOooooOooOooOooOooOooOooOooOooOOoOooooooooooooOoOoooooooooooooooooooooooooOoOoooOOooOooOooOooOoOOoOOooOoOoOooooooooooooOoOoooOOooOooOooOooOoOOooOooOooOooOooOooOooOoOoooooOooooooooooooooooOoOOoOOoOOoOOoOOoOoOoooOOoOOoOOoOOoOOoOOoOOoOoooOoooOOooOOoOOoOooOooOooOoOoooooOoooooOoooOOoooooOoooOOooOoOoooooooOoOOoOooOooOOoooOOooOOooooooOOooOoOooooOoOooooOooooOooooOooOOoooooOoooOOooOoOoooooooOoOooOooOOoooOOooOOoooOOooOOooooooOOooOoOooooOoOooooooooooooOoOOoOOoOOoOoOoooOOoOOoOOoOOoOoooOoooOOooOooOooOoOooooooooooOoOOoOOoOOoOOoOoOoooOOoOOoOOoOOoOOoOOoOoooOoooOOooOOoOooOoOooooOoOOoOooOooOOoooooOoooOOooOoOoOoooOOooOOooooooOOooOoOooooOoOooooOoooOOoooooOoooOOooOoOoooooooOoOOoOooOooOOoooOOooOOoooOOooOOoooOOOoOooooooooooooOOooOoOoooOOooOooOooOooOooOOooooOOooooOOoooOOoOOooooooooooooooooooooooooOoOooooooOOOoOO
Translated to Brainfuck (with linebreaks for clarity):
>>>+>>>>>+>>,[>>++++++++[<++++++++>-]<+<[->-[>]<<]<[->+>[->+<]>+>>+++++[<+++++>-
]<++<[->-[>]<<]<[->+>[->+<]>+>+++++++<[->-[>]<<]<[->+>[->+<]>+>>+++++[<+++++>-]<
++<[->-[>]<<]<[->>[-]<<]<[-<<<<<<<<<<<+>>>>>>>>>>>>>>[-]<<<<]]<[->>>[-]<<<<]]<[-
<<<<<<<<<+>>>>+>>>>>>>>[-]<<<<]]<[->>>[-]<<<<]<<<<<<<[>[>>>>>++++++[<+++++++>-]<
++<<<[>[>[<->-]<[>>++<<-]<->]<[>+>[>-<<->-]<[>>+<<-]<-]<->]<[>+>>>>++++[<++++>-]
<<<[>>>+++++[<++++++>-]<+<[>++<<->-]<[-]<->]<[>+>[<->-]<[>>++<<-]<-]<-]+>>>>.[-]
<<<<<-<-<-]]>>>>>>>>+>>,]
Ungolfed with explanation:
this progrAm Translates ooo codE tO brainfUCK cOde. i guesS sINcE ThE ExAMpLE
tEXt WAs SeLf-doCUmENtINg, I ShOUlD PrOBaBLy Make This SElf-DOcUmeNtInG too.
oh, I shoUld menTIon ThaT i WRotE tHe OriginAl BrainFuCk code EnTirElY By haNd.
If you waNt TO sEE tHE bRAiNfUck cODe, RUn THiS PrOGrAm wiTh itSElf AS iNPuT!
baSiCaLly, thiS proGram seTS up MemOrY As fOlLoWs: the fIrSt thrEe Bytes aRe
"ValId" FLags (V0, v1, V2), theN tHErE'S a BArRIeR (A 1) fOLlOweD bY tHree
"vaLue" bIts (b0, b1, b2). THe rEst Of THe aRrAy Is basiCaLly juSt ScratcH
sPacE. tO Save SpAce, i'm slIdINg THe POiNTeR fOrwaRD bY OnE In EAcH ItEratIon
uNTil THe POiNteR hItS the baRrieR, at whiCH poInt ThE ProGrAm Prints out tHe
ConvERteD chArACteR.
tHe ProgrAm eXteNsiVelY usEs tHe cLevEr "gReaTEr-Than" comparison operator
described by dheeraj ram aT
hTtp://sTAckOveRflOw.cOm/QUeSTioNs/6168584/BrAinfuck-comparE-2-nUmbeRS. i hAppEn
tO reAlLY lIKe tHiS iMplemEntAtiOn bEcaUse It iS boTh cOMpAct and nestablE,
wHich is critical for my bf code tO wOrk pROpeRly.
I seT up ThE ReQUisItE sTructure, then pErForm A BunCh oF neSteD cOMpaRisOns
ThaT loOk rOugHlY like tHis:
if(in >= 65 /* capital a */) {
if(In <= 90 /* CApITaL Z */) {
vI = 1
Bi = 1
} ELsE {
iF(in >= 97 /* lOWeRCaSE a */) {
IF(iN <= 122 /* LoWErCAsE z */) {
vi = 1
}
}
}
}
At thE End OF tHEsE coMpaRisOnS, if the V (valid) Bit iS Set, the ProgRAm sTePs
the poiNtER rIghTwaRDs. if IT hiTS the barRIer, It Then gOeS into A big sEt of
nEstED condiTionALs tHaT test the AcCumUlaTEd vaLUe bITs, anD ConSTruct thE
CorReSpondInG character to pRiNT oUT. tHEn It ReseTS bACk TO tHE iNitiAl stATe.
fInaLly, It Reads anotheR iNPuT ChARaCTeR aNd goES bACk TO lOOpINg.
SO tHere You hAVe iT - An Ooo To BrainFuCK cOnvErtER writtEn in OOo (aNd
BrAinfUCk, bY ExtensiON!). siNcE i havE a Few moRe chARacterS to sPAre In This
progRaM, HeRe's A coUPle oF StrESs teST paTTernS:
0123456789ABcDefghijklmnopQRstUvWxyzABcdEfgHijKlmNopQRstuvWXyz!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~
~}|{`_^]\[@?>=<;:/.-,+*)('&%$#"!zyXWvutSRqPOnmlkjihgfedcbazyxwvutsrqPoNmlkjihGFEdCBa9876543210
Thanks for the interesting challenge!
Retina, 79 75 71 70 bytes
Thanks to randomra for saving 1 byte.
i`[^a-z]
M!`...
m`^
;
+`(.*);(.)
$1$1$2;
T`l
.+
$.&
T`d`_><[]\-+.,
¶
Explanation
i`[^a-z]
We start by removing everything that's not a letter.
M!`...
This splits the string into chunks of three characters by returning all (non-overlapping) 3-character matches. This automatically discard any incomplete trailing chunk.
m`^
;
Prepend a ; to each line. We'll use this as a marker for the base-2 conversion. Speaking of which, we'll simply treat upper-case letters as 1 and lower-case letters as 0.
+`(.*);(.)
$1$1$2;
This does a funny base-2 to unary conversion. At each step we simply double the characters left of the ; and move the ; one to the right. Why does this work? Remember we'll be interpreting lower case as 0 and upper case as 1. Whenever we process a letter, we simply double the running total (on the left) so far - double lower-case letters are just 2*0=0, so they can be completely ignored and upper-case letters represent the binary number so far, so doubling them is what we want. Then we add the current letter to that running total which represents 0 or 1 correspondingly.
T`l
Remove all lower-case letters/zeroes.
.+
$.&
Match each line and replace it with the (decimal) number of characters in that line. Due to the ; this turns the unary number into its decimal equivalent + 1.
T`d`_><[]\-+.,
Transliteration which substitutes 1-8 with the corresponding command.
¶
Remove linefeeds.
Python 2, 112 bytes
''.join('><[]-+.,'[int('%d'*3%tuple(map(str.isupper,y)),2)]for y in zip(*[iter(filter(str.isalpha,input()))]*3))
Will try to golf it more.
Lua, 120 Bytes
Big use of string.gsub() here, one more time could have allowed me to create a one character pointer on this function to gain some bytes. Also, it is my first lua program without any spaces! :D
This program takes its input via command-line argument and output a BrainFuck program, one command per line.
Edit: Saved 1 Byte thanks to @Oleg V. Volkov
arg[1]:gsub("[%A]",""):gsub("%l",0):gsub("%u",1):gsub("...",function(c)x=1+tonumber(c,2)print(("><[]-+.,"):sub(x,x))end)
Ungolf and explanations
arg[1]:gsub("[%A]","") -- replace the non-letter character by an empty string
-- %A matches all the character not in %a (letters)
:gsub("%l",0) -- replace lower case letters by 0s
:gsub("%u",1) -- replace upper case letters by 1s
:gsub("...",function(c) -- iterate over all groupe of 3 characters
x=tonumber(c,2)+1 -- convert the 3-letter group from binary to decimal
print(("><[]-+.,") -- output the corresponding brainfuck command
:sub(x,x))
end)
Jelly, 27 bytes
=Œs¬Tịµ=Œu;0s3ṖḄ€ị“<[]-+.,>
Try it online! Note that backslashes need escaping in the input string for the second last test case.
Implicit input: string s (list of characters)
=Œs Compare with swapcase
¬ Not - this gives 1 for letters, 0 otherwise
Tị Take characters at truthy indices
µ Start a new monadic chain
Input: string s' (list of letters)
=Œu Compare with uppercase
;0 Append 0
s3 Split into chunks of length 3
Ṗ Pop last chunk
Ḅ€ Apply convert-from-binary to each chunk
ị“<[]-+.,> For each number, 1-based index cyclically into the string "<[]-+.,>"
Julia, 107 bytes
s->"><[]-+.,"[map(j->parse(Int,j,2)+1,[map(i->i<'_'?'1':'0',m)for m=matchall(r"\w{3}",filter(isalpha,s))])]
This is an anonymous function that accepts a string and returns a string. To call it, assign it to a variable.
Ungolfed:
function f(s)
# Brainfuck commands
bf = "><[]-+.,"
# Filter out non-alphabetic characters from the input
chars = filter(isalpha, s)
# Get all non-overlapping groups of three characters
groups = matchall(r"\w{3}", chars)
# Construct binary strings by comparing to _
binary = [map(i -> i < '_' ? '1' : '0', m) for m = groups]
# Parse each binary string as an integer and add 1
indices = map(j -> parse(Int, j, 2) + 1, binary)
# Return the Brainfuck commands at the indices
return bf[indices]
end
Hoon, 212 bytes
=+([v=turn c=curr q=cold k=tape] |=(t/k `k`(v (v `(list k)`(need ((unit (list k)) p:(rose (murn t (c rush alf)) (star (stun [3 3] ;~(pose (q '0' low) (q '1' hig))))))) (c scan bin)) (c snag (rip 3 '><[]-+.,')))))
Ungolfed:
|= t/tape
^- tape
%+ turn
%+ turn ^- (list tape)
%- need %- (unit (list tape))
=+ t=(murn t (curr rush alf))
p:(rose t (star (stun [3 3] ;~(pose (cold '0' low) (cold '1' hig)))))
(curr scan bin)
(curr snag (rip 3 '><[]-+.,'))
- use ++murn to get rid of all characters in the input that can't be parsed with "alf" (alphabet)
- parse the list with a combinator that outputs each 3 characters at a time to a list, replacing lowercase with '0' and uppercase with '1'
- Cast the result to (unit (list tape)) and forcibly unwrap it to get the furthest parsed result, to work with only multiple of threes without crashing
- Map over the list, parsing each group as if it were binary
- Use each number in the list as an index into the text '><[]-+.,', and cast the list back out to a tape.
Hoon doesn't have proper regular expressions, only a parser combinator library, so it's sadly pretty verbose. ++scan also crashes if the entire input stream isn't parsed, so I have to use ++rose, coerce it into a unit, and unwrap it for the "farthest parse" value. It also makes heavy use for currying and mapping over lists (++turn), so I alias the function names to one letter variables.
Hoon is the programming language for Urbit, a clean slate reimplementation project. It's purely functional, statically typed, vaguely lisp-like, and compiles to Nock. Nock is a combinator based VM that runs on top of a binary tree bignum memory model.
When you boot Urbit you are dropped into :dojo, the shell and Hoon repl. To run the snippet simply type:
%. "PROgRam reVERsES giVeN iNPut sEqUENcE"
and then paste the standalone function on the next line.
Python 3, 91 bytes
b=1
for c in input():
b=-~c.isalpha()*b+c.isupper()
if b>7:print(end="><[]-+.,"[b-8]);b=1
Hmm... looks a bit long, especially the second line. b=[b,2*b+(c<'a')][c.isalpha()] is slightly worse though.
Jolf, 31 34 bytes
Try it here! Replace ► with \x10 and ♣ with \x05. Because I implemented the chop function wrong, I gain 3 bytes. :(
►ΜZeZcAAρi♣Epu1pl033d."><[]-+.,"ΙH
ρi♣E remove all space in input
A pu1 replace all uppercase letters with 1
A pl0 replace all lowercase letters with 0
Zc 3 chop into groups of three
Ze 3 keep groups of length three
Μ d map
ΙH parse element as binary
."><[]-=.," and return a member of that
► join by nothing
Perl, 76 73 72 + 1 = 73 bytes
$a.=y+A-Z++dfor/[A-Z]/gi;print substr"><[]-+.,",oct"0b$_",1for$a=~/.../g
Requires the -n flag:
$ perl -n oOo.pl <<< 'PROgRamr{}\eVERsESgiVeNiNPutsEqUENcE'
,[>,]<[.<]+
Using the trick with base-2 conversion.
How it works:
# '-n' auto read first line into `$_`
for/[A-Z]/gi; # Iterate over all letters a-z
$a.=y/A-Z//d # Count number of uppercase letters (1 or 0)
for$a=~/.../g # Split $b into hunks of 3 characters. And
# remove any potential trailing characters.
substr"><[]-+.,",oct"0b$_",1 # `oct("0b$binary")` will convert binary
# to decimal.
print
JavaScript (ES6), 111 95 bytes
s=>s.match(/[A-Z]/gi).map(c=>+(c<'a')).join``.match(/.../g).map(g=>'><[]-+.,'['0b'+g|0]).join``
Simply removes non-letters, converts upper case letters into 1s and lower case into 0s, divides into groups of three, ignores a trailing group of 1 or 2, and decodes the groups.
Edit: Saved 16 bytes thanks to @dev-null, although the code no longer works when passed the empty string.
Japt, 37 36 bytes
Uo"%l" f'.³ £",><[]-+."gX®c ¤gJÃn2Ãq
How it works
Uo"%l" f'.³ £ ",><[]-+."gX® c ¤ gJÃ n2Ã q
Uo"%l" f'.³ mX{",><[]-+."gXmZ{Zc s2 gJ} n2} q
Uo"%l" // Get rid of all non-letter chars in U.
f'.³ // Take each set of three chars in U.
mX{ } // Map each item X in this group to:
XmZ{ } // Map each letter Z in X to:
Zc s2 gJ // Take the char code of Z as a binary string, and take the first char.
// This maps each character to 1 if it's UC, or 0 if it's lc.
n2 // Interpret the result as a binary number.
",><[]-+."g // Get the item at this index in this string.
q // Concatenate the result and implicitly output.
05AB1E, 35 32 bytes
Code:
á0«3÷\)vyS).uïJC",.+-][<>"Sr@?)\
Using a very clever trick from Martin Büttner, from this answer. Explanation:
á0« # Remove all non-alphabetic characters and append a zero
3÷\ # Split into pieces of 3 and discard the last one
)v # Wrap everything into an array and map over it
yS).uï # Is uppercase? Converts AbC to [1, 0, 1]
JC # Join and convert from binary to int
",.+-][<>" # Push this string
S # Split the string
r@ # Reverse the stack and get the character from that index
? # Pop and print without a newline
)\ # Wrap everything into an array and pop
Uses CP-1252 encoding.
Pyth, 40 bytes
jkm@"><[]-+.,"id2f!%lT3cm?rId0Z1f!rIT2z3
Could save 2 bytes if I can output the result as list of characters instead of a string.
Explanation
Filters out all non-letters, converts uppercase to 1 and lowercase to 0, splits into chunks of 3, interprets every chunk as binary number and uses this as index into a string which contains all BF commands.
jkm@"><[]-+.,"id2f!%lT3cm?rId0Z1f!rIT2z3 # z = input
f z # filter input with T
! # logical not
rIT2 # T == swapcase(T), true if T is not a letter
m # map filter result with d
?rId0 # if d == toLower(d)
Z1 # 0 for lowercase, 1 for uppercase
c 3 # Split into chunks of 3, last element is shorter if needed
f # filter with T
! # logical not
%lT3 # len(t) mod 3 -> keep only elements of length 3
m # map with d
id2 # Convert from binary to decimal
@"><[]-+.," # Get the resulting BF command
jk # Join to a string
CJam, 36 35 bytes
l{el_eu-},'_f<0+3/W<2fb"><[]-+.,"f=
Explanation
l e# Read input.
{el_eu-}, e# Discard all characters that don't change in a lower/upper case
e# transformation, i.e. non-letters.
'_f< e# Compare with '_' to determine case as 0 or 1.
0+ e# Append a zero.
3/ e# Split into chunks of 3.
W< e# Discard last chunk.
2fb e# Convert each chunk from base 2.
",.+-][<>"f= e# Select the corresponding character for each chunk.
MATL, 38 32 bytes
'><[]-+.,'jt3Y2m)3ZCtAZ)92<!XBQ)
'><[]-+.,' % push string with BF commands
j % read input as a string
t % duplicate
3Y2 % predefined literal: string 'A...Za...z'
m % true for elements of input string that are letters
) % index into input string to keep only letters
3ZC % 2D array whose columns are non-overlapping slices of length 3.
% The last column is padded with zeros if needed
tA % duplicate. True for columns that don't contain zeros
Z) % keep those columns only. This removes padded column, if any
92< % 1 for upper case letters, 0 for lower case letters in the 2D array
! % transpose so each group of 3 is a row
XBQ % convert each row from binary to decimal and add 1
) % index into string containing the BF commands. Implicitly display