1. Do every exercise again trying to implement what I did in
some other way.

2. Write a program that reverses every line in a file.
	q home2_2.q filename

3. Write a program that finds the first character of every word in the file.
	q home2_3.q filename

4. Consider the version of the game nim in which the game starts
with some number N of sticks. In each term a player can take 1, 2, or 3 sticks.
The player who takes the last stick loses.
Player A begins. You are to design a two player Nim game involving
two communicating processes.
Thus, player A will choose some number of sticks, then send the
remaining number to B, who then chooses and sends the remaining
number back to A.
Implement B so that it plays any randomly chosen legal move
and A tries to play optimally.
Keep track of rounds as follows: number of sticks that player A sees,
number that player A takes, and number remaining after player B moves.

	q home2_4_A.q N
	q home2_4_B.q

Sample output assuming there are 22 sticks initially:

"I win"
22 1 19
19 2 15
15 2 10
10 1 8 
8  3 3 
3  2 0 


Hint: home2_4_B.q should act as a server, since it just needs to respond.
	

5. Possible final project: Write a linter for q that tries to find
syntax problems in programs (e.g. missing semicolons, potential
type errors) or bad style (e.g. nested loops).
