/examples/short.bf

https://github.com/FabianM/brainfuck · Brainfuck · 71 lines · 52 code · 19 blank · 0 comment · 22 complexity · ceb2be7a32c064a2f739f9aa724e2bff MD5 · raw file 

    

  1. Although brainfuck is basically useless, it isn't quite so crashingly useless
    2. 

  2. as people usually say. Some small tasks can be done fairly concisely.
    3. 

  3. (Some of these are fairly UNIX-specific.)
    4. 

  4. 

  5. Do nothing, terminate successfully.
    6. 

  6. (Also called "true".)
    7. 

  7. (This is the shortest brainfuck quine as well.)
    8. 

  8. 

  9. +[>.+<]
    10. 

  10. Real random byte generator.
    11. 

  11. (Send output to file, stop program after a while, and take the last byte.)
    12. 

  12. 

  13. +++++++.
    14. 

  14. Beep.
    15. 

  15. (Small binary data files are easy to make with brainfuck and a pipe, too.)
    16. 

  16. 

  17. ,[.[-],]
    18. 

  18. Copy input to output. With a pipe, a no-frills way to make text files.
    19. 

  19. (Unlike most programs assuming EOF->0, this needed modification before it would
    20. 

  20. work with EOF->"no change" as well.)
    21. 

  21. (remove the . to get an input-devourer.)
    22. 

  22. 

  23. >,[>,]<[.<]
    24. 

  24. Reverse input.
    25. 

  25. 

  26. unmatched [.
    27. 

  27. A Kimian quine, for my implementation.
    28. 

  28. 

  29. ,[---------[-[++++++++++.[-]]],]
    30. 

  30. Strip tabs and linefeeds.
    31. 

  31. 

  32. ++++[>++++++++<-],[[>+.-<-]>.<,]
    33. 

  33. Show ASCII values of input in unary, separated by spaces.
    34. 

  34. (Useful for checking your implementation's newline behavior on input.)
    35. 

    36. 

  36. ++++++++++[>++++++++++>+<<-]>[>.<-]
    37. 

  37. Clear the screen.
    38. 

  38. 

  39. +++++++++++[>++++++>+<<-]>+.>-[.[-],]
    40. 

  40. Play "Prisoner's Dilemma" using the robust "Tit for Tat" strategy.
    41. 

  41. 

  42. +++++++++++[>++++++>+<<-]>++.>-.>,[,[-]<<.>.>,]
    43. 

  43. ...and using the not-so-robust "All D" strategy.
    44. 

  44. 

  45. +++++[>+++++++++<-],[[>--.++>+<<-]>+.->[<.>-]<<,]
    46. 

  46. Translate text to brainfuck that prints it.
    47. 

  47. 

  48. >>,[>>,]<<[[-<+<]>[>[>>]<[.[-]<[[>>+<<-]<]>>]>]<<]
    49. 

  49. Sort bytes in ascending order.
    50. 

  50. (These last two are solutions from Brainfuck Golf.)
    51. 

  51. 

  52. >,[>>>++++++++[<[<++>-]<+[>+<-]<-[-[-<]>]>[-<]<,>>>-]<.[-]<<]
    53. 

  53. Translate "binary" to ASCII, e.g. "0110100001101001" to "hi".
    54. 

  54. 

  55. +++++[>+++++<-]>[>++>++++<<-]>-->-<[[>[[>>+<<-]<]>>>-]>-[>+>+<<-]>]
    56. 

  56. A novel way of moving to the 9999th cell.
    57. 

  57. 

  58. >++++[>++++++<-]>-[[<+++++>>+<-]>-]<<[<]>>>>-
    59. 

  59. -.<<<-.>>>-.<.<.>---.<<+++.>>>++.<<---.[>]<<.
    60. 

  60. Print "brainfuck" with a linefeed.
    61. 

  61. 

  62. ++++++++[>++++[>++>+++>+++>+<<<<-]>+>->+>>+[<]<-]>>.>
    63. 

  63. >---.+++++++..+++.>.<<-.>.+++.------.--------.>+.>++.
    64. 

  64. Print "Hello World!" with a linefeed.
    65. 

  65. 

  66. >++++++++++>>+<+[[+++++[>++++++++<-]>.<++++++[>--------<-]+<<]>.>[->[<++>-]<[>+
    67. 

  67. <-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>[-]>[-]++<<-[>+<-]]]]]]]]]]]+>>]<<]
    68. 

  68. Output powers of two, in decimal. (Doesn't terminate.)
    69. 

    70. 

  70. Daniel B Cristofani (cristofdathevanetdotcom)
    71. 

  71. http://www.hevanet.com/cristofd/brainfuck/
    72.