git @ Cat's Eye Technologies Befunge-93 / cell-signedness-examples
Postpone changes not pertaining to signedness to a future commit. Chris Pressey 3 years ago
2 changed file(s) with 5 addition(s) and 5 deletion(s). Raw diff Collapse all Expand all
3333 | [chars2.bf](chars2.bf) | | ??? | ?/?/9? | Modified version of chars.bf that was distributed as chars.bf for the longest time. Outputs all chars on 1 line. Program is 3 rows tall instead of 2. Unclear who made these modifications, or why.
3434 | [chars3.bf](chars3.bf) | | Chris Pressey | 5/29/118 | Modified version of chars2.bf that does not use stringmode and thus can be compiled by bef2c.
3535 | [copyme.bf](copyme.bf) | CC0 | Wim Rijnders | 6/5/97 | Program which reproduces itself in Befunge-space.
36 | [digitalr.bf](digitalr.bf) | | Keymaker | 9/3/108 | Claims to computes the digital root of the input (like `numer.bf`) but the exact method is uses is unclear. Perhaps this makes it even better suited to numerological divination? Anyway, the input must be terminated with ASCII NUL (character 0; can sometimes be typed in as Ctrl+@.)
36 | [digitalr.bf](digitalr.bf) | | Keymaker | 9/3/108 | Computes the digital root (see numer.bf) of the input.
3737 | [dladv.bf](dladv.bf) | CC0 | Dmitry M Litvinov | 12/1/96 | A minimalist adventure game. n - go north. s - go south. e - go east. w - go west. d - dress. l - labour.
3838 | [drx.bf](drx.bf) | CC0 | Chris Pressey | 9/5/93 | "Like Eliza, except better :-)"
3939 | [ea.bf](ea.bf) | CC0 | Chris Pressey | 9/5/93 | Makes 'enigmatic aphorisms.' A loose interpretation of a program in '1001 things to do with your Commodore 64.' This is an example of how to simulate a 'gosub' with a value.
5454 | [mandel.bf](mandel.bf) | | Chris Lahey | 4/11/97 | A Mandelbrot fractal generator.
5555 | [maze.bf](maze.bf) | CC0 | Chris Pressey | 9/5/93 | A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator.
5656 | [namegame.bf](namegame.bf) | CC0 | Dmitry M Litvinov | 2/1/96 | "First, example easy writed stupid prog." Befunge bypasses cultural and lingual backgrounds. Try this "easily written" program and see what it does.
57 | [numer.bf](numer.bf) | CC0 | Chris Pressey | 9/5/93 | Produces single-digit numerological equivalents of words you type in. Words should consist of lowercase letters and be terminated by a linefeed character. (Users should be warned that the significance of the output of this program is of extremely questionable practical value. But it is consistant.) (This algorithm could be known as taking the "digital root of the word".)
57 | [numer.bf](numer.bf) | CC0 | Chris Pressey | 9/5/93 | Produces single-digit numerological equivalents of words you type in. (Users should be warned that the significance of the output of this program is of extremely questionable practical value. But it is consistant.) (This algorithm is also known as the "digital root".)
5858 | [pairing.bf](pairing.bf) | | Aaron Dale | 3/20/97 | A program to implement the "pairing function" (\<x1,x2\> = (2\^(x1) \* (2\*(x2) + 1)) - 1), which maps any two natural numbers onto the set of natural numbers, without repetition.
5959 | [pangram.bf](pangram.bf) | CC0 | Chris Pressey | 8/25/112 | Checks if the first line of input is a pangram -- a sentence which contains all the letters of the alphabet, such as "The quick brown fox jumps over the lazy dog" or "Pack my lunch box with five dozen liquor jugs." Case-insensitive, and ignores most punctuation, but "high" punctuation (above ASCII character 90) will likely confuse it.
6060 | [pascserp.bf](pascserp.bf) | CC0 | Chris Pressey | 7/12/97 | Generates a gasket (Serpinsky triangle) using Pascal's Triangle.
0 000p>~:25*-!#v_"a"-1+00g+00p> 00g9`#v_v
1 @.g00< vp00+%*52g00 /*52g00<
2 ^ ># ^# <
0 000p>~:25*-!#v_"a"-1+00g+00p>00g9`#v_v
1 @.g00< vp00+%*52g00/*52g00<
2 ^ ># ^# <