Git Product home page Git Product logo

brainfuck's Introduction

BrainFuck

>	increment the data pointer (to point to the next cell to the right).
<	decrement the data pointer (to point to the next cell to the left).
+	increment (increase by one) the byte at the data pointer.
-	decrement (decrease by one) the byte at the data pointer.
.	output the byte at the data pointer.
,	accept one byte of input, storing its value in the byte at the data pointer.
[	if the byte at the data pointer is zero, then instead of moving the instruction pointer forward to the next command, jump it forward to the command after the matching ] command.
]	if the byte at the data pointer is nonzero, then instead of moving the instruction pointer forward to the next command, jump it back to the command after the matching [ command.

"Hello World!"

>+++[-<+++>]<+[->+++++<]
>[-<+>>+>+<<]<--->
++++++[->++++++++<]>-
<++++[->>++++<<]

++[->+++<]>+.
<+++[->++++<]>..
----.+++.
<+++[-<++++>]<-.
>+++[-<---->]<+..
>+++[->----<]>.++.
<+++[->++++<]>-.
<+++[->----<]>.
<+++[->++++<]>+.
<++++[->-----<]>+.
<<-.>>+.<+++[->++++<]>.
--.<<+.
>>++++++.<+++[->---<]>-.
------.<+++[->+++<]>-.
<+++[->++++<]>.
<+++[->---<]>+.
+++.-----.<<.
>>>.<+++++.<++++[->----<]>-.
<+++[->+++<]>-.+++++.
>++++.<+++++++.
<++++[->----<]>--.
<+++[->+++<]>-.

Run It

My Fucking Codes

Class Name Description
Basic Basic functions
clean(current) Clear current cell
copy(source, target) Copy cell to next
Algorithm Algorithm functions
swap(left, right) Swap two cells #0 and #1
max(a, b) Compare cells #0 and #1, save the maximum in #2
min(a, b) Compare cells #0 and #1, save the minimum in #2
sort(array) Sort the array starts from cell #1, head(#0) and tail are 0
Math Math functions
add(summand, addend, sum) Add cell #0 with #1, save the result in #2
minus(minuend, subtrahend, difference) Minus cell #0 with #1, save the result in #2
multiply(multiplicand, multiplier, product) Multiply cell #0 with #1, save the result in #2
divide(numerator, denominator, quotient, remainder) Divide cell #0 with #1, save quot in #2 and rem in #3
pow(x, n) Multiply x(#0) for n(#1) times, save the result in #2
String String functions
gets(str) Get string from stdin(with End Marker in cell #0 when start)

brainfuck's People

Contributors

moky avatar sickworm avatar yehochanan0823 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.