COMPILER DESIGN

Detailed explanation-1: -A parse tree or parsing tree or derivation tree or concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.

Detailed explanation-2: -A parse tree showing the values of attributes at each node is called an Annotated parse tree. The process of computing the attributes values at the nodes is called annotating (or decorating) of the parse tree. Of course, the order of these computations depends on the dependency graph induced by the semantic rules.

Detailed explanation-3: -The root of the parse tree is that start symbol. It is the graphical representation of symbol that can be terminals or non-terminals. Parse tree follows the precedence of operators.

Detailed explanation-4: -Syntax tree is a variant of parse tree. In the syntax tree, interior nodes are operators and leaves are operands. Syntax tree is usually used when represent a program in a tree structure.