Miroirs/retroforth
1
0
Fork 0
mirror of https://git.sr.ht/~crc_/retroforth synced 2024-11-16 19:48:56 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix numerous spelling errors in examples (thanks hannah!)

Browse source 
FossilOrigin-Name: 23b5dceef1b2ffa39b1645792588425dd521d2c976af9d4b1bfb6c0452c36a32
This commit is contained in:
crc 2018-04-25 17:20:31 +00:00
parent e549b4ced6
commit 8a5716934f
6 changed files with 11 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
RELEASE_NOTES.md
View file

@ -26,4 +26,6 @@ Documentation:
Examples:
- fix numerous spelling errors (thanks hannah!)
Final Notes:

6
example/Atua-WWW.forth
View file

@ -11,7 +11,7 @@ prevents needing to handle socket I/O directly.
# Features
Atua is a minimal server targetting the the basic Gopher0 protocol. It
Atua is a minimal server targeting the the basic Gopher0 protocol. It
supports a minimal gophermap format for indexes and transfer of static
content.
@ -49,7 +49,7 @@ and provide some other helpers.
*Console Output*
The Gopher protocol uses tabs and cr/lf for signficant things. To aid
The Gopher protocol uses tabs and cr/lf for significant things. To aid
in this, I define output words for tabs and end of line.
~~~
@ -120,7 +120,7 @@ future.
'Server-Info var
~~~
These are just simple accessor words to aid in overall readability.
These are just simple words to aid in overall readability.
~~~
:requested-file (-s) @Requested-File ;

4
example/Atua.forth
View file

@ -9,7 +9,7 @@ prevents needing to handle socket I/O directly.
# Features
Atua is a minimal server targetting the the basic Gopher0 protocol. It
Atua is a minimal server targeting the the basic Gopher0 protocol. It
supports a minimal gophermap format for indexes and transfer of static
content.
@ -47,7 +47,7 @@ provide some other helpers.
*Console Output*
The Gopher protocol uses tabs and cr/lf for signficant things. To aid
The Gopher protocol uses tabs and cr/lf for significant things. To aid
in this, I define output words for tabs and end of line.
~~~

2
example/Chess.forth
View file

@ -36,7 +36,7 @@ Lowercase is used for black pieces, UPPERCASE for white.
'PPPPPPPPRNBQKBNR str:, #0 ,
~~~
The default board (named Blank) won't be direcly used. I create a second board for the actual gameplay.
The default board (named Blank) won't be directly used. I create a second board for the actual gameplay.
~~~
'Board d:create

2
example/hanoi.forth
View file

@ -34,7 +34,7 @@ Next, a quick word to setup all the variables.
:set-vars !Via !To !From !Num ;
~~~
Then, implementing the recursive alogrithim from the Wikipedia article:
Then, implementing the recursive algorithm from the Wikipedia article:
~~~
:hanoi (num,from,to,via-)

4
example/is-pangram.forth
View file

@ -1,6 +1,6 @@
A pangram is a scentence that uses all the letters in the alphabet.
A pangram is a sentence that uses all the letters in the alphabet.
This is one way to determine if a scentence is a pangram using RETRO.
This is one way to determine if a sentence is a pangram using RETRO.
First, define a string containing the alphabet: