Maybe I dreaming but maybe lady luck is with me today. Does anyone know of program, paper, algorithm that given a BNF grammar it will tell you what type of algorithm/parser can parse it.
Types of algorithms/parsers would be Regular Expression (RE), LL, LR, LALR, GLR, SLR and how much look ahead is needed? If another website is better for posting this, that would be appreciated. The tie into to ANTLR here is that the more I learn about parsing C++ the more the answer comes back GLR. 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.
