Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Corrections and updates to documentation #18

Merged
merged 2 commits into from
Nov 30, 2018
Merged

Corrections and updates to documentation #18

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
33a92ae
Better descriptions for `.` and `,` in Appendix A. (h/t @j4james)
cpressey Jun 5, 2018
b4bc630
Fix some typos, h/t @j4james
cpressey Sep 17, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 9 additions & 8 deletions doc/Befunge-93.markdown
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,15 +10,16 @@ Befunge-93 Documentation
Chris Pressey, Cat's Eye Technologies
*Original document September, 1993*
*Updated December, 1996*
*Updated Yet Again September, 2004*
*Converted from HTML to Markdown August 2012*
*Updated Yet Again September, 2004*
*Converted from HTML to Markdown August 2012*
*Updated for Silver Jubilee, 2018*

### The Basics of Befunge-93 ###

Most likely the most unique element of Befunge-93 programming is the
Program Counter (PC.) In almost all computer programming languages, the
program counter is continually moving forward through the program,
occassionally jumping to another spot in the code (but continuing
occasionally jumping to another spot in the code (but continuing
forward thereafter, nonetheless.)

The PC in Befunge-93, however, is subject to different rules. It may go
Expand Down Expand Up @@ -74,7 +75,7 @@ entire Befunge-93 program, this assumption is correct: the PC starts at
the upper-left of the torus and is initially oriented to execute
rightward.

NB. If the stack is be empty when you pop something off, be warned that
NB. If the stack is empty when you pop something off, be warned that
this will *not* generate an underflow! It will simply push a 0 value
onto the stack. Hope you can live with it!

Expand Down Expand Up @@ -211,7 +212,7 @@ the second. For example,

The last two commands that need to be explained are the ones that allow
you to examine and change the contents of the torus where the program is
stored. This 'playfield' can be used for auxilliary storage when the
stored. This 'playfield' can be used for auxiliary storage when the
stack alone will not suffice, but keep in mind that it also contains the
running program.

Expand Down Expand Up @@ -252,13 +253,13 @@ the same value as was put there with the `p` instruction.
: (dup) <value> <value> <value>
\ (swap) <value1> <value2> <value2> <value1>
$ (pop) <value> pops <value> but does nothing
. (pop) <value> outputs <value> as integer
, (pop) <value> outputs <value> as ASCII
. (output int) <value> outputs <value> as integer
, (output char) <value> outputs <value> as ASCII
# (bridge) 'jumps' PC one farther; skips
over next command
g (get) <x> <y> <value at (x,y)>
p (put) <value> <x> <y> puts <value> at (x,y)
& (input value) <value user entered>
& (input int) <value user entered>
~ (input character) <character user entered>
@ (end) ends program

Expand Down