I did also look at some C++ BNF grammars.
Some of the grammars are useful while others are just not right. I did look at the link you referenced and it has helped in certain situations. From another comment on the GOLD Parser Yahoo pages, it looks like some of the reduce conflicts cannot be avoided for some context-free languages like C++. Especially with how many updates and configuration changes were made to it. What I will do is attach the current C++ grammar file (Gold Parser Grammar) I have once I get to my home pc. It honestly is fairly solid. A few issues here and there but the main issue I have with this is using the .NET COOK implementation vs. Calitha where if an error is encountered while parsing, there is no eligent recovery.
Calitha did implement this functionality by stepping through the parser until it would recover. I am currently looking at the COOK engine source and attempting to create a very useful recovery which I think makes sense: Clear the current reduction and go to the next line. Kind of like a rinse and repeat process. This will handle the few cases the parser cannot meet.
The biggest issue I have seen in the grammar is the Template Terminal. It can play some funky things to conditions (which was fixed, but now messes up #include Template rule).
I will add notes to the grammar before attaching it.