With grammar (bnf form) and source code as input, Antlr is generating AST/Parse tree with tokens as terminals and "nil" as parent/root in this case.This is not appropriate tree. I came to know that grammar has to be rewritten in order to generate proper AST/Parse tree. But I couldnt find any appropriate rules to rewrite grammar.
Hi Peter/Ries , For generating parse tree, i am passing grammar and code fragment as input to ANTLR . ANTLR is generating one level trees with "nil" as root. I came to know that rules must be re-written to generate appropriate tree structure. I have gone through some sites but am not clear about the steps that are to be followed in re-writing rules.
Ries I have checked ANTLR website and experimented with some grammars but result is same. Finally I have found Javascript grammar which is re-written for ANTLR 4 and now am able to generate parse trees.
I would like to know the steps that are to be followed in rewriting grammar, so that ANTLR generates appropriate parse trees.
- Badges
- Science topic
- Similar topics
- Mathematics
- Algebra
- Matrix