[antlr-interest] Automated BNF text combinations generator with constraints

[The Researcher]

I am sure this is an age old question and I did find some initial results on
Google.

I am looking for a program, preferably open source, that can generate all of
the text combinations for a given BNF. Obviously the program should allow
constraints to be set that limit such tings as number of characters in a
variable, number of variables in a type, number of terms, etc.

Specifically the grammar being tested is ISO 14882 2003, C++.

If none are found, has anyone attempted this using PROLOG?

Any comments or suggestions welcome.

Thanks Eric.