Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: When PGN goes wrong?

Author: Tim Mann

Date: 18:10:57 10/18/00

Go up one level in this thread


On October 18, 2000 at 13:42:28, Dann Corbit wrote:
>The Winboard source has a nice PGN parser that is very tolerant of tom-foolery.

The reason it's so tolerant is that it was originally written before the PGN
standard, and was meant to parse any form of algebraic notation (with the
English piece names) that might be found in a Usenet post.  It didn't need much
work to parse PGN -- mostly just some code to parse PGN tags.

It's actually not so good on some of the more advanced PGN features.  It doesn't
understand variations (treating them as comments, and getting confused if they
are too deeply nested).  It ignores NAGs.  And if a comment is too long, it's
liable to overflow a buffer and crash -- blush.

If I ever write another one, it will be better.  :-)

    --Tim






This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.