-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #611 from Golmote/prism-brainfuck
Add support for Brainfuck
- Loading branch information
Showing
4 changed files
with
65 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
Prism.languages.brainfuck = { | ||
'pointer': { | ||
pattern: /<|>/, | ||
alias: 'keyword' | ||
}, | ||
'increment': { | ||
pattern: /\+/, | ||
alias: 'inserted' | ||
}, | ||
'decrement': { | ||
pattern: /-/, | ||
alias: 'deleted' | ||
}, | ||
'branching': { | ||
pattern: /\[|\]/, | ||
alias: 'important' | ||
}, | ||
'operator': /[.,]/, | ||
'comment': /\S+/ | ||
}; |
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
<h1>Brainfuck</h1> | ||
<p>To use this language, use the class "language-brainfuck".</p> | ||
|
||
<h2>Full example</h2> | ||
<pre><code>+++++ +++ Set Cell #0 to 8 | ||
[ | ||
>++++ Add 4 to Cell #1; this will always set Cell #1 to 4 | ||
[ as the cell will be cleared by the loop | ||
>++ Add 2 to Cell #2 | ||
>+++ Add 3 to Cell #3 | ||
>+++ Add 3 to Cell #4 | ||
>+ Add 1 to Cell #5 | ||
<<<<- Decrement the loop counter in Cell #1 | ||
] Loop till Cell #1 is zero; number of iterations is 4 | ||
>+ Add 1 to Cell #2 | ||
>+ Add 1 to Cell #3 | ||
>- Subtract 1 from Cell #4 | ||
>>+ Add 1 to Cell #6 | ||
[<] Move back to the first zero cell you find; this will | ||
be Cell #1 which was cleared by the previous loop | ||
<- Decrement the loop Counter in Cell #0 | ||
] Loop till Cell #0 is zero; number of iterations is 8 | ||
|
||
The result of this is: | ||
Cell No : 0 1 2 3 4 5 6 | ||
Contents: 0 0 72 104 88 32 8 | ||
Pointer : ^ | ||
|
||
>>. Cell #2 has value 72 which is 'H' | ||
>---. Subtract 3 from Cell #3 to get 101 which is 'e' | ||
+++++++..+++. Likewise for 'llo' from Cell #3 | ||
>>. Cell #5 is 32 for the space | ||
<-. Subtract 1 from Cell #4 for 87 to give a 'W' | ||
<. Cell #3 was set to 'o' from the end of 'Hello' | ||
+++.------.--------. Cell #3 for 'rl' and 'd' | ||
>>+. Add 1 to Cell #5 gives us an exclamation point | ||
>++. And finally a newline from Cell #6</code></pre> | ||
|
||
<h2>One-line example</h2> | ||
<pre><code>++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.</code></pre> |