Hi all, I'm curently working on a thesis project and I need to write tree grammars that translate ASTs produced by several parsers (Java, C, etc) into "generic" ASTs. These "generic" ASTs should only contain basic information about the source code being parsed such as function signatures, class names, etc.
I of course thought about ANTLR for this purpose but I'm facing some problems: * How can I define a set of imaginary tokens for this "generic" AST so that they can be reused in tree grammars? (such as JavaToGeneric.g, CToGeneric.g, etc) * If I only want a portion of an AST to be translated, can I use option "filter = true"? I don't know if I've been clear, I could give examples of what I am trying to accomplish if you need. If I'm going the wrong way, please tell me so. Thanks in advance for your help :) Robin 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.
