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. List: http://www.antlr.org/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address -- You received this message because you are subscribed to the Google Groups "il-antlr-interest" group. To post to this group, send email to il-antlr-inter...@googlegroups.com. To unsubscribe from this group, send email to il-antlr-interest+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
