Parse Tree Inner nodes of a parse tree are non-terminal symbols. The leaves of a parse tree are terminal symbols. A parse tree can be seen as a graphical representation of a derivation. E→-E →-(E) →-(E+E) →-(id+E) →-(id+id E id id id CS308 Compiler Theory 10Parse Tree • Inner nodes of a parse tree are non-terminal symbols. • The leaves of a parse tree are terminal symbols. • A parse tree can be seen as a graphical representation of a derivation. E ⇒ -E E - E E - E E - E ⇒ -(E) ⇒ -(E+E) E E + E ( ) E ( ) E E E E - ( ) E E - ( ) ⇒ -(id+E) ⇒ -(id+id) E id E + id E + E id CS308 Compiler Theory 10