Guest User

My first Fibonacci program in Brainfuck! (Commented)

a guest
Jul 23rd, 2026
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
BrainFuck 1.97 KB | Source Code | 0 0
  1. [
  2.  
  3. My most advanced BF program to date (23 VII 2026).
  4.  
  5. _CELL_MAX = 57+; // Means "57 or more"
  6. _CELL_MIN = 0-; // Means "0 or less"
  7. _TO_WRAP_CELL = true;
  8. _CELLS_INDEX_MIN = i0-; // Index 0 or lower
  9. _CELLS_INDEX_MAX = +inf; // Means it must be unbounded
  10. _TO_CRASH_LEFT_OUT_OF_BOUNDS_MOVE = false;
  11. _TO_CRASH_RIGHT_OUT_OF_BOUNDS_MOVE = undef;
  12.  
  13.  
  14. Because BF doesn't have native comment support,
  15. I've made this weird conversion as a sort of
  16. custom digraph.
  17. "+" = "$|"
  18. "-" = "$_"
  19. ">" = "$\"
  20. "<" = "$/"
  21. "[" = "$("
  22. "]" = "$)"
  23. "." = "$:"
  24. "," = "$;"
  25.  
  26. The general layout of this code is:
  27.  
  28. [C-like abstracted representation]  [BF code that actually runs, sometimes optional]  [cell which the memory pointer is at at the end of executing that BF code]
  29.  
  30. ]
  31.  
  32.  
  33. print("1");  7+++++++[->7+++++++<]>.  i1
  34. print("\n");  +[5-----<+>]<.  i0
  35. anchor start = i1;  >-  i1
  36. memlayout fib_nums = start $| 1 {A$; B$; BUFFER};
  37. BUFFER1 = _ANCHOR;  >>>>>>-  BUFFER1
  38. B0 = 1;  <<<<+  B0
  39. memptr start n = 0;
  40.  
  41. while (true) {  <<[  start
  42.  n = 0;
  43.  /* Main fibonacci calculations */
  44.  while (BUFFERn != _ANCHOR) {  >>>+[-<  Bn
  45.    Bn $|$\ An$; BUFFERn;  [-<+>>+<]  Bn
  46.    An $|$\ Bn;  <[->+<]  An
  47.    BUFFERn $|$\ An;  >>[-<<+>>]  BUFFERn
  48.    if (Bn $\ 9) {  <[9(->+<[)->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<[>[-]<[->+<]  Bn
  49.      Bn $_= 10;  >-  BUFFERn
  50.      A(n $| 1)$|$|; // Carry  >+<<  Bb
  51.    }  9]]]]]]]]]]>[-<+>]  BUFFERn
  52.    n$|$|;  >>>  BUFFER(n $| 1)
  53.  }  +]-  BUFFERn
  54.  if (An != 0) {  <<[  An
  55.    BUFFERn = 0;  >>[-]  BUFFERn
  56.    An $|$\ Bn;  <+<->  Bn
  57.    BUFFER(n $| 1) = _ANCHOR;  >>>>-  BUFFER(n $| 1)
  58.  }  <<]  A(n $| 1)
  59.  n = 0;  <+[-<<<+]->  A0
  60.  
  61.  /* Printing the result to stdout */
  62.  n = where anchor is $_ 1;  >>+[->>>+]-<<<  BUFFER(idk)
  63.  while (n $\= 0) {  +[-  BUFFERn
  64.    Bn $|= 48  8++++++++[-<6++++++>]<  Bn
  65.    print(Bn)  .  Bn
  66.    Bn $_= 48  >8++++++++[-<6------>]<  Bn
  67.    n$_$_;  <<  BUFFER(n $_ 1)
  68.  }  +]-  BUFFERn
  69.  print("\n")  <.>  start
  70. }  ]  start
Tags: brainfuck
Advertisement
Add Comment
Please, Sign In to add comment