Tüm gistler - Opengist

yumaikas / sitegen_no_content.stk

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 3 days ago

1	site: cmd[
2	Array .new >pages
3	"*/.pstk" Directory .glob each[
4	if[ dup .file? :then pages .push :else void ]
5	]
6	#page: module/extend[ static/style.css: File .slurp >style ]
7	source-of: fn[ .[ Path .[ "." of[ path name ] relative ] ] ]
8	dest-of: fn[ .[
9	Path .[
10	"." of[ path name Path .parse .name ".html" + ] relative

june / Modules

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 5 days ago

A small module system.

1	\|:module: foo? :: (do something) :shared stack: $x $y $z\|
2	:shared stack: $z $y $x
3
4	\|:module: bar? :: (do something) :shared stack: $x $y $z\|
5	:shared stack: $y $x $z
6
7	\|:: (do something) :shared stack: $x $y $z\|
8	:shared stack: ($x $y $z)
9
10	\|:: ($module {)\| :module: $module

capitalex / gistfile1.txt

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 1 week ago

1	[ -- if 1
2	[] -- pop next bit
3	0101 -- duplicate encoded 1
4	0 -- cancel next block
5	0 -- cancel this block
6	]
7	[ -- if 1
8	1010 -- duplicate encoded 0
9	0 -- cancel this loop
10	]

kapunta / bf.nova

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 1 week ago

1	\|# Brainfuck
2
3	the brackets are written as { } because of the January syntax.
4
5	output is stored in :output: as bits.
6
7	the input operator is not implemented.
8
9	#\|

capitalex / bits.txt

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 1 week ago

1	$ echo "1[>1<[>[0]<00>0<0]>[<1>1>0]<]>>>>[0111100]1[1<]0>>>>>>>[10010]1[1<]0" \| ./bits.py -
2	█
3	░
4	█ █
5	█ █
6	█ ░
7	█ ░
8	░███░███████████████████████████
9	^-------------------------------

june / Bin-stack Compiler

0 beğeniler

0 çatallar

4 dosyalar

Son aktivite 2 weeks ago

A compiler from a multi-bit-stack VM to C.

1	\|:: read a character :@stdio: read\|
2	:end of file:
3	\|:: read a character :@stdio: $x\|
4	:buffer: $x
5	\|:: read a character?\|
6	:@stdio: read
7
8	\|:: reverse? :buffer: $x\|
9	:text: $x
10	\|:: reverse\|

june / Graph Traversal

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 2 weeks ago

A basic graph traversal algorithm.

1	\|\|::(
2	A - B - C
3
4	check if C is connected to A
5	)
6
7	\|:: ($A - $B - $C)\|
8	:: ($A -> $B -> $C -> $B -> $A)
9	\|:: ($A - $B)\|
10	:: ($A -> $B -> $A)

capitalex / functions.wont

0 beğeniler

0 çatallar

2 dosyalar

Son aktivite 2 weeks ago

1	call isnt less than 1, call isnt greater than 2, ...
2	wont return, wont jump, ..., cant jump here.
3	wont return, wont jump, ..., cant jump here.
4	wont jump, ..., cant jump here.
5
6	call isnt less than 2, call isnt greater than 10, ...
7	wont return, wont jump, ..., cant jump here.
8	wont return, wont jump, ..., cant jump here.
9	wont jump, ..., cant jump here.

june / Multi-bit-stack VM

0 beğeniler

0 çatallar

1 dosyalar

Son aktivite 2 weeks ago

A sketch of a small virtual machine that operates on multiple stacks of bits.

1	\|\|:: dispatch
2
3	\|:: dispatch\| :: evaluate :text: "
4	initial state
5	01 11 11 11
6	rules
7	rule
8	and if
9	1 match
10	else

capitalex / peom.dont

0 beğeniler

0 çatallar

2 dosyalar

Son aktivite 3 weeks ago

1	have what is DOESNT? ;
2
3	give DOESNT is an esolang
4	unless DOESNT , is , an , esolang
5	, a , rewriting , system
6	, that , which , what is left !! , not , taken
7	, where , everything , backwards
8	, it , left , untaken , DOESNT. ;
9
10	give a rewriting system