Several README.md files updated

Typos / spelling errors and other such things. Many many more need to be
checked still.

2012/hamano/README.md

@@ -30,12 +30,12 @@ cc -xc hint.pdf -o hint
 ./hint
 ```
 
-Of course, You can also obfuscate c code:
+Of course, You can also obfuscate C code:
 
 ```sh
-echo 'void main(){puts("Hello World!");}' | ./hamano > hello.pdf
-cc -xc hello.pdf -o hello2
-./hello2 | gcc -xc - -o ./hello3
+echo 'int main(){puts("Hello World!");}' | ./hamano > hello.pdf
+cc -Wno-implicit-function-declaration -xc hello.pdf -o hello2
+./hello2 | gcc -Wno-implicit-function-declaration -xc - -o ./hello3
 ./hello3
 ```
 

2012/hou/README.md

@@ -25,7 +25,7 @@ less hou.c
 
 ./hou chk.txt hou.c | wc
 
-./hou markdown.txt remarks.markdown > remarks.htm
+./hou markdown.txt README.md > remarks.htm
 ```
 
 View the `remarks.htm` file in your web browser.
@@ -93,9 +93,9 @@ As an extra tweak, the text message actually does something useful. Remove the "
 
 ### References
 
-[1] [Russ Cox, Regular Expression Matching: the Virtual Machine Approach](http://swtch.com/~rsc/regexp/regexp2.html)
+[1][Russ Cox, Regular Expression Matching: the Virtual Machine Approach](http://swtch.com/~rsc/regexp/regexp2.html)
 
-[2] [Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...)](http://swtch.com/~rsc/regexp/regexp1.html)
+[2][Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...)](http://swtch.com/~rsc/regexp/regexp1.html)
 
 ## Copyright:
 

2012/vik/README.md

@@ -106,7 +106,7 @@ macros or helper methods that can be confusing,  I placed all functionality
 in the main function. Main is called recursively and quite extensively, but
 it gives  the benefit  that all  invocations of  the function  has the same
 parameters, argv and argc.   This really helps readability, as a programmer
-doesn’t need to remember several variable or function names.   I also tried
+doesn't need to remember several variable or function names.   I also tried
 to reduce the number of keywords,  and the program only  has four for-loops
 followed by a single return statement.  There is a little bit of use of the
 question mark operator,   but this is really  there to keep  the program as