New pages

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

10:18, 1 June 2023 ‎OCOO (hist | edit) ‎[8,806 bytes] ‎Trap-representation (talk | contribs) (Created page with "OCOO is an esoteric programming language designed by User:Trap-representation. OCOO is an acronym for '''O'''ne '''C'''haracter '''O'''ne '''O'''peration. This is not a normative reference for OCOO. OCOO has a work-in-progress specification, a link to which will be put here once it's completed. OCOO only has two operators: the <code>+</code> operator, which operates on blocks, and the <code>;</code> operator, which modifies the block pointer (BP). ==Concept== Oper...")
05:44, 1 June 2023 ‎AutoCorrect (hist | edit) ‎[2,335 bytes] ‎Gilbert189 (talk | contribs) (Created page with "{{WIP}} AutoCorrect is a golfed derivative of C, where every error in the code that the parser can find is corrected. Codes in AutoCorrect uses autocorrection as a way to remove characters that are arbitrarily unnecessary (such as closing brackets). == Autocorrecting ==  Autocorrection is performed when either the parser encountered a syntax error, or when a name hasn't been declared (while alternative names exist...")
00:58, 31 May 2023 ‎Coercionfulity (hist | edit) ‎[1,615 bytes] ‎CreeperBomb (talk | contribs) (Created page with "Coercionfulity, meaning "something with (much) coercion", is an esolang created by CreeperBomb in 2023. For short, it can also be referred to as "Coer". In it, numbers must be coerced into variables to do almost anything meaningful. Anything number that goes between a quote and an apostrophe (in that order) is replaced with the variable associated with that number. Other than that, Coer is very simple: every line...")
14:08, 30 May 2023 ‎Extension (hist | edit) ‎[1,817 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Extension''' is an esolang(s) by User:ChuckEsoteric08 to make FakeScript Turing-complete with as small additions as possible ==Specification== ===Version 1=== !label and goto commands were deleted. Variables a-z were added and #x would return value of variable x if [arg1] [arg2] If [arg1] [arg2] are equal would execute code between this command and matching endif input [arg1] Would set variable [arg1] to to user input set [arg1] Would concatenate every outp...")
10:06, 30 May 2023 ‎Llec (hist | edit) ‎[610 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "{{Stub}} '''llec''' is an esolang by User:ChuckEsoteric09. ==Specification== '''lecc'' operates on a tape of unbounded integers. *x would reference cell x. Cells are 0-indexed. There are 8 commands: +x - increment cell x -x - decrement cell x "x+y - increment cell x by the value of cell y, store result in cell x /x - declare label x \x - goto label x ?x=y - if cell x is y, skip next command 'x - set cell x to next byte of user input :x - output cell x as ASCI...")
23:00, 29 May 2023 ‎Expressive (hist | edit) ‎[3,264 bytes] ‎CreeperBomb (talk | contribs) (Created page with "Expressive is an esoteric programming language created by User:CreeperBomb in 2023. All programs are math expressions (hence the name "Expressive"), with some specific syntax/semantics that make it usable & Turing complete. ==Information== In every step, the expression is evaluated. Afterward, the result is stored. This repeats on to infinity* before it prints the final result. The initial value for the program is input. If a multivalued function is involved,...")
13:55, 29 May 2023 ‎TAML (hist | edit) ‎[4,117 bytes] ‎LabRicecat (talk | contribs) (Created page with "{{infobox proglang |name=TAML |paradigms=imperative declerative |author=User:LabRicecat |year=2021 |influence=ini |files=<code>.taml</code> }}'''TAML''', the ''Text Adventure Markup Language'', is an esoteric programming language with the goal to lay out the program as a kind of text adventure like tree structure. ==Language overview== A TAML program, called an ''Adventure'' consists of a set of ''Questions'', where each one has a fixed amo...")
02:56, 29 May 2023 ‎Iq (hist | edit) ‎[678 bytes] ‎Mmmph! (talk | contribs) (Created page with "'''Iq''' is a programming language created by User:Mmmph! for making HI9+ interpreters. == Overview == From HI9+: ::If the interpreter's source code is IQ, then IQ is a valid quine in both that variant of HI9+, and in HQ9+. So, why not make a programming language where you can make an interpreter for HI9+? == Instructions == * <code>I</code> gets input from the user * <code>Q</code> runs the input in HI9+ == Implementations == User:Mmmph! made...")
09:26, 28 May 2023 ‎MM1char (hist | edit) ‎[522 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''MM1char''' is description of 2-register Minsky machine with instructions: INC, DEC, JZ. It's goal is same as for StackBit: to be easily implementable. ==Syntax== + - increment register 1 - - decrement register 1 * - increment register 2 / - decrement register 2 [abc] - declare label abc (abc) - goto label abc ~ - if register 1 is zero skip next command ` - if register 2 is zero skip next command Category:Languages Category:Turing complete Catego...")
14:49, 27 May 2023 ‎A Queue which can't grow (hist | edit) ‎[615 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''A Queue which can't grow''' is an esolang by User:ChuckEsoteric08. ==Specification== '''A Queue which can't grow''' uses a queue of integers to store data. Its initial state is set to user input with elements being seperated by ; There are only two (three counting \ which is a nop) commands: | Which dequeues element, increments it, and enqueues result / Which dequeues element, If it's nonzero decrements it, and enqueues result. If it's zero it would enqueue z...")
14:42, 27 May 2023 ‎W (Viktor T. Toth) (hist | edit) ‎[2,982 bytes] ‎B jonas (talk | contribs) (Created page with "'''W''' is a compiled low-level programming language created by Viktor T. Toth in or before 2001. The goal of the language is to have a compiler that can be run on DOS 3 computers with a small amount of memory. The compiler host and target platform are both DOS x86 real mode with only a single segment used, so address space is limited to 64 kilobytes. The compiler is self-hosting implemented in W, though there is a (likely unpublished) C version as well. The language...")
16:30, 26 May 2023 ‎Suc (hist | edit) ‎[1,857 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Suc''' is an esolang by User:ChuckEsoteric08 based on a Succesor machine ==Specification== '''Suc''' uses unbounded amount of registers to store values. Line numbers are 0-indexed. There are only three commands: INC x y Increment register x by y. CLR x Set register x to zero. JEQ x y z If registers x and y are equal goto line z. There is also optional command which is used for debuging: OUT x Which outputs value of register x. And thats it! Now try do to...")
08:41, 26 May 2023 ‎SStack (hist | edit) ‎[2,708 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''SStack''' ('''S'''even '''S'''tacks) is an esolang by User:ChuckEsoteric08 inspired by Kipple and was designed as more powerful version of Sreg. ==Commands== '''SStack''' uses seven stacks:a, b, c, d, e, f and g. If you try to accsess empty stack then it would return 0. Decrementing zero is a nop >x/y< - pop element from stack x and push it to stack y +x/y+ - pop element from stack x, increment it and push it to stack y -x/y- - like +x/y+ but decrement...")
02:16, 25 May 2023 ‎Hell (hist | edit) ‎[1,272 bytes] ‎Alanmalan (talk | contribs) (new esolang :D)
19:44, 24 May 2023 ‎Befunge colored (hist | edit) ‎[2,509 bytes] ‎Cola man (talk | contribs) (First draft)
11:53, 24 May 2023 ‎Stack based (hist | edit) ‎[1,785 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Stack based''' is an esolang by User:ChuckEsoteric08 which is similiar to Queue based but it uses stack instead. ==Specificstion== '''Stack based''' uses three stacks as memory: a, b and c push x y Push x to stack y pop x Pop from stack x move x y Pop element from stack x and push it to stack y inp x Push input to stack x out x Pop element from stack x and output that element lbl x Declare label x rep x y z Similiar to [abc_xyz] in Queue based. Replace...")
05:29, 24 May 2023 ‎Five (hist | edit) ‎[1,344 bytes] ‎AndrewBayly (talk | contribs) (Created page with "Five is an esoteric programming language created by User:AndrewBayly")
15:59, 23 May 2023 ‎Queue based (hist | edit) ‎[1,697 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Queue based''' is an esolang by User:ChuckEsoteric08. The name does not only implies that it stores data in queues but also means that using Queue is based. It's main inspirations were Underload and Smurf ==Specification== '''Queue based''' stores data in two queues. When you go to nonexisting label or try to dequeue if queue is empty program will halt (abc) - enqueue string abc , - dequeue @ declare new label ; - switch to diffirent queue ' - dequeue...")
10:56, 23 May 2023 ‎Number-encoded Bitwise Cyclic Tag (hist | edit) ‎[571 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Number-encoded Bitwise Cyclic Tag''' is variant of Bitwise Cyclic Tag by User:ChuckEsoteric08 which was created to implement BCT in register-based languages like TLIJMMWTRAMCBICHWTPITCSIBCTII, Sreg or EsoBASIC. ==How it works== To convert Bitwise Cyclic Tag to Number-encoded Bitwise Cyclic Tag you should do this 2 (or 3) steps: # Reverse Program and Data strings # Append 1 to the beginning of each string # (only for BCT-in-Sreg and WIP BCT-in-EsoBA...")
07:39, 23 May 2023 ‎ABCstr (hist | edit) ‎[930 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''ABCstr''' is an esolang by User:ChuckEsoteric08 ==Specification== '''ABCstr''' uses string as memory. Initial string is "abc". There are three commands: x=y If there is instance of x in the string replace it with y, else goto label x x-y Works the same but also outputs x if there is x :x Works the same but will replace with user input. It is the only string-rewriting language created by User:ChuckEsoteric08 that has input ==Examples== ===Hello, World!===...")
16:41, 22 May 2023 ‎SBL (hist | edit) ‎[6,886 bytes] ‎Alex s168 (talk | contribs) (Created page with ""SBL" '''SBL''' is a stack-based programming language, which focuses on being easy to use. It consists of multiple code blocks, which can be called and executed. The code in a block will be executed line-by-line. One Line can contain multiple Operations*. "Instructions" SBL has the following commands: {| class="wikitable" !Code !Description |- | r || reverses the stack |- | r- || reverses the top x elements of the stack (x is popped from the stack) |- | . || pops and p...")
02:59, 22 May 2023 ‎Sequence (hist | edit) ‎[23 bytes] ‎AndrewBayly (talk | contribs) (Created page with "this article is a stub.")
17:04, 21 May 2023 ‎StackBit (hist | edit) ‎[912 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''StackBit''' is a Turing-complete esolang by User:ChuckEsoteric08 that is easy to implement. ==Specification== Data is stored in two stacks. 0 - push 0 to the current stack 1 - push 1 to the current stack ~ - switch to another stack [...] - while top of the stack is 1 * - pop top element There is also optional command for debuging: . - outputs top of the stack ==StackBit minimalisation== We could minimise number of instruction by combining ~ and 0 into co...")
13:34, 21 May 2023 ‎TriTape (hist | edit) ‎[1,795 bytes] ‎Joaozin003 (talk | contribs) (Created page with "'''TriTape''' is an esolang by User:Joaozin003 where each cell in the tape stores a trit (base-3 digit). == Storage == As said in the intro, there is a tape (note: infinite only to the right!) that stores one trit in each cell. There is also an accumulator which stores one trit. This accumulator is independent from the tape, but operations can be performed on the two. == Instructions == Here is a table of instructions: I | Meaning ^ | Increment the accumulato...")
11:48, 19 May 2023 ‎NASAL (hist | edit) ‎[1,162 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''NASAL''' is an esolang by User:ChuckEsoteric08. ==Specification== '''NASAL''' uses stack as memory. If program contains invalid character it's an error. {| class="wikitable" |- ! Command !! Function |- | <code>mx</code> || push <code>x</code> to the stack |- | <code>ɱ</code> || pop and discard |- | <code>ɳx</code> || while top!=<code>x</code> |- | <code>ɲ</code> || end while |- | <code>ŋ</code> || move element from top to bottom |- | <code>ɴ</code> || move el...")
03:36, 19 May 2023 ‎Desmoslang (hist | edit) ‎[2,830 bytes] ‎Dadsdy (talk | contribs) (Created page with "= Desmoslang = Read Desmos-lang, it is a programming language designed to use Desmos's abilities. = Link = [https://www.desmos.com/calculator/ncwnjkg1rr Link] = Script = [https://github.com/theRealDadsdy/Desmos-Userscript/blob/main/Desmos%20Programming%20Language/script.js Script] = Usage = Go to the link, and run the script (potentially multiple times). = Programming = It's a programming language, so it has a way to program it. Input your program as a comma seperat...")
23:18, 18 May 2023 ‎Auphics (hist | edit) ‎[8,467 bytes] ‎BoundedBeans (talk | contribs) (Created page with "Auphics is an esoteric programming language by User:BoundedBeans featuring: * Graphical Input * Audio output * Tree variables ==Variables and expressions== All variables in Auphics are immutable binary trees of signed 64-bit integers. Expressions are either trees or integers. The variables can be reassigned, but the underlying trees cannot be modified. To create a tree: <code>(name) = :(number of levels);</code> <code>var = :<3<;</code> :(expression) is its...")
14:20, 18 May 2023 ‎Standard Chess (hist | edit) ‎[4,114 bytes] ‎MasterWoodie (talk | contribs) (Created page with "{{infobox proglang |name=Short O |author=user:MasterWoodie |year=2023 |refimpl=[https://woodiemaster.github.io/MasterWoodie.github.io/shortOLang.html MasterWoodie Homepage] |memsys=stack-based |class=Turing complete (Probably) |files=<code>.sho</code> }} ShortO (Short Output, .sho) is designed to easily output text. It was created by user:MasterWoodie in 2023 == Description == ShortO is a stack based langua...")
23:09, 17 May 2023 ‎Broken Gdy Brainfuck (hist | edit) ‎[4,570 bytes] ‎Gadai (talk | contribs) (Created page with "'''Broken-Gdy-Brainfuck''' is a derivate of Brainfuck but with ABCDEFG. This is Gdy_Brainfuck with the ability to generate random errors and force termination. == Commands == {| class="wikitable" style="text-align:center" |- ! Brainfuck ! GdyBrainfuck |- | <code><nowiki>+</nowiki></code> | a |- | <code><nowiki>-</nowiki></code> | b |- | <code><nowiki>.</nowiki></code> | d(text) e(number) |- | <code><nowiki>,</nowiki></code> | None |- | <code><nowiki><</nowiki...")
20:51, 17 May 2023 ‎Gdy Brainfuck (hist | edit) ‎[3,913 bytes] ‎Gadai (talk | contribs) (Created page with "'''Gdy-Brainfuck''' is a derivate of Brainfuck but with ABCDEFG. == Commands == {| class="wikitable" style="text-align:center" |- ! Brainfuck ! GdyBrainfuck |- | <code><nowiki>+</nowiki></code> | a |- | <code><nowiki>-</nowiki></code> | b |- | <code><nowiki>.</nowiki></code> | d(text) e(number) |- | <code><nowiki>,</nowiki></code> | None |- | <code><nowiki><</nowiki></code> | A |- | <code><nowiki>></nowiki></code> | B |- | <code><nowiki>None</nowiki></code> |...")
20:30, 17 May 2023 ‎Listfunc (hist | edit) ‎[5,048 bytes] ‎CreeperBomb (talk | contribs) (Created page with "Listfunc, listfunk, or listpunc (pun on "listfunc" and "__punk") are the names of a language created by User:CreeperBomb in 2023. All functions have a name, input(s), and output(s). The structure is illustrated in these examples: <pre>f(x, y): x (x, y).swapped@#$%^@&@~`: y, x foo (bar)electric boogAló0 ŋ: bar, bar, bar, f(bar, bar) (input1)mod(input1): 0</pre> Only colons, commas, parenthesis, and newlines aren't allowed in argument names, outputs, and functi...")
10:23, 17 May 2023 ‎NABC (hist | edit) ‎[1,381 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''NABC''' is an esolang by User:ChuckEsoteric08 in which command is defined by number of a, b and c. ==Specification== d is used to seperate commands. Data is stored in Accumulator and stack. Line numbers are 0-indexed. <code>n(x)</code> means "number of symbol X". {| class="wikitable" |- ! Name || Number of A || Number of B || Number of C !! Meaning |- | inc x || 1 || 2 || x || Increment Accumulator by n(c) |- | dec x || 1 || 2 || x || Decrement Accumulator by n...")
02:06, 17 May 2023 ‎XMLang (hist | edit) ‎[17,413 bytes] ‎Balt (talk | contribs) (Still working on it)
17:49, 16 May 2023 ‎Capitalsim (hist | edit) ‎[5,537 bytes] ‎Squidmanescape (talk | contribs) (Created page with "{{stub}} {{WIP}} Capitalsim is a programming language created in 2023 based on the idea of capitalism and wage labor, partially based on Haczyk. Capitalsim and Haczyk will probably be developed in parallel due to the similarities between the two, and due to Haczyk being a simpler language than Capitalsim in terms of programming. == What Needs to be Created == * Bank: ** it creates dollars ** the variable has to go to the bank to get dollars ** capitalists earn d...")
03:51, 16 May 2023 ‎Wise (hist | edit) ‎[4,222 bytes] ‎DivergentClouds (talk | contribs) (Created page with " {{infobox proglang |name=Wise |paradigms=procedural, imperative |author=User:DivergentClouds |year=2023 |memsys=stack-based |dimensions=one-dimensional |class=Unknown |files=<code>.wise</code>, <code>.wis</code> }} '''Wise''' is a stack-based language created by DivergentClouds. == Overview == Wise is based on an extension of bitwise operations for bases ≥ 2. There are 3...")
16:50, 14 May 2023 ‎CQfuck (hist | edit) ‎[237 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "{{Stub}} '''CQfuck''' is an esolang by User:ChuckEsoteric08 where <code>[</code> and <code>]</code> use Call Queue instead. ==Examples== ===Cat Program=== ,[.,] Category:Languages Category:Unknown computational class")
16:56, 13 May 2023 ‎Let's Rewrite String! (hist | edit) ‎[942 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''Let's Rewrite String!''' is an esolang by User:ChuckEsoteric08 inspired by Novice ==Specification== The language has unbounded string memory, which initial value is set to user input. Anything that isn't a command would declare label with that name. There are Two commands in the language: x=y If string contains x and there exist label x, then x would be replaced with y and IP jumps to label x x-y Works the same but it would also print y if statement is t...")
15:31, 13 May 2023 ‎Bus 581 (hist | edit) ‎[1,172 bytes] ‎Hakerh400 (talk | contribs) (+Bus 581)
12:55, 13 May 2023 ‎SEPL (hist | edit) ‎[1,124 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''SEPL'''('''S'''atan's '''E'''soteric '''P'''rogramming '''L'''anguage) is an esolang by User:ChuckEsoteric08. ==Specification== Instead of ASCII characters it uses "Table". It looks like this: ABCDEFGHIJKLMNOPQRSTUVWXYZ !@#$%^&*(){}[],.:;"'?/\=-_+|0123456789<>~` Last two characters are newline and nothing. '''SEPL''' stores data in tape but also has four registers: A and B - Accumulators C - Code Pointer D - Data Pointer To have opcode it takes cu...")
09:42, 13 May 2023 ‎TACC (hist | edit) ‎[749 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''TACC''' is an esolang by User:ChuckEsoteric08 which is mix of Uppercase=Lowercase and Sreg. ==Specification== '''TACC''' uses Tape and Accumulator to store values. Cell indexes start with 1. CP is cell pointer. :X - set CP to X > - set CP to accumulator < - set accumulator to cell pointed by CP ^ - set cell pointed by CP to accumulator +X - increment accumulator by X -X - decrement accumulator by X if result was negative set cell to 0 !X - skip next...")
09:23, 13 May 2023 ‎CDILOI (hist | edit) ‎[1,552 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''CDILOI''' ('''C'''oncatenate, '''D'''elete, '''I'''f, '''L'''abel, '''O'''utput, '''I'''nput) is an esolang by User:ChuckEsoteric08 which was inspired by Gray Snail. ==Specification== '''CDILOI''' uses unbounded variables to store data. The language is case-insnsitive. Note that because it uses space to split arguments strings can't contain spaces <code>@x</code> returns value of variable x. If variable with that name dosen't exist, then create it and set it'...")
08:54, 13 May 2023 ‎Squiggle (hist | edit) ‎[970 bytes] ‎Janbsh (talk | contribs) (Created page with "{{infobox proglang |name=Squiggled |paradigms=Imperative |author=Janbsh |year=2023 |refimpl=[https://janbsh.com/squiggle.html] ||class=Turing Complete }} == About == Squiggle is an esoteric programming language that uses squiggles ("~") to represent integer values and arithmetic operators to perform calculations. == Syntax == The syntax of Squiggle is simple and intuitive. Integer values are represented u...")
16:05, 12 May 2023 ‎Functress (hist | edit) ‎[939 bytes] ‎Hakerh400 (talk | contribs) (+Functress)
15:43, 12 May 2023 ‎ASRL? (hist | edit) ‎[957 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''ASRL?''' ('''A'''nother '''S'''tring-'''R'''ewriting '''L'''anguage?) is an esolang by User:ChuckEsoteric08 which was inspired by Novice. ==Specification== '''ASRL?''' uses unbouned string as memory. Initial state of it is set to user input. There is three commands: !x - declares label x=y - if there is instance of x in memory string, replace it with y, else goto label y :: - outputs memory string ==Computational class== '''ASRL?''' is Turing-complete b...")
11:17, 12 May 2023 ‎TailDot (hist | edit) ‎[1,294 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''TailDot''' is an esolang by User:ChuckEsoteric08 based on his old esolangs. ==Specification== '''TailDot''' consits of "words", which are string of characters seperated by commas and 1-indexed. It uses three variables that store integers: a, b and c and three variables that store strings: x, y and z. All TailDot Programs are written in one line. ===Commands=== <code>[arg''n'']</code> is and argument <code>n</code>. a - increment integer variable [arg1] by value [...")
16:29, 11 May 2023 ‎... (hist | edit) ‎[906 bytes] ‎RandomIdiot (talk | contribs) (Created page with "This will be the dumbest - i mean best - esolang i have ever created. Coming soon. Stay tuned.")
00:09, 10 May 2023 ‎Trigational Pseudoomninumitype (hist | edit) ‎[2,250 bytes] ‎CreeperBomb (talk | contribs) (Say that 5 times fast)
17:43, 9 May 2023 ‎SSREPL (hist | edit) ‎[817 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "'''SSREPL'''('''S'''imple '''S'''tring-'''R'''ewriting '''E'''soteric '''P'''rogramming '''L'''anguage) is an esolang by User:ChuckEsoteric08. ==Specification== Initial value Data String is taken from user input. Line numbers are 1-indexed. There is only one instruction: x=y!z If there is <code>x</code> in Data String replace it with <code>y</code>, else goto line <code>z</code>. ==Computational class== '''SSREPL''' is Turing complete, which is proven by this Cyclic...")
11:02, 9 May 2023 ‎Decleq (hist | edit) ‎[520 bytes] ‎ChuckEsoteric08 (talk | contribs) (Created page with "{{Stub}} '''Decleq''' ('''Dec'''rement and jump if '''L'''ess or '''Eq'''ual to zero) is an OISC by User:ChuckEsoteric08 inspired by P1eq. ==Command== a b c Means: <code>b=a-1</code> and jump to <code>c</code> if <code>b</code> is less or equal to zero. ==Memory-mapped I/O== It is optional a -1 c Outputs <code>a</code> -1 b c Set <code>b</code> to user input. Category:Languages Category:Turing complete Category:Turing tarpits Category:OISC...")
22:17, 7 May 2023 ‎DAWBridge (hist | edit) ‎[8,504 bytes] ‎BoundedBeans (talk | contribs) (Created page with "DAWBridge is the ultimate challenge for those that are programmers, musicians, and masochists simultaneously. It was made by User:BoundedBeans. ==Etymology== A "DAW" is a Digital Audio Workstation. (Ableton Live is one, and this language attempts to compile an Ableton Live project (although it may not succeed).) The name is a pun on "drawbridge" (while the language has absolutely no connection with drawbridges, it does act as a "bridge" to a "DAW", even if in a very...")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

New pages

Navigation menu

Search