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
clean: clean.room clean.object clean.item | |
clean.room: | |
rm -f *.room | |
clean.object: | |
rm -f *.object | |
clean.item: | |
rm -f *.item |
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
<scheme name="Wombat" version="142" parent_scheme="Default"> | |
<option name="FONT_SCALE" value="1.0" /> | |
<metaInfo> | |
<property name="created">2023-03-31T22:46:36</property> | |
<property name="ide">idea</property> | |
<property name="ideVersion">2022.2.3.0.0</property> | |
<property name="modified">2023-03-31T22:48:13</property> | |
<property name="originalScheme">_@user_Wombat</property> | |
</metaInfo> | |
<option name="CONSOLE_FONT_NAME" value="Lucida Sans Typewriter" /> |
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
# returns [num, offset] | |
def parse_num(input, pos) | |
offset = 0 | |
num = '' | |
while (pos + offset) < input.size && input[pos + offset].match?(/\d/) | |
num << input[pos + offset] | |
offset += 1 | |
end |
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
[ | |
Encodes the input string, until newline, to a Brainfuck program that prints this string | |
The BF code will use the current cell only, which is the fastest possible way to print | |
in Brainfuck, despite producing longer code than other methods. | |
registers: | |
- '+'/'-'/'.' | |
- prev | |
- input |
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
<NotepadPlus> | |
<UserLang name="WAT" ext="wat" udlVersion="2.1"> | |
<Settings> | |
<Global caseIgnored="no" allowFoldOfComments="no" foldCompact="no" forcePureLC="0" decimalSeparator="0" /> | |
<Prefix Keywords1="no" Keywords2="no" Keywords3="no" Keywords4="no" Keywords5="yes" Keywords6="no" Keywords7="no" Keywords8="no" /> | |
</Settings> | |
<KeywordLists> | |
<Keywords name="Comments">00;; 01 02 03(; 04;)</Keywords> | |
<Keywords name="Numbers, prefix1"></Keywords> | |
<Keywords name="Numbers, prefix2"></Keywords> |
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
/* | |
bfc.c: A BFC Layer 1 interpreter | |
Based on a Brainfuck interpreter written by Erik Bosman <ejbosman@cs.vu.nl>. | |
Modified by Sinthorion. | |
This program is free software; you can redistribute it and/or modify | |
it under the terms of the GNU General Public License as published by | |
the Free Software Foundation; either version 2 of the License, or |
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
y | |
n | |
t1 | |
s | |
e | |
s | |
s | |
t3 | |
n | |
s |
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
[ | |
BF Tic Tac Toe - Hotseat Version | |
================================ | |
Memory structure: | |
00: mode, col, row, zflag, tmp | |
04: flag, cell_A1, flag, cell_A2, flag, cell_A3, | |
0A: flag, cell_B1, flag, cell_B2, flag, cell_B3, | |
10: flag, cell_C1, flag, cell_C2, flag, cell_C3, | |
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
#!/usr/bin/env ruby | |
require 'optparse' | |
options = Hash.new(false) | |
option_parser = OptionParser.new do |opts| | |
opts.banner = "Usage: bf.rb [options] <bf_file_or_string>" | |
opts.on '-t', '--[no-]timing', 'Track compilation and execution time' do |v| | |
options[:timing] = v |
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
[ memory structure: | |
input string: (2n+2) | |
space between used as flags to mark cells; or as additional bytes for computation | |
DISCLAIMER: INPUT MUST BE TERMINATED BY A NEWLINE FEED OR THE PROGRAM WILL LOOP INFINITELY, and I'm too lazy to fix that | |
This code assumes wrapping 8-bit cells. | |
] | |
>> |