En op 08 september 2002 sprak [EMAIL PROTECTED]: > First, thanks and kudos to the refs. > You should be proud of running a great tournament.
Yes, well done Juho, Terje and Francesc. It must have been a difficult week for you... > To me, the best golf problems are those that allow > many different approaches and are instructive too. > So I rate this one very highly. I certainly learnt > a lot from this game. *Cough* I have never used > overload and never thought of it (unlike "beginner" > Kiwi Jas Nagra). I agree with you, partially. But a course can also be too hard. We have had courses in the past with more beginners than veterans. I'm afraid that the hole was too difficult for most beginners this time. Next month should be an easier hole, probably. In fact, this month's hole was so difficult that after a days work I still had no working solution. Unfortunately, my attempts failed at the longest test, and I nearly gave up on this hole. Only my embarrasment on being in the sandtrap forced me to stay in the race. > I would love to see a similar post mortem analysis here > of the the top N solutions. I liked the way Lars > classified each of the top 20 solutions into categories. > What are the categories here? I suppose, at least: > "operator overload", "top down parser (Recursive Descent)", > "bottom up parser", "operator stack", "recursive regex". What is stopping you? I'm afraid I wouldn't recognize any of these categories (except the overload one), so don't look at me. Oh, and you forgot the B::Deparse one. (-ugene -- Not that the story need be long, but it will take a long while to make it short. -- |-|enry |)avid 7`horeau
