S36_ConwayProblem implements Section 3.6 Conway's Problem: "Adapt the above program to replace every pair of consecutive asterisk by an upward arrow." Solution: [west::DISASSEMBLE||X::SQUASH||east::ASSEMBLE]
(cardfile chan []rune, lineprinter chan string)
source not stored for this graph (policy: none)