Category:Befunge: Difference between revisions
(added a bit more info about "funges" in general; unlinked Unefunge and Trefunge; added links to wp and "standards") |
m (typo) |
||
| (2 intermediate revisions by one other user not shown) | |||
Line 1:
{{language|Befunge}}
'''Befunge''' is an esoteric programming language invented by Chris Pressey in 1993. It is unusual for having a two-dimensional toroidal code space. Commands are single characters
The '96 and '97 versions are now largely considered abandoned, and while '''Funge-98''' did gain a certain amount of traction, it has never been as widely adopted as the original '''Befunge-93'''. Being considerably more complex than the original, it is often deemed "too complicated" and sometimes even "too normal".
==See also==
* [http://github.com/catseye/Befunge-93/blob/master/doc/Befunge-93.markdown Befunge-93 Specification]
* [http://github.com/catseye/Funge-98/blob/master/doc/funge98.markdown Funge-98 Specification]
* [[wp:Esoteric programming language#Funges|Funges on Wikipedia]]
* [[eso:Befunge|Befunge on Esolangs]]
[[Category:Esoteric Languages]]
| |||
Latest revision as of 18:21, 9 April 2016
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
Befunge is an esoteric programming language invented by Chris Pressey in 1993. It is unusual for having a two-dimensional toroidal code space. Commands are single characters, and the instruction pointer can move up, down, left, and right across the source. One of the original goals of the language was to be as hard to compile as possible.
In the latter part of the 90s, several attempts were made to extend the language, with mutually incompatible versions proposed in '96, '97 and '98. It was at this time that the idea of variant dimensions were introduced, with Unefunge (one-dimensional), Trefunge (three-dimensional) and Nefunge (N-dimensional) - the general language class then being refered to as a Funge.
The '96 and '97 versions are now largely considered abandoned, and while Funge-98 did gain a certain amount of traction, it has never been as widely adopted as the original Befunge-93. Being considerably more complex than the original, it is often deemed "too complicated" and sometimes even "too normal".
See also
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Befunge examples needing attention (empty)
- Befunge Implementations (3 P)
- Befunge User (12 P)
Pages in category "Befunge"
The following 166 pages are in this category, out of 166 total.
2
A
C
D
F
G
H
L
- Langton's ant
- Last Friday of each month
- Leap year
- Least common multiple
- Linear congruential generator
- Literals/Integer
- Literals/String
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Infinite
- Loops/N plus one half
- Loops/While
- Luhn test of credit card numbers
M
P
Q
R
S
- Sailors, coconuts and a monkey problem
- Self-describing numbers
- Sequence of primes by trial division
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Sokoban
- Sort an integer array
- Sorting algorithms/Bubble sort
- Soundex
- Special characters
- String case
- Subleq
- Sudoku
- Sum and product of an array
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
T
- Taxicab numbers
- Temperature conversion
- Terminal control/Clear the screen
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Display an extended character
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Preserve screen
- Terminal control/Ringing the terminal bell
- The Twelve Days of Christmas
- Thue-Morse
- Tic-tac-toe
- Towers of Hanoi
- Two identical strings
- Two sum