Hi, I recently had to write a parser for a language that, like Prolog, allows definition of new operators and redefinition of the precedence, arity and associativity of existing operators. (I did use ANTLR and was forced to simply fix the default operator structure to that language's defaults, which technically means I didn't really implement that language, but it's the best I could do within the time I have available for what is a non-essential support tool in my project.)
Now, I'm virtually certain this cannot be done with ANTLR or any of its brethren, but I was wondering if anybody here knows how such things are handled? Are there in fact any parser generators that could handle such a language? Am I wrong in thinking ANTLR cannot? Thanks. Randall Schulz List: http://www.antlr.org:8080/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org:8080/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 -~----------~----~----~----~------~----~------~--~---
