how can i create a parse tree if i am using recursive descent parser
G->ET
like
g()
{E();T();
}.....

You have each child parsing function return the representation for the thing it has parsed. Then you combine the children return values into your return value. So the children will return trees and you'll combine these trees into a root node.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.