PDN Implementation¶
This section contains concrete examples of PDN grammars.
DParser¶
[DParser] is a C parser generator.
pdn_reading.g
A fairly liberal reading grammar.pdn_writing.g
A PDN 3.0 writing grammar.fen.g
A grammar for FEN strings.timecontrol.g
A grammar for time controls.
Grammatica¶
[Grammatica] is a java parser generator.
pdn_reading.grammar
A fairly liberal reading grammar.pdn_writing.grammar
A PDN 3.0 writing grammar.fen.grammar
A grammar for FEN strings.timeControl.grammar
A grammar for time controls.
- The Grammatica grammars are LL(1) grammars. They define a move as a token to make this possible.
- The Grammatica grammars contain a workaround for move strengths, since the regular expressions in Grammatica do not behave correctly.
Toy Parser Generator¶
[TPG] is a python parser generator.
pdn_reading_tpg.py
A fairly liberal reading grammar.pdn_writing_tpg.py
A PDN 3.0 writing grammar.
Test files¶
games.zip
A collection of PDN games used for testing the grammars.
[DParser] | DParser, a GLR parser generator written in C http://dparser.sourceforge.net/ |
[Grammatica] | Grammatica, an LL parser generator written in java http://grammatica.percederberg.net/ |
[TPG] | Toy Parser Generator, a parser written in python http://cdsoft.fr/tpg/ |