Все фрагменты

capitalex / functions.wont

0 лайк(-ов)

0 форк(-ов)

2 файл(-ов)

Последняя активность 8 months 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

1 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months 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 лайк(-ов)

0 форк(-ов)

2 файл(-ов)

Последняя активность 8 months 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

capitalex / bouncing.dont

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

1	give <& .
2	unless @ , * , . , &> * !! ;
3
4	give @ &>
5	unless * , . , <&
6	, @ <& * , @ * !! , @ &> !!
7	, &> , * &> !! ;
8
9	give * &>
10	unless @ , * , . , &> * * , &> . !! , &> * . ;

bx / push-bit.c

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

1
2	#include <stdio.h>
3	#include <stdint.h>
4
5	uint64_t *bits = (uint64_t[64]) { 0 };
6	uint64_t top = 0;
7
8	/* gcc push-bit.c -O3 && objdump -D a.out \| less
9	0000000000001240 <get_bit>:
10	1240: 48 8b 05 f1 2d 00 00 mov 0x2df1(%rip),%rax # 4038 <bits>

capitalex / left-cursor.dont

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

1	give * *
2	unless * * * , * <B !! , * * <B !! , <B , * . !! , . , * * . ;
3
4	give *
5	unless * * , * <B !! , <B , . , * . ;
6
7	give . unless * , <B ;
8
9	give <B * unless <B , * <B * , * <B . ;

kapunta / rps.nova

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

1	\|- rock paper scissors -\|
2
3	\|\| :i have: paper
4	:you have: scissors
5	:let's play:
6
7	\|\| :beats: rock scissors
8	:beats: scissors paper
9	:beats: paper rock

june / Stacky Tape VM

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

A VM with a tape of stacks.

1	\|:: push to $x :value: $y\| :stacks: $x $y
2	\|:: push $x to $y\| :stacks: $y $x
3
4	\|:: pop from $x :stacks: $x $y\|
5	:value: $y
6	:: reset stacks
7	\|:: pop from $x? :stacks: $z $y\|
8	:seen: $z $y
9	\|:: pop from $x :default symbol: $y?\|
10	:value: $y

june / Simplest Nova (C++)

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

The simplest Nova implementation I've got (so far) in C++.

1	enum snv_state {
2	// Primary states.
3	INSERT, MATCH, REMOVE,
4	// Secondary states.
5	FETCH, LITERAL, VARIABLE
6	};
7
8	template<uint32_t size>
9	struct snv_stack {
10	uint32_t data[size] = {};

yumaikas / tinscript.js

0 лайк(-ов)

0 форк(-ов)

1 файл(-ов)

Последняя активность 8 months ago

1
2	function copyText(text) {
3	var tempInput = document.createElement("textarea");
4	tempInput.style = "position: absolute; left: -1000px; top: -1000px";
5	tempInput.value = text;
6
7	document.body.appendChild(tempInput);
8	tempInput.select();
9
10	document.execCommand("copy");