git @ Cat's Eye Technologies Befunge-93 / rel_2_23_2012_0825 eg / index.html
rel_2_23_2012_0825

Tree @rel_2_23_2012_0825 (Download .tar.gz)

index.html @rel_2_23_2012_0825raw · history · blame

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
<html>
<head>
<title>Cat's Eye Technologies: Befunge Source Code (*.bf)</TITLE>
<meta http-equiv="Content-Type" content="text/html;CHARSET=iso-8859-1">
</head>
<body>
<h1>Befunge-93 Example Programs</h1>

<table border="0" width="100%"><tr>
 <th>Name</th>
 <th>Author</th>
 <th>Date</th>
 <th>Notes</th>
</tr>
<tr> <td><a href="anagram.bf">anagram.bf</a></td>
 <td>Kalyna Zazelenchuk</td>
 <td>1/1/93</td>
 <td>This program will input a string of sixteen characters or less, and (p)ut those characters in order on line 3 (the line with the *'s).  It will then randomly find numbers from 1 to 16, (g)et the characters at line 3 in random order, replace them with *'s, and print them out.  Effectively produces anagrams of words you type in.  It uses the code from 'rand2.bf' to generate random numbers.</td>
</tr>
<tr> <td><a href="aturley.bf">aturley.bf</a></td>
 <td>Andrew Turley</td>
 <td>1/1/2999</td>
 <td>aturley's .sig; cellular automata gasket generator.</td>
</tr>
<tr> <td><a href="beer.bf">beer.bf</a></td>
 <td>Kevin Vigor</td>
 <td>4/9/97</td>
 <td>A simple program that prints the "beer song" (99 bottles of beer on the wall...) from 99 down to 0.  Part of the Beer Song archive.</td>
</tr>
<tr> <td><a href="beer10.bf">beer10.bf</a></td>
 <td>Chris Lahey</td>
 <td>6/8/97</td>
 <td>A squashed (22x10) beer singing program, gramatically correct.</td>
</tr>
<tr> <td><a href="beer2.bf">beer2.bf</a></td>
 <td>Keith Arner</td>
 <td>4/10/97</td>
 <td>Another "99 Bottles of Beer" program.</td>
</tr>
<tr> <td><a href="beer3.bf">beer3.bf</a></td>
 <td>Chris Lahey</td>
 <td>4/11/97</td>
 <td>Another singing algorithm.</td>
</tr>
<tr> <td><a href="beer4.bf">beer4.bf</a></td>
 <td>Denis Moskowitz</td>
 <td>4/11/97</td>
 <td>Yet another singing algorithm.</td>
</tr>
<tr> <td><a href="beer5.bf">beer5.bf</a></td>
 <td>David Johnston</td>
 <td>4/11/97</td>
 <td>Another singing program.</td>
</tr>
<tr> <td><a href="beer6.bf">beer6.bf</a></td>
 <td>Chris Lahey</td>
 <td>4/11/97</td>
 <td>A crammed (14x21) singing program.</td>
</tr>
<tr> <td><a href="beer7.bf">beer7.bf</a></td>
 <td>Wim Rijnders</td>
 <td>5/2/97</td>
 <td>A beer bottling program.</td>
</tr>
<tr> <td><a href="beer8.bf">beer8.bf</a></td>
 <td>Wim Rijnders</td>
 <td>5/12/97</td>
 <td>Again with the bottles.</td>
</tr>
<tr> <td><a href="beer9.bf">beer9.bf</a></td>
 <td>David Johnston</td>
 <td>5/13/97</td>
 <td>Crammed (22x9) singing beer program which doesn't use good grammar or punctuation.</td>
</tr>
<tr> <td><a href="befbef.bf">befbef.bf</a></td>
 <td>Wim Rijnders</td>
 <td>5/12/97</td>
 <td>A small subset Befunge-93 interpreter written in Befunge-93.  Barely smart enough to execute the helloworld program within the #-delimited block.  Runs like a cow.</td>
</tr>
<tr> <td><a href="befunge1.bf">befunge1.bf</a></td>
 <td>Denis Moskowitz</td>
 <td>7/17/97</td>
 <td>Befunge logo source.</td>
</tr>
<tr> <td><a href="befunge2.bf">befunge2.bf</a></td>
 <td>Sam Holden</td>
 <td>7/17/97</td>
 <td>Befunge logo source.</td>
</tr>
<tr> <td><a href="befunge3.bf">befunge3.bf</a></td>
 <td>Ben Olmstead</td>
 <td>7/18/97</td>
 <td>Befunge logo source.</td>
</tr>
<tr> <td><a href="befunge4.bf">befunge4.bf</a></td>
 <td>Kevin Vigor</td>
 <td>8/13/97</td>
 <td>Befunge logo source.</td>
</tr>
<tr> <td><a href="befungex.bf">befungex.bf</a></td>
 <td>Kevin Vigor</td>
 <td>7/18/97</td>
 <td>Non-standard (oversize) Befunge logo source.</td>
</tr>
<tr> <td><a href="calc.bf">calc.bf</a></td>
 <td>Bryan L</td>
 <td>4/10/97</td>
 <td>This is a befunged calculator.  Meaning ".", the print command, will also pop the result off the stack.  Fortunately, the duplication command ":" is supported.  This calculator will blithely ignore anything that isn't a number or a supported command.  The list of commands is found on line 3.</td>
</tr>
<tr> <td><a href="cascade.bf">cascade.bf</a></td>
 <td>Chris Pressey</td>
 <td>7/20/97</td>
 <td>Like copyme.bf, but continues to replicate itself.</td>
</tr>
<tr> <td><a href="chars.bf">chars.bf</a></td>
 <td>Kalyna Zazelenchuk</td>
 <td>1/1/93</td>
 <td>Generates a printable ASCII table, with characters and corresponding codes in decimal, from 34 to 127.</td>
</tr>
<tr> <td><a href="copyme.bf">copyme.bf</a></td>
 <td>Wim Rijnders</td>
 <td>6/5/97</td>
 <td>Program which reproduces itself in Befunge-space.</td>
</tr>
<tr> <td><a href="dladv.bf">dladv.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>12/1/96</td>
 <td>A minimalist adventure game.<br>
  n - go north<br>
  s - go south<br>
  e - go east<br>
 w - go west<br>
 d - dress<br>
  l - labour</td>
</tr>
<tr> <td><a href="drx.bf">drx.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>"Like Eliza, except better :-)"</td>
</tr>
<tr> <td><a href="ea.bf">ea.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>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.</td>
</tr>
<tr> <td><a href="easm.bf">easm.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>Same as 'ea.bf', but uses self-modifying code.</td>
</tr>
<tr> <td><a href="euclid.bf">euclid.bf</a></td>
 <td>Greg Wright</td>
 <td>6/5/97</td>
 <td>Euclidean algorithm.</td>
</tr>
<tr> <td><a href="fact.bf">fact.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>Asks for a number, and supplies the factorial of that number.</td>
</tr>
<tr> <td><a href="fact2.bf">fact2.bf</a></td>
 <td>Jason Reed</td>
 <td>5/18/97</td>
 <td>Factorial generator, (3x12)</td>
</tr>
<tr> <td><a href="fact3.bf">fact3.bf</a></td>
 <td>Chris Lahey</td>
 <td>6/8/97</td>
 <td>(23x1) factorial generator.</td>
</tr>
<tr> <td><a href="hello.bf">hello.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>The ubiquitous "Hello, World!" program.</td>
</tr>
<tr> <td><a href="hex.bf">hex.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>Translates ASCII input into hex output.</td>
</tr>
<tr> <td><a href="hwii.bf">hwii.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>Prints out "Hello, World!' forwards, then backwards, then forwards, etc.  Demonstrates how one can so easily change the direction of the PC to support their own wicked desires.</td>
</tr>
<tr> <td><a href="life.bf">life.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>6/1/97</td>
 <td>An implementation of John Conway's game of Life.</td>
</tr>
<tr> <td><a href="madd.bf">madd.bf</a></td>
 <td>Greg Wright</td>
 <td>6/5/97</td>
 <td>3x3-Matrix Addition</td>
</tr>
<tr> <td><a href="mandel.bf">mandel.bf</a></td>
 <td>Chris Lahey</td>
 <td>4/11/97</td>
 <td>A Mandelbrot fractal generator.</td>
</tr>
<tr> <td><a href="maze.bf">maze.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator.</td>
</tr>
<tr> <td><a href="namegame.bf">namegame.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>2/1/96</td>
 <td>"First, example easy writed stupid prog."  Befunge bypasses cultural and lingual backgrounds.  Try this "easily written" program and see what it does.</td>
</tr>
<tr> <td><a href="numer.bf">numer.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>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.)</td>
</tr>
<tr> <td><a href="pairing.bf">pairing.bf</a></td>
 <td>Aaron Dale</td>
 <td>3/20/97</td>
 <td>A program to implement the "pairing function" (&lt;x1,x2&gt; = (2^(x1) * (2*(x2) + 1)) - 1), which maps any two natural numbers onto the set of natural numbers, without repetition.</td>
</tr>
<tr>
 <td><a href="pangram.bf">pangram.bf</a></td>
 <td>Chris Pressey</td>
 <td>8/25/12</td>
 <td>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.
 </td>
</tr>
<tr> <td><a href="pascserp.bf">pascserp.bf</a></td>
 <td>Chris Pressey</td>
 <td>7/12/97</td>
 <td>Generates a gasket (Serpinsky triangle) using Pascal's Triangle.</td>
</tr>
<tr> <td><a href="pi.bf">pi.bf</a></td>
 <td>Ben Olmstead</td>
 <td>6/25/97</td>
 <td>Produces the first hundred digits of pi in under one hundred characters of Befunge, but cheats in that it simply decompresses the digits encoded in the source code.</td>
</tr>
<tr> <td><a href="pi2.bf">pi2.bf</a></td>
 <td>Kevin Vigor</td>
 <td>7/2/97</td>
 <td>Generates the first hundred digits of Pi.  It does this not by cheating, but actually calculating Pi; unfortunately it far exceeds 100 characters of Befunge code.</td>
</tr>
<tr> <td><a href="prime.bf">prime.bf</a></td>
 <td>Kalyna Zazelenchuk</td>
 <td>1/1/93</td>
 <td>Lists the counting numbers incrementally from one and checks if each is prime.</td>
</tr>
<tr> <td><a href="rand.bf">rand.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator.</td>
</tr>
<tr> <td><a href="rand10.bf">rand10.bf</a></td>
 <td>Ken Bateman</td>
 <td>4/12/97</td>
 <td>A 3x10 random number generator.</td>
</tr>
<tr> <td><a href="rand11.bf">rand11.bf</a></td>
 <td>Ken Bateman</td>
 <td>4/12/97</td>
 <td>A 5x7 flexible random number generator.  The number of bits is set with the 88+ at the top left.  As shown this program will generate a random number from 0 to 32767.</td>
</tr>
<tr> <td><a href="rand12.bf">rand12.bf</a></td>
 <td>Ben Olmstead</td>
 <td>4/24/97</td>
 <td>A 2x13, 0..255  random number generator.</td>
</tr>
<tr> <td><a href="rand13.bf">rand13.bf</a></td>
 <td>Ben Olmstead</td>
 <td>4/24/97</td>
 <td>A 2x12, infinitely looping 0..31 random number generator.</td>
</tr>
<tr> <td><a href="rand14.bf">rand14.bf</a></td>
 <td>Greg Wright</td>
 <td>5/18/97</td>
 <td>4x7 random number generator.</td>
</tr>
<tr> <td><a href="rand15.bf">rand15.bf</a></td>
 <td>Artyom Baranov</td>
 <td>4/5/96</td>
 <td>THE smallest Befunge RNG-16. (16x1)</td>
</tr>
<tr> <td><a href="rand2.bf">rand2.bf</a></td>
 <td>Kalyna Zazelenchuk</td>
 <td>1/1/93</td>
 <td>This program, crammed into a 14x14 block, makes random numbers from 1 to 16 using multiple "?" statements.</td>
</tr>
<tr> <td><a href="rand3.bf">rand3.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>12x9 random number generator, like rand.bf and rand2.bf.</td>
</tr>
<tr> <td><a href="rand4.bf">rand4.bf</a></td>
 <td>Matthew D Moss</td>
 <td>2/1/96</td>
 <td>A 7x7 random number generator in the tradition of rand.bf .. rand3.bf, but using mathematics to reduce the problem before writing the code</td>
</tr>
<tr> <td><a href="rand5.bf">rand5.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>2/1/96</td>
 <td>A 4x10 random number generator which produces the same output as rand.bf .. rand4.bf.  Unlike most Befunge sources this one has a symmetrical beauty to it.</td>
</tr>
<tr> <td><a href="rand6.bf">rand6.bf</a></td>
 <td>Artyom Baranov?</td>
 <td>12/1/96</td>
 <td>An 8x4 random number generator a la rand5.bf.</td>
</tr>
<tr> <td><a href="rand7.bf">rand7.bf</a></td>
 <td>???</td>
 <td>12/1/96</td>
 <td>A 13x3 random number generator a la rand5.bf and rand6.bf.</td>
</tr>
<tr> <td><a href="rand8.bf">rand8.bf</a></td>
 <td>Chris Howe</td>
 <td>4/9/97</td>
 <td>A 4x9 flexible random number generator; if you change the 4 in position (1,2) to another integer n it will generate a number between 1 and 2^n (inclusive) for 0&lt;n&lt;9.</td>
</tr>
<tr> <td><a href="rand9.bf">rand9.bf</a></td>
 <td>Chris Lahey</td>
 <td>4/11/97</td>
 <td>A 3x7 random number generator.</td>
</tr>
<tr> <td><a href="rdp.bf">rdp.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>2/1/96</td>
 <td>A command-line calculator with postfix notation.</td>
</tr>
<tr> <td><a href="rdp2.bf">rdp2.bf</a></td>
 <td>Kimberley Burchette</td>
 <td>12/1/96</td>
 <td>A version of rdp.bf crammed into a 23x12 block.</td>
</tr>
<tr> <td><a href="robot.bf">robot.bf</a></td>
 <td>Chris Pressey</td>
 <td>1/1/93</td>
 <td>You control an 'O' going through a maze of '*''s.  You can type in 'n', 's', 'e', or 'w', and the 'O' travels in that map direction.  This not-particularly-challenging game ends when you hit a '*'.</td>
</tr>
<tr> <td><a href="rot13.bf">rot13.bf</a></td>
 <td>???</td>
 <td>9/11/97</td>
 <td>Performs the rot13 algorithm.</td>
</tr>
<tr> <td><a href="selflis2.bf">selflis2.bf</a></td>
 <td>Chris Pressey</td>
 <td>12/1/96</td>
 <td>A self-repoducing 80x1 program.  This program can also be used to test for the @ vs StringMode bug.</td>
</tr>
<tr> <td><a href="selflis3.bf">selflis3.bf</a></td>
 <td>Kevin Vigor</td>
 <td>5/28/97</td>
 <td>A 14-byte Quine (self-reproducing program.)</td>
</tr>
<tr> <td><a href="selflis5.bf">selflis5.bf</a></td>
 <td>David Johnston</td>
 <td>5/7/97</td>
 <td>Crammed (14x6) self-listing program.</td>
</tr>
<tr> <td><a href="selflis6.bf">selflis6.bf</a></td>
 <td>Denis Moskowitz</td>
 <td>5/8/97</td>
 <td>14-byte quine.</td>
</tr>
<tr> <td><a href="selflist.bf">selflist.bf</a></td>
 <td>Andrew Turley?</td>
 <td>12/1/196</td>
 <td>A self-reproducing Befunge program, 13x4.</td>
</tr>
<tr> <td><a href="serp.bf">serp.bf</a></td>
 <td>Kevin Vigor</td>
 <td>4/9/97</td>
 <td>Generates and prints a Serpinsky triangle, a simple type of fractal. Since the resolution is 20x30, the detail of the fractal isn't really visible, but hey, what can you do?</td>
</tr>
<tr> <td><a href="serp2.bf">serp2.bf</a></td>
 <td>Kevin Vigor</td>
 <td>4/10/97</td>
 <td>Improved Serpinsky Triangle generator.</td>
</tr>
<tr> <td><a href="sinus.bf">sinus.bf</a></td>
 <td>Dmitry M Litvinov</td>
 <td>12/1/96</td>
 <td>Program to generate sine wave patterns.<br>
Based on cos(a+b)=cos(a)*cos(b)-sin(a)*sin(b) and sin(a+b)=sin(a)*cos(b)+cos(a)*sin(b).  sin and cos values are kept in one stack cell = abs(sin) * 2^16 + abs(cos)</td>
</tr>
<tr> <td><a href="sort.bf">sort.bf</a></td>
 <td>Kalyna Zazelenchuk</td>
 <td>1/1/93</td>
 <td>Same as anagram.bf, except sorts the letters of your word in ascending order.</td>
</tr>
<tr> <td><a href="surprise.bf">surprise.bf</a></td>
 <td>???</td>
 <td>6/1/97</td>
 <td>A big surprise.</td>
</tr>
<tr> <td><a href="switchbx.bf">switchbx.bf</a></td>
 <td>Zach Baker</td>
 <td>7/10/97</td>
 <td>A real purty 'switch' statement.</td>
</tr>
<tr>
 <td><a href="testbrdg.bf">testbrdg.bf</a></td>
 <td>Chris Pressey</td>
 <td>10/27/11</td>
 <td>Tests whether the # instruction interacts properly with wrapping.</td>
</tr>
<tr>
 <td><a href="testmodu.bf">testmodu.bf</a></td>
 <td>Chris Pressey</td>
 <td>8/23/11</td>
 <td>Tests how your implementation of Befunge-93 calculates modulus
     (there is no right way.)</td>
</tr>
<tr> <td><a href="toupper.bf">toupper.bf</a></td>
 <td>Chris Pressey</td>
 <td>9/1/93</td>
 <td>Converts letters to upper-case.  An example of the ` (greater) statement.</td>
</tr>
<tr> <td><a href="wumpus.bf">wumpus.bf</a></td>
 <td>Wim Rijnders</td>
 <td>8/15/97</td>
 <td>The classic game of Hunt the Wumpus!</td>
</tr>
</table>
</body>
</html>