Fixes in several README.md files

There are many more fixes to be made but I wanted these in. Even the files I have checked will have to be checked again in more detail but I needed these committed so I could fix something in another file that will need a new branch. More updates to README.md files will then be put into yet another branch if the pull requests have not yet been merged before I get to these updates (which really ought to be a lot of fun! :-) )
2023-02-18 05:11:35 -08:00
1 parent 659ee5e579
commit ef8720e2b7
@@ -15,6 +15,38 @@ program has a well known connection with the C programming language.
 This program is a unique variation on the age old "Hello, world"
 program.  What reads like a read may be written like a write!

+NOTE: this entry will probably not work under macOS with the Apple chips (Intel
+should be fine though we have no way to test this). Although it will compile
+cleanly it will not print anything out. More specifically, on modern systems one
+might need to specify `-m32` but the Apple chips which are arm64 based will not
+compile this entry:
+
+
+	ld: unknown/unsupported architecture name for: -arch armv4t
+	clang: error: linker command failed with exit code 1 (use -v to see invocation)
+	make: *** [anonymous] Error 1
+
+We were able to get it to work under linux on a 64-bit machine without
+specifying `-m32`. However this will fail under the Apple chips because it is
+arm64. If we specify `-arch i386` it will not compile:
+
+	Undefined symbols for architecture i386:
+	  "_write", referenced from:
+	      _read in anonymous-a2a56d.o
+	ld: symbol(s) not found for architecture i386
+
+
+If we add to the CFLAGS `-include unistd.h` we will run into another problem:
+
+
+	anonymous.c:2:25: error: conflicting types for 'read'
+	o, world!\n",'/'/'/'));}read(j,i,p){write(j/p+p,i---j,i/i);}
+				^
+	/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk/usr/include/unistd.h:472:10: note: previous declaration is here
+	ssize_t  read(int, void *, size_t) __DARWIN_ALIAS_C(read);
+		 ^
+
+
 Copyright (c) 1984, Landon Curt Noll.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety
@@ -19,7 +19,7 @@ to:
 	;++f)a[		b<<5|c]		=d++,b+=	e;for(		f=0;f<O
 	<<5|c]^=	a[b<<5		|c]^=a[		(k-(b+1		))<<5|c]

-I hope you have the C beautifier! The program accepts ONE positive
+I hope you have a C beautifier! The program accepts ONE positive
 argument.  Seeing is believing, so try things like:

 	./laman 4
@@ -28,6 +28,10 @@ argument.  Seeing is believing, so try things like:

 This code should run you in circles.

+NOTE: this program will likely segfault if you do not provide an argument and it
+will not print anything if the number is not positive or not a number.
+
+
 Copyright (c) 1984, Landon Curt Noll.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety
@@ -14,7 +14,7 @@ USA
 ## Judges' comments:

 The Judges believe that this is the best one line entry ever received.
-Compile on a UN*X system, or at least using a C implementation that
+Compile on a `UN*X` system, or at least using a C implementation that
 fakes it.  Very few people are able to determine what this program
 does by visual inspection.  I suggest that you stop reading this
 section right now and see if you are one of the few people who can.
@@ -35,8 +35,6 @@ program.  The file lievaart2.c contains what the program would have
 been without the size restriction.  This version has the full end game 
 logic and displays the board after each move!

-NOTE: This entry requires a non-standard K&R C compiler to compile.
-
 Copyright (c) 1987, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety
@@ -1,20 +1,20 @@
-Best Utility:
+## Best Utility:

 	Anthony C Howe
 	Mortice Kern Systems Inc.	#CL-23
 	35 King St. N			268 Phillip St.
-	Waterloo, On			Waterloo, On		
+	Waterloo, On			Waterloo, On
 	Canada, N2J 2W9			Canada, N2L 6G9


-Judges' comments:
+## Judges' comments:

    Make and run with a filename (writable or to be created) as an argument.
    For example, try:

 	make ant
 	cp ant.hint hill
-	ant hill
+	./ant hill

    Note that some old BSD systems may have trouble compiling this entry.
    They may complain about 'idlok' being undefined.  You can fix this
@@ -34,7 +34,7 @@ Judges' comments:
    in case you are still confused after read the source!  :-)


-Selected notes from the author:
+## Selected notes from the author:

    Ant's Editor vIOCCC91

@@ -11,8 +11,9 @@ Best Utility:
 Judges' comments:

   To use:
+
 	make am
-	am ant.test.mk
+	./am ant.test.mk
    
    Like much of Posix, obfuscation has its place.  Your task is to
    figure out where.
@@ -23,8 +24,8 @@ Judges' comments:

    We also suggest that you try:
 	make am
-	am Makefile am_clobber		<-- clobber everything except am
-	am Makefile all
+	./am Makefile am_clobber		<-- clobber everything except am
+	./am Makefile all


 Selected notes from the author:
@@ -97,12 +97,12 @@ Selected notes from the author:
      The simulated comparison operations only work with a certain
      range of numbers; numbers that are too large will cause the
      output code to fail to simulate the input code.  This means
-      that this implementation of babble would not be turing-complete,
+      that this implementation of babble would not be Turing-complete,
      even if the AE could process indefinitely-sized numbers.
      However, this is actually a constraint that no actual computer
      can meet, either, so we can conclude that if an AE, with
      card bins connected as suggested above, were hooked up to
-      a memory unit of sufficient size, it would be as turing
+      a memory unit of sufficient size, it would be as Turing
      complete as any existing machine (or, for those who
      interpret that excessively critically, i.e. "not at all" for
      both, we can simply say that the AE could simulate any
@@ -36,15 +36,15 @@ might help? :-)
 ## Author's comments:
 ### Remarks

-This program converts ascii text to morse audio file and vice versa. As far as
+This program converts ascii text to Morse audio file and vice versa. As far as
 I can tell, there are at least six chocolate references in this program.

-This program can convert text to morse to a raw 44.1kHz stereo audio file.
-Via streaming to mplayer, you can listen to the morse audio.
+This program can convert text to Morse to a raw 44.1kHz stereo audio file.
+Via streaming to mplayer, you can listen to the Morse audio.

 Don't forget the last '-' as it makes mplayer read from stdin.)

-## Convert audio file with morse signals to text
+## Convert audio file with Morse signals to text

    $ ./prog e < audio_file.raw

@@ -67,8 +67,8 @@ declaration in order for the program to run correctly:
 ### Known Issues

 The program uses a quite simple algorithm for detecting tone on and off events
-in the morse signal.   Hence the program  does not work well  with noisy input
-signals. I have tested it with several samples of man made morse recordings as
+in the Morse signal.   Hence the program  does not work well  with noisy input
+signals. I have tested it with several samples of man made Morse recordings as
 well as computer generated ones.

 Generally, any recording from ham  radio transmissions  does not decode due to