Gerald Rosenberg wrote: > As best I understand your questions, the answers are no, no, and no . . . > > Given an input "PAB", your given parser will construct an AST ^( ^( > PARENT A ) B ) and your given tree grammar will likewise match that. >
Actually, I don't think I understood you. You wrote "AST ^( ^( PARENT A ) B )". Can you describe the tree this notates? I can see it as a node sequence, but I don't know what tree structure it is describing. Thanks for the reply. Jay 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
